Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedPipeline-generated
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 k-algebra A, the full dual A∗ is a coalgebra under the transpose of multiplication and unit. For every coalgebra C, the full dual C∗ 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 A→A∗∗ and C→C∗∗. The finite-dimensionality hypothesis in the algebra-to-coalgebra direction is on A itself, not merely on a module over A.

Facts & Assumptions

Given: A field k, a finite-dimensional unital associative k-algebra (A,mA,1A), a coalgebra (C,ΔC,εC), and algebra and coalgebra maps as named below.

[F1]

A unital associative k-algebra has associative multiplication mA and unit 1A; algebra maps preserve multiplication, unit, and k-scalars. (Algebras over a commutative ring, central structure maps, and algebra homomorphisms)

[F2]

A coalgebra has coassociative Δ and a two-sided counit ε; a coalgebra map preserves both structure maps. (Coalgebra and coalgebra map over a field)

[F3]

The full algebraic dual V∗ is the space of all linear functionals V→k, and for finite-dimensional V,W the pairing θV,W:V∗⊗W∗→(V⊗W)∗ sends f⊗g to [v⊗w↦f(v)g(w)] and is an isomorphism. (Linear functionals and the algebraic dual V∗=L(V,F), Finite tensor duality and basis-independent coevaluation)

[F4]

Tensor maps are determined on elementary tensors and preserve composition. (Module homomorphisms induce tensor-product homomorphisms functorially)

[F5]

The candidate convolution product on C∗ is (f∗g)(c)=(f⊗g)(ΔC(c)), with candidate unit εC. (The dual convolution algebra and rational modules)

[F6]

Proof

Given: The data above. No choice principle is used; all bases below are finite bases of finite-dimensional spaces.

1.1F1F3F6construct

Let θA,A:A∗⊗A∗→(A⊗A)∗ be the isomorphism in [F3], applicable because A is finite-dimensional and therefore has a finite basis by [F6]. Define ΔA∗:=θA,A−1∘mA∗ and εA∗(f):=f(1A). For f∈A∗ and a,b∈A, evaluation through θA,A gives θA,A(ΔA∗f)(a⊗b)=f(ab). The tensor-product pairing on three finite-dimensional factors, obtained by applying [F3] twice and reassociating, separates elements of A∗⊗A∗⊗A∗.

1.2F2F4F5algebra

For arbitrary coalgebra C, define convolution by [F5]. It is bilinear because ΔC is linear and tensor evaluation is bilinear. For f,g,h∈C∗ and c∈C, the values ((f∗g)∗h)(c) and (f∗(g∗h))(c) are evaluations of f⊗g⊗h on (ΔC⊗id⁡)ΔC(c) and (id⁡⊗ΔC)ΔC(c); coassociativity in [F2] makes them equal. The two counit equations give (εC∗f)(c)=f(c)=(f∗εC)(c). Hence C∗ is a unital associative algebra, without a finite-dimensionality hypothesis on C.

1.3F2F4F5algebra

Let ψ:C→D be a coalgebra map. For f,g∈D∗ and c∈C, ψ∗(f∗g)(c)=(f⊗g)(ΔD(ψ(c)))=(f⊗g)((ψ⊗ψ)ΔC(c))=((ψ∗f)∗(ψ∗g))(c). Also ψ∗(εD)=εDψ=εC. Therefore ψ∗:D∗→C∗ is a unital algebra map.

2.1F3F6step 1.2algebra

For finite-dimensional coalgebra C, [F6] gives a finite basis of C; define ηC:C→C∗∗ by ηC(c)(f)=f(c). A finite basis of C and its dual show ηC is a vector-space isomorphism. For f,g∈C∗, evaluating ΔC∗∗ηC(c) against f⊗g gives ηC(c)(f∗g)=(f∗g)(c)=(f⊗g)(ΔC(c)). The same evaluation of (ηC⊗ηC)ΔC(c) has that value; finite tensor duality [F3] therefore gives equality of the coproducts. Also εC∗∗(ηC(c))=ηC(c)(εC)=εC(c). Hence ηC is a coalgebra isomorphism.

2.2F1F3F6step 1.1algebra

For a,b,c∈A, evaluation of (ΔA∗⊗id⁡)ΔA∗(f) on a⊗b⊗c is f((ab)c), while evaluation of (id⁡⊗ΔA∗)ΔA∗(f) is f(a(bc)). These are equal by associativity in [F1]; separation from 1.1 gives coassociativity. Similarly, evaluation of (εA∗⊗id⁡)ΔA∗(f) at a is f(1Aa)=f(a) and evaluation of (id⁡⊗εA∗)ΔA∗(f) at a is f(a1A)=f(a). Thus both counit identities hold, so A∗ is a coalgebra.

2.3F1F3F6step 1.1algebra

Let ϕ:A→B be a unital algebra map between finite-dimensional algebras, so [F6] supplies finite bases for both. Its transpose ϕ∗:B∗→A∗ preserves counits since εA∗(ϕ∗f)=f(ϕ(1A))=f(1B)=εB∗(f). For a,a′∈A, evaluation of ΔA∗(ϕ∗f) at a⊗a′ is f(ϕ(aa′))=f(ϕ(a)ϕ(a′)). Writing ΔB∗(f)=∑rfr⊗gr, evaluation of (ϕ∗⊗ϕ∗)ΔB∗(f) at a⊗a′ is ∑rfr(ϕ(a))gr(ϕ(a′))=ΔB∗(f)(ϕ(a)⊗ϕ(a′))=f(ϕ(a)ϕ(a′)) by the defining transpose formula in 1.1. Since A is finite-dimensional, [F3] separates the tensors, so ϕ∗ is a coalgebra map.

2.4F1F3F5F6step 1.1algebra

For finite-dimensional A, [F6] supplies a finite basis; define ηA:A→A∗∗ by ηA(a)(f)=f(a). If a1,…,an is a basis and a1∗,…,an∗ its dual basis, then ηA(ai) is the dual basis to ai∗; hence ηA is a vector-space isomorphism. For f∈A∗, convolution in A∗∗ and the defining equation for ΔA∗ give (ηA(a)∗ηA(b))(f)=∑ηA(a)(f1)ηA(b)(f2)=ΔA∗(f)(a⊗b)=f(ab)=ηA(ab)(f). The unit of A∗∗ is the counit of A∗, and its value on f is f(1A)=ηA(1A)(f). Thus ηA is an algebra isomorphism.

3.1step 2.3step 1.3step 2.4step 2.1algebra

For composable maps u:V→W and v:W→X, precomposition gives (v∘u)∗=u∗∘v∗, so the transposes in steps 2.3 and 1.3 define contravariant functors. The evaluation maps are natural: for a linear map u:V→W, u∗∗(ηV(v))(f)=ηV(v)(f∘u)=f(u(v))=ηW(u(v))(f). 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.

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

Steps 1.1 and 2.2 make A∗ a coalgebra when A is finite; step 1.2 makes C∗ 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 f(a)g(b) on a⊗b. 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

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