claimroutineinferred_dep
Sharpened expansion bound from maximality
Claim·§2.3 Degree control and a maximizing rectangle·inside propIncidence piece with degree and expansion control
Statement (paper)
For every and , with counting fractions and , one has , where is independent of the chosen subsets. For feasible subsets () optimality gives , and for infeasible subsets uniformly.
In plain English
For all and with fractions , , where does not depend on the subsets.
Why it's here
This is the final expansion estimate in the proposition, obtained by splitting into two cases. Feasible subsets () are controlled by the density-maximizing rectangle, which gives . Infeasible subsets are small enough that the preliminary square-root bound already gives the error term, uniformly in the subsets.
Classified routine:
A case split that follows directly from the earlier claims. Feasible subsets are bounded by the maximality of the density-maximizing rectangle (claim-inc-piece-5), and infeasible ones by the preliminary square-root expansion bound (claim-inc-piece-4) plus bookkeeping of the exponents.
Uses
Used by
Nothing in the paper
Sources
PaperOpen
- Section
- §2.3 Degree control and a maximizing rectangle
- Page
- —
- Label
—- Line
sections/01-incidence.tex:303
Leannot aligned
Phase 2 aligns this node to a Lean declaration.
Friction
- infoinferred_depoutline: "Expansion estimate from optimality of rectangle" rests on claim-inc-piece-4
- infoinferred_depoutline: "Expansion estimate from optimality of rectangle" rests on claim-inc-piece-5