Lemma 3.2 — Free-coordinate bijection
ProvedVWZClique.free_wordsThe support of a partial swap is in bijection with pairs of free-coordinate strings. Under this bijection the two wedge-edge weights depend on the same free string and center. The statement is the local bijection used in the proof.
import Definitions.Def_VWZClique_Free open VWZClique
theorem VWZClique.free_words {L : ℕ} (m : Mask L) (x y : PairBits L) :
swapOK m x y ↔ ∃! pq : Free m × Free m, expand m pq = (x,y) := by sorryRead-back
What the Lean code literally says, in plain math · OpenAI Codex (GPT-6), independent blind auditor
For every natural number , every mask assigning either no value or an ordered Boolean quadruple to each of the coordinates, and every pair of ordered word pairs and with length- Boolean words, the following are equivalent. First, at every coordinate where specifies a quadruple, equals that quadruple, and at every unspecified coordinate , and . Second, there exists exactly one ordered pair of Boolean assignments to the unspecified coordinates such that filling the four output words coordinatewise gives : the filling uses the specified quadruple wherever present and everywhere else. A fully specified mask gives a singleton domain of assignment pairs. At every word is empty, the coordinate conditions are vacuous and the pair of empty assignments is unique.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.