Papers
Topics
Authors
Recent
Assistant
AI Research Assistant
Well-researched responses based on relevant abstracts and paper content.
Custom Instructions Pro
Preferences or requirements that you'd like Emergent Mind to consider when generating responses.
Gemini 2.5 Flash
Gemini 2.5 Flash 77 tok/s
Gemini 2.5 Pro 56 tok/s Pro
GPT-5 Medium 33 tok/s Pro
GPT-5 High 21 tok/s Pro
GPT-4o 107 tok/s Pro
Kimi K2 196 tok/s Pro
GPT OSS 120B 436 tok/s Pro
Claude Sonnet 4.5 34 tok/s Pro
2000 character limit reached

Formalizing Factorization on Euclidean Domains and Abstract Euclidean Algorithms (2404.14920v1)

Published 23 Apr 2024 in cs.LO

Abstract: This paper discusses the extension of the Prototype Verification System (PVS) sub-theory for rings, part of the PVS algebra theory, with theorems related to the division algorithm for Euclidean rings and Unique Factorization Domains that are general structures where an analog of the Fundamental Theorem of Arithmetic holds. First, we formalize the general abstract notions of divisibility, prime, and irreducible elements in commutative rings, essential to deal with unique factorization domains. Then, we formalize the landmark theorem, establishing that every principal ideal domain is a unique factorization domain. Finally, we specify the theory of Euclidean domains and formally verify that the rings of integers, the Gaussian integers, and arbitrary fields are Euclidean domains. To highlight the benefits of such a general abstract discipline of formalization, we specify a Euclidean gcd algorithm for Euclidean domains and formalize its correctness. Also, we show how this correctness is inherited under adequate parameterizations for the structures of integers and Gaussian integers.

