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.
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.
Depends on
- Group schemes of finite type over a field
- Morphisms and closed subgroup schemes of group schemes
- Affine schemes are contravariantly equivalent to commutative rings
- Affine fibre products are spectra of tensor products
- If $\det(A)$ is a unit, then $A^{-1}=\det(A)^{-1}\operatorname{adj}(A)$
- For same-sized finite square matrices over a commutative ring, $\det(AB)=\det(A)\det(B)$
- Matrix arithmetic over a commutative ring is associative, unital and distributive, and transpose reverses products
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
- J. S. Milne, Algebraic Groups (corrected 2022 printing) (standard reference, not scraped)
- The Stacks Project, complete Groupoid Schemes chapter (standard reference, not scraped)