Math Mapgenerated 2026-10-25 · a354234
PUBLIC BUILD

p-adic Numbers, From the Ground Up

A self-contained course built for the Map of Math project — the second strand, and it plugs directly into the first (elliptic-curves-course.md) at several points, which is called out explicitly where it happens.


How to use this document

Same shape as the elliptic curves course, deliberately: motivation first, then the real history (so the ideas arrive in the order humans needed them), then a foundations section built toward exactly one destination — the notion of completing a field in a new way — then eight coursework modules (exposition, one fully worked example, a graded problem set), a full answer key, an organized resource list, and finally a connection graph showing where this sits in your wider map and what to open next. Work the problems before reading the answers.

One framing note up front, because it’s the whole point of this course: p-adic numbers are usually taught as a strange add-on, a curiosity bolted onto “real” mathematics. That’s backwards, and it’s a historical accident of which completion of ℚ\mathbb{Q} your teachers happened to grow up with. By the end of §1–§2 the goal is for ℚp\mathbb{Q}_p to feel exactly as natural as ℝ\mathbb{R} — two members of the same family, not one normal object and one exotic one.


1. Motivation — why this object, specifically

Here’s a question nobody asks you in school, because by the time you meet ℝ\mathbb{R} it’s already been handed to you as the completion of ℚ\mathbb{Q}, full stop: why should the ordinary absolute value |x−y||x-y| be the only reasonable way to measure how “close” two rational numbers are?

Ordinary distance says 10000001000000 and 10000011000001 are far apart (they differ by 1… wait, they’re close) and 11 and 10000001000000 are far apart. It’s built entirely around size. But there’s a completely different, equally legitimate notion of closeness hiding in the rationals, one built around divisibility instead of size: fix a prime pp, and declare two rational numbers close if their difference is divisible by a large power of pp. Under this rule, 11 and 1,000,0011{,}000{,}001 are extremely close 5-adically (their difference 1,000,000=26⋅561{,}000{,}000 = 2^6 \cdot 5^6 is divisible by 565^6), even though they’re about as far apart as two numbers can be in the ordinary sense. This isn’t a trick or an analogy — it satisfies every axiom a distance function needs (Module 1 makes this precise), and when you complete ℚ\mathbb{Q} with respect to it, exactly the way Cauchy sequences complete ℚ\mathbb{Q} into ℝ\mathbb{R}, you get a genuinely new, genuinely complete field: ℚp\mathbb{Q}_p, the pp-adic numbers.

The hindsight-obvious version of this, which took mathematics about twenty years to formalize after the numbers themselves were constructed (§2 has the real timeline): Ostrowski’s theorem (1916) says every possible notion of absolute value on ℚ\mathbb{Q} — up to the natural equivalence that doesn’t change which sequences converge — is either the usual one, or one of these pp-adic ones, one for each prime. There is no third kind, and there never will be another one discovered later; the list is closed and complete. That means the correct picture of “completing the rationals” was never a single act producing ℝ\mathbb{R}. It was always a family of acts, indexed by the places of ℚ\mathbb{Q} — one place for every prime pp, plus one more place (traditionally called the “infinite place” or ∞\infty) for the usual absolute value. ℝ\mathbb{R} is the completion at ∞\infty. ℚ2,ℚ3,ℚ5,ℚ7,…\mathbb{Q}_2, \mathbb{Q}_3, \mathbb{Q}_5, \mathbb{Q}_7, \dots are the completions at each finite prime. They are all, formally, equally valid completions of the same field. ℝ\mathbb{R} just happens to be the one you meet first, because human beings evolved to measure size, not divisibility — an accident of biology, not of mathematics.

There’s a second hindsight lens that makes the construction feel inevitable rather than clever, and it’s the one that actually motivated Hensel in 1897 (§2): the function field analogy. Consider the ring of polynomials K[x]K[x] instead of ℤ\mathbb{Z}, and the field of rational functions K(x)K(x) instead of ℚ\mathbb{Q}. If you want to study a rational function f(x)f(x) near a specific point x=ax=a, the natural tool is its Taylor/Laurent expansion around that point: f(x)=∑n≥Ncn(x−a)nf(x) = \sum_{n \ge N} c_n (x-a)^n. This expansion converges (formally, or in the usual sense if K=ℂK=\mathbb{C}) precisely near aa, and it lets you do local analysis — differentiate, find roots via Newton’s method, study behavior order-of-vanishing by order-of-vanishing — one point at a time, even though the global function ff might be complicated everywhere else. Dedekind and Weber had shown by 1882 that the arithmetic of K[x]K[x] (irreducible polynomials, i.e. points on a curve, playing the role of primes) is a near-perfect mirror of the arithmetic of ℤ\mathbb{Z} (primes). Hensel’s insight was to push the analogy one step further: if ℤ\mathbb{Z}’s primes behave like K[x]K[x]’s points, then number theory ought to have its own analogue of “expanding a function in a Taylor series near a point” — expanding an integer or rational number in a series in powers of a prime pp, the number-theoretic analogue of (x−a)(x-a). That expansion is exactly a pp-adic number: a0+a1p+a2p2+⋯a_0 + a_1 p + a_2 p^2 + \cdots, digits ai∈{0,…,p−1}a_i \in \{0, \dots, p-1\}, extending infinitely — not off to the right of a decimal point the way real decimals do, but off to the left, as coefficients of higher and higher powers of pp. Once you see it this way, pp-adic numbers stop looking like a bizarre completion trick and start looking like the obvious, overdue transplant of ordinary local analysis (Taylor series near a point) into arithmetic (power series near a prime).

Four independent reasons this deserves a deep, dedicated thread in your map, mirroring the structure that made elliptic curves worth one:

It corrects a false sense that ℝ\mathbb{R} is special. Once Ostrowski’s theorem is in view, “the real numbers” is revealed as one entry in a complete, closed list of equally legitimate completions of ℚ\mathbb{Q}. This single reframing changes how you read almost all of classical number theory in hindsight — theorems that look like isolated facts about ℤ\mathbb{Z} or ℚ\mathbb{Q} are frequently theorems about all the places at once, with ℝ\mathbb{R} contributing one condition and each ℚp\mathbb{Q}_p contributing another.

It gives you a genuinely different geometry to think in, and it’s fully rigorous. The pp-adic distance satisfies a stronger triangle inequality than the usual one (the ultrametric inequality, Module 1), and the consequences are wonderfully strange: every triangle is isosceles, every point inside a ball is equally entitled to be called its center, and every ball is simultaneously open and closed. This isn’t pathology — it’s a clean, internally consistent alternate geometry, and a full theory of analysis (convergence, power series, an exponential and logarithm, even integration) can be built on top of it, often with simpler convergence criteria than in ℝ\mathbb{R} (Module 6).

Local information determines global information — sometimes. The local-global principle, first proved for quadratic forms by Hasse and Minkowski in the early 1920s, says: a quadratic equation has a rational solution if and only if it has a solution in ℝ\mathbb{R} and a solution in every single ℚp\mathbb{Q}_p. Checking infinitely many local conditions (one per prime) turns out to be a finite, mechanical computation, and it completely settles a global existence question. This “check everywhere locally, deduce it globally” philosophy — and the famous cases where it fails (Module 7) — is one of the central organizing ideas of modern number theory, including the Selmer group machinery used to bound ranks of elliptic curves in your other course document.

It is quietly load-bearing under some of the deepest 20th-century mathematics you’ve already touched. Andrew Wiles’s proof of Fermat’s Last Theorem (your elliptic curves course, Module 6–7) works by deforming Galois representations valued in GL2(ℤp)\mathrm{GL}_2(\mathbb{Z}_p) — the coefficient ring for the whole argument is a ring of pp-adic numbers. Iwasawa theory, pp-adic LL-functions, and pp-adic Hodge theory — some of the most active machinery in current arithmetic geometry — are built entirely on the objects in this course. You cannot go much further into modern number theory without them.

Keep this as the throughline: everything below is one idea — that “distance” on ℚ\mathbb{Q} is not unique, and every legitimate alternative gives you a new, complete, useful number system — examined from every angle mathematicians have found useful (algebraic, topological, analytic, arithmetic) over about 130 years.


2. History and intellectual lineage

As with the elliptic curves course: textbooks present this in logical order (axioms → construction → theorems), which is not the order it was actually discovered in. Here is the real order.

