AFTD Auto-Formalizing Theoretical Domains

xz_pauli_string

def

The function xz_pauli_string (L : ℕ) : (Fin L → Fin 2) → PauliString L mapping a configuration a : Fin L → Fin 2 to the Pauli string whose value at site j : Fin L is xz_pauli (a j) (a ⟨(j.val + 1) % L, _⟩).

Statement

def xz_pauli_string (L : ℕ) (a : Fin L → Fin 2) : PauliString L
Defined in
arXiv:2610.20846, Appendix C
Verified
01 Nov 2026
Axioms
none listed
Built on 2
  • xz_pauliThe function xz_pauli : Fin 2 → Fin 2 → PauliBasis taking two curried arguments a, b : Fin 2, mapping a = 0, b = 0 to PauliBasis.X; a =…
  • PauliStringA Pauli string of length $n$ is a function $p : \mathrm{Fin}\,n \to \mathrm{PauliBasis}$.
Used by 3
  • xz_matrix_aThe matrix xz_matrix_a (L : ℕ) : Matrix (Fin L → Fin 2) (Fin L → Fin 2) ℂ defined as…
  • xz_rho_trace_oneFor every natural number L with 1 ≤ L, the trace of the reduced density matrix xz_rho L equals 1: Matrix.trace (xz_rho L) = 1.
  • xz_matrix_a_is_hermitianFor every natural number L, the matrix xz_matrix_a L is Hermitian: (xz_matrix_a L).IsHermitian.

Read back from the Lean

xz_pauli_string defines a function that takes a natural number L and a function a : Fin L → Fin 2, and returns a PauliString L (a function Fin L → PauliBasis). For each index j : Fin L, site j is mapped to xz_pauli (a j) (a ⟨(j.val + 1) % L, _⟩), applying xz_pauli to the value of a at j and at the cyclically next index (j + 1) % L.

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 Pauli string on L qubits induced by a binary configuration with periodic boundary conditions. -/
def xz_pauli_string (L : ℕ) (a : Fin L → Fin 2) : PauliString L := fun j => xz_pauli (a j) (a ⟨(j.val + 1) % L, by
    rcases L with _ | L'
    · exact j.elim0
    · exact Nat.mod_lt _ (Nat.succ_pos L')⟩)
See it in the graphDiscuss this resultChallenge it