Alphabeta Math
PropositionStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedjudge pass (gpt-5.6-terra)audited 2026-09-13
How statement and proof provenance work

The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.

  • Literature-sourced: the exact statement appears in a cited source; only wording and notation differ.
  • AI-adapted: a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
  • AI-generated: a genuinely novel statement formulated by AI, with no source for the claim itself.

These labels describe origin, not correctness: citations and verification chips remain separate evidence.

Affine Weyl group is a coroot lattice semidirect product

Statement

The untwisted affine Weyl group has a normal translation subgroup indexed by the finite coroot lattice Q∨. Every element is uniquely tγw with γ∈Q∨, w∈W0, and tγtη=tγ+η,wtγw−1=twγ. With B the normalized invariant form used in the loop realization and ν(γ)=B(γ,−) on the finite Cartan, the translation action on the full dual Cartan is tγ(λ)=λ+λ(c)ν(γ)−(λ(γ)+12B(γ,γ)λ(c))δ. Thus Waff≅Q∨⋊W0. The convention sometimes written W0⋉Q∨ denotes the same group, with its second factor normal.

Facts & Assumptions

Given: The full untwisted affine algebra in its normalized loop convention.

[F1]

Its Cartan and simple generators agree with the GCM realization by Loop and affine GCM presentations are isomorphic.

[F2]

The affine root and coroot are α0=δ−θ, h0=c−θ∨, with θ long and (θ,θ)=2, by The affine simple root alpha zero is delta minus the highest root.

[F3]

Reflections act by siλ=λ−λ(hi)αi, by Simple reflections and the kac moody weyl group.

[F4]

The normalized invariant form B is fixed by Residue two cocycle on a loop algebra; finite roots, coroots, its positive definite real restriction and simple generation are Finite semisimple Cartan, root and string structure.

[F5]

The finite Weyl group is finite, preserves the root/coroot lattices, and is generated by its simple reflections by Finite Weyl positive roots and simple reflections.

Proof

1.1F1F4algebra

Extend the ν in the statement to vanish on c,d. The displayed operators fix δ and preserve λ(c). In a composition the additional cross term in the δ coefficient is B(γ,η)λ(c), so symmetry gives tγtη=tγ+η. Thus t0=1 and t−γ is the inverse. If tγ=1, applying it to every level-zero functional gives λ(γ)=0 for all finite λ, hence γ=0.

1.2F4F5algebra

In the Euclidean coroot system let V be the real span of W0θ∨. It is nonzero and W0-invariant. For a coroot β not orthogonal to V, some v∈V has (v,β)≠0; the reflection formula makes v−sβv a nonzero multiple of β, so β∈V. Thus every coroot belongs to either V or V⊥. If both classes occurred, finite roots would likewise split into two nonempty orthogonal classes. The corresponding root spaces and coroot spans would form commuting ideals: a mixed root sum lies in neither span, so is not a root; mixed Cartan actions vanish; opposite-root brackets lie in their corresponding coroot spans. This contradicts simplicity of g. Consequently V is the entire coroot space.

2.1F2F3F4F5step 1.1algebra

Finite W0 fixes c,d,δ, preserves B and satisfies wν(γ)=ν(wγ). Substitution proves wtγw−1=twγ. Since ν(θ∨)=θ and B(θ∨,θ∨)=2, substitution also gives tθ∨sθ(λ)=λ−(λ(c)−λ(θ∨))(δ−θ)=s0λ. Here sθ∈W0 by F5. Hence tθ∨ and all its finite Weyl conjugates belong to Waff.

3.1F2F4F5step 1.1step 2.1step 1.2algebra

Let M be the integer span of W0θ∨. For any coroot β, step 1.2 supplies an orbit coroot α with (α,β)≠0. It has minimal coroot length because θ is long. If proportional, reducedness gives β=±α∈M. Otherwise integrality and strict Cauchy–Schwarz give 0<∣2(α,β)(β,β)∣<2∥α∥∥β∥≤2. The integer has absolute value one. Since M is Weyl invariant, α−sβα=±β∈M. Every coroot belongs to M, so M=Q∨. Steps 1.1 and 2.1 therefore put every tγ, γ∈Q∨, in Waff.

4.1F1F4F5step 1.1step 2.1step 3.1algebra∎

The products tγw form a group by steps 1.1 and 2.1 and lattice preservation. They contain all finite simple reflections and s0=tθ∨sθ, so form all of Waff. Let Λ vanish on h,d and have Λ(c)=1. Finite W0 fixes it, whereas tγΛ=Λ+ν(γ)−B(γ,γ)δ/2. Thus tγ∈W0 forces ν(γ)=0, hence γ=0. Trivial intersection gives uniqueness by comparing two products. Zero translation, identity finite factor and rank one are included. Every lattice expression is a finite sum and no AC is used.

Depends on

Used by

Dependency tree · two levels

21 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.

Sources