Local intersection data and related character conditions
Graded duality keeps track of both a linear pairing and its effect on homogeneous degrees. The local intersection map is obtained from the actual costalk-to-dual construction and is expressed by a matrix after choosing homogeneous stalk coordinates. Its image, symmetry and degree behavior are separate properties with separate proofs.
For a nonzero diagonal entry, the positive ideal and the minimality of the boundary construction give the strict degree bound. It is connected to two quantified conditions appearing in related results: full outgoing-kernel freeness and identification of stalk characters with the canonical polynomial data. The definitions of these conditions specify exactly which modules, vertices and equalities are involved.
The main comparison uses the constructed pairing and actual character reciprocity to obtain its numerical endpoints. The conditional character-identification results explain further consequences under their stated hypotheses. Reading the construction before the condition interfaces makes the role of each statement and its assumptions explicit.
Reading sequence
- The local intersection map and its matrix — Define the map and its coordinate matrix.
- Image, symmetry, and grading of the local intersection map — Prove image, symmetry and grading properties.
- A nonzero local diagonal forces a strict half-degree bound — Derive the diagonal degree inequality.
- The full outgoing-kernel freeness condition — Read the full-kernel freeness condition.
- The stalk-character identification condition — Read the character-identification condition.
- KL endpoint formulas under character identification — Follow the conditional endpoint substitution.