Theorem Reciprocity of the lower-half construction
✓ theorem proved

Reciprocity of the lower-half construction

For the recursively constructed family and every comparable \(x\le y\), \[ \operatorname{reflect}_{d(x,y)}P_{x,y} =\sum_{z\le y}R_{x,z}P_{z,y} =\sum_{x\le z\le y}R_{x,z}P_{z,y}. \] Since \(\deg P_{x,y}\le d(x,y)\), the left side is also \(q^{d(x,y)}P_{x,y}(q^{-1})\).

Relation to the OpenAI notes

Explicit construction of the normalized family.

OpenAI notes: The conventions specify the ordinary R recurrence, the strict P degree bound and reciprocity, referring to the classical Kazhdan–Lusztig normalization. sec:introduction, eq:reciprocity.

Lean (primary): After constructing R, the development defines P by the negative lower half of the proper-upper defect. The reversed R-kernel proves that defect anti-reciprocal, yielding reciprocity. Separate uniqueness inductions identify the selected family with the construction. CanonicalKL:70, CanonicalKL:162, Bruhat:204, CanonicalKL:260, CanonicalKL:282.

Role in the proof: The KB presents the coefficient solution, defect identity, rank induction and seven normalization fields as a continuous construction. The classical selection interfaces are then identified with the explicit formulas.

Proof

Step 1. State the rank induction

Use strong induction on the natural rank difference \(d(x,y)\), for every comparable pair. The weak and strict degree bounds are already available from the recursive definition.

When \(x=y\), \(P_{x,x}=1\) and reflection in degree zero fixes one. In the lower-ideal sum, the term \(z=x\) is \(R_{x,x}P_{x,x}=1\).

For any other \(z\le x\), the comparison \(x\le z\) would force \(z=x\) by antisymmetry. Hence \(R_{x,z}=0\), and every other term is zero. This proves the diagonal case.

Step 2. Verify each smaller induction instance

Now take \(x<y\), and write \(d=d(x,y)>0\). For every \(z\) with \(x<z\le y\), \[ d(z,y)=\ell(y)-\ell(z)<\ell(y)-\ell(x)=d. \] The induction hypothesis at \((z,y)\) therefore gives exactly \[ \operatorname{reflect}_{d(z,y)}P_{z,y} =\sum_{t\le y}R_{z,t}P_{t,y}. \]

Step 3. Obtain the current anti-reciprocal defect

The defect anti-reciprocity theorem applies to the equations in Step 2. Its degree hypotheses hold by the already proved R and recursive-P bounds. It gives \[ \operatorname{reflect}_dD_{x,y}=-D_{x,y}. \]

Step 4. Solve the defect equation

By the defining recursion, \(P_{x,y}=-\operatorname{low}_dD_{x,y}\). The lower-half solution theorem, applied to Step 3, yields \[ \operatorname{reflect}_dP_{x,y}=P_{x,y}+D_{x,y}. \] The full-sum identity for \(D_{x,y}\) identifies the right side with \(\sum_{z\le y}R_{x,z}P_{z,y}\). This proves the new induction case.

Step 5. Restrict the sum to the interval

A term with \(z\le y\) but \(x\not\le z\) has \(R_{x,z}=0\). Removing those terms gives the sum over \([x,y]\).

The degree bound permits reciprocal evaluation of the reflected polynomial, giving the displayed power notation and completing the proof.

References

The local source declarations below give the construction and proof.

Lean formalization

OAI.KLInvariance.CanonicalP.polynomial_reciprocity: CanonicalKL.lean:162.

Used by