Alphabeta Math
ExampleConstruction: AI-adaptedVerification: AI-generatedSession-authored (Fable 5 assisted)precheck passaudited 2026-07-27
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 22-adic absolute value gives an ultrametric on Q\mathbb{Q}, in which every triangle is isosceles and every point of a ball is a centre

Example

Write 2:=1+12 := 1 + 1. Call an integer (The integers as equivalence classes of pairs of naturals) even if it is 2t2t for some integer tt, and odd if it is 2t+12t + 1 for some integer tt.

The 22-adic valuation. Every nonzero integer mm can be written in exactly one way as

m=2juwith jN and u odd,m = 2^{\,j} u \qquad \text{with } j \in \mathbb{N} \text{ and } u \text{ odd},

and v2(m):=jv_2(m) := j is the 22-adic valuation of mm (Integer powers ama^m). For a nonzero rational xx (The rationals as equivalence classes of pairs of integers), written x=a/bx = a/b with aa and bb nonzero integers, the integer

v2(x):=v2(a)v2(b)v_2(x) := v_2(a) - v_2(b)

does not depend on the chosen representation. The 22-adic absolute value is

x2:=2v2(x)(x0),02:=0,|x|_2 := 2^{-v_2(x)} \quad (x \ne 0), \qquad |0|_2 := 0,

read inside R\mathbb{R} through the embeddings ZQR\mathbb{Z} \to \mathbb{Q} \to \mathbb{R} (The integers embed in the rationals, The unique embedding of ℚ into an ordered field), and the 22-adic distance is

d2(x,y):=xy2(x,yQ).d_2(x,y) := |x - y|_2 \qquad (x, y \in \mathbb{Q}).

Claims.

  1. d2d_2 is an ultrametric on Q\mathbb{Q} (Metric space: d(x,y)=0d(x,y) = 0 iff x=yx = y, symmetry, and the triangle inequality; pseudometric and ultrametric): it satisfies (M1), (M2) and the strong triangle inequality d2(x,z)max{d2(x,y),d2(y,z)}d_2(x,z) \le \max\{d_2(x,y), d_2(y,z)\}.
  2. Every triangle is isosceles: if d2(x,y)d2(y,z)d_2(x,y) \ne d_2(y,z) then d2(x,z)=max{d2(x,y),d2(y,z)}d_2(x,z) = \max\{d_2(x,y), d_2(y,z)\}.
  3. Every point of a ball is a centre: if yB(x,r)y \in B(x,r) then B(y,r)=B(x,r)B(y,r) = B(x,r) (Open ball, closed ball and sphere in a metric space).

Why p=2p = 2 and not a general prime. The general pp-adic valuation needs primality and unique factorisation in Z\mathbb{Z}, which are developed on Primes, Euclid's Lemma and the Fundamental Theorem of Arithmetic (The pp-adic valuation vp(a)v_p(a) of a nonzero integer: the greatest kNk \in \mathbb{N} with pkap^{k} \mid a, Euclid's lemma: if pp is prime and pabp \mid ab then pap \mid a or pbp \mid b, The fundamental theorem of arithmetic: every integer n1n \ge 1 is a product of primes, and the factorisation is unique up to order — if i<rpi=j<sqj\prod_{i<r} p_i = \prod_{j<s} q_j with every pip_i and qjq_j prime, then r=sr = s and qi=pπ(i)q_i = p_{\pi(i)} for some πSym(r)\pi \in \operatorname{Sym}(r), The pp-adic valuation extends to the nonzero rationals by vp(a/b):=vp(a)vp(b)Zv_p(a/b) := v_p(a) - v_p(b) \in \mathbb{Z}, independently of the representation; it satisfies vp(xy)=vp(x)+vp(y)v_p(xy) = v_p(x) + v_p(y), and vp(x+y)min{vp(x),vp(y)}v_p(x+y) \ge \min\{v_p(x), v_p(y)\} whenever xx, yy and x+yx+y are nonzero) and are therefore available here; this item nevertheless develops the case p=2p = 2 from parity alone, so that the ultrametric geometry below rests on nothing but the discreteness of Z\mathbb{Z}. At p=2p = 2 everything reduces to parity, which is available: The even and odd index maps and the alternating sequence: strictly increasing e,oe, o with N\mathbb{N} their disjoint union, and the unique (sk)(s_k) with s0=1s_0 = 1, sσ(k)=sks_{\sigma(k)} = -s_k, which satisfies sk=1|s_k| = 1, se1s \circ e \equiv 1 and so1s \circ o \equiv -1 partitions N\mathbb{N} 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 d2d_2 beyond the strong triangle inequality, so they hold in every ultrametric space.

