Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedPipeline-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.

Coideal quotients, coalgebra-map kernels, and sums of subcoalgebras

Statement

Let C be a coalgebra over a field k, and assume the Axiom of Choice. For every coideal I⊆C, the quotient vector space C/I has a unique coalgebra structure making q:C→C/I a coalgebra map, given by

Δ‾(c+I)=(q⊗q)Δ(c),ε‾(c+I)=εC(c).

This quotient has the universal property that every coalgebra map f:C→D with I⊆ker⁡f factors uniquely through q by a coalgebra map. Also, the kernel of every coalgebra map is a coideal, and the sum of any family of subcoalgebras of C is a subcoalgebra.

Facts & Assumptions

Given: A field k, a coalgebra C, and the Axiom of Choice.

[A1]

The Axiom of Choice says every family of nonempty sets has a choice function (The Axiom of Choice).

[F1]

A coideal I satisfies εC(I)=0 and ΔC(I)⊆I⊗C+C⊗I; a subcoalgebra is a subspace with its inclusion a coalgebra map (Subcoalgebras, coideals, and quotient coalgebras).

[F2]

For subspaces U⊆V and Z⊆W, with quotient maps p:V→V/U and r:W→W/Z, ker⁡(p⊗r)=U⊗W+V⊗Z. Tensoring an injective linear map with an identity map is injective (Tensoring injections and the kernel of a tensor product of quotient maps over a field).

[F3]

The quotient C/I consists of additive cosets, with the quotient map linear and surjective; for a vector space the scalar action on cosets is well-defined (Quotient module M/N with scalar multiplication on additive cosets, The quotient action is well defined and makes M/N a module).

[F4]

Linear maps induce tensor maps, preserve composition, and are determined by their values on elementary tensors (Module homomorphisms induce tensor-product homomorphisms functorially).

[F5]

The associator and symmetry are natural, and the unit isomorphisms are natural as well (Associator naturality, pentagon, unit triangle and symmetry hexagons on elementary tensors).

[F6]

Coalgebra maps preserve comultiplication and counit, and the coalgebra identities use the associator and unit isomorphisms of [F5] (Coalgebra and coalgebra map over a field).

Proof

1.1givenA1F1F2F3F4construct

Let q:C→C/I be the quotient map. By [F2], ker⁡(q⊗q)=I⊗C+C⊗I, so (q⊗q)Δ(x)=0 for every x∈I by [F1]; also εC(x)=0 for x∈I. If c+I=c′+I, then c−c′∈I by the coset description [F3], and these two vanishing facts give (q⊗q)Δ(c)=(q⊗q)Δ(c′) and εC(c)=εC(c′). Hence the displayed formulas are well-defined on cosets; their linearity follows from linearity of Δ, εC, and q⊗q together with the quotient operations of [F3]. They define maps Δ‾ and ε‾ with Δ‾q=(q⊗q)Δ and ε‾q=εC. The map q⊗q is surjective: each element of (C/I)⊗(C/I) is a finite sum of elementary tensors, and each factor of each elementary tensor has a preimage under q.

1.2givenA1F1F2F3F5F6algebra

Let f:C→D be a coalgebra map and K=ker⁡f. Then εC(K)=0 by [F6]. Let qK:C→C/K be the quotient map and define f~:C/K→D by f~(c+K)=f(c). This is well-defined and linear by the coset description [F3], and it is injective because f~(c+K)=0 implies c∈K. For x∈K, (f~⊗f~)(qK⊗qK)Δ(x)=(f⊗f)Δ(x)=ΔD(f(x))=0. The tensor map f~⊗f~ is injective by [A1] and [F2], applying the injection assertion twice and using the symmetry in [F5]; hence (qK⊗qK)Δ(x)=0. The quotient-kernel formula [F2] now gives Δ(x)∈K⊗C+C⊗K, so K is a coideal by [F1].

1.3givenA1F1F2F4construct

Let (Dα)α∈Λ be any family of subcoalgebras and set S=∑α∈ΛDα, where the sum consists of finite sums of elements of the Dα. For s∈S, write s=∑j=1rdj with each dj in some Dαj. Since each inclusion Dαj→C is a coalgebra map, ΔC(dj) lies in the image of Dαj⊗Dαj, which factors through S⊗S. Thus ΔC(S) lies in the image of S⊗S→C⊗C. This last map is injective by [A1] and [F2], so it gives a unique linear ΔS:S→S⊗S with (jS⊗jS)ΔS=ΔCjS; put εS=εC∣S.

2.1step 1.1F4F5F6algebra

The coassociativity composites, after precomposition with q, satisfy αC/I,C/I,C/I(Δ‾⊗id)Δ‾q=(q⊗(q⊗q))αC,C,C(Δ⊗id)Δ=(q⊗(q⊗q))(id⊗Δ)Δ=(id⊗Δ‾)Δ‾q, where the middle equality is coassociativity in C and the outer equalities use functoriality and associator naturality [F4, F5, F6]. Since q is surjective, the composites on C/I are equal. Likewise λC/I(ε‾⊗id)Δ‾q=λC/I(εC⊗q)Δ=qλC(εC⊗id)Δ=q and ρC/I(id⊗ε‾)Δ‾q=ρC/I(q⊗εC)Δ=qρC(id⊗εC)Δ=q; unit naturality and the counit equations give the last equalities, and surjectivity of q proves both counit identities on C/I.

2.2step 1.3A1F2F5F6algebra

The map jS⊗jS⊗jS is injective by applying [F2] repeatedly, with associators from [F5]. Composing the two coassociativity composites for ΔS with this injection gives the corresponding composites for ΔCjS, which agree by [F6]; therefore the composites for ΔS agree. Composing either counit composite with jS gives the corresponding counit composite in C followed by jS, hence jS by [F6]; since jS is injective, each counit composite on S is idS. Thus S is a subcoalgebra. If Λ is empty, S=0 and the unique zero structure maps satisfy the coalgebra identities on the zero space.

3.1step 1.1step 2.1F3F4F6

Any coalgebra structure on C/I making q a coalgebra map must satisfy Δ‾q=(q⊗q)Δ and ε‾q=εC. Surjectivity of q uniquely determines each map, so the displayed quotient structure is unique. If a coalgebra map f:C→D kills I, define f‾(c+I)=f(c). This is well-defined and linear by [F3]. The equations εDf‾q=εC=ε‾q and ΔDf‾q=(f⊗f)Δ=(f‾⊗f‾)(q⊗q)Δ=(f‾⊗f‾)Δ‾q show, by surjectivity of q, that f‾ is a coalgebra map; any factorization is this map on cosets, so it is unique.

4.1step 1.1step 2.1step 3.1step 1.2step 1.3step 2.2∎

Steps 1.1 and 2.1 establish the quotient coalgebra, and step 3.1 proves its uniqueness and universal property. Step 1.2 establishes the kernel coideal claim; steps 1.3 and 2.2 establish closure under arbitrary sums of subcoalgebras.

Depends on

Used by

Dependency tree · two levels

33 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