Spahn factorization system (Rev #1)

Definition

Definition

Let CC be a category. A kk-ary factorization system in CC is defined to be a (ordered) list (L 1,R 1),,(L k1,R k1)(L_1,R_1),\dots,(L_{k-1},R_{k-1}) of (orthogonal) factorization systems such that R iR i+1R_i\supset R_{i+1} (or equivalently L i+1L iL_{i+1}\subseteq L_i).

This is equivalent: Every CC-morphism ff factors as f=f 1;f 2;;f kf=f_1;f_2;\dots;f_k with f iR iL i1f_i\in R_i\cap L_{i-1}

Reflective factorization system

Relation of reflective subcategories and reflective subfibrations

Cooperads

Modalities

References

  • Cassidy and Hébert and Kelly?, “Reflective subcategories, localizations, and factorization systems”. J. Austral. Math Soc. (Series A) 38 (1985), 287–329 (pdf)
  • Carboni and Janelidze? and Kelly? and Paré, “On localization and stabilization for factorization systems”, Appl. Categ. Structures 5 (1997), 1–58
  • Mike Shulman, internalizing the external - the joy of codiscreteness, blog

  • J. M. E. Hyland, 27.11.2012, Classical lambda calculus in modern dress, arXiv:1211.5762

  • UF-IAS-2012, Modal type theory, wiki

Revision on December 1, 2012 at 06:00:30 by Stephan Alexander Spahn?. See the history of this page for a list of all contributions to it.