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.

Fibres of the orbit map and the scheme-theoretic stabilizer as a closed subgroup scheme

Statement

Assume the Axiom of Choice only for the closed-point selection in the finite-field trivialization of a nonempty fiber. Let G be any finite-type k-group scheme acting on a separated finite-type k-scheme X, and let x∈X(k). (a) The scheme-theoretic stabilizer H=Gx=G×XSpec⁡k is a closed subgroup scheme, with H(R)={g:gxR=xR} for every k-algebra R. (b) The scheme fiber Fy=G×XSpec⁡k over y∈X(k) is empty unless y belongs to the underlying image of the orbit map. If y=g0x with g0∈G(k), then Fy=g0H. In general, if Fy is nonempty, it becomes such a translate after a finite field extension carrying a point of the fiber; it is an fppf right H-torsor, and need not have a k-point. For g∈G(k), Ggx=gHg−1. (c) The fiber over (y,x) of (g,z)↦(gz,z):G×X→X×X is canonically Fy. (d) The morphism G×H→G×XG, (g,h)↦(g,gh), is an isomorphism. If ϱx factors through a locally closed orbit subscheme Ox↪X, this is also the kernel pair over Ox, because an immersion is a monomorphism.

Facts & Assumptions

Given: AC for the closed-point selection below, a finite-type k-group scheme G acting on a separated finite-type k-scheme X through α, and a point x∈X(k).

[F0]

The stabilizer H=Gx=G×XSpec⁡k is formed with ϱx and the k-point x, the fibre Fy with ϱx and y, and H(R)={g∈G(R):gxR=xR}; the action groupoid is G×kX⇉X (Algebraic group actions, orbit maps, orbit subschemes and scheme-theoretic stabilizers).

[F1]

A k-point x:Spec⁡k→X of a k-scheme X separated over k is the graph of an S-morphism with separated target, hence is a closed immersion (Closed graphs over separated targets, Separated S-scheme).

[F2]

For f:X→S and g:Y→S, the fibre product X×SY represents pairs of morphisms to X and Y with equal image in S; in particular a fibre over a k-point is described by the universal property (Fibre product of schemes, Scheme-theoretic fibre).

[F3]

A closed subscheme H↪G is a closed subgroup scheme if and only if H(R)⊆G(R) is a subgroup for every commutative unital k-algebra R (Closed subgroup schemes are detected on all algebra-valued points).

[F4]

Closed immersions are stable under base change (Base change of immersions), and a locally closed immersion is a monomorphism (Immersions and affine localizations are monomorphisms).

[F5]

In a nonzero commutative ring every proper ideal lies in a maximal ideal (In a nonzero commutative ring, every proper ideal is contained in a maximal ideal), and a residue field of a finitely generated k-algebra of a field is a finite extension of k (A field finitely generated as a k-algebra is a finite extension of k). Morphisms from Spec⁡L to a scheme are its L-points (Field-valued points and local-ring points).

[F6]

The multiplicative group Gm=Spec⁡k[t,t−1] with comultiplication t↦t⊗t is a group scheme of finite type over k with Gm(R)=R× for every k-algebra R (Group schemes of finite type over a field, Affine schemes are contravariantly equivalent to commutative rings, Affine fibre products are spectra of tensor products).

[F7]

The real field is an ordered field in which every nonzero square is positive, and in a polynomial ring over an integral domain the units are exactly the invertible constants (The reals form a totally ordered field, Squares of nonzero elements are positive, Ordered field, The units of R[x] over an integral domain are exactly the constant polynomials whose values are units of R).

Proof

Given: AC for the closed-point selection below, the action α of the finite-type k-group scheme G on the separated finite-type k-scheme X, and x∈X(k).

1.1F1F4givenconstruct

Since X is separated over k, the point x is a closed immersion by [F1], and H=G×X,ϱx,xSpec⁡k is the pullback of this closed immersion along ϱx, hence a closed subscheme of G by [F4].

1.2F2F0givenconstruct

For every k-algebra R the universal property in [F2] identifies the fiber of (g,z)↦(gz,z) over (y,x) with {(g,z)∈G(R)×X(R):gz=yR, z=xR}={g∈G(R):gxR=yR}=Fy(R); these identifications are natural in R and therefore identify the two schemes. This is (c).

1.3F0givenalgebra

