The two-projection contribution
DefinitionVWZClique_ContractionThree channels consist of products of unary and binary factors on two incident triples. Two rational product-basis projections are interpreted in the coefficient field.
import Definitions.Def_VWZClique_Operators
import Definitions.Def_VWZClique_Weighted
namespace VWZClique
abbrev Slot := Fin 3 ⊕ Fin 3
abbrev Block (L : ℕ) := Fin 3 → Bits L
abbrev ChannelKey (L : ℕ) :=
Fin 3 × ((Slot × Bits L) ⊕ (Slot × Slot × Bits L × Bits L))
def channel {F : Type*} [Field F] {L : ℕ} (w : ChannelKey L → F)
(h : Fin 3) (a b : Block L) : F :=
let x : Slot → Bits L := Sum.elim a b
(∏ i : Slot, w (h, .inl (i, x i))) *
∏ i : Slot, ∏ j : Slot, w (h, .inr (i, j, x i, x j))
def block {L : ℕ} (x : PairBits L) (z : Bits L) : Block L :=
fun i => if i = 0 then x.1 else if i = 1 then x.2 else z
def projected {F : Type*} [Field F] [CharZero F] {L : ℕ}
(Λ : Finset (BasisLabel L)) (d : BasisLabel L → F) (x y : PairBits L) : F :=
∑ j ∈ Λ, d j * (basisEntry j x : F) * (basisEntry j y : F)
noncomputable def doubleProjection {F : Type*} [Field F] [CharZero F] {L : ℕ}
(Λ Γ : Finset (BasisLabel L)) (d e : BasisLabel L → F)
(w : ChannelKey L → F) : F :=
∑ z₁ : Bits L, ∑ z₂ : Bits L, ∑ c : Block L,
∑ x : PairBits L, ∑ x' : PairBits L, ∑ y : PairBits L, ∑ y' : PairBits L,
projected Λ d x x' * projected Γ e y y' *
channel w 0 (block x z₁) (block y z₂) *
channel w 1 (block y' z₂) c * channel w 2 c (block x' z₁)
end VWZClique
Read-back
What the Lean code literally says, in plain math · OpenAI Codex (GPT-6), independent blind auditor
Slot. A slot belongs to one of two distinguishable copies of . Write for this six-element set.
Block. For every natural number , a block assigns a length- Boolean word to each of . It is an ordered triple of words. At there is exactly one block.
Channel key. For every natural number , a key consists of together with either a slot and a length- Boolean word, or an ordered pair of slots and an ordered pair of such words. A slot is one of two tagged copies of the three positions . The two kinds of keys are distinguished, and repeated slots or words are allowed.
Channel. For any field , natural number , field-valued table on the keys just described, and two ordered triples of length- Boolean words, let read the three words of on the first three tagged slots and those of on the second three. Writing superscripts to distinguish the two key kinds, the value is . All six single slots and all 36 ordered slot pairs occur, including the six diagonal pairs.
Block constructor. For every natural number , an ordered pair of length- Boolean words and one further such word , the output assigns to positions , respectively.
Projected entry. For any characteristic-zero field , natural number , finite set of length- strings over , arbitrary field-valued coefficient function on all such strings, and ordered pairs of length- Boolean words, the value is , with rational entries interpreted in . Here . On Boolean pairs in order , the four rows are . The empty set gives zero and the empty coordinate product at is one.
Double projection. For any characteristic-zero field , natural number , finite sets of length- four-symbol labels, coefficient functions on all labels with values in , and field-valued channel-key table , put . The defined scalar is
Each independently ranges over all length- Boolean words, over all ordered triples of words, and each of over all ordered pairs of words. For two triples, concatenates their words on the six tagged slots and multiplies the six unary table entries and all 36 ordered binary entries, including loops, using channel and the words at the indicated slots. Each sums over , where multiplies the coordinate entries selected by . For pair values these rows for labels are . Either empty label set gives zero. At each word, tuple of words and label space is a singleton and the coordinate products are one.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.