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: for all on a complete metric space forces a fixed point
Statement
The following statement is FALSE.
Let be a nonempty complete metric space (Complete metric space: every Cauchy sequence converges in the space) and let satisfy Then has a fixed point.
The condition displayed above is what many texts call contractive; it is strictly weaker than being a contraction (Lipschitz map, -Hölder map for rational , and contraction), which demands a single constant with 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 (Intervals of : the nine order-convex forms, nondegeneracy, and length) with the metric inherited from , and the function given by .
The false claim: a strictly distance-decreasing self-map of a nonempty complete metric space has a fixed point.
The absolute value makes a metric space, and a restriction of a metric to a subset is a metric with the same distances (The absolute value makes a metric space: is a metric, its open balls are the intervals , and it is unbounded, Isometry, isometric embedding, and the subspace metric on a subset, Metric space: iff , symmetry, and the triangle inequality; pseudometric and ultrametric, Basic properties of the absolute value).
with the usual metric is complete ( and for with the Euclidean metric are complete, componentwise from the Cauchy criterion in ).
A closed subset of a complete metric space is complete, and a subset is closed exactly when it is sequentially closed (A subspace of a complete metric space is complete iff it is closed, and a complete subspace of any metric space is closed, A point lies in the closure of iff some sequence in converges to it, and a set is closed iff it is sequentially closed, 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, Convergence of a sequence in a metric space: iff in ).
Limits of reals preserve non-strict inequalities (Limits preserve non-strict inequalities).
gives , 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).
for reals (Basic properties of the absolute value).
Refutation
is nonempty, since ; and is sequentially closed in , because a sequence in converging to a real satisfies for every and hence , so .
maps into : for one has , so .
For all : , since .
Hence is closed in , and since is complete, is a nonempty complete metric space.
Let with . Then and they are not both equal to , so and hence , giving .
has no fixed point in : for every , so .
Therefore for all in : the map strictly decreases every distance between distinct points.
So is a nonempty complete metric space and strictly decreases every distance between distinct points and has no fixed point, which refutes [A1]. The displayed statement is false.
Remarks
- What goes wrong, quantitatively. The factor by which shrinks distances is , which is below at every pair but approaches as and grow. No single dominates all of them, so 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 serving every point).
- Compactness would repair it; boundedness would not. On a compact space the strict condition does force a fixed point, by minimising ; 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 put for and . Every nonzero distance lies in , so the triangle inequality is automatic and is a bounded metric; the space is complete because distinct points are more than apart, so a Cauchy sequence is eventually constant; and satisfies for and has no fixed point. What the present item establishes is only that completeness alone is not enough.
- The unboundedness of 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 on strictly decreases every distance and has no fixed point ↗ on the companion page.
Depends on
- A contraction of a nonempty complete metric space into itself has exactly one fixed point, the limit of the iterates from any starting point
- Lipschitz map, $\alpha$-Hölder map for rational $0 < \alpha \le 1$, and contraction
- Complete metric space: every Cauchy sequence converges in the space
- The absolute value makes $\mathbb{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
- A subspace of a complete metric space is complete iff it is closed, and a complete subspace of any metric space is closed
- Inverses of positives are positive, and reciprocation reverses order
- $\mathbb{R}$ and $\mathbb{R}^n$ for $n \ge 1$ with the Euclidean metric are complete, componentwise from the Cauchy criterion in $\mathbb{R}$
- Intervals of $\mathbb{R}$: the nine order-convex forms, nondegeneracy, and length
- A point lies in the closure of $A$ iff some sequence in $A$ converges to it, and a set is closed iff it is sequentially closed
- Limits preserve non-strict inequalities
- Metric space: $d(x,y) = 0$ iff $x = y$, symmetry, and the triangle inequality; pseudometric and ultrametric
- Basic properties of the absolute value
- Sign rules for products and monotonicity of multiplication
- Convergence of a sequence in a metric space: $x_k \to x$ iff $d(x_k, x) \to 0$ in $\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
- Uniform continuity of a map of metric spaces: one $\delta$ serving every point
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
- Contraction mapping (Wikipedia) (standard reference, not scraped)
- Banach fixed-point theorem (Wikipedia) (standard reference, not scraped)