Alphabeta Math
CounterexampleConstruction: Literature-sourcedVerification: 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.

Rational modules need not be semisimple in characteristic p

Statement refuted

Assume the Axiom of Choice inherited from the named suppliers. The claim that every finite-dimensional rational representation of a split reductive group is semisimple is false. For every prime p the following is a counterexample (Complete reducibility of rational modules in characteristic zero). Let k be a field of characteristic p and let G=SL2 act on V=Sp(k2), the symmetric power of the standard two-dimensional representation, with T2 acting through the characters p,p−2,…,−p (Structure of SL_2 and root coordinates, The simple modules of SL_2 and its fundamental representation). Let W⊆V be the span of e1p and e2p. Then W is a two-dimensional simple submodule (the Frobenius twist of L(1)), every simple submodule of V equals W, so the socle of V is W, and dim⁡kV=p+1>2. Hence V is a nonsemisimple finite-dimensional rational representation of the split reductive group SL2, even though the dominant weights still classify the simple rational representations (Dominant weights classify the simple rational representations of a split reductive group).

Facts & Assumptions

Given: AC; a prime p, a field k of characteristic p, G=SL2 with diagonal torus T2 and upper unipotent group U+, and V=Sp(k2) with its standard basis monomials e1ae2p−a.

[F1]

The Frobenius-twist submodule. W=ke1p⊕ke2p is a two-dimensional simple G-submodule of V isomorphic to L(p), with Wpχ=ke1p; it is the Frobenius twist of L(1)=k2, and e1p generates W as a G-module (The simple modules of SL_2 and its fundamental representation).

[F2]

Primitive vectors of simple modules. Every simple rational representation of G contains a primitive vector, unique up to a nonzero scalar, whose weight is its highest weight (Simple rational representations have a unique highest weight, Primitive vectors for a Borel pair).

[F3]

Weights and the unipotent action on V. The monomials e1ae2p−a (0≤a≤p) form a k-basis of V of T2-eigenvectors, with e1ae2p−a of weight (2a−p)χ=(p−2(p−a))χ, and uα(t)⋅e1ae2p−a=e1a(e2+te1)p−a for t∈k, where uα(t)=(1 t0 1) acts by e1↦e1 and e2↦e2+te1 (Structure of SL_2 and root coordinates, Symmetric algebra of a vector space, Weights, dominant weights and the highest-weight order of a rational representation, Rational representations and comodules of an affine group scheme).

[F4]

Classification. The simple rational representations of G are classified up to isomorphism by their dominant highest weights (Dominant weights classify the simple rational representations of a split reductive group).

Counterexample

Given: AC; a prime p, a field k of characteristic p, G=SL2 with diagonal torus T2 and upper unipotent group U+, and V=Sp(k2) with its standard basis monomials e1ae2p−a.

Proof technique: direct.

1.1F3

The basis monomials e1ae2p−a of V are T2-eigenvectors of weights (2a−p)χ for a=0,…,p, i.e. of the characters −p,−p+2,…,p; each weight space of V is therefore one-dimensional and spanned by a single monomial, and T2 acts through the characters p,p−2,…,−p as claimed.

2.1F3givenalgebra

The primitive vectors of V are exactly the nonzero multiples of e1p. Indeed, a primitive vector is a nonzero T2-eigenvector fixed by U+ (Unipotent algebraic groups and unipotent representations, Primitive vectors for a Borel pair), hence by step 1.1 is a nonzero multiple of some monomial ma=e1ae2p−a; and uα(t)⋅ma=e1a(e2+te1)p−a has, as the coefficient of e1p, the term tp−a (the i=p−a summand, with binomial coefficient 1). If a<p, the original monomial has zero coefficient of e1p, whereas the translated coefficient is the nonzero polynomial tp−a in k[t]. Thus fixedness over every base algebra excludes a<p. For a=p, uα(t)⋅e1p=e1p for all t, so e1p is fixed.

3.1F1F2step 1.1step 2.1

Let S⊆V be a nonzero submodule; if S is simple, then by [F2] it contains a primitive vector v, which by step 2.1 is a nonzero multiple of e1p; hence e1p∈S. By [F1] the G-submodule generated by e1p is W (it is nonzero and contained in the simple module W), so W⊆S, and simplicity of S gives S=W. Therefore W is the unique simple submodule of V and the socle of V is W. Since dim⁡kV=p+1 while dim⁡kW=2, a semisimple V would be the sum of its simple submodules, namely W, which is impossible; hence V is not semisimple.

4.1F4step 3.1∎

The representation V=Sp(k2) is finite-dimensional and rational, G=SL2 is a split reductive group of characteristic p, and V is not semisimple by step 3.1, while its simple submodules and those of every rational G-module are still classified by the dominant weights by [F4]. This refutes the claim that every finite-dimensional rational representation of a split reductive group is semisimple.

Remarks

  • The failure has the same source as the Frobenius twist of the example: the submodule W generated by e1p is only two-dimensional inside the (p+1)-dimensional symmetric power, so the top-weight vector does not generate V in characteristic p.
  • The statement refers to the characteristic-zero theorem Complete reducibility of rational modules in characteristic zero; the counterexample is compatible with the classification theorem, which only parametrizes simple modules and says nothing about extensions.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

64 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