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 moreHensel'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 ZeroThe Number ZeroCounting to FiveCounting to 10Counting to 20Counting a Set of Objects Up to 20Cardinality: The Last Number CountedMatching Numerals to QuantitiesSubitizing Small QuantitiesAddition Within 10Number Bonds to 10Addition Within 20Doubles and Near DoublesDoubles Facts Within 10Near Doubles Facts Within 20Mental Math Strategies for AdditionMental Math: Adding and Subtracting TensAddition Within 100Repeated Addition as MultiplicationMultiplication as Equal GroupsMultiplication: ArraysBasic Multiplication Facts (0s, 1s, 2s, 5s, 10s)Multiplication Facts Within 100Division as Equal SharingDivision as Grouping (Measurement Division)Division: Grouping (Repeated Subtraction) ModelDivision: Fair Sharing ModelDivision as Equal SharingDivision as GroupingBasic Division FactsDivision Facts Within 100Multiplication and Division Fact FamiliesRelationship Between Multiplication and DivisionDivision Facts as Inverse of MultiplicationRemainders and Quotients in DivisionDivision Word ProblemsMulti-Step Word ProblemsSolving Multi-Step Word ProblemsMultiplication Word ProblemsDivision Word ProblemsIntroduction to Long DivisionFactors and MultiplesPrime and Composite NumbersEquivalent FractionsRelating Fractions and DecimalsDecimal Place ValueIntegers and the Number LineComparing and Ordering IntegersAbsolute ValueAdding IntegersSubtracting IntegersMultiplying IntegersIntroduction to ExponentsOrder of OperationsInteger Order of OperationsVariable ExpressionsThe Distributive PropertyVariables and Expressions ReviewIntroduction to PolynomialsAdding and Subtracting PolynomialsMultiplying PolynomialsFactorialPermutationsCombinationsCounting Principles: Addition and Multiplication RulesIntroduction to Graph TheoryPropositional Logic FoundationsLogical EquivalencesSet Operations: Union, Intersection, and ComplementProof by CasesProving by Cases and ExhaustionVacuous Truth and Trivial CasesProof by Cases (Proof by Exhaustion)Mathematical InductionDivisibility and Greatest Common DivisorThe Fundamental Theorem of ArithmeticDivisibility Theory (Formal Treatment)Fundamental Theorem of Arithmetic (Rigorous Proof)p-adic ValuationIntroduction to p-adic NumbersArithmetic in p-adic NumbersIntroduction to p-adic Numbers

Longest path: 82 steps · 372 total prerequisite topics

Prerequisites (3)

Leads To (1)