Period Who What happened
1882 Richard Dedekind & Heinrich Weber Publish a rigorous theory of algebraic functions of one variable that deliberately mirrors Dedekind’s theory of algebraic numbers — establishing the dictionary “points on a curve ↔\leftrightarrow primes of a number ring” that Hensel would later exploit directly.
1897 Kurt Hensel Publishes “Über eine neue Begründung der Theorie der algebraischen Zahlen”, introducing the pp-adic numbers as formal power series ∑aipi\sum a_i p^i in a prime pp — explicitly modeled on Laurent/Taylor expansions of functions near a point, per the function-field analogy of §1. This is the birth of ℚp\mathbb{Q}_p, though Hensel’s original presentation was formal/algebraic rather than metric.
1902–1908 Kurt Hensel Develops what becomes known as Hensel’s Lemma — a pp-adic analogue of Newton’s method for lifting approximate roots of polynomials to exact ones — in the course of working out the arithmetic of his new numbers.
1912 József Kürschák Formalizes the general notion of an absolute value (valuation) on an arbitrary field and proves that any valued field can be completed, exactly as Cantor/Weierstrass had completed ℚ\mathbb{Q} into ℝ\mathbb{R} — this is the paper that puts Hensel’s pp-adic numbers on the same metric-completion footing as ℝ\mathbb{R}, retroactively.
1916 Alexander Ostrowski Proves Ostrowski’s theorem: every nontrivial absolute value on ℚ\mathbb{Q} is equivalent to either the usual absolute value or a pp-adic absolute value for some prime pp — closing the classification and making precise the “ℝ\mathbb{R} is just one place among many” picture from §1.
Early 1920s Helmut Hasse (building on Hermann Minkowski’s earlier work on quadratic forms over ℤ\mathbb{Z}) Proves the Hasse–Minkowski theorem: a quadratic form over ℚ\mathbb{Q} has a nontrivial rational zero if and only if it has one over ℝ\mathbb{R} and over every ℚp\mathbb{Q}_p — the first major local-global principle, and the template for a huge amount of later number theory.
1920s–1930s Hasse, F. K. Schmidt, Claude Chevalley, Emil Artin Develop local class field theory — a complete description of the abelian extensions of ℚp\mathbb{Q}_p in terms of the topological group ℚp×\mathbb{Q}_p^\times — the local counterpart to Artin’s global reciprocity law, and a model result that shaped how local fields are studied ever since.
1930s–1940s Chevalley, later André Weil and John Tate Introduce ideles and adeles — the ring 𝔸ℚ\mathbb{A}_\mathbb{Q} that packages ℝ\mathbb{R} and every ℚp\mathbb{Q}_p into one single topological ring, letting number theorists work “at all places simultaneously.”
1950 John Tate In his Princeton PhD thesis, reproves the analytic continuation and functional equation of the Riemann zeta function (and Hecke LL-functions) using harmonic analysis on the adeles/ideles — a landmark demonstration that pp-adic and real analysis, treated uniformly, reorganize classical analytic number theory.
1959–1964 Kenkichi Iwasawa; Tomio Kubota & Heinrich-Wolfgang Leopoldt Iwasawa studies how class groups grow through infinite towers of number fields using pp-adic methods, founding Iwasawa theory. Kubota–Leopoldt (1964) construct the first pp-adic LL-function, interpolating the values of the Riemann zeta function at negative integers pp-adically — turning classical (Kummer, 19th c.) congruences between Bernoulli numbers into a single continuous pp-adic analytic object.
1960 Bernard Dwork Proves the rationality of zeta functions of varieties over finite fields (the first of the Weil conjectures) using purely pp-adic analytic methods — a spectacular early demonstration that pp-adic analysis can resolve problems with no visible connection to pp-adic numbers on the surface.
1972–1974 Barry Mazur; Mazur & Peter Swinnerton-Dyer Extend Iwasawa theory to elliptic curves, and construct pp-adic LL-functions attached to elliptic curves — directly setting up the machinery behind the (still partly open) pp-adic analogue of the Birch and Swinnerton-Dyer conjecture. (This is the same Mazur as the torsion classification theorem in your elliptic curves course, Module 4 — one mathematician, two load-bearing results in adjacent fields.)
Late 1970s–1980s Jean-Marc Fontaine (with later contributions from Gerd Faltings) Develop pp-adic Hodge theory — a dictionary comparing the pp-adic étale cohomology of varieties over pp-adic fields with more classical (de Rham, crystalline) cohomology theories, resolving deep comparison conjectures and giving pp-adic geometry a toolset as rich as complex geometry’s.
1993–1995 Andrew Wiles, with Richard Taylor Prove modularity for semistable elliptic curves — and with it, Fermat’s Last Theorem — by studying deformations of Galois representations valued in GL2(ℤp)\mathrm{GL}_2(\mathbb{Z}_p). The entire deformation-theoretic argument (the “R=𝕋R=\mathbb{T}” theorem) is conducted inside complete local rings built from ℤp\mathbb{Z}_p; without pp-adic numbers as a coefficient system, the proof has no home to live in.
2012 onward Peter Scholze Introduces perfectoid spaces, a new foundation for pp-adic geometry that dramatically simplifies and extends pp-adic Hodge theory and proves major new comparison and duality results; awarded the Fields Medal in 2018 substantially for this work. Along with collaborators (Fargues, Bhatt, and others), this remains one of the most active research frontiers in arithmetic geometry today.

Two threads worth sitting with, the same way the elliptic curves history rewarded it: first, notice that pp-adic numbers were not discovered by someone trying to build a new number system for its own sake — Hensel was trying to import a well-understood tool (local power series expansions) from function theory into number theory, and the “new number system” was a side effect of doing that rigorously. That is a recurring shape in mathematics: transplant a working method from one domain into a structurally analogous domain, and often the destination domain didn’t even have the right objects yet for the method to act on — you have to build them first. Second, notice the same long-incubation-then-surprising-collapse pattern as the Taniyama–Shimura story: a construction from 1897 (Hensel) sits as a relatively niche tool for nearly a century before becoming indispensable — not optional, indispensable — to resolving a 350-year-old problem (Wiles, 1995) that has nothing to do with power series on its face. The p-adic numbers and the elliptic curves course are not two separate stories; by 1994 they are the same story.

Sources consulted for this section: Fernando Q. Gouvêa, “Hensel’s p-adic Numbers: Early History”, Kurt Hensel — MacTutor History of Mathematics, P-adic number — Encyclopedia of Mathematics, P-adic valuation — Wikipedia, P-adic analysis — Wikipedia, An introduction to p-adic L-functions, arXiv:2309.15692.


3. Foundations, built from scratch toward completion

The elliptic curves course rebuilt groups/rings/fields from scratch en route to the group law. This course needs a different kind of scaffolding: not new algebraic structures, but a new metric structure on a field you already know everything about algebraically (ℚ\mathbb{Q}). Everything here points at one destination: understanding, precisely, what it means to complete ℚ\mathbb{Q} “at a prime” instead of “at infinity.”

3.1 Absolute values on a field

An absolute value on a field KK is a function |⋅|:K→ℝ≥0|\cdot|: K \to \mathbb{R}_{\ge 0} satisfying, for all x,y∈Kx, y \in K:

The familiar example on ℚ\mathbb{Q} is |x|∞|x|_\infty, ordinary absolute value. There’s also always the trivial absolute value (|0|=0|0|=0, |x|=1|x|=1 otherwise), which is excluded from Ostrowski’s classification because it induces the discrete topology and generates no interesting completion. Two absolute values are equivalent if one is a positive real power of the other (equivalently, if they define the same convergent sequences / the same topology).

3.2 The pp-adic valuation and absolute value

Fix a prime pp. Every nonzero rational number xx can be written uniquely as x=pn⋅ab,n∈ℤ,a,b∈ℤ,p∤a,p∤b.x = p^n \cdot \frac{a}{b}, \qquad n \in \mathbb{Z}, \ \ a, b \in \mathbb{Z}, \ \ p \nmid a, \ \ p \nmid b. Define the pp-adic valuation vp(x):=nv_p(x) := n (and vp(0):=+∞v_p(0) := +\infty by convention). This is the exact power of pp dividing xx, extended sensibly to fractions — for instance v5(50)=2v_5(50) = 2, v5(1/125)=−3v_5(1/125) = -3, v5(6/7)=0v_5(6/7) = 0. The valuation satisfies: vp(xy)=vp(x)+vp(y),vp(x+y)≥min⁡(vp(x),vp(y)),v_p(xy) = v_p(x) + v_p(y), \qquad v_p(x+y) \ge \min(v_p(x), v_p(y)), with equality in the second whenever vp(x)≠vp(y)v_p(x) \ne v_p(y) — a fact that does all the real work in this course, so hold onto it.

The pp-adic absolute value is then |x|p:=p−vp(x)|x|_p := p^{-v_p(x)} (and |0|p:=0|0|_p := 0). Translating the valuation properties: |xy|p=|x|p|y|p|xy|_p = |x|_p |y|_p (multiplicative, as required) and |x+y|p≤max⁡(|x|p,|y|p),|x + y|_p \le \max(|x|_p, |y|_p), the ultrametric or strong triangle inequality — strictly stronger than the ordinary triangle inequality (max⁡(a,b)≤a+b\max(a,b) \le a+b always), and the source of every strange, beautiful fact about pp-adic geometry in Module 3.

3.3 Ostrowski’s theorem

Theorem (Ostrowski, 1916). Every nontrivial absolute value on ℚ\mathbb{Q} is equivalent to |⋅|∞|\cdot|_\infty or to |⋅|p|\cdot|_p for exactly one prime pp.

This is the precise statement behind §1’s claim that ℝ\mathbb{R} is “one place among many.” The set of places of ℚ\mathbb{Q} is {∞,2,3,5,7,11,…}\{\infty, 2, 3, 5, 7, 11, \dots\} — one archimedean place, one for each prime — and Ostrowski’s theorem says this list is exhaustive: there is no other way to measure distance on ℚ\mathbb{Q} that respects the field operations.

3.4 The ultrametric world

The strong triangle inequality forces a cascade of facts that feel wrong the first time you see them and become obvious the second:

None of this is pathology to be tolerated — it’s a clean, self-consistent, different geometry, and Module 3 works through it directly.

3.5 Completion

Recall (or take on faith) how ℝ\mathbb{R} is built from ℚ\mathbb{Q}: take Cauchy sequences of rationals with respect to |⋅|∞|\cdot|_\infty, declare two sequences equivalent if their difference tends to 00, and the equivalence classes form a new field into which ℚ\mathbb{Q} embeds densely, and which is now genuinely complete (every Cauchy sequence converges). ℚp\mathbb{Q}_p is built by the identical construction, verbatim, with |⋅|p|\cdot|_p in place of |⋅|∞|\cdot|_\infty: Cauchy sequences of rationals with respect to |⋅|p|\cdot|_p, modulo sequences whose difference is pp-adically small. That’s it — that’s the entire definition. Module 2 gives two more (equivalent) concrete ways to get your hands on the resulting field, because “an equivalence class of Cauchy sequences” is a correct but unusable way to actually compute.

Where to go deeper on this section alone: Kürschák’s original generalization of completion to arbitrary valued fields is still the cleanest statement of why this construction always works, for any absolute value on any field; see the historical sources in §2 and Serre’s A Course in Arithmetic, Ch. II for a modern, terse treatment covering §3.1–3.4 in about 15 pages.


4. Coursework

Eight modules. Each has learning objectives, exposition, one fully worked numerical example, and a problem set. Full solutions are in §7 — work the problems first.

Module 1 — Absolute values and Ostrowski’s theorem

Objectives: verify |⋅|p|\cdot|_p satisfies the absolute value axioms and the ultrametric inequality; compute pp-adic absolute values by hand; state Ostrowski’s theorem and the product formula.

Exposition. See §3.2–3.3. One more essential fact to add to your toolkit, because it ties every place of ℚ\mathbb{Q} together into a single constraint: the product formula. For any nonzero x∈ℚx \in \mathbb{Q}, |x|∞⋅∏p prime|x|p=1|x|_\infty \cdot \prod_{p \text{ prime}} |x|_p = 1 (a finite product in practice, since |x|p=1|x|_p = 1 for all but finitely many pp — exactly those pp dividing the numerator or denominator of xx). This says the “sizes” of xx at every place are not independent; they’re constrained to multiply to exactly 11. It’s the first hint that treating all the places together (the adelic viewpoint, §2, 1930s–40s) is not just a convenience but reflects a real structural fact about ℚ\mathbb{Q}.

