claimroutineinferred_dep
Many light indices force collisions
Many light indices force , giving saving
collision case of the term dichotomy
Statement (paper)
Suppose that, for a choice of terms with indices , at least of the indices obey . Then , and, after division by , the bound given by Lemma for this term choice is at most .
In plain English
If, for some choice of terms, at least of the indices satisfy , then . After dividing by , the collision lemma's bound for that term choice is at most .
Why it's here
Light indices live in the simplex , which has only lattice points, so by pigeonhole (Cauchy–Schwarz) many rows must share indices, giving a large . Feeding this into the collision lemma yields the saving for these term choices, which is the first of the two cases the comparison proposition needs to beat the arithmetic lower bound.
Classified routine:
Cauchy–Schwarz applied to the at most light indices gives the collision count; substituting it into the earlier det-collision lemma yields the stated saving.
Uses
Used by
Sources
PaperOpen
- Section
- §3.4 A comparison with two alternatives
- Page
- —
- Label
—- Line
sections/determinant.tex:393
Leannot aligned
Phase 2 aligns this node to a Lean declaration.
Friction
- infoinferred_depoutline: "Many light indices force collisions" rests on claim-det-comparison-1
- infoinferred_depoutline: "Many light indices force collisions" rests on det:collision