Cluster k0422
Log-Vandermonde, hook bounds and arithmetic size estimates
This large cluster mixes many explicit inequalities. One says finite subgroups of the invertible rational matrices have order dividing a fixed number (a Minkowski bound). Others bound logs of ratios of "places" in a large parameter, control Vandermonde-type products, bound sums over partitions using hook lengths, give a numerical prime-counting sandwich, and bound operator norms of block matrices. Each statement is a concrete analytic estimate, often with long lists of parameters. The theme is size control rather than structure. The files do loosely related jobs, so I mark the grouping mixed.
3 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
Primes and divisibilityGroups and homomorphismsLinear algebraFinite sets and countingReal analysisChebyshev functions theta and psi
References
Sagan, The Symmetric Group · ch. 3 (hook length formula)Background reading suggested by the AI namer · unchecked
Uses
Used by
79 Lean files, main folder Formalism.GL3MeanSquares.HookFormulaTorsion.