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 and coinvariants
Definition
Let be a field, a Hopf algebra over , and a -vector space. A right -module structure on is a bilinear map satisfying and . A right -comodule structure is a linear map satisfying
Write and , where each expression denotes a finite tensor sum. The pair of structures makes a right-right Hopf module if it satisfies
A morphism of right-right Hopf modules is a linear map preserving both the right action and right coaction. The coinvariants are the subset
The next lemma proves that this subset is a -subspace. No finite-dimensionality of or , and no bijectivity of the antipode, is part of the definition.
Depends on
Used by
- Right-right Hopf modules are equivalent to vector spaces Corollary
- A module and comodule need not satisfy Hopf compatibility Counterexample
- The free Hopf module over a group algebra Example
- The free Hopf module over the polynomial Hopf algebra Example
- The regular Hopf module and its projection Example
- Coinvariants of a free right-right Hopf module Lemma
- The coinvariant projection of a right-right Hopf module Lemma
- The coinvariants of a right-right Hopf module form a subspace Lemma
- The finite dual is a right regular Hopf module Lemma
- The free right-right Hopf module on a vector space Lemma
- The fundamental theorem of right-right Hopf modules Theorem
Dependency tree · two levels
20 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)