Facts & Assumptions

Given: The integers Z\mathbb{Z} and rationals Q\mathbb{Q} with their arithmetic; the successor σ\sigma on N\mathbb{N}; the element 2=1+12 = 1 + 1; the index maps e,oe, o of The even and odd index maps and the alternating sequence: strictly increasing e,oe, o with N\mathbb{N} their disjoint union, and the unique (sk)(s_k) with s0=1s_0 = 1, sσ(k)=sks_{\sigma(k)} = -s_k, which satisfies sk=1|s_k| = 1, se1s \circ e \equiv 1 and so1s \circ o \equiv -1; and integers m,a,cm, a, c and rationals x,y,zx, y, z as introduced in the steps.

[L1]

Ring and field arithmetic: Z\mathbb{Z} is a commutative ring (The integers form a commutative ring) and Q\mathbb{Q} a field (The rationals form a field, The rationals as equivalence classes of pairs of integers); Z\mathbb{Z} 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).

[L3]

The index maps: e0=0e_0 = 0, eσ(j)=σ(σ(ej))e_{\sigma(j)} = \sigma(\sigma(e_j)), o0=σ(0)o_0 = \sigma(0), oσ(j)=σ(σ(oj))o_{\sigma(j)} = \sigma(\sigma(o_j)), and N\mathbb{N} is the disjoint union of the ranges of ee and oo, each natural lying in exactly one range and being hit exactly once (The even and odd index maps and the alternating sequence: strictly increasing e,oe, o with N\mathbb{N} their disjoint union, and the unique (sk)(s_k) with s0=1s_0 = 1, sσ(k)=sks_{\sigma(k)} = -s_k, which satisfies sk=1|s_k| = 1, se1s \circ e \equiv 1 and so1s \circ o \equiv -1).

[L4]

Addition on N\mathbb{N}: m+0=mm + 0 = m, m+σ(k)=σ(m+k)m + \sigma(k) = \sigma(m+k) (Addition of natural numbers) and σ(m)+n=σ(m+n)\sigma(m) + n = \sigma(m+n) (Left successor law for addition); the order is total and transitive (Order on the natural numbers, \le is a linear order on N\mathbb{N}), and n0n \ne 0 gives n1n \ge 1 (Discreteness: σ(n)\sigma(n) is the immediate successor).

[L5]

The embedding NZ\mathbb{N} \to \mathbb{Z} is injective, preserves addition, multiplication and order, and its image is exactly the set of integers 0\ge 0 (The naturals embed in the integers); the embeddings ZQR\mathbb{Z} \to \mathbb{Q} \to \mathbb{R} are injective and order preserving (The integers embed in the rationals, The unique embedding of ℚ into an ordered field).

[L6]

Powers: a0=1a^0 = 1, an+1=anaa^{n+1} = a^n a, am+n=amana^{m+n} = a^m a^n and am=(am)1a^{-m} = (a^m)^{-1}, valid for integer exponents when a0a \ne 0, and a0a \ne 0 gives an0a^n \ne 0 (Integer powers ama^m, Laws of integer exponents); for a>1a > 1 and k1k \ge 1 one has aka>1a^k \ge a > 1, and a>0a > 0 gives an>0a^n > 0 (Monotonicity of xxnx \mapsto x^n and of nann \mapsto a^n).

