Cluster k0986
Flow and counting inequalities with odd levels
These files state combinatorial inequalities. One says a quantity built from a flow on a cycle of integers modulo d is bounded by a sum of weights, up to a constant. Others say a maximum flow is attained, that a sum of binomial coefficients lying in an additive subgroup for a window of shifts stays there for all shifts, and that a root expression like (1+r)^(1/d) minus (1-r)^(1/d) is at most three times r for small r. A list of numeric facts about a prime l at least 5 and odd exponents also appears. The role looks like pure bookkeeping inequalities feeding a larger bound. Many statements are Prop-valued claims. Details are uncertain.
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
Real analysisInfinite seriesFinite sets and countingModular arithmeticPrimes and divisibility
References
Ravindra Ahuja, Thomas Magnanti and James Orlin, Network Flows · ch. 6 (maximum flow)Background reading suggested by the AI namer · unchecked
Uses
Used by
30 Lean files, main folder Formalism.IncomingBounds.FlowDegreeBounds.