Alphabeta Math
Session-authored (Fable 5 assisted)
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.

12 results · all verified · 11 also independently AI-judged
Every result on this page is machine-checked by a proof checker and read in full and owner-audited; the judge is an additional, independent cross-model AI review of the proofs. The 1 not AI-judged were verified by owner audit (typically over a confirmed judge false positive), not failures.

Completeness, Completion, and Uniform Continuity: Examples and Counterexamples

1 · Prerequisites

2 · Summary

3 · Logical flowchart

4 · Definitions, theorems and proofs

None yet.

5 · Examples, counterexamples and false statements

ExampleConstruction: AI-adaptedVerification: AI-generatedprecheck passjudge pass (z-ai/glm-5.2)audited 2026-07-27Open item page →

The completion of Q under the usual metric is R

Example

Regard Q (The rationals as equivalence classes of pairs of integers) as the subset Q^ of R that is the image of the canonical embedding qq^ (The rationals embed densely in the reals), carrying the subspace metric dQ(p,q)=p^q^ inherited from the usual metric of R (The absolute value makes R a metric space: d(x,y)=xy is a metric, its open balls are the intervals (xr,x+r), and it is unbounded, Isometry, isometric embedding, and the subspace metric on a subset). Let ι:QR be that embedding.

Then ((R,dR),ι) is a completion of (Q,dQ) (A completion of a metric space: a complete metric space together with an isometric embedding onto a dense subspace). Consequently, by uniqueness of completions (A completion is unique up to a unique isometry fixing the original space, and uniformly continuous maps into complete spaces extend through it), for every completion ((Y^,d^),j) of (Q,dQ) there is exactly one continuous φ:RY^ with φι=j, and it is an isometry. In this sense R is the completion of Q.

Facts & Assumptions

Given: Q with the metric dQ inherited from R through ι:qq^; a real x; a real r>0.

[L1]

qq^ is an injective, order-preserving embedding of ordered fields, and strictly between any two reals lies a rational (The rationals embed densely in the reals).

[L3]
[L5]

Density: A is dense in X when every ball around every point of X meets A (Interior, closure, boundary, limit point, isolated point and dense subset of a metric space).

Verification

technique · direct
1.1

dQ is a metric on Q and ι is an isometric embedding into (R,dR): by construction dR(ι(p),ι(q))=p^q^=dQ(p,q), and ι is injective.

L1L2L3
1.2

(R,dR) is complete.

L4
1.3

ι[Q] is dense in R: for a real x and a real r>0 the ball B(x,r) is the interval (xr,x+r), which is nonempty and has xr<x+r, so it contains a rational; hence every ball around every real meets ι[Q].

L1L2L5
2.1

So the complete space (R,dR), together with the isometric embedding ι whose image is dense, is a completion of (Q,dQ).

step 1.1step 1.2step 1.3L6
3.1

By uniqueness of completions, any other completion ((Y^,d^),j) of (Q,dQ) receives exactly one continuous φ:RY^ with φι=j, and that φ is an isometry.

step 2.1L6

Remarks

  • This is the metric statement of what the construction pages did by hand. This library builds R out of Cauchy sequences of rationals on its own page, and the general construction of Every metric space has a completion, constructed as the equivalence classes of its Cauchy sequences follows the same plan for an arbitrary metric space: classes of Cauchy sequences, with the distance read off as a limit. The present item is the observation that, run on Q, that plan reaches a space isometric to the R already in hand, and that no separate verification of "which complete space it is" is needed once uniqueness is available.
  • Density is the whole of the third condition, and it is exactly the Archimedean fact. That every interval of positive length contains a rational is The rationals embed densely in the reals; without it Q would sit inside R as a complete-looking but small subspace, and R would not be a completion of it but merely a complete space containing it.
  • The metric is the one written above and no other. Completions are taken with respect to a named metric (A completion of a metric space: a complete metric space together with an isometric embedding onto a dense subspace), and a different metric on Q would in general have a different completion; nothing here is a statement about Q as a bare field or as a bare topological space.
ExampleConstruction: AI-adaptedVerification: AI-generatedprecheck passjudge pass (z-ai/glm-5.2)audited 2026-07-27Open item page →

The map x(x+2/x)/2 is a contraction of [1,2] with fixed point 2, and the a priori bound gives the error after n steps

Example

Let X:=[1,2]R (Intervals of R: the nine order-convex forms, nondegeneracy, and length) with the metric d(x,y)=xy inherited from R (The absolute value makes R a metric space: d(x,y)=xy is a metric, its open balls are the intervals (xr,x+r), and it is unbounded, Isometry, isometric embedding, and the subspace metric on a subset), and define

f(x)  :=  x+2/x2  =  x2+1x.

Then:

  1. (X,d) is a nonempty complete metric space (Complete metric space: every Cauchy sequence converges in the space).
  2. f maps X into X.
  3. f is a contraction with constant q=1/2 (Lipschitz map, α-Hölder map for rational 0<α1, and contraction).
  4. f has exactly one fixed point in X, namely 2 (Square roots exist: a unique a0 with (a)2=a; the positives are {x2:x0}), and the iterates xn+1=f(xn) converge to it from every starting point x0X (A contraction of a nonempty complete metric space into itself has exactly one fixed point, the limit of the iterates from any starting point).
  5. Starting from x0=1 one has x1=3/2 and d(x1,x0)=1/2, so the a priori bound of The a priori bound d(x,xn)qnd(x1,x0)/(1q) and the a posteriori bound d(x,xn+1)qd(xn+1,xn)/(1q) reads 2xn    (1/2)n(1/2)11/2  =  (12)n, and the a posteriori bound reads 2xn+1xn+1xn.

Facts & Assumptions

Given: The interval X=[1,2] with the metric inherited from R, and f(x)=x/2+1/x for xX; reals x,yX.

[L3]

Every a0 has a unique a0 with (a)2=a, and ab=ab for a,b0, since both sides are nonnegative with the same square (Square roots exist: a unique a0 with (a)2=a; the positives are {x2:x0}, Integer powers am).

[L4]

For a,b0: ab if and only if a2b2 (Squaring is monotone on the nonnegatives); and squares are nonnegative (Squares of nonzero elements are positive).

[L5]

Positivity of inverses, reversal of order under reciprocation, and multiplication of inequalities by positives (Inverses of positives are positive, and reciprocation reverses order, Sign rules for products and monotonicity of multiplication).

