Alphabeta Math
DefinitionDefinition: Literature-sourcedProof: Not applicablePipeline-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.

Abstract root data and their Weyl groups

Definition

A root datum is a quadruple (X,Φ,X∨,Φ∨) consisting of free Z-modules X,X∨ of finite rank in perfect duality ⟨ , ⟩:X×X∨→Z, finite subsets Φ⊆X and Φ∨⊆X∨, and a bijection α↦α∨ from Φ to Φ∨, subject to (rd1) ⟨α,α∨⟩=2 for all α∈Φ; (rd2) the reflections sα(x)=x−⟨x,α∨⟩α and sα∨(y)=y−⟨α,y⟩α∨ satisfy sα(Φ)⊆Φ and sα∨(Φ∨)⊆Φ∨; (rd3) the group W(R) generated by the sα acting on X is finite. The root datum is reduced if Qα∩Φ={±α} for every α∈Φ. The group W(R) is the Weyl group, Φ the root system and Φ∨ the coroot system; W(R) acts dually on X∨ by the sα∨, and sα fixes the hyperplane ⟨ ,α∨⟩=0. For VR=X⊗ZR, the Weyl chambers are the connected components of VR∖⋃α∈Φ{x:⟨x,α∨⟩=0}, and a base is a linearly independent subset Δ⊆Φ such that every root is a Z-combination of Δ with all coefficients of one sign. A root datum is semisimple if ZΦ has finite index in X.

The reflection sα depends only on the pair (α,α∨): it fixes the hyperplane ⟨ ,α∨⟩=0, sends α to −α by (rd1), and is determined by those two conditions on the rational direct sum Qα⊕ker⁡(⟨ ,α∨⟩:X⊗Q→Q). The lattice form above is related to the Euclidean root-system theory of Weyl group and Positive systems and simple roots through a W-invariant form on VR, but no choice of invariant inner product belongs to the definition. The perfect character–cocharacter pairing for a split torus is supplied by Character and cocharacter lattices of a split torus; roots and coroots are additional data, not supplied by that lattice lemma.

An isomorphism of root data R=(X,Φ,X∨,Φ∨)→R1=(X1,Φ1,X1∨,Φ1∨) is a pair of Z-linear isomorphisms f:X→X1 and f∨:X1∨→X∨ that are transpose to one another, ⟨f(x),y1⟩=⟨x,f∨(y1)⟩ for all x∈X, y1∈X1∨, and that carry Φ bijectively onto Φ1 with f(α)∨=f∨−1(α∨) for every α∈Φ. Composites of isomorphisms are isomorphisms, with the evident inverses, so root data form a category whose isomorphisms are these pairs; this is the notion of isomorphism used when separating the root data of SL_2 and PGL_2.

Depends on

Used by

Dependency tree · two levels

9 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