Cluster k0636
Symbols, generators and independence of leading monomials
These files deal with "symbols" and "generators", project terms for specific polynomials built from letters. Statements say that families of products of variables and special polynomials are linearly independent (no one is a combination of the others) when their leading terms in a column-lexicographic order are all different and have coefficient one. Others claim a geometric size bound on letters in a segment, a polynomial identity modulo a power of a prime, and a projection step to something called an isotypic piece (the part of a module of one irreducible type). Many results are conditional on named covariant-degree claims.
4 import steps from the main theorem.
Proof status: on 21 Nov 2026 the Lean FRO and the Mathlib Initiative certified the Lean statement and proof (latest check). Names and descriptions on this map are written by Claude from samples of the code and may be wrong.
Prerequisite concepts
PolynomialsLinear algebraDiscrete valuation rings: numbers with one prime, and reducing mod itGroups as matrices: representations and characters
Uses
Used by
17 Lean files, main folder Formalism.SharpRestriction.GrowthBounds.PathWeight.