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.

The coinvariant projection of a right-right Hopf module

Statement

Let M be a right-right Hopf module over a Hopf algebra H over a field k. Define

P:M→M,P(m):=∑m0S(m1).

Then P is a linear map with image in Mco⁡H, it fixes every coinvariant, and hence P2=P. No bijectivity of S is assumed.

Facts & Assumptions

Given: A field k, a Hopf algebra H over k, and a right-right Hopf module M.

[F1]

The coaction is ρ(m)=∑m0⊗m1 and compatibility is ρ(mh)=∑m0h1⊗m1h2 (Right-right Hopf modules and coinvariants).

[F2]

The antipode is anti-comultiplicative, Δ(S(h))=∑S(h2)⊗S(h1) (Uniqueness and anti-multiplicativity and anti-comultiplicativity of the antipode).

[F3]

The antipode equations are ∑S(h1)h2=ε(h)1H=∑h1S(h2) and they imply S(1H)=1H (Hopf algebras and antipodes).

[F4]

Coinvariants are those n with ρ(n)=n⊗1H, and they form a k-subspace (Right-right Hopf modules and coinvariants, The coinvariants of a right-right Hopf module form a subspace).

Proof

1.1givenF1F2construct

The map P is the composite of the linear map ρ, the linear map id⁡M⊗S, and the linear action map M⊗H→M; hence it is linear. By [F1] and anti-comultiplicativity in [F2], coassociativity of ρ gives ρ(P(m))=∑m0S(m3)⊗m1S(m2); the reversed order in the two S factors is exactly ΔS=(S⊗S)τΔ.

2.1F2F3step 1.1algebra

For every h∈H, the antipode equation in [F3] and coassociativity give ∑h1S(h2)⊗h3=1H⊗h. Flipping the factors and applying S to the first factor yields ∑S(h3)⊗h1S(h2)=S(h)⊗1H. Applying the linear action of the first coaction component to this tensor identity reduces the expression in step 1.1 to ρ(P(m))=∑m0S(m1)⊗1H=P(m)⊗1H.

3.1F3F4step 2.1algebra∎

Thus P(m)∈Mco⁡H for every m, by [F4]. If n∈Mco⁡H, then P(n)=nS(1H)=n: the first equality uses ρ(n)=n⊗1H, and S(1H)=1H is in [F3]. Therefore P fixes its image, so P2=P.

Depends on

Used by

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