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

Root order on weights

Definition

Assume the Axiom of Choice. Let g be a finite-dimensional complex semisimple Lie algebra with Cartan subalgebra h and root system Φ, and let Φ+ be a chosen positive system with base Δ={α1,…,αr} of simple roots (Positive systems and simple roots, The roots form a reduced crystallographic Euclidean root system). By Simple roots form a signed integral basis Δ is a basis of E=span⁡RΦ, so every element of E has unique real coefficients in this basis; the root lattice Q consists of the integral combinations of Δ (Root, coroot, weight, and coweight lattices). Put Q+:={∑i=1rniαi: ni∈Z≥0}⊆Q.

For λ,μ∈h∗ write μ≤λ when λ−μ∈Q+; in words, when λ−μ is a nonnegative integral combination of the chosen simple roots. This is the root order on h∗. In particular μ≤λ forces λ−μ∈E, so comparable functionals lie in the same affine coset of E in h∗; neither functional need itself lie in E.

The root order is a partial order. Reflexivity holds with ni=0. Antisymmetry: if μ≤λ and λ≤μ, then ∑i(mi+ni)αi=0 with mi,ni≥0, and linear independence of the simple roots forces mi+ni=0, so mi=ni=0 and λ=μ. Transitivity: if ν≤μ and μ≤λ, then λ−ν=(λ−μ)+(μ−ν) is a sum of two elements of Q+, hence lies in Q+ and ν≤λ. Thus ≤ is a partial order on h∗; restricted to any set of weights it is a partial order on that set, and every comparison chain of weights is finite whenever the weight set is finite, because a strict increase adds a nonzero element of Q+.

Depends on

Used by

Dependency tree · two levels

25 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