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 be a coalgebra over a field . If is finite-dimensional, then every finite subset is contained in the finite-dimensional subcoalgebra itself, with no Choice assumption. For arbitrary , assuming the Axiom of Choice, every finite subset is contained in a finite-dimensional subcoalgebra .
Facts & Assumptions
Given: A field , a coalgebra , a finite subset , and (in the arbitrary-dimensional branch) the Axiom of Choice.
AC holds (The Axiom of Choice).
Every tensor is a finite sum of elementary tensors, and the products are algebraic tensor products over (Scalars, tensor powers, the empty tensor, opposite algebras and finite sums).
For a coalgebra, is coassociative and is a two-sided counit; a coalgebra map preserves both (Coalgebra and coalgebra map over a field).
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 ; infinite-dimensional means having no finite basis).
If is a quotient map, then as a subspace of ; tensoring an inclusion is injective under AC (Tensoring injections and the kernel of a tensor product of quotient maps over a field).
If are linearly independent and , then each ; 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).
For every , the vector space with basis and formulas , is a coalgebra (Finite comatrix coalgebras exist).
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).
Every vector in a finite ordered basis has a unique coordinate list, and the coordinate maps are linear (A finite list is an ordered basis if and only if every equals for exactly one ; those scalars are the coordinates of in that ordered basis).
For any subset , is the smallest linear subspace containing (Linear combination of a finite list, and the span as the smallest linear subspace containing ).
The quotient is the vector-space quotient by cosets, with its quotient map linear (Quotient module with scalar multiplication on additive cosets, The quotient action is well defined and makes a module).
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).
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).
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
If is finite-dimensional, take . Now assume is arbitrary and use [A1]. It is enough first to put a single into a finite-dimensional subcoalgebra; when , take with the unique maps and . The coalgebra identities hold because the identity map on is zero and all maps with domain are zero, and the inclusion preserves and because both composites from are zero.
Let . By [F1], write and let . By [F3] choose a finite ordered basis of . Since by the counit equation in [F2], . By [F8], write each and regroup the finite tensor sum to obtain , where ; the are independent.
Set and let . In the common iterated tensor product , coassociativity [F2] gives . Apply and naturality of ; the right-hand side vanishes because , so, using the associator to regard each term in , . Apply the tensor symmetry that exchanges the two factors and to obtain . Since the are independent, [F5] gives for every . The kernel identity [F4] therefore gives , and linearity gives .
Apply [F3] to the finite spanning list ; its choice-free finite-list construction gives an ordered basis of . If , the expression for in step 2.1 gives , so the counit equation in [F2] gives , contradicting the hypothesis of step 2.1. Hence . Let be the th coordinate map in this ordered basis. If and , uniqueness of coordinates gives and , so each is linear by [F8]. Write for the inclusion. By [F4], is injective; since lies in its image by step 3.1, let be its unique preimage. Define , where is the tensor unit map. Writing and expanding gives .
Apply coassociativity to . In its two sides are the images of and , respectively, under , 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 . Apply the well-defined linear map for each ; since , it gives .
The right counit equation on gives , so uniqueness of coordinates [F8] gives . The left counit equation gives , so each basis vector lies in . Hence .
Let be the finite comatrix coalgebra of [F6] and define the linear map by extending from its basis, which is possible by [F13]. Steps 5.1 and 5.2 show on every basis vector that and ; linearity makes a coalgebra map.
The right counit equation on gives . By step 5.2 every , so . This places in the candidate coefficient subspace.
Put . By [F7], is a coideal, is a coalgebra, and the induced map is a coalgebra map. It is injective because exactly when , and its image is . Regard it as a linear isomorphism , and define and . For coassociativity, composing the two coalgebra composites on with the surjection gives respectively and , which are equal by coassociativity on and naturality of the associator [F11]. Similarly, composing the left and right counit composites with gives and , both equal to ; surjectivity of proves the two counit equations on . Since is a coalgebra map, and ; surjectivity of proves that the inclusion is a coalgebra map. Thus is a subcoalgebra by [F12]. Its finite spanning list of coefficients makes it finite-dimensional by [F3], and together with step 6.2 it contains .
For a finite set , apply the one-element assertion to each and take the sum of the resulting subcoalgebras. By [F7] the sum is a subcoalgebra; it contains and is spanned by the finite union of their finite coefficient lists, so [F3] makes it finite-dimensional. If , take the zero subcoalgebra.
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
- Coalgebra and coalgebra map over a field
- Subcoalgebras, coideals, and quotient coalgebras
- A finite spanning list contains a basis, without choice
- Finite comatrix coalgebras exist
- Coideal quotients, coalgebra-map kernels, and sums of subcoalgebras
- Coefficient separation for an independent family of vectors, with explicit Choice assumptions
- Tensoring injections and the kernel of a tensor product of quotient maps over a field
- The Axiom of Choice
- Scalars, tensor powers, the empty tensor, opposite algebras and finite sums
- Associator naturality, pentagon, unit triangle and symmetry hexagons on elementary tensors
- Module homomorphisms induce tensor-product homomorphisms functorially
- Quotient module $M/N$ with scalar multiplication on additive cosets
- The quotient action is well defined and makes $M/N$ a module
- A finite list $v : n \to V$ is an ordered basis if and only if every $x \in V$ equals $\sum_{i<n} \lambda_i v_i$ for exactly one $\lambda : n \to F$; those scalars are the coordinates of $x$ in that ordered basis
- Linear combination of a finite list, and the span $\operatorname{span}(S)$ as the smallest linear subspace containing $S$
- Finite-dimensional vector space, and its dimension $\dim_F V$; infinite-dimensional means having no finite basis
- Universal property of the free module on a set
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
- UCSD Math 207A, Hopf Algebras lecture notes, Spring 2020 (standard reference, not scraped)
- William Chin, A Brief Introduction to Coalgebra Representation Theory (standard reference, not scraped)