Worked example. Let x=3007=22⋅3⋅527x = \frac{300}{7} = \frac{2^2 \cdot 3 \cdot 5^2}{7}. - v2(x)=2⇒|x|2=2−2=1/4v_2(x) = 2 \Rightarrow |x|_2 = 2^{-2} = 1/4. - v3(x)=1⇒|x|3=1/3v_3(x) = 1 \Rightarrow |x|_3 = 1/3. - v5(x)=2⇒|x|5=1/25v_5(x) = 2 \Rightarrow |x|_5 = 1/25. - v7(x)=−1⇒|x|7=7v_7(x) = -1 \Rightarrow |x|_7 = 7. - All other primes: |x|p=1|x|_p = 1. - |x|∞=300/7|x|_\infty = 300/7.

Check the product formula: 3007⋅14⋅13⋅125⋅7=300⋅77⋅4⋅3⋅25=21002100=1.\frac{300}{7} \cdot \frac{1}{4} \cdot \frac{1}{3} \cdot \frac{1}{25} \cdot 7 = \frac{300 \cdot 7}{7 \cdot 4 \cdot 3 \cdot 25} = \frac{2100}{2100} = 1. ✓.

Problem set 1. 1. Compute |−72|2|{-72}|_2, |−72|3|{-72}|_3, and |−72|5|{-72}|_5. 2. Prove the ultrametric inequality |x+y|p≤max⁡(|x|p,|y|p)|x+y|_p \le \max(|x|_p,|y|_p) directly from vp(x+y)≥min⁡(vp(x),vp(y))v_p(x+y) \ge \min(v_p(x),v_p(y)). 3. Prove that if |x|p≠|y|p|x|_p \ne |y|_p, then |x+y|p=max⁡(|x|p,|y|p)|x+y|_p = \max(|x|_p, |y|_p) exactly. (This is the “isosceles triangle” fact from §3.4 — prove it, don’t just cite it.) 4. Verify the product formula for x=−1825x = -\frac{18}{25}.


Module 2 — Constructing ℚp\mathbb{Q}_p, three ways

Objectives: understand ℚp\mathbb{Q}_p as a completion by Cauchy sequences, as an inverse limit lim⁡←ℤ/pnℤ\lim_{\leftarrow} \mathbb{Z}/p^n\mathbb{Z}, and via base-pp digit expansions — and see why the three agree.

Exposition. Three equivalent constructions, useful for different purposes:

  1. Cauchy sequences (§3.5): the abstract, general-purpose construction — guarantees completeness for free, since it’s the same machine that builds ℝ\mathbb{R}.
  2. Inverse limit. Define ℤp:=lim⁡←nℤ/pnℤ\mathbb{Z}_p := \lim_{\leftarrow}_n \mathbb{Z}/p^n\mathbb{Z} — a compatible sequence of elements (a1,a2,a3,…)(a_1, a_2, a_3, \dots) with an∈ℤ/pnℤa_n \in \mathbb{Z}/p^n\mathbb{Z} and an+1≡an(modpn)a_{n+1} \equiv a_n \;(\mathrm{mod}\;p^n). This is the most computationally honest picture: a pp-adic integer is exactly “know your value mod pp, and mod p2p^2, and mod p3,…p^3, \dots, consistently, forever.” ℚp\mathbb{Q}_p is then the fraction field of ℤp\mathbb{Z}_p (equivalently, ℤp[1/p]\mathbb{Z}_p[1/p]).
  3. Digit expansions. Every element of ℤp\mathbb{Z}_p has a unique representation a0+a1p+a2p2+a3p3+⋯,ai∈{0,1,…,p−1},a_0 + a_1 p + a_2 p^2 + a_3 p^3 + \cdots, \qquad a_i \in \{0, 1, \dots, p-1\}, converging pp-adically (the terms shrink: |aipi|p=p−i→0|a_i p^i|_p = p^{-i} \to 0). Elements of ℚp\mathbb{Q}_p allow finitely many negative powers of pp too: ∑i≥Naipi\sum_{i \ge N} a_i p^i for some N∈ℤN \in \mathbb{Z} (possibly negative). This is precisely the picture from §1: an ordinary decimal ∑i≥−Nai10−i\sum_{i \ge -N} a_i 10^{-i} extends infinitely to the right; a pp-adic expansion extends infinitely to the left. ℤ\mathbb{Z} sits inside ℤp\mathbb{Z}_p as exactly the expansions that terminate (are eventually all zero, reading leftward) — well, more precisely, non-negative integers have finite expansions, and negative integers have expansions that are eventually constant at p−1p-1 (see the worked example).

Worked example. Find the 55-adic expansion of −1-1. Note pn−1=(p−1)+(p−1)p+⋯+(p−1)pn−1p^n - 1 = (p-1) + (p-1)p + \cdots + (p-1)p^{n-1} for every nn (just expand (p−1)(1+p+⋯+pn−1)=pn−1(p-1)(1 + p + \cdots + p^{n-1}) = p^n - 1). So the partial sums Sn=4+4⋅5+4⋅52+⋯+4⋅5n−1=5n−1S_n = 4 + 4\cdot5 + 4\cdot5^2 + \cdots + 4\cdot5^{n-1} = 5^n - 1 satisfy |Sn−(−1)|5=|5n|5=5−n→0|S_n - (-1)|_5 = |5^n|_5 = 5^{-n} \to 0. So −1=4+4⋅5+4⋅52+4⋅53+⋯in ℤ5,-1 = 4 + 4\cdot 5 + 4\cdot 5^2 + 4 \cdot 5^3 + \cdots \quad \text{in } \mathbb{Z}_5, i.e. −1-1 is the 55-adic number “…44444\dots 44444” — an infinite string of 44’s extending left, the direct analogue of −1=…999.0-1 = \dots 999.0 in a “10-adic” sense (informally; 1010 isn’t prime, but the intuition — infinitely many leftward 99’s — is exactly the same phenomenon, and is in fact used as a popular-explainer trick for why …999=−1\dots 999 = -1 in the 1010-adics, which do exist as a ring, just not a field, since 1010 isn’t prime).

Problem set 2. 1. Find the 77-adic expansion of 1/21/2 (hint: find a0∈{0,…,6}a_0 \in \{0,\dots,6\} with 2a0≡1(mod7)2a_0 \equiv 1 \;(\mathrm{mod}\;7) first, then continue digit by digit, or use that 1/2=(1+6)/2−3=…1/2 = (1 + 6)/2 - 3= \dots; more directly, solve 2x≡1(mod7n)2x \equiv 1 \;(\mathrm{mod}\;7^n) for increasing nn and read off digits). 2. Show that the integer embedding ℤ↪ℤp\mathbb{Z} \hookrightarrow \mathbb{Z}_p is injective (i.e. no two distinct integers become pp-adically equal) but not surjective (exhibit an explicit element of ℤp\mathbb{Z}_p, other than via the −1-1 example above, that cannot equal any integer). 3. Prove that every element of ℤp\mathbb{Z}_p is a pp-adic limit of a sequence of ordinary integers (i.e. ℤ\mathbb{Z} is dense in ℤp\mathbb{Z}_p). 4. Explain concretely why the inverse-limit description (a1,a2,a3,…)∈lim⁡←ℤ/pnℤ(a_1, a_2, a_3, \dots) \in \lim_{\leftarrow} \mathbb{Z}/p^n\mathbb{Z} and the digit-expansion description ∑aipi\sum a_i p^i are “the same data” — what is ana_n in terms of the digits a0,…,an−1a_0, \dots, a_{n-1}?


Module 3 — The topology of ℚp\mathbb{Q}_p

Objectives: work directly with the ultrametric consequences from §3.4; prove ℤp\mathbb{Z}_p is compact; understand total disconnectedness.

Exposition. ℤp={x∈ℚp:|x|p≤1}\mathbb{Z}_p = \{x \in \mathbb{Q}_p : |x|_p \le 1\} is the closed unit ball, and it is compact — genuinely different from ℝ\mathbb{R}, where closed balls (bounded closed intervals) are compact too, but the reason is different and more combinatorial here. Via the inverse-limit picture, ℤp⊂∏nℤ/pnℤ\mathbb{Z}_p \subset \prod_n \mathbb{Z}/p^n\mathbb{Z} is a closed subset of a product of finite (hence compact) discrete spaces, so it’s compact by Tychonoff’s theorem — or, more hands-on, by a digit-by-digit pigeonhole/diagonalization argument identical in spirit to Bolzano–Weierstrass. ℚp\mathbb{Q}_p itself is locally compact (a union of countably many translates/scalings of the compact ℤp\mathbb{Z}_p) but not compact, and it is totally disconnected (§3.4: clopen balls everywhere means no nontrivial connected subsets) yet not discrete (points still have accumulation points — ℤ\mathbb{Z} is dense in ℤp\mathbb{Z}_p, by Problem 2.3). This combination — totally disconnected, not discrete, locally compact — is characteristic of pp-adic-type spaces and has no analogue in ℝ\mathbb{R}.

Worked example. Show B(0,1)=ℤpB(0,1) = \mathbb{Z}_p and B(1,1/p)⊂ℤpB(1, 1/p) \subset \mathbb{Z}_p are either disjoint or nested with the “big” ball ℤp\mathbb{Z}_p, never crossing. Take a=0,r=1a=0, r=1 and b=1,s=1/pb=1, s=1/p (radius p−1p^{-1}, i.e. |x−1|p≤1/p|x - 1|_p \le 1/p, i.e. x≡1(modp)x \equiv 1 \;(\mathrm{mod}\;p)). Every xx with x≡1(modp)x \equiv 1 \;(\mathrm{mod}\;p) automatically has |x|p≤1|x|_p \le 1 (since x=1+p(⋯)x = 1 + p(\cdots), and both terms are in ℤp\mathbb{Z}_p), so B(1,1/p)⊂B(0,1)B(1,1/p) \subset B(0,1) — fully nested, not overlapping-but-distinct, exactly as the general clopen-balls fact in §3.4 predicts.

