claimroutine
Parameters fixed before invoking UG theorem
Fixes degree and error constants from before invoking UG
sets non-circular constants for the proof
Claim·§A.1 A simple strong-left form of Unique Games·inside lemUnique Games with constant left degree and strong satisfaction
Statement (paper)
There exist a multiple of with and , an integer with , positive rationals , a positive integer , and positive rationals such that , , , , , and . All these quantities are chosen from alone, before Theorem is invoked with completeness error and soundness error .
In plain English
One can choose, using only , a degree (a multiple of , with and ), an integer with , and positive rationals and an integer . They satisfy a list of smallness inequalities, such as , , , and .
Why it's here
This claim sets every constant in the proof of the lemma in a non-circular order, so that only the alphabet size comes from the Unique Games Theorem. The completeness error and soundness error are fixed first, and the theorem is then invoked with them. The later steps (copy normalization, graph construction and the error analysis) can then use the inequalities freely, and the final degree and the two errors depend only on and not on .
Classified routine:
Straightforward choice of constants in a fixed order (pick h, then T large so that (T)_h/T^h>3/4, then small rationals). It is ordinary parameter bookkeeping made before invoking the Unique Games Theorem, with no new idea.
Sources
PaperOpen
- Section
- §A.1 A simple strong-left form of Unique Games
- Page
- —
- Label
—- Line
appendices/finite-consequences.tex:41
Leannot aligned
Phase 2 aligns this node to a Lean declaration.