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.
Multiplicative type groups and Galois character modules
Statement
Assume the Axiom of Choice. Over an arbitrary field , is a contravariant equivalence between finite-type group schemes of multiplicative type over and finitely generated abelian groups with continuous -action. Its inverse sends to the group with coordinate algebra for the action . In particular, naturally, No smoothness, connectedness, perfection, or characteristic-zero hypothesis is required.
Facts & Assumptions
Assume The Axiom of Choice, used through F3 to descend affineness from a splitting cover; and through F6 to extend finite separable embeddings; the Hopf and finite Galois descent steps use finite lists.
Continuous Galois modules and transport on characters are in Continuous Galois character modules.
The split character dictionary is Split diagonalizable groups are dual to abelian groups.
Every finite-type multiplicative group splits over a finite Galois extension: Multiplicative type groups split over a finite Galois extension.
Semilinear Hopf algebras and their maps descend effectively and uniquely: Finite Galois descent for the Hopf algebras of multiplicative type.
Finite Galois extensions and their intermediate fields obey The fundamental theorem of finite Galois theory.
Assuming AC, separable closures are base-isomorphic: Assuming Choice, separable closures exist and are base-isomorphic. Applied to as a separable closure of a finite subfield , with one -structure twisted by an automorphism of , this extends every such automorphism to . For finite Galois , restriction therefore gives . Moreover : if , take the finite normal closure of , use F5 to find an automorphism moving , and extend it by the same closure-isomorphism argument.
Proof
Given: and the two categories in the statement.
If is finitely generated and the action is continuous, intersect the open stabilizers of a finite generating list. That intersection fixes every element of , so is the kernel of the action and is open and normal. A Krull-open subgroup contains for a finite Galois : take the normal closure of the finite extension defining a basic open neighborhood. Thus the action factors through the finite group . Conversely an action factoring through this group is continuous. For , F3 and F2 show is finitely generated, and its basis characters under a splitting isomorphism over are fixed by , so its action is continuous.
Given , choose as in step 1.1. The action on respects multiplication and all Hopf maps. By F4, is a finite-type Hopf algebra with . Hence is of multiplicative type. Its character module identifies with by F2, and the identification is equivariant because transforms to . The fixed algebra equals : invariance under means every coefficient lies in , since this subgroup fixes every monomial; taking the remaining finite-group invariants gives . Thus the construction is independent of the chosen .
For , the evaluation map sends to its character function and is an equivariant Hopf isomorphism by F2 and F3. The finitely many images of a Hopf generating set of and of their antipodes involve finitely many coefficients in , hence lie over a common finite Galois extension. Restricting the evaluation isomorphism to -fixed elements identifies its source with and its target with , the latter because a fixed element is defined over one finite Galois subextension, where F4's canonical fixed-algebra clause computes the invariants. Hence , and so . Given , take a common finite Galois splitting extension. F2 identifies every group map there with a reversed character-module map; this identification respects the actions. F4 says precisely the equivariant maps descend uniquely, giving the displayed bijection. The evaluation identifications commute with maps because both send a monomial to the corresponding pulled-back character. They are therefore natural and prove the anti-equivalence.
Depends on
- Continuous Galois character modules
- The Axiom of Choice
- Split diagonalizable groups are dual to abelian groups
- Multiplicative type groups split over a finite Galois extension
- Finite Galois descent for the Hopf algebras of multiplicative type
- The fundamental theorem of finite Galois theory
- Assuming Choice, separable closures exist and are base-isomorphic
Used by
Dependency tree · two levels
26 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 edition (standard reference, not scraped)
- SGA 3, Expose VIII, section 1, Polo–Gille edition (standard reference, not scraped)
- SGA 3, Expose X, section 1, Polo–Gille edition (standard reference, not scraped)