Just as a bimonoid is both a monoid and a comonoid in a compatible way, a ‘biring’ is both a commutative ring and a commutative coring in a compatible way.
A biring is a commutative ring $R$ equipped with ring homomorphisms called coaddition:
cozero:
co-additive inverse:
comultiplication:
and the multiplicative counit:
satisfying the usual axioms of a commutative ring, but ‘turned around’.
More tersely, and also more precisely, a biring is a commutative ring object in the opposite of the category of commutative rings (also known as the category of affine schemes).
Equivalently, a biring is a commutative ring $R$ equipped with a lift of the functor
to a functor
Birings form a monoidal category thanks to the fact that functors of this form are closed under composition. A monoid object in this monoidal category is called a plethory. A plethory is an example of a Tall–Wraith monoid.
The most important example of a biring is $\Lambda$, the ring of symmetric polynomials. This is actually a plethory.
The biring $\Lambda$ is the Grothendieck group of the category of Schur functors, which is equivalent to the functor category
where $\mathbb{P}$ is the permutation groupoid and FinDimVect is the category of finite-dimensional vector spaces over a field $k$ of characteristic zero. $\Lambda$ is also the Grothendieck group of
where we drop the finite-dimensionality restriction on our vector spaces and work with all of Vect.
This suggests that the biring structure of $\Lambda$ may emerge naturally from a ‘categorified biring’ structure on $[\mathbb{P}, Vect ]$. In this section we sketch how such a categorified biring might be constructed, based on the assumption that there is a tensor product of cocomplete linear categories with good universal properties.
Namely, we assume that given cocomplete linear categories $X$ and $Y$, there is a cocomplete linear category $X \otimes Y$ such that:
There is a linear functor $i: X \times Y \to X \otimes Y$ which is cocontinuous in each argument.
For any cocomplete linear category $Z$, the category of linear functors $X \otimes Y \to Z$ is equivalent to the category of linear functors $X \times Y \to Z$ that are cocontinuous in each argument, with the equivalence being given by precomposition with $i$.
With any luck these two assumptions will let us show that for any categories $A$ and $B$,
where we use $[-,-]$ to denote the functor category.
Assuming all this, we obtain the following operations on the category $[\mathbb{P}, Vect]$:
Addition: form the composite functor
where the last arrow comes from postcomposition with
This composite is our addition:
It’s really just the coproduct in $[\mathbb{P}, Vect]$.
Multiplication: first form the composite functor
where the last arrow comes from postcomposition with
This composite is our multiplication:
Since this product preserves colimits in each argument, if we use the hoped-for universal property of the tensor product of cocomplete linear categories, we can reinterpret this as a cocontinuous functor
Coaddition: Form the composite functor
where the first arrow comes from precomposition with the addition operation on $\mathbb{P}$ (a restriction of coproduct in FinSet), and the second comes from our hoped-for relation (1). This is our coaddition:
Comultiplication: Form the composite functor
where the first arrow comes from precomposition with the multiplication operation on $\mathbb{P}$ (a restriction of product in FinSet), and the second comes from our hoped-for relation (1). This is our comultiplication:
The additive and multiplicative unit and counit may be similarly defined. Note that we are using rather little about $\mathbb{P}$ and $Vect$ here. For example, the category of ordinary non-linear species, $[\mathbb{P}, Set]$, should also become a categorified biring if there is a tensor product of cocomplete categories with properties analogous to those assumed for cocomplete $k$-linear categories above. But we could also replace $\mathbb{P}$ by any rig category. So, ‘biring categories’, or more precisely ‘birig categories’, should be fairly common.
Last revised on March 30, 2023 at 15:01:57. See the history of this page for a list of all contributions to it.