[L8]

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: d(x,y)=0d(x,y) = 0 iff x=yx = y, 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

technique · direct
1.1

For every jNj \in \mathbb{N} one has ej=j+je_j = j + j and oj=σ(j+j)o_j = \sigma(j+j), by induction on jj: at j=0j = 0, e0=0=0+0e_0 = 0 = 0 + 0 and o0=σ(0)=σ(0+0)o_0 = \sigma(0) = \sigma(0+0); and if ej=j+je_j = j+j and oj=σ(j+j)o_j = \sigma(j+j), then eσ(j)=σ(σ(ej))=σ(σ(j+j))=σ(j)+σ(j)e_{\sigma(j)} = \sigma(\sigma(e_j)) = \sigma(\sigma(j+j)) = \sigma(j) + \sigma(j) and oσ(j)=σ(σ(oj))=σ(σ(σ(j+j)))=σ(σ(j)+σ(j))o_{\sigma(j)} = \sigma(\sigma(o_j)) = \sigma(\sigma(\sigma(j+j))) = \sigma(\sigma(j)+\sigma(j)), using σ(p)+q=σ(p+q)\sigma(p) + q = \sigma(p+q) and p+σ(q)=σ(p+q)p + \sigma(q) = \sigma(p+q).

L2L3L4
1.2

No integer kk satisfies 0<k<10 < k < 1: such a kk would be positive, hence the image of a natural n0n \ne 0, so n1n \ge 1 and, the embedding being order preserving, k1k \ge 1, contradicting k<1k < 1.

L1L4L5
1.3

A product of two odd integers is odd: (2a+1)(2c+1)=2(2ac+a+c)+1(2a+1)(2c+1) = 2(2ac + a + c) + 1 by ring arithmetic.

L1
2.1

Every natural number is j+jj + j for exactly one jj, or σ(j+j)\sigma(j+j) for exactly one jj, and never both: this is the disjoint-union statement for the ranges of ee and oo, rewritten through step 1.1.

step 1.1L3
2.2

No integer is both even and odd: if 2s=2t+12s = 2t + 1 then the integer k:=stk := s - t satisfies 2k=12k = 1, and k0k \le 0 would give 2k0<12k \le 0 < 1 while k1k \ge 1 would give 2k2>12k \ge 2 > 1, so 0<k<10 < k < 1, which step 1.2 forbids.

step 1.2L1L7
3.1

Every integer is even or odd: an integer m0m \ge 0 is the image of a natural nn, which by step 2.1 is j+jj+j or σ(j+j)\sigma(j+j), so mm is 2t2t or 2t+12t+1 with tt the image of jj, the embedding preserving addition and successors; and if m<0m < 0 then m>0-m > 0 is 2t2t or 2t+12t+1, whence m=2(t)m = 2(-t) or m=2(t1)+1m = 2(-t-1)+1.

step 2.1L1L5
3.2

