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.

The finite dual is a coalgebra and descends through bialgebras and Hopf algebras

Statement

Let k be a field and A a unital associative k-algebra. The finite dual A∘ is a vector subspace of A∗, and mA∗(f) lies in A∘⊗A∘ for every f∈A∘. With Δ∘(f)=mA∗(f) and ε∘(f)=f(1A), it is a coalgebra.

Moreover, f∈A∘ exactly when f is a matrix coefficient of a finite-dimensional left A-module. If H is a bialgebra, H∘ is a bialgebra with convolution product, unit εH, coproduct mH∗, and counit f↦f(1H). If H is a Hopf algebra, H∘ is closed under SH∗(f)=f∘SH, and this map is an antipode on H∘. No finite-dimensionality or bijectivity of SH is assumed in the last two conclusions.

Facts & Assumptions

Given: A field k, a unital associative k-algebra A, and, in the final clauses, a bialgebra or Hopf algebra H over k.

[F1]

The finite dual of an associative algebra: A∘ consists of functionals vanishing on a finite-codimensional two-sided ideal, and mA∗(f)(a⊗b)=f(ab) is the candidate coproduct.

[F2]

Finite matrix and module preliminaries: right inverses, rank invariance, finite length and nilpotent trace: every subspace of a finite-dimensional vector space is finite-dimensional; this is the finite-dimensional fact used for intersections of cofinite ideals.

[F3]

Finite tensor duality and basis-independent coevaluation: for finite-dimensional V, W, the canonical map V∗⊗W∗→(V⊗W)∗ is an isomorphism.

[F4]

Bialgebras and bialgebra maps: ΔH and εH are unital algebra maps, and the tensor-product algebra has (a⊗b)(c⊗d)=ac⊗bd.

[F5]

Uniqueness and anti-multiplicativity and anti-comultiplicativity of the antipode: the antipode satisfies both convolution equations and is anti-multiplicative: SH(ab)=SH(b)SH(a).

[F7]

Counit uniqueness and finite Sweedler calculus: Sweedler notation records a finite tensor sum, and every contraction is a well-defined linear map on that tensor.

Proof

technique · direct
1.1givenF1F2algebra

If f∈A∘ vanishes on a finite-codimensional two-sided ideal I, and g∈A∘ vanishes on such an ideal J, then f,g and every linear combination vanish on I∩J. The map A/(I∩J)→A/I⊕A/J, a+(I∩J)↦(a+I,a+J), is injective, so its image is a subspace of a finite-dimensional vector space and is finite-dimensional by [F2]. Thus A∘ is a vector subspace.

1.2givenF1F3construct

Let q:A→A/I be the quotient map and write f=fˉq. Since A/I is finite-dimensional, [F3] identifies ((A/I)⊗(A/I))∗ with (A/I)∗⊗(A/I)∗; the transpose of multiplication on A/I therefore gives a finite tensor ∑ifˉi⊗gˉi with fˉ((a+I)(b+I))=∑ifˉi(a+I)gˉi(b+I). Pulling the factors back along q yields Δ∘(f)=∑i(fˉiq)⊗(gˉiq)∈A∘⊗A∘, and its evaluation on a⊗b is f(ab).

1.3givenF1algebra

If f(a)=ℓ(ρ(a)v) is a coefficient of a finite-dimensional representation ρ:A→End⁡k(V), then ker⁡ρ is a two-sided ideal of finite codimension and f(ker⁡ρ)=0, so f∈A∘. Conversely, if f vanishes on a finite-codimensional ideal I, the finite-dimensional quotient V=A/I is a left A-module by a⋅(b+I)=ab+I; the vector v=1+I and functional ℓ(b+I)=f(b) are well-defined and satisfy f(a)=ℓ(a⋅v). Thus the finite-dual functionals are exactly the finite-dimensional matrix coefficients.

2.1step 1.2algebra

The evaluation map A∗⊗A∗→(A⊗A)∗ is injective: write a finite tensor as ∑i=1rϕi⊗ψi with the ϕi linearly independent, by choosing a basis of the finite span of its first factors and rewriting. The map A→kr, a↦(ϕ1(a),…,ϕr(a)), is surjective, since a proper subspace of the finite-dimensional space kr has a nonzero annihilating linear functional, which would give a nontrivial dependence among the ϕi. Choose aj mapping to the j-th standard vector; if the tensor evaluates to zero on every a⊗b, then ψj(b)=0 for every b and every j, so the tensor is zero. Therefore the tensor characterized in step 1.2 is independent of the chosen ideal I.

