How statement and proof provenance work
The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.
- Literature-sourced: the exact statement appears in a cited source; only wording and notation differ.
- AI-adapted: a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
- AI-generated: a genuinely novel statement formulated by AI, with no source for the claim itself.
These labels describe origin, not correctness: citations and verification chips remain separate evidence.
The -adic absolute value gives an ultrametric on , in which every triangle is isosceles and every point of a ball is a centre
Example
Write . Call an integer (The integers as equivalence classes of pairs of naturals) even if it is for some integer , and odd if it is for some integer .
The -adic valuation. Every nonzero integer can be written in exactly one way as
and is the -adic valuation of (Integer powers ). For a nonzero rational (The rationals as equivalence classes of pairs of integers), written with and nonzero integers, the integer
does not depend on the chosen representation. The -adic absolute value is
read inside through the embeddings (The integers embed in the rationals, The unique embedding of ℚ into an ordered field), and the -adic distance is
Claims.
- is an ultrametric on (Metric space: iff , symmetry, and the triangle inequality; pseudometric and ultrametric): it satisfies (M1), (M2) and the strong triangle inequality .
- Every triangle is isosceles: if then .
- Every point of a ball is a centre: if then (Open ball, closed ball and sphere in a metric space).
Why and not a general prime. The general -adic valuation needs primality and unique factorisation in , which are developed on Primes, Euclid's Lemma and the Fundamental Theorem of Arithmetic (The -adic valuation of a nonzero integer: the greatest with , Euclid's lemma: if is prime and then or , The fundamental theorem of arithmetic: every integer is a product of primes, and the factorisation is unique up to order — if with every and prime, then and for some , The -adic valuation extends to the nonzero rationals by , independently of the representation; it satisfies , and whenever , and are nonzero) and are therefore available here; this item nevertheless develops the case from parity alone, so that the ultrametric geometry below rests on nothing but the discreteness of . At everything reduces to parity, which is available: The even and odd index maps and the alternating sequence: strictly increasing with their disjoint union, and the unique with , , which satisfies , and partitions into the ranges of its two index maps, and that is what claim 2 of the verification turns into "even or odd, never both".
Claims 2 and 3 use nothing about beyond the strong triangle inequality, so they hold in every ultrametric space.
Facts & Assumptions
Given: The integers and rationals with their arithmetic; the successor on ; the element ; the index maps of The even and odd index maps and the alternating sequence: strictly increasing with their disjoint union, and the unique with , , which satisfies , and ; and integers and rationals as introduced in the steps.
Ring and field arithmetic: is a commutative ring (The integers form a commutative ring) and a field (The rationals form a field, The rationals as equivalence classes of pairs of integers); is totally ordered and its order is compatible with addition and with multiplication by positives (The integers form a totally ordered ring); nonzero integers have nonzero product and cancel (The integers have no zero divisors; multiplicative cancellation).
Induction (The principle of mathematical induction) and strong induction (Strong (complete) induction) on (The natural numbers (von Neumann)).
The index maps: , , , , and is the disjoint union of the ranges of and , each natural lying in exactly one range and being hit exactly once (The even and odd index maps and the alternating sequence: strictly increasing with their disjoint union, and the unique with , , which satisfies , and ).
Addition on : , (Addition of natural numbers) and (Left successor law for addition); the order is total and transitive (Order on the natural numbers, is a linear order on ), and gives (Discreteness: is the immediate successor).
The embedding is injective, preserves addition, multiplication and order, and its image is exactly the set of integers (The naturals embed in the integers); the embeddings are injective and order preserving (The integers embed in the rationals, The unique embedding of ℚ into an ordered field).
Powers: , , and , valid for integer exponents when , and gives (Integer powers , Laws of integer exponents); for and one has , and gives (Monotonicity of and of ).
Order in : hence (The multiplicative identity is positive, Order is preserved by adding a constant and by adding inequalities); products and inverses of positives are positive and scaling preserves inequalities (Sign rules for products and monotonicity of multiplication, Inverses of positives are positive, and reciprocation reverses order, Field, Ordered field, Complete ordered field (least-upper-bound property)).
Metric notions: the axioms (M1), (M2), (M3), the strong form (M3'), and the fact that a function satisfying (M1), (M2), (M3') is nonnegative and hence satisfies (M3), the maximum of two nonnegative reals being at most their sum (Metric space: iff , symmetry, and the triangle inequality; pseudometric and ultrametric, Nonnegativity of a metric is a consequence of the other axioms, not an axiom, Maximum and minimum of a set, Every nonempty finite set of reals has a maximum and a minimum); balls are as in Open ball, closed ball and sphere in a metric space.
Verification
For every one has and , by induction on : at , and ; and if and , then and , using and .
No integer satisfies : such a would be positive, hence the image of a natural , so and, the embedding being order preserving, , contradicting .
A product of two odd integers is odd: by ring arithmetic.
Every natural number is for exactly one , or for exactly one , and never both: this is the disjoint-union statement for the ranges of and , rewritten through step 1.1.
No integer is both even and odd: if then the integer satisfies , and would give while would give , so , which step 1.2 forbids.
Every integer is even or odd: an integer is the image of a natural , which by step 2.1 is or , so is or with the image of , the embedding preserving addition and successors; and if then is or , whence or .
The representation is unique: if with odd and, without loss of generality, , then and cancelling the nonzero factor gives ; if then and is even as well as odd, which step 2.2 forbids; so and then .
Every nonzero integer is with and odd: apply strong induction to the property that every nonzero integer whose absolute value is the image of , that is every nonzero equal to the image of or to its negative, has such a representation. Given and for all , note since ; by step 2.1 either , in which case is and hence odd by the computation of step 3.1, so works, or with , in which case for the nonzero integer that is the image of or its negative, and because gives , so supplies and . Every nonzero integer is the image of some natural or its negative, so the conclusion holds for all of them.
For nonzero integers with : . Indeed write and with odd and, without loss of generality, ; then , the bracket is a nonzero integer, so by step 4.1 it equals with odd, whence and, by the uniqueness of step 3.2, .
The valuation of a nonzero rational is well defined: if with nonzero integers then , and writing , , , with all four of odd gives and with and odd by step 1.3; the uniqueness of step 3.2 applied to the nonzero integer forces , that is .
Basic properties of : for the value is a positive real, since and powers and inverses of positives are positive; so for and exactly when . Moreover , because and with odd when , so .
Strong triangle inequality for : . If , or , or , this is immediate from step 6.1. Otherwise write and over a common nonzero denominator , with nonzero integers, so that with ; then , and , so step 5.1 gives ; finally is strictly increasing on , since for one has with and , so .
Claim 1: vanishes exactly when by step 6.1, is symmetric because , and satisfies by step 7.1; being nonnegative, it also satisfies the ordinary triangle inequality, the maximum of two nonnegative reals being at most their sum. So is an ultrametric on .
Claim 2: suppose and, without loss of generality, . Then ; and , where the maximum cannot be , since that would give ; so and the two are equal, that is .
Claim 3: let , so . For the strong triangle inequality gives , so ; and for it gives , so . Hence .
Claims 1, 2 and 3 are established by steps 8.1, 9.1 and 9.2, so the -adic distance is an ultrametric on in which every triangle is isosceles and every point of a ball is a centre.
Remarks
- Where parity is spent, and where it is not. The partition of into the two ranges of The even and odd index maps and the alternating sequence: strictly increasing with their disjoint union, and the unique with , , which satisfies , and is used exactly twice: in step 2.1, to know that a natural is even or odd, and through it in step 3.1 for the integers. Uniqueness of the valuation (step 3.2) uses only that no integer is both even and odd, which step 2.2 derives from the discreteness of rather than from the partition.
- What an ultrametric costs and what it buys. Claims 2 and 3 are formal consequences of (M3') and hold in every ultrametric space (Metric space: iff , symmetry, and the triangle inequality; pseudometric and ultrametric); they are recorded here because they are the two facts that make ultrametric geometry look unlike the real line, where a triangle need not be isosceles and a ball has exactly one centre.
- The general -adic absolute value, and what this item does instead. Its well-definedness needs the primality of in the form of Euclid's lemma, that dividing a product divides one of the factors. That is Euclid's lemma: if is prime and then or , and the resulting valuation on is The -adic valuation extends to the nonzero rationals by , independently of the representation; it satisfies , and whenever , and are nonzero, both on the primes page and both available here. This item deliberately does not use them: at the statement doing the same work is that a product of odd integers is odd, proved in step 1.3 above by a one-line ring computation, so the whole development below is self-contained from parity.
Depends on
- Euclid's lemma: if $p$ is prime and $p \mid ab$ then $p \mid a$ or $p \mid b$
- The $p$-adic valuation $v_p(a)$ of a nonzero integer: the greatest $k \in \mathbb{N}$ with $p^{k} \mid a$
- The fundamental theorem of arithmetic: every integer $n \ge 1$ is a product of primes, and the factorisation is unique up to order — if $\prod_{i<r} p_i = \prod_{j<s} q_j$ with every $p_i$ and $q_j$ prime, then $r = s$ and $q_i = p_{\pi(i)}$ for some $\pi \in \operatorname{Sym}(r)$
- The $p$-adic valuation extends to the nonzero rationals by $v_p(a/b) := v_p(a) - v_p(b) \in \mathbb{Z}$, independently of the representation; it satisfies $v_p(xy) = v_p(x) + v_p(y)$, and $v_p(x+y) \ge \min\{v_p(x), v_p(y)\}$ whenever $x$, $y$ and $x+y$ are nonzero
- Metric space: $d(x,y) = 0$ iff $x = y$, symmetry, and the triangle inequality; pseudometric and ultrametric
- Open ball, closed ball and sphere in a metric space
- The integers as equivalence classes of pairs of naturals
- The rationals as equivalence classes of pairs of integers
- Integer powers $a^m$
- Strong (complete) induction
- The even and odd index maps and the alternating sequence: strictly increasing $e, o$ with $\mathbb{N}$ their disjoint union, and the unique $(s_k)$ with $s_0 = 1$, $s_{\sigma(k)} = -s_k$, which satisfies $|s_k| = 1$, $s \circ e \equiv 1$ and $s \circ o \equiv -1$
- The principle of mathematical induction
- Addition of natural numbers
- Left successor law for addition
- Order on the natural numbers
- Discreteness: $\sigma(n)$ is the immediate successor
- $\le$ is a linear order on $\mathbb{N}$
- The naturals embed in the integers
- The integers form a commutative ring
- The integers form a totally ordered ring
- The integers have no zero divisors; multiplicative cancellation
- The integers embed in the rationals
- The unique embedding of ℚ into an ordered field
- The rationals form a field
- Laws of integer exponents
- Monotonicity of $x \mapsto x^n$ and of $n \mapsto a^n$
- Maximum and minimum of a set
- Every nonempty finite set of reals has a maximum and a minimum
- Nonnegativity of a metric is a consequence of the other axioms, not an axiom
- The multiplicative identity is positive
- Order is preserved by adding a constant and by adding inequalities
- Sign rules for products and monotonicity of multiplication
- Inverses of positives are positive, and reciprocation reverses order
- The natural numbers $\mathbb{N}$ (von Neumann)
- Field
- Ordered field
- Complete ordered field (least-upper-bound property)
Used by
Nothing in the library uses this result yet.
Dependency tree · next 3 levels
Direct dependencies and their dependencies through the next three levels: 134 results over 31 levels. An arrow runs from a result to what uses it, and this result sits at the bottom with a heavier outline. Click the chart to enlarge it.
Sources
- P-adic number (Wikipedia) (standard reference, not scraped)
- Ultrametric space (Wikipedia) (standard reference, not scraped)
- Parity (mathematics) (Wikipedia) (standard reference, not scraped)
- Valuation (algebra) (Wikipedia) (standard reference, not scraped)