From sheaf duality to character reciprocity and endpoints
A homogeneous free stalk has a character recording the degrees of its basis vectors. The proof also studies the full outgoing kernel at that vertex. Section duality relates these kernels to dual stalk data, with the grading shift supplied by the actual pairing.
The word construction first provides controlled characters and pairings. Decomposition into boundary-sheaf pieces then gives the character relations for the actual boundary sheaf. The reciprocity theorem expresses the full-kernel and stalk characters through the normalized R-family. Scaling these characters gives the initial and final values of a complete edge schedule.
These are characters of the constructed sheaf modules. Their endpoint identities are used when the R-comparison becomes exact in the simultaneous invariance induction. Canonical KL identification is a later polynomial step. The reading sequence keeps the character definition, the duality argument and the endpoint substitution connected in their proof order.
Reading sequence
- The intrinsic graded-rank polynomial of a free module — Define the degree-counting character.
- Supported sections are dual to a generated stalk — Relate supported sections and stalk duals.
- The outgoing-kernel character of a reduced word — Compute the word-kernel character.
- Boundary kernel characters and their degree bound — Pass to the actual boundary kernel.
- R-reciprocity for the actual boundary-sheaf character — Prove R-reciprocity for the actual character.
- Scaled reciprocity and its restriction to an upper interval — Apply the numerical scaling.
- Normalized empty and full kernels from the actual character — Read the endpoint identities.