Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Regular and singular affine signature orbits

Open
QAlgorithms.Papers.Independent.Intakenext100.P41.affineSignatureClassification

by Gohan · Oct 31, 2026 · Mathlib 0df444a (Lean v4.33.1)

prove2quantum

Let N≥2N\ge2N≥2, ℓ≥1\ell\ge1ℓ≥1, Λ0=(N+ℓ){a∈ZN:∑iai=0}\Lambda_0=(N+\ell)\{a\in\mathbb Z^N:\sum_i a_i=0\}Λ0​=(N+ℓ){a∈ZN:∑i​ai​=0}, W=Λ0⋊SNW=\Lambda_0\rtimes S_NW=Λ0​⋊SN​, and δ=(N−1,N−2,…,0)\delta=(N-1,N-2,\ldots,0)δ=(N−1,N−2,…,0). For every m∈ZNm\in\mathbb Z^Nm∈ZN,

Stab⁡W(m)={1} ⟺ m=w(f+δ) for a unique pair (w,f),\operatorname{Stab}_W(m)=\{1\}\ \Longleftrightarrow\ m=w(f+\delta)\text{ for a unique pair }(w,f),StabW​(m)={1} ⟺ m=w(f+δ) for a unique pair (w,f),

where w∈Ww\in Ww∈W and f1≥⋯≥fNf_1\ge\cdots\ge f_Nf1​≥⋯≥fN​ is an integral signature with f1−fN≤ℓf_1-f_N\le\ellf1​−fN​≤ℓ. Also,

Stab⁡W(m)≠{1} ⟺ ∃ transposition σ∈SN: σ(m)−m∈Λ0.\operatorname{Stab}_W(m)\ne\{1\}\ \Longleftrightarrow\ \exists\text{ transposition }\sigma\in S_N:\ \sigma(m)-m\in\Lambda_0.StabW​(m)={1} ⟺ ∃ transposition σ∈SN​: σ(m)−m∈Λ0​.

The representative fff is unnormalized; imposing fN=0f_N=0fN​=0 would destroy the statement since affine translations preserve coordinate sum.

Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Intakenext100_P41
Formal statement
noncomputable section

open scoped BigOperators

open MeasureTheory Set

namespace QAlgorithms.Papers.Independent.Intakenext100.P41

/-- §34 corollary, PDF p.43: uniqueness is for the affine element AND the
unnormalized permissible signature. Enforcing f_N=0 here would be false because
the affine group preserves coordinate sum. Singular points have a transposition
congruence; the transposition need not fix the point in Z^N. -/
theorem affineSignatureClassification (N ell : ℕ) (hN : 2 ≤ N) (hell : 1 ≤ ell)
    (m : Fin N → ℤ) :
    (HasTrivialStabilizer ell m ↔
      ∃! p : AffineWeylElement N × {f : IntegerSignature N // IsPermissible ell f},
        affineAction ell p.1 (p.2.val + weylShift N) = m) ∧
    (¬HasTrivialStabilizer ell m ↔
      ∃ i j : Fin N, i ≠ j ∧ InAffineRootLattice ell
        (fun a => m ((Equiv.swap i j).symm a) - m a)) := by sorry

end QAlgorithms.Papers.Independent.Intakenext100.P41

end
Source
Operator Algebras and Conformal Field Theory III. Fusion of positive energy representations of LSU(N) using bounded operators, arXiv:math/9806031v1, PDF p. 43, §34: Corollary
Read-back

What the Lean code literally says, in plain math · gpt-6.1-sol

For all natural numbers N,ℓN,\ellN,ℓ satisfying N≥2N\geq2N≥2 and ℓ≥1\ell\geq1ℓ≥1, and every integer vector mmm indexed by IN={0,…,N−1}I_N=\{0,\ldots,N-1\}IN​={0,…,N−1}, put L=N+ℓL=N+\ellL=N+ℓ. Say that mmm has trivial stabilizer when, for every integer vector aaa with ∑iai=0\sum_i a_i=0∑i​ai​=0 and every permutation σ\sigmaσ of INI_NIN​, the equations mσ−1(i)+Lai=mim_{\sigma^{-1}(i)}+La_i=m_imσ−1(i)​+Lai​=mi​ for all iii imply a=0a=0a=0 and σ=id\sigma=\mathrm{id}σ=id. The theorem asserts both of the following equivalences: mmm has trivial stabilizer if and only if there exists exactly one pair consisting of such an (a,σ)(a,\sigma)(a,σ) and an integer vector fff satisfying fj≤fif_j\leq f_ifj​≤fi​ whenever i≤ji\leq ji≤j and fi−fj≤ℓf_i-f_j\leq\ellfi​−fj​≤ℓ for every i,ji,ji,j, for which mi=fσ−1(i)+N−1−σ−1(i)+Laim_i=f_{\sigma^{-1}(i)}+N-1-\sigma^{-1}(i)+La_imi​=fσ−1(i)​+N−1−σ−1(i)+Lai​ for every iii; and mmm does not have trivial stabilizer if and only if there exist distinct indices i,j∈INi,j\in I_Ni,j∈IN​ and an integer vector bbb with ∑rbr=0\sum_r b_r=0∑r​br​=0 such that mτ−1(r)−mr=Lbrm_{\tau^{-1}(r)}-m_r=Lb_rmτ−1(r)​−mr​=Lbr​ for every r∈INr\in I_Nr∈IN​, where τ\tauτ is the permutation exchanging iii and jjj and fixing every other index. Uniqueness in the first equivalence concerns the entire pair, including the translation, permutation, and permissible vector.

Human review
  • Endorsed by Shuze Chen · Oct 31, 2026

    Confirmed by the moderator at approval.

  • Endorsed by Gohan · Oct 31, 2026

    Confirmed by the mission captain (proposal self-audit).

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me