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.

Chevalley: every closed subgroup is a line stabilizer

Statement

Assume the Axiom of Choice inherited from the named suppliers. Let G be an affine group scheme of finite type over a field k and let H⊆G be a closed subgroup scheme. Then there exist a finite-dimensional rational representation (V,r) of G and a line L⊆V such that H=Stab⁡G(L) scheme-theoretically: for every k-algebra R, Stab⁡G(L)(R)={g∈G(R):gLR=LR} (Algebraic group actions, orbit maps, orbit subschemes and scheme-theoretic stabilizers, Rational representations and comodules of an affine group scheme). Moreover, if L=kv then Lie⁡(H)={x∈Lie⁡(G):xv∈kv}.

Facts & Assumptions

Given: An affine group scheme G of finite type over k with coordinate Hopf algebra A=O(G) and a closed subgroup scheme H⊆G, with kernel a=ker⁡(A→O(H)).

[F1]

Hopf ideals and closed subgroups. a is a Hopf ideal of A and H=Spec⁡(A/a); in particular Δ(a)⊆A⊗a+a⊗A and ε(a)=0 (Closed subgroup schemes of an affine group scheme correspond to Hopf ideals, Hopf ideals, kernels and quotients of commutative Hopf algebras, The coordinate Hopf algebra of an affine group scheme).

[F2]

Finiteness. A is a finitely generated k-algebra (An affine scheme of finite type over a field has a finitely generated coordinate ring) and finitely generated algebras over the Noetherian field k are Noetherian, so a is finitely generated as an ideal (Every algebra of finite type over a Noetherian ring is a Noetherian ring).

[F3]

Finite-dimensional subcomodules. A is a comodule over itself under Δ, and every finite subset of a comodule lies in a finite-dimensional subcomodule and subrepresentations are subcomodules (Rational representations of an affine group scheme are comodules of its coordinate Hopf algebra, Every element of a comodule lies in a finite-dimensional subcomodule, Rational representations and comodules of an affine group scheme).

[F4]

Exterior-power stabilizers. For a finite-dimensional rational representation (V,r) and a subspace W⊆V of dimension d, the scheme-theoretic stabilizer of W equals the scheme-theoretic stabilizer of the line ΛdW⊆ΛdV, and ΛdV with the exterior-power action is a rational representation (The top exterior power detects stabilizers of a subspace, Tensor products, exterior powers and Hom spaces of finite-dimensional rational representations are rational).

[F5]

Lie algebras of stabilizers. For a subspace W of a rational representation, Lie⁡(Stab⁡G(W))={x∈Lie⁡(G):xW⊆W} (Lie algebras of subspace stabilizers and Lie-stable subspaces).

Proof

technique · direct
1.1F1F2F3given

Since a is finitely generated as an ideal by [F2], choose a finite generating set S⊆a. By [F3] there is a finite-dimensional subcomodule V⊆A under Δ with S⊆V; put W=a∩V, choose a basis (ej)j∈J of W and extend it to a basis (ei)i∈J∪I of V, so that I indexes a complement of W in V. Write Δ(ej)=∑i∈J∪Iei⊗aij for j∈J and let a′ be the ideal of A generated by the elements aij with j∈J, i∈I.

2.1F1step 1.1given

For a k-algebra R and g∈G(R) one has g⋅ej=∑i∈J∪Iei aij(g) under the action associated with the coaction Δ, and the ei form an R-basis of VR; hence g⋅WR⊆WR if and only if aij(g)=0 for all j∈J, i∈I, that is, if and only if g vanishes on a′. Since g acts invertibly and WR is a direct summand of VR, the inclusion g⋅WR⊆WR is equivalent to g⋅WR=WR. Therefore the stabilizer functor of W is represented by the closed subscheme Spec⁡(A/a′) of G=Spec⁡A.

2.2F1step 1.1

a′⊆a: as a is a Hopf ideal, Δ(ej)∈A⊗a+a⊗A for j∈J by [F1], so applying id⁡⊗π for the quotient π:A→A/a and then q⊗id⁡ for the quotient q:A→A/a gives ∑i∈Iq(ei)⊗π(aij)=0 in (A/a)⊗(A/a), because π(ej)=0 for j∈J and a∩V=W; the elements q(ei), i∈I, are linearly independent, so π(aij)=0, that is, aij∈a for all j∈J, i∈I.

2.3F1step 1.1

a⊆a′: for j∈J one has ε(ej)=0 by [F1], and the counit axiom gives ej=(ε⊗id⁡)Δ(ej)=∑i∈J∪Iε(ei)aij=∑i∈Iε(ei)aij∈a′, because the terms with i∈J have ε(ei)=0. The elements ej, j∈J, span W⊇S, and S generates a as an ideal, so a is contained in the ideal a′.

3.1F1step 2.1step 2.2step 2.3

By steps 2.2 and 2.3, a′=a, so Spec⁡(A/a′)=Spec⁡(A/a)=H. Step 2.1 identifies Spec⁡(A/a′) with the stabilizer of W, so H=Stab⁡G(W) scheme-theoretically, where V is a finite-dimensional rational representation of G and W⊆V.

4.1F4step 2.1

Let d=dim⁡W and L=ΛdW⊆ΛdV; this is a line, ΛdV is a finite-dimensional rational representation of G by [F4], and [F4] gives Stab⁡G(W)=Stab⁡G(L) scheme-theoretically. Combined with step 3.1 this produces the required pair (V,L) with H=Stab⁡G(L).

5.1F5step 4.1

If L=kv, then {x∈Lie⁡(G):xL⊆L}={x:xv∈kv} and [F5] applied to the line L gives Lie⁡(H)=Lie⁡(Stab⁡G(L))={x∈Lie⁡(G):xv∈kv}.

6.1step 4.1step 5.1∎

Steps 4.1 and 5.1 prove both assertions of the theorem for the closed subgroup scheme H of G.

Remarks

  • The construction is Milne's proof of Theorem 4.27: the ideal a is replaced by the ideal of matrix coefficients a′ cut out by the finite-dimensional subcomodule V, and the computation a′=a identifies H with the stabilizer of W=a∩V in the regular representation restricted to V.
  • The passage from the subspace W to the line L=ΛdW is Lemma 4.28, which is where the exterior power of a rational representation and the scheme-theoretic stabilizer comparison are used.

Depends on

Used by

Dependency tree · two levels

83 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