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.
A worked fixed point on for the map , from the one-dimensional fixed point theorem
Example
Let
(Intervals of : the nine order-convex forms, nondegeneracy, and length). Then:
- is continuous on (Continuity of at a point of and on : the - condition, its agreement with at a limit point, and continuity at an isolated point);
- for every ;
- by Every continuous map of a closed bounded interval into itself has a fixed point, has a fixed point in ; and
- that fixed point is unique and equals (Existence and uniqueness of -th roots: a unique with ).
What the example is for. It is the smallest nontrivial instance of the one-dimensional fixed point theorem in which the fixed point can be named, and it shows that the theorem, which asserts existence only, may be combined with an algebraic identity to pin the point down. The identity is elementary: says , that is .
No derivative is used, and none is available at this point in the reading order. The usual argument that maps into itself computes the minimum of by differentiation; the two-line order estimate of step 1.2 below replaces it. The same map is treated as a contraction of in The map is a contraction of with fixed point , and the a priori bound gives the error after steps, where the Banach fixed point theorem gives the same point together with an error bound after iterations; that route needs completeness of the metric subspace, this one needs only the intermediate value theorem.
Facts & Assumptions
Given: The interval and the function on it.
Algebra of continuous functions: the identity and constants are continuous, sums and scalar multiples of continuous functions are continuous, and the reciprocal of a continuous nowhere-vanishing function is continuous (Sums, scalar multiples, products, absolute values, maxima, minima and quotients with nonvanishing denominator of continuous functions are continuous, as are constants, the identity and every polynomial function, Continuity of at a point of and on : the - condition, its agreement with at a limit point, and continuity at an isolated point).
One-dimensional fixed point theorem: a continuous with and for all has a fixed point in (Every continuous map of a closed bounded interval into itself has a fixed point, Intermediate value theorem, by bisection with a canonical left-half rule: a continuous function on takes every value between and ).
Reciprocals and order: for one has , hence and so (Inverses of positives are positive, and reciprocation reverses order, Ordered field).
Square roots: for there is a unique with , written ; and is strictly increasing on the nonnegative reals (Existence and uniqueness of -th roots: a unique with , Monotonicity of and of , Integer powers ).
Ordered-field arithmetic: ; halving preserves order; and (Ordered field, Complete ordered field (least-upper-bound property), Integer powers ).
Verification
Claim 1. On the identity is continuous and does not vanish, since ; so is continuous there by [L1], and is continuous on as a scalar multiple of a sum of continuous functions.
Claim 2. Let . By [L3] we have , and by hypothesis ; adding, , and halving gives by [L5]. So .
Claim 3. By [L2], applied with , and the map , which is continuous by step 1.1 and maps into itself by step 1.2, there is with .
Every fixed point squares to . Let satisfy . Then , so multiplying by gives , that is .
Claim 4. By [L4] there is exactly one nonnegative real whose square is , namely ; since every fixed point is and satisfies by step 3.1, the fixed point is unique and equals . And does lie in : from and the strict monotonicity of on the nonnegative reals ([L4], [L5]) one gets .
Remarks
-
A sharper bound, from a square. For one has , and expanding gives , so for every . That is the same identity The map is a contraction of with fixed point , and the a priori bound gives the error after steps uses, and it shows that maps into ; the crude estimate of step 1.2 is all that claim 2 needs, and it avoids square roots entirely.
-
Existence and identification are separate steps. Every continuous map of a closed bounded interval into itself has a fixed point gives claim 3 with no information about where the point is; claim 4 is pure algebra and would be equally valid if no fixed point existed, since it only says which number a fixed point must be. It is the combination that names .
-
The interval matters. On the same formula has the fixed point , and on an interval straddling the map is not even defined. Choosing is what makes claim 2 true and isolates the positive root.
Depends on
- Every continuous map of a closed bounded interval into itself has a fixed point
- Intermediate value theorem, by bisection with a canonical left-half rule: a continuous function on $[a,b]$ takes every value between $f(a)$ and $f(b)$
- Sums, scalar multiples, products, absolute values, maxima, minima and quotients with nonvanishing denominator of continuous functions are continuous, as are constants, the identity and every polynomial function
- Existence and uniqueness of $n$-th roots: a unique $a^{1/n} \ge 0$ with $(a^{1/n})^n = a$
- Continuity of $f : A \to \mathbb{R}$ at a point of $A$ and on $A$: the $\varepsilon$-$\delta$ condition, its agreement with $\lim_{x \to c} f(x) = f(c)$ at a limit point, and continuity at an isolated point
- Intervals of $\mathbb{R}$: the nine order-convex forms, nondegeneracy, and length
- Integer powers $a^m$
- Monotonicity of $x \mapsto x^n$ and of $n \mapsto a^n$
- Inverses of positives are positive, and reciprocation reverses order
- Ordered field
- Complete ordered field (least-upper-bound property)
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: 106 results over 22 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
- Fixed point (mathematics) (Wikipedia) (standard reference, not scraped)
- Methods of computing square roots (Wikipedia) (standard reference, not scraped)
- Intermediate value theorem (Wikipedia) (standard reference, not scraped)