Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedjudge pass (gpt-6.1-sol)
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.

Dominant weights classify the simple rational representations of a split reductive group

Statement

Assume the Axiom of Choice inherited from the named suppliers. Let (G,T) be a split reductive group over a field k, let B⊇T be a Borel subgroup, and let X(T)+ be the set of dominant characters of the maximal torus T (Weights, dominant weights and the highest-weight order of a rational representation). For every λ∈X(T)+ there exists a simple rational representation V(λ) of G, unique up to isomorphism, whose T-weight decomposition is V(λ)=V(λ)λ⊕⨁μ<λV(λ)μ with dim⁡kV(λ)λ=1, and every simple rational representation of G is isomorphic to V(λ) for a unique λ∈X(T)+ (Simple rational representations have a unique highest weight, Simple modules with equal highest weight are isomorphic, Every dominant character of a split reductive group is a highest weight). The map sending a simple representation to its highest weight is a bijection from the set of isomorphism classes of simple rational representations of G to X(T)+; it holds in every characteristic.

Facts & Assumptions

Given: AC; a split reductive group (G,T) over k with Borel B⊇T, and a dominant λ∈X(T)+.

[F1]

Existence of primitive vectors of dominant weight. Every dominant λ∈X(T)+ is the highest weight of a simple finite-dimensional rational representation of G, and equivalently there is a rational representation of G containing a primitive vector of weight λ (Every dominant character of a split reductive group is a highest weight).

[F2]

Modules generated by a primitive vector. If a rational representation W of (G,T) is generated as a G-module by a primitive vector v of weight λ, then W=kv⊕⨁μ<λWμ with Wλ=kv one-dimensional, and W has a largest proper G-submodule W′, the quotient W/W′ being a simple G-module generated by the image of v (Modules generated by a primitive vector, Primitive vectors for a Borel pair).

[F3]

Highest weight of a simple module. Every simple rational representation V of G contains a primitive vector v, unique up to a nonzero scalar, its weight λ is dominant, Vλ=kv, every weight μ of V satisfies μ≤λ, and any two primitive vectors of V have the same weight (Simple rational representations have a unique highest weight).

[F4]

Uniqueness. Simple rational representations of (G,T) with equal highest weight are isomorphic (Simple modules with equal highest weight are isomorphic).

[F5]

Finite dimensionality. Simple rational representations of the affine group scheme G of finite type are finite-dimensional (Simple rational representations are finite-dimensional).

Proof

Given: AC; a split reductive group (G,T) over k with Borel B⊇T, and a dominant λ∈X(T)+.

Proof technique: direct.

1.1F1F2F5

Existence: by [F1] there is a rational representation W of G containing a primitive vector v of weight λ. Let W0⊆W be the G-submodule generated by v; by [F2] applied to W0 and v, one has W0=kv⊕⨁μ<λ(W0)μ with (W0)λ=kv one-dimensional, and the quotient V(λ)=W0/W0′ by the largest proper submodule is a simple G-module generated by the image of v. The image of v is nonzero of weight λ, and the weight spaces of the quotient are the images of the weight spaces of W0, so V(λ)λ is the line generated by the image of v and every other weight μ of V(λ) satisfies μ<λ. By [F5] V(λ) is finite-dimensional.

1.2F3F4

Uniqueness and exhaustiveness: let V be any simple rational representation of G. By [F3] V contains a primitive vector v, unique up to scalar, whose weight λV is dominant and is the highest weight of V; the weight λV is therefore uniquely determined by V. If V1,V2 are simple with λV1=λV2, then V1≅V2 by [F4]. Hence the map V↦λV induces a bijection from the set of isomorphism classes of simple rational representations of G to the set of dominant characters realized as highest weights.

2.1step 1.1step 1.2∎

Combining steps 1.1 and 1.2: for every λ∈X(T)+ the module V(λ) of step 1.1 is simple with V(λ)=V(λ)λ⊕⨁μ<λV(λ)μ and dim⁡kV(λ)λ=1, and any simple rational representation is isomorphic to V(λ) for the unique λ∈X(T)+ given by its highest weight. No step used a hypothesis on the characteristic of k, so the classification holds in every characteristic.

Remarks

  • The two halves of the argument are independent: existence comes from the construction of a primitive vector of weight λ followed by the quotient by the largest proper submodule, and uniqueness comes from the comparison of two simple modules with the same highest weight.
  • No separability, characteristic-zero, or algebraic-closure hypothesis appears, in accordance with Milne's Theorem 22.2; the only finiteness input is that simple rational representations of a finite-type affine group scheme are finite-dimensional, used to make V(λ) finite-dimensional.

Depends on

Used by

Dependency tree · two levels

40 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