Problem set 3. 1. Prove directly (no citing §3.4) that if c∈B(a,r)c \in B(a,r) then B(c,r)=B(a,r)B(c,r) = B(a,r), using only the ultrametric inequality. 2. Prove ℤp\mathbb{Z}_p is compact using the digit-expansion picture: given a sequence of elements of ℤp\mathbb{Z}_p, construct a convergent subsequence by successively passing to subsequences that agree in more and more leading digits. 3. Exhibit two closed balls in ℚp\mathbb{Q}_p of the same radius that are disjoint, and two of different radii, one properly containing the other — and explain why “partially overlapping, neither nested nor disjoint” is impossible in general. 4. ℚp\mathbb{Q}_p is totally disconnected, so in particular it contains no interval-like connected piece — yet it’s uncountable and every point is a limit of other points (it’s not discrete). Reconcile these two facts in your own words: what does “no small connected pieces but also no isolated points” actually look like, concretely, in the digit-expansion picture?


Module 4 — Hensel’s Lemma

Objectives: state and apply Hensel’s Lemma (both the simple-root form and the Newton-iteration form); use it to decide solvability of polynomial equations in ℤp\mathbb{Z}_p.

Exposition. This is the payoff for building a complete field: it lets you turn a finite check (does a polynomial have a root mod pp?) into an exact, infinite-precision statement (does it have a root in ℤp\mathbb{Z}_p?).

Hensel’s Lemma (simple form). Let f(x)∈ℤp[x]f(x) \in \mathbb{Z}_p[x], and suppose a∈ℤpa \in \mathbb{Z}_p satisfies f(a)≡0(modp)f(a) \equiv 0 \;(\mathrm{mod}\;p) and f′(a)≢0(modp)f'(a) \nequiv 0 \;(\mathrm{mod}\;p). Then there is a unique α∈ℤp\alpha \in \mathbb{Z}_p with f(α)=0f(\alpha) = 0 and α≡a(modp)\alpha \equiv a \;(\mathrm{mod}\;p).

The proof is literally Newton’s method, made rigorous by the ultrametric inequality instead of real-analytic estimates: iterate an+1=an−f(an)/f′(an)a_{n+1} = a_n - f(a_n)/f'(a_n), and show |an+1−an|p|a_{n+1} - a_n|_p shrinks fast enough (in fact doubles the number of correct pp-adic digits at each step, just like Newton’s method doubles decimal digits of precision over ℝ\mathbb{R}) that the sequence is Cauchy and its limit is an exact root. A sharper version (Hensel’s Lemma, general form) drops the “simple root” requirement f′(a)≢0f'(a) \nequiv 0 and instead only needs |f(a)|p<|f′(a)|p2|f(a)|_p < |f'(a)|_p^2 — the same conclusion follows, with α\alpha uniquely determined by being close enough to aa.

Worked example. Does 2\sqrt{2} exist in ℤ7\mathbb{Z}_7? Take f(x)=x2−2f(x) = x^2 - 2. Mod 7: 32=9≡23^2 = 9 \equiv 2, so a=3a=3 works: f(3)=7≡0(mod7)f(3) = 7 \equiv 0 \;(\mathrm{mod}\;7). And f′(x)=2xf'(x) = 2x, so f′(3)=6≢0(mod7)f'(3) = 6 \nequiv 0 \;(\mathrm{mod}\;7). Hensel’s Lemma applies: there’s a unique α∈ℤ7\alpha \in \mathbb{Z}_7 with α≡3(mod7)\alpha \equiv 3 \;(\mathrm{mod}\;7) and α2=2\alpha^2 = 2. (There’s a second root too, ≡−3≡4(mod7)\equiv -3 \equiv 4 \;(\mathrm{mod}\;7), by the same argument with a=4a=4 — the two square roots of 22 in ℤ7\mathbb{Z}_7, just as ±2\pm\sqrt2 are the two square roots in ℝ\mathbb{R}.) One Newton step to sharpen: a1=3−32−22⋅3=3−76a_1 = 3 - \frac{3^2-2}{2\cdot3} = 3 - \frac{7}{6}. Working mod 4949: 6−1≡41(mod49)6^{-1} \equiv 41 \;(\mathrm{mod}\;49) (since 6⋅41=246=5⋅49+16 \cdot 41 = 246 = 5\cdot49+1), so a1≡3−7⋅41=3−287≡3−287+294=10(mod49)a_1 \equiv 3 - 7\cdot41 = 3 - 287 \equiv 3 - 287 + 294 = 10 \;(\mathrm{mod}\;49). Check: 102=100≡100−49−49=2(mod49)10^2 = 100 \equiv 100-49-49 = 2 \;(\mathrm{mod}\;49). ✓ — so 2≡10(mod49)\sqrt2 \equiv 10 \;(\mathrm{mod}\;49) in ℤ7\mathbb{Z}_7, i.e. 2=3+1⋅7+O(72)\sqrt2 = 3 + 1\cdot7 + O(7^2).

Problem set 4. 1. Does x2=2x^2 = 2 have a solution in ℚ3\mathbb{Q}_3? Check solvability mod 33 first, then decide whether Hensel’s Lemma applies or definitively rules it out. 2. For which odd primes pp does x2=−1x^2 = -1 have a solution in ℤp\mathbb{Z}_p? (Hint: this is a question about squares mod pp you may already know from elementary number theory — connect it explicitly to that fact.) 3. Find a cube root of 11 in ℤ7\mathbb{Z}_7 other than 11 itself (i.e. a nontrivial solution of x3=1x^3 = 1), using Hensel’s Lemma starting from a root mod 77. 4. Explain in your own words why Hensel’s Lemma can fail to directly decide the case f′(a)≡0(modp)f'(a) \equiv 0 \;(\mathrm{mod}\;p) (the excluded case) — construct a specific small example of a polynomial and a prime where f(a)≡0f(a)\equiv 0, f′(a)≡0(modp)f'(a) \equiv 0 \;(\mathrm{mod}\;p), and there is genuinely no root of ff congruent to aa mod pp in ℤp\mathbb{Z}_p, to see the hypothesis is load-bearing.


Module 5 — Algebraic structure: ℤp\mathbb{Z}_p as a complete DVR

Objectives: understand ℤp\mathbb{Z}_p as a local ring with a unique maximal ideal and residue field 𝔽p\mathbb{F}_p; understand the structure of the unit group ℤp×\mathbb{Z}_p^\times.

Exposition. ℤp\mathbb{Z}_p is an integral domain, and vpv_p makes it into a discrete valuation ring (DVR): every nonzero ideal is a power of the unique maximal ideal 𝔪=pℤp={x:vp(x)≥1}\mathfrak{m} = p\mathbb{Z}_p = \{x : v_p(x) \ge 1\}. It is a local ring — there is exactly one maximal ideal, so exactly one “place” left to worry about once you’re already inside it — and its residue field ℤp/pℤp≅𝔽p\mathbb{Z}_p/p\mathbb{Z}_p \cong \mathbb{F}_p is exactly the finite field you already know from modular arithmetic. Every nonzero element of ℚp\mathbb{Q}_p factors uniquely as pnup^n u with n=vp(x)∈ℤn=v_p(x) \in \mathbb{Z} and u∈ℤp×u \in \mathbb{Z}_p^\times (a unit, i.e. |u|p=1|u|_p = 1, i.e. u≢0(modp)u \nequiv 0 \;(\mathrm{mod}\;p)) — the pp-adic analogue of scientific notation, with pnp^n playing the role of the “exponent” and uu the “mantissa,” except the mantissa here is an entire pp-adic integer, not a bounded decimal.

The unit group has a clean structure. For pp odd: ℤp×≅μp−1×(1+pℤp)≅ℤ/(p−1)ℤ×ℤp,\mathbb{Z}_p^\times \;\cong\; \mu_{p-1} \times (1+p\mathbb{Z}_p) \;\cong\; \mathbb{Z}/(p-1)\mathbb{Z} \times \mathbb{Z}_p, where μp−1\mu_{p-1} is the group of (p−1)(p-1)-th roots of unity (via the Teichmüller lift, a canonical way to lift each nonzero residue mod pp to an exact root of unity in ℤp\mathbb{Z}_p, using Hensel’s Lemma on xp−1−1x^{p-1}-1), and the “11-units” 1+pℤp1+p\mathbb{Z}_p form a group isomorphic to (ℤp,+)(\mathbb{Z}_p, +) via the pp-adic logarithm (Module 6). For p=2p=2 the statement needs a small patch (ℤ2×≅ℤ/2ℤ×ℤ2\mathbb{Z}_2^\times \cong \mathbb{Z}/2\mathbb{Z} \times \mathbb{Z}_2, generated by −1-1 and the 11-units 1+4ℤ21+4\mathbb{Z}_2 rather than 1+2ℤ21+2\mathbb{Z}_2) — the recurring pattern that p=2p=2 is the annoying exception throughout this subject, exactly as it is in ordinary elementary number theory.

Worked example. Decompose 17∈ℤ5×17 \in \mathbb{Z}_5^\times into its Teichmüller part times a 11-unit. 17≡2(mod5)17 \equiv 2 \;(\mathrm{mod}\;5). The Teichmüller lift ω(2)\omega(2) is the unique 44th root of unity in ℤ5\mathbb{Z}_5 congruent to 2mod⁡52 \bmod 5 (since μ4={1,2,3,4}mod⁡5\mu_4 = \{1,2,3,4\} \bmod 5 under the iso 𝔽5×≅ℤ/4\mathbb{F}_5^\times \cong \mathbb{Z}/4). One can compute ω(2)≡2+O(5)\omega(2) \equiv 2 + O(5), refined by Hensel on x4−1x^4-1: mod 25, need x≡2(mod5)x \equiv 2 \;(\mathrm{mod}\;5) with x4≡1(mod25)x^4\equiv1\;(\mathrm{mod}\;25); try x=7x=7: 74=2401=96⋅25+17^4 = 2401 = 96\cdot25+1, so 74≡1(mod25)7^4\equiv1\;(\mathrm{mod}\;25) ✓, and 7≡2(mod5)7\equiv2\;(\mathrm{mod}\;5) ✓. So ω(2)≡7(mod25)\omega(2) \equiv 7 \;(\mathrm{mod}\;25). Then 17/ω(2)≡17/7(mod25)17/\omega(2) \equiv 17/7 \;(\mathrm{mod}\;25); 7−1≡18(mod25)7^{-1}\equiv18\;(\mathrm{mod}\;25) (since 7⋅18=126=5⋅25+17\cdot18=126=5\cdot25+1), so 17⋅18=306≡306−12⋅25=6(mod25)17\cdot18=306\equiv306-12\cdot25=6\;(\mathrm{mod}\;25) — and 6≡1(mod5)6 \equiv 1 \;(\mathrm{mod}\;5) as required of a 11-unit. So 17=ω(2)⋅u17 = \omega(2) \cdot u with ω(2)≡7\omega(2) \equiv 7, u≡6(mod25)u \equiv 6 \;(\mathrm{mod}\;25), both refinable to arbitrary precision.

