{"@context":"https:\/\/schema.org\/","@type":"ScholarlyArticle","@id":"#article10110","name":"Displayed Categories","abstract":"We introduce and develop the notion of displayed categories.\r\n\r\nA displayed category over a category C is equivalent to \"a category D and functor F : D -> C\", but instead of having a single collection of \"objects of D\" with a map to the objects of C, the objects are given as a family indexed by objects of C, and similarly for the morphisms. This encapsulates a common way of building categories in practice, by starting with an existing category and adding extra data\/properties to the objects and morphisms.\r\n\r\nThe interest of this seemingly trivial reformulation is that various properties of functors are more naturally defined as properties of the corresponding displayed categories. Grothendieck fibrations, for example, when defined as certain functors, use equality on objects in their definition. When defined instead as certain displayed categories, no reference to equality on objects is required. Moreover, almost all examples of fibrations in nature are, in fact, categories whose standard construction can be seen as going via displayed categories.\r\n\r\nWe therefore propose displayed categories as a basis for the development of fibrations in the type-theoretic setting, and similarly for various other notions whose classical definitions involve equality on objects.\r\n\r\nBesides giving a conceptual clarification of such issues, displayed categories also provide a powerful tool in computer formalisation, unifying and abstracting common constructions and proof techniques of category theory, and enabling modular reasoning about categories of multi-component structures. As such, most of the material of this article has been formalised in Coq over the UniMath library, with the aim of providing a practical library for use in further developments.","keywords":["Category theory","Dependent type theory","Computer proof assistants","Coq","Univalent mathematics"],"author":[{"@type":"Person","name":"Ahrens, Benedikt","givenName":"Benedikt","familyName":"Ahrens"},{"@type":"Person","name":"Lumsdaine, Peter LeFanu","givenName":"Peter LeFanu","familyName":"Lumsdaine"}],"position":5,"pageStart":"5:1","pageEnd":"5:16","dateCreated":"2017-08-30","datePublished":"2017-08-30","isAccessibleForFree":true,"license":"https:\/\/creativecommons.org\/licenses\/by\/3.0\/legalcode","copyrightHolder":[{"@type":"Person","name":"Ahrens, Benedikt","givenName":"Benedikt","familyName":"Ahrens"},{"@type":"Person","name":"Lumsdaine, Peter LeFanu","givenName":"Peter LeFanu","familyName":"Lumsdaine"}],"copyrightYear":"2017","accessMode":"textual","accessModeSufficient":"textual","creativeWorkStatus":"Published","inLanguage":"en-US","sameAs":"https:\/\/doi.org\/10.4230\/LIPIcs.FSCD.2017.5","publisher":"Schloss Dagstuhl \u2013 Leibniz-Zentrum f\u00fcr Informatik","citation":["http:\/\/www.tac.mta.ca\/tac\/reprints\/articles\/17\/tr17abs.html","http:\/\/dx.doi.org\/10.1017\/S0960129514000486","http:\/\/arxiv.org\/abs\/1705.04310","http:\/\/www.mathematik.tu-darmstadt.de\/~streicher\/FIBR\/DiWo.pdf","http:\/\/dx.doi.org\/10.1016\/0304-3975(93)90169-T","http:\/\/homotopytypetheory.org\/book","https:\/\/github.com\/UniMath"],"isPartOf":{"@type":"PublicationVolume","@id":"#volume6287","volumeNumber":84,"name":"2nd International Conference on Formal Structures for Computation and Deduction (FSCD 2017)","dateCreated":"2017-08-30","datePublished":"2017-08-30","editor":{"@type":"Person","name":"Miller, Dale","givenName":"Dale","familyName":"Miller"},"isAccessibleForFree":true,"publisher":"Schloss Dagstuhl \u2013 Leibniz-Zentrum f\u00fcr Informatik","hasPart":"#article10110","isPartOf":{"@type":"Periodical","@id":"#series116","name":"Leibniz International Proceedings in Informatics","issn":"1868-8969","isAccessibleForFree":true,"publisher":"Schloss Dagstuhl \u2013 Leibniz-Zentrum f\u00fcr Informatik","hasPart":"#volume6287"}}}