Alphabeta Math
DefinitionDefinition: AI-adaptedProof: Not applicablePipeline-generatedjudge pass (gpt-6.1-sol)audited 2026-10-08
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 root hyperplanes, coroot translations, alcoves, and the affine reflection group

Definition

Let E be a finite-dimensional real inner-product space with inner product B (Real and complex inner product spaces, with the inner product linear in the first argument). Equip it with the induced norm ∥x∥B=B(x,x) (The norm ∥v∥=⟨v,v⟩ induced by a real or complex inner product, The induced length is a norm) and metric dB(x,y)=∥x−y∥B (A norm on a real vector space, the induced metric, and the dictionary with the metric axioms); Isom(E) below means the isometry group for dB (Isometry, isometric embedding, and the subspace metric on a subset). Let Φ⊆E be a supplied reduced crystallographic root system spanning E (Reduced crystallographic Euclidean root system). For each α∈Φ, put α∨=2α/B(α,α) (Coroot and dual root system); write sα for the orthogonal reflection in the hyperplane B(x,α)=0 and W=W(Φ)=⟨sα:α∈Φ⟩ for the Weyl group (Weyl group). Write Q=∑α∈ΦZα and Q∨=∑α∈ΦZα∨ for the root and coroot lattices (Root, coroot, weight, and coweight lattices), and fix a positive system with base Δ={αs:s∈S} (Positive systems and simple roots).

For α∈Φ and k∈Z, define Hα,k:={x∈E:B(x,α)=k},rα,k(x):=x−(B(x,α)−k)α∨. Each Hα,k is an affine hyperplane: B(−,α) is a nonzero linear functional, and kα/B(α,α) lies in its level-k set. The sets Hα,k are the affine root hyperplanes or walls, and AΦ:={Hα,k:α∈Φ, k∈Z} is their affine wall arrangement. An alcove is a connected component of E∖⋃AΦ, with the subspace topology (Subspace topology: the traces of the open sets, its closed sets and its bases, the continuity of the inclusion, and the characteristic property of a map into a subspace, Connected components, quasicomponents, and totally disconnected spaces).

The affine reflection group Wa is the subgroup of the Euclidean isometry group Isom(E) generated by the maps rα,k (The subgroup ⟨S⟩ generated by a subset, the cyclic subgroup ⟨g⟩, and cyclic groups, Isometry, isometric embedding, and the subspace metric on a subset). The well-definedness obligation for this subgroup is assigned to lem-cg-affine-reflection-identities-and-local-finiteness, which verifies that each generator is an isometry. The coroot translation group is the image of the homomorphism Q∨→Isom(E), λ↦tλ, where tλ(x)=x+λ.

The Weyl group acts on Q∨ by w⋅λ:=w(λ). This action is by automorphisms: W permutes Φ, and for every root α, w(α∨)=2wαB(α,α)=2wαB(wα,wα)=(wα)∨, so w(Q∨)=Q∨ and the restriction has inverse w−1∣Q∨. These restrictions compose according to multiplication in W, giving the action required for the external semidirect product Q∨⋊W (Left group actions, transitive actions, and faithful actions, An action of a group H on a group N by automorphisms, The external semidirect product N⋊αH), whose multiplication is (λ,w)(μ,v)=(λ+wμ,wv).

This item fixes the definitions and conventions. It does not assert Wa=Q∨⋊W, local finiteness of the arrangement, that alcoves are simplices, or that any specified alcove is a fundamental domain. The root system is supplied; no crystallographic scaling for a Coxeter matrix is constructed, and non-crystallographic types are outside this definition. No choice principle is used.

Depends on

Used by

Dependency tree · two levels

51 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