不流泪的等价形式化

Tom de Jong
{"title":"不流泪的等价形式化","authors":"Tom de Jong","doi":"arxiv-2408.11501","DOIUrl":null,"url":null,"abstract":"This expository note describes two convenient techniques in the context of\nhomotopy type theory for proving and formalizing that a given map is an\nequivalence. The first technique decomposes the map as a series of basic\nequivalences, while the second refines this approach using the 3-for-2 property\nof equivalences. The techniques are illustrated by proving a basic result in\nsynthetic homotopy theory.","PeriodicalId":501208,"journal":{"name":"arXiv - CS - Logic in Computer Science","volume":"7 1","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2024-08-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Formalizing equivalences without tears\",\"authors\":\"Tom de Jong\",\"doi\":\"arxiv-2408.11501\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This expository note describes two convenient techniques in the context of\\nhomotopy type theory for proving and formalizing that a given map is an\\nequivalence. The first technique decomposes the map as a series of basic\\nequivalences, while the second refines this approach using the 3-for-2 property\\nof equivalences. The techniques are illustrated by proving a basic result in\\nsynthetic homotopy theory.\",\"PeriodicalId\":501208,\"journal\":{\"name\":\"arXiv - CS - Logic in Computer Science\",\"volume\":\"7 1\",\"pages\":\"\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2024-08-21\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"arXiv - CS - Logic in Computer Science\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/arxiv-2408.11501\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"arXiv - CS - Logic in Computer Science","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/arxiv-2408.11501","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

本说明介绍了在同调类型理论背景下证明和形式化给定映射是等价映射的两种便捷技术。第一种技术将映射分解为一系列基本等价,第二种技术则利用等价的 3 对 2 属性完善了这种方法。我们通过证明合成同调理论的一个基本结果来说明这些技术。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Formalizing equivalences without tears
This expository note describes two convenient techniques in the context of homotopy type theory for proving and formalizing that a given map is an equivalence. The first technique decomposes the map as a series of basic equivalences, while the second refines this approach using the 3-for-2 property of equivalences. The techniques are illustrated by proving a basic result in synthetic homotopy theory.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信