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
Definition
Let be a field. A group scheme of finite type over is a finite-type -scheme with -morphisms satisfying the following identities of scheme morphisms. Multiplication is associative, on ; under the canonical identifications; and , where is the structure map. The products exist by Existence of all scheme fibre products; the base and finite-type conventions are Schemes and morphisms over a base and Locally finite type and finite type morphisms.
For every -scheme , put . The three structure morphisms give a group law on , naturally under precomposition in . In particular for every commutative unital -algebra , means and is a group, including for algebras with nilpotents. The definition imposes neither reducedness nor smoothness, and allows finite nonreduced group schemes. A group scheme is called commutative if agrees with its composition with the factor-exchange map.
Depends on
Used by
- Rational points do not detect the group-scheme structure of alphaₚ and muₚ Counterexample
- Coordinate Hopf algebras for multiplicative type Definition
- Morphisms and closed subgroup schemes of group schemes Definition
- The group schemes Ga, Gm, and GLn Example
- Affineness of a field form of a diagonalizable group Lemma
- Closed subgroup schemes are detected on all algebra-valued points Lemma
Dependency tree · two levels
9 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)