Alphabeta Math
DefinitionDefinition: AI-adaptedProof: Not applicablePipeline-generatedjudge pass (gpt-5.6-terra)audited 2026-09-12
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.

Finite Weyl root system, lattice and chamber conventions

Definition

Let E be a finite-dimensional real vector space with a positive definite symmetric bilinear form ( , ). A finite reduced crystallographic root system is a finite subset Φ⊆E∖{0} spanning E, such that for every α,β∈Φ the integer ⟨β,α∨⟩=2(β,α)/(α,α) is integral, the reflection sα(x)=x−⟨x,α∨⟩α preserves Φ, and the only scalar multiples of α in Φ are α,−α. The Weyl group W is the subgroup of linear isometries of E generated by these reflections. A root reflection means one of the sα. The empty root system on E=0 is allowed, with W={1}.

Choose t∈E such that (t,α)≠0 for every root. Put Φ+={α:(t,α)>0} and Φ−=−Φ+. A positive root is simple if it is not the sum of two positive roots. The following positive-root lemma proves that the simple roots form a basis α1,…,αr and that the simple reflections si=sαi generate W; no such assertion is assumed by this definition. Once proved, let ℓ(w) be the least number of simple reflections in a word for w and let Inv⁡(w)={α∈Φ+:wα∈Φ−}. A word is reduced if its length equals ℓ(w).

Identify E with its dual by the displayed form, so α∨=2α/(α,α). The root and coroot groups are Q=∑α∈ΦZα and Q∨=∑α∈ΦZα∨. The weight group is P={λ∈E:(λ,α∨)∈Z for all α∈Φ}; the positive-root lemma proves it is a lattice with basis the vectors dual to the simple coroots. Put Q+=∑iZ≥0αi, and write μ≤λ when λ−μ∈Q+. The open and closed positive chambers are C={x:(x,αi)>0 for all i} and C‾={x:(x,αi)≥0 for all i}. A weight is dominant if it belongs to P∩C‾. More generally chambers are the connected components of E∖⋃α∈Φα⊥. The closed-chamber representative and stabilizer assertions are proved later, not included as axioms.

Used by

…and 2 more results.

Dependency tree · 0 levels

Nothing. This result depends on no other item in the library.

Sources