To install click the Add extension button. That's it.

The source code for the WIKI 2 extension is being checked by specialists of the Mozilla Foundation, Google, and Apple. You could also do it yourself at any point in time.

4,5
Kelly Slayton
Congratulations on this excellent venture… what a great idea!
Alexander Grigorievskiy
I use WIKI 2 every day and almost forgot how the original Wikipedia looks like.
Live Statistics
English Articles
Improved in 24 Hours
Languages
Recent
Show all languages
What we do. Every page goes through several hundred of perfecting techniques; in live mode. Quite the same Wikipedia. Just better.
.
Leo
Newton
Brights
Milds

# Complete category

In mathematics, a complete category is a category in which all small limits exist. That is, a category C is complete if every diagram F : JC (where J is small) has a limit in C. Dually, a cocomplete category is one in which all small colimits exist. A bicomplete category is a category which is both complete and cocomplete.

The existence of all limits (even when J is a proper class) is too strong to be practically relevant. Any category with this property is necessarily a thin category: for any two objects there can be at most one morphism from one object to the other.

A weaker form of completeness is that of finite completeness. A category is finitely complete if all finite limits exists (i.e. limits of diagrams indexed by a finite category J). Dually, a category is finitely cocomplete if all finite colimits exist.

• 1/3
Views:
2 313 476
149 408
38 527
• The Map of Mathematics
• Computer Science ∩ Mathematics (Type Theory) - Computerphile
• ACT Math Prep Review, Practice Problems, Tips and Strategies, Concepts, Formulas, Youtube Video

## Theorems

It follows from the existence theorem for limits that a category is complete if and only if it has equalizers (of all pairs of morphisms) and all (small) products. Since equalizers may be constructed from pullbacks and binary products (consider the pullback of (f, g) along the diagonal Δ), a category is complete if and only if it has pullbacks and products.

Dually, a category is cocomplete if and only if it has coequalizers and all (small) coproducts, or, equivalently, pushouts and coproducts.

Finite completeness can be characterized in several ways. For a category C, the following are all equivalent:

• C is finitely complete,
• C has equalizers and all finite products,
• C has equalizers, binary products, and a terminal object,
• C has pullbacks and a terminal object.

The dual statements are also equivalent.

A small category C is complete if and only if it is cocomplete.[1] A small complete category is necessarily thin.

A posetal category vacuously has all equalizers and coequalizers, whence it is (finitely) complete if and only if it has all (finite) products, and dually for cocompleteness. Without the finiteness restriction a posetal category with all products is automatically cocomplete, and dually, by a theorem about complete lattices.

## References

1. ^ Abstract and Concrete Categories, Jiří Adámek, Horst Herrlich, and George E. Strecker, theorem 12.7, page 213
2. ^ Riehl, Emily (2014). Categorical Homotopy Theory. New York: Cambridge University Press. p. 32. ISBN 9781139960083. OCLC 881162803.