Theorem Anti-reciprocity of the recursively constructed defect
✓ theorem proved

Anti-reciprocity of the recursively constructed defect

Fix \(x<y\), put \(d=d(x,y)\), and let \(P\) be the recursive family. Assume its reciprocity equation is already proved for every proper upper pair \((z,y)\), \(x<z\le y\): \[ \operatorname{reflect}_{d(z,y)}P_{z,y} =\sum_{t\le y}R_{z,t}P_{t,y}. \] Then its current defect satisfies \[ \operatorname{reflect}_dD_{x,y}=-D_{x,y}. \] This conditional calculation is the induction step inside the Lean proof of full reciprocity.

Proof

Step 1. Verify the degrees for reflecting each product

For \(x<z\le y\), \[ d(x,z)+d(z,y)=d(x,y)=d. \] The R-degree theorem gives \(\deg R_{x,z}\le d(x,z)\); the recursive P-degree theorem gives \(\deg P_{z,y}\le d(z,y)\).

The bounded product-reflection identity therefore applies: \[ \operatorname{reflect}_d(R_{x,z}P_{z,y}) =\overline R_{x,z}\, \operatorname{reflect}_{d(z,y)}P_{z,y}. \]

Step 2. Substitute the smaller reciprocity equations

Reflection preserves finite sums. Using Step 1 and the stated induction data, \[ \begin{aligned} \operatorname{reflect}_dD_{x,y} &=\sum_{x<z\le y} \overline R_{x,z}\operatorname{reflect}_{d(z,y)}P_{z,y}\\ &=\sum_{x<z\le y}\overline R_{x,z} \left(\sum_{t\le y}R_{z,t}P_{t,y}\right). \end{aligned} \] Both index sets are finite lower-ideal subsets.

Step 3. Interchange the sums and evaluate the inner kernel

Distribute each product and interchange the two finite sums: \[ \operatorname{reflect}_dD_{x,y} =\sum_{t\le y} \left(\sum_{x<z\le y}\overline R_{x,z}R_{z,t}\right)P_{t,y}. \] The proper R-kernel theorem applies to each \(t\le y\), giving \[ \operatorname{reflect}_dD_{x,y} =\sum_{t\le y}(\delta_{x,t}-R_{x,t})P_{t,y}. \]

Step 4. Evaluate the Kronecker-delta sum

Because \(x\le y\), the index \(t=x\) is in the sum. Its delta coefficient is one; every other delta coefficient is zero. Therefore \[ \sum_{t\le y}\delta_{x,t}P_{t,y}=P_{x,y}. \] Separate the two terms in Step 3: \[ \operatorname{reflect}_dD_{x,y} =P_{x,y}-\sum_{t\le y}R_{x,t}P_{t,y}. \]

Step 5. Recognize the defect again

The full-sum identity for the defect is \[ D_{x,y}=\sum_{t\le y}R_{x,t}P_{t,y}-P_{x,y}. \] Negating it identifies the expression from Step 4 with \(-D_{x,y}\), as required.

The occurrence of \(P_{x,y}\) in Step 4 is algebraic: it comes from the delta term and cancels in the defect identity. The reciprocity equations used as inputs were only those with strictly smaller rank \(d(z,y)\).

References

The local source declarations below give the construction and proof.

Lean formalization

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

OAI.KLInvariance.CanonicalP.defect_full_sum: CanonicalKL.lean:124.

OAI.KLInvariance.CanonicalP.reversed_kernel_on_proper: CanonicalKL.lean:149.

Used by