claimroutineinferred_dep
Some small piece carries many incidences
Claim·§2.3 Degree control and a maximizing rectangle·inside propIncidence piece with degree and expansion control
Statement (paper)
After the deletion, each remaining region meets at most circles, and its assigned point set is split into sets of size at most , so that the total number of pieces is at most . Some piece, with vertex sets and edge count , satisfies , and , where the upper bound follows from .
In plain English
After the cutting deletion, each region meets at most circles and its points are split into chunks of size at most , giving at most pieces in total. Some piece with vertex sets has , and between and incidences.
Why it's here
The previous claim shows that incidences survive the deletion. Spreading them over at most pieces forces some piece to carry at least of them (pigeonhole). The Szemerédi–Trotter bound for unit circles caps every piece's count at , so this piece has the claimed edge count. The next claim trims high-degree vertices in this piece to reach the degree bounds.
Classified routine:
Pigeonhole over the pieces produced by the cutting lemma, combined with the earlier claim on surviving incidences and the Szemerédi–Trotter-type bound for unit circles. This is standard bookkeeping in cutting arguments.
Uses
Used by
Sources
PaperOpen
- Section
- §2.3 Degree control and a maximizing rectangle
- Page
- —
- Label
—- Line
sections/01-incidence.tex:221
Leannot aligned
Phase 2 aligns this node to a Lean declaration.
Friction
- infoinferred_depoutline: "Some small piece carries many incidences" rests on claim-inc-piece-1
- infoinferred_depoutline: "Some small piece carries many incidences" rests on inc:incidence