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.

Right comodules are rational modules over the dual algebra

Statement

Assume AC and let C be a coalgebra over a field k. The assignment (M,ρ)⟼(M, f⋅m:=(id⁡M⊗f)ρ(m)) identifies right C-comodules and their maps with rational left C∗=Hom⁡k(C,k)-modules and their maps. The finite-tensor representative defining the coaction of a rational module is unique. If C is finite-dimensional, every left C∗-module is rational and the full correspondence is choice-free. The forward comodule-to-module construction is choice-free for every C.

Facts & Assumptions

Given: A field k, a coalgebra C with comultiplication Δ and counit ε, a right comodule (M,ρ), and left modules over the candidate convolution product on C∗.

[F1]

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

[F2]

A right comodule has ρ:M→M⊗C with (ρ⊗id⁡)ρ=(id⁡⊗Δ)ρ and (id⁡⊗ε)ρ=id⁡. (Right comodules, comodule maps, and subcomodules)

[F3]

C∗=Hom⁡k(C,k), (f∗g)(c)=(f⊗g)(Δ(c)), the candidate unit is ε, and rationality means that for each m some tm∈M⊗C satisfies f⋅m=(id⁡⊗f)tm for every f. (The dual convolution algebra and rational modules)

[F4]

Every tensor is a finite sum of elementary tensors, and the associator identifies the two parenthesizations of a triple tensor. (Scalars, tensor powers, the empty tensor, opposite algebras and finite sums, Associator naturality, pentagon, unit triangle and symmetry hexagons on elementary tensors)

[F5]

Under AC, every linear subspace D of C has a complement E with C=D⊕E. (Every linear subspace U of a vector space V has a complement: a linear subspace W with V=U⊕W)

[F7]

A left module action is bilinear, associative, and unital; here its laws are f⋅(g⋅m)=(f∗g)⋅m and ε⋅m=m. (Unital left and right modules over a ring; unqualified module means left module, Algebras over a commutative ring, central structure maps, and algebra homomorphisms)

[F8]

The full algebraic dual consists of all linear functionals; no topology or continuity restriction is imposed. (Linear functionals and the algebraic dual V∗=L(V,F))

[F9]

Every vector has a unique coordinate list in a finite ordered basis. Its coordinate functions are linear: the coordinate list of ax+by is obtained by taking the same linear combination of the coordinate lists of x and y, and uniqueness identifies those coordinates. (A finite list v:n→V is an ordered basis if and only if every x∈V equals ∑i<nλivi for exactly one λ:n→F; those scalars are the coordinates of x in that ordered basis)

[A1]

AC holds for the arbitrary-dimensional branch. (The Axiom of Choice)

Proof

Given: The data above. Use finite tensor expansions only; all Sweedler sums below mean the finite expansion of the indicated coaction or coproduct followed by the specified linear maps.

1.1F1F3F4algebra

For f,g∈C∗, the map c↦(f⊗g)(Δ(c)) is a linear functional, and the formula is k-bilinear in f and g, so it defines a k-bilinear convolution product. 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 (Δ⊗id⁡)Δ(c) and (id⁡⊗Δ)Δ(c), respectively; these tensors agree by [F1], so convolution is associative. The two counit equations in [F1] give (ε∗f)(c)=f(c)=(f∗ε)(c) for every c, so ε is a two-sided unit. Thus a↦aε is a unital ring homomorphism k→C∗ and is central, since (aε)∗f=a(ε∗f)=af=f∗(aε). This gives the existing k-vector-space structure on C∗ as a k-algebra.

1.2F1F2F3F4F7algebra

Given a right comodule (M,ρ), the map C∗×M→M, (f,m)↦(id⁡⊗f)ρ(m), is bilinear. Writing ρ(m)=∑m0⊗m1, coassociativity gives f⋅(g⋅m)=∑m0f(m1,1)g(m1,2)=∑m0(f∗g)(m1)=(f∗g)⋅m. The counit equation gives ε⋅m=∑m0ε(m1)=m. Hence this is a left C∗-module.

1.3F2F3F4F5F6F8F9A1algebra

For every m, the existing tensor ρ(m)∈M⊗C represents the entire orbit because (id⁡⊗f)ρ(m)=f⋅m for every f. This proves rationality without AC. To establish the separation used below, first assume [A1] and let X be any vector space and T∈X⊗C. Write T=∑sxs⊗ds as a finite tensor by [F4], and put D=span⁡{ds}. By [F6], choose a finite ordered basis c1,…,cq of D and re-expand T=∑iyi⊗ci. By [F5], choose a complement E with C=D⊕E. For each i, let λi:D→k be the ith coordinate function in the basis c1,…,cq, which is linear by [F9], and define fi(d+e)=λi(d) for d∈D and e∈E. The unique direct-sum decomposition makes fi a linear functional on C, so fi∈C∗ by [F8], and (id⁡X⊗fi)(T)=yi. Thus if every f∈C∗ annihilates T, every yi=0 and T=0. If C is finite-dimensional, [F6] gives a finite ordered basis c1,…,cn of C; re-expanding T=∑iyi⊗ci and evaluating against its coordinate functionals recovers each yi, so the same separation conclusion holds without [A1]. In either branch, if t,t′∈M⊗C both represent the orbit of m, then every f∈C∗ annihilates t−t′, and the applicable separation argument gives t=t′.

