Alphabeta Math
CounterexampleConstruction: AI-adaptedVerification: AI-generatedSession-authored (Fable 5 assisted)precheck passverified 2026-08-03 (gpt-5.6-sol-codex-subscription)
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.

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

Statement refuted

Refuted claim: a self-map ff of a nonempty complete metric space with d(f(x),f(y))<d(x,y)d(f(x),f(y)) < d(x,y) for all xyx \ne y 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)d(fx, fy) < d(x,y) for all xyx \ne y on a complete metric space forces a fixed point).

Let X:=[1,)RX := [1,\infty) \subseteq \mathbb{R} (Intervals of R\mathbb{R}: the nine order-convex forms, nondegeneracy, and length) carry the metric d(x,y):=xyd(x,y) := |x-y| inherited from the real line (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, Isometry, isometric embedding, and the subspace metric on a subset) and let

f(x):=x+1x(xX).f(x) := x + \frac{1}{x} \qquad (x \in X).

Then (X,d)(X,d) is nonempty and complete, ff maps XX into XX, d(f(x),f(y))<d(x,y)d(f(x),f(y)) < d(x,y) whenever xyx \ne y, and ff has no fixed point. Moreover ff is not a contraction (Lipschitz map, α\alpha-Hölder map for rational 0<α10 < \alpha \le 1, and contraction): no real q<1q < 1 satisfies d(f(x),f(y))qd(x,y)d(f(x),f(y)) \le q\,d(x,y) for all x,yXx,y \in X.

Facts & Assumptions

Given: The interval X=[1,)X = [1,\infty) with the metric dd inherited from R\mathbb{R}; the map f(x)=x+1/xf(x) = x + 1/x; a natural n1n \ge 1; a real qq with 0q<10 \le q < 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\eta > 0 there is a natural n1n \ge 1 with 1/n<η1/n < \eta; and positive naturals sit in R\mathbb{R} in their own order (Every complete ordered field is Archimedean, For every ε>0\varepsilon > 0 in a complete ordered field there is a natural n1n \ge 1 with 1/n<ε1/n < \varepsilon, Canonical naturals are positive and strictly increasing).

[L5]

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

Counterexample

technique · direct
1.1

XX is nonempty (1X1 \in X) and sequentially closed in R\mathbb{R}, since a sequence in XX converging to a real pp has xk1x_k \ge 1 for every kk and hence p1p \ge 1; so XX is closed in R\mathbb{R}, and R\mathbb{R} being complete, (X,d)(X,d) is a nonempty complete metric space.

L1L2
1.2

ff maps XX into XX: x1x \ge 1 gives 1/x>01/x > 0, so f(x)=x+1/x>x1f(x) = x + 1/x > x \ge 1.

L3
1.3

For x,yXx,y \in X: f(x)f(y)=(xy)+(1/x1/y)=(xy)xyxy=(xy)(11xy)f(x) - f(y) = (x-y) + \big(1/x - 1/y\big) = (x-y) - \dfrac{x-y}{xy} = (x-y)\Big(1 - \dfrac{1}{xy}\Big).

L3
2.1

Let x,yXx,y \in X with xyx \ne y. Then x,y1x,y \ge 1 and they are not both 11, so xy>1xy > 1, hence 0<1/(xy)<10 < 1/(xy) < 1 and 0<11/(xy)<10 < 1 - 1/(xy) < 1; therefore d(f(x),f(y))=xy(11/(xy))<xy=d(x,y)d(f(x),f(y)) = |x-y| \cdot \big(1 - 1/(xy)\big) < |x-y| = d(x,y).

step 1.2step 1.3L1L3
2.2

ff has no fixed point: f(x)x=1/x>0f(x) - x = 1/x > 0 for every xXx \in X, so f(x)xf(x) \ne x.

step 1.2L3
3.1

ff is not a contraction. Suppose 0q<10 \le q < 1 satisfied d(f(x),f(y))qd(x,y)d(f(x),f(y)) \le q\,d(x,y) for all x,yXx,y \in X. Taking x:=n+1x := n+1 and y:=ny := n for a natural n1n \ge 1 gives xy=1|x - y| = 1 and, by step 1.3, d(f(x),f(y))=11n(n+1)d(f(x),f(y)) = 1 - \dfrac{1}{n(n+1)}, so 11n(n+1)q1 - \dfrac{1}{n(n+1)} \le q, that is 1q1n(n+1)1n1 - q \le \dfrac{1}{n(n+1)} \le \dfrac{1}{n}.

step 1.3step 2.1L1L3L4L5
4.1

But 1q>01 - q > 0, so [L4] supplies a natural n1n \ge 1 with 1/n<1q1/n < 1-q, contradicting step 3.1. Hence no such qq exists.

step 3.1L4
5.1

So (X,d)(X,d) is nonempty and complete, f:XXf : X \to X strictly decreases every distance between distinct points, ff has no fixed point, and ff 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)(n+1, n) is 11/(n(n+1))1 - 1/(n(n+1)), which is below 11 for every nn and approaches 11 as nn grows; the contraction condition asks for a single bound below 11 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 δ\delta serving every point).
  • Why the iterates do not help. Starting anywhere in [1,)[1,\infty), the iterates increase, since f(x)>xf(x) > x, and they run off to the right; there is no Cauchy sequence to complete, so completeness of XX is no help at all. This is the opposite failure mode to xx/2x \mapsto x/2 maps (0,1](0,1] into itself, is a 1/21/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.

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: 140 results over 28 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