Misplaced Pages

Distributive category

Article snapshot taken from[REDACTED] with creative commons attribution-sharealike license. Give it a read and then ask your questions in the chat. We can research this topic together.
This article may require cleanup to meet Misplaced Pages's quality standards. The specific problem is: there's more than one proposed notion under this name, see last ref in further reading. Please help improve this article if you can. (July 2014) (Learn how and when to remove this message)

In mathematics, a category is distributive if it has finite products and finite coproducts and such that for every choice of objects A , B , C {\displaystyle A,B,C} , the canonical map

[ i d A × ι 1 , i d A × ι 2 ] : A × B + A × C A × ( B + C ) {\displaystyle :A\!\times \!B\,+A\!\times \!C\to A\!\times \!(B+C)}

is an isomorphism, and for all objects A {\displaystyle A} , the canonical map 0 A × 0 {\displaystyle 0\to A\times 0} is an isomorphism (where 0 denotes the initial object). Equivalently, if for every object A {\displaystyle A} the endofunctor A × {\displaystyle A\times -} defined by B A × B {\displaystyle B\mapsto A\times B} preserves coproducts up to isomorphisms f {\displaystyle f} . It follows that f {\displaystyle f} and aforementioned canonical maps are equal for each choice of objects.

In particular, if the functor A × {\displaystyle A\times -} has a right adjoint (i.e., if the category is cartesian closed), it necessarily preserves all colimits, and thus any cartesian closed category with finite coproducts (i.e., any bicartesian closed category) is distributive.

Example

The category of sets is distributive. Let A, B, and C be sets. Then

A × ( B ⨿ C ) = { ( a , d ) a A  and  d B ⨿ C } { ( a , d ) a A  and  d B } ⨿ { ( a , d ) a A  and  d C } = ( A × B ) ⨿ ( A × C ) {\displaystyle {\begin{aligned}A\times (B\amalg C)&=\{(a,d)\mid a\in A{\text{ and }}d\in B\amalg C\}\\&\cong \{(a,d)\mid a\in A{\text{ and }}d\in B\}\amalg \{(a,d)\mid a\in A{\text{ and }}d\in C\}\\&=(A\times B)\amalg (A\times C)\end{aligned}}}

where ⨿ {\displaystyle \amalg } denotes the coproduct in Set, namely the disjoint union, and {\displaystyle \cong } denotes a bijection. In the case where A, B, and C are finite sets, this result reflects the distributive property: the above sets each have cardinality | A | ( | B | + | C | ) = | A | | B | + | A | | C | {\displaystyle |A|\cdot (|B|+|C|)=|A|\cdot |B|+|A|\cdot |C|} .

The categories Grp and Ab are not distributive, even though they have both products and coproducts.

An even simpler category that has both products and coproducts but is not distributive is the category of pointed sets.

References

  1. Taylor, Paul (1999). Practical Foundations of Mathematics. Cambridge University Press. p. 275.
  2. F. W. Lawvere; Stephen Hoel Schanuel (2009). Conceptual Mathematics: A First Introduction to Categories (2nd ed.). Cambridge University Press. pp. 296–298. ISBN 978-0-521-89485-2.

Further reading


Stub icon

This category theory-related article is a stub. You can help Misplaced Pages by expanding it.

Categories:
Distributive category Add topic