Problem set 5. 1. Prove ℤp\mathbb{Z}_p is a local ring directly: show every element not in pℤpp\mathbb{Z}_p is a unit (has a multiplicative inverse in ℤp\mathbb{Z}_p). 2. List all the roots of unity in ℚ7\mathbb{Q}_7. (Use the unit group structure theorem — how many roots of unity of each possible order can there be, and why does 7−1=67-1=6 matter here?) 3. Explain concretely why p=2p=2 breaks the clean μp−1×(1+pℤp)\mu_{p-1}\times(1+p\mathbb{Z}_p) splitting — what goes wrong if you try to apply Hensel’s Lemma to xp−1−1=x0−1x^{p-1}-1 = x^0 - 1 style reasoning when p=2p=2? 4. True or false, with justification: every element of ℤp×\mathbb{Z}_p^\times is a root of unity times a power of pp times… — actually, is every unit itself expressible as (root of unity) ×\times (element 1+pℤp1 + p\mathbb{Z}_p), uniquely? What breaks if you drop uniqueness?


Module 6 — pp-adic analysis: series, exp, and log

Objectives: state and use the (surprisingly simple) pp-adic series convergence test; define exp⁡p\exp_p and log⁡p\log_p and know their radii of convergence; contrast sharply with real analysis.

Exposition. Here is the single most pleasant fact in elementary pp-adic analysis, a direct payoff of the ultrametric inequality: a series ∑n=0∞an\sum_{n=0}^\infty a_n of pp-adic numbers converges if and only if an→0a_n \to 0. (Contrast with ℝ\mathbb{R}: an→0a_n \to 0 is necessary but famously not sufficient — the harmonic series ∑1/n→0\sum 1/n \to 0 termwise but diverges. No such counterexample can exist pp-adically; the ultrametric inequality applied to partial sums makes “terms shrink to zero” automatically force the partial sums to be Cauchy.) This single fact makes checking convergence of pp-adic series dramatically more mechanical than in ordinary analysis — you never need ratio tests, comparison tests, or alternating series tricks; you just check vp(an)→∞v_p(a_n) \to \infty.

The pp-adic exponential and logarithm are defined by the same power series as their real/complex counterparts, but their convergence behavior is quite different because of the factorials involved (and vp(n!)v_p(n!) grows, but only like n/(p−1)n/(p-1), by Legendre’s formula, not fast enough to guarantee convergence everywhere the way it does over ℂ\mathbb{C}): exp⁡p(x)=∑n=0∞xnn!converges for vp(x)>1p−1,\exp_p(x) = \sum_{n=0}^\infty \frac{x^n}{n!} \quad \text{converges for } v_p(x) > \tfrac{1}{p-1}, log⁡p(1+x)=∑n=1∞(−1)n−1xnnconverges for vp(x)≥1.\log_p(1+x) = \sum_{n=1}^\infty \frac{(-1)^{n-1} x^n}{n} \quad \text{converges for } v_p(x) \ge 1. For pp odd, 1p−1≤12<1\frac{1}{p-1} \le \frac12 < 1, so exp⁡p\exp_p converges (at least) on all of pℤpp\mathbb{Z}_p; for p=2p=2 you need the sharper v2(x)≥2v_2(x) \ge 2, i.e. x∈4ℤ2x \in 4\mathbb{Z}_2 — the p=2p=2 exception again. On their common domain of convergence, exp⁡p\exp_p and log⁡p\log_p are mutually inverse and give the isomorphism (1+pℤp,×)≅(pℤp,+)≅(ℤp,+)(1+p\mathbb{Z}_p, \times) \cong (p\mathbb{Z}_p, +) \cong (\mathbb{Z}_p,+) promised in Module 5.

Worked example. Does $_{n=1}^n! $ converge in ℚp\mathbb{Q}_p for any pp? No series test needed beyond the one fact above: vp(n!)→∞v_p(n!) \to \infty as n→∞n \to \infty (Legendre’s formula: vp(n!)=∑i≥1⌊n/pi⌋≥(n−sp(n))/(p−1)→∞v_p(n!) = \sum_{i\ge1} \lfloor n/p^i \rfloor \ge (n - s_p(n))/(p-1) \to \infty), so |n!|p→0|n!|_p \to 0, so yes, ∑n!\sum n! converges pp-adically for every prime pp — a series that diverges (to ∞\infty) in every conceivable real sense converges perfectly well pp-adically. This is a genuinely good example to keep in your back pocket for how differently “convergence” behaves in the two worlds.

Problem set 6. 1. Determine, for each prime pp, whether ∑n=1∞pn/n\sum_{n=1}^\infty p^n/n converges in ℚp\mathbb{Q}_p. 2. Compute log⁡p(1+p)\log_p(1+p) to three terms (as a series in powers of pp) for p=5p=5, and simplify as far as you can. 3. Prove the “term test” (convergence ⇔an→0\iff a_n \to 0) for pp-adic series, using only the ultrametric inequality applied to Sm−SnS_m - S_n for m>nm > n. 4. Contrast, explicitly, why ∑1/n\sum 1/n diverges in ℝ\mathbb{R} despite 1/n→01/n \to 0, but the analogous danger cannot occur in ℚp\mathbb{Q}_p — what property of the ultrametric inequality is doing the work that the ordinary triangle inequality can’t provide?


Module 7 — The local-global principle

Objectives: state the Hasse–Minkowski theorem; work a concrete local-solvability check; understand that the principle is special to quadratic forms via the Selmer counterexample.

Exposition. Theorem (Hasse–Minkowski). A quadratic form Q(x1,…,xn)Q(x_1,\dots,x_n) with rational coefficients has a nontrivial zero in ℚn\mathbb{Q}^n if and only if it has a nontrivial zero in ℝn\mathbb{R}^n and a nontrivial zero in ℚpn\mathbb{Q}_p^n for every prime pp.

The remarkable content: checking infinitely many local conditions is, in practice, a finite computation — solvability mod pp for all but finitely many “bad” primes (those dividing the discriminant of the form) is automatic by Hensel’s Lemma applied to the smooth locus, so you only need to check ℝ\mathbb{R} and the finitely many bad primes directly. This “local conditions determine global existence” phenomenon is the philosophical ancestor of an enormous amount of modern arithmetic geometry.

It is emphatically not universal, though, and knowing where it breaks is as important as knowing where it holds. Selmer’s example (1951): the cubic curve 3x3+4y3+5z3=03x^3 + 4y^3 + 5z^3 = 0 has a nontrivial solution over ℝ\mathbb{R} and over ℚp\mathbb{Q}_p for every prime pp — yet has no nontrivial rational solution. Local-global fails outright once you leave quadratic forms. This failure is exactly what the Selmer group in elliptic curve descent theory (mentioned but not built out in your elliptic curves course, Module 5’s descent sketch) is built to measure — the Selmer group is precisely the obstruction group that’s nonzero exactly when local solvability everywhere fails to imply global solvability, for the specific descent equations that arise from halving points on an elliptic curve. Selmer’s own counterexample and the group named after him are the same underlying phenomenon, applied to two different-looking problems thirty years apart.

Worked example. Is 5x2+7y2=13z25x^2 + 7y^2 = 13z^2 nontrivially solvable over ℚ\mathbb{Q}? Check ℝ\mathbb{R}: yes trivially (indefinite form, e.g. plenty of real solutions by continuity/sign considerations — take zz large). Check small primes dividing the coefficients (5,7,135,7,13) and 22: mod 55, need 7y2≡13z27y^2 \equiv 13z^2, i.e. 2y2≡3z2(mod5)2y^2\equiv3z^2 \;(\mathrm{mod}\;5); try z=1z=1: need 2y2≡32y^2\equiv3, i.e. y2≡3⋅3=9≡4y^2\equiv3\cdot3=9\equiv4 (since 2−1≡3mod⁡52^{-1}\equiv3\bmod5), so y≡±2y\equiv\pm2 works — solvable mod 5, and since the relevant partial derivative is nonzero here, Hensel lifts this to a genuine solution in ℚ5\mathbb{Q}_5. Similarly one checks ℚ7\mathbb{Q}_7 and ℚ13\mathbb{Q}_{13} (both solvable by the same style of check) and ℚ2\mathbb{Q}_2. Since all local conditions hold, Hasse–Minkowski guarantees a rational solution exists — and indeed one can find it directly: (x,y,z)=(6,1,5)(x,y,z)=(6,1,5) gives 5⋅36+7⋅1=180+7=1875\cdot36+7\cdot1=180+7=187 and 13⋅25=32513\cdot25=325 — that particular guess doesn’t work, which is the point of the exercise (verifying local solvability is a genuine computation, not a formality) — Problem 1 below asks you to finish the job properly.

Problem set 7. 1. Finish checking local solvability of 5x2+7y2=13z25x^2+7y^2=13z^2 at all remaining relevant primes, and (harder, optional) search for an explicit rational solution guaranteed to exist by Hasse–Minkowski. 2. Explain precisely why checking “all but finitely many primes” is automatic for a quadratic form — which theorem from Module 4 is doing that work, and what property of the form at a “good” prime (one not dividing the discriminant) guarantees its hypotheses hold? 3. Selmer’s cubic has no rational point despite passing every local test. In your own words, explain what this tells you about the logical status of the local-global principle — is it a general theorem about ℚ\mathbb{Q}, or a special feature of quadratic forms specifically? What class of equations would you now be suspicious of, going in? 4. Conceptual, linking back to the elliptic curves course: the Selmer group of an elliptic curve E/ℚE/\mathbb{Q} sits in an exact sequence 0→E(ℚ)/2E(ℚ)→Sel2(E)→Ш(E)[2]→00 \to E(\mathbb{Q})/2E(\mathbb{Q}) \to \mathrm{Sel}_2(E) \to Ш(E)[2] \to 0, where ШШ (the Tate–Shafarevich group) is, essentially by definition, the group measuring exactly the Selmer-cubic-style failures for the specific curve EE. Given everything above, explain in your own words why computing the rank of E(ℚ)E(\mathbb{Q}) (Module 5 of the elliptic curves course) is fundamentally a local-global question, and why ШШ being potentially nonzero is what makes rank computation hard in general.


