| advertise add site services publishers database health videos | ![]() | about toolbar stats live show health store more stuff JOIN/LOGIN |
In mathematics, it can be shown that every function can be written as the composite of a surjective function followed by an injective function. Factorization systems are a generalization of this situation in category theory.
[edit] DefinitionA factorization system (E, M) for a category C consists of two classes of morphisms E and M of C such that:
[edit] OrthogonalityTwo morphisms e and m are said to be orthogonal, what we write commutes. This notion can be extended to define the orthogonals of sets of morphisms by
Since in a factorization system
[edit] Equivalent definitionThe pair (E,M) of classes of morphisms of C is a factorization system if and only if it satisfies the following conditions:
[edit] Weak factorization systemsSuppose e and m are two morphisms in a category C. Then e has the left lifting property with respect to m (resp. m has the right lifting property with respect to e) when for every pair of morphisms u and v such that ve = mu there is a (not necessarily unique!) morphism w such that the diagram commutes. A weak factorization system (E, M) for a category C consists of two classes of morphisms E and M of C such that :
[edit] References
|
| ↑ top of page ↑ | about thumbshots |