Alphabeta Math
PropositionStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedprecheck passjudge 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 actions correspond to coordinate-ring coactions

Statement

Assume AC, inherited from the classical affine morphism correspondence. Let G be a complex affine algebraic group, H=C[G], and A=C[X] for an affine algebraic set X. Algebraic left actions on X correspond bijectively to unital algebra maps δ:A→H⊗A satisfying (Δ⊗id⁡)δ=(id⁡⊗δ)δ,(ε⊗id⁡)δ=id⁡. The correspondence is δ(f)(g,x)=f(gx). Equivalently c=τ(S⊗id⁡)δ:A→A⊗H is a right-comodule algebra structure; c(f)(x,g)=f(g−1x) and evaluating at g gives the left coordinate-ring action r(g)f=f∘g−1. Here τ switches tensor factors. An equivariant morphism u:X→Y corresponds to an algebra map u∗:C[Y]→A intertwining these coactions.

Facts & Assumptions

Given: G,X,H,A as above and AC.

[F1]

Product coordinate rings are tensor products, including for reducible sets (Products of affine algebraic sets have tensor-product coordinate rings).

[F2]

Algebra maps are precisely pullbacks of affine morphisms; the published proof assumes AC through its Nullstellensatz supplier (Classical affine morphisms are contravariantly equivalent to coordinate-ring homomorphisms, The Axiom of Choice).

[F3]

Action and comodule conventions are fixed in Classical complex affine algebraic actions and rational modules.

Proof

1.1F1F2F3given

Pull back an action along a and apply F1. The two action identities evaluated on f give respectively f(ghx)=f(g(hx)) and f(ex)=f(x), precisely the displayed identities for δ. Conversely F2 reconstructs a unique morphism from an algebra map δ; F1 and equality of pullbacks turn the displayed identities back into the action identities. Thus this is a bijection, also for the empty X.

2.1F1F2F3step 1.1

For this action define b(x,g)=g−1x. Inversion is a morphism and b(b(x,g),h)=h−1g−1x=(gh)−1x=b(x,gh), while b(x,e)=x. Pullback gives exactly c=τ(S⊗id⁡)δ, with the right-comodule identities asserted. Conversely a right-comodule algebra map reconstructs b by F2 and its identities by F1; a(g,x)=b(x,g−1) reconstructs the original left action. This also proves that conversion of either coaction to the other is inverse, since inversion squared is the identity.

3.1F1F2step 1.1step 2.1algebra∎

Evaluation gives r(g)f(x)=f(g−1x) and r(g)r(h)f(x)=f(h−1g−1x)=r(gh)f(x), with r(e)=id⁡ and inverse r(g−1). Finally u(gx)=gu(x) is equivalent, by F2, to δXu∗=(id⁡H⊗u∗)δY; conversion in step 2.1 gives the corresponding c identity. AC is used only through F2, not through any selection of a vector-space basis.

Depends on

Used by

Dependency tree · two levels

14 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