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 regular Hopf module and its projection
Example
Let be any Hopf algebra over a field . Regard as a right module over itself by multiplication and as a right comodule by its coproduct . Its coinvariants are , and the projection from the fundamental theorem is . The decomposition map is .
Facts & Assumptions
Given: A Hopf algebra over a field , with its regular right action and regular right coaction.
In the right-right convention, compatibility is and coinvariants satisfy (Right-right Hopf modules and coinvariants).
The projection is , and the fundamental theorem uses and (The coinvariant projection of a right-right Hopf module, The fundamental theorem of right-right Hopf modules).
The multiplication is unital and associative, is coassociative and a unital algebra map, the counit identities are under the tensor-unit identifications, and (Hopf algebras and antipodes).
Verification
Multiplication gives the regular right module action because it is associative and unital; gives the regular right coaction because it is coassociative and counital. They satisfy compatibility since , which is exactly the right side of [F1] for .
If is coinvariant, then ; applying gives . Conversely every scalar multiple of is coinvariant. Moreover , so and . These are precisely the stated coinvariant subspace and decomposition maps.
Depends on
Used by
Nothing in the library uses this result yet.
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.