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.
The image of an interval under a continuous real function is order-convex, hence an interval, and the image of a closed bounded interval is a closed bounded interval
Statement
Let , let be 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) and let be order-convex (Intervals of : the nine order-convex forms, nondegeneracy, and length). Then:
- is order-convex, hence connected (A subset of is connected if and only if it is order-convex, that is, an interval, Separated sets, disconnection, and connected subset of );
- if with , then where and (Maximum and minimum of a set) — a closed bounded interval, degenerate exactly when is constant on .
"Interval" means "order-convex" here. As A subset of is connected if and only if it is order-convex, that is, an interval records, this library proves that the connected subsets of are exactly the order-convex ones, and does not prove that every order-convex subset is one of the nine written forms of Intervals of : the nine order-convex forms, nondegeneracy, and length. Claim 1 is therefore stated as order-convexity, which is what the intermediate value theorem delivers; claim 2 identifies the written form in the one case where the extreme value theorem supplies the endpoints.
Facts & Assumptions
Given: A set , a function continuous on , and an order-convex set .
Intermediate value theorem: if in , if is continuous on and if lies between and in either order, then for some (Intermediate value theorem, by bisection with a canonical left-half rule: a continuous function on takes every value between and ).
Continuity passes to subsets of the domain: if then is continuous on , since the defining condition quantifies over fewer points (Continuity of at a point of and on : the - condition, its agreement with at a limit point, and continuity at an isolated point).
Order-convexity: and imply ; every closed bounded interval with is order-convex and is a subset of any order-convex set containing and (Intervals of : the nine order-convex forms, nondegeneracy, and length).
Connectedness: a subset of is connected if and only if it is order-convex (A subset of is connected if and only if it is order-convex, that is, an interval, Separated sets, disconnection, and connected subset of ).
with is nonempty, closed and bounded (Intervals of : the nine order-convex forms, nondegeneracy, and length, Open subset of (every point has a neighbourhood inside it), closed subset (complement open), and clopen, Lower bound, bounded below, bounded set), hence compact (A subset of is compact if and only if it is closed and bounded, Open cover, subcover, compact subset of (every open cover has a finite subcover), and sequentially compact subset).
Extreme value theorem: a continuous real function on a nonempty compact subset of attains a greatest and a least value on it (Extreme value theorem: a continuous real function on a nonempty compact subset of attains a greatest and a least value, Maximum and minimum of a set).
Proof
Claim 1. Let and let satisfy . Write and with , and let be the closed bounded interval with and ; by [L3] and order-convexity of we have .
Claim 2, the endpoints. Suppose with . By [L5] the set is nonempty and compact, so by [L6] there are with for every ; put and , so and and .
By [L2] the restriction of to is continuous on , and lies between and in one order or the other, since and . By [L1] there is with , so .
So is order-convex, and by [L4] it is connected. This is claim 1.
Claim 2, the two inclusions. Every satisfies by step 1.2, so . Conversely, and lie in and is order-convex by step 3.1, so every with lies in ; hence . Therefore , a closed bounded interval, and it is the single point exactly when , that is exactly when is constant on .
Remarks
-
The two halves come from the two theorems. Order-convexity of the image is the intermediate value theorem and needs nothing else; that the image of a closed bounded interval is again closed and bounded is the extreme value theorem, and it fails for other interval forms: the continuous image of under is , and under it is , neither closed.
-
The converse of claim 1 is false. A function whose image on every subinterval is order-convex need not be continuous; this is the intermediate value property without continuity, and the witness for it is not available at this point in the reading order. What is true, and is proved on this page, is that a function which is monotone and has an order-convex image is continuous (A function on an interval satisfying whenever , whose image is order-convex, is continuous).
-
Claim 2 is the shape the -th-root example uses. Applying it to on gives an interval containing and , hence containing ; that is the second proof of the existence of -th roots recorded in The intermediate value theorem gives a second proof that every nonnegative real has an -th root, applied to on a closed bounded interval ↗ on the companion page.
Depends on
- 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)$
- Extreme value theorem: a continuous real function on a nonempty compact subset of $\mathbb{R}$ attains a greatest and a least value
- A subset of $\mathbb{R}$ is compact if and only if it is closed and bounded
- Open cover, subcover, compact subset of $\mathbb{R}$ (every open cover has a finite subcover), and sequentially compact subset
- Intervals of $\mathbb{R}$: the nine order-convex forms, nondegeneracy, and length
- Separated sets, disconnection, and connected subset of $\mathbb{R}$
- A subset of $\mathbb{R}$ is connected if and only if it is order-convex, that is, an interval
- 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
- Lower bound, bounded below, bounded set
- Maximum and minimum of a set
- Open subset of $\mathbb{R}$ (every point has a neighbourhood inside it), closed subset (complement open), and clopen
Used by
- The intermediate value property (Darboux property) of a function on an interval: the image of every subinterval is order-convex Definition
- The intermediate value theorem gives a second proof that every nonnegative real has an n-th root, applied to xⁿ on a closed bounded interval Example
- FALSE: a function with the intermediate value property on an interval is continuous False statement
- Bonnet's second mean value theorem: for f monotone and g integrable on [a,b] there is ξ∈[a,b] with ∫ₐᵇ fg = f(a)∫ₐ^ξ g + f(b)∫_ξᵇ g Theorem
- Continuous inverse theorem: a continuous injective f on an interval I is a bijection onto the order-convex set f[I], and the inverse g : f[I] → I is continuous and strictly monotone in the same sense as f Theorem
- If f is continuous on [a,b] and g is integrable with g ≥ 0, there is ξ ∈ [a,b] with ∫ₐᵇ fg = f(ξ)∫ₐᵇ g Theorem
- Substitution: if φ is differentiable on [c,d] with φ' integrable and f is continuous on an interval containing φ([c,d]), then ∫_φ(c)^φ(d) f = ∫_cᵈ (f∘φ) φ' Theorem
Dependency tree · next 3 levels
Direct dependencies and their dependencies through the next three levels: 91 results over 19 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
- Intermediate value theorem (Wikipedia) (standard reference, not scraped)
- W. Rudin, Principles of Mathematical Analysis, 3rd ed., Ch. 4 (standard reference, not scraped)
- J. Lebl, Basic Analysis I, §3.3 (standard reference, not scraped)
- E. Zakon, Mathematical Analysis, §4.9: The Intermediate Value Property (standard reference, not scraped)