claimroutineinferred_dep
Expansion interval yields row-column slice
Expansion gives a row-column slice where is constant on an fraction
finishes the shortcode theorem
Statement (paper)
Applying the expansion theorem with to yields an interval whose intersection with is a slice of the required form, defined by the equations and with equations in total, such that equals the value defining on at least an fraction of . Hence with .
In plain English
Applying the expansion theorem with to the lifted set gives an interval whose intersection with the chart is a slice cut out by at most row and column equations and . On this slice equals its value on at least an fraction, so with .
Why it's here
This finishes the proof of the shortcode theorem. The previous claim shows has Grassmann retention at least , which is the hypothesis the expansion theorem needs. Its dense interval, restricted to the matrix chart, becomes a row-column slice on which is constant on an fraction. Taking gives the affine form with constant, which is the conclusion of the theorem.}
Classified routine:
A direct application of the Grassmann expansion theorem (Khot–Minzer–Safra) to the lifted set from the previous claim. It translates the dense interval back to the matrix chart as a row-column slice, and choosing z=0 is bookkeeping.
Uses
Used by
Nothing in the paper
Sources
PaperOpen
- Section
- §5.1 The inverse shortcode theorem
- Page
- —
- Label
—- Line
sections/04-matrix.tex:109
Leannot aligned
Phase 2 aligns this node to a Lean declaration.
Friction
- infoinferred_depoutline: "Expansion interval yields row-column slice" rests on claim-thm-shortcode-2