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 of Finite Type over a Field — Examples
1 · Prerequisites
- Abelian Categories
- Affine Schemes and the Structure Sheaf
- Binary Operations, Monoids, Groups and Subgroups
- Cardinal Arithmetic, Cofinality and the Alephs
- Categories, Functors and Natural Transformations
- Compactness
- Compactness in Metric Spaces
- Construction of the Natural Numbers
- Construction of the Real Numbers via Cauchy Sequences
- Construction of the Real Numbers via Dedekind Cuts
- Cosets, Index and Lagrange's Theorem
- Countability and Uncountability
- Determinants of Matrices over a Commutative Ring
- Exactness and the Member Calculus
- Fibre Products Base Change and Scheme Theoretic Fibres
- Finite Counting, Factorials and Binomial Coefficients
- Foundations of the Real Numbers for Analysis
- Free Modules, Exact Sequences, Projective and Injective Modules
- Group Actions, Orbits, Stabilisers and Cayley's Theorem
- Group Homomorphisms and the Isomorphism Theorems
- Group Schemes of Finite Type over a Field
- Ideals, Quotient Rings and the Isomorphism Theorems for Rings
- Limits and Colimits
- Localisation of Modules and Support
- Metric Spaces
- Modules, Submodules, Quotient Modules and the Isomorphism Theorems
- Noetherian Rings and Hilbert Basis
- Normal Subgroups and Quotient Groups
- Order, Zorn's Lemma, and the Axiom of Choice
- Ordinal Arithmetic and the First Uncountable Ordinal
- Ordinals, Cardinals, and Transfinite Recursion
- Polynomial Rings, the Division Algorithm and Roots
- Preadditive and Additive Categories and Biproducts
- Presheaves Sheaves Stalks and Sheafification
- Prime Spectra and Radicals
- Reflective Subcategories and the Adjoint Functor Theorems
- Relations, Functions, and Quotients
- Rings, Subrings, Integral Domains and Fields
- Roots, Rational Powers, and Classical Inequalities
- Schemes Subschemes and Morphisms Locally of Finite Type
- Sheaf Operations Exactness Ringed Spaces and Module Pullback
- Suprema and Infima
- Symmetric Groups, Cycle Decomposition and the Sign Homomorphism
- Tensor Products of Modules
- The Determinant of a Linear Operator, Cofactors and Cramer's Rule
- The Field of Fractions and Localisation
- The ZFC Axioms and the Basic Set Constructions
- Topological Spaces and Continuity
- Zariski Topology on Prime Spectra
2 · Summary
The additive group , the multiplicative group and the general linear group are displayed with their explicit coordinate rings and structure maps. All three are checked on -points for an arbitrary commutative -algebra , including nonreduced ; the verification relies on the matrix, determinant and adjugate identities in the coordinate algebras rather than on point-wise formulas.
The counterexample on this page works over an algebraically closed field of characteristic : the group schemes and have isomorphic underlying schemes and singleton groups of rational points, yet different group laws. The coefficient comparison against therefore refutes the claim that the abstract group of rational points, even together with the underlying scheme, determines the group-scheme structure.
3 · Logical flowchart
4 · Definitions, theorems and proofs
None yet.
5 · Examples, counterexamples and false statements
The group schemes Ga, Gm, and GLn
Example
Over every field , the additive group , multiplicative group , and general linear group are group schemes of finite type. For every commutative -algebra , their groups of points are respectively , , and the invertible matrices over . Their structure morphisms are regular on the displayed schemes, including when is nonreduced.
Verification
Given: A field , a positive integer , and a commutative unital -algebra .
[F1] Group schemes and their homomorphisms are defined in Group schemes of finite type over a field and Morphisms and closed subgroup schemes of group schemes.
[F2] Ring maps correspond to affine scheme morphisms, and affine product rings are tensor products. (Affine schemes are contravariantly equivalent to commutative rings, Affine fibre products are spectra of tensor products)
[F3] Matrix multiplication is associative and unital, determinants multiply over every commutative ring, and a matrix with unit determinant has inverse . (Matrix arithmetic over a commutative ring is associative, unital and distributive, and transpose reverses products, For same-sized finite square matrices over a commutative ring, , If is a unit, then )
For , the comorphisms of multiplication, identity and inverse send respectively to , , and . They are algebra maps and hence morphisms by [F2]. Evaluation on identifies its points with and its operations with addition, zero, and negation. For , the corresponding formulas are , , and . Each image of is a unit, so these maps are defined on the Laurent algebra. Evaluation identifies its points with and its operations with multiplication, one and inversion. These formulas satisfy the group-object identities as ring identities and hence as scheme morphisms by [F1]–[F2].
For , define multiplication by . Its determinant is by [F3], a unit, so the formula extends to the localized coordinate ring. The identity has , with determinant one. Define inversion by the entries of ; they belong to the same localized algebra. Its determinant is a unit, since the adjugate identity gives and determinant multiplicativity gives . Thus inversion also gives a morphism. The points of the localized spectrum are exactly matrices with unit determinant, equivalently invertible matrices by [F3].
Matrix associativity, the identity matrix, and the two inverse identities in [F3] verify all group identities on , for every . They also verify the scheme identities: each domain in those identities is affine by [F2]; testing its coordinate algebra with its universal point tests the morphisms themselves. All three displayed coordinate algebras are finitely generated over (write the determinant inverse as a generator subject to ), so the schemes are finite type. They are therefore group schemes by [F1]. No field-valued-point or smoothness argument substitutes for these formulas.
Rational points do not detect the group-scheme structure of alpha_p and mu_p
Statement refuted
For group schemes of finite type over an algebraically closed field , the abstract group of -rational points determines their group-scheme structure. Even a fixed underlying -scheme together with that abstract group determines the group law.
Facts & Assumptions
The group and closed-subgroup conventions and the all-algebra-valued criterion are Group schemes of finite type over a field, Morphisms and closed subgroup schemes of group schemes, and Closed subgroup schemes are detected on all algebra-valued points.
The additive and multiplicative group schemes have the displayed structure morphisms over arbitrary algebras. (The group schemes Ga, Gm, and GLn)
Affine scheme morphisms correspond to algebra maps, and product coordinate rings are tensor products. (Affine schemes are contravariantly equivalent to commutative rings, Affine fibre products are spectra of tensor products)
We assume the Axiom of Choice, inherited through the closed-subgroup criterion in [F1] and its affine quotient supplier. The coefficient comparisons are finite algebraic calculations. (The Axiom of Choice)
Counterexample
Let be algebraically closed of characteristic . Set Then and are isomorphic singleton groups. Their underlying -schemes are isomorphic by . Nevertheless they are not isomorphic as -group schemes: has additive comultiplication , while in the coordinate the multiplicative law of has . The proof below excludes every group-scheme isomorphism, not merely the displayed scheme isomorphism.
Given: AC and an algebraically closed field of characteristic and the two displayed schemes.
For every commutative -algebra , is an additive subgroup of : and . Also is a multiplicative subgroup of . The closed immersions into and therefore give the induced group laws by [F1]–[F2]. AC is carried through the criterion in [F1], as recorded in [F4]. Each coordinate algebra has dimension over , so is finite type. The formula identifies their underlying rings because . In a field forces , and forces , hence . Thus both rational-point groups are singleton while both schemes retain a nonzero nilpotent coordinate.
Every group-scheme homomorphism corresponds by [F3] to a unit in satisfying and in . Compare coefficients of for : the left side has coefficient , the right side . Since and are invertible in , induction gives . Now compare the coefficient of : the left side is zero because every term of has total degree less than , while the right side is . Thus and all for . This also covers . Hence every such homomorphism is the trivial one, .
If as group schemes, compose that isomorphism with the closed subgroup inclusion . The result would be nontrivial: on coordinate rings the inclusion pulls back to its nonconstant class in , and an isomorphism cannot send to zero. This contradicts step 2.1. Thus the two group schemes are not isomorphic despite their isomorphic underlying schemes and rational-point groups. Nilpotent test algebras distinguish their laws; for example their common coordinate has the additional product term for written in the counterexample.