If y=g0x with g0∈G(k), left translation by g0 is an automorphism of G carrying H onto the fiber Fy: for every R it identifies H(R)={h:hxR=xR} with {g0h:(g0h)xR=g0xR=yR}=Fy(R), and conversely gxR=yR implies (g0−1g)xR=xR. Similarly, for g∈G(k) and every R one has Ggx(R)=gH(R)g−1, because g′(gxR)=gxR is equivalent to (g−1g′g)xR=xR; the closed subschemes Ggx and gHg−1 have the same functor of points and hence coincide.

1.4F0F2givenalgebra

The morphism φ:G×H→G×XG, (g,h)↦(g,gh), is well defined because (gh)x=g(hx)=gx; the morphism ψ:G×XG→G×H, (g,g′)↦(g,g−1g′), is well defined because equal images gx=g′x imply (g−1g′)x=x, that is g−1g′∈H. On R-points for every k-algebra R the two composites are the identity: ψφ(g,h)=(g,g−1gh)=(g,h) and φψ(g,g′)=(g,g(g−1g′))=(g,g′). Hence φ and ψ are inverse isomorphisms of k-schemes. This proves the first assertion of (d).

1.5F6F7givenalgebra

A fiber can be nonempty without having a k-point. Let k=R, let G=Gm=Spec⁡R[t,t−1] with the comultiplication t↦t⊗t of [F6], let X=Gm, and let G act on X by g⋅z=g2z, an action because (gh)2=g2h2 and 12=1. Take x=1, y=−1. The fiber Fy=G×XSpec⁡R over y has coordinate ring R[t,t−1]⊗R[s,s−1]R, where the right factor is the residue field at s=−1; this tensor product is R[t,t−1]/(t2+1)≅R[t]/(t2+1), since t2=−1 makes t invertible. That ring is nonzero because t2+1 is nonconstant, hence not a unit of R[t] by [F7]. But Fy(R)=∅: an R-point would give z∈R with z2=−1, whereas z2≥0 for every z by the ordered-field fact of [F7] while −1<0, since 0−(−1)=1 is positive. Thus a nonempty fiber need not have a k-point.

2.1F3F0step 1.1algebra

For every k-algebra R the set H(R)={g:gxR=xR} is a subgroup of G(R): it contains the identity; if gxR=xR and g′xR=xR then (gg′)xR=g(g′xR)=gxR=xR; and if gxR=xR then g−1xR=g−1(gxR)=xR. The subsets are natural in R, so by the valued point criterion [F3] the closed subscheme H of step 1.1 carries the unique structure of a closed subgroup scheme with this functor of points, which is (a).

2.2F0F2step 1.3algebra

For every k-algebra R the map Fy(R)×H(R)→Fy(R)×Fy(R), (g,h)↦(g,gh), is a bijection: it is injective since g=g′ and gh=g′h′ give h=h′, and a pair (g,g′)∈Fy(R)×Fy(R) has g−1g′∈H(R) because (g−1g′)xR=g−1(g′xR)=g−1(gxR)=xR, with (g,g−1g′)↦(g,g′). By Yoneda this exhibits the action morphism Fy×kH→Fy×kFy as an isomorphism. Consequently, if Fy(L) is nonempty for some field extension L/k, base change to L identifies (Fy)L with HL.

3.1F5givenstep 1.5step 2.2choose

Suppose Fy is nonempty. Then Fy has a nonempty affine open Spec⁡A with A≠0 a finitely generated k-algebra; choose a maximal ideal m⊂A and put L=A/m. By [F5] the field L is a finite extension of k, and the resulting L-point of Fy is an element of Fy(L). Step 2.2 then identifies (Fy)L with HL; since a finite field extension is a faithfully flat and finitely presented base change, Fy is an fppf right H-torsor, trivialized by the fppf cover Spec⁡L→Spec⁡k, and it has a k-point exactly when Fy≅H. Step 1.5 shows that the latter can fail, since the fiber F−1 constructed there is nonempty and the trivialization just produced applies to it.

4.1F4step 1.2step 1.3step 1.4step 1.5step 2.1step 2.2step 3.1∎

The remaining clause of (d) follows because a locally closed immersion is a monomorphism by [F4]: if ϱx factors through Ox↪X, then for every test scheme a pair of points of G has equal images in Ox if and only if it has equal images in X, so G×OxG=G×XG and step 1.4 identifies it with G×H. Statement (c) is step 1.2; statement (a) is step 2.1; statement (b) consists of step 1.3, step 2.2 and step 3.1; the first assertion of (d) is step 1.4. This completes the proof.

Depends on

Used by

Dependency tree · two levels

71 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