Local fields, and fields complete with respect to a discrete valuation, are essential objects in commutative algebra, with applications to number theory and algebraic geometry. We formalize in Lean the basic theory of discretely valued fields. In particular, we prove that the unit ball with respect to a discrete valuation on a field is a discrete valuation ring and, conversely, that the adic valuation on the field of fractions of a discrete valuation ring is discrete. We define finite extensions of valuations and of discrete valuation rings, and prove some global-to-local results. Building on this general theory, we formalize the abstract definition and some fundamental properties of local fields. As an application, we show that finite extensions of the field Q_p of p-adic numbers and of the field F_p((X)) of Laurent series over F_p are local fields.
2023
LIPIcs
Formalizing Norm Extensions and Applications to Number Theory
María Inés de Frutos-Fernández
In 14th International Conference on Interactive Theorem Proving (ITP 2023) 2023
The field R of real numbers is obtained from the rational numbers Q by taking the completion with respect to the usual absolute value. We then define the complex numbers C as an algebraic closure of R. The p-adic analogue of the real numbers is the field Q_p of p-adic numbers, obtained by completing Q with respect to the p-adic norm. In this paper, we formalize in Lean 3 the definition of the p-adic analogue of the complex numbers, which is the field C_p of p-adic complex numbers, a field extension of Q_p which is both algebraically closed and complete with respect to the extension of the p-adic norm. More generally, given a field K complete with respect to a nonarchimedean real-valued norm, and an algebraic field extension L/K, we show that there is a unique norm on L extending the given norm on K, with an explicit description. Building on the definition of C_p, we formalize the definition of the Fontaine period ring B_HT and discuss some applications to the theory of Galois representations and to p-adic Hodge theory. The results formalized in this paper are a prerequisite to formalize Local Class Field Theory, which is a fundamental ingredient of the proof of Fermat’s Last Theorem.
arXiv
The refined class number formula for Drinfeld modules
Let K/k be a finite Galois extension of global function fields. Let E be a Drinfeld module over k. We state and prove an equivariant refinement of Taelman’s analogue of the analytic class number formula for (E, K/k), and derive explicit consequences for the Galois structure of the Taelman class group of E over K.
We provide explicit equations for moduli spaces of Drinfeld shtukas over the projective line P^1 with Γ(N), Γ_1(N) and Γ_0(N) level structures, where N is an effective divisor on P^1. If the degree of N is high enough, these moduli spaces are relative surfaces. We study some invariants of the moduli space of shtukas with Γ_0(N) level structure for several degree 4 divisors on P^1.
LIPIcs
Formalizing the Ring of Adèles of a Global Field
María Inés de Frutos-Fernández
In 13th International Conference on Interactive Theorem Proving (ITP 2022) 2022
The ring of adèles of a global field and its group of units, the group of idèles, are fundamental objects in modern number theory. We discuss a formalization of their definitions in the Lean 3 theorem prover. As a prerequisite, we formalize adic valuations on Dedekind domains. We present some applications, including the statement of the main theorem of global class field theory and a proof that the ideal class group of a number field is isomorphic to an explicit quotient of its idèle class group.
2021
SISY
Computing Rational Points on Rank 0 Genus 3 Hyperelliptic Curves
We compute rational points on genus 3 odd degree hyperelliptic curves C over ℚ that have Jacobians of Mordell–Weil rank 0. The computation applies the Chabauty–Coleman method to find the zero set of a certain system of p-adic integrals, which is known to be finite and include the set of rational points C(ℚ). We implemented an algorithm in Sage to carry out the Chabauty–Coleman method on a database of 5870 curves.
arXiv
Rational linear subspaces of hypersurfaces over finite fields
María Inés de Frutos-Fernández, Sumita Garai, Kelly Isham, and 2 more authors
Fix positive integers n,r,d. We show that if n,r,d satisfy a suitable inequality, then any smooth hypersurface X⊂P^n defined over a finite field of characteristic p sufficiently large contains a rational r-plane. Under more restrictive hypotheses on n,r,d we show the same result without the assumption that X is smooth or that p is sufficiently large.
2020
Thesis
Modularity of Elliptic Curves Defined over Function Fields (PhD Thesis)
We provide explicit equations for moduli spaces of Drinfeld shtukas over the projective line with Γ(N), Γ_1(N) and Γ_0(N) level structures, where N is an effective divisor on P^1. If the degree of N is big enough, these moduli spaces are relative surfaces. We study how the moduli space of shtukas over P1 with Γ_0(N) level structure, Sht^{2,tr}(Γ_0(N)), can be used to provide a notion of motivic modularity for elliptic curves defined over function fields. Elliptic curves over function fields are known to be modular in the sense of admitting a parametrization from a Drinfeld modular curve, provided that they have split multiplicative reduction at one place. We conjecture a different notion of modularity that should cover the curves excluded by the reduction hypothesis. We use our explicit equations for Sht^{2,tr}(Γ_0(N)) to verify our modularity conjecture in the cases where N = 2(0) + (1) + (∞) and N = 3(0) + (∞).
Other Writing
2014
Thesis
El problema del logaritmo discreto para curvas elípticas y sus aplicaciones criptográficas
We present some cryptographical applications of the discrete logarithm problem over elliptic curves, including Diffie-Hellman key exchange, Massey-Omura encryption and ECDSA digital signatures. We analyze some general attacks on the DLP: Baby-Step Giant-Step, Pollard’s rho algorithm and Silver-Pohlig-Hellman attack. We also describe two specifics attacks: the subexponential algorithm Index Calculus, which works over F_q^*, and Xedni Calculus, which is an attack on the DLP over elliptic curves. Finally, we compare the performances of several attacks over F_q^* and E(F_q): Baby-Step Giant-Step, four variants of Pollard’s rho method and Index Calculus (the last one, only over F_q^*). We conclude that, on groups of the sizes we consider, Pollard’s rho attack works best for computing isolated logarithms, while Index Calculus is the fastest method when several attacks need to be made.