Module 8 — Modern pp-adic number theory: Iwasawa theory and Galois representations

Objectives: understand, at a sketch level, what a pp-adic LL-function is and why it’s natural; understand why ℤp\mathbb{Z}_p is the right coefficient ring for the Galois representations behind Wiles’s proof.

Exposition. Classical fact (Kummer, 19th century, well before pp-adic numbers existed as objects): certain congruences hold between values of the Riemann zeta function at negative integers (equivalently, between Bernoulli numbers) modulo a prime pp, whenever the indices are congruent mod p−1p-1. These Kummer congruences look, in hindsight, exactly like the statement “a certain function is pp-adically continuous, sampled only at integer points” — and that is precisely what Kubota and Leopoldt made precise in 1964, constructing an honest pp-adic LL-function Lp(s,χ)L_p(s,\chi), a genuine continuous (in fact pp-adic analytic) function on a pp-adic domain, that interpolates the classical values ζ(1−n)\zeta(1-n) at negative integers, packaging infinitely many classical congruences into one analytic object living natively in ℚp\mathbb{Q}_p. This is the general pattern of Iwasawa theory: take a sequence of classical arithmetic invariants (class numbers, LL-values, ranks of elliptic curves) indexed by integers or by fields in a tower, and show they’re literally the values of one pp-adic analytic function, which then lets you use pp-adic analysis (Module 6 — much simpler convergence behavior!) to prove things about the whole infinite family at once instead of one case at a time.

The other modern pillar, and the one that connects hardest back to your elliptic curves course: a Galois representation attached to an elliptic curve E/ℚE/\mathbb{Q} (or a modular form) is a continuous homomorphism ρ:Gal(ℚ¯/ℚ)→GL2(R)\rho: \mathrm{Gal}(\overline{\mathbb{Q}}/\mathbb{Q}) \to \mathrm{GL}_2(R) for a suitable coefficient ring RR. The mod pp version has R=𝔽pR = \mathbb{F}_p, and is comparatively simple (finite target, easy to compute with). Wiles’s strategy for proving modularity was to start from a mod-pp representation known to be modular, and deform it — that is, study the entire space of pp-adic (R=ℤpR=\mathbb{Z}_p, or more generally RR a complete local ℤp\mathbb{Z}_p-algebra) representations reducing to that fixed mod-pp one — and show, via the celebrated “R=𝕋R = \mathbb{T}” theorem (comparing a deformation ring to a Hecke algebra), that every such deformation is modular. ℤp\mathbb{Z}_p isn’t a minor technical convenience in this story — it is the only reason the deformation space (an honest, structured, pp-adically-complete geometric object) exists at all for the argument to act on. Without the pp-adic numbers built in Modules 2–3 of this course, there is no space to deform inside.

Worked example. A hint of the Kummer congruence phenomenon itself, using small actual Bernoulli numbers (B2=16,B4=−130,B6=142,B8=−130,B10=566,B12=−6912730B_2=\frac16, B_4=-\frac1{30}, B_6=\frac1{42}, B_8=-\frac1{30}, B_{10}=\frac{5}{66}, B_{12}=-\frac{691}{2730}): take p=5p=5. Kummer’s congruence predicts Bnn≡Bmm(mod5)\frac{B_n}{n} \equiv \frac{B_m}{m} \;(\mathrm{mod}\;5) whenever n≡m(mod4)n \equiv m \;(\mathrm{mod}\;4) (since p−1=4p-1=4) and 4∤n4 \nmid n. Check n=6,m=2n=6, m=2 (both ≡2mod⁡4\equiv2 \bmod4): B6/6=1252B_6/6 = \frac{1}{252} and B2/2=112B_2/2 = \frac{1}{12}. Working 55-adically (252=4⋅63=4⋅9⋅7252 = 4\cdot63=4\cdot9\cdot7, coprime to 5; 1212 coprime to 5, so both are 55-adic units): 1252−112=12−252252⋅12=−2403024\frac1{252} - \frac1{12} = \frac{12-252}{252\cdot12} = \frac{-240}{3024}, and −240=−5⋅48-240 = -5\cdot48, so v5(−240)=1>0v_5(-240)=1>0 while the denominator is a unit — so indeed B66≡B22(mod5)\frac{B_6}{6}\equiv\frac{B_2}{2}\;(\mathrm{mod}\;5). ✓ — a finite, checkable instance of the exact congruence phenomenon that motivated the entire construction of pp-adic LL-functions.

Problem set 8. 1. Check the Kummer congruence prediction for n=10,m=6n=10, m=6 at p=5p=5 (again 10≡6≡2mod⁡410\equiv6\equiv2\bmod4) using the Bernoulli numbers given above. 2. In your own words, explain the difference between what a classical LL-function encodes (an analytic function of a complex variable ss) and what a pp-adic LL-function encodes (a pp-adic analytic function of a pp-adic variable) — what exactly is being “reorganized” when you pass from one to the other, and what do they have in common (what values do they share)? 3. Why does it make sense, given Module 6’s exp/log story (1+pℤp≅ℤp1+p\mathbb{Z}_p \cong \mathbb{Z}_p as topological groups), that a “pp-adic variable” can meaningfully vary continuously the way a complex variable does — what plays the role of ℂ\mathbb{C}’s connectedness/openness here, given that ℚp\mathbb{Q}_p is totally disconnected (Module 3)? 4. Research/synthesis question: look up the current status of the Iwasawa Main Conjecture (proved by Mazur–Wiles in 1984 for ℚ\mathbb{Q}, with various generalizations since) and its relationship to the pp-adic Birch and Swinnerton-Dyer conjecture. How does this compare, in terms of “proved vs. open,” to the status of the classical BSD conjecture from your elliptic curves course, Module 5?


5. Resources, organized

Textbooks — roughly easy → hard: - Fernando Q. Gouvêa, p-adic Numbers: An Introduction — the best true starting point, covers almost exactly §1–§6 of this course at a leisurely pace with excellent motivation. Publisher page. - Jean-Pierre Serre, A Course in Arithmetic — Chapter II builds pp-adic fields in about 15 dense, beautiful pages; the rest of the book (quadratic forms, then modular forms) is itself a masterclass in the local-global philosophy of Module 7. - Neal Koblitz, p-adic Numbers, p-adic Analysis, and Zeta-Functions — the natural next step after Gouvêa, leaning toward Module 6 and Module 8 material (includes a construction of pp-adic zeta functions). - Neal Koblitz, p-adic Analysis: A Short Course on Recent Work (LMS Lecture Notes) — more advanced, aimed directly at the Iwasawa-theory/pp-adic-LL-function material of Module 8. Publisher listing. - J.W.S. Cassels, Local Fields — the classical rigorous graduate reference for everything in Modules 1–5 and local class field theory beyond this course’s scope.

Free lecture notes / courses: - Andrew Sutherland (and, in other years, Bjorn Poonen), MIT 18.785 Number Theory I — outstanding free lecture notes that build local fields and pp-adic numbers rigorously as part of a full graduate number theory course; look for the lectures on absolute values, completions, and local fields specifically. Full lecture notes, Fall 2021, most recent iteration’s lecture index. - Keith Conrad’s expository notes — short, exceptionally clear, and aimed at exactly the sticking points a first-time learner hits. See especially “The pp-adic Expansion of Rational Numbers” and “Infinite Series in pp-adic Fields.” Full index at kconrad.math.uconn.edu/blurbs, The p-adic expansion of rational numbers, Infinite series in p-adic fields. - Chris Williams, An Introduction to p-adic L-functions (parts I & II) — free, modern, self-contained lecture notes that go from scratch to Kubota–Leopoldt and beyond, directly extending Module 8. Part I, Part II: modular forms. - Joaquín Rodrigues Jacinto & Chris Williams, “An introduction to pp-adic LL-functions,” a 2023 expository survey (arXiv) — a more recent, very readable overview of the whole area. arXiv:2309.15692. - Brian Conrad, CMI Summer School Notes on p-adic Hodge Theory — the standard free entry point into the Module 8 frontier material (Fontaine’s rings, comparison theorems). Notes PDF. - numbertheory.org’s lecture notes index — a broad, curated list of free number theory course notes across many schools and levels. numbertheory.org/ntw/lecture_notes.html.

Historical / primary sources (for §2): - Fernando Q. Gouvêa, “Hensel’s pp-adic Numbers: Early History” — a historian-mathematician’s account of exactly how and why Hensel built these numbers, written for a modern audience. PDF. - MacTutor History of Mathematics, “Kurt Hensel” biography. mathshistory.st-andrews.ac.uk/Biographies/Hensel. - Wikipedia’s “P-adic number”, “P-adic valuation”, and “P-adic analysis” pages are all well-sourced starting points into the primary literature.

Interactive / computational tools: - LMFDB — pp-adic (local number) fields database — look up any local field, its ramification data, Galois group, and more; the direct local analogue of the elliptic curve database you already used in the other course. Individual example: pp-adic field 3.6.7.3. - SageMath — Introduction to the pp-adics — free, runs in-browser via SageCell, lets you construct ℚp\mathbb{Q}_p, compute Hensel lifts, and check every hand computation in Modules 1–6 in seconds.


6. Connection graph — where this fits in your map

Same purpose as §6 of the elliptic curves course: forward pointers, not a closed diagram. Note the explicit join back to elliptic-curves-course.md at three separate nodes — this is not a coincidence; the two courses are genuinely one story split into two documents for manageability.

Connection graph removed. This document originally embedded its own diagram. Those edges now live in the map's lens files instead, so the two cannot drift apart — open the map to see them under the relevant lens.

How to read this as your next moves, in rough order of directness:

As with the elliptic curves course: when you pick a next node, start the new document by naming which node you’re standing on and what you already know from here — that’s the whole mechanism this project is built around.


7. Answer key

Work the problems first. Answers are terse — they confirm the destination, not a substitute for the derivation.

