Alphabeta Math
DefinitionDefinition: Literature-sourcedProof: Not applicablePipeline-generatedjudge pass (gpt-6-luna)
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.

Subcoalgebras, coideals, and quotient coalgebras

Definition

Let (C,ΔC,εC) be a coalgebra. For every subspace U⊆C, write jU:U↪C for its inclusion and interpret the image of U⊗C or C⊗U in C⊗C through the tensor maps induced by inclusion.

A subcoalgebra of C is a subspace D⊆C equipped with linear maps ΔD:D→D⊗D and εD:D→k satisfying the coalgebra axioms, such that the inclusion jD is a coalgebra map. Under AC, Tensoring injections and the kernel of a tensor product of quotient maps over a field makes jD⊗jD and its iterated tensor powers injective. Hence the equivalent image criterion is that ΔC(D) lie in the image of D⊗D and that the counit on D be the restriction of εC: the inverse of jD⊗jD on its image gives the unique linear ΔD, and composing its axioms with the injective tensor powers reduces them to the coalgebra axioms on C.

A coideal is a subspace I⊆C satisfying εC(I)=0,ΔC(I)⊆im⁡(I⊗C→C⊗C)+im⁡(C⊗I→C⊗C). Under AC the two tensor maps are injective, so the second condition is written in the standard shorthand ΔC(I)⊆I⊗C+C⊗I. Both conditions are part of the definition.

A quotient coalgebra by I means a coalgebra structure on the vector-space quotient C/I for which the canonical projection q:C→C/I is a coalgebra map. The formula for that structure is not part of this definition.

Depends on

Used by

Dependency tree · two levels

31 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