qutrit_lift_qubit_joint_parent
A joint qubit parent lifts by a linear map to a positive qutrit parent on its range.
Statement
theorem qutrit_lift_qubit_joint_parent (M : Fin 3 → Matrix (Fin 3) (Fin 3) ℂ) (U : Matrix (Fin 3) (Fin 2) ℂ) (G : (Fin 3 → Bool) → Matrix (Fin 2) (Fin 2) ℂ) (hG : ∀ s, (G s).PosSemidef) (hsum : (∑ s, G s) = 1) (hmarg : ∀ j, (∑ s, if s j then G s else 0) = Uᴴ * M j * U) : ∃ H : (Fin 3 → Bool) → Matrix (Fin 3) (Fin 3) ℂ, (∀ s, (H s).PosSemidef) ∧ (∑ s, H s) = U*Uᴴ ∧ ∀ j : Fin 3, (∑ s, if s j then H s else 0) = (U*Uᴴ)*M j*(U*Uᴴ)
- Source
- Local compatibility helper for OP-693.
- Verified
- 12 Nov 2026
- Axioms
Classical.choiceQuot.soundpropext
The proof, explained
The theorem is proved by explicitly constructing the qutrit joint state H from the qubit joint state G via the linear lifting map lift(X) = U * X * Uᴴ, setting H(s) = U * G(s) * Uᴴ. Each H(s) is positive semidefinite because conjugation by U preserves positive semidefiniteness. Since lift is linear and ∑ s, G(s) = 1, the total sum evaluates to lift(1) = U * Uᴴ. Finally, because lift(0) = 0, lift commutes with the condition s(j) = true, allowing the marginal sums to reduce to lift(Uᴴ * M(j) * U), which equals (U * Uᴴ) * M(j) * (U * Uᴴ) by the associativity of matrix multiplication.
Define the lifting map lift(X) = U * X * Uᴴ and establish that lift(0) = 0.
We define the linear embedding lift from 2 × 2 matrices to 3 × 3 matrices by conjugation with U, lift(X) = U * X * Uᴴ. We verify entrywise that lift(0) = 0 by expanding the matrix multiplication.
uses
Matrix.mul_applylet lift (X : Matrix (Fin 2) (Fin 2) ℂ) : Matrix (Fin 3) (Fin 3) ℂ := U * X * Uᴴ have hzero : lift 0 = 0 := by ext i j simp [lift, Matrix.mul_apply]
The lifting map distributes over finite sums: ∑ s, lift (f s) = lift (∑ s, f s).
Both sides are expanded entrywise into scalar sums over Fin 2 and Fin 3 → Bool. The two summations are interchanged and terms rearranged using the distributive laws and commutativity of finite sums.
uses
Matrix.sum_apply,Matrix.mul_apply,Fin.sum_univ_two,Finset.sum_mul,Finset.mul_sum,Finset.sum_add_distrib,Finset.sum_comm,add_mulhave hlin (f : (Fin 3 → Bool) → Matrix (Fin 2) (Fin 2) ℂ) : (∑ s, lift (f s)) = lift (∑ s, f s) := by ext i j simp only [Matrix.sum_apply] simp [lift, Matrix.mul_apply, Matrix.sum_apply, Fin.sum_univ_two, Finset.sum_mul, Finset.mul_sum, Finset.sum_add_distrib, Finset.sum_comm, add_mul]
It suffices to verify the three required conditions for the candidate qutrit parent H(s) = lift(G s).
We propose H(s) := lift(G s) = U * G s * Uᴴ as the witness for the existential quantifier, reducing the goal to checking that each H(s) is positive semidefinite, that their sum is U * Uᴴ, and that the marginal sums match (U * Uᴴ) * M j * (U * Uᴴ).
refine ⟨fun s => lift (G s), ?_, ?_, ?_⟩
Each lifted matrix H(s) is positive semidefinite.
For each assignment s, G(s) is positive semidefinite by the hypothesis hG. Conjugating a positive semidefinite matrix by U preserves positive semidefiniteness, so H(s) = U * G s * Uᴴ is positive semidefinite.
uses
mul_mul_conjTranspose_same· intro s exact (hG s).mul_mul_conjTranspose_same U
The sum of the lifted matrices is ∑ s, H s = U * Uᴴ.
By the linearity of lift, ∑ s, lift(G s) = lift(∑ s, G s). Since ∑ s, G s = 1 by hsum, this evaluates to lift(1) = U * 1 * Uᴴ = U * Uᴴ.
· rw [hlin, hsum] simp [lift]
For each j, the conditional distributes through the lift: ∑ s, (if s j then lift (G s) else 0) = ∑ s, lift (if s j then G s else 0).
Fix j. Since lift(0) = 0, for any boolean value of s(j), the term if s j then lift (G s) else 0 equals lift (if s j then G s else 0). Summing over all s yields the equality.
uses
Finset.sum_congr· intro j have heq : (∑ s, if s j then lift (G s) else 0) = ∑ s, lift (if s j then G s else 0) := by apply Finset.sum_congr rfl intro s hs cases h : s j <;> simp [h, hzero]
The marginals of H reproduce (U * Uᴴ) * M j * (U * Uᴴ).
Using the conditional commutation, the linearity of lift, and the marginal hypothesis hmarg for G, the marginal sum becomes lift(Uᴴ * M j * U) = U * (Uᴴ * M j * U) * Uᴴ. By associativity of matrix multiplication, this rearranges to (U * Uᴴ) * M j * (U * Uᴴ).
uses
Matrix.mul_assocrw [heq, hlin, hmarg] dsimp [lift] rw [← Matrix.mul_assoc U (Uᴴ * M j) U, ← Matrix.mul_assoc U Uᴴ (M j)] exact Matrix.mul_assoc _ _ _
Matrix.mul_apply- The (i, k)-th entry of a matrix product M * N is the sum ∑ j, M i j * N j k.
Matrix.sum_apply- The (i, j)-th entry of a finite sum of matrices is the sum of their (i, j)-th entries: (∑ c, g c) i j = ∑ c, (g c) i j.
Fin.sum_univ_two- A sum over Fin 2 equals the sum of the term at 0 and the term at 1: ∑ i, f i = f 0 + f 1.
Finset.sum_mul- Right distributivity of multiplication over finite sums: (∑ i ∈ s, f i) * a = ∑ i ∈ s, (f i * a).
Finset.mul_sum- Left distributivity of multiplication over finite sums: a * ∑ i ∈ s, f i = ∑ i ∈ s, (a * f i).
Finset.sum_add_distrib- A sum of pairwise sums equals the sum of the first terms plus the sum of the second terms: ∑ x ∈ s, (f x + g x) = ∑ x ∈ s, f x + ∑ x ∈ s, g x.
Finset.sum_comm- The order of two finite summations can be exchanged: ∑ x ∈ s, ∑ y ∈ t, f x y = ∑ y ∈ t, ∑ x ∈ s, f x y.
add_mul- Right distributivity of multiplication over addition: (a + b) * c = a * c + b * c.
mul_mul_conjTranspose_same- Conjugating a positive semidefinite matrix A by any matrix B, forming B * A * Bᴴ, yields a positive semidefinite matrix.
Finset.sum_congr- Two finite sums over the same set are equal if their terms are equal elementwise.
Matrix.mul_assoc- Matrix multiplication is associative: (L * M) * N = L * (M * N).
- Step 2 (lines 19–24) proves the additivity of the map X ↦ U * X * Uᴴ over finite sums by expanding matrices entrywise and explicitly reindexing the sums over Fin 2, which on paper is immediate from the linearity of matrix multiplication.
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.
open Matrixopen scoped BigOperators Matrix ComplexOrderset_option backward.isDefEq.respectTransparency falseset_option linter.unusedSimpArgs falseset_option linter.unnecessarySeqFocus falsetheorem qutrit_lift_qubit_joint_parent (M : Fin 3 → Matrix (Fin 3) (Fin 3) ℂ) (U : Matrix (Fin 3) (Fin 2) ℂ) (G : (Fin 3 → Bool) → Matrix (Fin 2) (Fin 2) ℂ) (hG : ∀ s, (G s).PosSemidef) (hsum : (∑ s, G s) = 1) (hmarg : ∀ j, (∑ s, if s j then G s else 0) = Uᴴ * M j * U) : ∃ H : (Fin 3 → Bool) → Matrix (Fin 3) (Fin 3) ℂ, (∀ s, (H s).PosSemidef) ∧ (∑ s, H s) = U*Uᴴ ∧ ∀ j : Fin 3, (∑ s, if s j then H s else 0) = (U*Uᴴ)*M j*(U*Uᴴ) := by let lift (X : Matrix (Fin 2) (Fin 2) ℂ) : Matrix (Fin 3) (Fin 3) ℂ := U * X * Uᴴ have hzero : lift 0 = 0 := by ext i j simp [lift, Matrix.mul_apply] have hlin (f : (Fin 3 → Bool) → Matrix (Fin 2) (Fin 2) ℂ) : (∑ s, lift (f s)) = lift (∑ s, f s) := by ext i j simp only [Matrix.sum_apply] simp [lift, Matrix.mul_apply, Matrix.sum_apply, Fin.sum_univ_two, Finset.sum_mul, Finset.mul_sum, Finset.sum_add_distrib, Finset.sum_comm, add_mul] refine ⟨fun s => lift (G s), ?_, ?_, ?_⟩ · intro s exact (hG s).mul_mul_conjTranspose_same U · rw [hlin, hsum] simp [lift] · intro j have heq : (∑ s, if s j then lift (G s) else 0) = ∑ s, lift (if s j then G s else 0) := by apply Finset.sum_congr rfl intro s hs cases h : s j <;> simp [h, hzero] rw [heq, hlin, hmarg] dsimp [lift] rw [← Matrix.mul_assoc U (Uᴴ * M j) U, ← Matrix.mul_assoc U Uᴴ (M j)] exact Matrix.mul_assoc _ _ _