Verification

technique · direct
1.1

X is nonempty, since 1X; and X is sequentially closed in R, since a sequence in X converging to a real p has 1xk2 for every k and hence 1p2. So X is closed in R, and R is complete, so (X,d) is a nonempty complete metric space: claim 1.

L1L2
1.2

2 lies in X: 12=12 and 22=42, so 122.

L3L4
1.3

For xX one has x1>0, so f(x) is defined, and (x2/x)20 expands to x+2/x2x2/x=22; hence f(x)21.

L3L4L5
1.4

For x,yX: f(x)f(y)=xy2+(1x1y)=xy2+yxxy=(xy)(121xy).

L5
2.1

Also 1x2 gives x/21 and 1/x1, so f(x)2; with step 1.3 this puts f(x)[1,2]=X, which is claim 2.

step 1.2step 1.3L5
2.2

Since 1x,y2 we have 1xy4, hence 1/41/(xy)1 and therefore 1/21/21/(xy)1/4, so 1/21/(xy)1/2.

step 1.4L5
3.1

Consequently d(f(x),f(y))=xy1/21/(xy)12xy=12d(x,y), so f is a contraction with constant q=1/2: claim 3.

step 1.4step 2.2L1L6
4.1

By claims 1 to 3 and Banach's theorem, f has exactly one fixed point in X and the iterates converge to it from every starting point.

step 1.1step 2.1step 3.1L6
5.1

For xX: f(x)=x is equivalent to x/2+1/x=x, hence to 1/x=x/2, hence to x2=2; since x>0 this holds exactly for x=2, which lies in X by step 1.2. So the fixed point is 2: claim 4.

step 1.2step 4.1L3L4L5
6.1

Taking x0=1 gives x1=f(1)=1/2+1=3/2 and d(x1,x0)=1/2; the a priori bound with q=1/2 therefore reads 2xn(1/2)n(1/2)/(11/2)=(1/2)n, and the a posteriori bound reads 2xn+1(1/2)xn+1xn/(11/2)=xn+1xn: claim 5.

step 3.1step 5.1L6

Remarks

  • No derivative is used anywhere. The contraction constant comes from the algebraic identity of step 1.4, f(x)f(y)=(xy)(1/21/(xy)), and from the bound 1xy4 that the interval supplies. This matters here: the mean value theorem, which is how this estimate is usually obtained, belongs to a later page of this library and is not available at this point.
  • The lower endpoint is what makes the estimate close. The bound 1/21/(xy)1/2 of step 2.2 needs xy1, and that is exactly what x,y1 supplies; on a set of small positive reals the factor 1/(xy) is large and the same computation gives nothing. The self-mapping property uses both endpoints: step 1.3 gives the lower bound 2 and step 2.1 the upper bound 2.
  • What the bounds say numerically. From x0=1 the a priori bound guarantees 2xn2n, so ten steps give an error at most 210. This is a guarantee, not the truth: the iteration is Newton's method for x22, and it converges far faster than the bound admits. The a posteriori bound of claim 5, which costs one subtraction, is what a computation would actually report.
  • The restriction to [1,2] is convenience, not necessity. On [1,) one still has x,y1, hence 0<1/(xy)1 and 1/21/(xy)1/2, so the same computation makes f a contraction with the same constant there, and step 1.3 already shows f maps [1,) into itself. The shorter interval is used only to keep the arithmetic of step 2.2 explicit.
ExampleConstruction: AI-adaptedVerification: AI-generatedprecheck passjudge pass (z-ai/glm-5.2)audited 2026-07-27Open item page →

A Lipschitz function on Q extends uniquely to a Lipschitz function on R with the same constant

Example

Regard Q as a subspace of R with the metric inherited from the usual metric (The rationals embed densely in the reals, The absolute value makes R a metric space: d(x,y)=xy is a metric, its open balls are the intervals (xr,x+r), and it is unbounded, Isometry, isometric embedding, and the subspace metric on a subset), let LR with L0, and let f:QR be Lipschitz with constant L (Lipschitz map, α-Hölder map for rational 0<α1, and contraction), that is

f(p)f(q)    Lpqfor all p,qQ.

Then there is exactly one continuous F:RR with F(q)=f(q) for every qQ, and that F is again Lipschitz with the same constant L.

Facts & Assumptions

Given: Q as a metric subspace of R; a real L0; a Lipschitz f:QR with constant L; reals x,y.

[A1]

Lipschitz hypothesis: f(p)f(q)Lpq for all p,qQ (Lipschitz map, α-Hölder map for rational 0<α1, and contraction).

[L4]

Extension from a dense subspace into a complete space: a uniformly continuous map extends to a uniformly continuous map, and that extension is the only continuous one (A uniformly continuous map from a dense subspace into a complete metric space extends uniquely to a uniformly continuous map on the whole space).

[L8]

abab for reals, which is the reverse triangle inequality of the usual metric of R with third point 0 (The reverse triangle inequality d(x,z)d(y,z)d(x,y) in any metric space, Basic properties of the absolute value).

Verification

technique · direct
1.1

By [A1] and [L1] the map f is uniformly continuous on the subspace Q of R.

A1L1
1.2

Let x,yR. By density and [L5] there are sequences (pk) and (qk) of rationals with pkx and qky.

L2L5
2.1

Q is dense in R and R is complete, so [L4] supplies a uniformly continuous F:RR with F(q)=f(q) for every rational q, and F is the only continuous map RR with that property.

step 1.1L2L3L4
2.2

Likewise pkqkxy, so pkqkxy and LpkqkLxy.

step 1.2L7L8
3.1

F is continuous, being uniformly continuous, so F(pk)F(x) and F(qk)F(y); hence F(pk)F(qk)F(x)F(y) and, by [L8], F(pk)F(qk)F(x)F(y).

step 2.1step 1.2L6L7L8
3.2

For every k the terms pk,qk are rational and F agrees with f on them, so F(pk)F(qk)=f(pk)f(qk)Lpkqk by [A1].

step 2.1step 1.2A1
4.1

Passing to the limit in step 3.2, using steps 3.1 and 2.2, gives F(x)F(y)Lxy; as x,y were arbitrary reals, F is Lipschitz with constant L.

step 3.1step 2.2step 3.2L7
5.1

