Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedjudge pass (gpt-6.1-sol)
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 k, G↦X∗(G) is a contravariant equivalence between finite-type group schemes of multiplicative type over k and finitely generated abelian groups with continuous Γk-action. Its inverse sends M to the group with coordinate algebra (ks[M])Γk for the action σ(cem)=σ(c)eσm. In particular, naturally, Hom⁡k-groups(G,H)≅Hom⁡Γk(X∗(H),X∗(G)). No smoothness, connectedness, perfection, or characteristic-zero hypothesis is required.

Facts & Assumptions

[A1]

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.

[F1]

Continuous Galois modules and transport on characters are in Continuous Galois character modules.

[F2]
[F3]

Every finite-type multiplicative group splits over a finite Galois extension: Multiplicative type groups split over a finite Galois extension.

[F4]

Semilinear Hopf algebras and their maps descend effectively and uniquely: Finite Galois descent for the Hopf algebras of multiplicative type.

[F5]

Finite Galois extensions and their intermediate fields obey The fundamental theorem of finite Galois theory.

[F6]

Assuming AC, separable closures are base-isomorphic: Assuming Choice, separable closures exist and are base-isomorphic. Applied to ks as a separable closure of a finite subfield L, with one L-structure twisted by an automorphism of L, this extends every such automorphism to ks. For finite Galois L/k, restriction therefore gives Γk/Gal⁡(ks/L)=Gal⁡(L/k). Moreover ksGal⁡(ks/L)=L: if a∉L, take the finite normal closure of L(a)/L, use F5 to find an automorphism moving a, and extend it by the same closure-isomorphism argument.

Proof

Given: k,ks,Γk and the two categories in the statement.

1.1A1F1F2F3F5F6algebra

If M is finitely generated and the action is continuous, intersect the open stabilizers of a finite generating list. That intersection fixes every element of M, so is the kernel of the action and is open and normal. A Krull-open subgroup contains Gal⁡(ks/L) for a finite Galois L/k: take the normal closure of the finite extension defining a basic open neighborhood. Thus the action factors through the finite group Gal⁡(L/k). Conversely an action factoring through this group is continuous. For G, F3 and F2 show X∗(G) is finitely generated, and its basis characters under a splitting isomorphism over L are fixed by Gal⁡(ks/L), so its action is continuous.

2.1step 1.1F2F4F5F6algebra

Given M, choose L as in step 1.1. The action on L[M] respects multiplication and all Hopf maps. By F4, A=L[M]Gal⁡(L/k) is a finite-type Hopf algebra with L⊗A≅L[M]. Hence D(M)=Spec⁡A is of multiplicative type. Its character module identifies with M by F2, and the identification is equivariant because em transforms to eσm. The fixed algebra equals (ks[M])Γk: invariance under Gal⁡(ks/L) means every coefficient lies in L, since this subgroup fixes every monomial; taking the remaining finite-group invariants gives A. Thus the construction is independent of the chosen L.

3.1F2F3F4step 2.1algebra∎

For G, the evaluation map ks[X∗(G)]→O(G)⊗ks sends eχ to its character function and is an equivariant Hopf isomorphism by F2 and F3. The finitely many images of a Hopf generating set of ks[X∗(G)] and of their antipodes involve finitely many coefficients in ks, hence lie over a common finite Galois extension. Restricting the evaluation isomorphism to Γk-fixed elements identifies its source with (ks[X∗(G)])Γk=O(D(X∗(G))) and its target with (O(G)⊗ks)Γk=O(G), the latter because a fixed element is defined over one finite Galois subextension, where F4's canonical fixed-algebra clause computes the invariants. Hence O(D(X∗(G)))≅O(G), and so G≅D(X∗(G)). Given G,H, 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

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