Hom weak ω-categories of a weak ω-category

IF 0.4 4区 计算机科学 Q4 COMPUTER SCIENCE, THEORY & METHODS Mathematical Structures in Computer Science Pub Date : 2022-04-01 DOI:10.1017/S0960129522000111
Thomas Cottrell, Soichiro Fujii
{"title":"Hom weak ω-categories of a weak ω-category","authors":"Thomas Cottrell, Soichiro Fujii","doi":"10.1017/S0960129522000111","DOIUrl":null,"url":null,"abstract":"Abstract Classical definitions of weak higher-dimensional categories are given inductively, for example, a bicategory has a set of objects and hom categories, and a tricategory has a set of objects and hom bicategories. However, more recent definitions of weak n-categories for all natural numbers n, or of weak \n$\\omega$\n -categories, take more sophisticated approaches, and the nature of the ‘hom is often not immediate from the definitions’. In this paper, we focus on Leinster’s definition of weak \n$\\omega$\n -category based on an earlier definition by Batanin and construct, for each weak \n$\\omega$\n -category \n$\\mathcal{A}$\n , an underlying (weak \n$\\omega$\n -category)-enriched graph consisting of the same objects and for each pair of objects x and y, a hom weak \n$\\omega$\n -category \n$\\mathcal{A}(x,y)$\n . We also show that our construction is functorial with respect to weak \n$\\omega$\n -functors introduced by Garner.","PeriodicalId":49855,"journal":{"name":"Mathematical Structures in Computer Science","volume":"32 1","pages":"420 - 441"},"PeriodicalIF":0.4000,"publicationDate":"2022-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Mathematical Structures in Computer Science","FirstCategoryId":"94","ListUrlMain":"https://doi.org/10.1017/S0960129522000111","RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"COMPUTER SCIENCE, THEORY & METHODS","Score":null,"Total":0}
引用次数: 1

Abstract

Abstract Classical definitions of weak higher-dimensional categories are given inductively, for example, a bicategory has a set of objects and hom categories, and a tricategory has a set of objects and hom bicategories. However, more recent definitions of weak n-categories for all natural numbers n, or of weak $\omega$ -categories, take more sophisticated approaches, and the nature of the ‘hom is often not immediate from the definitions’. In this paper, we focus on Leinster’s definition of weak $\omega$ -category based on an earlier definition by Batanin and construct, for each weak $\omega$ -category $\mathcal{A}$ , an underlying (weak $\omega$ -category)-enriched graph consisting of the same objects and for each pair of objects x and y, a hom weak $\omega$ -category $\mathcal{A}(x,y)$ . We also show that our construction is functorial with respect to weak $\omega$ -functors introduced by Garner.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
弱ω-类别的弱ω-类别
摘要归纳地给出了弱高维范畴的经典定义,如双范畴有一组对象和若干范畴,三范畴有一组对象和若干范畴。然而,最近对所有自然数n的弱n-类别的定义,或弱$ $ -类别的定义,采用了更复杂的方法,并且“家”的性质通常不是直接从定义中得到的。本文在Batanin先前的定义基础上,重点讨论了Leinster对弱$\omega$ -范畴的定义,并构造了对于每一个弱$\omega$ -范畴$\mathcal{A}$,一个由相同对象组成的底层(弱$\omega$ -范畴)富图,对于每一对对象x和y,一个弱$\omega$ -范畴$\mathcal{A}(x,y)$。我们也证明了我们的构造对于加纳引入的弱函子是泛函的。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
Mathematical Structures in Computer Science
Mathematical Structures in Computer Science 工程技术-计算机:理论方法
CiteScore
1.50
自引率
0.00%
发文量
30
审稿时长
12 months
期刊介绍: Mathematical Structures in Computer Science is a journal of theoretical computer science which focuses on the application of ideas from the structural side of mathematics and mathematical logic to computer science. The journal aims to bridge the gap between theoretical contributions and software design, publishing original papers of a high standard and broad surveys with original perspectives in all areas of computing, provided that ideas or results from logic, algebra, geometry, category theory or other areas of logic and mathematics form a basis for the work. The journal welcomes applications to computing based on the use of specific mathematical structures (e.g. topological and order-theoretic structures) as well as on proof-theoretic notions or results.
期刊最新文献
On Hofmann–Streicher universes T0-spaces and the lower topology GADTs are not (Even partial) functors A linear linear lambda-calculus Countability constraints in order-theoretic approaches to computability
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1