claimroutineinferred_dep
NO soundness of the retained graph
Retained graph has value below on NO inputs
soundness case of the lemma
Claim·§A.1 A simple strong-left form of Unique Games·inside lemUnique Games with constant left degree and strong satisfaction
Statement (paper)
If is unsatisfiable, then : any labeling of the retained graph extends, by assigning arbitrary labels to discarded left vertices and keeping all right labels, to a labeling of the full graph whose full edge value is at least times its retained edge value, and by the retained edge value is at most .
In plain English
If is unsatisfiable, then the retained simple Unique Games graph has value less than .
Why it's here
Any labeling of the retained graph extends to the full sequence graph by labeling discarded left vertices arbitrarily and keeping right labels, and the full value is at least times the retained edge value. Combined with the full-graph bound and , the retained value is below , giving the NO case of the parent lemma.
Classified routine:
Direct consequence of the full-graph soundness bound (claim 5) and the retained-fraction bound p_graph ≥ 3/4 (claim 6), using the standard argument of extending a labeling from the retained subgraph to the full graph.
Uses
Used by
Nothing in the paper
Sources
PaperOpen
- Section
- §A.1 A simple strong-left form of Unique Games
- Page
- —
- Label
—- Line
appendices/finite-consequences.tex:210
Leannot aligned
Phase 2 aligns this node to a Lean declaration.
Friction
- infoinferred_depoutline: "NO soundness of retained graph" rests on claim-lem-simple-strong-left-5
- infoinferred_depoutline: "NO soundness of retained graph" rests on claim-lem-simple-strong-left-6