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 be a coalgebra over a field . The assignment identifies right -comodules and their maps with rational left -modules and their maps. The finite-tensor representative defining the coaction of a rational module is unique. If is finite-dimensional, every left -module is rational and the full correspondence is choice-free. The forward comodule-to-module construction is choice-free for every .
Facts & Assumptions
Given: A field , a coalgebra with comultiplication and counit , a right comodule , and left modules over the candidate convolution product on .
A coalgebra has a coassociative comultiplication and a two-sided counit ; its maps preserve both structure maps. (Coalgebra and coalgebra map over a field)
A right comodule has with and . (Right comodules, comodule maps, and subcomodules)
, , the candidate unit is , and rationality means that for each some satisfies for every . (The dual convolution algebra and rational modules)
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)
Under AC, every linear subspace of has a complement with . (Every linear subspace of a vector space has a complement: a linear subspace with )
A subspace spanned by a finite list has a finite basis without choice, and finite-dimensional means having a finite basis. (Linear combination of a finite list, and the span as the smallest linear subspace containing , A finite spanning list contains a basis, without choice, Finite-dimensional vector space, and its dimension ; infinite-dimensional means having no finite basis)
A left module action is bilinear, associative, and unital; here its laws are and . (Unital left and right modules over a ring; unqualified module means left module, Algebras over a commutative ring, central structure maps, and algebra homomorphisms)
The full algebraic dual consists of all linear functionals; no topology or continuity restriction is imposed. (Linear functionals and the algebraic dual )
Every vector has a unique coordinate list in a finite ordered basis. Its coordinate functions are linear: the coordinate list of is obtained by taking the same linear combination of the coordinate lists of and , and uniqueness identifies those coordinates. (A finite list is an ordered basis if and only if every equals for exactly one ; those scalars are the coordinates of in that ordered basis)
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.
For , the map is a linear functional, and the formula is -bilinear in and , so it defines a -bilinear convolution product. For and , the values and are evaluations of on and , respectively; these tensors agree by [F1], so convolution is associative. The two counit equations in [F1] give for every , so is a two-sided unit. Thus is a unital ring homomorphism and is central, since . This gives the existing -vector-space structure on as a -algebra.
Given a right comodule , the map , , is bilinear. Writing , coassociativity gives . The counit equation gives . Hence this is a left -module.
For every , the existing tensor represents the entire orbit because for every . This proves rationality without AC. To establish the separation used below, first assume [A1] and let be any vector space and . Write as a finite tensor by [F4], and put . By [F6], choose a finite ordered basis of and re-expand . By [F5], choose a complement with . For each , let be the th coordinate function in the basis , which is linear by [F9], and define for and . The unique direct-sum decomposition makes a linear functional on , so by [F8], and . Thus if every annihilates , every and . If is finite-dimensional, [F6] gives a finite ordered basis of ; re-expanding and evaluating against its coordinate functionals recovers each , so the same separation conclusion holds without [A1]. In either branch, if both represent the orbit of , then every annihilates , and the applicable separation argument gives .
Suppose now is finite-dimensional, without using AC. By [F6] let be a finite ordered basis, with coordinate functionals from [F9]. For any , the functionals and agree on every basis vector and hence on all of . For a left -module vector , put . Then , so every module vector is rational. Any tensor in can be re-expanded as , and evaluating against recovers ; therefore the representing tensor is unique. This finite-coordinate argument uses no basis extension or arbitrary choice.
Now let be a rational left -module. For each , existence in [F3] and separation in step 1.3 make its representing tensor unique in the applicable branch; define to be that unique tensor. Unique existence defines this function without an additional choice. For and , the tensors and have the same evaluation under every because the action is bilinear; the same holds for and . The separation proved in step 1.3 gives and , so is linear.
Evaluation at the unit functional gives by the module unit law. Thus is counital.
Fix and write . Set . For any , evaluation of the first term by is , while evaluation of the second term is . The module associativity law makes these equal. Hence every such pairing annihilates . For fixed , the tensor is annihilated by every , so it is zero by the separation in step 1.3. Since this holds for every , a second application of that separation result to the last factor gives . Thus is coassociative.
If is a comodule map, then for every , so is a module map. Conversely, let be a -module map. It is -linear because , using the -bilinear module action and the unit law. Then for every . The difference is a finite tensor in , so the separation in step 1.3 makes it zero. Hence is a comodule map.
In the finite-dimensional case, re-expanding the second factors of any finite tensor in a basis gives , and evaluation against recovers each . For a tensor in , re-expand both factors to obtain ; evaluations against and 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 is finite-dimensional. Together with step 1.4, this proves the full object and morphism correspondence in that branch without AC.
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 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 , AC is used only for separation by all functionals; the finite-dimensional- branch is choice-free.
Depends on
- The dual convolution algebra and rational modules
- Right comodules, comodule maps, and subcomodules
- Scalars, tensor powers, the empty tensor, opposite algebras and finite sums
- Associator naturality, pentagon, unit triangle and symmetry hexagons on elementary tensors
- Unital left and right modules over a ring; unqualified module means left module
- Every linear subspace $U$ of a vector space $V$ has a complement: a linear subspace $W$ with $V = U \oplus W$
- A finite spanning list contains a basis, without choice
- The Axiom of Choice
- Linear functionals and the algebraic dual $V^*=\mathcal L(V,F)$
- Algebras over a commutative ring, central structure maps, and algebra homomorphisms
- Finite-dimensional vector space, and its dimension $\dim_F V$; infinite-dimensional means having no finite basis
- Linear combination of a finite list, and the span $\operatorname{span}(S)$ as the smallest linear subspace containing $S$
- Linear map between vector spaces over the same field
- Module homomorphisms induce tensor-product homomorphisms functorially
- A finite list $v : n \to V$ is an ordered basis if and only if every $x \in V$ equals $\sum_{i<n} \lambda_i v_i$ for exactly one $\lambda : n \to F$; those scalars are the coordinates of $x$ in that ordered basis
- Coalgebra and coalgebra map over a field
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
- Daniel Kongsgaard and UCSD Math 207A, Hopf Algebras Lecture Notes, Spring 2020 (standard reference, not scraped)
- William Chin, A Brief Introduction to Coalgebra Representation Theory (standard reference, not scraped)