Cluster k0644
Binomial-ratio segment bounds in column systems
These files hold many small claims about "segments", the project's name for pieces of a chain of parameters, and about counting how many items lie below a level. The shared wrapper "TransportedAlt" suggests the claims are restated for several constant choices. The statements include a points lemma for segments, remainder bounds that follow from a lower-segment claim, a dimension product formula, and an exponent inequality that compares exponentials of reciprocals of r+1. Dimension facts about rings (Krull dimension, the length of the longest chain of prime ideals) appear in one claim. Most results prove one claim from another.
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
Finite sets and countingReal analysisPrime ideals, coordinate rings and dimension of a solution setPolynomials
Uses
Used by
33 Lean files, main folder Formalism.SharpRestriction.GrowthBounds.BinomialRatio.