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.

Multiples of the fundamental weights are primitive weights in the semisimple case

Statement

Assume the Axiom of Choice inherited from the named suppliers. Let (G,T) be a split semisimple group over k with base Δ, fundamental weights ωi, and let i∈Δ (The root datum of a split reductive group, Weights, dominant weights and the highest-weight order of a rational representation). Then there exists d>0 such that dωi∈X(T) and dωi is the weight of a primitive vector of some finite-dimensional rational representation of G (Primitive vectors from standard maximal parabolics, Abstract root data and their Weyl groups).

Facts & Assumptions

Given: AC; a split semisimple group (G,T) with base Δ, an index i∈Δ, and a split Borel B⊇T.

[F1]

Primitive vectors with prescribed coroot pairings. For every index j there exist a finite-dimensional rational representation Vj of G and a primitive vector vj∈Vj whose weight λj satisfies ⟨λj,αk∨⟩=0 for k≠j and ⟨λj,αj∨⟩>0; when the root datum is semisimple, λj=⟨λj,αj∨⟩ωj (Primitive vectors from standard maximal parabolics).

[F2]

Fundamental weights. The fundamental weights ωj∈X(T)⊗ZQ are dual to the simple coroots, ⟨ωj,αk∨⟩=δjk, and every x∈X(T)⊗Q decomposes as x=∑j⟨x,αj∨⟩ωj+x0 with ⟨x0,αj∨⟩=0 for all j (Weights, dominant weights and the highest-weight order of a rational representation).

[F3]

Semisimple case. G is semisimple if and only if ZΦ has finite index in X(T) (The root datum of a split reductive group, Centre, radical and semisimple quotient of a reductive group); in that case Φ spans X(T)⊗Q (Combinatorics of a reduced root datum), so the annihilator X0={x∈X(T):⟨x,α∨⟩=0 for all α∈Φ} is zero, as is its rational counterpart (Milne 22.9).

Proof

Given: AC; a split semisimple group (G,T) with base Δ, an index i∈Δ, and a split Borel B⊇T.

Proof technique: direct.

1.1F3

Since G is semisimple, its root datum is semisimple and the annihilator X0 is zero by [F3].

2.1F1F2step 1.1

Apply [F1] with j=i: there exist a finite-dimensional rational representation Vi and a primitive vector vi∈Vi of weight λi with d:=⟨λi,αi∨⟩ a positive integer. In the semisimple case [F1] gives λi=dωi, with ωi as defined in [F2].

3.1step 2.1∎

Therefore d>0, dωi=λi∈X(T), and dωi is the weight of the primitive vector vi in the finite-dimensional rational representation Vi of G.

Remarks

  • The proof is Milne's second proof of Theorem 22.20 in the semisimple case: the Mostow argument (Lemma 22.24) produces a primitive vector whose weight pairs trivially with all simple coroots but one, and semisimplicity of the root datum forces that weight to be a positive multiple of the corresponding fundamental weight.
  • For a general reductive root datum the coroot annihilator can be nonzero, so the weight produced by the parabolic construction need not be a multiple of ωi; only its pairings are controlled, which is why the reductive case is handled separately through the product Z(G)t×Gder.

Depends on

Used by

Dependency tree · two levels

45 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