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.

Maximal tori, field extensions, normal subgroups and derived groups

Statement

Assume the Axiom of Choice inherited from the named suppliers. Let G be a smooth connected affine group variety over k. (a) A torus T⊆G is maximal iff Tk′ is maximal in Gk′ for every field extension k′/k; equivalently iff CG(T)/T contains no nontrivial torus. (b) There is a maximal torus of Gka defined over k. (c) If G is reductive, then a torus T⊆G is maximal iff CG(T)=T. (d) If N⊆G is a smooth connected normal subgroup variety and T a maximal torus of G, then (T∩N)t, the largest subtorus of T∩N, is a maximal torus of N, and every maximal torus of N arises this way. (e) If G=G1⋯Gn is an almost-direct product of connected subgroup varieties, then every maximal torus T of G is an almost-direct product T=(T∩G1)t⋯(T∩Gn)t. (f) Any two maximal tori of G become conjugate over some finite separable extension of k; in particular they are conjugate over a separably closed field.

Facts & Assumptions

Given: AC, smooth connected affine G over arbitrary k, and a torus T⊆G. The subscript t denotes the largest subtorus of a group of multiplicative type, namely its reduced neutral component.

[F1]

Torus centralizers in smooth connected affine groups are smooth connected. The maximal-torus criterion says T is maximal if and only if CG(T)/T contains no nontrivial k-torus. A smooth connected nilpotent affine group has a central largest multiplicative-type subgroup which is a torus, with unipotent quotient. (Fixed loci and centralizers of torus actions are connected, Structure of connected nilpotent groups and the maximal-torus criterion)

[F2]

