Repository logo

Infoscience

  • English
  • French
Log In
Logo EPFL, École polytechnique fédérale de Lausanne

Infoscience

  • English
  • French
Log In
  1. Home
  2. Academic and Research Output
  3. EPFL thesis
  4. Towards an (∞,2)-category of homotopy coherent monads in an ∞-cosmos
 
doctoral thesis

Towards an (∞,2)-category of homotopy coherent monads in an ∞-cosmos

Zaganidis, Dimitri  
2017

This thesis is part of a program initiated by Riehl and Verity to study the category theory of (infinity,1)-categories in a model-independent way. They showed that most models of (infinity,1)-categories form an infinity-cosmos K, which is essentially a category enriched in quasi-categories with some additional structure reminiscent of a category of fibrant objects. Riehl and Verity showed that it is possible to formulate the category theory of (infinity,1)-categories directly with infinity-cosmos axioms. This should also help organize the category theory of (infinity,1)-categories with structure. Given a category K enriched in quasi-categories, we build via a nerve construction a stratified simplicial set N_Mnd(K) whose objects are homotopy coherent monads in K. If two infinity-cosmoi are weakly equivalent, their respective stratified simplicial sets of homotopy coherent monads are also equivalent. We also provide an (infinity,2)-category Adj_r(K) whose objects are homotopy coherent adjunctions in K, that we use to classify the 1-simplices of N_Mnd(K) up to homotopy.

  • Files
  • Details
  • Metrics
Loading...
Thumbnail Image
Name

EPFL_TH7748.pdf

Access type

openaccess

Size

3.78 MB

Format

Adobe PDF

Checksum (MD5)

cebc142f95c2c976d73f5e348a2eeb88

Logo EPFL, École polytechnique fédérale de Lausanne
  • Contact
  • infoscience@epfl.ch

  • Follow us on Facebook
  • Follow us on Instagram
  • Follow us on LinkedIn
  • Follow us on X
  • Follow us on Youtube
AccessibilityLegal noticePrivacy policyCookie settingsEnd User AgreementGet helpFeedback

Infoscience is a service managed and provided by the Library and IT Services of EPFL. © EPFL, tous droits réservés