Alphabeta Math
False statementConstruction: AI-adaptedVerification: AI-generatedSession-authored (Fable 5 assisted)precheck passjudge pass (z-ai/glm-5.2)audited 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.

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

Statement

The following statement is FALSE.

Let (X,d)(X,d) be a nonempty complete metric space (Complete metric space: every Cauchy sequence converges in the space) and let f:XXf : X \to X satisfy d(f(x),f(y))<d(x,y)for all x,yX with xy.d\big(f(x), f(y)\big) < d(x,y) \qquad \text{for all } x, y \in X \text{ with } x \ne y . Then ff has a fixed point.

The condition displayed above is what many texts call contractive; it is strictly weaker than being a contraction (Lipschitz map, α\alpha-Hölder map for rational 0<α10 < \alpha \le 1, and contraction), which demands a single constant q<1q < 1 with d(f(x),f(y))qd(x,y)d(f(x),f(y)) \le q\,d(x,y) for all pairs at once. Banach's 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) assumes the latter, and the difference between the two hypotheses is exactly what this item is about.

Facts & Assumptions

Given: The interval X:=[1,)RX := [1,\infty) \subseteq \mathbb{R} (Intervals of R\mathbb{R}: the nine order-convex forms, nondegeneracy, and length) with the metric d(x,y):=xyd(x,y) := |x-y| inherited from R\mathbb{R}, and the function f:XRf : X \to \mathbb{R} given by f(x):=x+1/xf(x) := x + 1/x.

[A1]

The false claim: a strictly distance-decreasing self-map of a nonempty complete metric space has a fixed point.

[L4]

Limits of reals preserve non-strict inequalities (Limits preserve non-strict inequalities).

[L5]

a>0a > 0 gives a1>0a^{-1} > 0, and a product of positives is positive; multiplying an inequality by a positive preserves it (Inverses of positives are positive, and reciprocation reverses order, Sign rules for products and monotonicity of multiplication).

[L6]

uv=uv|uv| = |u||v| for reals (Basic properties of the absolute value).

Refutation

technique · direct
1.1

XX is nonempty, since 1X1 \in X; and XX is sequentially closed in R\mathbb{R}, because a sequence in XX converging to a real pp satisfies xk1x_k \ge 1 for every kk and hence p1p \ge 1, so pXp \in X.

L1L4
1.2

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

L5
1.3

For all 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) - \frac{x-y}{xy} = (x-y)\Big(1 - \frac{1}{xy}\Big), since 1/x1/y=(yx)/(xy)1/x - 1/y = (y-x)/(xy).

L5
2.1

Hence XX is closed in R\mathbb{R}, and since R\mathbb{R} is complete, (X,d)(X,d) is a nonempty complete metric space.

step 1.1L1L2L3
2.2

Let x,yXx, y \in X with xyx \ne y. Then x,y1x,y \ge 1 and they are not both equal to 11, so xy>1xy > 1 and hence 0<1/(xy)<10 < 1/(xy) < 1, giving 0<11/(xy)<10 < 1 - 1/(xy) < 1.

step 1.2L5
2.3

ff has no fixed point in XX: 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.2L5
3.1

Therefore d(f(x),f(y))=f(x)f(y)=xy(11/(xy))<xy=d(x,y)d(f(x),f(y)) = |f(x)-f(y)| = |x-y| \cdot \big(1 - 1/(xy)\big) < |x-y| = d(x,y) for all xyx \ne y in XX: the map ff strictly decreases every distance between distinct points.

step 1.3step 2.2L5L6
4.1

So (X,d)(X,d) is a nonempty complete metric space and f:XXf : X \to X strictly decreases every distance between distinct points and has no fixed point, which refutes [A1]. The displayed statement is false.

step 2.1step 1.2step 3.1step 2.3A1

Remarks

  • What goes wrong, quantitatively. The factor by which ff shrinks distances is 11/(xy)1 - 1/(xy), which is below 11 at every pair but approaches 11 as xx and yy grow. No single q<1q < 1 dominates all of them, so ff is not a contraction and Banach's theorem does not apply. The failure is therefore not an accident of this example but the exact difference between a pointwise inequality and a uniform one, which is the same difference as between continuity and uniform continuity (Uniform continuity of a map of metric spaces: one δ\delta serving every point).
  • Compactness would repair it; boundedness would not. On a compact space the strict condition does force a fixed point, by minimising xd(x,f(x))x \mapsto d(x,f(x)); compactness of metric spaces is a later page in this library and nothing of the sort is claimed at this point. Adding boundedness to completeness, by contrast, is not enough, and the witness is small: on N\mathbb{N} put d(m,n):=1+2m1+2n1d(m,n) := 1 + 2^{-m-1} + 2^{-n-1} for mnm \ne n and d(n,n):=0d(n,n) := 0. Every nonzero distance lies in (1,7/4](1, 7/4], so the triangle inequality is automatic and dd is a bounded metric; the space is complete because distinct points are more than 11 apart, so a Cauchy sequence is eventually constant; and nn+1n \mapsto n+1 satisfies d(m+1,n+1)=1+2m2+2n2<d(m,n)d(m+1,n+1) = 1 + 2^{-m-2} + 2^{-n-2} < d(m,n) for mnm \ne n and has no fixed point. What the present item establishes is only that completeness alone is not enough.
  • The unboundedness of [1,)[1,\infty) is doing the work, and the map is pushing every point to the right by a shrinking but always positive amount. The worked-out version of this witness, including the verification that no contraction constant exists, is xx+1/xx \mapsto x + 1/x on [1,)[1,\infty) strictly decreases every distance and has no fixed point on the companion page.

Depends on

Used by

Dependency tree · next 3 levels

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