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.
Finite-dimensional algebra-coalgebra duality
Statement
For a finite-dimensional unital associative -algebra , the full dual is a coalgebra under the transpose of multiplication and unit. For every coalgebra , the full dual is a unital associative algebra under convolution. These dualizations reverse algebra and coalgebra maps. Restricted to finite-dimensional objects, the two contravariant dualizations are inverse equivalences via the canonical evaluation maps and . The finite-dimensionality hypothesis in the algebra-to-coalgebra direction is on itself, not merely on a module over .
Facts & Assumptions
Given: A field , a finite-dimensional unital associative -algebra , a coalgebra , and algebra and coalgebra maps as named below.
A unital associative -algebra has associative multiplication and unit ; algebra maps preserve multiplication, unit, and -scalars. (Algebras over a commutative ring, central structure maps, and algebra homomorphisms)
A coalgebra has coassociative and a two-sided counit ; a coalgebra map preserves both structure maps. (Coalgebra and coalgebra map over a field)
The full algebraic dual is the space of all linear functionals , and for finite-dimensional the pairing sends to and is an isomorphism. (Linear functionals and the algebraic dual , Finite tensor duality and basis-independent coevaluation)
Tensor maps are determined on elementary tensors and preserve composition. (Module homomorphisms induce tensor-product homomorphisms functorially)
The candidate convolution product on is , with candidate unit . (The dual convolution algebra and rational modules)
A vector space is finite-dimensional precisely when it has a finite basis. (Finite-dimensional vector space, and its dimension ; infinite-dimensional means having no finite basis)
Proof
Given: The data above. No choice principle is used; all bases below are finite bases of finite-dimensional spaces.
Let be the isomorphism in [F3], applicable because is finite-dimensional and therefore has a finite basis by [F6]. Define and . For and , evaluation through gives . The tensor-product pairing on three finite-dimensional factors, obtained by applying [F3] twice and reassociating, separates elements of .
For arbitrary coalgebra , define convolution by [F5]. It is bilinear because is linear and tensor evaluation is bilinear. For and , the values and are evaluations of on and ; coassociativity in [F2] makes them equal. The two counit equations give . Hence is a unital associative algebra, without a finite-dimensionality hypothesis on .
Let be a coalgebra map. For and , . Also . Therefore is a unital algebra map.
For finite-dimensional coalgebra , [F6] gives a finite basis of ; define by . A finite basis of and its dual show is a vector-space isomorphism. For , evaluating against gives . The same evaluation of has that value; finite tensor duality [F3] therefore gives equality of the coproducts. Also . Hence is a coalgebra isomorphism.
For , evaluation of on is , while evaluation of is . These are equal by associativity in [F1]; separation from 1.1 gives coassociativity. Similarly, evaluation of at is and evaluation of at is . Thus both counit identities hold, so is a coalgebra.
Let be a unital algebra map between finite-dimensional algebras, so [F6] supplies finite bases for both. Its transpose preserves counits since . For , evaluation of at is . Writing , evaluation of at is by the defining transpose formula in 1.1. Since is finite-dimensional, [F3] separates the tensors, so is a coalgebra map.
For finite-dimensional , [F6] supplies a finite basis; define by . If is a basis and its dual basis, then is the dual basis to ; hence is a vector-space isomorphism. For , convolution in and the defining equation for give . The unit of is the counit of , and its value on is . Thus is an algebra isomorphism.
For composable maps and , precomposition gives , so the transposes in steps 2.3 and 1.3 define contravariant functors. The evaluation maps are natural: for a linear map , . Steps 2.4 and 2.1 show these natural maps are structure-preserving isomorphisms on the finite subcategories, so the two dual functors are inverse equivalences there. The hypothesis concerns the whole algebra or coalgebra object; a finite-dimensional comodule over an infinite-dimensional coalgebra does not make that coalgebra finite-dimensional.
Steps 1.1 and 2.2 make a coalgebra when is finite; step 1.2 makes an algebra for every coalgebra; steps 2.3 and 1.3 prove reversal on algebra and coalgebra maps; steps 2.4, 2.1, and 3.1 prove the finite bidual equivalence and its scope.
Remarks
The convention is the evaluation pairing on . The finite tensor-duality supplier states that convention explicitly. Sources that identify the dual of a tensor product with the reversed tensor factors require a switch; no such switch is implicit here.
Depends on
- Coalgebra and coalgebra map over a field
- Algebras over a commutative ring, central structure maps, and algebra homomorphisms
- Scalars, tensor powers, the empty tensor, opposite algebras and finite sums
- Finite tensor duality and basis-independent coevaluation
- Module homomorphisms induce tensor-product homomorphisms functorially
- Linear functionals and the algebraic dual $V^*=\mathcal L(V,F)$
- The dual convolution algebra and rational modules
- Finite-dimensional vector space, and its dimension $\dim_F V$; infinite-dimensional means having no finite basis
- Linear map between vector spaces over the same field
Used by
Dependency tree · two levels
40 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
- Daniel Kongsgaard and UCSD Math 207A, Hopf Algebras Lecture Notes, Spring 2020 (standard reference, not scraped)
- Andrew Baker, Hopf algebras over fields: an introduction, SMSTC supplementary course notes 2026–7 (standard reference, not scraped)