Skip to main content
Log in

Explaining Gabriel–Zisman Localization to the Computer

  • Published:
Journal of Automated Reasoning Aims and scope Submit manuscript

Abstract

We explain a computer formulation of Gabriel–Zisman’s localization of categories in the proof assistant Coq. This includes the general localization construction with the proof of Lemma 1.2 of Gabriel and Zisman, as well as the construction using calculus of fractions.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. The Coq proof assistant, http://coq.inria.fr/

  2. Aczel, P.: On relating type theories and set theories, Types for proofs and programs (Irsee, 1998). Lecture Notes in Comput. Sci., vol. 1657, pp.1–18. Springer, Berlin (1999)

    Google Scholar 

  3. Agerholm, S., Gordon, M.: Experiments with ZF set theory in HOL and Isabelle, Higher order logic theorem proving and its applications (Aspen Grove, UT, 1995). Lecture Notes in Comput. Sci., vol. 971, pp. 32–45. Springer, Berlin (1995)

    Google Scholar 

  4. Alexandre, G.: An axiomatization of intuitionistic Zermelo-Fraenkel set theory, http://coq.inria.fr/contribs-eng.html

  5. Bénabou, J.: Some remarks on \(2\)-categorical algebra. I. Bull. Soc. Math. Belg. Sér. A 41(2), 127–194 (1989), Actes du Colloque en l’Honneur du soixantième Anniversaire de René Lavendhomme (Louvain-la-Neuve, 1989)

    Google Scholar 

  6. Bénabou, J.: Some geometric aspects of the calculus of fractions. Appl. Categ. Struct. 4(2–3), 139–165 (1996). The European Colloquium of Category Theory (Tours, 1994)

    Article  Google Scholar 

  7. Borceux, F.: Handbook of categorical algebra: 1. Encyclopedia of Mathematics and Its Applications, Vol. 50. Cambridge University Press, Cambridge (1994) Basic category theory

    Google Scholar 

  8. Brown, R.: Groupoids and van Kampen’s theorem. Proc. Lond. Math. Soc. 17(3), 385–401 (1967)

    Google Scholar 

  9. Cisinski, D.-C.: Les préfaisceaux comme modéles des types d’homotopie. Ph.D. thesis, Université Paris 7, 2002, http://www-math.univ-paris13.fr/~cisinski/

  10. Crégut, P.: The Omega tactic, The Coq reference manual, http://coq.inria.fr/doc/main.html Chapter 17

  11. Dawson, R., Paré, R., Pronk, D.: Adjoining adjoints. Adv. Math. 178(1), 99–140 (2003)

    Article  MathSciNet  Google Scholar 

  12. Gabriel, P., Zisman, M.: Calculus of fractions and homotopy theory. Ergebnisse der Mathematik und ihrer Grenzgebiete, Band 35. Springer-Verlag, New York (1967)

    MATH  Google Scholar 

  13. Gonthier, G.: A computer-checked proof of the Four Colour Theorem, 2004, http://research.microsoft.com/~gonthier/

  14. Gordon, M.J.C.: Merging HOL with set theory: Preliminary experiments. Technical Report 353, University of Cambridge Computer Laboratory (1994)

  15. Grothendieck, A.: Sur quelques points d’algébre homologique. Tôhoku Math. J. 9(2), 119–221 (1957)

    MathSciNet  Google Scholar 

  16. Grothendieck, A.: Théorie des topos et cohomologie étale des schémas, Tome 1: Théorie des topos. Springer-Verlag, Berlin (1972), Séminaire de Géométrie Algébrique du Bois-Marie 1963–1964 (SGA 4), Dirigé par M. Artin, A. Grothendieck, et J.L. Verdier. Avec la collaboration de N. Bourbaki, P. Deligne et B. Saint-Donat, Lecture Notes in Mathematics, Vol. 269, Springer-Verlag, Berlin (1972)

  17. Hales, T.: Formal proof of the Jordan curve theorem, available at http://www.math.pitt.edu/~thales/flyspeck/jordan_curve.tar

  18. Hartshorne, R.: Residues and duality. Lecture Notes of a Seminar on the Work of A. Grothendieck, given at Harvard 1963/64, with an Appendix by P. Deligne. Lecture Notes in Mathematics, No. 20. Springer-Verlag, Berlin (1966)

    Google Scholar 

  19. Huet, G.: Confluent reductions: abstract properties and applications to term rewriting systems. J. Assoc. Comput. Mach. 27(4), 797–821 (1980)

    MathSciNet  Google Scholar 

  20. Huet, G., Saïbi, A.: Constructive category theory. Proof, Language, and Interaction, Found. Comput. Ser., pp. 239–275, MIT Press, Cambridge, MA (2000)

    Google Scholar 

  21. Illusie, L.: Complexe cotangent et déformations, I. Lecture Notes in Mathematics, Vol. 239. Springer-Verlag, Berlin (1971)

    Google Scholar 

  22. Kelly, G.M., Lack, S., Walters, R.F.C.: Coinverters and categories of fractions for categories with structure. Appl. Categ. Struct. 1(1), 95–102 (1993)

    Article  MathSciNet  Google Scholar 

  23. Lamport, L., Paulson, L.C.: Should your specification language be typed? ACM Trans. Program. Lang. Syst. 21(3), 502–526 (1999)

    Article  Google Scholar 

  24. MacLane, S.: Categories for the working mathematician. Graduate Texts in Mathematics, Vol. 5. Springer-Verlag, New York (1971)

    Google Scholar 

  25. Maggesi, M., Simpson, C.: Information technology implications for mathematics: a view from the French Riviera, 2004, Preprint

  26. Maggesi, M., Simpson, C.: Verifica automatica del ragionamento matematico. Boll. Unione Mat. Ital. Sez. A (2006), to appear

  27. Maltsiniotis, G.: La théorie de l’homotopie de Grothendieck, 2001, http://www.math.jussieu.fr/~maltsin/

  28. Miquel, A., Werner, B.: The not so simple proof-irrelevant model of CC, Types for proofs and programs. Lecture Notes in Comput. Sci., Vol. 2646, pp. 240–258. Springer, Berlin (2003)

    Google Scholar 

  29. Newman, M.H.A.: On theories with a combinatorial definition of “equivalence”. Ann. Math. 43(2), 223–243 (1942)

    Article  Google Scholar 

  30. Paulson, L.C., Grąbczewski, K.: Mechanizing set theory. Cardinal arithmetic and the axiom of choice. J. Autom. Reason. 17(3), 291–323 (1996)

    Article  Google Scholar 

  31. Popescu, N.: Abelian categories with applications to rings and modules. London Mathematical Society Monographs, No. 3. Academic Press, London (1973)

    Google Scholar 

  32. Popescu, N., Popescu, L.: Theory of categories. Martinus Nijhoff Publishers, The Hague (1979)

  33. Pronk, D.A.: Etendues and stacks as bicategories of fractions. Compos. Math. 102(3), 243–303 (1996)

    MathSciNet  Google Scholar 

  34. Pugh, W.: The omega test: A fast and practical integer programming algorithm for dependence analysis. Supercomputing ‘91: Proceedings of the 1991 ACM/IEEE Conference on Supercomputing, pp. 4–13. ACM Press, New York (1991)

    Google Scholar 

  35. Quillen, D.G.: Homotopical algebra. Lecture Notes in Mathematics, No. 43. Springer-Verlag, Berlin (1967)

    Google Scholar 

  36. Schubert, H.: Categories. Springer-Verlag, New York (1972), Translated from the German by Eva Gray

    MATH  Google Scholar 

  37. Serre, J.-P.: Groupes d’homotopie et classes de groupes abéliens. Ann. Math. 58(2), 258–294 (1953)

    Article  MathSciNet  Google Scholar 

  38. Simpson, C.: Computer theorem proving in mathematics. Lett. Math. Phys. 69, 287–315 (2004)

    Article  MathSciNet  Google Scholar 

  39. Simpson, C.: Set-theoretical mathematics in Coq, 2004, http://arxiv.org/abs/math.LO/0402336

  40. Simpson, C.: Files for Gabriel–Zisman localization, 2005, http://arxiv.org/abs/math.CT/0506470

  41. Simpson, C.: Formal proof, computation, and the construction problem in algebraic geometry. Groupes de Galois arithmétiques et différentiels (Luminy, 2004). Séminaires et Congrés 13, SMF (2006)

  42. Street, Ross, 2005, Emails to the author

  43. Verdier, J.-L.: Des catégories dérivées des catégories abéliennes. Astérisque (1996), no. 239, xii+253 pp. (1997), With a preface by Luc Illusie, Edited and with a note by Georges Maltsiniotis

  44. Werner, B.: Sets in types, types in sets. Theoretical Aspects of Computer Software (Sendai, 1997), Lecture Notes in Comput. Sci., Vol. 1281, pp. 530–546. Springer, Berlin (1997)

    Google Scholar 

  45. Waschkies, I.: Location and derived categories. Notes for the conference “Introduction à la cohomologie motivique,” Luminy (2000)

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Carlos Simpson.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Simpson, C. Explaining Gabriel–Zisman Localization to the Computer. J Autom Reasoning 36, 259–285 (2006). https://doi.org/10.1007/s10817-006-9038-x

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10817-006-9038-x

Key words

Navigation