Affine Weyl closed fundamental domains
OpenQAlgorithms.Papers.Independent.Intakenext100.P41.affineWeylAlcoveLet , , , , and acting by translations and coordinate permutations on . Put
The closed set is a fundamental domain for , and is one for : every orbit meets the respective domain and distinct translates have disjoint interiors. A point belongs to the -orbit of exactly when its affine stabilizer is trivial. At every other point , there is a transposition with .
The assertion allows repeated boundary representatives. Singularity is a congruence modulo the root lattice, not necessarily a transposition fixing the point itself.
import Definitions.Def_QAlgorithms_Papers_Independent_Intakenext100_P41
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
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
For every pair of natural numbers satisfying and , put and define
The theorem asserts all of the following: is closed, every admits an integer vector with and , and whenever both and lie in the interior of for such an , one has ; is closed, every admits a zero-sum integer vector and a coordinate permutation for which , and whenever both and this transformed vector lie in the interior of , one has and . Furthermore, for every , define its trivial-stabilizer condition to mean that every zero-sum integer vector and every coordinate permutation satisfying for all must satisfy and . This condition holds if and only if there exist a zero-sum integer vector , a coordinate permutation , and such that for every . If the condition fails, there exist distinct coordinate indices and a zero-sum integer vector such that, writing for the permutation exchanging and ,
All interiors here are taken in .
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.