The category of comodules over a coalgebra #
This file bundles the right comodules defined in TauCeti.Algebra.Coalgebra.Comodule.Basic into a
category. For a fixed coalgebra C over a commutative semiring R, objects are
R-semimodules with a right C-coaction and morphisms are the comodule morphisms already
defined by Comodule.Hom.
The reductive-groups roadmap asks for the category of finite-dimensional comodules over a
Hopf algebra as the representation category of an affine group scheme. This file supplies the
underlying bundled category and its forgetful functor to SemimoduleCat; finiteness, tensor
products, duals, and the Hopf-algebra specialization can be added on top.
Main definitions #
TauCeti.ComoduleCat: bundled right comodules over a fixed coalgebra.TauCeti.ComoduleCat.of: build a bundled comodule from an unbundled one.TauCeti.ComoduleCat.ofHom: view an unbundled comodule morphism as a categorical morphism.forget₂ (ComoduleCat R C) (SemimoduleCat R): the forgetful functor to semimodules.
References #
This is the categorical packaging of the standard right-comodule definition, added for
Layer 1 of the Tau Ceti reductive-groups roadmap: "Comodules over a coalgebra/Hopf algebra".
The bundled-category API follows the pattern of Mathlib.Algebra.Category.CoalgCat.Basic and
Mathlib.LinearAlgebra.QuadraticForm.QuadraticModuleCat.
The category of right comodules over a fixed R-coalgebra C.
- isModule : Module R ↑self.toSemimoduleCat
- instComodule : Comodule R C ↑self.toSemimoduleCat
The right
C-comodule structure on the underlying module.
Instances For
Equations
- TauCeti.ComoduleCat.instCoeSortType R C = { coe := fun (M : TauCeti.ComoduleCat R C) => ↑M.toSemimoduleCat }
Equations
Equations
Build a bundled comodule from a type carrying the usual unbundled typeclasses.
Equations
- TauCeti.ComoduleCat.of R C M = { carrier := M, isAddCommMonoid := inst✝², isModule := inst✝¹, instComodule := inferInstance }
Instances For
The coaction on ComoduleCat.of is the original unbundled coaction.
Morphisms in ComoduleCat are morphisms of the underlying right comodules.
Equations
- TauCeti.ComoduleCat.Hom R C M N = TauCeti.Comodule.Hom R C ↑M.toSemimoduleCat ↑N.toSemimoduleCat
Instances For
Equations
- One or more equations did not get rendered due to their size.
The zero structure on categorical morphisms is the zero comodule morphism.
Addition of categorical morphisms is pointwise addition of comodule morphisms.
Equations
- One or more equations did not get rendered due to their size.
Categorical morphisms form an additive commutative monoid under pointwise operations.
Equations
- One or more equations did not get rendered due to their size.
Scalar multiplication of categorical morphisms is pointwise scalar multiplication of comodule morphisms.
Equations
- One or more equations did not get rendered due to their size.
Categorical morphisms form an R-module under pointwise operations.
Equations
- TauCeti.ComoduleCat.homModule R C M N = { toSMul := TauCeti.ComoduleCat.homSMul R C M N, mul_smul := ⋯, one_smul := ⋯, smul_zero := ⋯, smul_add := ⋯, add_smul := ⋯, zero_smul := ⋯ }
ComoduleCat is concrete, with concrete morphisms the bundled comodule morphisms.
Equations
- One or more equations did not get rendered due to their size.
Turn a morphism in ComoduleCat back into its underlying comodule morphism.
Equations
- TauCeti.ComoduleCat.hom R C f = f
Instances For
Typecheck an unbundled comodule morphism as a morphism in ComoduleCat.
Equations
- TauCeti.ComoduleCat.ofHom R C f = f
Instances For
Turning an unbundled comodule morphism into a categorical morphism and back is the identity.
Turning a categorical morphism into an unbundled comodule morphism and back is the identity.
The categorical identity is the bundled form of the identity comodule morphism.
Categorical composition is the bundled form of composition of comodule morphisms.
The bundled form of a comodule morphism applies as the original morphism.
The underlying linear map of a ComoduleCat morphism.
Equations
Instances For
Two morphisms of bundled comodules are equal when their underlying functions are equal.
The identity morphism has the identity linear map underneath.
Composition in ComoduleCat is composition of the underlying linear maps.
The identity morphism acts as the identity function.
Composition of morphisms acts by ordinary function composition.
The zero morphism has the zero linear map underneath.
Addition of morphisms is addition of the underlying linear maps.
Natural-number scalar multiplication of morphisms is natural-number scalar multiplication of the underlying linear maps.
Scalar multiplication of morphisms is scalar multiplication of the underlying linear maps.
Finite sums of morphisms are finite sums of the underlying linear maps.
The zero morphism acts as the zero function.
Addition of morphisms acts by pointwise addition.
Natural-number scalar multiplication of morphisms acts by pointwise natural-number scalar multiplication.
Scalar multiplication of morphisms acts by pointwise scalar multiplication.
Finite sums of morphisms act by pointwise finite sums.
Composition in ComoduleCat is additive in the left morphism.
Composition in ComoduleCat is additive in the right morphism.
Composition in ComoduleCat is compatible with scalar multiplication in the left
morphism.
Composition in ComoduleCat is compatible with scalar multiplication in the right
morphism.
Composing the zero morphism on the left gives the zero morphism.
Composing the zero morphism on the right gives the zero morphism.
ComoduleCat has the standard categorical zero morphisms.
Equations
- TauCeti.ComoduleCat.hasZeroMorphisms R C = { zero := inferInstance, comp_zero := ⋯, zero_comp := ⋯ }
The forgetful functor from comodules to their underlying semimodules.
Equations
- One or more equations did not get rendered due to their size.
The forgetful functor sends a comodule to its underlying semimodule.
The forgetful functor sends a comodule morphism to its underlying linear map.
A categorical isomorphism of comodules induces the underlying linear equivalence.
Equations
- TauCeti.ComoduleCat.isoToLinearEquiv R C i = ((CategoryTheory.forget₂ (TauCeti.ComoduleCat R C) (SemimoduleCat R)).mapIso i).toLinearEquivₛ
Instances For
The linear equivalence induced by a comodule isomorphism has the isomorphism's forward comodule morphism underneath.
The inverse of the linear equivalence induced by a comodule isomorphism has the isomorphism's inverse comodule morphism underneath.
The linear equivalence induced by a comodule isomorphism applies as its forward morphism.
The inverse linear equivalence induced by a comodule isomorphism applies as the inverse morphism.
The linear equivalence induced by the identity comodule isomorphism is the identity.
The linear equivalence induced by the inverse comodule isomorphism is the inverse linear equivalence.
The linear equivalence induced by a composite comodule isomorphism is the composite of the induced linear equivalences.
Build a comodule isomorphism from a linear equivalence whose forward map respects the coactions.
Equations
- One or more equations did not get rendered due to their size.
Instances For
The forward morphism of isoOfLinearEquiv has the original linear equivalence
underneath.
The inverse morphism of isoOfLinearEquiv has the inverse linear equivalence
underneath.
The forward morphism of isoOfLinearEquiv applies as the original linear equivalence.
The inverse morphism of isoOfLinearEquiv applies as the inverse linear equivalence.
Converting isoOfLinearEquiv back to a linear equivalence recovers the original linear
equivalence.
Rebuilding a comodule isomorphism from its induced linear equivalence recovers the original isomorphism.