2.2step 1.3F4F6F7algebra

For coefficients f(a)=ℓ(ρ(a)v) and g(a)=μ(σ(a)w) of finite-dimensional representations on V,W, define (ρ⊗σ)(a⊗b)=ρ(a)⊗σ(b). By [F6], this is well-defined; on pure tensors it preserves products because (ρ(aa′)⊗σ(bb′))=(ρ(a)ρ(a′)⊗σ(b)σ(b′))=(ρ(a)⊗σ(b))(ρ(a′)⊗σ(b′)), and it preserves the unit. Composing with the unital algebra map ΔH from [F4] gives a finite-dimensional unital representation. Its coefficient at ℓ⊗μ,v⊗w is ∑f(h1)g(h2)=(f∗g)(h), so convolution preserves H∘.

2.3step 1.3F5algebra

If f(a)=ℓ(ρ(a)v), define an action on V∗ by (h⋅λ)(v′)=λ(ρ(SH(h))v′). By [F5], SH(hh′)=SH(h′)SH(h), whence (h⋅(h′⋅λ))(v′)=λ(SH(h′)SH(h)v′)=((hh′)⋅λ)(v′), and the unit acts as the identity. The coefficient of this finite-dimensional representation at vector ℓ∈V∗ and functional ev⁡v(λ)=λ(v) is f(SH(h)). Therefore SH∗(f)∈H∘.

3.1step 1.2step 2.1algebra

For f∈A∘, evaluation of (Δ∘⊗id)Δ∘(f) and (id⊗Δ∘)Δ∘(f) on a⊗b⊗c gives f((ab)c) and f(a(bc)), equal by associativity. The evaluation map on three finite tensor factors is injective by repeating the finite-independent-family argument of step 2.1. Evaluating (ε∘⊗id)Δ∘(f) and (id⊗ε∘)Δ∘(f) at a gives f(1Aa)=f(a)=f(a1A), so these maps are the identity.

3.2givenstep 1.2step 2.1step 2.2F4F7algebra

The functional εH lies in H∘: its kernel is a two-sided ideal, and the induced map H/ker⁡εH→k is injective by definition of the kernel and surjective since εH(1H)=1. The two counit equations for H show that it is the left and right convolution unit on H∘. Convolution is associative on H∘: by step 2.2 its products stay in H∘, and because the bialgebra hypothesis gives a coassociative coproduct, for f,g,r∈H∘ and h∈H we have ((f∗g)∗r)(h)=∑(h)f(h1)g(h2)r(h3)=(f∗(g∗r))(h); the finite Sweedler contractions are well-defined by [F7]. The coproduct Δ∘(f) is a finite tensor by step 1.2. For f,g∈H∘ and a,b∈H, Δ∘(f∗g)(a⊗b)=(f∗g)(ab)=∑f(a1b1)g(a2b2)=(Δ∘(f)Δ∘(g))(a⊗b), because [F4] makes ΔH an algebra map. By the tensor-evaluation injectivity of step 2.1, this proves coproduct multiplicativity. Also Δ∘(εH)=εH⊗εH since εH(ab)=εH(a)εH(b), and the counit is multiplicative since (f∗g)(1H)=(f⊗g)(ΔH(1H))=f(1H)g(1H). Thus the convolution product is associative and unital, and all bialgebra identities hold.

4.1step 1.2F5F7algebra∎

Write Δ∘(f)=∑ifi⊗gi, so ∑ifi(a)gi(b)=f(ab). Then ∑i(SH∗fi∗gi)(h)=∑(h)f(SH(h1)h2)=εH(h)f(1H), and ∑i(fi∗SH∗gi)(h)=∑(h)f(h1SH(h2))=εH(h)f(1H). These are the two antipode equations for SH∗ in H∘, by [F5]. Thus the finite dual of every Hopf algebra is Hopf, without an inverse SH−1.

Depends on

Used by

Cited to discharge well-definedness by The finite dual of an associative algebra.

Dependency tree · two levels

64 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