The representation is unique: if 2ju=2ju2^{\,j}u = 2^{\,j'}u' with u,uu, u' odd and, without loss of generality, jjj \le j', then 2j=2j2jj2^{\,j'} = 2^{\,j}2^{\,j'-j} and cancelling the nonzero factor 2j2^{\,j} gives u=2jjuu = 2^{\,j'-j}u'; if j>jj' > j then jj1j' - j \ge 1 and u=2(2jj1u)u = 2\big(2^{\,j'-j-1}u'\big) is even as well as odd, which step 2.2 forbids; so j=jj = j' and then u=uu = u'.

step 2.2L1L4L6
4.1

Every nonzero integer mm is 2ju2^{\,j}u with jNj \in \mathbb{N} and uu odd: apply strong induction to the property P(n)P(n) that every nonzero integer whose absolute value is the image of nn, that is every nonzero mm equal to the image of nn or to its negative, has such a representation. Given nn and P(k)P(k) for all k<nk < n, note n0n \ne 0 since m0m \ne 0; by step 2.1 either n=σ(j+j)n = \sigma(j+j), in which case mm is ±(2t+1)\pm(2t+1) and hence odd by the computation of step 3.1, so m=20mm = 2^0 m works, or n=j+jn = j + j with j0j \ne 0, in which case m=2mm = 2m' for the nonzero integer mm' that is the image of jj or its negative, and j<nj < n because j1j \ge 1 gives n=j+jj+1>jn = j + j \ge j + 1 > j, so P(j)P(j) supplies m=2ium' = 2^{\,i}u and m=2i+1um = 2^{\,i+1}u. Every nonzero integer is the image of some natural or its negative, so the conclusion holds for all of them.

step 2.1step 3.1L1L2L4L5L6
5.1

For nonzero integers a,ca, c with a+c0a + c \ne 0: v2(a+c)min{v2(a),v2(c)}v_2(a+c) \ge \min\{v_2(a), v_2(c)\}. Indeed write a=2sua = 2^{\,s}u and c=2suc = 2^{\,s'}u' with u,uu, u' odd and, without loss of generality, sss \le s'; then a+c=2s(u+2ssu)a + c = 2^{\,s}\big(u + 2^{\,s'-s}u'\big), the bracket is a nonzero integer, so by step 4.1 it equals 2iq2^{\,i}q with qq odd, whence a+c=2s+iqa + c = 2^{\,s+i}q and, by the uniqueness of step 3.2, v2(a+c)=s+is=min{s,s}v_2(a+c) = s + i \ge s = \min\{s,s'\}.

step 3.2step 4.1L1L6
5.2

The valuation of a nonzero rational is well defined: if a/b=c/da/b = c/d with a,b,c,da, b, c, d nonzero integers then ad=cbad = cb, and writing a=2sua = 2^{\,s}u, b=2twb = 2^{\,t}w, c=2suc = 2^{\,s'}u', d=2twd = 2^{\,t'}w' with all four of u,w,u,wu,w,u',w' odd gives ad=2s+t(uw)ad = 2^{\,s+t'}(uw') and cb=2s+t(uw)cb = 2^{\,s'+t}(u'w) with uwuw' and uwu'w odd by step 1.3; the uniqueness of step 3.2 applied to the nonzero integer adad forces s+t=s+ts + t' = s' + t, that is st=sts - t = s' - t'.

step 1.3step 3.2step 4.1L1L6
6.1

Basic properties of 2|\cdot|_2: for x0x \ne 0 the value 2v2(x)2^{-v_2(x)} is a positive real, since 2>02 > 0 and powers and inverses of positives are positive; so x2>0|x|_2 > 0 for x0x \ne 0 and x2=0|x|_2 = 0 exactly when x=0x = 0. Moreover x2=x2|-x|_2 = |x|_2, because x=(a)/b-x = (-a)/b and (2su)=2s(u)-\big(2^{\,s}u\big) = 2^{\,s}(-u) with u=2(t1)+1-u = 2(-t-1)+1 odd when u=2t+1u = 2t+1, so v2(x)=v2(x)v_2(-x) = v_2(x).

step 5.2L1L6L7
7.1

Strong triangle inequality for 2|\cdot|_2: x+y2max{x2,y2}|x+y|_2 \le \max\{|x|_2, |y|_2\}. If x=0x = 0, or y=0y = 0, or x+y=0x + y = 0, this is immediate from step 6.1. Otherwise write x=a/bx = a/b and y=c/by = c/b over a common nonzero denominator bb, with a,ca, c nonzero integers, so that x+y=(a+c)/bx + y = (a+c)/b with a+c0a + c \ne 0; then v2(x)=v2(a)v2(b)v_2(x) = v_2(a) - v_2(b), v2(y)=v2(c)v2(b)v_2(y) = v_2(c) - v_2(b) and v2(x+y)=v2(a+c)v2(b)v_2(x+y) = v_2(a+c) - v_2(b), so step 5.1 gives v2(x+y)min{v2(x),v2(y)}v_2(x+y) \ge \min\{v_2(x), v_2(y)\}; finally t2tt \mapsto 2^{\,t} is strictly increasing on Z\mathbb{Z}, since for t<tt < t' one has 2t=2t2tt2^{\,t'} = 2^{\,t}2^{\,t'-t} with 2t>02^{\,t} > 0 and 2tt>12^{\,t'-t} > 1, so 2v2(x+y)2min{v2(x),v2(y)}=max{2v2(x),2v2(y)}2^{-v_2(x+y)} \le 2^{-\min\{v_2(x),v_2(y)\}} = \max\{2^{-v_2(x)}, 2^{-v_2(y)}\}.

step 5.1step 5.2L1L5L6L7
8.1

Claim 1: d2(x,y)=xy2d_2(x,y) = |x-y|_2 vanishes exactly when x=yx = y by step 6.1, is symmetric because yx2=(xy)2=xy2|y-x|_2 = |-(x-y)|_2 = |x-y|_2, and satisfies d2(x,z)=(xy)+(yz)2max{xy2,yz2}=max{d2(x,y),d2(y,z)}d_2(x,z) = |(x-y)+(y-z)|_2 \le \max\{|x-y|_2, |y-z|_2\} = \max\{d_2(x,y), d_2(y,z)\} 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 d2d_2 is an ultrametric on Q\mathbb{Q}.

step 6.1step 7.1L8
9.1

Claim 2: suppose d2(x,y)d2(y,z)d_2(x,y) \ne d_2(y,z) and, without loss of generality, d2(x,y)<d2(y,z)d_2(x,y) < d_2(y,z). Then d2(x,z)max{d2(x,y),d2(y,z)}=d2(y,z)d_2(x,z) \le \max\{d_2(x,y), d_2(y,z)\} = d_2(y,z); and d2(y,z)max{d2(y,x),d2(x,z)}=max{d2(x,y),d2(x,z)}d_2(y,z) \le \max\{d_2(y,x), d_2(x,z)\} = \max\{d_2(x,y), d_2(x,z)\}, where the maximum cannot be d2(x,y)d_2(x,y), since that would give d2(y,z)d2(x,y)<d2(y,z)d_2(y,z) \le d_2(x,y) < d_2(y,z); so d2(y,z)d2(x,z)d_2(y,z) \le d_2(x,z) and the two are equal, that is d2(x,z)=max{d2(x,y),d2(y,z)}d_2(x,z) = \max\{d_2(x,y), d_2(y,z)\}.

step 8.1L7L8
9.2

Claim 3: let yB(x,r)y \in B(x,r), so d2(x,y)<rd_2(x,y) < r. For zB(y,r)z \in B(y,r) the strong triangle inequality gives d2(x,z)max{d2(x,y),d2(y,z)}<rd_2(x,z) \le \max\{d_2(x,y), d_2(y,z)\} < r, so zB(x,r)z \in B(x,r); and for zB(x,r)z \in B(x,r) it gives d2(y,z)max{d2(y,x),d2(x,z)}<rd_2(y,z) \le \max\{d_2(y,x), d_2(x,z)\} < r, so zB(y,r)z \in B(y,r). Hence B(y,r)=B(x,r)B(y,r) = B(x,r).

step 8.1L8
10.1

Claims 1, 2 and 3 are established by steps 8.1, 9.1 and 9.2, so the 22-adic distance is an ultrametric on Q\mathbb{Q} in which every triangle is isosceles and every point of a ball is a centre.

step 8.1step 9.1step 9.2

Remarks

Depends on

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