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.

The fundamental theorem of coalgebras

Statement

Let C be a coalgebra over a field k. If C is finite-dimensional, then every finite subset is contained in the finite-dimensional subcoalgebra C itself, with no Choice assumption. For arbitrary C, assuming the Axiom of Choice, every finite subset S⊆C is contained in a finite-dimensional subcoalgebra D⊆C.

Facts & Assumptions

Given: A field k, a coalgebra C, a finite subset S⊆C, and (in the arbitrary-dimensional branch) the Axiom of Choice.

[A1]
[F1]

Every tensor is a finite sum of elementary tensors, and the products are algebraic tensor products over k (Scalars, tensor powers, the empty tensor, opposite algebras and finite sums).

[F2]

For a coalgebra, Δ is coassociative and ε is a two-sided counit; a coalgebra map preserves both (Coalgebra and coalgebra map over a field).

[F3]

A subspace spanned by a finite list has a finite basis contained in that list, and a vector space with a finite basis is finite-dimensional (A finite spanning list contains a basis, without choice, Finite-dimensional vector space, and its dimension dim⁡FV; infinite-dimensional means having no finite basis).

[F4]

If q:C→C/A is a quotient map, then ker⁡(q⊗idC)=A⊗C as a subspace of C⊗C; tensoring an inclusion is injective under AC (Tensoring injections and the kernel of a tensor product of quotient maps over a field).

[F5]

If b1,…,bn are linearly independent and ∑ibi⊗wi=0, then each wi=0; for a finite-dimensional ambient space this coefficient-separation statement has a choice-free proof (Coefficient separation for an independent family of vectors, with explicit Choice assumptions).

[F6]

For every m≥1, the vector space with basis uij and formulas Δ(uij)=∑ℓuiℓ⊗uℓj, ε(uij)=δij is a coalgebra (Finite comatrix coalgebras exist).

[F7]

Coideals have quotient coalgebras, kernels of coalgebra maps are coideals, and arbitrary sums of subcoalgebras are subcoalgebras (Coideal quotients, coalgebra-map kernels, and sums of subcoalgebras).

[F9]

For any subset X, span⁡(X) is the smallest linear subspace containing X (Linear combination of a finite list, and the span span⁡(S) as the smallest linear subspace containing S).

[F10]

The quotient C/A is the vector-space quotient by cosets, with its quotient map linear (Quotient module M/N with scalar multiplication on additive cosets, The quotient action is well defined and makes M/N a module).

[F11]

Linear maps induce tensor maps functorially; the associator and symmetry are natural, and the unit isomorphisms are natural as well (Module homomorphisms induce tensor-product homomorphisms functorially, Associator naturality, pentagon, unit triangle and symmetry hexagons on elementary tensors).

[F12]

A subcoalgebra is a subspace equipped with a coalgebra structure for which its inclusion into the ambient coalgebra is a coalgebra map (Subcoalgebras, coideals, and quotient coalgebras).

[F13]

A map prescribed on the basis of a free vector space extends uniquely to a linear map (Universal property of the free module on a set).

Proof

1.1givenA1F1F2F12construct

If C is finite-dimensional, take D=C. Now assume C is arbitrary and use [A1]. It is enough first to put a single c∈C into a finite-dimensional subcoalgebra; when c=0, take D=0 with the unique maps ΔD:0→0⊗0 and εD:0→k. The coalgebra identities hold because the identity map on 0 is zero and all maps with domain 0 are zero, and the inclusion D↪C preserves Δ and ε because both composites from 0 are zero.

2.1step 1.1F1F2F3F8F9F11construct

Let c≠0. By [F1], write Δ(c)=∑j=1rxj⊗yj and let Y=span⁡(y1,…,yr). By [F3] choose a finite ordered basis b1,…,bn of Y. Since Δ(c)≠0 by the counit equation in [F2], n≥1. By [F8], write each yj=∑i=1nλijbi and regroup the finite tensor sum to obtain Δ(c)=∑i=1nai⊗bi, where ai=∑j=1rλijxj; the bi are independent.

3.1step 2.1A1F2F4F5F9F10F11algebra

Set A=span⁡(a1,…,an) and let q:C→C/A. In the common iterated tensor product C⊗(C⊗C), coassociativity [F2] gives ∑iα(Δ(ai)⊗bi)=∑iai⊗Δ(bi). Apply q⊗id⊗id and naturality of α; the right-hand side vanishes because q(ai)=0, so, using the associator to regard each term in ((C/A)⊗C)⊗C, ∑i((q⊗id)Δ(ai))⊗bi=0. Apply the tensor symmetry that exchanges the two factors ((C/A)⊗C) and C to obtain ∑ibi⊗((q⊗id)Δ(ai))=0. Since the bi are independent, [F5] gives (q⊗id)Δ(ai)=0 for every i. The kernel identity [F4] therefore gives Δ(ai)∈A⊗C, and linearity gives Δ(A)⊆A⊗C.

4.1step 2.1step 3.1F2F3F4F8F11algebra