Module 1 1. −72=−1⋅23⋅32-72 = -1 \cdot 2^3 \cdot 3^2. |−72|2=2−3=1/8|{-72}|_2 = 2^{-3} = 1/8; |−72|3=3−2=1/9|{-72}|_3 = 3^{-2}=1/9; |−72|5=50=1|{-72}|_5 = 5^0=1 (5 doesn’t divide 72). 2. vp(x+y)≥min⁡(vp(x),vp(y))⇒p−vp(x+y)≤p−min⁡(vp(x),vp(y))=max⁡(p−vp(x),p−vp(y))v_p(x+y)\ge\min(v_p(x),v_p(y)) \Rightarrow p^{-v_p(x+y)} \le p^{-\min(v_p(x),v_p(y))} = \max(p^{-v_p(x)},p^{-v_p(y)}), i.e. |x+y|p≤max⁡(|x|p,|y|p)|x+y|_p \le \max(|x|_p,|y|_p). 3. WLOG vp(x)<vp(y)v_p(x) < v_p(y). Write x+yx+y; suppose for contradiction vp(x+y)>vp(x)v_p(x+y) > v_p(x). Then x=(x+y)−yx = (x+y) - y has vp(x)≥min⁡(vp(x+y),vp(y))>vp(x)v_p(x) \ge \min(v_p(x+y), v_p(y)) > v_p(x) (since both terms exceed vp(x)v_p(x) by assumption/given), a contradiction. So vp(x+y)=vp(x)=minv_p(x+y) = v_p(x) = \min, giving |x+y|p=|x|p=max⁡(|x|p,|y|p)|x+y|_p = |x|_p = \max(|x|_p,|y|_p). 4. −18/25=−1⋅2⋅32⋅5−2-18/25 = -1\cdot2\cdot3^2\cdot5^{-2}. |⋅|2=1/2|{\cdot}|_2=1/2, |⋅|3=1/9|{\cdot}|_3=1/9, |⋅|5=25|{\cdot}|_5=25, all other primes 11, |⋅|∞=18/25|{\cdot}|_\infty = 18/25. Product: 1825⋅12⋅19⋅25=18⋅2525⋅2⋅9=1818=1\frac{18}{25}\cdot\frac12\cdot\frac19\cdot25 = \frac{18\cdot25}{25\cdot2\cdot9} = \frac{18}{18}=1 ✓.

Module 2 1. Solve 2x≡1(mod7n)2x\equiv1\;(\mathrm{mod}\;7^n): mod 7, x=4x=4 (2⋅4=8≡12\cdot4=8\equiv1). Mod 49: 2x≡1(mod49)2x\equiv1\;(\mathrm{mod}\;49), x=25x=25 (2⋅25=50≡12\cdot25=50\equiv1), and 25≡4(mod7)25 \equiv 4\;(\mathrm{mod}\;7) ✓ consistent. Continuing gives 1/2=4+3⋅7+3⋅72+⋯1/2 = 4 + 3\cdot7 + 3\cdot7^2+\cdots (digit pattern stabilizes at 33 after the first digit, since $1/2 = (1+6)/2 = $ … equivalently 1/2=−3=−31/2 = -3 = -3, and one can directly find −3-3’s expansion: −3=4+3⋅7+3⋅72+⋯-3 = 4 + 3\cdot7+3\cdot7^2+\cdots by the same telescoping trick as the −1-1 example, since 1/2≡−3(mod7n)1/2 \equiv -3 \;(\mathrm{mod}\;7^n) for all nn isn’t quite right — the clean way: 1/2=−31/2 = -3 is false in ℚ\mathbb{Q}, but 2⋅(−3)=−6≡1(mod7)2\cdot(-3)=-6\equiv1\;(\mathrm{mod}\;7); check 2⋅(−3)=−62\cdot(-3)=-6, and −6≡1(mod7)-6\equiv1\;(\mathrm{mod}\;7) ✓, so digit-by-digit 1/21/2 and −3-3 agree — giving 1/2=4+3⋅7+3⋅72+3⋅73+⋯1/2 = 4+3\cdot7+3\cdot7^2+3\cdot7^3+\cdots in ℤ7\mathbb{Z}_7). 2. Injective: if integers m≠nm\ne n agree pp-adically they’d have vp(m−n)=∞v_p(m-n)=\infty, forcing m=nm=n in ℤ\mathbb{Z}, contradiction. Not surjective: −1=∑(p−1)pi-1 = \sum(p-1)p^i from the worked example is not equal to any single integer (its expansion never terminates and never eventually-stabilizes at 00, which is required of nonneg integers, nor does it equal a negative integer other than via the specific eventually-constant-at-(p−1)(p-1) pattern matching that integer — more simply, any element whose digit sequence is not eventually periodic-with-period-dividing-appropriately / not eventually constant at 00 or forced pattern is a non-integer, e.g. ∑i≥0p2i\sum_{i\ge0} p^{2^i}-style sparse sums, or simply any square root from Module 4 like 2∈ℤ7\sqrt2 \in \mathbb{Z}_7, which is irrational hence not an integer). 3. Given x=∑i≥0aipi∈ℤpx=\sum_{i\ge0}a_ip^i \in \mathbb{Z}_p, the truncations xn=∑i=0n−1aipi∈ℤx_n = \sum_{i=0}^{n-1}a_ip^i \in \mathbb{Z} satisfy |x−xn|p≤p−n→0|x-x_n|_p \le p^{-n}\to0, so xn→xx_n\to x: an explicit sequence of integers converging to xx. 4. an∈ℤ/pnℤa_n \in \mathbb{Z}/p^n\mathbb{Z} is exactly the truncated sum a0+a1p+⋯+an−1pn−1mod⁡pna_0+a_1p+\cdots+a_{n-1}p^{n-1} \bmod p^n — the compatibility condition an+1≡an(modpn)a_{n+1}\equiv a_n \;(\mathrm{mod}\;p^n) is exactly the statement that extending the digit expansion by one more digit doesn’t change any of the earlier digits, which is obviously true and is exactly what “reading off more terms of a convergent series” means.

Module 3 1. For any x∈B(c,r)x \in B(c,r): |x−a|p=|(x−c)+(c−a)|p≤max⁡(|x−c|p,|c−a|p)≤max⁡(r,r)=r|x-a|_p = |(x-c)+(c-a)|_p \le \max(|x-c|_p,|c-a|_p) \le \max(r,r)=r (using c∈B(a,r)c\in B(a,r) so |c−a|p≤r|c-a|_p\le r), so x∈B(a,r)x\in B(a,r); the reverse inclusion is symmetric. Hence B(c,r)=B(a,r)B(c,r)=B(a,r). 2. Given a sequence (x(k))(x^{(k)}) in ℤp\mathbb{Z}_p, infinitely many share the same digit a0a_0 (pigeonhole, only pp choices); pass to that subsequence; among those, infinitely many share a1a_1 too; continue. Diagonalize: pick one element from each nested subsequence to build a genuine subsequence of the original whose digits agree with a fixed limiting digit string to increasing precision — that subsequence converges (by construction) to the pp-adic number with those digits. 3. Same radius, disjoint: B(0,1/p)B(0,1/p) and B(1,1/p)B(1,1/p) in ℤp\mathbb{Z}_p (residues 00 and 11 mod pp are different, and balls of radius 1/p1/p are exactly residue classes mod pp — disjoint since 0≠1mod⁡p0\ne1 \bmod p). Different radii, nested: B(1,1/p2)⊂B(1,1/p)B(1,1/p^2) \subset B(1,1/p) (a finer residue class mod p2p^2 sits inside the coarser one mod pp that it refines). Partial overlap is impossible because if two balls shared even one point, Problem 1 shows that point is a valid center for both — and then the smaller ball’s every point is within the smaller radius of that shared center, hence within the larger radius too, forcing full containment. 4. Concretely: fixing finitely many leading digits carves out a clopen ball, and every element in that ball differs from every other only in digits far enough out — so any two distinct elements are eventually separated at some finite digit, meaning there’s always a clopen set containing one but not the other arbitrarily close by (no interval-like continuum to be connected), yet you can also always find another element agreeing in arbitrarily many leading digits (perturb only a far-out digit), so no point is isolated either. “Totally disconnected but not discrete” is exactly “differences show up at some finite but unbounded digit position.”