Definition Search Book Streamline Icon: https://streamlinehq.com
References (31)
  1. Technical Report, Isabelle Library, University of Cambridge Computer Laboratory and Technische Universität München. Available at https://isabelle.in.tum.de/dist/library/HOL/HOL-Algebra/document.pdf.
  2. Jesús Aransay & Jose Divasón (2016): Formalisation of the computation of the echelon form of a matrix in Isabelle/HOL. Formal Aspects Comput. 28(6), pp. 1005–1026, 10.1007/s00165-016-0383-1.
  3. In: Proc. 24th International Conference on Logic for Programming, Artificial Intelligence and Reasoning LPAR, EPiC Series in Computing 94, pp. 1–10, 10.29007/7jbv.
  4. Clemens Ballarin (2019): Exploring the Structure of an Algebra Text with Locales. Journal of Automated Reasoning 64, pp. 1093–1121, 10.1007/s10817-019-09537-9.
  5. Ricky Butler, David Lester & et al. (2007): A PVS Theory for Abstract Algebra. Available at https://github.com/nasa/pvslib/tree/master/algebra. Accessed in June 12, 2023.
  6. Logical Methods in Computer Science 12(2:7), pp. 1–23, 10.2168/LMCS-12(2:7)2016.
  7. Cyril Cohen & Assia Mahboubi (2012): Formal proofs in real algebraic geometry: from ordered fields to quantifier elimination. Logical Methods in Computer Science 8(1:2), pp. 1–40, 10.2168/LMCS-8(1:2)2012.
  8. Johan Commelin & Robert Y. Lewis (2021): Formalizing the ring of Witt vectors. In: Proceedings of the 10th International Conference on Certified Programs and Proofs CPP, ACM SIGPLAN, pp. 264–277, 10.1145/3437992.3439919.
  9. The mathlib Community (2020): The Lean Mathematical Library. In: Proceedings of the 9th ACM SIGPLAN International Conference on Certified Programs and Proofs, CPP 2020, ACM, pp. 367–381, 10.1145/3372885.3373824.
  10. David S. Dummit & Richard M. Foote (2003): Abstract Algebra, 3 edition. Wiley.
  11. In: Proceedings of the 9th International Conference on Tests and Proofs (TAP@STAF), Lecture Notes in Computer Science 9154, Springer, pp. 92–108, 10.1007/978-3-319-21215-9_6.
  12. Christian Eder, Gerhard Pfister & Adrian Popescu (2017): On Signature-Based Gröbner Bases Over Euclidean Rings. In: Proceedings of the 2017 ACM on International Symposium on Symbolic and Algebraic Computation, ISSAC, ACM, pp. 141–148, 10.1145/3087604.3087614.
  13. John B. Fraleigh (2003): A First Course in Abstract Algebra, 7th edition. Pearson.
  14. Andrea Gabrielli & Marco Maggesi (2017): Formalizing Basic Quaternionic Analysis. In: Proceedings of the 8th International Conference on Interactive Theorem Proving, ITP, Lecture Notes in Computer Science 10499, Springer, pp. 225–240, 10.1007/978-3-319-66107-0_15.
  15. Journal of Symbolic Computation 34(4), pp. 271–286, 10.1006/jsco.2002.0552.
  16. In: Proceedings of the 4th International Conference on Interactive Theorem Proving ITP, Lecture Notes in Computer Science 7998, Springer, pp. 163–179, 10.1007/978-3-642-39634-2_14.
  17. Jónathan Heras, Francisco Jesús Martín-Mateos & Vico Pascual (2015): Modelling algebraic structures and morphisms in ACL2. Applicable Algebra in Engineering, Communication and Computing 26(3), pp. 277–303, 10.1007/s00200-015-0252-9.
  18. Thomas W. Hungerford (1980): Algebra. Graduate Texts in Mathematics 73, Springer-Verlag, New York-Berlin, 10.1007/978-1-4612-6101-8. Reprint of the 1974 original.
  19. Paul Bernard Jackson (1995): Enhancing the Nuprl Proof Development System and Applying it to Computational Abstract Algebra. Ph.D. thesis, Cornell University. Available at https://ecommons.cornell.edu/handle/1813/7167.
  20. Artur Kornilowicz & Christoph Schwarzweller (2014): The First Isomorphism Theorem and Other Properties of Rings. Formalized Mathematics 22(4), pp. 291– 301, 10.2478/forma-2014-0029.
  21. Daniel Lichtblau (2013): Applications of Strong Gröbner Bases over Euclidean Domains. International Journal of Algebra 7(8), pp. 369–390, 10.12988/ija.2013.13037.
  22. J. Autom. Reason. 65(8), pp. 1231–1263, 10.1007/s10817-021-09593-0.
  23. César Muñoz & Richard Butler (2003): Rapid prototyping in PVS. Technical Report NASA/CR-2003-212418, NIA-2003-03, NASA Langley Research Center (NIA).
  24. Sam Owre & Natarajan Shankar (1997, revised 1999): The Formal Semantics of PVS. Technical Report 97-2R, SRI International Computer Science Laboratory, Menlo Park CA 94025 USA.
  25. Lawrence C. Paulson (2018): Quaternions. Arch. Formal Proofs 2018. Available at https://www.isa-afp.org/entries/Quaternions.html.
  26. Jade Philipoom (2018): Correct-by-Construction Finite Field Arithmetic in Coq. Master’s thesis, Master of Engineering in Computer Science, MIT. Available at https://dspace.mit.edu/handle/1721.1/119582.
  27. David M. Russinoff (2000): A Mechanical Proof of the Chinese Remainder Theorem. UTCS Technical Report - no longer available - ACL2 Workshop 2000 TR-00-29, University of Texas at Austin. Available at https://www.cs.utexas.edu/users/moore/acl2/workshop-2000/final/russinoff-short/paper.pdf.
  28. Christoph Schwarzweller (2003): The Binomial Theorem for Algebraic Structures. Journal of Formalized Mathematics 12(3), pp. 559–564. Available at http://mizar.org/JFM/Vol12/binom.html.
  29. Christoph Schwarzweller (2009): The Chinese Remainder Theorem, its Proofs and its Generalizations in Mathematical Repositories. Studies in Logic, Grammar and Rhetoric 18(31), pp. 103–119. Available at https://philpapers.org/rec/SCHTCR-12.
  30. Christoph Walther (2018): A Machine Assisted Proof of the Chinese Remainder Theorem. Technical Report VFR 18/03, FB Informatik, Technische Universität Darmstadt.
  31. Hantao Zhang & Xin Hua (1992): Proving the Chinese Remainder Theorem by the Cover Set Induction. In: Proceegins of the 11th International Conference on Automated Deduction, CADE, Lecture Notes in Computer Science 607, Springer, pp. 431–445, 10.1007/3-540-55602-8_182.
Citations (2)
View on Semantic Scholar

Summary

We haven't generated a summary for this paper yet.

Ai Sparkles Streamline Icon: https://streamlinehq.com Summarize Now
Lightbulb Streamline Icon: https://streamlinehq.com

Continue Learning

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

Ai Sparkles Streamline Icon: https://streamlinehq.com Generate Now
List To Do Tasks Checklist Streamline Icon: https://streamlinehq.com

Collections

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

User Circle Single Streamline Icon: https://streamlinehq.com Sign Up