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.
Hopf ideals and Hopf subalgebras
Definition
Let be a field and let be a Hopf -algebra as in Hopf algebras and antipodes, with satisfying both convolution antipode equations. A subbialgebra of is a -subspace equipped with a bialgebra structure as in Bialgebras and bialgebra maps for which the inclusion is a bialgebra map. A Hopf subalgebra is a subbialgebra with . Under AC, meaning every family of nonempty sets has a choice function (The Axiom of Choice), the tensor-injection lemma Tensoring injections and the kernel of a tensor product of quotient maps over a field identifies with its image in ; in that shorthand, the subbialgebra condition says exactly that is a unital subalgebra, , and the counit is restricted from .
A Hopf ideal is a two-sided ideal in the sense of Left, right and two-sided ideals, , satisfying , , and the coideal condition from Subcoalgebras, coideals, and quotient coalgebras: . Under AC, the tensor-injection lemma identifies these tensor products with subspaces of , giving the usual shorthand . The two-sided ideal condition gives the unital quotient algebra ; makes its counit descend, and the remaining conditions are precisely those needed for the coproduct and antipode to descend. A subbialgebra is not called a Hopf subalgebra unless the antipode restricts to it.
Depends on
Used by
Dependency tree · two levels
24 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
- Andrew Baker, Hopf algebras over fields: an introduction, §§2.22–2.25 (standard reference, not scraped)