Cluster k0607
Counting Gelfand-Tsetlin paths and the Pieri rule
These files count the "standard" paths used to index bases, and link the counts to dimensions of representations (ways a group acts on a vector space). One statement says the number of standard index sets for a decreasing integer list equals a quantity called dGT. Others give the number of continuations when a path is extended by a column of a given height, and show that a Pieri-type rule follows from a branching rule. Some files are matrix identities about sums over subsets, with signs. The folder names mention dual Weyl coordinates and Vandermonde rank estimates.
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
Finite sets and countingGroups as matrices: representations and charactersLinear algebraPermutations, sign and inversions
References
Fulton and Harris, Representation Theory: A First Course · lecture 8 and lecture 6Background reading suggested by the AI namer · unchecked
Uses
Used by
25 Lean files, main folder Formalism.ThetaLogCoordinates.DualWeylCoordinates.DualWeylProofs.