Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Affine Weyl closed fundamental domains

Open
QAlgorithms.Papers.Independent.Intakenext100.P41.affineWeylAlcove

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

prove2quantum

Let N≥2N\ge2N≥2, ℓ≥1\ell\ge1ℓ≥1, L=N+ℓL=N+\ellL=N+ℓ, Λ0=L{m∈ZN:∑imi=0}\Lambda_0=L\{m\in\mathbb Z^N:\sum_i m_i=0\}Λ0​=L{m∈ZN:∑i​mi​=0}, and W=Λ0⋊SNW=\Lambda_0\rtimes S_NW=Λ0​⋊SN​ acting by translations and coordinate permutations on RN\mathbb R^NRN. Put

C={x:∣xi−xj∣≤L ∀i,j},D={x:x1≥⋯≥xN, x1−xN≤L}.C=\{x:|x_i-x_j|\le L\ \forall i,j\},\qquad D=\{x:x_1\ge\cdots\ge x_N,\ x_1-x_N\le L\}.C={x:∣xi​−xj​∣≤L ∀i,j},D={x:x1​≥⋯≥xN​, x1​−xN​≤L}.

The closed set CCC is a fundamental domain for Λ0\Lambda_0Λ0​, and DDD is one for WWW: every orbit meets the respective domain and distinct translates have disjoint interiors. A point belongs to the WWW-orbit of int⁡D\operatorname{int}DintD exactly when its affine stabilizer is trivial. At every other point xxx, there is a transposition σ∈SN\sigma\in S_Nσ∈SN​ with σ(x)−x∈Λ0\sigma(x)-x\in\Lambda_0σ(x)−x∈Λ0​.

The assertion allows repeated boundary representatives. Singularity is a congruence modulo the root lattice, not necessarily a transposition fixing the point itself.

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 lemma, all three clauses, PDF p.43. Closed fundamental domains permit
boundary repetitions. The regular locus is the orbit of the open dominant
alcove; singular points admit a transposition modulo Λ₀. -/
theorem affineWeylAlcove (N ell : ℕ) (hN : 2 ≤ N) (hell : 1 ≤ ell) :
    IsTranslationFundamentalDomain ell (translationAlcove N ell) ∧
    IsAffineFundamentalDomain ell (dominantAlcove N ell) ∧
    ∀ x : Fin N → ℝ,
      (HasTrivialRealStabilizer ell x ↔
        ∃ (w : AffineWeylElement N) (y : Fin N → ℝ),
          y ∈ interior (dominantAlcove N ell) ∧ realAffineAction ell w y = x) ∧
      (¬HasTrivialRealStabilizer ell x →
        ∃ i j : Fin N, i ≠ j ∧ IsRealRootTranslation ell
          (fun a => x ((Equiv.swap i j).symm a) - x 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: Lemma
Read-back

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

For every pair of natural numbers N,ℓN,\ellN,ℓ satisfying 2≤N2\le N2≤N and 1≤ℓ1\le\ell1≤ℓ, put L=N+ℓL=N+\ellL=N+ℓ and define

T={x∈RN: ∣xi−xj∣≤L for all i,j},D={x∈RN: xj≤xi whenever i≤j, xi−xj≤L for all i,j}.T=\{x\in\mathbb R^N:\ |x_i-x_j|\le L\text{ for all }i,j\}, \qquad D=\{x\in\mathbb R^N:\ x_j\le x_i\text{ whenever }i\le j,\ x_i-x_j\le L\text{ for all }i,j\}.T={x∈RN: ∣xi​−xj​∣≤L for all i,j},D={x∈RN: xj​≤xi​ whenever i≤j, xi​−xj​≤L for all i,j}.

The theorem asserts all of the following: TTT is closed, every x∈RNx\in\mathbb R^Nx∈RN admits an integer vector mmm with ∑imi=0\sum_i m_i=0∑i​mi​=0 and x+Lm∈Tx+Lm\in Tx+Lm∈T, and whenever both xxx and x+Lmx+Lmx+Lm lie in the interior of TTT for such an mmm, one has Lm=0Lm=0Lm=0; DDD is closed, every x∈RNx\in\mathbb R^Nx∈RN admits a zero-sum integer vector mmm and a coordinate permutation σ\sigmaσ for which (xσ−1(i)+Lmi)i∈D\bigl(x_{\sigma^{-1}(i)}+Lm_i\bigr)_i\in D(xσ−1(i)​+Lmi​)i​∈D, and whenever both xxx and this transformed vector lie in the interior of DDD, one has m=0m=0m=0 and σ=id\sigma=\mathrm{id}σ=id. Furthermore, for every x∈RNx\in\mathbb R^Nx∈RN, define its trivial-stabilizer condition to mean that every zero-sum integer vector mmm and every coordinate permutation σ\sigmaσ satisfying xσ−1(i)+Lmi=xix_{\sigma^{-1}(i)}+Lm_i=x_ixσ−1(i)​+Lmi​=xi​ for all iii must satisfy m=0m=0m=0 and σ=id\sigma=\mathrm{id}σ=id. This condition holds if and only if there exist a zero-sum integer vector mmm, a coordinate permutation σ\sigmaσ, and y∈int⁡(D)y\in\operatorname{int}(D)y∈int(D) such that yσ−1(i)+Lmi=xiy_{\sigma^{-1}(i)}+Lm_i=x_iyσ−1(i)​+Lmi​=xi​ for every iii. If the condition fails, there exist distinct coordinate indices i,ji,ji,j and a zero-sum integer vector nnn such that, writing τ\tauτ for the permutation exchanging iii and jjj,

xτ−1(r)−xr=Lnrfor every coordinate index r.x_{\tau^{-1}(r)}-x_r=Ln_r \qquad\text{for every coordinate index }r.xτ−1(r)​−xr​=Lnr​for every coordinate index r.

All interiors here are taken in RN\mathbb R^NRN.

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