Cluster k0604
Gelfand-Tsetlin bases and path polynomials
These files build bases (standard sets of building blocks) for spaces of polynomials from "paths", which are step-by-step sequences of integer lists, in the style of Gelfand and Tsetlin patterns from representation theory. Statements say the path polynomials are independent, span the target space, and have specific degrees; others are counting claims. A small block gives Cramer's rule, a classical determinant formula for solving linear systems. Several results are stated as conditional claims that assume a counting statement. Terms are the project's own and the overall role is partly a guess.
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
Linear algebraPolynomialsFinite sets and countingExterior powers and wedge productsGroups as matrices: representations and characters
References
Fulton and Harris, Representation Theory: A First Course · lecture 8 and lecture 15Background reading suggested by the AI namer · unchecked
Uses
Used by
33 Lean files, main folder Formalism.ThetaLogCoordinates.JacobiPathWeights.JacobiMinorProofs.