Alphabeta Math
CounterexampleConstruction: AI-adaptedVerification: AI-generatedprecheck 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.

x↦x/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):=∣x−y∣ inherited from the real line (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, Isometry, isometric embedding, and the subspace metric on a subset), and let f:X→X 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 0≤q<1 (Lipschitz map, α-Hölder map for rational 0<α≤1, and contraction).

Counterexample

technique · direct
1.1

X is nonempty, since 1∈X.

L1
1.2

f maps X into X: for 0<x≤1 one has 0<x/2≤1/2≤1.

L1L2
1.3

f is a contraction with constant 1/2: d(f(x),f(y))=∣x/2−y/2∣=12∣x−y∣=12d(x,y) for all x,y∈X, and 0≤1/2<1.

L1L4
1.4

Every term of (xk) lies in X, since k+2≥2 gives 0<1/(k+2)≤1/2≤1; and xk→0 in R, because for a real ε>0 and N≥1 with 1/N<ε every k≥N has k+2>N and hence ∣xk−0∣=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 0∉X.

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 p∈X would also be a limit in R and uniqueness of limits there would force p=0∉X. 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

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

71 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.

Sources