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.

Affine group schemes of finite type are antiequivalent to finitely generated commutative Hopf algebras

Statement

Assume the Axiom of Choice. Let k be a field. (a) The assignment G↦(O(G),Δ,ε,S) of The coordinate Hopf algebra of an affine group scheme is a contravariant functor from affine group schemes of finite type over k (Group schemes of finite type over a field) to finitely generated commutative Hopf algebras over k (Commutative Hopf algebras over a field), and it is fully faithful. (b) A finitely generated commutative Hopf algebra A over k has Spec⁡A an affine group scheme of finite type over k under the multiplication Spec⁡Δ ⁣:Spec⁡A×kSpec⁡A→Spec⁡A, the identity Spec⁡ε and the inverse Spec⁡S, and the two constructions are inverse on isomorphism classes. Hence G↦O(G) restricts to an antiequivalence of categories between affine group schemes of finite type over k and finitely generated commutative Hopf algebras over k, with quasi-inverse A↦Spec⁡A. AC is used in (a) through An affine scheme of finite type over a field has a finitely generated coordinate ring and in (b) for affine quasi-compactness; the diagram reversal and compatibility of morphisms are choice-free.

Facts & Assumptions

[F1]

The coordinate ring of an affine group scheme is a commutative Hopf algebra via Δ=O(m), ε=O(e), S=O(i), and a morphism of affine group schemes induces a morphism of commutative Hopf algebras. (The coordinate ring of an affine group scheme is a commutative Hopf algebra, The coordinate Hopf algebra of an affine group scheme)

[F2]

An affine group scheme of finite type over k has finitely generated coordinate ring; this is the declared use of AC. (An affine scheme of finite type over a field has a finitely generated coordinate ring, The Axiom of Choice)

[F3]

The global-sections functor is a contravariant equivalence between affine k-schemes and commutative k-algebras, with quasi-inverse Spec⁡, and it is fully faithful; moreover Spec⁡(A⊗kB)≅Spec⁡A×kSpec⁡B. (Affine schemes are contravariantly equivalent to commutative rings, Affine fibre products are spectra of tensor products, Global functions on Spec A recover A, Affine schemes and their coordinate rings)

[F4]

A k-algebra homomorphism A→k corresponds to a morphism Spec⁡k→Spec⁡A, and the composite of comorphisms is the comorphism of the composite in reverse order. (The coordinate Hopf algebra of an affine group scheme, Morphisms and closed subgroup schemes of group schemes)

Proof

Given: A field k, the data of [F1]-[F4], and the Axiom of Choice for [F2] and affine quasi-compactness in part (b).

1.1F1F2F4

(Part (a), the functor.) For an affine group scheme G of finite type over k, [F1] makes O(G) a commutative Hopf algebra, finitely generated by [F2]; for a morphism f ⁣:G→H of group schemes, [F1] makes O(f) ⁣:O(H)→O(G) a morphism of Hopf algebras, and O of composites and identities is computed by pullback, giving the contravariant functor.

1.2F3F4

(Part (b), the group scheme.) Let A be a finitely generated commutative Hopf algebra over k. By [F3] the maps Δ,ε,S have comorphisms m=Spec⁡Δ ⁣:Spec⁡A×kSpec⁡A→Spec⁡A, e=Spec⁡ε ⁣:Spec⁡k→Spec⁡A and i=Spec⁡S ⁣:Spec⁡A→Spec⁡A, using Spec⁡(A⊗kA)≅Spec⁡A×kSpec⁡A. Reversing the argument of The coordinate ring of an affine group scheme is a commutative Hopf algebra turns the coassociativity, counit and antipode axioms into m∘(m×id⁡)=m∘(id⁡×m), m∘(e×id⁡)=id⁡=m∘(id⁡×e) and m∘(i,id⁡)=e∘p=m∘(id⁡,i), because the comorphism of m×id⁡ is Δ⊗id⁡ and O is a functor; hence Spec⁡A is a group scheme over k. It is of finite type: the identity chart exhibits k→A as finitely generated, and the structure morphism is quasi-compact because affine schemes are quasi-compact (Every affine scheme is quasi-compact).

2.1F1F3step 1.1

(Part (a), full faithfulness.) The functor is the restriction of the fully faithful anti-equivalence of [F3] to group objects and cogroup objects with structure-preserving morphisms: a scheme morphism f ⁣:G→H is a group-scheme morphism exactly when it satisfies f∘mG=mH∘(f×f), f∘eG=eH, iH∘f=f∘iG (Morphisms and closed subgroup schemes of group schemes), and passing to comorphisms this is exactly the condition that O(f) preserves Δ, ε, S; the bijection on Hom-sets is inherited from [F3], so the functor is full and faithful.

2.2F3F4step 1.2

(Part (b), inverse constructions.) Starting from a finitely generated commutative Hopf algebra A, the coordinate Hopf algebra of Spec⁡A is (Γ(Spec⁡A,O),O(m),O(e),O(i))≅(A,Δ,ε,S) by [F3] and [F4], so the round trip recovers A up to isomorphism. Starting from an affine group scheme G of finite type, [F3] gives Spec⁡O(G)≅G and the transposition of the group identities identifies the reconstructed group structure with the original one, so the round trip recovers G up to isomorphism.

3.1F2step 2.1step 2.2given∎

(Antiequivalence and choice.) Steps 2.1 and 2.2 show that G↦O(G) is fully faithful and essentially surjective onto finitely generated commutative Hopf algebras, with quasi-inverse A↦Spec⁡A; hence it is an antiequivalence of categories. AC was used in [F2] for finite generation and in step 1.2 for affine quasi-compactness. The group-object construction, compatibility of morphisms and round-trip isomorphisms are formal consequences of the affine anti-equivalence.

Depends on

Used by

Dependency tree · two levels

37 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