Theorem Normalized empty and full kernels from the actual character
✓ theorem proved

Normalized empty and full kernels from the actual character

Fix a finite-generator Coxeter system, a basis of its extended realization, and the actual normalized boundary sheaf \(B\) on \([1,b]\). Let its coefficient algebra have \(N\) degree-one variables.

For \(x\in[1,b]\) and \(0<t<1\), write \[ D_x(t,F)=(1-t^2)^N t^{-d(x,b)}H_{L_x(F)}(t^2), \] where \(d(x,b)=\ell(b)-\ell(x)\). The selected outgoing kernel is \[ L_x(F)=\{m\in B^x:\rho^-_e(m)=0\text{ for every }e\in F\}, \] with the grading induced from the stalk. Its Hilbert value is \[ H_{L_x(F)}(q)=\sum_{n\ge0}\dim_{\mathbb R}(L_x(F))_n\,q^n \qquad(0<q<1). \] Writing \(c_x^b(t)=t^{-d(x,b)}C_{x,b}(t^2)\) for the scaled actual-stalk character, one has \[ D_x(t,\varnothing)=c_x^b(t),\qquad D_x(t,\mathrm{all})=c_x^b(t^{-1}). \] These formulas also hold for the restriction of this same boundary sheaf to an upper interval \([a,b]\).

Relation to the OpenAI notes

Different intermediate statement.

OpenAI notes: The grading-normalization proposition identifies the stalk graded rank with the canonical KL polynomial and uses the Elias–Williamson character theorem through the cited moment-graph bridges. bg:normalization.

Lean (primary): The development defines the equality of actual stalk characters and canonical KL polynomials as StalkCharacterObligation. The unconditional theorem used in the main route is R-reciprocity for the actual character. The local strict half-degree implication retains an explicit nonzero-diagonal hypothesis. SheafMorphisms:219, DyerPaths:62, PositiveTransfer:186, CharacterReciprocity:1807, TerminalKernels:1273, TerminalKernels:1284.

Role in the proof: The comparison uses the actual character C and its proved R-reciprocity. Canonical P is handled by the later polynomial-rigidity induction. The local degree result applies to a diagonal coefficient satisfying its stated nonvanishing hypothesis.

Proof

Step 1. Evaluate the empty-condition module

With no outgoing conditions, \(L_x(\varnothing)=B^x\): the defining vanishing requirement is vacuous.

The free-stalk Hilbert formula therefore gives \[ H_{L_x(\varnothing)}(t^2) =C_{x,b}(t^2)(1-t^2)^{-N}. \] Since \(0<t<1\), the scalar \(1-t^2\) is nonzero. Multiplying by the state scale cancels its \(N\)-th power: \[ D_x(t,\varnothing)=t^{-d(x,b)}C_{x,b}(t^2)=c_x^b(t). \]

Step 2. Evaluate the full outgoing kernel

The actual boundary's section duality has pairing shift \(\ell(b)\). Its incoming-edge count at \(x\) is \(\ell(x)\). The stalk–costalk Hilbert formula thus gives \[ H_{L_x(\mathrm{all})}(t^2) =(t^2)^{d(x,b)}C_{x,b}(t^{-2})(1-t^2)^{-N}. \] The Hilbert sum is evaluated at \(t^2\in(0,1)\); \(C_{x,b}(t^{-2})\) is a finite polynomial evaluation.

Step 3. Cancel the scale at the full kernel

Again the coefficient factors cancel. The remaining power is \[ t^{-d(x,b)}(t^2)^{d(x,b)} =t^{d(x,b)}=(t^{-1})^{-d(x,b)}. \] Hence \[ D_x(t,\mathrm{all}) =t^{d(x,b)}C_{x,b}(t^{-2}) =c_x^b(t^{-1}). \]

Step 4. Check restriction to an upper interval

For \(x\in[a,b]\), every outgoing edge \(x\to y\) of the original \([1,b]\) graph has \(a\le x<y\le b\). Thus all its outgoing conditions remain in the upper-interval restriction. The vertex modules and restriction maps are unchanged under their natural identifications.

Consequently both the empty-condition module and the full outgoing kernel are the same modules before and after restriction. The state scale uses the same \(\ell(x),\ell(b)\) and \(N\), so the two identities persist.

Step 5. Evaluate the one-edge example

For \([1,s]\), \(C_{1,s}=C_{s,s}=1\). At the lower vertex, \(d=1\), the empty kernel is \(A\), and the full kernel is \(\alpha_s A\). The normalized values are \[ D_1(t,\varnothing)=t^{-1},\qquad D_1(t,\mathrm{all})=t. \] At the top vertex, both values are \(1\). These are the actual-character vectors appearing at the ends of a schedule.

References

The local source declarations below give the construction and proof.

Lean formalization

OAI.KLInvariance.BruhatGraph.ActualBoundary: PositiveTransfer.lean:94.

OAI.KLInvariance.BruhatGraph.actualSectionDuality: PositiveTransfer.lean:100.

OAI.KLInvariance.BruhatGraph.actualSectionDuality_homogeneous: PositiveTransfer.lean:119.

OAI.KLInvariance.BruhatGraph.emptyKernel_hilbert: PositiveTransfer.lean:677.

OAI.KLInvariance.BruhatGraph.normalized_emptyKernel_scaledStalk: TerminalKernels.lean:1273.

OAI.KLInvariance.BruhatGraph.normalized_fullKernel_scaledStalk: TerminalKernels.lean:1284.

OAI.KLInvariance.BruhatGraph.normalized_emptyKernel_restrictBoundary: PositiveTransfer.lean:793.

OAI.KLInvariance.BruhatGraph.normalized_fullKernel_restrictBoundary: PositiveTransfer.lean:800.

Used by