So F exists, is the unique continuous extension of f, and is Lipschitz with the same constant L.

step 2.1step 4.1

Remarks

ExampleConstruction: AI-adaptedVerification: AI-generatedprecheck passjudge pass (z-ai/glm-5.2)audited 2026-07-27Open item page →

on [0,) is uniformly continuous and exactly 1/2-Hölder, and is not Lipschitz

Example

Let X:=[0,)R (Intervals of R: the nine order-convex forms, nondegeneracy, and length) with the metric d(x,y)=xy inherited from R (The absolute value makes R a metric space: d(x,y)=xy is a metric, its open balls are the intervals (xr,x+r), and it is unbounded, Isometry, isometric embedding, and the subspace metric on a subset), and let g:XX be g(x):=x=x1/2 (Square roots exist: a unique a0 with (a)2=a; the positives are {x2:x0}, Rational powers ar of a positive base). Then:

  1. xyxy1/2 for all x,y0, so g is 1/2-Hölder with constant 1 (Lipschitz map, α-Hölder map for rational 0<α1, and contraction).
  2. g is uniformly continuous (Uniform continuity of a map of metric spaces: one δ serving every point).
  3. The constant 1 cannot be improved: every 1/2-Hölder constant C for g satisfies C1.
  4. For every rational α with 1/2<α1, the map g is not α-Hölder. In particular, at α=1, g is not Lipschitz.

So 1/2 is exactly the Hölder exponent of the square root, and the example separates "Hölder" from "Lipschitz" inside Contraction implies Lipschitz implies uniformly continuous implies continuous; every Hölder map is uniformly continuous, and a Lipschitz map on a bounded space is Hölder for every exponent.

Facts & Assumptions

Given: X=[0,) with the metric inherited from R; g(x)=x; reals x,yX; a rational α with 0<α1; a real C0.

[L1]

Every a0 has a unique a0 with (a)2=a, and a1/2=a; the base 0 is covered, with 0r=0 for rational r>0 (Square roots exist: a unique a0 with (a)2=a; the positives are {x2:x0}, Rational powers ar of a positive base, Order on the rationals).

[L2]

For a,b0: ab if and only if a2b2; and squares are nonnegative (Squaring is monotone on the nonnegatives, Squares of nonzero elements are positive).

[L3]

Rational power laws for a positive base: ar>0, ar+s=aras, ar=1/ar, (ar)s=ars, and (ab)r=arbr (Laws of rational exponents).

[L4]

Monotonicity in the base: for rational r>0 and 0<a<b one has ar<br (Monotonicity of rar and of aar).

Verification

technique · direct
1.1

Both sides of the inequality of claim 1 are symmetric in x and y, so it is enough to prove it when xy0; then xy and xy=xy.

L2L6
1.2

Claim 4: let α be rational with 1/2<α1, put β:=α1/2, a positive rational, and suppose xyCxyα for all x,y0 with some real C0. Taking y=0 gives t1/2Ctα for every real t>0.

L1L3L5
2.1

With xy0 put u:=y+xy0. Then u2=y+2yxy+(xy)=x+2yxyx, the added term being a product of nonnegatives.

step 1.1L1L2
2.2

At t=1 this reads 1C, so C>0; and dividing the inequality of step 1.2 by tα>0 gives t1/2α=tβ=1/tβC, hence tβ1/C for every real t>0.

step 1.2L3L5
3.1

Since u0, x0 and (x)2=xu2, we get xu=y+xy, hence xy=xyxy=xy1/2. This is claim 1, with Hölder constant 1 and exponent 1/2.

step 1.1step 2.1L1L2
3.2

Apply this at t=1/n for a natural n1: (1/n)β=1/nβ, so 1/nβ1/C and therefore nβC for every n1.

step 2.2L3L5
4.1

By [L7] a 1/2-Hölder map is uniformly continuous, so g is uniformly continuous: claim 2.

step 3.1L7
4.2

Claim 3: suppose xyCxy1/2 for all x,y0. Taking y=0 and x=1 gives 1=1C11/2=C, so C1.

step 3.1L1L3
5.1

But C>0, so C1/β is a positive real and [L5] supplies a natural n1 with n>C1/β; raising to the positive rational power β gives nβ>(C1/β)β=C, contradicting step 3.2. So no such C exists and g is not α-Hölder: claim 4, and at α=1 it says g is not Lipschitz.

step 2.2step 3.2L3L4L5

Remarks

ExampleConstruction: AI-adaptedVerification: AI-generatedprecheck passjudge pass (z-ai/glm-5.2)audited 2026-07-27Open item page →

The bounded real-valued functions on a set, with the supremum metric, form a complete metric space

Example

Let S be a nonempty set, let B(S):={f:f is a bounded function SR}, and let d(f,g):=sup{f(s)g(s):sS} be the supremum metric, which is a metric on B(S) (The supremum metric d(f,g)=supxf(x)g(x) is a metric on the bounded real-valued functions on a nonempty set, Lower bound, bounded below, bounded set).

Then (B(S),d) is a complete metric space (Complete metric space: every Cauchy sequence converges in the space).

The limit is produced pointwise and then shown to be bounded and to be approached uniformly; that order is the content of the proof.

Facts & Assumptions

Given: A nonempty set S; the space B(S) with the supremum metric d; a Cauchy sequence (fk) in (B(S),d); a point sS; a real ε>0.

[A1]

Cauchyness of (fk): for every real ε>0 there is K with d(fk,fl)<ε for all k,lK (Cauchy sequence in a metric space, The rationals embed densely in the reals).

[L1]

d is a metric on B(S), and d(f,g) is the least upper bound of {f(s)g(s):sS}, so it dominates each of those numbers and is dominated by every upper bound of them (The supremum metric d(f,g)=supxf(x)g(x) is a metric on the bounded real-valued functions on a nonempty set, Complete ordered field (least-upper-bound property), Metric space: d(x,y)=0 iff x=y, symmetry, and the triangle inequality; pseudometric and ultrametric).

[L2]

A function h:SR is bounded when its range is a bounded subset of R, that is when there is a real M0 with h(s)M for every s; the passage from a pair of bounds to a single M is the maximum of two absolute values (Lower bound, bounded below, bounded set, Every nonempty finite set of reals has a maximum and a minimum, Maximum and minimum of a set, Basic properties of the absolute value).

[L3]

