17
views
0
recommends
+1 Recommend
0 collections
    0
    shares
      • Record: found
      • Abstract: found
      • Article: found
      Is Open Access

      A formal proof of Hensel's lemma over the p-adic integers

      Preprint

      Read this article at

      Bookmark
          There is no author summary for this article yet. Authors can add summaries to their articles on ScienceOpen to make them more accessible to a non-specialist audience.

          Abstract

          The field of \(p\)-adic numbers \(\mathbb{Q}_p\) and the ring of \(p\)-adic integers \(\mathbb{Z}_p\) are essential constructions of modern number theory. Hensel's lemma, described by Gouv\^ea as the "most important algebraic property of the \(p\)-adic numbers," shows the existence of roots of polynomials over \(\mathbb{Z}_p\) provided an initial seed point. The theorem can be proved for the \(p\)-adics with significantly weaker hypotheses than for general rings. We construct \(\mathbb{Q}_p\) and \(\mathbb{Z}_p\) in the Lean proof assistant, with various associated algebraic properties, and formally prove a strong form of Hensel's lemma. The proof lies at the intersection of algebraic and analytic reasoning and demonstrates how the Lean mathematical library handles such a heterogeneous topic.

          Related collections

          Most cited references23

          • Record: found
          • Abstract: not found
          • Book: not found

          A Course in Arithmetic

            Bookmark
            • Record: found
            • Abstract: found
            • Article: not found
            Is Open Access

            A FORMAL PROOF OF THE KEPLER CONJECTURE

            This article describes a formal proof of the Kepler conjecture on dense sphere packings in a combination of the HOL Light and Isabelle proof assistants. This paper constitutes the official published account of the now completed Flyspeck project.
              Bookmark
              • Record: found
              • Abstract: not found
              • Conference Proceedings: not found

              How to make ad-hoc polymorphism less ad hoc

                Bookmark

                Author and article information

                Journal
                25 September 2019
                Article
                10.1145/3293880.3294089
                1909.11342
                78ce40c5-c14f-491b-bf82-6373b7a1e7ce

                http://arxiv.org/licenses/nonexclusive-distrib/1.0/

                History
                Custom metadata
                CPP 2019
                cs.LO

                Theoretical computer science
                Theoretical computer science

                Comments

                Comment on this article