8 research outputs found
Formalization of Definitions and Theorems Related to an Elliptic Curve Over a Finite Prime Field by Using Mizar
In this paper, we introduce our formalization of the definitions and theorems related to an elliptic curve over a finite prime field. The elliptic curve is important in an elliptic curve cryptosystem whose security is based on the computational complexity of the elliptic curve discrete logarithm problem.ArticleJOURNAL OF AUTOMATED REASONING. 50(2):161-172 (2013)journal articl
Formalized Class Group Computations and Integral Points on Mordell Elliptic Curves
Diophantine equations are a popular and active area of research in number
theory. In this paper we consider Mordell equations, which are of the form
, where is a (given) nonzero integer number and all solutions in
integers and have to be determined. One non-elementary approach for
this problem is the resolution via descent and class groups. Along these lines
we formalized in Lean 3 the resolution of Mordell equations for several
instances of . In order to achieve this, we needed to formalize several
other theories from number theory that are interesting on their own as well,
such as ideal norms, quadratic fields and rings, and explicit computations of
the class number. Moreover we introduced new computational tactics in order to
carry out efficiently computations in quadratic rings and beyond.Comment: 14 pages. Submitted to CPP '23. Source code available at
https://github.com/lean-forward/class-group-and-mordell-equatio
International Congress of Mathematicians: 2022 July 6–14: Proceedings of the ICM 2022
Following the long and illustrious tradition of the International Congress of Mathematicians, these proceedings include contributions based on the invited talks that were presented at the Congress in 2022.
Published with the support of the International Mathematical Union and edited by Dmitry Beliaev and Stanislav Smirnov, these seven volumes present the most important developments in all fields of mathematics and its applications in the past four years. In particular, they include laudations and presentations of the 2022 Fields Medal winners and of the other prestigious prizes awarded at the Congress.
The proceedings of the International Congress of Mathematicians provide an authoritative documentation of contemporary research in all branches of mathematics, and are an indispensable part of every mathematical library
Intuition in formal proof : a novel framework for combining mathematical tools
This doctoral thesis addresses one major difficulty in formal proof: removing obstructions
to intuition which hamper the proof endeavour. We investigate this in the context
of formally verifying geometric algorithms using the theorem prover Isabelle, by first
proving the Graham’s Scan algorithm for finding convex hulls, then using the challenges
we encountered as motivations for the design of a general, modular framework
for combining mathematical tools.
We introduce our integration framework — the Prover’s Palette, describing in detail
the guiding principles from software engineering and the key differentiator of our
approach — emphasising the role of the user. Two integrations are described, using
the framework to extend Eclipse Proof General so that the computer algebra systems
QEPCAD and Maple are directly available in an Isabelle proof context, capable of running
either fully automated or with user customisation. The versatility of the approach
is illustrated by showing a variety of ways that these tools can be used to streamline the
theorem proving process, enriching the user’s intuition rather than disrupting it. The
usefulness of our approach is then demonstrated through the formal verification of an
algorithm for computing Delaunay triangulations in the Prover’s Palette
Formalization of Definitions and Theorems Related to an Elliptic Curve Over a Finite Prime Field by Using Mizar
In this paper, we introduce our formalization of the definitions and theorems related to an elliptic curve over a finite prime field. The elliptic curve is important in an elliptic curve cryptosystem whose security is based on the computational complexity of the elliptic curve discrete logarithm problem