Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedprecheck pass
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.

Coinvariants of a free right-right Hopf module

Statement

Let V be any k-vector space and H a Hopf algebra over k. For the free Hopf module V⊗H with coaction on the H factor,

(V⊗H)co⁡H={v⊗1H:v∈V}.

The map i:V→(V⊗H)co⁡H, i(v)=v⊗1H, is an isomorphism with inverse the restriction of q:=id⁡V⊗ε.

Facts & Assumptions

Given: A field k, a Hopf algebra H with counit ε, and a k-vector space V.

[F1]

The free Hopf module has coaction ρ(v⊗h)=∑(v⊗h1)⊗h2 (The free right-right Hopf module on a vector space).

[F2]

Coinvariants are exactly x satisfying ρ(x)=x⊗1H (Right-right Hopf modules and coinvariants).

[F3]

The counit identities are λH(ε⊗id⁡H)Δ=id⁡H=ρH(id⁡H⊗ε)Δ (Coalgebra and coalgebra map over a field).

[F4]

The coproduct is a unital algebra map, so Δ(1H)=1H⊗1H, and the counit is unital, so ε(1H)=1 (Bialgebras and bialgebra maps).

Proof

1.1givenF1F4

The map i(v)=v⊗1H has image in the coinvariants: by [F1], ρ(i(v))=∑(v⊗1H)⊗1H=i(v)⊗1H, since Δ(1H)=1H⊗1H by [F4]. The counit map q=id⁡V⊗ε satisfies q(i(v))=vε(1H)=v by [F4].

2.1F1F2F3construct∎

If x∈(V⊗H)co⁡H, then [F1]-[F2] say (id⁡V⊗Δ)(x)=x⊗1H. Apply id⁡V⊗ε⊗id⁡H to both sides. The counit identity in [F3] gives x=q(x)⊗1H=i(q(x)). Thus every coinvariant lies in the image of i, and q is its inverse there. No basis or choice principle is used.

Depends on

Used by

Dependency tree · two levels

12 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