Every Cauchy sequence of reals converges, and the limit of a real sequence is unique, which licenses limkak for a sequence already known to converge (The Cauchy criterion from the least-upper-bound property: in a complete ordered field every Cauchy sequence converges, A sequence has at most one limit, Limits and Cauchy sequences of reals).

[L4]

Limits of reals preserve non-strict inequalities holding eventually, and behave additively (Limits preserve non-strict inequalities, Algebra of limits: sums, scalar multiples, products and quotients).

[L5]

abab for reals, the reverse triangle inequality of the usual metric of R with third point 0; hence aka gives aka (The reverse triangle inequality d(x,z)d(y,z)d(x,y) in any metric space, Basic properties of the absolute value, The absolute value makes R a metric space: d(x,y)=xy is a metric, its open balls are the intervals (xr,x+r), and it is unbounded).

Verification

technique · direct
1.1

For every sS and all k,l the number fk(s)fl(s) belongs to the set whose supremum is d(fk,fl), so fk(s)fl(s)d(fk,fl).

L1
1.2

Apply [A1] with ε=1 to get K1 with d(fk,fl)<1 for all k,lK1, and let M0 satisfy fK1(s)M for every s, which exists because fK1 is bounded.

A1L2
2.1

Hence for each fixed s the real sequence (fk(s))k is Cauchy, by [A1] and step 1.1; so it converges, and its limit is unique, so f(s):=limkfk(s) defines a function f:SR. No choice is used, each value being a unique limit.

step 1.1A1L3
2.2

Let ε>0 be real and take K from [A1] for ε/2, so d(fk,fl)<ε/2 for all k,lK. For a fixed s and a fixed kK we get fk(s)fl(s)d(fk,fl)<ε/2 for every lK.

step 1.1A1
3.1

For every s and every lK1: fl(s)fK1(s)+fl(s)fK1(s)M+1 by step 1.1; letting l grow and using fl(s)f(s) gives f(s)M+1. So f is bounded and fB(S).

step 1.1step 2.1step 1.2L2L4L5
3.2

Letting l grow in step 2.2 and using fl(s)f(s), hence fk(s)fl(s)fk(s)f(s), gives fk(s)f(s)ε/2 for every sS and every kK.

step 2.1step 2.2L4L5
4.1

So ε/2 is an upper bound of {fk(s)f(s):sS} for every kK, whence d(fk,f)ε/2<ε; note that d(fk,f) is defined, both functions being bounded.

step 3.1step 3.2L1
5.1

Since ε>0 was an arbitrary real, fkf in (B(S),d) with fB(S); every Cauchy sequence therefore converges, and (B(S),d) is complete.

step 3.1step 4.1L6

Remarks

CounterexampleConstruction: AI-adaptedVerification: AI-generatedprecheck passjudge pass (z-ai/glm-5.2)audited 2026-07-27Open item page →

xx/2 maps (0,1] into itself, is a 1/2-contraction, and has no fixed point

Statement refuted

Refuted claim: the completeness hypothesis in Banach's fixed point theorem (A contraction of a nonempty complete metric space into itself has exactly one fixed point, the limit of the iterates from any starting point) may be dropped; a contraction of a nonempty metric space into itself always has a fixed point.

Let X:=(0,1]R (Intervals of R: the nine order-convex forms, nondegeneracy, and length) carry the metric d(x,y):=xy inherited from the real line (The absolute value makes R a metric space: d(x,y)=xy is a metric, its open balls are the intervals (xr,x+r), and it is unbounded, Isometry, isometric embedding, and the subspace metric on a subset), and let f:XX be f(x):=x/2. Then X is nonempty, f maps X into itself and is a contraction with constant 1/2 (Lipschitz map, α-Hölder map for rational 0<α1, and contraction), and f has no fixed point in X. The single hypothesis of A contraction of a nonempty complete metric space into itself has exactly one fixed point, the limit of the iterates from any starting point that fails is completeness (Complete metric space: every Cauchy sequence converges in the space), and it does fail.

Facts & Assumptions

Given: The interval X=(0,1] with the metric d inherited from R; the map f(x)=x/2; the sequence xk:=1/(k+2); a real ε>0.

[L4]

Contraction: Lipschitz with a constant q satisfying 0q<1 (Lipschitz map, α-Hölder map for rational 0<α1, and contraction).

Counterexample

technique · direct
1.1

X is nonempty, since 1X.

L1
1.2

f maps X into X: for 0<x1 one has 0<x/21/21.

L1L2
1.3

f is a contraction with constant 1/2: d(f(x),f(y))=x/2y/2=12xy=12d(x,y) for all x,yX, and 01/2<1.

L1L4
1.4

Every term of (xk) lies in X, since k+22 gives 0<1/(k+2)1/21; and xk0 in R, because for a real ε>0 and N1 with 1/N<ε every kN has k+2>N and hence xk0=1/(k+2)<1/N<ε.

L1L2L3
2.1

f has no fixed point in X: f(x)=x means x/2=x, hence x=0, and 0X.

step 1.2L1
2.2

So (xk) is Cauchy in R, hence Cauchy in (X,d), the distances being the same; and it has no limit in X, since a limit pX would also be a limit in R and uniqueness of limits there would force p=0X. Hence (X,d) is not complete.

step 1.4L1L3
3.1

Therefore X is a nonempty metric space and f a contraction of it into itself with no fixed point, so the completeness hypothesis of A contraction of a nonempty complete metric space into itself has exactly one fixed point, the limit of the iterates from any starting point cannot be dropped.

step 1.1step 1.3step 2.1step 2.2

Remarks

CounterexampleConstruction: AI-adaptedVerification: AI-generatedprecheck passverified 2026-08-03 (gpt-5.6-sol-codex-subscription)Open item page →

xx+1/x on [1,) strictly decreases every distance and has no fixed point

Statement refuted

Refuted claim: a self-map f of a nonempty complete metric space with d(f(x),f(y))<d(x,y) for all xy has a fixed point; equivalently, the contraction hypothesis of A contraction of a nonempty complete metric space into itself has exactly one fixed point, the limit of the iterates from any starting point may be weakened to that pointwise strict inequality (FALSE: d(fx,fy)<d(x,y) for all xy on a complete metric space forces a fixed point).

