×

Formalization of ring theory in PVS. Isomorphism theorems, principal, prime and maximal ideals, Chinese remainder theorem. (English) Zbl 1493.68389

The paper under review reports about the formalization in the Prototype Verification System (PVS) of some fundamental results in ring theory.
For the sake of this review, let us recall that, given a ring \(R\) and a ring homomorphism \(\varphi\colon R\to S\) to some other ring \(S\), the first isomorphism theorem guarantees the existence of an isomorphism \(\varphi\cong R/\ker\varphi\); the second theorem provides, for every ideal \(I\subset R\) and every subring \(H\subseteq R\), an isomorphism \(H/\bigl(H\cap I\bigr)\cong (H+I)/I\); and the third isomorphism theorem yields an isomorphism \(R/J\cong (R/I)/(J/I)\) for every ideal \(J\subseteq R\) containing \(I\). It should be clear from the very formulation of these three theorems that in order to formalize their statements – and their proofs – some ingredients are crucial:
the notion of ring homomorphism;
the notions of ideal and of subring;
the notion of coset of a ring \(R\), or of an ideal \(J\), modulo a given ideal \(I\);
the notion of quotient of a ring \(R\), or of an ideal \(J\), modulo an ideal \(I\).
Beyond formalizing these notions in PVS, the authors focus on some important properties of ideals (namely, what it means for an ideal to be principal, or prime, or maximal); and they derive a crucial consequence of the first isomorphism theorem, normally known as the Chinese remainder theorem, stating that for pairwise comaximal ideals \(\{I_i\}_{1\leq i\leq n}\) in a commutative ring \(R\) there are isomorphisms. The comaximality assumption can be relaxed, as well as the commutativity assumption, yielding weaker yet interesting results: the formalization in this broader setting is presented in the paper, but we content ourselves with the stated version in this report. \[ R/(I_1\cap \cdots\cap I_n)\cong R/I_1\times\cdots \times R/I_n. \] Most of these theorems can already be found in some formalization systems, but in some cases only part of them are available. Concerning the PVS system itself, this paper marks an advance in that both the ring and the algebra theories only contained partial results and limited definitions, in particular concerning quotients, prior to the authors’ work.
The paper consists of nine sections, Section 1 being of introductory nature. In Section 2, all mathematical results are gathered, while the discussion of the formalization work itself is summarized in Sections 3–7; finally, Sections 8 and 9 contain descriptions of related and of future works.
The text is clear and complete and it provides the reader with a clear and thorough description of the formalization work, emphasizing difficulties and relevant choices in detail. In most cases the authors have developed quite completely an API allowing to interact easily with the formalized notions, but three notable contributions do deserve special emphasis. Firstly, the authors chose to work in the setting of groupoids (often rather called magmas in the mathematical literature), simply consisting of sets endowed with one operation. The statements of the three isomorphism theorems can be extended to this setting, yielding more flexible and general results from which the special case of rings can be derived. Secondly, some stress is put on specific classes of ideals (namely, principal, prime and maximal ideals), having in mind their behaviour with respect to quotients: the (commutative) ring \(R/I\) is an integral domain if and only if \(I\) is a prime ideal, and \(R/I\) is a field if and only if \(I\) is maximal. Finally, it is noteworthy to observe that Section 7 is devoted to the explicit application of the Chinese remainder theorem for the ring \(\mathbb Z\), and the results described there might be of independent interest.
It is clear that the authors were striving for a general set-up where the notions they consider could be further generalized, and this for the sake both of future applications and of the neatness of the formalization process. In this direction, generalizing quotients and isomorphism theorems to general groupoids, or magmas, is an important step, but the reviewer finds it a pity that the even more flexible notion of cosets with respect to an arbitrary equivalence relation was not implemented; it would allow not only to treat group and ring theory, but also quotients beyond the realm of algebraic structures (allowing, for example, to define quotient topological spaces or quotient metric spaces). In the same vein, developing a general theory for principal ideal domains might have preceded the special case \(R=\mathbb Z\); the authors indeed do address this point in Section 9.

MSC:

68V20 Formalization of mathematics in connection with theorem provers
03B35 Mechanization of proofs and logical operations
13P99 Computational aspects and applications of commutative rings
16Z05 Computational aspects of associative rings (general theory)
20N02 Sets with a single binary operation (groupoids)
68V15 Theorem proving (automated and interactive theorem provers, deduction, resolution, etc.)
Full Text: DOI

References:

