Advertisement

Covering Spaces in Homotopy Type Theory

  • Kuen-Bang HouEmail author
Conference paper
Part of the Trends in Mathematics book series (TM)

Abstract

Covering spaces play an important role in classical homotopy theory, whose algebraic characteristics have deep connections with fundamental groups of underlying spaces. It is natural to ask whether these connections can be stated in homotopy type theory (HoTT), an exciting new framework coming with an interpretation in homotopy theory. This note summarizes the author’s attempt to recover the classical results (e.g., the classification theorem) so as to explore the expressiveness of the new foundation. Some interesting techniques employed in the current proofs seem applicable to other constructions as well.

Notes

Acknowledgements

I want to thank Carlo Angiuli, Steve Awodey, Spencer Breiner, Guillaume Brunerie, Daniel Grayson, Robert Harper, Chris Kapulkin, and Ed Morehouse for helping me learn the classical theory, improve the presentation, and revise previous versions. This material is based upon work supported by the National Science Foundation under Grant No. 1116703.

References

  1. 1.
    HoTT library in Agda. https://github.com/HoTT/HoTT-Agda
  2. 2.
    The Univalent Foundations Program, Homotopy Type Theory: Univalent Foundations of Mathematics (Univalent Foundations Program, Princeton, 2013)zbMATHGoogle Scholar
  3. 3.
    S. Awodey, M.A. Warren, Homotopy theoretic models of identity types. Math. Proc. Camb. Philos. Soc. 146, 45–56 (2009) (Cambridge University Press)Google Scholar
  4. 4.
    N. Gambino, R. Garner, The identity type weak factorisation system. Theor. Comput. Sci. 409(1), 94–109 (2008)MathSciNetCrossRefzbMATHGoogle Scholar
  5. 5.
    M. Hofmann, T. Streicher, The groupoid interpretation of type theory, in Twenty-Five Years of Constructive Type Theory (Venice, 1995), vol. 36 (Clarendon, Oxford, 1998), pp. 83–111zbMATHGoogle Scholar
  6. 6.
    C. Kapulkin, P.L. Lumsdaine, V. Voevodsky, The simplicial model of univalent foundations (2012, Preprint). arXiv:1211.2851Google Scholar
  7. 7.
    P.L. Lumsdaine, Weak ω-categories from intensional type theory, in Typed Lambda Calculi and Applications (Springer, Berlin/Heidelberg, 2009), pp. 172–187CrossRefzbMATHGoogle Scholar
  8. 8.
    U. Norell, Towards a practical programming language based on dependent type theory. PhD thesis, Department of Computer Science and Engineering, Chalmers University of Technology, SE-412 96 Göteborg, Sweden, Sept 2007Google Scholar
  9. 9.
    B. van den Berg, R. Garner, Types are weak ω-groupoids. Proc. Lond. Math. Soc. 102(2), 370–394 (2011)MathSciNetCrossRefzbMATHGoogle Scholar
  10. 10.
    M.A. Warren, Homotopy theoretic aspects of constructive type theory. PhD thesis, Carnegie Mellon University (2008)Google Scholar

Copyright information

© Springer International Publishing Switzerland 2015

Authors and Affiliations

  1. 1.Department of Computer ScienceCarnegie Mellon UniversityPittsburghUSA

Personalised recommendations