Let X:=[1,)R (Intervals of R: the nine order-convex forms, nondegeneracy, and length) carry the metric d(x,y):=xy inherited from the real line (The absolute value makes R a metric space: d(x,y)=xy is a metric, its open balls are the intervals (xr,x+r), and it is unbounded, Isometry, isometric embedding, and the subspace metric on a subset) and let

f(x):=x+1x(xX).

Then (X,d) is nonempty and complete, f maps X into X, d(f(x),f(y))<d(x,y) whenever xy, and f has no fixed point. Moreover f is not a contraction (Lipschitz map, α-Hölder map for rational 0<α1, and contraction): no real q<1 satisfies d(f(x),f(y))qd(x,y) for all x,yX.

Facts & Assumptions

Given: The interval X=[1,) with the metric d inherited from R; the map f(x)=x+1/x; a natural n1; a real q with 0q<1.

[L3]

Positivity of inverses, reversal of order under reciprocation, and multiplication of inequalities by positives (Inverses of positives are positive, and reciprocation reverses order, Sign rules for products and monotonicity of multiplication).

[L4]

Archimedean property and its reciprocal form: for every real η>0 there is a natural n1 with 1/n<η; and positive naturals sit in R in their own order (Every complete ordered field is Archimedean, For every ε>0 in a complete ordered field there is a natural n1 with 1/n<ε, Canonical naturals are positive and strictly increasing).

[L5]

Contraction: Lipschitz with a single constant q satisfying 0q<1 (Lipschitz map, α-Hölder map for rational 0<α1, and contraction).

Counterexample

technique · direct
1.1

X is nonempty (1X) and sequentially closed in R, since a sequence in X converging to a real p has xk1 for every k and hence p1; so X is closed in R, and R being complete, (X,d) is a nonempty complete metric space.

L1L2
1.2

f maps X into X: x1 gives 1/x>0, so f(x)=x+1/x>x1.

L3
1.3

For x,yX: f(x)f(y)=(xy)+(1/x1/y)=(xy)xyxy=(xy)(11xy).

L3
2.1

Let x,yX with xy. Then x,y1 and they are not both 1, so xy>1, hence 0<1/(xy)<1 and 0<11/(xy)<1; therefore d(f(x),f(y))=xy(11/(xy))<xy=d(x,y).

step 1.2step 1.3L1L3
2.2

f has no fixed point: f(x)x=1/x>0 for every xX, so f(x)x.

step 1.2L3
3.1

f is not a contraction. Suppose 0q<1 satisfied d(f(x),f(y))qd(x,y) for all x,yX. Taking x:=n+1 and y:=n for a natural n1 gives xy=1 and, by step 1.3, d(f(x),f(y))=11n(n+1), so 11n(n+1)q, that is 1q1n(n+1)1n.

step 1.3step 2.1L1L3L4L5
4.1

But 1q>0, so [L4] supplies a natural n1 with 1/n<1q, contradicting step 3.1. Hence no such q exists.

step 3.1L4
5.1

So (X,d) is nonempty and complete, f:XX strictly decreases every distance between distinct points, f has no fixed point, and f is not a contraction; this refutes the claim above and shows that the gap between the two hypotheses is real.

step 1.1step 1.2step 2.1step 2.2step 4.1

Remarks

  • The two hypotheses differ by a quantifier, and step 3.1 measures the gap. The shrinking factor at the pair (n+1,n) is 11/(n(n+1)), which is below 1 for every n and approaches 1 as n grows; the contraction condition asks for a single bound below 1 covering all pairs at once, and that is exactly what fails. The same quantifier move separates continuity from uniform continuity (Uniform continuity of a map of metric spaces: one δ serving every point).
  • Why the iterates do not help. Starting anywhere in [1,), the iterates increase, since f(x)>x, and they run off to the right; there is no Cauchy sequence to complete, so completeness of X is no help at all. This is the opposite failure mode to xx/2 maps (0,1] into itself, is a 1/2-contraction, and has no fixed point, where the iterates are Cauchy and the space is missing their limit.
  • Unboundedness is essential to the example, not to the phenomenon as stated here. What this item establishes is only that completeness plus the strict inequality is not enough. It makes no claim about what additional hypothesis would suffice; the classical repair uses compactness, which is a later page of this library.
CounterexampleConstruction: AI-generatedVerification: AI-generatedprecheck passjudge pass (z-ai/glm-5.2)audited 2026-07-27Open item page →

On N with d(m,n)=1+1/(m+n) for mn the sets {n,n+1,} are nested, closed, bounded and complete with empty intersection

Statement refuted

Refuted claim: in Cantor's intersection theorem (In a complete metric space nested nonempty closed sets whose diameters tend to 0 meet in exactly one point, and this property characterises completeness) the hypothesis diam(Fk)0 may be dropped; in a complete metric space a nested sequence of nonempty closed bounded sets has nonempty intersection.

Let X:=N (The natural numbers N (von Neumann)) and define

