Alphabeta Math
DefinitionDefinition: Literature-sourcedProof: Not applicablePipeline-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 dual convolution algebra and rational modules

Definition

For a coalgebra C over k, write C∗:=Hom⁡k(C,k) for its full algebraic dual, using Linear functionals and the algebraic dual V∗=L(V,F). Define the convolution candidate product by (f∗g)(c):=(f⊗g)(Δ(c)) for f,g∈C∗ and c∈C, and take ε as its candidate unit. Thus, when Δ(c)=∑ici⊗di, (f∗g)(c)=∑if(ci)g(di). Every such sum is finite because tensors are algebraic tensors under Scalars, tensor powers, the empty tensor, opposite algebras and finite sums.

The theorem Right comodules are rational modules over the dual algebra ↗ proves that this product is associative and unital, so it makes C∗ a k-algebra. A left C∗-module here is a k-vector space M with a k-bilinear action C∗×M→M satisfying f⋅(g⋅m)=(f∗g)⋅m and ε⋅m=m. This is the usual unital module convention of Unital left and right modules over a ring; unqualified module means left module for the resulting k-algebra.

Such a module is rational if for every m∈M there exists a finite tensor tm∈M⊗C such that f⋅m=(id⁡M⊗f)(tm)for every f∈C∗. This definition asserts existence only. The theorem proves uniqueness of tm under its stated choice hypothesis before naming it as a coaction value.

The convolution formula uses the order f on the first tensor factor and g on the second. Sources that identify (C⊗C)∗ with C∗⊗C∗ using the reversed tensor-factor convention require the corresponding switch; the formula above fixes the convention used throughout this page.

Remarks

The draft supplier Coalgebra and coalgebra map over a field is present in batch 1 and states the coassociative comultiplication and two-sided counit used here. This definition introduces the convolution candidate only; Right comodules are rational modules over the dual algebra ↗ proves that it is associative and unital.

Depends on

Used by

Dependency tree · two levels

21 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