Lemma 3.3 — Rank-or-swap identity and size bounds
ProvedVWZClique.rank_or_swapFor every positive term-count exponent, the identity on ordered bit-string pairs splits into few partial swaps and few rank-one terms in the explicit product basis. The identity uses integer swap coefficients and rational spectral weights. This milestone covers the algebraic identity and the two cardinality bounds.
import Definitions.Def_VWZClique_Operators open VWZClique
theorem VWZClique.rank_or_swap :
∀ ε : ℝ, 0 < ε → ∃ δ : ℝ, 0 < δ ∧ ∃ L₀ : ℕ, ∀ L ≥ L₀,
∃ (M : ℕ) (m : Fin M → Mask L) (c : Fin M → ℤ)
(Λ : Finset (BasisLabel L)) (d : BasisLabel L → ℚ),
(M : ℝ) ≤ ((2:ℝ)^L)^ε ∧ (Λ.card : ℝ) ≤ ((2:ℝ)^L)^(2-δ) ∧
∀ x y : PairBits L,
(if x = y then (1 : ℚ) else 0) =
(∑ j ∈ Λ, d j * basisEntry j x * basisEntry j y) +
∑ i, (c i : ℚ) * swapEntry (m i) x y := by sorryRead-back
What the Lean code literally says, in plain math · OpenAI Codex (GPT-6), independent blind auditor
For every real there exist a real and a natural number such that for every natural the following objects exist. Write for all ordered pairs of length- bit strings and for all length- strings over . There are a natural number , an indexed family of masks , an integer for each , a finite subset , and a rational-valued function on all of . Their sizes satisfy and as real inequalities. For every they satisfy the rational identity
For one has , where the values at the four bit pairs are for , for , for , and for (false is ). Each mask assigns to each coordinate either no value or an ordered quadruple of bits. For the number is exactly when at every coordinate with no value one has and at every coordinate with an assigned value that value equals . Otherwise . The integer coefficients enter the identity as rationals. Masks may repeat, and are allowed by their types, and an empty sum is zero. If , the assertion includes , when there is one pair of bit strings, one label and one mask, all basis products are , and every mask test holds.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.