Alphabeta Math
DefinitionDefinition: Literature-sourcedProof: Not applicablePipeline-generatedprecheck pass
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.

Group schemes over a base scheme

Definition

Let S be a scheme. An S-group scheme is a group object in the category of S-schemes: an S-scheme G, with structure morphism p:G→S, together with S-morphisms m:G×SG→G,e:S→G,i:G→G called multiplication, unit section and inverse, such that the following identities of S-morphisms hold. The fibre product is the one of Fibre product of schemes and exists by Existence of all scheme fibre products; the canonical identifications S×SG≅G≅G×SS used below are those of Uniqueness of the fibre product.

(Associativity) m∘(m×Sid⁡G)=m∘(id⁡G×Sm) as morphisms G×SG×SG→G.

(Unit laws) m∘(e×Sid⁡G)=id⁡G and m∘(id⁡G×Se)=id⁡G under the canonical identifications above.

(Inverse laws) m∘(id⁡G,i)=e∘p and m∘(i,id⁡G)=e∘p as morphisms G→G, where (id⁡G,i):G→G×SG and (i,id⁡G):G→G×SG are induced by the universal property of the fibre product.

A morphism of S-group schemes f:G→H is an S-morphism with f∘mG=mH∘(f×Sf), f∘eG=eH and f∘iG=iH∘f, where f×Sf:G×SG→H×SH is the induced morphism.

Functor of points. For an S-scheme T put G(T)=Hom⁡S(T,G). The composites T→ΔT×ST→α×SβG×SG→mG, T→S→eG and i∘α make G(T) a group, and this structure is natural in T by the universal property of the fibre product. A morphism f:G→H of S-group schemes induces homomorphisms G(T)→H(T) compatible with the transition maps of T. For S=Spec⁡k and G of finite type this is the notion of Group schemes of finite type over a field, and the group object diagrams above are equivalent to the requirement that each G(T) be a group naturally in T. The definition is a condition on given data and quotes no new existence statement.

Commutativity. G is commutative when m=m∘σ, where σ:G×SG→G×SG is the exchange isomorphism; equivalently, each G(T) is abelian.

Closed subgroup schemes. A closed subgroup scheme of G is a closed immersion j:H→G for which there exist S-morphisms mH:H×SH→H, eH:S→H, iH:H→H with j∘mH=m∘(j×Sj), j∘eH=e and j∘iH=i∘j; since j is a monomorphism these morphisms are unique if they exist, H becomes an S-group scheme and j a morphism of S-group schemes. A closed subgroup scheme H is normal when H(T) is a normal subgroup of G(T) for every S-scheme T; equivalently, the conjugation morphism G×SH→G, (α,β)↦mG(mG(α,β),iG(α)), factors through j.

Kernels. For a morphism f:G→H of S-group schemes, the kernel is the fibre product K=G×HS formed with f and the unit section eH:S→H, so that K→G is the base change of eH along f and is a closed immersion whenever eH is one, in particular whenever H is separated over S; the induced S-morphisms make K an S-group scheme, and for every S-scheme T the sequence 0→K(T)→G(T)→H(T) is exact.

Base change. For any morphism S′→S, the base change GS′=G×SS′ of Base change of objects, morphisms and properties carries an induced S′-group structure with mS′,eS′,iS′ obtained from m,e,i under the canonical isomorphism GS′×S′GS′≅(G×SG)×SS′. It satisfies GS′(T)=G(T) for every S′-scheme T, regarded as an S-scheme via T→S′→S; this is the base-change convention used for all group schemes on this page. In particular a morphism f:G→H of S-group schemes base changes to a morphism fS′ of S′-group schemes.

Depends on

Used by

Dependency tree · two levels

10 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