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 quasi-bialgebra need not be quasi-Hopf
Statement refuted
Every quasi-bialgebra has a quasi-antipode.
Construction
Let be the monoid with , , and . In the monoid algebra , set , for , and .
Facts & Assumptions
Given: The two-element monoid algebra and structure maps in the Construction.
Quasi-bialgebras, quasi-antipodes, and quasi-Hopf algebras: a quasi-antipode satisfies the two convolution identities and, when , the normalization equations give .
Bialgebras and bialgebra maps: a bialgebra has a coassociative coproduct, counit, and multiplicative unital structure maps.
Hopf algebras and antipodes: an ordinary Hopf antipode is a two-sided convolution inverse of the identity.
Counterexample
The monoid laws make multiplication associative and unital. On basis elements, , , , and coassociativity and the counit equations hold. Thus is a bialgebra and, with , a quasi-bialgebra.
Suppose is a quasi-antipode. With , its normalization equations give , so . Define . The quasi-antipode equations imply and ; thus is an ordinary Hopf antipode of the bialgebra in step 1.1.
The basis element is group-like: and . The antipode equations in [F3] would make invertible, since . But an invertible idempotent is (multiply by ), contradicting . Hence no quasi-antipode exists, refuting the statement.
Depends on
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
8 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
- P. Etingof, S. Gelaki, D. Nikshych, and V. Ostrik, Tensor Categories (standard reference, not scraped)