Monoidal internalization

Comonoid object

Let (𝖒, βŠ—,1,𝛼,πœ†,𝜌) be a monoidal category. A comonoid in 𝖒 is a monoid in the opposite category 𝖒𝐨𝐩, #m/def/cat consisting of of the data

1πœ–β†π‘€Ξ”βŸΆπ‘€βŠ—π‘€

where πœ– is called the coΓΌnit and Ξ” is called the comultiplication, and these satisfy the left/right coΓΌnit laws

c

and the coΓ€ssociative law.

c

The category of comonoid objects is π–’π—ˆπ—†π—ˆπ—‡π–’, which is simply the opposite category of π–¬π—ˆπ—‡π–’π¨π©.

Cocommutative cocomonoid

If 𝖒 is symmetric, a comonoid satisfying the cocommutative law

c

is called cocommutative.

Higher comultiplications

Note that by coΓ€ssociativity, we can unambiguously define

Δ𝑛:π‘€β†’π‘€βŠ—(𝑛+1)

Examples

See also


#state/develop | #lang/en | #SemBr