Stalks and kernels of the lower-supported Bruhat models
Fix a finite-generator Coxeter system, a lower interval \([1,b]\), and a real basis of the extended realization, giving its polynomial coefficient algebra. Let \(O_c\) be the boundary model centered at \(c\le b\), obtained from the actual boundary sheaf on \([1,c]\).
Every full outgoing kernel of \(O_c\) is free. For \(x\le c\), its stalk and kernel characters are \[ C_{O_c}(x;q)=C_{x,c}(q), \] \[ K_{O_c}(x;q) =q^{\ell(c)-\ell(x)}C_{x,c}(q^{-1}). \] For \(x\not\le c\), both characters are zero.
Proof
Step 1. Identify the stalk inside the lower ideal
At \(x\le c\), the lower-extension identification and the graph identification with \([1,c]\) give \[ O_c^x\simeq B(c)^x \] as graded modules. Hence their characters are equal, giving the first formula.
Step 2. Identify all outgoing kernel conditions
An outgoing edge from \(x\) whose target is at most \(c\) is exactly an outgoing reflection edge in the graph of \([1,c]\). Its restriction agrees with the corresponding restriction of \(B(c)\) under the stalk identification.
An outgoing edge with target outside the lower ideal has zero \(O_c\)-edge module. Its restriction is zero and imposes no additional condition.
Thus the same stalk identification restricts to a graded isomorphism \[ K_x(O_c)\simeq K_x(B(c)). \]
Step 3. Use the boundary costalk duality
The boundary-kernel character theorem makes \(K_x(B(c))\) finite free and computes its homogeneous basis from the stalk dual. Its homogeneous basis degrees are \[ \ell(c)-\ell(x)-d_i, \] where \(d_i\) are the basis degrees of \(B(c)^x\). The kernel is nonnegative, so these exponents are nonnegative.
Therefore \[ \operatorname{ch}(K_x(B(c));q) =\sum_iq^{\ell(c)-\ell(x)-d_i} =q^{\ell(c)-\ell(x)}C_{x,c}(q^{-1}). \] This is a polynomial: the displayed sum writes all its exponents as nonnegative integers. Step 2 transfers its freeness and character to \(O_c\).
Step 4. Evaluate outside the support
If \(x\not\le c\), the model support gives \(O_c^x=0\). Its outgoing kernel, a submodule of that stalk, is zero as well. Both are free of rank zero and have zero character.
The source packages the first piecewise formula as the lower character, assigning zero outside \(x\le c\), and packages the second by polynomial reflection.
References
The local source declarations below give the constructions and proofs.
Lean formalization
OAI.KLInvariance.MomentGraph.GradedSheaf.lowerExtend_kernel_iff: CharacterReciprocity.lean:1847.
OAI.KLInvariance.MomentGraph.GradedSheaf.lowerExtendKernelEquiv: CharacterReciprocity.lean:1867.
OAI.KLInvariance.MomentGraph.GradedSheaf.lowerExtendKernelEquiv_graded: CharacterReciprocity.lean:1877.
OAI.KLInvariance.BruhatGraph.lowerKernelEquiv: CharacterReciprocity.lean:1922.
OAI.KLInvariance.BruhatGraph.boundaryModels_character: Decomposition.lean:108.
OAI.KLInvariance.BruhatGraph.boundaryModels_kernelFree: CharacterReciprocity.lean:1936.
OAI.KLInvariance.BruhatGraph.boundaryModels_kernelCharacter: CharacterReciprocity.lean:1947.
OAI.KLInvariance.BruhatGraph.lowerCharacter: Decomposition.lean:104.