Graded coefficients, module data and Hilbert calculations
A grading decomposes a vector into finitely many homogeneous components, and a homogeneous map shifts those components by a specified integer. The generic component and Hilbert lemmas are formulated for integer-indexed decompositions. The graded module data used at sheaf vertices and edges add two concrete requirements: finite generation over the coefficient algebra and zero pieces in negative degrees.
Finite homogeneous covers prove that polynomial modules have finite-dimensional pieces and convergent Hilbert values in the comparison range. Scalar quotients, saturated images and homogeneous injections then provide exact transformations of those values. The homogeneous image shift contributes \(q^d\), while the saturated image formula contributes \(1-q^d\).
These formulas supply the numerical content of the main proof's edge comparison. The polynomial denominator is removed by the state scale, and the correction degree makes the transfer coefficient uniform. The reading route begins with components and the actual module-data fields, then develops the image and Hilbert calculations used in that normalization.
Reading sequence
- Graded components and homogeneous projection — Define the homogeneous pieces.
- Finite nonnegatively graded module data — Read all fields of the actual sheaf module data.
- Components under homogeneous maps and scalar multiplication — Track components through maps.
- Hilbert functions, formal series and numerical values — Define the numerical Hilbert value.
- Finite graded polynomial modules have convergent Hilbert values — Prove piece finiteness and convergence.
- Homogeneous image pieces and their Hilbert degree shift — Compute a homogeneous image shift.
- The Hilbert value of an actual saturated image — Compute the actual scalar-quotient image.
- Kernel Hilbert values and normalized states — Enter the normalized comparison.