open_network_kernels_anticommute
In any ring, dichotomic observables A_0, A_1 and B_0, B_1 squaring to 1 that commute with each other yield anticommuting kernel operators: (A_0 * B_0 - A_1 * B_1) * (A_0 * B_1 + A_1 * B_0) + (A_0 * B_1 + A_1 * B_0) * (A_0 * B_0 - A_1 * B_1) = 0.
Statement
theorem open_network_kernels_anticommute {R : Type*} [Ring R] (A₀ A₁ B₀ B₁ : R) (hA₀ : A₀ ^ 2 = 1) (hA₁ : A₁ ^ 2 = 1) (hB₀ : B₀ ^ 2 = 1) (hB₁ : B₁ ^ 2 = 1) (hAB00 : A₀ * B₀ = B₀ * A₀) (hAB01 : A₀ * B₁ = B₁ * A₀) (hAB10 : A₁ * B₀ = B₀ * A₁) (hAB11 : A₁ * B₁ = B₁ * A₁) : (A₀ * B₀ - A₁ * B₁) * (A₀ * B₁ + A₁ * B₀) + (A₀ * B₁ + A₁ * B₀) * (A₀ * B₀ - A₁ * B₁) = 0
- Formalizes
- arXiv:2610.35838 Appendix E, Eq. (61)
- Verified
- 01 Nov 2026
- Axioms
propext
Read back from the Lean
Let $R$ be a ring and let $A₀, A₁, B₀, B₁ \in R$. Suppose that: 1. $A₀^2 = 1$, 2. $A₁^2 = 1$, 3. $B₀^2 = 1$, 4. $B₁^2 = 1$, 5. $A₀ B₀ = B₀ A₀$, 6. $A₀ B₁ = B₁ A₀$, 7. $A₁ B₀ = B₀ A₁$, and 8. $A₁ B₁ = B₁ A₁$. Then $(A₀ B₀ - A₁ B₁)(A₀ B₁ + A₁ B₀) + (A₀ B₁ + A₁ B₀)(A₀ B₀ - A₁ B₁) = 0$ (i.e., the elements $A₀ B₀ - A₁ B₁$ and $A₀ B₁ + A₁ B₀$ anticommute).
Written by a model that saw only the Lean, never the English above. If the two disagree, that is worth a challenge.
The proof, explained
To show that the open network kernels U₀ = A₀ * B₀ - A₁ * B₁ and U₁ = A₀ * B₁ + A₁ * B₀ anticommute, we expand their anticommutator U₀ * U₁ + U₁ * U₀ into eight monomial products using distributivity. Because every A_i commutes with every B_j and each observable squares to 1, every product of four observables simplifies to a product of two observables, with the repeated factor eliminating to 1. These eight simplified products appear with opposite signs and cancel each other out in pairs, yielding zero.
The eight pairwise products between the monomial terms of A₀ * B₀ - A₁ * B₁ and A₀ * B₁ + A₁ * B₀ simplify to two-observable products: (A₀ * B₀) * (A₀ * B₁) = B₀ * B₁, (A₀ * B₀) * (A₁ * B₀) = A₀ * A₁, (A₁ * B₁) * (A₀ * B₁) = A₁ * A₀, (A₁ * B₁) * (A₁ * B₀) = B₁ * B₀, (A₀ * B₁) * (A₀ * B₀) = B₁ * B₀, (A₀ * B₁) * (A₁ * B₁) = A₀ * A₁, (A₁ * B₀) * (A₀ * B₀) = A₁ * A₀, and (A₁ * B₀) * (A₁ * B₁) = B₀ * B₁.
Each product contains two A-observables and two B-observables with exactly one observable repeated. In each case, we commute adjacent factors using the assumed commutativity between A and B observables (hAB00, hAB01, hAB10, hAB11) and regroup with associativity (mul_assoc) to bring the two identical observables together. The square of that observable evaluates to 1 by hypothesis (hA₀, hA₁, hB₀, hB₁) via sq, and the identity factor is eliminated using one_mul or mul_one.
uses
mul_assoc,sq,one_mul,mul_onehave hXZ : (A₀ * B₀) * (A₀ * B₁) = B₀ * B₁ := by rw [hAB00, mul_assoc, ← mul_assoc A₀ A₀ B₁, ← sq, hA₀, one_mul] have hXW : (A₀ * B₀) * (A₁ * B₀) = A₀ * A₁ := by rw [mul_assoc, hAB10, ← mul_assoc B₀ B₀ A₁, ← mul_assoc A₀ (B₀ * B₀) A₁, ← sq, hB₀, mul_one] have hYZ : (A₁ * B₁) * (A₀ * B₁) = A₁ * A₀ := by rw [mul_assoc, ← mul_assoc B₁ A₀ B₁, ← hAB01, mul_assoc, ← sq, hB₁, mul_one] have hYW : (A₁ * B₁) * (A₁ * B₀) = B₁ * B₀ := by rw [hAB11, mul_assoc, ← mul_assoc A₁ A₁ B₀, ← sq, hA₁, one_mul] have hZX : (A₀ * B₁) * (A₀ * B₀) = B₁ * B₀ := by rw [hAB01, mul_assoc, ← mul_assoc A₀ A₀ B₀, ← sq, hA₀, one_mul] have hZY : (A₀ * B₁) * (A₁ * B₁) = A₀ * A₁ := by rw [mul_assoc, ← mul_assoc B₁ A₁ B₁, ← hAB11, mul_assoc, ← sq, hB₁, mul_one] have hWX : (A₁ * B₀) * (A₀ * B₀) = A₁ * A₀ := by rw [mul_assoc, ← mul_assoc B₀ A₀ B₀, ← hAB00, mul_assoc, ← sq, hB₀, mul_one] have hWY : (A₁ * B₀) * (A₁ * B₁) = B₀ * B₁ := by rw [hAB10, mul_assoc, ← mul_assoc A₁ A₁ B₁, ← sq, hA₁, one_mul]
The anticommutator expands into the sum and difference of eight monomial products.
Applying distributivity of multiplication over addition and subtraction on the left and right (sub_mul, mul_add, add_mul, mul_sub) expands (A₀ * B₀ - A₁ * B₁) * (A₀ * B₁ + A₁ * B₀) + (A₀ * B₁ + A₁ * B₀) * (A₀ * B₀ - A₁ * B₁) into its eight constituent products.
uses
sub_mul,mul_add,add_mul,mul_subsimp only [sub_mul, mul_add, add_mul, mul_sub]Each of the eight monomial products is replaced by its simplified two-observable value, leaving (B₀ * B₁ - A₁ * A₀) + (A₀ * A₁ - B₁ * B₀) + (B₁ * B₀ + A₁ * A₀ - (A₀ * A₁ + B₀ * B₁)) = 0.
Rewriting with the eight identities established above (hXZ, hXW, hYZ, hYW, hZX, hZY, hWX, hWY) substitutes each product of four observables with its corresponding product of two observables.
rw [hXZ, hXW, hYZ, hYW, hZX, hZY, hWX, hWY]The expression sums to 0, establishing that the two operators anticommute.
The eight terms cancel in additive pairs: B₀ * B₁ cancels with -B₀ * B₁, -A₁ * A₀ cancels with A₁ * A₀, A₀ * A₁ cancels with -A₀ * A₁, and -B₁ * B₀ cancels with B₁ * B₀. The abel tactic verifies this identity in the additive group of the ring and closes the goal.
abel
mul_assoc- Multiplication is associative: (a * b) * c = a * (b * c).
sq- The square of an element is the element multiplied by itself: a ^ 2 = a * a.
one_mul- Multiplying by 1 on the left is the identity: 1 * a = a.
mul_one- Multiplying by 1 on the right is the identity: a * 1 = a.
sub_mul- Multiplication distributes over subtraction on the right: (a - b) * c = a * c - b * c.
mul_add- Multiplication distributes over addition on the left: a * (b + c) = a * b + a * c.
add_mul- Multiplication distributes over addition on the right: (a + b) * c = a * c + b * c.
mul_sub- Multiplication distributes over subtraction on the left: a * (b - c) = a * b - a * c.
- The final cancellation of the eight terms in the expansion is performed by the `abel` decision procedure for commutative additive groups.
Written by a model (gemini-3.8-flash) from the Lean proof and the goal states Lean reported at each step. Lean verified the proof; this explanation is a reading aid and is not itself machine-checked.
Lean source view module on GitHub
Choose a tactic — a marked line — to see the goals Lean had before and after it, as in Lean’s infoview. Step with ← → or j k.
/-- The open network kernels U_0 and U_1 anticommute in any dimension. -/theorem open_network_kernels_anticommute {R : Type*} [Ring R] (A₀ A₁ B₀ B₁ : R) (hA₀ : A₀ ^ 2 = 1) (hA₁ : A₁ ^ 2 = 1) (hB₀ : B₀ ^ 2 = 1) (hB₁ : B₁ ^ 2 = 1) (hAB00 : A₀ * B₀ = B₀ * A₀) (hAB01 : A₀ * B₁ = B₁ * A₀) (hAB10 : A₁ * B₀ = B₀ * A₁) (hAB11 : A₁ * B₁ = B₁ * A₁) : (A₀ * B₀ - A₁ * B₁) * (A₀ * B₁ + A₁ * B₀) + (A₀ * B₁ + A₁ * B₀) * (A₀ * B₀ - A₁ * B₁) = 0 := by have hXZ : (A₀ * B₀) * (A₀ * B₁) = B₀ * B₁ := by rw [hAB00, mul_assoc, ← mul_assoc A₀ A₀ B₁, ← sq, hA₀, one_mul] have hXW : (A₀ * B₀) * (A₁ * B₀) = A₀ * A₁ := by rw [mul_assoc, hAB10, ← mul_assoc B₀ B₀ A₁, ← mul_assoc A₀ (B₀ * B₀) A₁, ← sq, hB₀, mul_one] have hYZ : (A₁ * B₁) * (A₀ * B₁) = A₁ * A₀ := by rw [mul_assoc, ← mul_assoc B₁ A₀ B₁, ← hAB01, mul_assoc, ← sq, hB₁, mul_one] have hYW : (A₁ * B₁) * (A₁ * B₀) = B₁ * B₀ := by rw [hAB11, mul_assoc, ← mul_assoc A₁ A₁ B₀, ← sq, hA₁, one_mul] have hZX : (A₀ * B₁) * (A₀ * B₀) = B₁ * B₀ := by rw [hAB01, mul_assoc, ← mul_assoc A₀ A₀ B₀, ← sq, hA₀, one_mul] have hZY : (A₀ * B₁) * (A₁ * B₁) = A₀ * A₁ := by rw [mul_assoc, ← mul_assoc B₁ A₁ B₁, ← hAB11, mul_assoc, ← sq, hB₁, mul_one] have hWX : (A₁ * B₀) * (A₀ * B₀) = A₁ * A₀ := by rw [mul_assoc, ← mul_assoc B₀ A₀ B₀, ← hAB00, mul_assoc, ← sq, hB₀, mul_one] have hWY : (A₁ * B₀) * (A₁ * B₁) = B₀ * B₁ := by rw [hAB10, mul_assoc, ← mul_assoc A₁ A₁ B₁, ← sq, hA₁, one_mul] simp only [sub_mul, mul_add, add_mul, mul_sub] rw [hXZ, hXW, hYZ, hYW, hZX, hZY, hWX, hWY] abel