claimroutineinferred_dep
Matrix chart lift has Grassmann retention
Graph-subspace lift has Grassmann retention at least
moves the fiber into the Grassmann setting
Statement (paper)
Let be a set whose retention under the matrix step is at least conditional on both perturbation factors being nonzero, and let , where . Then has Grassmann retention at least .
In plain English
If a set of matrices has retention at least under the step (conditioned on both nonzero), then the set of graph subspaces has Grassmann retention at least .
Why it's here
This transfers the fiber's retention from the matrix setting, obtained in the previous claim, to the Grassmann setting of subspaces in where the expansion theorem applies. The loss from to is the price of this translation, and it sets the parameter used in the next claim to get a row-column slice.
Classified routine:
This is a direct translation step inside the inverse shortcode theorem. It identifies matrices with graph subspaces in the Grassmannian, so the matrix step corresponds to the Grassmann random walk. It is a standard chart computation, as in the Khot–Minzer–Safra Grassmann expansion work, with a constant-factor loss.
Uses
Used by
Sources
PaperOpen
- Section
- §5.1 The inverse shortcode theorem
- Page
- —
- Label
—- Line
sections/04-matrix.tex:88
Leannot aligned
Phase 2 aligns this node to a Lean declaration.
Friction
- infoinferred_depoutline: "Matrix chart lift has Grassmann retention eta/4" rests on claim-thm-shortcode-1