Papers
Topics
Authors
Recent
Search
2000 character limit reached

Delooping presented groups in homotopy type theory

Published 6 May 2024 in cs.LO and math.CT | (2405.03264v2)

Abstract: Homotopy type theory is a logical setting based on Martin-L\"of type theory in which one can perform geometric constructions and proofs in a synthetic way. Namely, types can be interpreted as spaces up to homotopy and proofs as homotopy invariant constructions. In this context, loop spaces of pointed connected groupoids provide a natural representation of groups, and any group can be obtained as the loop space of such a type, which is then called a delooping of the group. There are two main methods for constructing the delooping of an arbitrary group G. The first one consists in describing it as a pointed higher inductive type, whereas the second one consists in taking the connected component of the principal G-torsor in the type of sets equipped with an action of G. We show here that, when a presentation (or even a generating set) is known for the group, simpler variants of those constructions can be used to build deloopings. The resulting types are more amenable to computations and lead to simpler meta-theoretic reasoning. Finally, we develop a type theoretical notion of 2-polygraph, which allows manipulating higher inductive types such as the ones involved in the description of deloopings. These allow us to investigate in this context a construction for the Cayley graph of a generated group and show that it encodes the relations of the group, as well as a Cayley complex which encodes relations between relations. Many of the developments performed in the article have been formalized using the cubical version of the Agda proof assistant.

Definition Search Book Streamline Icon: https://streamlinehq.com
References (30)
  1. Polygraphs: From rewriting to higher categories. To appear, 2023. arXiv:2312.00429.
  2. Symmetry. URL: https://github.com/UniMath/SymmetryBook.
  3. Construction of the circle in UniMath. Journal of Pure and Applied Algebra, 225(10):106687, 2021. arXiv:1910.01856, doi:10.1016/j.jpaa.2021.106687.
  4. Synthetic integral cohomology in cubical Agda. In 30th EACSL Annual Conference on Computer Science Logic (CSL 2022). Schloss Dagstuhl-Leibniz-Zentrum für Informatik, 2022. doi:10.4230/LIPIcs.CSL.2022.11.
  5. Central H-spaces and banded types. Preprint, 2023. arXiv:2301.02636.
  6. Cellular cohomology in homotopy type theory. Logical Methods in Computer Science, 16, 2020. arXiv:1802.02191, doi:10.23638/LMCS-16(2:7)2020.
  7. The real projective spaces in homotopy type theory. In 2017 32nd Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), pages 1–8. IEEE, 2017. arXiv:1704.05770, doi:10.5555/3329995.3330081.
  8. Evan Cavallo. Synthetic cohomology in homotopy type theory. PhD thesis, MA thesis, 2015.
  9. Arthur Cayley. Desiderata and suggestions. No. 2 – The theory of groups: graphical representation. American journal of mathematics, 1(2):174–176, 1878.
  10. Delooping generated groups. URL: https://github.com/smimram/generated-deloopings-agda.
  11. Isomorphism is equality. Indagationes Mathematicae, 24(4):1105–1120, 2013. doi:10.1016/j.indag.2013.09.002.
  12. Groupes Algébriques, Tome 1. North-Holland Publishing Company, 1970.
  13. John RJ Groves. Rewriting systems and homology of groups. In Groups—Canberra 1989: Australian National University Group Theory Program 1989, pages 114–141. Springer, 2006. doi:10.1007/BFb0100735.
  14. The simplicial model of Univalent Foundations (after Voevodsky). Journal of the European Mathematical Society, 23(6):2071–2126, 2021. arXiv:1211.2851, doi:10.4171/jems/1050.
  15. Free higher groups in homotopy type theory. In Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science, pages 599–608, 2018. arXiv:1805.02069, doi:10.1145/3209108.3209183.
  16. Nicolai Kraus and Jakob von Raumer. A rewriting coherence theorem with applications in homotopy type theory. Mathematical Structures in Computer Science, 32(7):982–1014, 2022. arXiv:2107.01594, doi:10.1017/S0960129523000026.
  17. Eilenberg-MacLane spaces in homotopy type theory. In Proceedings of the Joint Meeting of the Twenty-Third EACSL Annual Conference on Computer Science Logic (CSL) and the Twenty-Ninth Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), pages 1–9, 2014. doi:10.1145/2603088.2603153.
  18. Semantics of higher inductive types. Mathematical Proceedings of the Cambridge Philosophical Society, 169(1):159–208, 2020. arXiv:1705.07088, doi:10.1017/S030500411900015X.
  19. Combinatorial group theory, volume 188. Springer, 1977.
  20. Per Martin-Löf. Intuitionistic type theory, volume 1 of Studies in proof theory. Bibliopolis, 1984.
  21. Delooping cyclic groups with lens spaces in homotopy type theory. Accepted at LICS 2024 conference, 2024.
  22. Henri Poincaré. Analysis situs. Gauthier-Villars Paris, France, 1895.
  23. Egbert Rijke. The join construction. Preprint, 2017. arXiv:1701.07538.
  24. Egbert Rijke. Classifying Types. PhD thesis, Carnegie Mellon University, July 2018. arXiv:1906.09435.
  25. Egbert Rijke. Introduction to homotopy type theory. Preprint, 2022. arXiv:2212.11082.
  26. The Agda Community. Cubical Agda Library, July 2023. URL: https://github.com/agda/cubical.
  27. The Univalent Foundations Program. Homotopy Type Theory: Univalent Foundations of Mathematics. Institute for Advanced Study, 2013. URL: https://homotopytypetheory.org/book/.
  28. Cubical Agda: A dependently typed programming language with univalence and higher inductive types. Journal of Functional Programming, 31, 2021. doi:10.1145/3341691.
  29. David Wärn. Eilenberg–maclane spaces and stabilisation in homotopy type theory. Journal of Homotopy and Related Structures, 18(2):357–368, 2023. arXiv:2301.03685, doi:10.1007/s40062-023-00330-5.
  30. David Wärn. Path spaces of pushouts. Preprint, 2023. arXiv:2402.12339.
Citations (1)

Summary

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.

Tweets

Sign up for free to view the 3 tweets with 2 likes about this paper.