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.

Closed subgroup schemes are detected on all algebra-valued points

Statement

Let k be a field, G a group scheme of finite type over k, and j:H↪G a closed subscheme. Then H has the unique induced structure of a closed subgroup scheme if and only if H(R)⊆G(R) is a subgroup for every commutative unital k-algebra R. Equivalently, the identity eG, multiplication restricted to H×kH, and inverse restricted to H all factor through H. No reducedness, smoothness, or algebraic closedness hypothesis is imposed.

Facts & Assumptions

[F1]

The group-object identities and the definitions of homomorphism and closed subgroup scheme are those of Group schemes of finite type over a field and Morphisms and closed subgroup schemes of group schemes. A closed immersion has unique factorizations through it.

[F2]

A closed subscheme of Spec⁡A is Spec⁡(A/I), and fibre products of schemes exist. (Closed immersions into affine schemes are quotient spectra, Existence of all scheme fibre products)

[F3]

We assume the Axiom of Choice, inherited through the affine closed-immersion quotient theorem in [F2]. Its proof uses prime-ideal detection and nilradical detection to obtain affine quotient presentations. (The Axiom of Choice)

Proof

Given: AC, k, G, j:H↪G as above.

1.1F1given

If H is a closed subgroup scheme, its structure morphisms give a group law on H(R) for every R and its inclusion in G(R) preserves the three operations by [F1]. Thus H(R) is a subgroup. Conversely suppose every H(R) is a subgroup. Taking R=k shows that the identity eG∈G(k) has a factor eH:Spec⁡k→H.

2.1F1F2step 1.1construct

Cover H×kH by affine opens U=Spec⁡R. The restrictions of the two projections to U are points a,b∈H(R). By hypothesis their product in G(R) lies in H(R), so mG∘(j×j)∣U factors through H. The factors agree on every overlap by uniqueness through the closed immersion and hence glue to mH:H×kH→H. Similarly, on every affine open Spec⁡R⊂H, its inclusion is a point of H(R), whose inverse in G(R) belongs to H(R). These factors glue uniquely to iH:H→H. This proves all three factorization assertions using universal affine points, rather than only field-valued points.

3.1F1F2F3step 2.1algebra∎

Compose the associativity, identity and inverse identities for these factors with j. They become precisely the corresponding identities in G by construction. Since j is a monomorphism, the identities hold in H. The closed scheme H is finite type over k: a finite affine cover Spec⁡Ai of the finite-type G pulls back by [F2] to Spec⁡(Ai/Ii), a finite affine cover with finitely generated k-algebras. Thus H is a group scheme of finite type and j a group-scheme morphism by [F1]. Uniqueness of every factor proves uniqueness of its group law. The converse for the equivalent factorization criterion follows from exactly the same transfer of identities. AC is inherited through the affine quotient presentation in [F2], as recorded in [F3].

Depends on

Used by

Dependency tree · two levels

28 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