Module 4 1. Mod 3: squares are {0,1}\{0,1\}; 22 is not a square mod 3, and since 22 is a unit (3∤23\nmid2), Hensel’s non-solvability is definitive here (unit square-ness mod pp for odd pp exactly determines square-ness in ℤp\mathbb{Z}_p) — so no, x2=2x^2=2 has no solution in ℚ3\mathbb{Q}_3. 2. x2=−1x^2=-1 solvable in ℤp\mathbb{Z}_p (p odd) iff −1-1 is a square mod pp (Hensel applies directly since f′(x)=2x≠0f'(x)=2x\ne0 whenever x≠0x\ne0, and x=0x=0 can’t be a root since −1≠0-1\ne0) iff p≡1(mod4)p\equiv1\;(\mathrm{mod}\;4) — exactly the classical elementary number theory fact about which primes are sums of two squares / have −1-1 as a QR. 3. Mod 7: need a3≡1a^3\equiv1, a≠1a\ne1. Try a=2a=2: 8≡1(mod7)8\equiv1\;(\mathrm{mod}\;7) ✓. f(x)=x3−1f(x)=x^3-1, f′(x)=3x2f'(x)=3x^2, f′(2)=12≡5≢0(mod7)f'(2)=12\equiv5\nequiv0\;(\mathrm{mod}\;7), so Hensel applies: a genuine cube root of unity α≡2(mod7)\alpha\equiv2\;(\mathrm{mod}\;7) exists in ℤ7\mathbb{Z}_7 (and α=4\alpha=4 gives the third one, since 1,2,41,2,4 are exactly the cube roots of unity mod 7, matching μ3⊂𝔽7×\mu_3 \subset \mathbb{F}_7^\times as 3∣6=7−13\mid6=7-1). 4. Take p=2p=2, f(x)=x2−1f(x)=x^2-1 near a=1a=1: f(1)=0≡0(mod2)f(1)=0\equiv0\;(\mathrm{mod}\;2) but f′(1)=2≡0(mod2)f'(1)=2\equiv0\;(\mathrm{mod}\;2) too — hypothesis fails. Here it happens x=1x=1 genuinely is a root, so this particular case doesn’t demonstrate failure; a cleaner failing example: f(x)=x2+1f(x)=x^2+1 over p=2p=2 at aa where f(a)≡0(mod2)f(a)\equiv0\;(\mathrm{mod}\;2) (need aa odd, a=1a=1: f(1)=2≡0(mod2)f(1)=2\equiv0\;(\mathrm{mod}\;2)) but f′(1)=2≡0(mod2)f'(1)=2\equiv0\;(\mathrm{mod}\;2) — and indeed x2=−1x^2=-1 has no solution in ℤ2\mathbb{Z}_2 (check mod 4: odd squares are ≡1(mod4)\equiv1\;(\mathrm{mod}\;4), never ≡−1≡3(mod4)\equiv-1\equiv3\;(\mathrm{mod}\;4)) — confirming the simple form of Hensel’s Lemma genuinely cannot be dropped.

Module 5 1. If x∉pℤpx \notin p\mathbb{Z}_p then vp(x)=0v_p(x)=0, i.e. |x|p=1|x|_p=1. Its digit expansion has a0≠0a_0\ne0; one can construct x−1x^{-1} digit-by-digit exactly as in Module 2 Problem 1 (solve x⋅y≡1(modpn)x\cdot y\equiv1\;(\mathrm{mod}\;p^n) inductively, using that xx is invertible mod pnp^n for every nn since it’s a unit mod pp), producing y=x−1∈ℤpy=x^{-1}\in\mathbb{Z}_p. 2. μ7−1=μ6\mu_{7-1}=\mu_6: exactly the 66th roots of unity, matching 𝔽7×≅ℤ/6\mathbb{F}_7^\times \cong \mathbb{Z}/6 lifted via Teichmüller — so ℚ7\mathbb{Q}_7 contains exactly 66 roots of unity of orders dividing 6 (orders 1,2,3,6, i.e. 1,−11,-1, two primitive cube roots, two primitive 6th roots), and no roots of unity of any other order (the 11-units 1+7ℤ7≅ℤ71+7\mathbb{Z}_7\cong\mathbb{Z}_7 are torsion-free, so contribute none). 3. For p=2p=2: μp−1=μ1={1}\mu_{p-1}=\mu_1=\{1\} is trivial, so there’s no nontrivial root-of-unity part to split off via that mechanism; separately, 1+2ℤ21+2\mathbb{Z}_2 is not torsion-free the way 1+pℤp1+p\mathbb{Z}_p is for odd pp (e.g. −1≡1(mod2)-1 \equiv 1 \;(\mathrm{mod}\;2) but −1∉1+4ℤ2-1\notin1+4\mathbb{Z}_2), so the log map isn’t injective on all of 1+2ℤ21+2\mathbb{Z}_2 — you must restrict to 1+4ℤ21+4\mathbb{Z}_2 for the clean isomorphism, and handle {±1}\{\pm1\} separately. 4. True (for pp odd): the decomposition u=ω(u)⋅⟨u⟩u = \omega(u) \cdot \langle u \rangle (Teichmüller part times 11-unit) is unique because μp−1∩(1+pℤp)={1}\mu_{p-1} \cap (1+p\mathbb{Z}_p) = \{1\} (a root of unity that’s ≡1(modp)\equiv1\;(\mathrm{mod}\;p) and has order dividing p−1p-1, coprime to pp, must itself be trivial — a nontrivial root of unity of order dividing p−1p-1 is never ≡1mod⁡p\equiv1\bmod p except the identity). Drop uniqueness and you’d need the intersection to be trivial for any valid decomposition to be forced unique — without it you could shuffle a shared torsion element between the two factors.

Module 6 1. vp(pn/n)=n−vp(n)→∞v_p(p^n/n) = n - v_p(n) \to \infty (since vp(n)=O(log⁡n)≪nv_p(n) = O(\log n) \ll n) for every prime pp, so yes, ∑pn/n\sum p^n/n converges in every ℚp\mathbb{Q}_p. 2. log⁡5(1+5)=5−522+533−⋯\log_5(1+5) = 5 - \frac{5^2}{2}+\frac{5^3}{3}-\cdots. In ℤ5\mathbb{Z}_5, 1/21/2 and 1/31/3 are units (5-adic integers themselves, computable as in Module 2), so the series is 5−25⋅(1/2)+125⋅(1/3)−⋯5 - 25\cdot(1/2) + 125\cdot(1/3) - \cdots; to three terms, as an element of ℚ5\mathbb{Q}_5: 5−252+12535 - \frac{25}{2} + \frac{125}{3}, left symbolic since simplifying further just means finding 2−1,3−12^{-1},3^{-1} in ℤ5\mathbb{Z}_5 as in earlier modules. 3. If an→0a_n\to0: given ϵ>0\epsilon>0 choose NN with |an|p<ϵ|a_n|_p<\epsilon for n>Nn>N; then for m>n>Nm>n>N, |Sm−Sn|p=|∑k=n+1mak|p≤max⁡n<k≤m|ak|p<ϵ|S_m-S_n|_p = |\sum_{k=n+1}^m a_k|_p \le \max_{n<k\le m}|a_k|_p < \epsilon (repeated ultrametric inequality — the max of finitely many small terms is still small, with no accumulation, unlike ordinary addition where many small terms can add up). So (Sn)(S_n) is Cauchy, hence converges (completeness of ℚp\mathbb{Q}_p). Converse (convergent ⇒an→0\Rightarrow a_n\to0) is the same easy argument that works in ℝ\mathbb{R} too (an=Sn−Sn−1→L−L=0a_n=S_n-S_{n-1}\to L-L=0). 4. In ℝ\mathbb{R}, adding many small positive terms can accumulate without bound (that’s exactly what ∑1/n\sum1/n does) because the ordinary triangle inequality only gives |Sm−Sn|≤∑|ak||S_m-S_n|\le\sum|a_k|, a bound that can grow. The ultrametric inequality instead gives |Sm−Sn|p≤max⁡|ak|p|S_m-S_n|_p \le \max|a_k|_p — accumulation is structurally impossible, the partial sums can never drift further than the single largest recent term, no matter how many terms you add.

Module 7 1. (Left as the intended hands-on exercise — the mod-5 check in the worked example generalizes the same way at 77 and 1313; all should be solvable by the same style of computation, consistent with Hasse–Minkowski predicting a global solution exists.) 2. Module 4’s Hensel’s Lemma: at a prime pp not dividing the discriminant of the quadratic form, the form is “smooth” mod pp (nondegenerate), which is exactly the condition (f′(a)≢0f'(a)\nequiv0, suitably generalized to several variables via the Jacobian) guaranteeing any mod-pp solution lifts to a genuine ℤp\mathbb{Z}_p-solution — so solvability mod pp (a finite check, and one that’s automatic for “most” pp by general point-counting bounds for quadratic forms) is equivalent to solvability in ℚp\mathbb{Q}_p at all good primes. 3. It’s a special feature of (nondegenerate) quadratic forms specifically, not a general theorem about ℚ\mathbb{Q} — you should go in suspicious of any higher-degree Diophantine equation (cubic and up), where extra global obstructions (measured by objects like ШШ) can and do exist even when every local check passes. 4. Rank computation reduces (via the descent argument sketched in the elliptic curves course) to bounding E(ℚ)/2E(ℚ)E(\mathbb{Q})/2E(\mathbb{Q}), which sits inside the Selmer group Sel2(E)\mathrm{Sel}_2(E) — a computable object built entirely from local data at every place, exactly the local-global machinery of this module. The exact sequence shows Sel2(E)\mathrm{Sel}_2(E) over-counts the true rank data by exactly Ш(E)[2]Ш(E)[2]; if Ш=0Ш=0 you get the rank exactly from a finite local computation, but ШШ can be (and is suspected to often be) nonzero, so the Selmer group only ever gives an upper bound in general — the rank problem is hard precisely to the extent that ШШ, a Selmer-cubic-style global obstruction, is mysterious.

Module 8 1. B10/10=1132B_{10}/10 = \frac{1}{132}, B6/6=1252B_6/6=\frac{1}{252}. Difference 1132−1252=252−132132⋅252=12033264\frac1{132}-\frac1{252} = \frac{252-132}{132\cdot252}=\frac{120}{33264}; 120=5⋅24120=5\cdot24, so v5(120)≥1v_5(120)\ge1 while 3326433264 is coprime to 5 (check: 33264=132⋅25233264 = 132\cdot252, and neither 132=4⋅33132=4\cdot33 nor 252=4⋅63252=4\cdot63 is divisible by 5) — so v5v_5 of the difference is ≥1>0\ge1>0, confirming B10/10≡B6/6(mod5)B_{10}/10\equiv B_6/6\;(\mathrm{mod}\;5) ✓. 2. A classical LL-function is a single analytic function of one complex variable ss, built from an Euler product over all primes, and its special values (e.g. at negative integers, or at the center of the critical strip) encode arithmetic information. A pp-adic LL-function is a pp-adic analytic function of a pp-adic variable, built to agree with the same classical special values (interpolating them) at the points where both are defined — the “reorganization” is: instead of one global analytic object seen through the archimedean place only, you get a genuinely different (p-adic) analytic continuation of the same underlying arithmetic data, letting you apply an entirely different toolkit (p-adic analysis, Module 6) to questions the classical function alone can’t easily answer. 3. Even though ℚp\mathbb{Q}_p itself is totally disconnected, the relevant “variable” typically ranges over a genuinely connected-in-the-relevant-sense pp-adic analytic space (e.g. a disk 1+pℤp≅ℤp1+p\mathbb{Z}_p \cong \mathbb{Z}_p under exp⁡p/log⁡p\exp_p/\log_p, or more generally rigid-analytic space) where “pp-adic analytic function” has a precise meaning via locally convergent power series (Module 6) — connectedness in the topological sense isn’t what’s needed; what’s needed is a coherent notion of convergent power series and analytic continuation, which the exp/log isomorphism supplies directly. 4. Research question — expect to find: the Iwasawa Main Conjecture for ℚ\mathbb{Q} (cyclotomic case) was proved by Mazur–Wiles in 1984, and is now a theorem, not a conjecture, in that setting (with substantial generalizations to elliptic curves and beyond by Kato, Skinner–Urban, and others, though not universally in full generality). This is meaningfully more settled than the classical Birch–Swinnerton-Dyer conjecture itself, which remains fully open — an interesting asymmetry: the “pp-adic shadow” of a hard classical conjecture can sometimes be proved before the classical statement is, because pp-adic analytic methods (Module 6) are, in a real sense, easier to compute with than their archimedean counterparts.


Built for the Map of Math project, as a sibling to elliptic-curves-course.md — the two documents are one story about how local information (at primes, or at the single archimedean place) governs global arithmetic, told twice from two different starting points. When you’re ready to go deeper on any node in §6’s graph, that’s the natural next document.