1.4F3F4F6F7F9algebra

Suppose now C is finite-dimensional, without using AC. By [F6] let c1,…,cn be a finite ordered basis, with coordinate functionals c1∗,…,cn∗ from [F9]. For any f∈C∗, the functionals f and ∑if(ci)ci∗ agree on every basis vector and hence on all of C. For a left C∗-module vector m, put tm=∑i=1n(ci∗⋅m)⊗ci. Then (id⁡⊗f)tm=∑if(ci)(ci∗⋅m)=f⋅m, so every module vector is rational. Any tensor in M⊗C can be re-expanded as ∑iyi⊗ci, and evaluating against cj∗ recovers yj; therefore the representing tensor is unique. This finite-coordinate argument uses no basis extension or arbitrary choice.

2.1F3F7step 1.3algebra

Now let M be a rational left C∗-module. For each m, existence in [F3] and separation in step 1.3 make its representing tensor unique in the applicable branch; define ρ(m) to be that unique tensor. Unique existence defines this function without an additional choice. For m,n and a∈k, the tensors ρ(m+n) and ρ(m)+ρ(n) have the same evaluation under every f∈C∗ because the action is bilinear; the same holds for ρ(am) and aρ(m). The separation proved in step 1.3 gives ρ(m+n)=ρ(m)+ρ(n) and ρ(am)=aρ(m), so ρ is linear.

3.1F1F3F7step 2.1algebra

Evaluation at the unit functional ε gives (id⁡⊗ε)ρ(m)=ε⋅m=m by the module unit law. Thus ρ is counital.

3.2F1F3F4F7step 1.3step 2.1algebra

Fix m and write ρ(m)=∑imi⊗ci. Set T=(ρ⊗id⁡)ρ(m)−(id⁡⊗Δ)ρ(m)∈M⊗C⊗C. For any f,g∈C∗, evaluation of the first term by id⁡M⊗f⊗g is ∑ig(ci)(f⋅mi)=f⋅(g⋅m), while evaluation of the second term is ∑i(f∗g)(ci)mi=(f∗g)⋅m. The module associativity law makes these equal. Hence every such pairing annihilates T. For fixed g, the tensor (id⁡M⊗C⊗g)(T)∈M⊗C is annihilated by every id⁡M⊗f, so it is zero by the separation in step 1.3. Since this holds for every g, a second application of that separation result to the last C factor gives T=0. Thus ρ is coassociative.

3.3F2F4F7step 1.2step 1.3step 2.1algebra

If u:M→N is a comodule map, then f⋅u(m)=(id⁡N⊗f)ρN(u(m))=(id⁡N⊗f)(u⊗id⁡)ρM(m)=u(f⋅m) for every f,m, so u is a module map. Conversely, let u be a C∗-module map. It is k-linear because u(am)=u((aε)⋅m)=(aε)⋅u(m)=au(m), using the k-bilinear module action and the unit law. Then (id⁡N⊗f)(ρN(u(m))−(u⊗id⁡)ρM(m))=f⋅u(m)−u(f⋅m)=0 for every f. The difference is a finite tensor in N⊗C, so the separation in step 1.3 makes it zero. Hence u is a comodule map.

4.1F4F6F8F9step 1.3step 2.1step 3.2step 3.3step 1.4algebra

In the finite-dimensional case, re-expanding the second factors of any finite tensor in a basis c1,…,cn gives ∑ixi⊗ci, and evaluation against ci∗ recovers each xi. For a tensor in X⊗C⊗C, re-expand both C factors to obtain ∑i,jxij⊗ci⊗cj; evaluations against ci∗ and cj∗ recover every coefficient. These finite-coordinate arguments are exactly the choice-free separation branch established in step 1.3, so the separation uses in steps 2.1, 3.2, and 3.3 need no AC when C is finite-dimensional. Together with step 1.4, this proves the full object and morphism correspondence in that branch without AC.

5.1step 1.1step 1.2step 1.3step 2.1step 3.1step 3.2step 3.3step 1.4step 4.1∎

Steps 1.1–1.3 construct a rational module from every right comodule and recover its unique original coaction; steps 2.1, 3.1, and 3.2 construct a right coaction from every rational module; step 3.3 proves the correspondence on maps. Steps 1.4 and 4.1 prove the full correspondence without AC when C is finite-dimensional.

Remarks

The source treatments state this correspondence but leave part of the converse or morphism verification as an exercise or sketch. The proof above supplies the finite-tensor uniqueness, both coaction axioms, and both directions for maps. For arbitrary C, AC is used only for separation by all functionals; the finite-dimensional-C branch is choice-free.

Depends on

Used by

Nothing in the library uses this result yet.

Cited to discharge well-definedness by The dual convolution algebra and rational modules.

Dependency tree · two levels

59 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