qutrit_partial_transpose_under_symmetric_first_congruence
Partial-transpose invariance survives a transpose congruence on the first factor.
Statement
theorem qutrit_partial_transpose_under_symmetric_first_congruence
{m : ℕ} (ρ : Matrix (Fin 3 × Fin m) (Fin 3 × Fin m) ℂ)
(H : Matrix (Fin 3) (Fin 3) ℂ)
(hpt : ∀ i j : Fin 3, ∀ p q : Fin m, ρ (i,p) (j,q) = ρ (j,p) (i,q)) :
∀ a c : Fin 3, ∀ p q : Fin m,
(∑ i : Fin 3, ∑ j : Fin 3, H a i * ρ (i,p) (j,q) * H c j) =
∑ i : Fin 3, ∑ j : Fin 3, H c i * ρ (i,p) (j,q) * H a j- Source
- Local compatibility helper for OP-693.
- Verified
- 12 Nov 2026
- Axioms
Classical.choiceQuot.soundpropext
The proof, explained
The theorem states that if a density matrix $\rho$ on $\mathbb{C}^3 \otimes \mathbb{C}^m$ is symmetric under partial transposition on the first factor, then this symmetry is preserved under a congruence transformation by a matrix $H$ acting on the first factor. The proof fixes the matrix entry indices and applies `Finset.sum_comm` to interchange the two summation indices on the left-hand side. It then reduces the equality of sums to the equality of individual summands via `Finset.sum_congr`. Finally, the partial-transpose hypothesis on $\rho$ equates the matrix entries, and commutativity of complex multiplication closes the goal.
Fix arbitrary indices $a, c \in \text{Fin } 3$ and $p, q \in \text{Fin } m$, and swap the order of summation on the left-hand side.
We fix the free matrix indices $a, c$ for the first subsystem and $p, q$ for the second subsystem. Using `Finset.sum_comm`, we interchange the order of the two finite sums over $\text{Fin } 3$ on the left-hand side, converting $\sum_i \sum_j H_{ai} \rho_{(i,p),(j,q)} H_{cj}$ into $\sum_j \sum_i H_{ai} \rho_{(i,p),(j,q)} H_{cj}$.
uses
Finset.sum_commintro a c p q rw [Finset.sum_comm]
It suffices to show that the individual summands agree for each pair of indices $i, j \in \text{Fin } 3$, namely that $H_{aj} \rho_{(j,p),(i,q)} H_{ci} = H_{ci} \rho_{(i,p),(j,q)} H_{aj}$.
Applying sum congruence (`Finset.sum_congr rfl`) first to the outer sum and then to the inner sum introduces arbitrary indices $i, j \in \text{Fin } 3$ and reduces equality of the double sums to equality of their corresponding terms.
uses
Finset.sum_congrapply Finset.sum_congr rfl intro i hi apply Finset.sum_congr rfl intro j hj
The summands are equal for all $i, j \in \text{Fin } 3$. automation
By the partial-transpose symmetry hypothesis (`hpt`), $\rho_{(i,p),(j,q)} = \rho_{(j,p),(i,q)}$. Substituting this into the right-hand side leaves two products consisting of the same three complex numbers $H_{aj}$, $H_{ci}$, and $\rho_{(j,p),(i,q)}$. Commutativity of multiplication in $\mathbb{C}$ completes the proof via the `ring` tactic.
rw [hpt i j p q] ring
Finset.sum_comm- The order of summation in two nested finite sums can be interchanged: $\sum_{x \in s} \sum_{y \in t} f(x, y) = \sum_{y \in t} \sum_{x \in s} f(x, y)$.
Finset.sum_congr- Two finite sums over identical index sets are equal if their summands agree at every element: if $s_1 = s_2$ and $f(x) = g(x)$ for all $x \in s_2$, then $\sum_{x \in s_1} f(x) = \sum_{x \in s_2} g(x)$.
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_partial_transpose_under_symmetric_first_congruence {m : ℕ} (ρ : Matrix (Fin 3 × Fin m) (Fin 3 × Fin m) ℂ) (H : Matrix (Fin 3) (Fin 3) ℂ) (hpt : ∀ i j : Fin 3, ∀ p q : Fin m, ρ (i,p) (j,q) = ρ (j,p) (i,q)) : ∀ a c : Fin 3, ∀ p q : Fin m, (∑ i : Fin 3, ∑ j : Fin 3, H a i * ρ (i,p) (j,q) * H c j) = ∑ i : Fin 3, ∑ j : Fin 3, H c i * ρ (i,p) (j,q) * H a j := by intro a c p q rw [Finset.sum_comm] apply Finset.sum_congr rfl intro i hi apply Finset.sum_congr rfl intro j hj rw [hpt i j p q] ring