Alphabeta Math
LemmaStatement: AI-adaptedProof: AI-generatedprecheck pass
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 absolute value makes R a metric space: d(x,y)=∣x−y∣ is a metric, its open balls are the intervals (x−r,x+r), and it is unbounded

Statement

Define dR:R×R→R by dR(x,y):=∣x−y∣ (Absolute value in an ordered field). Then:

  1. dR is a metric on R (Metric space: d(x,y)=0 iff x=y, symmetry, and the triangle inequality; pseudometric and ultrametric); it is called the usual metric of R.
  2. For x∈R and r>0 the open ball is the bounded open interval (Intervals of R: the nine order-convex forms, nondegeneracy, and length, Open ball, closed ball and sphere in a metric space) B(x,r)=(x−r, x+r), and the closed ball is Bˉ(x,r)=[x−r, x+r].
  3. Consequently U⊆R is open in the metric topology of dR (The metric topology: a set is open when every one of its points has a ball around it inside the set; closed means open complement) exactly when for every x∈U there is r>0 with (x−r,x+r)⊆U. This topology is called the usual topology of R.
  4. (R,dR) is not a bounded metric space (Bounded subset, diameter, distance from a point to a set, and distance between two sets in a metric space): no ball contains R, so diam⁡(R) is not defined.

Facts & Assumptions

Given: The complete ordered field R (Complete ordered field (least-upper-bound property), Ordered field) with its absolute value (Absolute value in an ordered field), and the function dR(x,y)=∣x−y∣; points x,y,z∈R and a real r>0.

[L1]

Absolute value is defined by ∣u∣=u when u≥0 and ∣u∣=−u when u<0. Its properties are: ∣u∣≥0; ∣u∣=0 if and only if u=0; ∣−u∣=∣u∣; and for c>0 one has ∣u∣<c if and only if −c<u<c (Basic properties of the absolute value, Absolute value in an ordered field).

[L2]

Triangle inequality in an ordered field: ∣u+v∣≤∣u∣+∣v∣ (The triangle inequality).

[L3]

Intervals: (a,b)={t:a<t<b} and [a,b]={t:a≤t≤b} (Intervals of R: the nine order-convex forms, nondegeneracy, and length).

[L4]

Archimedean property: for every w∈R there is a natural n≥1 with w<n⋅1R (Every complete ordered field is Archimedean); and n⋅1R>0 for n≥1 (Canonical naturals are positive and strictly increasing).

[L5]

Adding a constant to an inequality, in strict and nonstrict form: the strict form is Order is preserved by adding a constant and by adding inequalities and the nonstrict form is that together with the case of equality, the order being total (Ordered field).

[L6]

Trichotomy: for reals a,b exactly one of a<b, a=b, b<a holds (Complete ordered field (least-upper-bound property), Ordered field).

Proof

technique · direct
1.1L1

Separation (M1): dR(x,y)=∣x−y∣=0 holds if and only if x−y=0, that is if and only if x=y.

1.2L1

Symmetry (M2): dR(y,x)=∣y−x∣=∣−(x−y)∣=∣x−y∣=dR(x,y).

1.3L2

Triangle inequality (M3): dR(x,z)=∣x−z∣=∣(x−y)+(y−z)∣≤∣x−y∣+∣y−z∣=dR(x,y)+dR(y,z).

1.4L1L5

For y∈R and r>0: y∈B(x,r) means ∣x−y∣<r, which by [L1] holds if and only if −r<x−y<r, and adding y−r respectively y+r to the two halves shows this is equivalent to x−r<y<x+r.

1.5L1L5L6

Put u=x−y and let r>0. If u≥0, then ∣u∣=u by [L1] and −r≤u automatically, so ∣u∣≤r is equivalent to −r≤u≤r. If u<0, then ∣u∣=−u by [L1] and u≤r automatically; adding u−r to −u≤r gives −r≤u, and the same addition in reverse proves the converse. These sign cases are exhaustive by [L6], so ∣u∣≤r if and only if −r≤u≤r. Consequently, y∈Bˉ(x,r) is equivalent to −r≤x−y≤r, and translating the two inequalities by [L5] gives x−r≤y≤x+r.

1.6L4choose

Let x0∈R and r>0 be arbitrary, and use [L4] to fix a natural n≥1 with x0+r<n⋅1R; write w:=n⋅1R.

2.1step 1.1step 1.2step 1.3

By steps 1.1, 1.2 and 1.3 the function dR satisfies (M1), (M2) and (M3), so it is a metric on R, which is claim 1.

2.2step 1.4step 1.5L3

By step 1.4 and [L3] the set B(x,r) has exactly the elements of (x−r,x+r), and by step 1.5 and [L3] the set Bˉ(x,r) has exactly the elements of [x−r,x+r]; this is claim 2.

2.3step 1.6L1L5L6

Since r>0 we have x0<x0+r<w, so w−x0>r>0 and hence dR(x0,w)=∣x0−w∣=∣−(w−x0)∣=w−x0>r; therefore w∉B(x0,r).

3.1step 2.2

Substituting claim 2 into the definition of open in the metric topology gives claim 3: U is open exactly when every x∈U admits r>0 with (x−r,x+r)=B(x,r)⊆U.

4.1step 2.1step 2.3∎

Since x0 and r were arbitrary, step 2.3 exhibits for every ball B(x0,r) a real not in it, so no ball contains R; hence R is not a bounded subset of itself and diam⁡(R) is not defined, which is claim 4.

Remarks

Depends on

Dependency tree · 2 levels

Sources