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 your teachers happened to grow up with. By the end of §1–§2 the goal is for to feel exactly as natural as — 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 it’s already been handed to you as the completion of , full stop: why should the ordinary absolute value be the only reasonable way to measure how “close” two rational numbers are?
Ordinary distance says and are far apart (they differ by 1… wait, they’re close) and and 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 , and declare two rational numbers close if their difference is divisible by a large power of . Under this rule, and are extremely close 5-adically (their difference is divisible by ), 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 with respect to it, exactly the way Cauchy sequences complete into , you get a genuinely new, genuinely complete field: , the -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 — up to the natural equivalence that doesn’t change which sequences converge — is either the usual one, or one of these -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 . It was always a family of acts, indexed by the places of — one place for every prime , plus one more place (traditionally called the “infinite place” or ) for the usual absolute value. is the completion at . are the completions at each finite prime. They are all, formally, equally valid completions of the same field. 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 instead of , and the field of rational functions instead of . If you want to study a rational function near a specific point , the natural tool is its Taylor/Laurent expansion around that point: . This expansion converges (formally, or in the usual sense if ) precisely near , 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 might be complicated everywhere else. Dedekind and Weber had shown by 1882 that the arithmetic of (irreducible polynomials, i.e. points on a curve, playing the role of primes) is a near-perfect mirror of the arithmetic of (primes). Hensel’s insight was to push the analogy one step further: if ’s primes behave like ’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 , the number-theoretic analogue of . That expansion is exactly a -adic number: , digits , 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 . Once you see it this way, -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 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 . This single reframing changes how you read almost all of classical number theory in hindsight — theorems that look like isolated facts about or are frequently theorems about all the places at once, with contributing one condition and each contributing another.
It gives you a genuinely different geometry to think in, and it’s fully rigorous. The -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 (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 and a solution in every single . 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 — the coefficient ring for the whole argument is a ring of -adic numbers. Iwasawa theory, -adic -functions, and -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 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 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 -adic numbers as formal power series in a prime — explicitly modeled on Laurent/Taylor expansions of functions near a point, per the function-field analogy of §1. This is the birth of , though Hensel’s original presentation was formal/algebraic rather than metric. |
| 1902–1908 | Kurt Hensel | Develops what becomes known as Hensel’s Lemma — a -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 into — this is the paper that puts Hensel’s -adic numbers on the same metric-completion footing as , retroactively. |
| 1916 | Alexander Ostrowski | Proves Ostrowski’s theorem: every nontrivial absolute value on is equivalent to either the usual absolute value or a -adic absolute value for some prime — closing the classification and making precise the “ is just one place among many” picture from §1. |
| Early 1920s | Helmut Hasse (building on Hermann Minkowski’s earlier work on quadratic forms over ) | Proves the Hasse–Minkowski theorem: a quadratic form over has a nontrivial rational zero if and only if it has one over and over every — 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 in terms of the topological group — 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 that packages and every 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 -functions) using harmonic analysis on the adeles/ideles — a landmark demonstration that -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 -adic methods, founding Iwasawa theory. Kubota–Leopoldt (1964) construct the first -adic -function, interpolating the values of the Riemann zeta function at negative integers -adically — turning classical (Kummer, 19th c.) congruences between Bernoulli numbers into a single continuous -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 -adic analytic methods — a spectacular early demonstration that -adic analysis can resolve problems with no visible connection to -adic numbers on the surface. |
| 1972–1974 | Barry Mazur; Mazur & Peter Swinnerton-Dyer | Extend Iwasawa theory to elliptic curves, and construct -adic -functions attached to elliptic curves — directly setting up the machinery behind the (still partly open) -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 -adic Hodge theory — a dictionary comparing the -adic étale cohomology of varieties over -adic fields with more classical (de Rham, crystalline) cohomology theories, resolving deep comparison conjectures and giving -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 . The entire deformation-theoretic argument (the “” theorem) is conducted inside complete local rings built from ; without -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 -adic geometry that dramatically simplifies and extends -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 -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 (). Everything here points at one destination: understanding, precisely, what it means to complete “at a prime” instead of “at infinity.”
3.1 Absolute values on a field
An absolute value on a field is a function satisfying, for all :
- ,
- (multiplicativity),
- (triangle inequality).
The familiar example on is , ordinary absolute value. There’s also always the trivial absolute value (, 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 -adic valuation and absolute value
Fix a prime . Every nonzero rational number can be written uniquely as Define the -adic valuation (and by convention). This is the exact power of dividing , extended sensibly to fractions — for instance , , . The valuation satisfies: with equality in the second whenever — a fact that does all the real work in this course, so hold onto it.
The -adic absolute value is then (and ). Translating the valuation properties: (multiplicative, as required) and the ultrametric or strong triangle inequality — strictly stronger than the ordinary triangle inequality ( always), and the source of every strange, beautiful fact about -adic geometry in Module 3.
3.3 Ostrowski’s theorem
Theorem (Ostrowski, 1916). Every nontrivial absolute value on is equivalent to or to for exactly one prime .
This is the precise statement behind §1’s claim that is “one place among many.” The set of places of is — 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 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:
- Every triangle is isosceles. If then exactly (not just ) — so among any three “side lengths” derived from three points, the two largest must be equal. There is no such thing as a scalene triangle in -adic geometry.
- Every point in a ball is a center of that ball. Define the closed ball . If , then — exactly the same ball. (“If you’re inside, you’re the center” — there’s no privileged point.)
- Balls are clopen. Every ball (open or closed) is simultaneously open and closed in the -adic topology. This is what makes totally disconnected — it has no connected subsets bigger than a point, unlike .
- Two balls are either disjoint or nested, never partially overlapping.
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 is built from : take Cauchy sequences of rationals with respect to , declare two sequences equivalent if their difference tends to , and the equivalence classes form a new field into which embeds densely, and which is now genuinely complete (every Cauchy sequence converges). is built by the identical construction, verbatim, with in place of : Cauchy sequences of rationals with respect to , modulo sequences whose difference is -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 satisfies the absolute value axioms and the ultrametric inequality; compute -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 together into a single constraint: the product formula. For any nonzero , (a finite product in practice, since for all but finitely many — exactly those dividing the numerator or denominator of ). This says the “sizes” of at every place are not independent; they’re constrained to multiply to exactly . 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 .
Worked example. Let . - . - . - . - . - All other primes: . - .
Check the product formula: ✓.
Problem set 1. 1. Compute , , and . 2. Prove the ultrametric inequality directly from . 3. Prove that if , then exactly. (This is the “isosceles triangle” fact from §3.4 — prove it, don’t just cite it.) 4. Verify the product formula for .
Module 2 — Constructing , three ways
Objectives: understand as a completion by Cauchy sequences, as an inverse limit , and via base- digit expansions — and see why the three agree.
Exposition. Three equivalent constructions, useful for different purposes:
- Cauchy sequences (§3.5): the abstract, general-purpose construction — guarantees completeness for free, since it’s the same machine that builds .
- Inverse limit. Define — a compatible sequence of elements with and . This is the most computationally honest picture: a -adic integer is exactly “know your value mod , and mod , and mod , consistently, forever.” is then the fraction field of (equivalently, ).
- Digit expansions. Every element of has a unique representation converging -adically (the terms shrink: ). Elements of allow finitely many negative powers of too: for some (possibly negative). This is precisely the picture from §1: an ordinary decimal extends infinitely to the right; a -adic expansion extends infinitely to the left. sits inside 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 (see the worked example).
Worked example. Find the -adic expansion of . Note for every (just expand ). So the partial sums satisfy . So i.e. is the -adic number “” — an infinite string of ’s extending left, the direct analogue of in a “10-adic” sense (informally; isn’t prime, but the intuition — infinitely many leftward ’s — is exactly the same phenomenon, and is in fact used as a popular-explainer trick for why in the -adics, which do exist as a ring, just not a field, since isn’t prime).
Problem set 2. 1. Find the -adic expansion of (hint: find with first, then continue digit by digit, or use that ; more directly, solve for increasing and read off digits). 2. Show that the integer embedding is injective (i.e. no two distinct integers become -adically equal) but not surjective (exhibit an explicit element of , other than via the example above, that cannot equal any integer). 3. Prove that every element of is a -adic limit of a sequence of ordinary integers (i.e. is dense in ). 4. Explain concretely why the inverse-limit description and the digit-expansion description are “the same data” — what is in terms of the digits ?
Module 3 — The topology of
Objectives: work directly with the ultrametric consequences from §3.4; prove is compact; understand total disconnectedness.
Exposition. is the closed unit ball, and it is compact — genuinely different from , where closed balls (bounded closed intervals) are compact too, but the reason is different and more combinatorial here. Via the inverse-limit picture, 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. itself is locally compact (a union of countably many translates/scalings of the compact ) 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 — is dense in , by Problem 2.3). This combination — totally disconnected, not discrete, locally compact — is characteristic of -adic-type spaces and has no analogue in .
Worked example. Show and are either disjoint or nested with the “big” ball , never crossing. Take and (radius , i.e. , i.e. ). Every with automatically has (since , and both terms are in ), so — 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 then , using only the ultrametric inequality. 2. Prove is compact using the digit-expansion picture: given a sequence of elements of , construct a convergent subsequence by successively passing to subsequences that agree in more and more leading digits. 3. Exhibit two closed balls in 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. 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 .
Exposition. This is the payoff for building a complete field: it lets you turn a finite check (does a polynomial have a root mod ?) into an exact, infinite-precision statement (does it have a root in ?).
Hensel’s Lemma (simple form). Let , and suppose satisfies and . Then there is a unique with and .
The proof is literally Newton’s method, made rigorous by the ultrametric inequality instead of real-analytic estimates: iterate , and show shrinks fast enough (in fact doubles the number of correct -adic digits at each step, just like Newton’s method doubles decimal digits of precision over ) 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 and instead only needs — the same conclusion follows, with uniquely determined by being close enough to .
Worked example. Does exist in ? Take . Mod 7: , so works: . And , so . Hensel’s Lemma applies: there’s a unique with and . (There’s a second root too, , by the same argument with — the two square roots of in , just as are the two square roots in .) One Newton step to sharpen: . Working mod : (since ), so . Check: . ✓ — so in , i.e. .
Problem set 4. 1. Does have a solution in ? Check solvability mod first, then decide whether Hensel’s Lemma applies or definitively rules it out. 2. For which odd primes does have a solution in ? (Hint: this is a question about squares mod you may already know from elementary number theory — connect it explicitly to that fact.) 3. Find a cube root of in other than itself (i.e. a nontrivial solution of ), using Hensel’s Lemma starting from a root mod . 4. Explain in your own words why Hensel’s Lemma can fail to directly decide the case (the excluded case) — construct a specific small example of a polynomial and a prime where , , and there is genuinely no root of congruent to mod in , to see the hypothesis is load-bearing.
Module 5 — Algebraic structure: as a complete DVR
Objectives: understand as a local ring with a unique maximal ideal and residue field ; understand the structure of the unit group .
Exposition. is an integral domain, and makes it into a discrete valuation ring (DVR): every nonzero ideal is a power of the unique maximal ideal . 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 is exactly the finite field you already know from modular arithmetic. Every nonzero element of factors uniquely as with and (a unit, i.e. , i.e. ) — the -adic analogue of scientific notation, with playing the role of the “exponent” and the “mantissa,” except the mantissa here is an entire -adic integer, not a bounded decimal.
The unit group has a clean structure. For odd: where is the group of -th roots of unity (via the Teichmüller lift, a canonical way to lift each nonzero residue mod to an exact root of unity in , using Hensel’s Lemma on ), and the “-units” form a group isomorphic to via the -adic logarithm (Module 6). For the statement needs a small patch (, generated by and the -units rather than ) — the recurring pattern that is the annoying exception throughout this subject, exactly as it is in ordinary elementary number theory.
Worked example. Decompose into its Teichmüller part times a -unit. . The Teichmüller lift is the unique th root of unity in congruent to (since under the iso ). One can compute , refined by Hensel on : mod 25, need with ; try : , so ✓, and ✓. So . Then ; (since ), so — and as required of a -unit. So with , , both refinable to arbitrary precision.
Problem set 5. 1. Prove is a local ring directly: show every element not in is a unit (has a multiplicative inverse in ). 2. List all the roots of unity in . (Use the unit group structure theorem — how many roots of unity of each possible order can there be, and why does matter here?) 3. Explain concretely why breaks the clean splitting — what goes wrong if you try to apply Hensel’s Lemma to style reasoning when ? 4. True or false, with justification: every element of is a root of unity times a power of times… — actually, is every unit itself expressible as (root of unity) (element ), uniquely? What breaks if you drop uniqueness?
Module 6 — -adic analysis: series, exp, and log
Objectives: state and use the (surprisingly simple) -adic series convergence test; define and and know their radii of convergence; contrast sharply with real analysis.
Exposition. Here is the single most pleasant fact in elementary -adic analysis, a direct payoff of the ultrametric inequality: a series of -adic numbers converges if and only if . (Contrast with : is necessary but famously not sufficient — the harmonic series termwise but diverges. No such counterexample can exist -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 -adic series dramatically more mechanical than in ordinary analysis — you never need ratio tests, comparison tests, or alternating series tricks; you just check .
The -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 grows, but only like , by Legendre’s formula, not fast enough to guarantee convergence everywhere the way it does over ): For odd, , so converges (at least) on all of ; for you need the sharper , i.e. — the exception again. On their common domain of convergence, and are mutually inverse and give the isomorphism promised in Module 5.
Worked example. Does $_{n=1}^n! $ converge in for any ? No series test needed beyond the one fact above: as (Legendre’s formula: ), so , so yes, converges -adically for every prime — a series that diverges (to ) in every conceivable real sense converges perfectly well -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 , whether converges in . 2. Compute to three terms (as a series in powers of ) for , and simplify as far as you can. 3. Prove the “term test” (convergence ) for -adic series, using only the ultrametric inequality applied to for . 4. Contrast, explicitly, why diverges in despite , but the analogous danger cannot occur in — 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 with rational coefficients has a nontrivial zero in if and only if it has a nontrivial zero in and a nontrivial zero in for every prime .
The remarkable content: checking infinitely many local conditions is, in practice, a finite computation — solvability mod 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 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 has a nontrivial solution over and over for every prime — 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 nontrivially solvable over ? Check : yes trivially (indefinite form, e.g. plenty of real solutions by continuity/sign considerations — take large). Check small primes dividing the coefficients () and : mod , need , i.e. ; try : need , i.e. (since ), so works — solvable mod 5, and since the relevant partial derivative is nonzero here, Hensel lifts this to a genuine solution in . Similarly one checks and (both solvable by the same style of check) and . Since all local conditions hold, Hasse–Minkowski guarantees a rational solution exists — and indeed one can find it directly: gives and — 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 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 , 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 sits in an exact sequence , where (the Tate–Shafarevich group) is, essentially by definition, the group measuring exactly the Selmer-cubic-style failures for the specific curve . Given everything above, explain in your own words why computing the rank of (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 -adic number theory: Iwasawa theory and Galois representations
Objectives: understand, at a sketch level, what a -adic -function is and why it’s natural; understand why is the right coefficient ring for the Galois representations behind Wiles’s proof.
Exposition. Classical fact (Kummer, 19th century, well before -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 , whenever the indices are congruent mod . These Kummer congruences look, in hindsight, exactly like the statement “a certain function is -adically continuous, sampled only at integer points” — and that is precisely what Kubota and Leopoldt made precise in 1964, constructing an honest -adic -function , a genuine continuous (in fact -adic analytic) function on a -adic domain, that interpolates the classical values at negative integers, packaging infinitely many classical congruences into one analytic object living natively in . This is the general pattern of Iwasawa theory: take a sequence of classical arithmetic invariants (class numbers, -values, ranks of elliptic curves) indexed by integers or by fields in a tower, and show they’re literally the values of one -adic analytic function, which then lets you use -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 (or a modular form) is a continuous homomorphism for a suitable coefficient ring . The mod version has , and is comparatively simple (finite target, easy to compute with). Wiles’s strategy for proving modularity was to start from a mod- representation known to be modular, and deform it — that is, study the entire space of -adic (, or more generally a complete local -algebra) representations reducing to that fixed mod- one — and show, via the celebrated “” theorem (comparing a deformation ring to a Hecke algebra), that every such deformation is modular. isn’t a minor technical convenience in this story — it is the only reason the deformation space (an honest, structured, -adically-complete geometric object) exists at all for the argument to act on. Without the -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 (): take . Kummer’s congruence predicts whenever (since ) and . Check (both ): and . Working -adically (, coprime to 5; coprime to 5, so both are -adic units): , and , so while the denominator is a unit — so indeed . ✓ — a finite, checkable instance of the exact congruence phenomenon that motivated the entire construction of -adic -functions.
Problem set 8. 1. Check the Kummer congruence prediction for at (again ) using the Bernoulli numbers given above. 2. In your own words, explain the difference between what a classical -function encodes (an analytic function of a complex variable ) and what a -adic -function encodes (a -adic analytic function of a -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 ( as topological groups), that a “-adic variable” can meaningfully vary continuously the way a complex variable does — what plays the role of ’s connectedness/openness here, given that 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 , with various generalizations since) and its relationship to the -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 -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 -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/-adic--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 -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 -adic Expansion of Rational Numbers” and “Infinite Series in -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 -adic -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 -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 — -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: -adic field 3.6.7.3. - SageMath — Introduction to the -adics — free, runs in-browser via SageCell, lets you construct , 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.
How to read this as your next moves, in rough order of directness:
- Algebraic number theory more broadly (rings of integers, ramification, class groups, global class field theory) is the natural companion thread if §2–§3 (valuations, Ostrowski, local fields) was the most satisfying part — it’s the global counterpart to everything local built here, and the two halves (local + global, glued by adeles) are how professional number theorists actually think.
- Iwasawa theory and -adic -functions, then Galois representations and the Langlands program, is the natural next thread if Module 8 was the draw — this is the most direct route back into the Wiles storyline from your elliptic curves course, but now from the -adic-analytic side rather than the modular-forms side.
- -adic Hodge theory and rigid/Berkovich analytic geometry is the thread if Module 6 (p-adic analysis) and the ultrametric topology of Module 3 were the draw — this is genuinely a full alternate universe of “geometry,” parallel to complex analytic geometry, and one of the most active current research areas (Scholze’s perfectoid spaces).
- The local-global principle and Diophantine geometry (Chabauty’s method, which uses -adic analysis directly to bound rational points on curves — another explicit bridge to your elliptic curves course) is the applied-to-classical-problems thread if Module 7 was the draw.
- Model theory of valued fields (the Ax–Kochen theorem, which uses -adic fields to resolve a question originally about , via a completely different toolkit — mathematical logic) is a left-field but genuinely rewarding thread if the “totally disconnected, non-discrete” topology of Module 3 fascinated you and you’re curious what other fields find that structure useful for.
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. . ; ; (5 doesn’t divide 72). 2. , i.e. . 3. WLOG . Write ; suppose for contradiction . Then has (since both terms exceed by assumption/given), a contradiction. So , giving . 4. . , , , all other primes , . Product: ✓.
Module 2 1. Solve : mod 7, (). Mod 49: , (), and ✓ consistent. Continuing gives (digit pattern stabilizes at after the first digit, since $1/2 = (1+6)/2 = $ … equivalently , and one can directly find ’s expansion: by the same telescoping trick as the example, since for all isn’t quite right — the clean way: is false in , but ; check , and ✓, so digit-by-digit and agree — giving in ). 2. Injective: if integers agree -adically they’d have , forcing in , contradiction. Not surjective: from the worked example is not equal to any single integer (its expansion never terminates and never eventually-stabilizes at , which is required of nonneg integers, nor does it equal a negative integer other than via the specific eventually-constant-at- pattern matching that integer — more simply, any element whose digit sequence is not eventually periodic-with-period-dividing-appropriately / not eventually constant at or forced pattern is a non-integer, e.g. -style sparse sums, or simply any square root from Module 4 like , which is irrational hence not an integer). 3. Given , the truncations satisfy , so : an explicit sequence of integers converging to . 4. is exactly the truncated sum — the compatibility condition 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 : (using so ), so ; the reverse inclusion is symmetric. Hence . 2. Given a sequence in , infinitely many share the same digit (pigeonhole, only choices); pass to that subsequence; among those, infinitely many share 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 -adic number with those digits. 3. Same radius, disjoint: and in (residues and mod are different, and balls of radius are exactly residue classes mod — disjoint since ). Different radii, nested: (a finer residue class mod sits inside the coarser one mod 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 ; is not a square mod 3, and since is a unit (), Hensel’s non-solvability is definitive here (unit square-ness mod for odd exactly determines square-ness in ) — so no, has no solution in . 2. solvable in (p odd) iff is a square mod (Hensel applies directly since whenever , and can’t be a root since ) iff — exactly the classical elementary number theory fact about which primes are sums of two squares / have as a QR. 3. Mod 7: need , . Try : ✓. , , , so Hensel applies: a genuine cube root of unity exists in (and gives the third one, since are exactly the cube roots of unity mod 7, matching as ). 4. Take , near : but too — hypothesis fails. Here it happens genuinely is a root, so this particular case doesn’t demonstrate failure; a cleaner failing example: over at where (need odd, : ) but — and indeed has no solution in (check mod 4: odd squares are , never ) — confirming the simple form of Hensel’s Lemma genuinely cannot be dropped.
Module 5 1. If then , i.e. . Its digit expansion has ; one can construct digit-by-digit exactly as in Module 2 Problem 1 (solve inductively, using that is invertible mod for every since it’s a unit mod ), producing . 2. : exactly the th roots of unity, matching lifted via Teichmüller — so contains exactly roots of unity of orders dividing 6 (orders 1,2,3,6, i.e. , two primitive cube roots, two primitive 6th roots), and no roots of unity of any other order (the -units are torsion-free, so contribute none). 3. For : is trivial, so there’s no nontrivial root-of-unity part to split off via that mechanism; separately, is not torsion-free the way is for odd (e.g. but ), so the log map isn’t injective on all of — you must restrict to for the clean isomorphism, and handle separately. 4. True (for odd): the decomposition (Teichmüller part times -unit) is unique because (a root of unity that’s and has order dividing , coprime to , must itself be trivial — a nontrivial root of unity of order dividing is never 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. (since ) for every prime , so yes, converges in every . 2. . In , and are units (5-adic integers themselves, computable as in Module 2), so the series is ; to three terms, as an element of : , left symbolic since simplifying further just means finding in as in earlier modules. 3. If : given choose with for ; then for , (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 is Cauchy, hence converges (completeness of ). Converse (convergent ) is the same easy argument that works in too (). 4. In , adding many small positive terms can accumulate without bound (that’s exactly what does) because the ordinary triangle inequality only gives , a bound that can grow. The ultrametric inequality instead gives — 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 and ; 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 not dividing the discriminant of the quadratic form, the form is “smooth” mod (nondegenerate), which is exactly the condition (, suitably generalized to several variables via the Jacobian) guaranteeing any mod- solution lifts to a genuine -solution — so solvability mod (a finite check, and one that’s automatic for “most” by general point-counting bounds for quadratic forms) is equivalent to solvability in at all good primes. 3. It’s a special feature of (nondegenerate) quadratic forms specifically, not a general theorem about — 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 , which sits inside the Selmer group — a computable object built entirely from local data at every place, exactly the local-global machinery of this module. The exact sequence shows over-counts the true rank data by exactly ; if 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. , . Difference ; , so while is coprime to 5 (check: , and neither nor is divisible by 5) — so of the difference is , confirming ✓. 2. A classical -function is a single analytic function of one complex variable , 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 -adic -function is a -adic analytic function of a -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 itself is totally disconnected, the relevant “variable” typically ranges over a genuinely connected-in-the-relevant-sense -adic analytic space (e.g. a disk under , or more generally rigid-analytic space) where “-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 (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 “-adic shadow” of a hard classical conjecture can sometimes be proved before the classical statement is, because -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.