Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedPipeline-generated
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.

Combinatorics of a reduced root datum

Statement

Let R=(X,Φ,X∨,Φ∨) be a reduced root datum (Abstract root data and their Weyl groups). Then: (a) W(R) is finite and generated by the reflections sα, α∈Φ; for a base Δ⊆Φ it is generated by the simple reflections sα, α∈Δ; (b) the correspondences between bases, positive systems and Weyl chambers are bijective, and W(R) acts simply transitively on the set of Weyl chambers, equivalently on the set of bases; (c) for a chosen positive system Φ+ there is a unique longest element w0∈W(R) with w0(Φ+)=−Φ+, and for every w∈W(R) the integer n(w)=∣Φ+∩w(Φ−)∣ equals the length of w with respect to the simple reflections, with n(w−1)=n(w) and n(w0w)=∣Φ+∣−n(w); (d) Φ spans V=X⊗Q iff the root datum is semisimple, and then Φ is a reduced root system in V in the Euclidean sense.

Facts & Assumptions

Given: A reduced root datum R=(X,Φ,X∨,Φ∨), the Q-vector space V0=QΦ⊆X⊗Q spanned by the roots, and its image under a chosen base and positive system.

[F1]

Root data, reflections, bases, positive systems, chambers, the Weyl group and reducedness are as in Abstract root data and their Weyl groups, with (rd1) ⟨α,α∨⟩=2 and (rd2) sα(Φ)⊆Φ, sα∨(Φ∨)⊆Φ∨.

[F2]

For a reduced crystallographic root system Φ⊆E: the Weyl group W(Φ) is finite and faithful on Φ (The Weyl group is finite and faithful); simple roots form a basis and every root is an integral combination with coefficients of one sign (Simple roots form a signed integral basis); the chambers are the connected components of the complement of the root hyperplanes and W(Φ) permutes them (Open and closed Weyl chambers); the Weyl group acts simply transitively on chambers (Simple transitivity on Weyl chambers).

[F3]

In a reduced crystallographic root system the inversion number ∣N(w)∣=∣{α∈Φ+:wα∈Φ−}∣ of an element w equals its length as a word in simple reflections, and there is a unique longest element w0 with w0(Φ+)=Φ− (Length and longest Weyl-group element, Weyl length equals inversion number).

Proof

1.1F1givenalgebra

Since ⟨α,α∨⟩=2 by (rd1), every α∈Φ is nonzero, and Φ is finite and spans V0 by construction; each sα preserves V0, acts on x∈V0 by x↦x−⟨x,α∨⟩α, fixes the hyperplane ⟨ ,α∨⟩=0 and sends α to −α. Restricting the coroots to V0 gives functionals αˉ∨ with ⟨Φ,αˉ∨⟩⊆Z and sα(Φ)⊆Φ, so (V0,Φ) satisfies the root-system axioms with coroots αˉ∨; reducedness of the root datum is exactly the reducedness of this root system. Since W(R) is finite by (rd3) and acts on the finite-dimensional real vector space V0⊗R, averaging an arbitrary inner product over W(R) produces an invariant inner product. For an invariant inner product the relation ⟨x,αˉ∨⟩=2(x,α)/(α,α) holds for all x, and the right side is independent of the choice of invariant inner product; hence sα∣V0 is the orthogonal reflection with vector α of the Euclidean theory, and the image of W(R) in GL⁡(V0) is precisely the Weyl group W(Φ) of the reduced crystallographic root system (V0,Φ) in the sense of Weyl group.

2.1F1F2step 1.1algebra

The natural map W(R)→W(Φ) is surjective because the reflections generating the latter are restrictions of the generators of W(R). For injectivity let w restrict to the identity on V0. Each reflection acts as the identity on V/V0, where V=X⊗Q, since its difference from the identity has image in the root line. Consequently D=w−1 sends V into V0 and vanishes on V0, so D2=0. The finite group W(R) gives wm=1 for some positive integer m; the binomial identity (1+D)m=1+mD then forces D=0 over Q. Thus w=1 and W(R)≅W(Φ). This also transfers finiteness, faithful action on the roots, and generation by the simple reflections of any base.

3.1F2step 1.1step 2.1

By the identification W(R)=W(Φ) of step 2.1, [F2] transfers verbatim: the simple roots of a base Δ form a basis, every root is an integral combination of Δ with coefficients of one sign, the Weyl chambers are the connected components of the complement of the hyperplanes ⟨ ,α∨⟩=0, and W(R) acts simply transitively on them. To compare with the chambers in the full character space, average an inner product on V⊗R over the finite group W(R). Its orthogonal decomposition is (V0⊗R)⊕V0⊥. Each reflection fixes V0⊥ pointwise: its difference from the identity lies in V0, while invariance of the form keeps that difference in V0⊥. Thus every coroot functional vanishes there, and the full chambers are products of the root-span chambers with V0⊥. The transferred action is therefore simply transitive also on the full chambers. Moreover the sign conditions defining positive systems and the indecomposability defining simple roots are the same in the two languages, so bases, positive systems and chambers correspond bijectively, and simple transitivity on chambers is equivalent to simple transitivity on bases.

4.1F1F3step 1.1algebra∎

By [F3] applied to (V0,Φ) there is a unique longest element w0∈W(R) with w0(Φ+)=−Φ+, and for every w the inversion number n(w)=∣Φ+∩w(Φ−)∣ equals the length in simple reflections. Further n(w−1)=n(w), because length is the minimum word length and w−1=sim⋯si1 whenever w=si1⋯sim is minimal. Finally n(w0w)=∣Φ+∣−n(w). For α∈Φ+ put β=−w0−1α∈Φ+; this is a bijection of Φ+. The condition α∈w0w(Φ−) says w−1w0−1α∈Φ−, equivalently w−1β∈Φ+. These are precisely the complement of the n(w) positive roots whose image under w−1 is negative. Therefore the required count is ∣Φ+∣−n(w). If the root datum is semisimple, then ZΦ has finite index in X, so QΦ=X⊗Q=V and Φ is a reduced root system in V in the Euclidean sense by step 1.1; conversely if Φ spans X⊗Q then the finitely generated subgroup ZΦ has full rank, hence finite index, in X, so the root datum is semisimple.

Depends on

Used by

Dependency tree · two levels

13 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