Distributive category

Summary

In mathematics, a category is distributive if it has finite products and finite coproducts and such that for every choice of objects , the canonical map

is an isomorphism, and for all objects , the canonical map is an isomorphism (where 0 denotes the initial object). Equivalently, if for every object the endofunctor defined by preserves coproducts up to isomorphisms .[1] It follows that and aforementioned canonical maps are equal for each choice of objects.

In particular, if the functor 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.

ExampleEdit

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

 

where   denotes the coproduct in Set, namely the disjoint union, and   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  .

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.[2]

ReferencesEdit

  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 readingEdit

  • Cockett, J. R. B. (1993). "Introduction to distributive categories". Mathematical Structures in Computer Science. 3 (3): 277–307. doi:10.1017/S0960129500000232.
  • Carboni, Aurelio (1993). "Introduction to extensive and distributive categories". Journal of Pure and Applied Algebra. 84 (2): 145–158. doi:10.1016/0022-4049(93)90035-R.