Cluster k0635
Pairing index bounds and lattice edges for row actions
These files continue the study of Weyl and dual Weyl polynomial modules, now in a setting where lattices are compared at several primes. One statement says that over a field of characteristic zero the Weyl module and the dual Weyl module are equal. Others cover a reordering fact, operators that preserve lattices, and an "edge" claim saying that moving between two neighbouring lattices is given by explicit invertible matrices times a diagonal factor. A further statement turns a derivative of a power series into a sum over a pairing. Many are definitions of claims or proofs from other 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 algebraFormal power series: infinite polynomials with no convergenceGroups as matrices: representations and charactersValuation rings and lattices over them
References
Fulton and Harris, Representation Theory: A First Course · lecture 6 and lecture 15Background reading suggested by the AI namer · unchecked
Uses
Used by
24 Lean files, main folder Formalism.LocalToGlobal.PairingIndexBounds.RowActionCoefficients.AdmissibleInterpolation.