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

The highest-weight classification does not imply semisimplicity in positive characteristic

Remarks

Assume the Axiom of Choice inherited from the named suppliers (The Axiom of Choice). The classification of Dominant weights classify the simple rational representations of a split reductive group holds for a split reductive group over every field, but it does not imply that every rational representation is semisimple. Complete reducibility is a characteristic-zero phenomenon (Complete reducibility of rational modules in characteristic zero); in characteristic p>0 a split reductive group need not be linearly reductive, as the companion counterexample Rational modules need not be semisimple in characteristic p ↗ on this pair's examples page shows (Milne Example 12.55 and Exercise 12-9; Steinberg Ch. 12, the paragraph after Theorem 39(e)). Readers should not infer semisimplicity of Rep⁡(G) from the existence and uniqueness of simple modules with prescribed dominant highest weight.

The two statements concern different properties: the classification theorem only asserts that simple modules are parametrized by dominant weights and that the top weight space is one-dimensional, while semisimplicity of every finite-dimensional rational representation is a strictly stronger property that fails already for SL2 in characteristic p>0 (Split reductive groups).

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

35 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