AFTD Auto-Formalizing Theoretical Domains

xz_rho_is_hermitian

theoremverified

For every natural number L, the reduced density matrix xz_rho L is Hermitian: (xz_rho L).IsHermitian.

Statement

theorem xz_rho_is_hermitian (L : ℕ) : (xz_rho L).IsHermitian
Source
arXiv:2610.20846, Appendix C
Verified
02 Nov 2026
Axioms
Classical.choiceQuot.soundpropext
Built on 11
  • xz_rhoThe reduced density matrix xz_rho (L : ℕ) : Matrix (Fin L → Fin 2) (Fin L → Fin 2) ℂ defined as the matrix square…
  • xz_matrix_aThe matrix xz_matrix_a (L : ℕ) : Matrix (Fin L → Fin 2) (Fin L → Fin 2) ℂ defined as…
  • LinearPMap.IsSelfAdjoint.smulLinearPMap.IsSelfAdjoint.smul
  • PauliBasisThe four Pauli basis elements $\{I,X,Y,Z\}$, represented as an inductive type.
  • PauliBasis.toMatrixMaps each Pauli basis element $\{I,X,Y,Z\}$ to its corresponding $2\times 2$ matrix $\{\sigma_I,\sigma_X,\sigma_Y,\sigma_Z\}$.
  • sigmaIThe $2\times 2$ identity matrix over $\mathbb{C}$, i.e.\ the Pauli operator $I$.
  • sigmaXThe bit-flip Pauli matrix $X = \begin{pmatrix} 0 & 1 \\ 1 & 0 \end{pmatrix}$ over $\mathbb{C}$.
  • sigmaYThe bit-phase-flip Pauli matrix $Y = \begin{pmatrix} 0 & -i \\ i & 0 \end{pmatrix}$ over $\mathbb{C}$.
  • sigmaZThe phase-flip Pauli matrix $Z = \begin{pmatrix} 1 & 0 \\ 0 & -1 \end{pmatrix}$ over $\mathbb{C}$.
  • PauliStringA Pauli string of length $n$ is a function $p : \mathrm{Fin}\,n \to \mathrm{PauliBasis}$.
  • pauliMatrixFor a Pauli string $p$ on $n$ qubits, the $2^n\times 2^n$ matrix obtained as the tensor product of the single-qubit Pauli matrices…

Read back from the Lean

For every natural number $L$, the matrix xz_rho L (with rows and columns indexed by Fin L → Fin 2, over the complex numbers) is Hermitian (i.e., equals its conjugate transpose).

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

The theorem establishes that the reduced density matrix rho_L (xz_rho L) is Hermitian by expressing it as the square of an intermediate operator A_L (xz_matrix_a L), since any power of a Hermitian matrix is Hermitian. The operator A_L is defined as a real scalar multiple of a sum of Pauli string matrices, so its Hermiticity follows from the facts that sums and real scalar multiplication preserve Hermiticity. Finally, each Pauli string matrix is Hermitian because it is a tensor product of single-qubit Pauli matrices, all of which are verified to be Hermitian entrywise by exhaustive case analysis.

  1. Each single-qubit Pauli matrix is Hermitian entrywise.

    By exhaustive case analysis over the four Pauli basis elements (I, X, Y, Z) and all index pairs i, j in Fin 2, simp computes each 2 × 2 matrix entry and its complex conjugate, verifying star (b_{j, i}) = b_{i, j} across all 16 cases.

    lines 3–4

      cases b <;> fin_cases i <;> fin_cases j <;>
        simp [PauliBasis.toMatrix, sigmaI, sigmaX, sigmaY, sigmaZ]
  2. Every Pauli string matrix is Hermitian.

    To prove (pauliMatrix p).IsHermitian, it suffices to check every matrix entry (ext i j). Expanding the conjugate transpose (Matrix.conjTranspose_apply) and the definition of pauliMatrix, the (i, j)-entry of the conjugate transpose is star (∏ k, (p k)_{j_k, i_k}). Distributing the conjugate across the product with star_prod and replacing each factor using entrywise Hermiticity of single-qubit Pauli matrices (xz_rho_is_hermitian_pauli_basis_entry) via Finset.prod_congr yields the original entry ∏ k, (p k)_{i_k, j_k}.

    lines 8–12

    uses Matrix.conjTranspose_apply, star_prod, Finset.prod_congr, xz_rho_is_hermitian_pauli_basis_entry

      ext i j
      simp only [Matrix.conjTranspose_apply, pauliMatrix]
      rw [star_prod]
      exact Finset.prod_congr rfl fun x _ =>
        xz_rho_is_hermitian_pauli_basis_entry (p x) (i x) (j x)
  3. The sum of Pauli string matrices appearing in xz_matrix_a L is Hermitian.

    Unfolding xz_matrix_a, the matrix is expressed as (1 / 2^L) • ∑ a, pauliMatrix (xz_pauli_string L a). Matrix.IsHermitian.smul reduces Hermiticity of this scalar multiple to showing that the sum is Hermitian and the scalar is self-adjoint. The sum is Hermitian because Hermiticity is equivalent to self-adjointness (Matrix.isHermitian_iff_isSelfAdjoint), a sum of self-adjoint matrices is self-adjoint (isSelfAdjoint_sum), and each summand is a Pauli string matrix, which is Hermitian (xz_rho_is_hermitian_pauli_matrix).

    lines 15–21

    uses Matrix.IsHermitian.smul, Matrix.isHermitian_iff_isSelfAdjoint, isSelfAdjoint_sum, xz_rho_is_hermitian_pauli_matrix

      rw [xz_matrix_a]
      apply Matrix.IsHermitian.smul
      · rw [Matrix.isHermitian_iff_isSelfAdjoint]
        apply isSelfAdjoint_sum
        intro a _
        rw [← Matrix.isHermitian_iff_isSelfAdjoint]
        exact xz_rho_is_hermitian_pauli_matrix _
  4. The scalar normalization factor 1 / 2^L is self-adjoint, establishing that xz_matrix_a L is Hermitian.

    Unfolding IsSelfAdjoint, it suffices to check star (1 / 2^L) = 1 / 2^L. Since 1 / 2^L is real, its complex conjugate equals itself, which simp discharges automatically.

    lines 22–23

    uses IsSelfAdjoint

      · rw [IsSelfAdjoint]
        simp
  5. The reduced density matrix xz_rho L, being the square of the Hermitian matrix xz_matrix_a L, is Hermitian.

    Unfolding xz_rho, the density matrix is (xz_matrix_a L) * (xz_matrix_a L), which equals (xz_matrix_a L) ^ 2 by pow_two. Because xz_matrix_a L is Hermitian (xz_rho_is_hermitian_xz_matrix_a), its square is also Hermitian.

    lines 27–28

    uses pow_two, xz_rho_is_hermitian_xz_matrix_a

      rw [xz_rho, ← pow_two]
      exact (xz_rho_is_hermitian_xz_matrix_a L).pow 2
