Regular and singular affine signature orbits
OpenQAlgorithms.Papers.Independent.Intakenext100.P41.affineSignatureClassificationLet , , , , and . For every ,
where and is an integral signature with . Also,
The representative is unnormalized; imposing would destroy the statement since affine translations preserve coordinate sum.
import Definitions.Def_QAlgorithms_Papers_Independent_Intakenext100_P41
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
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
For all natural numbers satisfying and , and every integer vector indexed by , put . Say that has trivial stabilizer when, for every integer vector with and every permutation of , the equations for all imply and . The theorem asserts both of the following equivalences: has trivial stabilizer if and only if there exists exactly one pair consisting of such an and an integer vector satisfying whenever and for every , for which for every ; and does not have trivial stabilizer if and only if there exist distinct indices and an integer vector with such that for every , where is the permutation exchanging and and fixing every other index. Uniqueness in the first equivalence concerns the entire pair, including the translation, permutation, and permissible vector.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.