Cluster k0640
Weyl dimension counts and comparing two-letter polynomial lattices
These files compare two ways of describing the same polynomial spaces: a "two-letter" model, where variables come in two copies, and the dual Weyl module attached to a dominant weight. One statement says there is a surjective map between them whose kernel is the multiples of a fixed polynomial, matching lattices over a ring with one prime. Others give a dimension formula as a product over pairs of indices (the Weyl dimension formula) and a dimension count that factors into polynomial and harmonic pieces. A "cloud" statement says dividing by a uniformising element stays inside a tensor lattice. Many results are conditional on named claims.
5 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 itTensor products of rings and algebrasGroups as matrices: representations and charactersFinite sets and counting
References
Fulton and Harris, Representation Theory: A First Course · lecture 6 and lecture 15 (Weyl dimension formula)Background reading suggested by the AI namer · unchecked
Uses
Used by
19 Lean files, main folder Formalism.SharpRestriction.GrowthBounds.ColumnSpanDensity.