The Unique Games Theorem

We prove the Unique Games Conjecture. For every fixed $\epsilon ,\delta \in (0,1/2)$, we give a deterministic polynomial-time reduction from 3SAT to Unique Games over a fixed finite alphabet, with completeness at least $1-\epsilon$ and soundness at most δ.