Alphabeta Math
LemmaStatement: 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.

Connected groups of rank zero are unipotent

Statement

Assume the Axiom of Choice inherited from the named suppliers. Let G be a smooth connected affine group variety over k. Then G is unipotent (Unipotent algebraic groups and unipotent representations) if and only if Gka contains no nontrivial torus, equivalently if and only if G has rank 0 (Split reductive groups); in particular a smooth connected affine group variety of rank 0 is unipotent. Consequently a smooth connected affine group variety of semisimple rank 0 is solvable, and a reductive group of semisimple rank 0 is a torus.

Facts & Assumptions

Given: AC and a smooth connected affine group G of finite type over k.

[F1]

A unipotent group remains unipotent after field extension, and unipotence descends under field extension. Subgroups, quotients and extensions of unipotent groups are unipotent; a multiplicative-type subgroup of a unipotent group is trivial. These statements follow from the fixed-vector criterion and its faithful upper-unitriangular realization. (Unipotent algebraic groups and unipotent representations, Unipotent groups are exactly the subgroups of some U_n, equivalently the groups with coconnected coordinate Hopf algebra, Groups of multiplicative type and tori)

[F2]

Over an algebraically closed field a smooth connected affine group has a Borel subgroup B, which is smooth connected solvable, and G/B is complete. A smooth connected solvable group is trigonalizable and has a decomposition B=Bu⋊T with Bu smooth connected unipotent and T a torus. (Borel subgroups, maximal tori and Borel pairs, The quotient of a connected group by a Borel subgroup of maximal dimension is complete, Lie-Kolchin: smooth connected solvable affine groups over algebraically closed fields are trigonalizable, Unipotent radicals of smooth connected trigonalizable groups over perfect fields have normal G_a series, Splitting trigonalizable extensions: algebraically closed fields and two perfect-field cases)

[F3]

A closed subgroup scheme B of an affine group is the scheme-theoretic stabilizer of a line in a finite-dimensional rational representation. The fppf quotient G/B is a separated finite-type scheme and G→G/B is faithfully flat and locally of finite presentation. Regularity descends along flat local maps; thus over an algebraically closed field this quotient of a smooth group is smooth, in particular reduced. A morphism from a complete connected reduced finite-type scheme to an affine scheme has a single closed point as image. (Every subgroup scheme of an affine group is a line stabilizer, Homogeneous spaces of smooth affine groups are separated schemes, Regularity ascends and descends along a flat local homomorphism, Morphisms from complete connected schemes to affine schemes are constant)

[F4]

The radical R(G) is smooth connected normal solvable. Semisimple rank means the rank of G/R(G). Solvability is closed under extensions, by pulling back a derived series. For a smooth connected solvable group over an algebraically closed field, Bu in [F2] is a smooth connected normal unipotent subgroup; a reductive group has no nontrivial such subgroup after algebraic closure. (Radical, unipotent radical, semisimple and reductive algebraic groups, Split reductive groups, The derived subgroup, the derived series and solvable algebraic groups)

Proof

Given: AC and a smooth connected affine group G of finite type over k.

1.1F1F2choose

If G is unipotent, then Gka is unipotent and contains no nontrivial torus by [F1]. Conversely, suppose there is no such torus. By field-extension descent of unipotence we may work over ka, and hence assume k algebraically closed. Choose a Borel subgroup B and write B=Bu⋊T by [F2]. Since T⊆G and there are no nontrivial tori, T=1, so B=Bu is unipotent.

2.1F1F3step 1.1choose

By [F3] choose a representation W and a line L=kv with B=Stab⁡G(L). The one-dimensional representation L of the unipotent group B is trivial by its fixed-vector criterion, so every element of B fixes v scheme-theoretically. Consequently B=Stab⁡G(v): the vector stabilizer lies in the line stabilizer, and the reverse inclusion was just proved. The orbit morphism g↦gv is right B-invariant and descends by the fppf quotient to a morphism f:G/B→W.

3.1F2F3step 1.1step 2.1

The scheme G/B is complete by [F2], connected as the surjective image of connected G, and reduced by [F3]. Thus f has a single closed point as image. It contains v=f(eB), so the point is v. Since G/B is reduced, every coordinate function of f−v vanishes: over the algebraically closed field the closed points are dense on each affine open and their vanishing ideal is the nilradical. Therefore f factors scheme-theoretically through v. Pulling back along G→G/B shows that all of G fixes v, so G=Stab⁡G(v)=B is unipotent. This proves the rank-zero equivalence.

4.1F1F4step 3.1

If G has semisimple rank zero, its smooth connected affine quotient Q=G/R(G) has rank zero and is unipotent by step 3.1 and [F1]. It is therefore solvable. Since R(G) is solvable, [F4] makes G solvable, so G=R(G) by maximality of the radical. This conclusion does not require asserting that Q is geometrically semisimple over an imperfect field.

5.1F2F4step 4.1∎

If in addition G is reductive, pass to the algebraic closure. The solvable group Gka decomposes as (Gka)u⋊T by [F2]. Its smooth connected normal unipotent factor is trivial by reductivity, so Gka=T. Hence G is a torus by the definition of a torus as a group becoming a split torus over an algebraic closure. This proves the final assertion.

Depends on

Used by

Dependency tree · two levels

120 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