The Chinese Remainder Theorem, its Proofs and its Generalizations in Mathematical Repositories

In the spirit of mathematical knowledge management theorems are proven with computer assistance to be included into mathematical repositories. In the mathematical literature one often finds not only differ- ent proofs for theorems, but also different versions or generalizations with a different background. In mathematical repositories, for obvious reasons, there is usually one version of a theorem with one proof only - the authors choose a version and a proof which can be formalized most easily. In this paper we argue that there are other issues to decide which proof of a theo- rem or which version of a theorem should be included in a repository. These basically depend on the intended further use of the theorem and the proof. We illustrate these issues in detail with the Chinese Remainder Theorem as an example.

[1]  G. Bancerek Journal of Formalized Mathematics , 1997 .

[2]  Freek Wiedijk On the usefulness of formal methods , 2006 .

[3]  Krzysztof Treyderowski,et al.  Multiplication of Polynomials using Discrete Fourier Transformation , 2006 .

[4]  Adam Grabowski,et al.  Translating Mathematical Vernacular into Knowledge Repositories , 2005, MKM.

[5]  Christoph Schwarzweller Modular Integer Arithmetic , 2008, Formaliz. Math..

[6]  Alfred Tarski On well-ordered subsets of any set , 1939 .

[7]  Deepak Kapur,et al.  An Overview of Rewrite Rule Laboratory (RRL) , 1989, RTA.

[8]  Adam Naumowicz,et al.  Improving Mizar Texts with Properties and Requirements , 2004, MKM.

[9]  Grzegorz Bancerek,et al.  On the structure of Mizar types , 2003, Mathematics, Logic and Computation @ ICALP.

[10]  Michael Kohlhase Proceedings of the 4th international conference on Mathematical Knowledge Management , 2005 .

[11]  Hantao Zhang,et al.  Proving the Chinese Remainder Theorem by the Cover Set Induction , 1992, CADE.

[12]  William M. Farmer,et al.  IMPS: An Interactive Mathematical Proof System , 1990, CADE.

[13]  Donald Ervin Knuth,et al.  The Art of Computer Programming , 1968 .

[14]  Joe Hurd,et al.  Verification of the Miller-Rabin probabilistic primality test , 2003, J. Log. Algebraic Methods Program..

[15]  Martin D. Davis,et al.  Obvious Logical Inferences , 1981, IJCAI.

[16]  A. Kondracki,et al.  The Chinese Remainder Theorem , 2019, Certain Number-Theoretic Episodes in Algebra.

[17]  G. G. Stokes "J." , 1890, The New Yale Book of Quotations.

[18]  James H. Davenport,et al.  MKM from Book to Computer: A Case Study , 2003, MKM.

[19]  de Ng Dick Bruijn,et al.  The Mathematical Vernacular, A Language for Mathematics with Typed Sets , 1994 .

[20]  Christoph Schwarzweller Mizar Attributes: A Technique to Encode Mathematical Knowledge into Type Systems , 2007 .

[21]  Joachim von zur Gathen,et al.  Modern Computer Algebra , 1998 .

[22]  The Sum and Product of Finite Sequences of Real Numbers , 1990 .

[23]  Grzegorz Zwara,et al.  The Divisibility of Integers and Integer Relatively Primes 1 , 1990 .

[24]  Fairouz Kamareddine,et al.  A Refinement of de Bruijn's Formal Language of Mathematics , 2004, J. Log. Lang. Inf..