Theorem A nonzero local diagonal forces a strict half-degree bound
✓ theorem proved

A nonzero local diagonal forces a strict half-degree bound

Fix a finite-generator Coxeter system and the polynomial coefficient algebra \(A\) from a finite real basis of its extended realization. Let \(B(b)\) be the actual normalized boundary sheaf on \([1,b]\), and let \(x<b\).

Choose a finite nonnegative homogeneous \(A\)-basis \((m_i)\) of \(B(b)^x\), with degrees \(d_i\in\mathbb N\), and write \(\lambda_i=m_i^*\). Let \(I_x\) be the actual local intersection map. For any specified basis index \(i\), if \[ a_{ii}:=\lambda_i(I_x\lambda_i)\ne0, \] then \[ 2d_i<d(x,b),\qquad d(x,b)=\ell(b)-\ell(x). \]

Relation to the OpenAI notes

Different intermediate degree statement.

OpenAI notes: The normalization proposition identifies stalk graded ranks with canonical KL polynomials using the cited character theorem and a conversion from degree-two to degree-one labels. bg:normalization, eq:bg-ranks.

Lean (primary): The actual local intersection map is constructed from integral stalk–costalk duality. Boundary minimality puts its image in the positive ideal, and the strict degree theorem assumes that the specified diagonal coefficient is nonzero. PositiveTransfer:132, PositiveTransfer:160, PositiveTransfer:186.

Role in the proof: The local calculation gives \(2d_i<\ell(b)-\ell(x)\) for the basis generator named in that nonzero-diagonal hypothesis. Actual-character reciprocity supplies the endpoint identity in the comparison route.

Proof

Step 1. Determine the dual and image degrees

The coordinate functional \(\lambda_i\) has degree \(-d_i\): \[ \lambda_i(B(b)^x_j)\subseteq A_{j-d_i}. \] The local intersection grading, with shift \(d=d(x,b)\), gives \[ I_x\lambda_i\in B(b)^x_{d-d_i}. \] Applying \(\lambda_i\) once more yields \[ a_{ii}\in A_{d-2d_i}. \]

Step 2. Use the proper-vertex minimality condition

The hypothesis \(x<b\) makes \(x\) a vertex different from the distinguished top. The local intersection properties theorem gives \[ \operatorname{im}I_x\subseteq A_+B(b)^x. \] Consequently \(I_x\lambda_i\) is a finite sum \(\sum_s c_sv_s\) with \(c_s\in A_+\). Linearity gives \[ a_{ii}=\sum_s c_s\lambda_i(v_s)\in A_+. \]

Step 3. Apply the positive-ideal degree lemma

The coefficient \(a_{ii}\) is nonzero by the stated hypothesis. Together with Steps 1 and 2, the positive-ideal diagonal-degree theorem gives \[ d-2d_i>0. \] Its proof excludes negative degree using \(A_n=0\) for \(n<0\), and excludes degree zero using \(A_+=\ker\epsilon\) and \(\epsilon(a)=a\) on \(A_0\).

Step 4. Convert to the natural rank difference

Bruhat comparison gives \(\ell(x)\le\ell(b)\), so the integer difference \(\ell(b)-\ell(x)\) equals the natural subtraction used in rankDifference. The basis degrees are natural numbers as well. Hence the integer inequality in Step 3 is exactly \[ 2d_i<\operatorname{rankDifference}(x,b). \] This is the conclusion of localIntersection_diagonal_strict_degree for the chosen index and nonzero diagonal coefficient.

References

The local source declarations below give the construction and proof.

Lean formalization

OAI.KLInvariance.BruhatGraph.localIntersection_diagonal_strict_degree: PositiveTransfer.lean:186.