{"title":"Comparison of the colimit and the 2-colimit","authors":"Ilia Pirashvili","doi":"10.1007/s40062-023-00331-4","DOIUrl":null,"url":null,"abstract":"<div><p>The 2-colimit (also referred to as a pseudo colimit) is the 2-categorical analogue of the colimit and as such, a very important construction. Calculating it is, however, more involved than calculating the colimit. The aim of this paper is to give a condition under which these two constructions coincide. Tough the setting under which our results are applicable is very specific, it is, in fact, fairly important: As shown in a previous paper, the fundamental groupoid can be calculated using the 2-colimit. The results of this paper corresponds precisely to the situation of calculating the fundamental groupoid from a finite covering. We also optimise our condition in the last section, reducing from exponential complexity to a polynomial one.</p></div>","PeriodicalId":0,"journal":{"name":"","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2023-10-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"","FirstCategoryId":"100","ListUrlMain":"https://link.springer.com/article/10.1007/s40062-023-00331-4","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0
Abstract
The 2-colimit (also referred to as a pseudo colimit) is the 2-categorical analogue of the colimit and as such, a very important construction. Calculating it is, however, more involved than calculating the colimit. The aim of this paper is to give a condition under which these two constructions coincide. Tough the setting under which our results are applicable is very specific, it is, in fact, fairly important: As shown in a previous paper, the fundamental groupoid can be calculated using the 2-colimit. The results of this paper corresponds precisely to the situation of calculating the fundamental groupoid from a finite covering. We also optimise our condition in the last section, reducing from exponential complexity to a polynomial one.