Apply [F3] to the finite spanning list a1,…,an; its choice-free finite-list construction gives an ordered basis e1,…,em of A. If A=0, the expression for Δ(c) in step 2.1 gives Δ(c)=0, so the counit equation in [F2] gives c=0, contradicting the hypothesis of step 2.1. Hence m≥1. Let ϕi:A→k be the ith coordinate map in this ordered basis. If x=∑iriei and y=∑isiei, uniqueness of coordinates gives ϕj(x+y)=rj+sj and ϕj(λx)=λrj, so each ϕj is linear by [F8]. Write jA:A↪C for the inclusion. By [F4], jA⊗idC is injective; since Δ(ej) lies in its image by step 3.1, let Δ~(ej)∈A⊗C be its unique preimage. Define cij:=λC∘(ϕi⊗idC)(Δ~(ej)), where λC:k⊗C→C is the tensor unit map. Writing Δ~(ej)=∑txt⊗yt and expanding xt=∑iϕi(xt)ei gives Δ(ej)=∑iei⊗∑tϕi(xt)yt=∑iei⊗cij.

5.1step 4.1A1F2F4F8F11algebra

Apply coassociativity to Δ(ej)=∑iei⊗cij. In C⊗(C⊗C) its two sides are the images of ∑i,ℓeℓ⊗(cℓi⊗cij) and ∑iei⊗Δ(cij), respectively, under jA⊗idC⊗C:A⊗(C⊗C)→C⊗(C⊗C), using the associator to identify the first expression with the left coassociativity composite. This tensor map is injective by [F4] and the associator naturality in [F11], so the two displayed preimages are equal in A⊗(C⊗C). Apply the well-defined linear map λC⊗C∘(ϕs⊗idC⊗C) for each s; since ϕs(eℓ)=δsℓ, it gives Δ(csj)=∑icsi⊗cij.

5.2step 4.1F2F3F8algebra

The right counit equation on ej gives ej=∑ieiε(cij), so uniqueness of coordinates [F8] gives ε(cij)=δij. The left counit equation gives ej=∑iε(ei)cij, so each basis vector ej lies in D:=span⁡{ciℓ:1≤i,ℓ≤m}. Hence A⊆D.

6.1step 5.1step 5.2F6F11F13construct

Let Em be the finite comatrix coalgebra of [F6] and define the linear map Φ:Em→C by extending uij↦cij from its basis, which is possible by [F13]. Steps 5.1 and 5.2 show on every basis vector that ΔCΦ=(Φ⊗Φ)ΔEm and εCΦ=εEm; linearity makes Φ a coalgebra map.

6.2step 2.1step 5.2F2algebra

The right counit equation on c gives c=∑iaiε(bi). By step 5.2 every ai∈A⊆D, so c∈D. This places c in the candidate coefficient subspace.

7.1step 6.1step 6.2A1F3F7F10F11F12construct

Put K=ker⁡Φ. By [F7], K is a coideal, Em/K is a coalgebra, and the induced map Φ‾:Em/K→C is a coalgebra map. It is injective because Φ(x)=0 exactly when x∈K, and its image is D. Regard it as a linear isomorphism ψ:Em/K→D, and define ΔD=(ψ⊗ψ)ΔEm/Kψ−1 and εD=εEm/Kψ−1. For coassociativity, composing the two coalgebra composites on D with the surjection ψ gives respectively (ψ⊗(ψ⊗ψ))α(ΔEm/K⊗id)ΔEm/K and (ψ⊗(ψ⊗ψ))(id⊗ΔEm/K)ΔEm/K, which are equal by coassociativity on Em/K and naturality of the associator [F11]. Similarly, composing the left and right counit composites with ψ gives ψλEm/K(ε⊗id)Δ and ψρEm/K(id⊗ε)Δ, both equal to ψ; surjectivity of ψ proves the two counit equations on D. Since Φ‾=jDψ is a coalgebra map, ΔCjDψ=(jD⊗jD)(ψ⊗ψ)ΔEm/K=(jD⊗jD)ΔDψ and εCjDψ=εDψ; surjectivity of ψ proves that the inclusion jD:D↪C is a coalgebra map. Thus D is a subcoalgebra by [F12]. Its finite spanning list of m2 coefficients makes it finite-dimensional by [F3], and together with step 6.2 it contains c.

7.2step 6.2A1F3F7F9givenconstruct

For a finite set S, apply the one-element assertion to each c∈S and take the sum of the resulting subcoalgebras. By [F7] the sum is a subcoalgebra; it contains S and is spanned by the finite union of their finite coefficient lists, so [F3] makes it finite-dimensional. If S=∅, take the zero subcoalgebra.

8.1step 1.1step 2.1step 3.1step 4.1step 7.1step 7.2A1F3F4F5F7∎

The finite-dimensional case is choice-free by step 1.1. In the arbitrary-dimensional case, [A1] is used through the coefficient-separation and tensor-kernel suppliers in step 3.1 and through the quotient and sum results in steps 7.1 and 7.2; steps 2.1 and 4.1 use only finite tensor expressions and the choice-free finite-list basis lemma. Step 7.1 proves the one-element case, and step 7.2 handles the finite subset, including the empty set.

Remarks

The coefficient-separation route uses the actual statement of Coefficient separation for an independent family of vectors, with explicit Choice assumptions: independent tensor coefficients vanish. It does not assert that coordinate functionals on a finite subspace extend to the whole infinite-dimensional coalgebra.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

65 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