Definition The intrinsic graded-rank polynomial of a free module
✓ definition formalized

The intrinsic graded-rank polynomial of a free module

Let \(k\) be a field and \(A=k[X_1,\ldots,X_N]\) with variables in degree one, and let \(M\) be finite free and nonnegatively graded. Choose a finite homogeneous basis \(e_i\), with degrees \(d_i\in\mathbb N\). Its basis-degree polynomial is \[ p_e(z)=\sum_i z^{d_i}\in\mathbb Z[z]. \] The coefficient of \(z^n\) counts basis vectors of degree \(n\), so every coefficient is a nonnegative integer.

The homogeneous-basis theorem supplies such a basis. Nonnegativity of the grading makes its degrees nonnegative: a nonzero basis vector cannot belong to a negative piece, because that piece is zero.

The source's character

The source selects a nonnegative homogeneous basis and defines \[ \operatorname{ch}(M;z)=p_e(z). \] Basis independence proves that every homogeneous basis yields the same polynomial. Thus it is intrinsic to the graded module.

The notes denote this same generator-counting expression by \[ \operatorname{grk}_A(M;z)=\operatorname{ch}(M;z). \] The local names are Graded.character and, for bundled module data, ModuleData.char.

For basis degrees \(0,2,2\), the character is \(1+2z^2\). Evaluation at \(z=1\) counts the three \(A\)-basis vectors.

Relation to the full graded vector space

Every basis generator can be multiplied by coefficient monomials. The Hilbert formula counts all those resulting vectors: \[ \operatorname{Hilb}(M;z) =\frac{\operatorname{ch}(M;z)}{(1-z)^N}. \] At \(0<q<1\), the corresponding convergent value is \[ H_M(q)=\frac{\operatorname{ch}(M;q)}{(1-q)^N}. \] Thus the character is the numerator after removing the polynomial-ring contribution.

For \(A=k[X]\) and \(M=A\oplus A(2)\), the character is \(1+z^2\). The Hilbert coefficients are \(1,1,2,2,\ldots\), because every generator has its full sequence of powers of \(X\) as multiples.

Characters add under finite graded sums, and shifting all generator degrees upward by \(d\) multiplies the character by \(z^d\). The character-operations theorem proves these formulas by transporting actual bases.

References

The local source declarations below give the construction and proof.

Lean formalization

OAI.KLInvariance.Graded.NonnegativeBasis.polynomial: SheafMorphisms.lean:47.

OAI.KLInvariance.Graded.NonnegativeBasis.coeff_nonneg: SheafMorphisms.lean:51.

OAI.KLInvariance.Graded.NonnegativeBasis.eval₂_eq: SheafMorphisms.lean:58.

OAI.KLInvariance.Graded.character: SheafMorphisms.lean:89.

OAI.KLInvariance.Graded.character_coeff_nonneg: SheafMorphisms.lean:93.

OAI.KLInvariance.Graded.character_eq: SheafMorphisms.lean:98.

OAI.KLInvariance.Graded.ModuleData.char: SheafMorphisms.lean:1742.

Used by