Unipotence is preserved and detected under field extension: under AC its faithful upper-unitriangular embedding persists, and descent follows from (VG)⊗K=(V⊗K)GK for finite-dimensional V. Over an algebraically closed field, maximal tori are conjugate; for a reductive group CG(T)=T when T is geometrically maximal. (Unipotent groups are exactly the subgroups of some U_n, equivalently the groups with coconnected coordinate Hopf algebra, Unipotent algebraic groups and unipotent representations, Conjugacy of Borel subgroups and of maximal tori over an algebraically closed field, Chevalley's centralizer theorem and reductive centralizers)

[F3]

A nonempty smooth finite-type scheme has a point over a finite separable extension. Multiplicative-type rigidity makes a connected group act trivially by group automorphisms on a torus. Thus NG(T)∘=CG(T); smoothness of the latter and translation to all geometric components show NG(T) smooth. (A nonempty smooth scheme has a finite separable point, Fixed loci and centralizers of torus actions are connected; Milne12.36–12.40.)

[F4]

Groups of multiplicative type are classified under AC by Galois character modules. Their largest subtorus corresponds to the quotient of the character module by its torsion subgroup, so its formation commutes with field extension. Affine homomorphic images are closed and satisfy the kernel/image exact theorem; reductions over perfect fields are subgroup varieties, and smooth connected groups have smooth connected derived subgroup. (Multiplicative type groups and Galois character modules, Group images are exact kernel quotients and preserve affine smooth connected properties, Reduced identity components over perfect fields, Properties of the derived subgroup of an algebraic group)

[F5]

The precise extra arbitrary-field input is Milne17.81: a smooth connected affine group over k containing no nontrivial k-torus is unipotent. The full source proof uses the central multiplicative factor for nilpotent groups; over infinite fields it reduces dimension through a noncentral semisimple Lie element and its centralizer, and uses the source infinitesimal-isogeny reduction when necessary (17.79–17.80). Over finite fields the source maximal-torus existence theorem17.99 gives a geometrically maximal torus. Together with unipotence detection this proves the arbitrary-field assertion, not a descent of a chosen torus from a finite extension. This is the external input to17.82, and no commutativity of a general torus centralizer is assumed.

[F6]

Under AC, normal affine-group quotients are represented affine fppf quotients. Over perfect fields a smooth connected commutative affine group is the product of its unipotent and multiplicative-type factors (Milne16.13). A torus cannot receive a nontrivial homomorphic image of a unipotent group. An almost-direct product means the multiplication map from the product of the subgroup varieties is a surjective homomorphism with finite kernel; its factors commute and that kernel is central. (Quotients of affine group schemes by normal subgroup schemes are affine, A subgroup that is both unipotent and diagonalizable is trivial)

Proof

Given: AC and smooth connected affine G over arbitrary k.

1.1F1F2F5F6

Put C=CG(T) and Q=C/T, smooth connected affine by [F1] and [F6]. The maximal-torus criterion and [F5] give T maximal in G if and only if Q is unipotent. Centralizers and represented normal quotients commute with field extension, and unipotence is detected and preserved by it [F2]. Applying the same criterion over every extension proves (a). No larger torus over an extension is asserted to descend to k.

2.1F2step 1.1choose

The trivial torus exists and torus dimensions are bounded by dim⁡G. Choose a torus of maximum dimension over k. It is maximal, and step1.1 makes its algebraic-closure extension maximal. This proves (b). For reductive G, a maximal T is geometrically maximal by step1.1, so [F2] gives CGka(Tka)=Tka. Faithfully flat descent gives CG(T)=T. Conversely this equality rules out a larger torus because any torus containing T centralizes it. This proves (c).

3.1F2F4step 1.1step 2.1choose

Let N be smooth connected normal in G, and choose a maximal torus T′ of N. Among the tori of G containing T′, choose one of maximal dimension, T′′; it is maximal in G. The largest subtorus (T′′∩N)t contains T′ and is a torus of N, so maximality of T′ gives equality. For any maximal T of G, step1.1 and geometric conjugacy supply g∈G(ka) with Tka=gTka′′g−1. Normality of N and the field compatibility in [F4] give (T∩N)t,ka=gTka′g−1, a maximal torus of Nka. Step1.1 applied to N descends maximality. The construction of T′′ also proves that every maximal torus of N arises as such an intersection. This proves (d), including possible nonreduced finite parts of T∩N which are not confused with its largest subtorus.

4.1F2F4F6step 1.1step 3.1

For (e), set Ti=(T∩Gi)t. The almost-product factors are normal in G, so step3.1 makes each Ti maximal in Gi. The image S=T1⋯Tn is a torus contained in T, of dimension ∑idim⁡Ti because the multiplication map has finite kernel. We show it maximal after algebraic closure. If a larger torus T′⊇S existed, its inverse image P in G1×⋯×Gn would have finite central kernel and torus quotient. Its smooth connected reduced neutral component P0 maps onto T′ by dimension and [F4]. Its derived subgroup lies in the finite central kernel and is smooth connected, hence trivial; thus P0 is commutative. By [F6] its unipotent factor maps trivially to T′ and is finite, so is trivial. Hence P0 is a torus. But T1×⋯×Tn is maximal in the product (each torus projects into a torus of each factor), and geometric conjugacy of maximal tori [F2] bounds the dimension of every torus by that of this maximal product torus. Thus dim⁡T′=dim⁡P0≤∑idim⁡Ti=dim⁡S, a contradiction. Thus S is maximal, and since S⊆T, S=T. Its finite product kernel gives the asserted almost-direct torus decomposition, and step1.1 descends it to k.

5.1F2F3F4step 1.1construct∎

Finally let T,T′ be maximal. By step1.1 they become conjugate over ka. The transporter X(R)={g∈G(R):gTRg−1=TR′} is represented by a closed finite-type subscheme of affine G: impose both conjugate subgroup inclusions, expand the conjugation pullbacks of finite ideal generators in finite linearly independent coefficient lists of the torus coordinate algebra, and set all these coefficients to zero. This gives the two closed transporter conditions on every base algebra. If g0∈X(ka), multiplication h↦g0h identifies NG(T)ka with Xka, with inverse g↦g0−1g. Thus X is nonempty and smooth by [F3]. Its finite separable point in [F3] supplies the desired conjugating element over a finite separable extension of k. Over a separably closed k that extension is k itself. This proves (f) and all clauses.

Depends on

Used by

Dependency tree · two levels

84 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