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.
A module and comodule need not satisfy Hopf compatibility
Statement refuted
Every right -module and right -comodule on the same vector space automatically form a right-right Hopf module.
Facts & Assumptions
Given: A field , the group algebra with basis and , and the one-dimensional vector space . Set , , and . Give the right action and right coaction .
Hopf-module compatibility would require (Right-right Hopf modules and coinvariants).
In , and are distinct basis elements, , and with ; these maps satisfy the Hopf axioms as verified below.
Proof
The multiplication on is the group multiplication on extended bilinearly, hence associative and unital. The maps are unital algebra maps because and . Coassociativity and counitality hold on the basis since both are group-like, and satisfies and the same identity on . Thus is a Hopf algebra over , in every characteristic.
The rule is a unital right module action because is a unital algebra map: . The map is a right coaction because and . Therefore each structure separately satisfies its axioms.
For , the left side of [F1] is , while the right side is . Since and are linearly independent, these tensors differ. Thus the two structures do not satisfy Hopf-module compatibility, refuting the assertion.
Depends on
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
7 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.