pow_two
For any monoid element a, a ^ 2 = a * a.
IsSelfAdjoint
An element x is self-adjoint if and only if star x = x.
isSelfAdjoint_sum
A finite sum of self-adjoint elements in a star-algebra is self-adjoint.
Matrix.isHermitian_iff_isSelfAdjoint
A matrix is Hermitian if and only if it is self-adjoint with respect to conjugate transposition.
Matrix.IsHermitian.smul
Scaling a Hermitian matrix by a self-adjoint scalar yields a Hermitian matrix.
Matrix.conjTranspose_apply
The (j, i)-entry of the conjugate transpose of a matrix M is the complex conjugate of M's (i, j)-entry.
star_prod
The complex conjugate of a finite product equals the product of the complex conjugates of the factors.
Finset.prod_congr
Two finite products over the same finite set are equal if their factors agree at every point in the set.
xz_rho_is_hermitian_pauli_basis_entry
Each single-qubit Pauli basis matrix (I, X, Y, Z) is Hermitian entrywise: the conjugate of its (j, i)-entry is its (i, j)-entry.
xz_rho_is_hermitian_pauli_matrix
Every multi-qubit Pauli string matrix is Hermitian.
xz_rho_is_hermitian_xz_matrix_a
The matrix xz_matrix_a L is Hermitian for every natural number L.

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

private lemma xz_rho_is_hermitian_pauli_basis_entry (b : PauliBasis) (i j : Fin 2) :    star (b.toMatrix j i) = b.toMatrix i j := by  cases b <;> fin_cases i <;> fin_cases j <;>    simp [PauliBasis.toMatrix, sigmaI, sigmaX, sigmaY, sigmaZ]private lemma xz_rho_is_hermitian_pauli_matrix {n : ℕ} (p : PauliString n) :    (pauliMatrix p).IsHermitian := by  ext i j  simp only [Matrix.conjTranspose_apply, pauliMatrix]  rw [star_prod]  exact Finset.prod_congr rfl fun x _ =>    xz_rho_is_hermitian_pauli_basis_entry (p x) (i x) (j x)private lemma xz_rho_is_hermitian_xz_matrix_a (L : ℕ) : (xz_matrix_a L).IsHermitian := by  rw [xz_matrix_a]  apply Matrix.IsHermitian.smul  · rw [Matrix.isHermitian_iff_isSelfAdjoint]    apply isSelfAdjoint_sum    intro a _    rw [← Matrix.isHermitian_iff_isSelfAdjoint]    exact xz_rho_is_hermitian_pauli_matrix _  · rw [IsSelfAdjoint]    simp/-- The reduced density matrix rho_L is Hermitian for any length L. -/theorem xz_rho_is_hermitian (L : ℕ) : (xz_rho L).IsHermitian := by  rw [xz_rho, ← pow_two]  exact (xz_rho_is_hermitian_xz_matrix_a L).pow 2
See it in the graphDiscuss this resultChallenge it