[1] Aransay, J., Ballarin, C., Baillon, M., de Vilhena, P.E., Hohe, S., Kammüller, F., Paulson, L.C.: The Isabelle/HOL Algebra Library. Technical report, Isabelle Library, University of Cambridge Computer Laboratory and Technische Universität München (2019). https://isabelle.in.tum.de/dist/library/HOL/HOL-Algebra/document.pdf
[2] Artin, M., Algebra (2010), London: Pearson, London · Zbl 0788.00001
[3] Ayala-Rincón, M., de Moura, F.L.C.: Applied Logic for Computer Scientists: Computational Deduction and Formal Proofs. UTiCS. Springer (2017). doi:10.1007/978-3-319-51653-0 · Zbl 1401.03001
[4] Ballarin, C., Exploring the structure of an algebra text with locales, J. Autom. Reason. (2019) · Zbl 1468.68277 · doi:10.1007/s10817-019-09537-9
[5] Bini, G.; Flamini, F., Finite Commutative Rings and Their Applications (2012), Berlin: Springer, Berlin · Zbl 1095.13032
[6] Bourbaki, N.:Élèments de mathématique. Algèbre: chapitres 1 à 3. Springer, Berlin (2006). Réimpression inchangée de la 2e éd. 1970 Edition · Zbl 1103.13001
[7] Butler, R., Lester, D.: A PVS theory for abstract algebra (2007). http://shemesh.larc.nasa.gov/fm/ftp/larc/PVS-library/pvslib.html. Accessed 31 March 2019
[8] Butler, RW, Formalization of the integral calculus in the PVS theorem prover, J. Formaliz. Reason., 2, 1, 1-26 (2009) · Zbl 1175.68410 · doi:10.6092/issn.1972-5787/1349
[9] Cano, G.; Cohen, C.; Dénès, M.; Mörtberg, A.; Siles, V., Formalized linear algebra over elementary divisor rings in Coq, Log. Methods Comput. Sci., 12, 2-7, 1-23 (2016) · Zbl 1448.68461 · doi:10.2168/LMCS-12(2:7)2016
[10] Cohen, C.; Mahboubi, A., Formal proofs in real algebraic geometry: from ordered fields to quantifier elimination, Log. Methods Comput. Sci., 8, 1-2, 1-40 (2012) · Zbl 1241.68096 · doi:10.2168/LMCS-8(1:2)2012
[11] da Silva, A.B.A., de Lima, T.A., Galdino, A.L.: Formalizing ring theory in PVS. In: 9th International Conference on Interactive Theorem Proving ITP. Lecture Notes in Computer Science, vol. 10895, pp. 40-47. Springer (2018). doi:10.1007/978-3-319-94821-8_3 · Zbl 1451.68332
[12] Ding, C.; Pei, D.; Salomaa, A., Chinese Remainder Theorem: Applications in Computing, Coding, Cryptography (1996), River Edge: World Scientific Publishing Co., Inc, River Edge · Zbl 0907.11002 · doi:10.1142/3254
[13] Dougherty, S.; Leroy, AFA; Puczyłowski, E.; Solé, P., Noncommutative Rings and Their Applications. Contemporary Mathematics (2015) · Zbl 1310.16001 · doi:10.1090/conm/634
[14] Dougherty, S.; Leroy, A., Euclidean self-dual codes over non-commutative Frobenius rings, Appl. Algebra Eng. Commun. Comput., 27, 3, 185-203 (2016) · Zbl 1435.94149 · doi:10.1007/s00200-015-0277-0
[15] Dummit, DS; Foote, RM, Abstract Algebra (2003), Hoboken: Wiley, Hoboken · Zbl 0751.00001
[16] Galdino, AL; Ayala-Rincón, M., A PVS theory for term rewriting systems, Electron. Notes Theor. Comput. Sci., 247, 67-83 (2009) · Zbl 1310.68124 · doi:10.1016/j.entcs.2009.07.049
[17] Geuvers, H.; Pollack, R.; Wiedijk, F.; Zwanenburg, J., A constructive algebraic hierarchy in Coq, J. Symb. Comput., 34, 4, 271-286 (2002) · Zbl 1038.68108 · doi:10.1006/jsco.2002.0552
[18] Gonthier, G., Asperti, A., Avigad, J., Bertot, Y., Cohen, C., Garillot, F., Roux, S.L., Mahboubi, A., O’Connor, R., Biha, S.O., Pasca, I., Rideau, L., Solovyev, A., Tassi, E., Théry, L.: A machine-checked proof of the odd order theorem. In: 4th International Conference on Interactive Theorem Proving ITP. Lecture Notes in Computer Science, vol. 7998, pp. 163-179. Springer (2013). doi:10.1007/978-3-642-39634-2_14 · Zbl 1317.68211
[19] Gonthier, G., Mahboubi, A., Rideau, L., Tassi, E., Théry, L.: A modular formalisation of finite group theory. In: 20th International Conference Theorem Proving in Higher Order Logics TPHOLs. Lecture Notes in Computer Science, vol. 4732, pp. 86-101. Springer (2007). doi:10.1007/978-3-540-74591-4_8 · Zbl 1144.68356
[20] Großschädl, J.: The Chinese remainder theorem and its application in a high-speed RSA crypto chip. In: 16th Annual Computer Security Applications Conference ACSAC, pp. 384-393. IEEE Computer Society (2000). doi:10.1109/ACSAC.2000.898893
[21] Heras, J.; Martín-Mateos, FJ; Pascual, V., Modelling algebraic structures and morphisms in ACL2, Appl. Algebra Eng. Commun. Comput., 26, 3, 277-303 (2015) · Zbl 1325.68214 · doi:10.1007/s00200-015-0252-9
[22] Herstein, IN, Topics in Algebra (1975), Lexington: Xerox College Publishing, Lexington · Zbl 1230.00004
[23] Hungerford, TW, Algebra. Graduate Texts in Mathematics (1980), New York: Springer, New York · Zbl 0442.00002
[24] Jackson, P.B.: Enhancing the Nuprl Proof Development System and Applying it to Computational Abstract Algebra. Ph.D. thesis, Cornell University (1995)
[25] Jacobson, N., Basic Algebra I. Dover Books on Mathematics (2009), Mineola: Dover Publications, Mineola
[26] Kornilowicz, A.; Schwarzweller, C., The first isomorphism theorem and other properties of rings, Formaliz. Math., 22, 4, 291-301 (2014) · Zbl 1316.13003 · doi:10.2478/forma-2014-0029
[27] Lester, D.: A PVS Theory for Continuity, Homeomorphisms, Connected and Compact Spaces, Borel Sets/Functions (2009). http://shemesh.larc.nasa.gov/fm/ftp/larc/PVS-library/pvslib.html. Accessed 31 March 2019
[28] Liang, H.; Li, X.; Xia, X., Adaptive frequency estimation with low sampling rates based on robust Chinese remainder theorem and IIR notch filter, Adv. Adapt. Data Anal., 1, 4, 587-600 (2009) · doi:10.1142/S1793536909000230
[29] Lidl, R.; Niederreiter, H., Introduction to Finite Fields and Their Applications (1994), Cambridge: Cambridge University Press, Cambridge · Zbl 0820.11072 · doi:10.1017/CBO9781139172769
[30] Noether, E., Abstrakter Aufbau der Idealtheorie in algebraischen Zahl- und Funktionenkörpern, Mathematische Annalen, 96, 1, 26-61 (1927) · JFM 52.0130.01 · doi:10.1007/BF01209152
[31] Owre, S., Shankar, N.: The Formal Semantics of PVS. Technical Report 97-2R, SRI International Computer Science Laboratory, Menlo Park (1997) (revised 1999) · Zbl 1165.68468
[32] Philipoom, J.: Correct-by-Construction Finite Field Arithmetic in Coq. Master’s thesis, Master of Engineering in Computer Science, MIT (2018)
[33] Putinar, M., Sullivant, S.: Emerging Applications of Algebraic Geometry. The IMA Volumes in Mathematics and its Applications. Springer, New York (2008). doi:10.1007/978-0-387-09686-5
[34] Russinoff, D.M.: 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 (2000)
[35] Schwarzweller, C., The binomial theorem for algebraic structures, J. Formaliz. Math., 12, 3, 559-564 (2003)
[36] Schwarzweller, C., The Chinese remainder theorem, its proofs and its generalizations in mathematical repositories, Stud. Log. Gramm. Rhetor., 18, 31, 103-119 (2009)
[37] Suárez, YG; Torres, E.; Pereira, O.; Pérez, C.; Rodríguez, R., Application of the ring theory in the segmentation of digital images, Int. J. Soft Comput. Math. Control, 3, 4, 69-81 (2014) · doi:10.14810/ijscmc.2014.3405
[38] The mathlib Community.: The Lean Mathematical Library. In: Proceedings of the 9th ACM SIGPLAN International Conference on Certified Programs and Proofs, CPP 2020, pp. 367-381. ACM (2020). doi:10.1145/3372885.3373824
[39] van der Waerden, BL, Algebra (1991), New York: Springer, New York · doi:10.1007/978-1-4684-9999-5
[40] Walther, C.: A Machine Assisted Proof of the Chinese Remainder Theorem. Technical Report VFR 18/03, FB Informatik, Technische Universität Darmstadt (2018)
[41] Zhang, H., Hua, X.: Proving the Chinese remainder theorem by the cover set induction. In: 11th International Conference on Automated Deduction CADE. Lecture Notes in Computer Science, vol. 607, pp. 431-445. Springer (1992). doi:10.1007/3-540-55602-8_182 · Zbl 0925.03068
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.