AFTD Auto-Formalizing Theoretical Domains

algebraic_energy_filter_purity

deforiginal

For natural k and real s, the Renyi-2 purity Tr((Tr_B |psi><psi|)^2) of the algebraic energy-filtered state proportional to (1+|H|)^(-s) |+>^tensor(4k) on 4k spins with equal bipartition into two subsystems of 2k spins, given by Tr((M M^T)^2) / (Tr(M M^T))^2 where M(sA, sB) = (1 + |e(sA) + e(sB)|)^(-s).

Statement

noncomputable def algebraic_energy_filter_purity (k : ℕ) (s : ℝ) : ℝ
Related work
arXiv:2405.02158; OP-889
Verified
02 Nov 2026
Axioms
none listed
Used by 1

Read back from the Lean

The function algebraic_energy_filter_purity takes a natural number $k$ and a real number $s$, and computes a real number defined as follows: 1. Let $I = \text{Fin}(2k) \to \text{Bool}$ be the set of Boolean configurations of length $2k$. 2. For any configuration $\sigma \in I$, let its energy $e(\sigma) = \sum_{j \in \text{Fin}(2k)} (\text{if } \sigma(j) \text{ then } 1 \text{ else } -1) \in \mathbb{R}$. 3. Let $M$ be the $I \times I$ real matrix with entries $M(s_A, s_B) = (1 + |e(s_A) + e(s_B)|)^{-s}$. 4. Let $R = M M^T$ be the matrix product of $M$ and its transpose. 5. Return the purity $\frac{\text{trace}(R^2)}{(\text{trace}(R))^2}$.

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

/-- Bipartite Renyi-2 purity of an algebraic energy-filtered state on 4k spins -/
noncomputable def algebraic_energy_filter_purity (k : ℕ) (s : ℝ) : ℝ :=
  let M : Matrix (Fin (2 * k) → Bool) (Fin (2 * k) → Bool) ℝ :=
    fun sA sB =>
      let eA := ∑ j : Fin (2 * k), if sA j then (1 : ℝ) else (-1 : ℝ)
      let eB := ∑ j : Fin (2 * k), if sB j then (1 : ℝ) else (-1 : ℝ)
      (1 + |eA + eB|) ^ (-s)
  let R := M * M.transpose
  (R * R).trace / (R.trace)^2
See it in the graphDiscuss this resultChallenge it