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 be a right-right Hopf module over a Hopf algebra over a field . Define
Then is a linear map with image in , it fixes every coinvariant, and hence . No bijectivity of is assumed.
Facts & Assumptions
Given: A field , a Hopf algebra over , and a right-right Hopf module .
The coaction is and compatibility is (Right-right Hopf modules and coinvariants).
The antipode is anti-comultiplicative, (Uniqueness and anti-multiplicativity and anti-comultiplicativity of the antipode).
The antipode equations are and they imply (Hopf algebras and antipodes).
Coinvariants are those with , and they form a -subspace (Right-right Hopf modules and coinvariants, The coinvariants of a right-right Hopf module form a subspace).
Proof
The map is the composite of the linear map , the linear map , and the linear action map ; hence it is linear. By [F1] and anti-comultiplicativity in [F2], coassociativity of gives ; the reversed order in the two factors is exactly .
For every , the antipode equation in [F3] and coassociativity give . Flipping the factors and applying to the first factor yields . Applying the linear action of the first coaction component to this tensor identity reduces the expression in step 1.1 to .
Thus for every , by [F4]. If , then : the first equality uses , and is in [F3]. Therefore fixes its image, so .
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
- Hans-Juergen Schneider, Lectures on Hopf Algebras, notes by Sonia Natale, Trabajos de Matematica 31/95 (standard reference, not scraped)
- D. S. Drogalski, Chapter 3: Hopf Algebras, UC San Diego 207A lecture notes (standard reference, not scraped)