d(m,n):={0if m=n,1+1m+nif mn,

where m+n1 whenever mn, so the reciprocal is defined. Put Fn:={kN:kn}. Then d is a metric, (X,d) is complete, every Fn is nonempty, closed, bounded and itself complete, the Fn are nested, and

nNFn=.

What fails is only the diameter condition: diam(Fn)=1+1/(2n+1)1 for every n.

Facts & Assumptions

Given: X=N with the function d above; the sets Fn={kN:kn}; naturals m,n,p; a real ε>0.

[L1]

N contains 0, and for distinct naturals mn one has m+n1, so 1/(m+n) is a positive real, at most 1 (The natural numbers N (von Neumann), Canonical naturals are positive and strictly increasing, Inverses of positives are positive, and reciprocation reverses order).

[L4]

Bounded subset and diameter: A is bounded when it lies in a ball, and diam(A)=sup{d(a,b):a,bA} for nonempty bounded A; the supremum is the least upper bound (Bounded subset, diameter, distance from a point to a set, and distance between two sets in a metric space, Complete ordered field (least-upper-bound property), Maximum and minimum of a set).

Counterexample

technique · direct
1.1

d is well defined and symmetric, and d(m,n)=0 exactly when m=n, since for mn the value 1+1/(m+n) is at least 1. In fact 1<d(m,n)2 for all mn, because 0<1/(m+n)1.

L1L2
2.1

d satisfies the triangle inequality d(m,p)d(m,n)+d(n,p). If m=p the left side is 0; if n=m or n=p one side of the right-hand sum is 0 and the other equals the left side; and if m, n, p are pairwise distinct then d(m,n)+d(n,p)>1+1=2d(m,p). So d is a metric on N.

step 1.1L1L2
2.2

Every subset of N is open, hence also closed: for mN the ball B(m,1) is {m}, since d(m,n)>1 for nm, so every subset is a union of open balls; complements of subsets are subsets.

step 1.1L3
2.3

(X,d) is complete: a Cauchy sequence (xk) tested at ε=1 has an index K with d(xk,xl)<1 for all k,lK, which by step 1.1 forces xk=xl; so the sequence is constant from K on and converges to xKN.

step 1.1L3
2.4

Each Fn is bounded: d(0,k)2<3 for every k, so FnX=B(0,3).

step 1.1L3L4
3.1

Each Fn is nonempty (it contains n), closed by step 2.2, and complete by [L6]; and Fn+1Fn, so the family is nested.

step 2.2step 2.3L6
3.2

diam(Fn)=1+1/(2n+1). Indeed the distances realised inside Fn are 0 and the values 1+1/(j+k) for distinct j,kn; among such pairs j+k is least when {j,k}={n,n+1}, giving j+k=2n+1, and 1/(j+k) is largest there. So 1+1/(2n+1) is an upper bound of those distances and is itself one of them, hence it is the least upper bound.

step 1.1step 2.4L4L5
4.1

In particular diam(Fn)>1 for every n, so the sequence (diam(Fn)) does not converge to 0: at ε=1 no index makes the diameters smaller than 1.

step 3.2L3L5
4.2

The intersection is empty: for every kN we have kFk+1, since k<k+1; so no natural lies in all the Fn.

step 3.1L1
5.1

So in the complete metric space (X,d) the sets Fn are nonempty, closed, bounded, complete and nested, and their intersection is empty; the only hypothesis of In a complete metric space nested nonempty closed sets whose diameters tend to 0 meet in exactly one point, and this property characterises completeness that they fail is diam(Fn)0, so that hypothesis cannot be dropped.

step 2.3step 3.1step 2.4step 4.1step 4.2

Remarks

  • Indexing. N contains 0 here, so d is written with m+n and not with mn or 1/m: at m=0 those would be undefined or degenerate. The clause mn is what guarantees m+n1, and it is the reason the formula is stated by cases rather than as a single expression.
  • The metric is a small perturbation of the discrete metric, taking values in {0}(1,2], and its topology is discrete. Every subset is closed, so closedness is free and carries no information; what the example exploits is that a set can be closed, bounded and complete while its points stay a definite distance apart, so a nested family can drain away to nothing.
  • Contrast with the real line. On R the same sets [n,) are nested, nonempty and closed with empty intersection, but they are not bounded, so they are not a Cantor chain either. The present example is sharper: it keeps boundedness and loses only the vanishing of the diameters.
  • Both conclusions of the theorem fail here, not just one. There is neither a common point nor a unique one, which is what one expects: the uniqueness half of In a complete metric space nested nonempty closed sets whose diameters tend to 0 meet in exactly one point, and this property characterises completeness is exactly what the vanishing diameters buy.
CounterexampleConstruction: AI-adaptedVerification: AI-generatedprecheck passjudge pass (z-ai/glm-5.2)audited 2026-07-27Open item page →

On the positive integers the metrics mn and 1/m1/n both induce the discrete topology, and only the first is complete

Statement refuted

Refuted claim: completeness is determined by the topology, so topologically equivalent metrics are either both complete or both incomplete (FALSE: completeness of a metric space is determined by its topology, Topologically, uniformly and Lipschitz equivalent metrics on a set).

Let P:={nN:n1} be the positive integers, regarded inside R through the canonical embedding, and put

d(m,n):=mn,d(m,n):=1m1n(m,nP).

Then both are metrics on P, both induce the discrete topology, so Td=Td; (P,d) is complete and (P,d) is not; and consequently d and d are not uniformly equivalent either (Topologically, uniformly and Lipschitz equivalent metrics on a set).

Facts & Assumptions

Given: The set P of positive integers inside R; the functions d and d above; the sequence ak:=k+1 in P; a real ε>0.

[L2]

Reciprocation is strictly decreasing on the positive reals, hence injective there (Inverses of positives are positive, and reciprocation reverses order).

[L6]

Uniform equivalence of two metrics says exactly that both identity maps are uniformly continuous, and a uniformly continuous map sends Cauchy sequences to Cauchy sequences (Topologically, uniformly and Lipschitz equivalent metrics on a set, Uniform continuity of a map of metric spaces: one δ serving every point, A uniformly continuous map sends Cauchy sequences to Cauchy sequences).

Counterexample

technique · direct
1.1

d is a metric on P, being the restriction of the usual metric of R; and d is a metric on P, since it is the pullback of that metric along the injective map m1/m.

L1L2
2.1

The d-topology is discrete: Bd(m,1/2)={m} for every mP, because d(m,n)=mn1>1/2 for nm; so every subset of P is a union of open balls, hence open.

step 1.1L3L5
2.2

The d-topology is discrete as well. Fix mP and put r:=1/m1/(m+1)=1/(m(m+1))>0. If n>m then 1/n1/(m+1), so d(m,n)=1/m1/nr; if n<m then m2 and 1/n1/(m1), so d(m,n)=1/n1/m1/(m1)1/m=1/(m(m1))>r. Hence Bd(m,r)={m} and every subset of P is d-open.

step 1.1L2L5
2.3

(P,d) is complete: a d-Cauchy sequence tested at ε=1 has an index K with xkxl<1 for all k,lK, which by [L3] forces xk=xl; so the sequence is constant from K on and converges in P.

step 1.1L3L5
2.4

The sequence ak=k+1 is d-Cauchy: given a real ε>0, take N1 with 1/N<ε/2; for k,lN we have k+1>N and l+1>N, so d(ak,al)1/(k+1)+1/(l+1)<2/N<ε.

step 1.1L2L4L5
3.1

Therefore Td=Td: both are the collection of all subsets of P, so d and d are topologically equivalent.

step 2.1step 2.2L5
3.2

It has no d-limit in P: if pP then 1/p>0, and taking N1 with 1/N<1/(2p) gives, for every kN, 1/(k+1)<1/N<1/(2p) and hence d(ak,p)=1/(k+1)1/p1/p1/(k+1)>1/(2p)>0; so from no index on is d(ak,p) below 1/(2p), and ak↛p. Hence (P,d) is not complete.

step 2.4L2L4L5
3.3

The same sequence is not d-Cauchy, since d(aK,aK+1)=1 for every K; so if d and d were uniformly equivalent, the identity map (P,d)(P,d) would be uniformly continuous and would carry the d-Cauchy sequence (ak) to a d-Cauchy sequence, which it is not. Hence d and d are not uniformly equivalent.

step 2.4L3L6
4.1

So d and d are topologically equivalent metrics on one set of which exactly one is complete, which refutes the claim above; and step 3.3 locates the reason, namely that topological equivalence is strictly weaker than uniform equivalence.

step 3.1step 2.3step 3.2step 3.3

Remarks

CounterexampleConstruction: AI-adaptedVerification: AI-generatedprecheck passjudge pass (z-ai/glm-5.2)audited 2026-07-27Open item page →

On (0,) the metrics xy and 1/x1/y share their topology and not their Cauchy sequences

Statement refuted

Refuted claim: topologically equivalent metrics have the same Cauchy sequences (FALSE: two metrics inducing the same topology have the same Cauchy sequences, Topologically, uniformly and Lipschitz equivalent metrics on a set, Cauchy sequence in a metric space).

Let X:=(0,)R (Intervals of R: the nine order-convex forms, nondegeneracy, and length) and put

d(x,y):=xy,d(x,y):=1x1y(x,yX).

Both are metrics on X and Td=Td. The sequence xk:=1/(k+2) is d-Cauchy and not d-Cauchy; the sequence yk:=k+2 is d-Cauchy and not d-Cauchy. So neither metric's Cauchy sequences are contained in the other's, and topological equivalence controls neither direction.

Facts & Assumptions

Given: The set X=(0,) with the metrics d and d above; the sequences xk=1/(k+2) and yk=k+2; a point aX; reals r,s,ε>0.

[L2]

For x,a>0: 1/x1/a=(ax)/(xa), so xa=1/x1/axa and 1/x1/a=xa/(xa); reciprocation is strictly decreasing on the positives, hence injective there (Inverses of positives are positive, and reciprocation reverses order, Sign rules for products and monotonicity of multiplication).

[L6]

Cauchyness may be tested with real ε>0 (Cauchy sequence in a metric space, The rationals embed densely in the reals).

[L7]

Uniform equivalence says both identity maps are uniformly continuous, and a uniformly continuous map sends Cauchy sequences to Cauchy sequences (Topologically, uniformly and Lipschitz equivalent metrics on a set, Uniform continuity of a map of metric spaces: one δ serving every point, A uniformly continuous map sends Cauchy sequences to Cauchy sequences).

Counterexample

technique · direct
1.1

d is a metric on X, being the restriction of the usual metric of R; and d is a metric on X, being the pullback of that metric along the injective map x1/x.

L1L2
2.1

Given aX and a real r>0, put s:=min{1/(2a),r/(4a2)}>0. If d(x,a)<s then 1/x1/a<1/(2a), so 1/x>1/(2a) and hence x<2a; therefore xa=1/x1/axa<s2a2r/2<r. So Bd(a,s)Bd(a,r).

step 1.1L2L3L5
2.2

Given aX and a real s>0, put r:=min{a/2,sa2/4}>0. If d(x,a)<r then xa<a/2, so x>a/2 and hence 1/x1/a=xa/(xa)<r/((a/2)a)=2r/a2s/2<s. So Bd(a,r)Bd(a,s).

step 1.1L2L3L5
2.3

The sequence xk=1/(k+2) lies in X; it is d-Cauchy, since for a real ε>0 and N1 with 1/N<ε/2 every k,lN gives d(xk,xl)1/(k+2)+1/(l+2)<2/N<ε.

step 1.1L4L6
3.1

Hence Td=Td: a d-open U is d-open by step 2.1 applied at each of its points, and conversely by step 2.2.

step 2.1step 2.2L3
3.2

It is not d-Cauchy: d(xk,xl)=(k+2)(l+2)=kl, so d(xK,xK+1)=1 for every K and the Cauchy condition fails at ε=1.

step 2.3L1L2L6
3.3

The sequence yk=k+2 lies in X; it is d-Cauchy, since d(yk,yl)=1/(k+2)1/(l+2)1/(k+2)+1/(l+2), which is below ε for k,lN by the computation of step 2.3.

step 2.3L1L2L4L6
4.1

It is not d-Cauchy: d(yK,yK+1)=1 for every K, so the Cauchy condition fails at ε=1.

step 3.3L1L6
5.1

So d and d are topologically equivalent metrics on X whose classes of Cauchy sequences are incomparable, which refutes the claim above.

step 3.1step 2.3step 3.2step 3.3step 4.1
6.1

In particular d and d are not uniformly equivalent, since uniform equivalence would make both identity maps uniformly continuous and hence would preserve Cauchy sequences in both directions.

step 5.1L7

Remarks

  • The map x1/x is what is being tested. It is a bijection of (0,) onto itself and a homeomorphism, by steps 2.1 and 2.2, and d is the metric it pulls back from d. Homeomorphisms preserve open sets and convergence; they do not preserve Cauchyness, and this is that failure written out.
  • Both failures come from a missing endpoint, at opposite ends. The sequence (xk) heads for 0, which (0,) does not contain, so it is d-Cauchy without converging; its image under x1/x runs off to the right and is not Cauchy at all. Reading the same picture through d exchanges the two ends, which is why the failure is symmetric.
  • Indexing. The terms are 1/(k+2) and k+2 rather than 1/k and k because N contains 0 in this library; 1/0 does not exist and 0(0,), so both sequences are shifted to start safely inside the space.
  • The completeness version of the same phenomenon is On the positive integers the metrics mn and 1/m1/n both induce the discrete topology, and only the first is complete, and the general statement being refuted there is FALSE: completeness of a metric space is determined by its topology.
CounterexampleConstruction: AI-adaptedVerification: AI-generatedprecheck passjudge pass (z-ai/glm-5.2)audited 2026-07-27Open item page →

x1/x is continuous on (0,1) and sends the Cauchy sequence (1/(k+2))k0 to an unbounded one

Statement refuted

Refuted claim: the hypothesis of A uniformly continuous map sends Cauchy sequences to Cauchy sequences may be weakened from uniform continuity to continuity; a continuous map of metric spaces sends Cauchy sequences to Cauchy sequences.

Let X:=(0,1)R (Intervals of R: the nine order-convex forms, nondegeneracy, and length) with the metric inherited from the real line (The absolute value makes R a metric space: d(x,y)=xy is a metric, its open balls are the intervals (xr,x+r), and it is unbounded, Isometry, isometric embedding, and the subspace metric on a subset), let R carry its usual metric, and let f:XR be f(x):=1/x. Then f is continuous (Continuity of a map between metric spaces, at a point and globally, in the ε-δ form), the sequence xk:=1/(k+2) is Cauchy in X (Cauchy sequence in a metric space), and the image sequence f(xk)=k+2 is unbounded and not Cauchy. Consequently f is not uniformly continuous (Uniform continuity of a map of metric spaces: one δ serving every point).

Facts & Assumptions

Given: The interval X=(0,1) with the metric inherited from R; the map f(x)=1/x; the sequence xk=1/(k+2); a point aX; reals ε,δ>0.

[L2]

For x,a>0: 1/x1/a=xa/(xa); reciprocation reverses order on the positives; and inequalities may be multiplied by positives (Inverses of positives are positive, and reciprocation reverses order, Sign rules for products and monotonicity of multiplication).

[L3]

For every real η>0 there is a natural N1 with 1/N<η, and for every real t there is a natural n1 with t<n (For every ε>0 in a complete ordered field there is a natural n1 with 1/n<ε, Every complete ordered field is Archimedean).

[L6]

A convergent sequence in a metric space is Cauchy (Every convergent sequence in a metric space is Cauchy); a sequence of reals is bounded when some real dominates all its absolute values (Sequences of reals: bounded, eventually, frequently, tails, subsequences).

[L7]

Uniformly continuous maps send Cauchy sequences to Cauchy sequences (A uniformly continuous map sends Cauchy sequences to Cauchy sequences).

Counterexample

technique · direct
1.1

f is continuous at every aX: put δ:=min{a/2, εa2/4}>0. If xX and xa<δ then xa<a/2, so x>a/2, and therefore 1/x1/a=xa/(xa)<δ/((a/2)a)=2δ/a2ε/2<ε. Since a was arbitrary, f is continuous on X.

L1L2L4L5
1.2

Every term of (xk) lies in X: k+22 gives 0<1/(k+2)1/2<1.

L1L2
2.1

(xk) is Cauchy in X: given a real ε>0, take N1 with 1/N<ε/2; for k,lN we have k+2>N and l+2>N, so xkxl1/(k+2)+1/(l+2)<2/N<ε.

step 1.2L1L3L5
2.2

f(xk)=k+2 for every k.

step 1.2L2
3.1

The image sequence is unbounded: for a real M, [L3] supplies a natural n1 with M<n, and then f(xn)=n+2>n>M.

step 2.2L3L6
3.2

The image sequence is not Cauchy: f(xK)f(xK+1)=(K+2)(K+3)=1 for every K, so the Cauchy condition fails at ε=1.

step 2.2L5
4.1

So a continuous map has carried a Cauchy sequence to a non-Cauchy one, which refutes the claim above; and f cannot be uniformly continuous, since a uniformly continuous map would have preserved Cauchyness.

step 1.1step 2.1step 3.1step 3.2L7

Remarks

CounterexampleConstruction: AI-adaptedVerification: AI-generatedprecheck passjudge pass (z-ai/glm-5.2)audited 2026-07-27Open item page →

xx is a uniformly continuous bijection of [0,) onto itself whose inverse xx2 is not uniformly continuous

Statement refuted

Refuted claim: the inverse of a uniformly continuous bijection of metric spaces is uniformly continuous (Uniform continuity of a map of metric spaces: one δ serving every point, Injection, surjection, bijection).

Let X:=[0,)R (Intervals of R: the nine order-convex forms, nondegeneracy, and length) with the metric inherited from the real line (The absolute value makes R a metric space: d(x,y)=xy is a metric, its open balls are the intervals (xr,x+r), and it is unbounded, Isometry, isometric embedding, and the subspace metric on a subset), and let

g:XX,g(x):=x,h:XX,h(x):=x2.

Then g is a bijection of X onto itself with inverse h; g is uniformly continuous; and h is not uniformly continuous, the pairs n+1/n and n defeating every candidate δ at ε=2.

Facts & Assumptions

Given: X=[0,) with the metric inherited from R; the maps g(x)=x and h(x)=x2; a natural n1; reals ε,δ>0.

[L2]

For a,b0: ab if and only if a2b2 (Squaring is monotone on the nonnegatives).

[L4]

Factorisation of a difference of squares: x2y2=(xy)(x+y) (Factorisation of bnan, and the resulting Lipschitz estimate).

[L7]

Uniform continuity: one δ>0 per ε>0 serving every pair (Uniform continuity of a map of metric spaces: one δ serving every point).

Counterexample

technique · direct
1.1

g and h map X into X: x0 for x0 by [L1], and x20 for every real x.

L1L2
1.2

g is uniformly continuous on X.

L3L7
1.3

For every real t>0 and every x,y0: h(x)h(y)=x2y2=(xy)(x+y).

L4
2.1

h(g(x))=(x)2=x for every x0, and g(h(x))=x2=x for every x0, the latter because x0 and x2=x2 make x the unique nonnegative square root of x2. So g and h are mutually inverse bijections of X onto itself.

step 1.1L1L2
2.2

Fix a real δ>0 and take a natural n1 with 1/n<δ; put x:=n+1/n and y:=n, both in X. Then xy=1/n<δ.

step 1.3L5L6
3.1

But h(x)h(y)=(xy)(x+y)=1n(2n+1n)=2+1n2>2. So the pair (x,y) satisfies xy<δ and h(x)h(y)>2.

step 1.3step 2.2L5L6
4.1

Since δ>0 was arbitrary, no δ witnesses the uniform continuity condition for h at ε=2, so h is not uniformly continuous.

step 2.2step 3.1L7
5.1

Therefore g is a uniformly continuous bijection of X onto itself whose inverse h is not uniformly continuous, which refutes the claim above.

step 2.1step 1.2step 4.1

Remarks

Sources