AFTD Auto-Formalizing Theoretical Domains

xz_replica_transfer_matrix

def

xz_replica_transfer_matrix q : Matrix (Fin (2*q) → Fin 2) (Fin (2*q) → Fin 2) ℂ, with entry ∑ s, ∏ i, (xz_pauli (u i) (v i)).toMatrix (s i) (s (i+1 mod 2q)): the trace of the product of the 2q Pauli matrices xz_pauli (u i) (v i) around a cycle.

Statement

noncomputable def xz_replica_transfer_matrix (q : ℕ) : Matrix (Fin (2 * q) → Fin 2) (Fin (2 * q) → Fin 2) ℂ
Source
step towards xz_scar_uniform_reduced_spectrum_odd_length_doubling
Verified
01 Nov 2026
Axioms
none listed
Built on 3
  • 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\}$.
  • xz_cyclic_succThe cyclic successor i ↦ (i + 1) mod n on Fin n, total also for n = 0 (where the argument is impossible).
  • 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 =…

Lean source view module on GitHub

/-- The q-replica transfer matrix on `2q` layers: `T_q[u,v]` is the sum over spin strings `s` of the cyclic product of local Pauli entries. -/
noncomputable def xz_replica_transfer_matrix (q : ℕ) : Matrix (Fin (2 * q) → Fin 2) (Fin (2 * q) → Fin 2) ℂ := fun u v => ∑ s : Fin (2 * q) → Fin 2, ∏ i : Fin (2 * q), (xz_pauli (u i) (v i)).toMatrix (s i) (s (xz_cyclic_succ i))
See it in the graphDiscuss this resultChallenge it