Alphabeta Math
LemmaStatement: AI-adaptedProof: AI-generatedSession-authored (Fable 5 assisted)precheck passverified 2026-08-02 (claude-opus-5)
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\mathbb{R} a metric space: d(x,y)=xyd(x,y) = |x-y| is a metric, its open balls are the intervals (xr,x+r)(x-r, x+r), and it is unbounded

Statement

Define dR:R×RRd_{\mathbb{R}} : \mathbb{R} \times \mathbb{R} \to \mathbb{R} by dR(x,y):=xyd_{\mathbb{R}}(x,y) := |x - y| (Absolute value in an ordered field). Then:

  1. dRd_{\mathbb{R}} is a metric on R\mathbb{R} (Metric space: d(x,y)=0d(x,y) = 0 iff x=yx = y, symmetry, and the triangle inequality; pseudometric and ultrametric); it is called the usual metric of R\mathbb{R}.
  2. For xRx \in \mathbb{R} and r>0r > 0 the open ball is the bounded open interval (Intervals of R\mathbb{R}: the nine order-convex forms, nondegeneracy, and length, Open ball, closed ball and sphere in a metric space) B(x,r)=(xr, x+r),B(x,r) = (x-r,\ x+r), and the closed ball is Bˉ(x,r)=[xr, x+r]\bar B(x,r) = [x-r,\ x+r].
  3. Consequently URU \subseteq \mathbb{R} is open in the metric topology of dRd_{\mathbb{R}} (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 xUx \in U there is r>0r > 0 with (xr,x+r)U(x-r, x+r) \subseteq U. This topology is called the usual topology of R\mathbb{R}.
  4. (R,dR)(\mathbb{R}, d_{\mathbb{R}}) 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\mathbb{R}, so diam(R)\operatorname{diam}(\mathbb{R}) is not defined.

Facts & Assumptions

Given: The complete ordered field R\mathbb{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)=xyd_{\mathbb{R}}(x,y) = |x-y|; points x,y,zRx, y, z \in \mathbb{R} and a real r>0r > 0.

[L1]

Absolute value: u0|u| \ge 0; u=0|u| = 0 if and only if u=0u = 0; u=u|-u| = |u|; and for c>0c > 0 one has u<c|u| < c if and only if c<u<c-c < u < c (Basic properties of the absolute value, Absolute value in an ordered field).

[L2]

Triangle inequality in an ordered field: u+vu+v|u + v| \le |u| + |v| (The triangle inequality).

[L3]

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

[L4]

Archimedean property: for every wRw \in \mathbb{R} there is a natural n1n \ge 1 with w<n1Rw < n \cdot 1_{\mathbb{R}} (Every complete ordered field is Archimedean); and n1R>0n \cdot 1_{\mathbb{R}} > 0 for n1n \ge 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,ba,b exactly one of a<ba < b, a=ba = b, b<ab < a holds (Complete ordered field (least-upper-bound property), Ordered field).

Proof

technique · direct
1.1

Separation (M1): dR(x,y)=xy=0d_{\mathbb{R}}(x,y) = |x-y| = 0 holds if and only if xy=0x - y = 0, that is if and only if x=yx = y.

L1
1.2

Symmetry (M2): dR(y,x)=yx=(xy)=xy=dR(x,y)d_{\mathbb{R}}(y,x) = |y-x| = |-(x-y)| = |x-y| = d_{\mathbb{R}}(x,y).

L1
1.3

Triangle inequality (M3): dR(x,z)=xz=(xy)+(yz)xy+yz=dR(x,y)+dR(y,z)d_{\mathbb{R}}(x,z) = |x - z| = |(x-y) + (y-z)| \le |x-y| + |y-z| = d_{\mathbb{R}}(x,y) + d_{\mathbb{R}}(y,z).

L2
1.4

For yRy \in \mathbb{R} and r>0r > 0: yB(x,r)y \in B(x,r) means xy<r|x - y| < r, which by [L1] holds if and only if r<xy<r-r < x - y < r, and adding yry - r respectively y+ry + r to the two halves shows this is equivalent to xr<y<x+rx - r < y < x + r.

L1L5
1.5

For yRy \in \mathbb{R} and r>0r > 0: yBˉ(x,r)y \in \bar B(x,r) means xyr|x-y| \le r, which by the same equivalence read with \le in place of << holds if and only if xryx+rx - r \le y \le x + r.

L1L5
1.6

Let x0Rx_0 \in \mathbb{R} and r>0r > 0 be arbitrary, and use [L4] to fix a natural n1n \ge 1 with x0+r<n1Rx_0 + r < n \cdot 1_{\mathbb{R}}; write w:=n1Rw := n \cdot 1_{\mathbb{R}}.

L4choose
2.1

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

step 1.1step 1.2step 1.3
2.2

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

step 1.4step 1.5L3
2.3

Since r>0r > 0 we have x0<x0+r<wx_0 < x_0 + r < w, so wx0>r>0w - x_0 > r > 0 and hence dR(x0,w)=x0w=(wx0)=wx0>rd_{\mathbb{R}}(x_0, w) = |x_0 - w| = |-(w - x_0)| = w - x_0 > r; therefore wB(x0,r)w \notin B(x_0,r).

step 1.6L1L5L6
3.1

Substituting claim 2 into the definition of open in the metric topology gives claim 3: UU is open exactly when every xUx \in U admits r>0r > 0 with (xr,x+r)=B(x,r)U(x-r,x+r) = B(x,r) \subseteq U.

step 2.2
4.1

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

step 2.1step 2.3

Remarks

Depends on

Used by

…and 102 more results.

Dependency tree · next 3 levels

Direct dependencies and their dependencies through the next three levels: 44 results over 10 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