AFTD Auto-Formalizing Theoretical Domains

qutrit_partial_transpose_hermitian_block_structure

theoremverified

For a partial-transpose-invariant Hermitian 3-by-2 matrix, the off-diagonal qutrit block is symmetric and both diagonal qutrit blocks are entrywise real.

Statement

theorem qutrit_partial_transpose_hermitian_block_structure
    (X : Matrix (Fin 3 × Fin 2) (Fin 3 × Fin 2) ℂ) (hX : X.IsHermitian)
    (hpt : ∀ i j : Fin 3, ∀ p q : Fin 2, X (i,p) (j,q) = X (j,p) (i,q)) :
    (let B : Matrix (Fin 3) (Fin 3) ℂ := fun i j => X (i,0) (j,1); B.transpose = B) ∧
    (∀ i j : Fin 3, ∀ p : Fin 2, star (X (i,p) (j,p)) = X (i,p) (j,p))
Source
Local compatibility helper for OP-693.
Verified
12 Nov 2026
Axioms
Classical.choiceQuot.soundpropext

The proof, explained

The proof splits the conjunction into the two claimed properties. The symmetry of the off-diagonal block follows by entrywise evaluation and direct application of partial-transpose invariance with qubit indices 0 and 1. For the diagonal blocks, entrywise reality is established by chaining the Hermitian transpose property with partial-transpose invariance to reflect the qutrit indices back to their original positions.

  1. The goal reduces to two independent claims: the symmetry of the off-diagonal block and the reality of the diagonal blocks.

    The constructor splits the conjunction into its two constituent goals: showing $B^T = B$ for the block $B_{i, j} = X_{(i, 0), (j, 1)}$, and showing that each entry $X_{(i, p), (j, p)}$ in the diagonal blocks is invariant under complex conjugation.

    line 12

      constructor
  2. The off-diagonal block $B$ is symmetric: $B^T = B$.

    By extensionality, it suffices to verify $(B^T)_{i, j} = B_{i, j}$ for arbitrary indices $i, j \in \{0, 1, 2\}$. By definition of the transpose and the block $B$, this requires $X_{(j, 0), (i, 1)} = X_{(i, 0), (j, 1)}$, which matches the partial-transpose hypothesis evaluated at indices $(j, i, 0, 1)$.

    lines 13–14

      · ext i j
        exact hpt j i 0 1
  3. The diagonal blocks are entrywise real: $\operatorname{star}(X_{(i, p), (j, p)}) = X_{(i, p), (j, p)}$ for all $i, j \in \{0, 1, 2\}$ and $p \in \{0, 1\}$.

    Given arbitrary indices $i, j$ and $p$, the Hermitian property of $X$ equates the complex conjugate $\operatorname{star}(X_{(i, p), (j, p)})$ to the transposed entry $X_{(j, p), (i, p)}$. Applying partial-transpose invariance with the qubit indices both equal to $p$ then exchanges the qutrit indices back, giving $X_{(j, p), (i, p)} = X_{(i, p), (j, p)}$.

    lines 15–18

      · intro i j p
        calc
          star (X (i,p) (j,p)) = X (j,p) (i,p) := hX.apply (j,p) (i,p)
          _ = X (i,p) (j,p) := hpt j i p p

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

open Matrixopen scoped BigOperators Matrix ComplexOrderset_option backward.isDefEq.respectTransparency falseset_option linter.unusedSimpArgs falseset_option linter.unnecessarySeqFocus falsetheorem qutrit_partial_transpose_hermitian_block_structure    (X : Matrix (Fin 3 × Fin 2) (Fin 3 × Fin 2) ℂ) (hX : X.IsHermitian)    (hpt : ∀ i j : Fin 3, ∀ p q : Fin 2, X (i,p) (j,q) = X (j,p) (i,q)) :    (let B : Matrix (Fin 3) (Fin 3) ℂ := fun i j => X (i,0) (j,1); B.transpose = B) ∧    (∀ i j : Fin 3, ∀ p : Fin 2, star (X (i,p) (j,p)) = X (i,p) (j,p)) := by  constructor  · ext i j    exact hpt j i 0 1  · intro i j p    calc      star (X (i,p) (j,p)) = X (j,p) (i,p) := hX.apply (j,p) (i,p)      _ = X (i,p) (j,p) := hpt j i p p
See it in the graphDiscuss this resultChallenge it