AFTD Auto-Formalizing Theoretical Domains

xz_matrix_a

def

The matrix xz_matrix_a (L : ℕ) : Matrix (Fin L → Fin 2) (Fin L → Fin 2) ℂ defined as ((1 : ℂ) / (2 ^ L : ℂ)) • ∑ a : Fin L → Fin 2, pauliMatrix (xz_pauli_string L a).

Statement

noncomputable def xz_matrix_a (L : ℕ) : Matrix (Fin L → Fin 2) (Fin L → Fin 2) ℂ
Defined in
arXiv:2610.20846, Appendix C
Verified
01 Nov 2026
Axioms
none listed
Built on 2
  • xz_pauli_stringThe function xz_pauli_string (L : ℕ) : (Fin L → Fin 2) → PauliString L mapping a configuration a : Fin L → Fin 2 to the Pauli string…
  • 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…
Used by 3
  • xz_matrix_a_is_hermitianFor every natural number L, the matrix xz_matrix_a L is Hermitian: (xz_matrix_a L).IsHermitian.
  • xz_rhoThe reduced density matrix xz_rho (L : ℕ) : Matrix (Fin L → Fin 2) (Fin L → Fin 2) ℂ defined as the matrix square…
  • xz_rho_is_hermitianFor every natural number L, the reduced density matrix xz_rho L is Hermitian: (xz_rho L).IsHermitian.

Read back from the Lean

xz_matrix_a L is defined as a $(2^L \times 2^L)$ complex matrix indexed by Fin L → Fin 2, given by the normalized sum (scaled by $1 / 2^L$) over all configurations $a : \text{Fin } L \to \text{Fin } 2$ of the tensor-product Pauli matrix pauliMatrix (xz_pauli_string L a). Here, xz_pauli_string L a is a length-$L$ Pauli string whose $j$-th component (for $j \in \text{Fin } L$) is selected according to the pair $(a(j), a((j + 1) \bmod L))$: - $(0, 0) \mapsto X$ - $(0, 1) \mapsto Y$ - $(1, 0) \mapsto I$ - $(1, 1) \mapsto Z$.

Written by a model that saw only the Lean, never the English above. If the two disagree, that is worth a challenge.

Lean source view module on GitHub

/-- The normalized Hamiltonian/operator sum A_L on L qubits. -/
noncomputable def xz_matrix_a (L : ℕ) : Matrix (Fin L → Fin 2) (Fin L → Fin 2) ℂ := ((1 : ℂ) / (2 ^ L : ℂ)) • ∑ a : Fin L → Fin 2, pauliMatrix (xz_pauli_string L a)
See it in the graphDiscuss this resultChallenge it