A topic in the Open Knowledge Graph — a free, open map of 15,290 topics and the order to learn them in.

Introduction to p-adic Numbers

Research Depth 81 in the knowledge graph ☐ I know this ☆ Set as goal
1topic build on this
372prerequisites beneath it
See this on the map →
p-adic ValuationArithmetic in p-adic Numbers+1 more→→Hensel's Lemma
p-adic-numbers metric-spaces completion

Core Idea

The p-adic numbers ℚ_p are the completion of ℚ under the p-adic metric d_p(x, y) = p^(-v_p(x-y)). They provide a 'p-adic topology' where convergence is based on divisibility by powers of p, enabling tools like Hensel lifting.

Explainer

You already know the p-adic valuation v_p(n): it counts how many times the prime p divides an integer n. If n = 12 and p = 2, then v₂(12) = 2 because 12 = 4 × 3. The p-adic absolute value is defined as |x|_p = p^(−v_p(x)), with |0|_p = 0. This inverts our usual sense of size: numbers highly divisible by p are *small* in the p-adic world. In the 5-adic world, 125 = 5³ has absolute value 5⁻³ = 1/125 — it's tiny, not large.

The p-adic metric d_p(x, y) = |x − y|_p measures how close two numbers are by how divisible their difference is by p. Two integers are close if their difference is divisible by a high power of p. This is a legitimate metric, and it satisfies the much stronger ultrametric inequality: d_p(x, z) ≤ max(d_p(x, y), d_p(y, z)). This "non-Archimedean" property means the hypotenuse of a triangle is never longer than its longest side — a world very different from the geometry you're used to.

From your study of metric spaces, you know that every metric space can be completed by adding limits of Cauchy sequences. The reals ℝ are the completion of ℚ under the usual absolute value. ℚ_p is the completion of ℚ under the p-adic absolute value. Concretely, every element of ℚ_p can be written as a formal power series in p: a₀ + a₁p + a₂p² + a₃p³ + ⋯, where each coefficient aᵢ is an integer between 0 and p−1. This looks like a base-p expansion, but it extends infinitely to the left (toward higher powers of p) rather than to the right.

This representation reveals surprising facts. In ℚ₃, the number −1 equals 2 + 2·3 + 2·3² + 2·3³ + ⋯ — an infinite string of 2's in base 3. This is valid because the partial sums converge 3-adically: after n terms, the error is 3ⁿ, and |3ⁿ|₃ = 3⁻ⁿ → 0. There are infinitely many p-adic number systems, one for each prime, and Ostrowski's theorem says these — together with the usual absolute value — are the only ways to complete the rationals. The reals and all the p-adic fields together capture every possible notion of size on ℚ.

Practice Questions 5 questions

Prerequisite Chain

Understanding Zero → The Number Zero → Counting to Five → Counting to 10 → Counting to 20 → Counting a Set of Objects Up to 20 → Cardinality: The Last Number Counted → Matching Numerals to Quantities → Subitizing Small Quantities → Addition Within 10 → Number Bonds to 10 → Addition Within 20 → Doubles and Near Doubles → Doubles Facts Within 10 → Near Doubles Facts Within 20 → Mental Math Strategies for Addition → Mental Math: Adding and Subtracting Tens → Addition Within 100 → Repeated Addition as Multiplication → Multiplication as Equal Groups → Multiplication: Arrays → Basic Multiplication Facts (0s, 1s, 2s, 5s, 10s) → Multiplication Facts Within 100 → Division as Equal Sharing → Division as Grouping (Measurement Division) → Division: Grouping (Repeated Subtraction) Model → Division: Fair Sharing Model → Division as Equal Sharing → Division as Grouping → Basic Division Facts → Division Facts Within 100 → Multiplication and Division Fact Families → Relationship Between Multiplication and Division → Division Facts as Inverse of Multiplication → Remainders and Quotients in Division → Division Word Problems → Multi-Step Word Problems → Solving Multi-Step Word Problems → Multiplication Word Problems → Division Word Problems → Introduction to Long Division → Factors and Multiples → Prime and Composite Numbers → Equivalent Fractions → Relating Fractions and Decimals → Decimal Place Value → Integers and the Number Line → Comparing and Ordering Integers → Absolute Value → Adding Integers → Subtracting Integers → Multiplying Integers → Introduction to Exponents → Order of Operations → Integer Order of Operations → Variable Expressions → The Distributive Property → Variables and Expressions Review → Introduction to Polynomials → Adding and Subtracting Polynomials → Multiplying Polynomials → Factorial → Permutations → Combinations → Counting Principles: Addition and Multiplication Rules → Introduction to Graph Theory → Propositional Logic Foundations → Logical Equivalences → Set Operations: Union, Intersection, and Complement → Proof by Cases → Proving by Cases and Exhaustion → Vacuous Truth and Trivial Cases → Proof by Cases (Proof by Exhaustion) → Mathematical Induction → Divisibility and Greatest Common Divisor → The Fundamental Theorem of Arithmetic → Divisibility Theory (Formal Treatment) → Fundamental Theorem of Arithmetic (Rigorous Proof) → p-adic Valuation → Introduction to p-adic Numbers → Arithmetic in p-adic Numbers → Introduction to p-adic Numbers

Longest path: 82 steps · 372 total prerequisite topics

Prerequisites (3)

Leads To (1)