Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedjudge pass (gpt-6.1-sol)verified 2026-10-03 (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.

The affine Hopf dictionary used for multiplicative type

Statement

Affine k-group schemes are contravariantly equivalent to commutative Hopf k-algebras. A group character G→Gm corresponds precisely to a group-like element of its coordinate algebra. These correspondences commute with field extension.

Facts & Assumptions

[F1]

Affine schemes and rings are contravariantly equivalent: Affine schemes are contravariantly equivalent to commutative rings.

[F2]

Hopf maps and group-like elements have the convention of Coordinate Hopf algebras for multiplicative type.

Proof

Given: An affine scheme G=Spec⁡A over k.

1.1F1F2algebra

The ring A⊗kB represents pairs of maps from A,B into any commutative k-algebra: the unique map is a⊗b↦f(a)g(b). Therefore Spec⁡(A⊗B) is the product of the two affine schemes. Apply F1 to multiplication, identity, and inverse. Their group diagrams reverse to exactly the coassociativity, counit, and inverse identities in F2. Conversely these identities reverse to the group diagrams, so reconstruct a group object. Maps reverse in the same manner, and the two constructions are inverse.

2.1step 1.1F2algebra∎

A map k[t,t−1]→A is determined by an invertible element a, the image of t. The multiplication and identity diagrams say Δ(a)=a⊗a and ϵ(a)=1. The inverse identity gives S(a)a=1, so every group-like element is invertible and also respects inverse. Thus characters are exactly group-like elements. Tensoring each structural map with an extension field preserves the identities and all formulas, proving base-change compatibility.

Depends on

Dependency tree · 2 levels

Sources