Alphabeta Math
CorollaryStatement: 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.

Right-right Hopf modules are equivalent to vector spaces

Statement

Let H be a Hopf algebra over a field k. The coinvariants functor from right-right Hopf modules over H to k-vector spaces and the free Hopf-module functor V↦V⊗H are inverse equivalences. Their natural unit is ηV(v)=v⊗1H, and their natural counit is ϵM(n⊗h)=nh.

Facts & Assumptions

Given: A field k, a Hopf algebra H, right-right Hopf modules over H, and k-vector spaces.

[F1]

Right-right Hopf modules and their morphisms preserve the specified action and coaction, and Mco⁡H is a subspace (Right-right Hopf modules and coinvariants, The coinvariants of a right-right Hopf module form a subspace).

[F2]

The free functor sends V to the Hopf module V⊗H with the action and coaction on the second factor (The free right-right Hopf module on a vector space).

[F3]

The map Mco⁡H⊗H→M, n⊗h↦nh, is a natural candidate isomorphism with inverse m↦∑P(m0)⊗m1 (The fundamental theorem of right-right Hopf modules).

[F4]

The map V→(V⊗H)co⁡H, v↦v⊗1H, is an isomorphism with inverse id⁡V⊗ε (Coinvariants of a free right-right Hopf module).

Proof

1.1F1givenconstruct

Let HopfModHr,r have right-right Hopf modules as objects and linear maps preserving action and coaction as morphisms; let Vectk have vector spaces and linear maps. Define C(M)=Mco⁡H and C(f)=f∣Mco⁡H. If n is coinvariant, then ρ(f(n))=(f⊗id⁡)ρ(n)=f(n)⊗1H, so this restriction is well defined; identities and composites restrict to identities and composites. Hence C is a functor.

1.2F2construct

Define T(V)=V⊗H with [F2]'s structure and T(g)=g⊗id⁡H for a linear map g:V→W. On elementary tensors, T(g) preserves the right action and coaction by the formulas in [F2]; tensor functoriality gives T(id⁡)=id⁡ and T(g′f)=T(g′)T(f). Thus T is a functor.

2.1F3F4step 1.1step 1.2

The maps ηV(v)=v⊗1H and ϵM(n⊗h)=nh are the isomorphisms in [F4] and [F3], respectively. They are natural: for linear g:V→W, (g⊗id⁡)(v⊗1H)=g(v)⊗1H; for a Hopf-module morphism f:M→N, f(nh)=f(n)h on n⊗h. By linearity these equalities give both naturality squares.

3.1F2F3step 2.1algebra

For v⊗h∈T(V), T(ηV)(v⊗h)=(v⊗1H)⊗h, so ϵT(V)T(ηV)(v⊗h)=(v⊗1H)h=v⊗h. Therefore ϵT(V)∘T(ηV)=id⁡T(V).

4.1F1F3step 2.1algebra∎

For n∈C(M), C(ϵM)ηC(M)(n)=ϵM(n⊗1H)=n1H=n. Hence C(ϵM)∘ηC(M)=id⁡C(M). The unit and counit are natural isomorphisms satisfying both triangle identities, so C and T are inverse equivalences.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

13 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