AFTD Auto-Formalizing Theoretical Domains

thermomajorization_prefix

def

Given a permutation π of Fin n and a natural number k, the k-th prefix set thermomajorization_prefix π k is the finite set (Finset (Fin n)) defined as the image under π of the indices {j : Fin n | (j : ℕ) < k}.

Statement

def thermomajorization_prefix {n : ℕ} (π : Equiv.Perm (Fin n)) (k : ℕ) : Finset (Fin n)
Defined in
arXiv:2610.35433, Eq. (190)
Verified
07 Nov 2026
Axioms
none listed
Used by 1

Read back from the Lean

For a natural number $n$ (implicit), a permutation $\pi$ of $\mathrm{Fin}(n)$, and a natural number $k$, thermomajorization_prefix π k is defined as the finite subset of $\mathrm{Fin}(n)$ obtained by taking the image under $\pi$ of the set of elements $j \in \mathrm{Fin}(n)$ whose underlying value is strictly less than $k$, i.e., $\{\pi(j) \mid j \in \mathrm{Fin}(n), j < k\}$.

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 k-element prefix finset of an ordering π of energy levels {0, ..., n-1}. -/
def thermomajorization_prefix {n : ℕ} (π : Equiv.Perm (Fin n)) (k : ℕ) : Finset (Fin n) := (Finset.univ.filter (fun j : Fin n => (j : ℕ) < k)).map π.toEmbedding
See it in the graphDiscuss this resultChallenge it