Alphabeta Math
CorollaryStatement: AI-adaptedProof: AI-adaptedprecheck passjudge pass (z-ai/glm-5.2)verified 2026-07-29 (claude-fable-5)
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 real-valued continuous map on a connected space has order-convex image, so it takes every value between any two of its values

Statement

Let X be a connected topological space (Separation of a topological space, connected and disconnected spaces, clopen sets, and connected subsets) and let f:X→R be continuous (Continuity of a map of topological spaces at a point and globally), R carrying its usual topology (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, 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, Metrizable space: a topological space whose topology is induced by some metric; metrizability is topological, the metric is not). Then:

  1. f[X] is an order-convex subset of R (Intervals of R: the nine order-convex forms, nondegeneracy, and length).
  2. Intermediate values are attained. If p,q∈X and c∈R satisfies f(p)≤c≤f(q), then there is x∈X with f(x)=c.

Claim 2 is the intermediate value theorem with no hypothesis on X beyond connectedness: no order, no metric, no interval. The classical statement for a continuous f:[a,b]→R is the special case X=[a,b], that subspace being connected by The connected subspaces of R with its usual topology are exactly the order-convex subsets, the published characterisation transported by the identification of the two descriptions of "open in R".

Facts & Assumptions

Proof

technique · direct
1.1

f[X] is a connected subset of R, by [A1] applied to the connected space X and the continuous map f.

A1given
2.1

Hence f[X] is order-convex by [A2]; this is claim 1.

step 1.1A2
3.1

For claim 2, let p,q∈X and c∈R with f(p)≤c≤f(q). Both f(p) and f(q) lie in f[X], so c∈f[X] by step 2.1, which says precisely that c=f(x) for some x∈X.

step 2.1∎

Remarks

  • Why f(p)≤c≤f(q) and not f(p)<c<f(q). Order-convexity is stated with non-strict inequalities, so the endpoints are included and the statement covers c=f(p) and c=f(q) without a separate clause. No assumption f(p)≤f(q) is needed either: if f(q)≤c≤f(p) the same argument applies with the two points exchanged.

  • What is not claimed. Nothing here says that f[X] is an interval in the sense of one of the nine written forms of Intervals of R: the nine order-convex forms, nondegeneracy, and length; that classification of the order-convex sets is recorded there as unproved. Nor does the corollary say anything about how many x satisfy f(x)=c, or that such an x can be found by any procedure. It is an existence statement obtained by transporting connectedness, and the witness is never exhibited.

  • The hypothesis on X is exactly connectedness. If X is disconnected the conclusion fails at once: a separation (U,V) of X gives a continuous f equal to 0 on U and 1 on V whose image is {0,1}, which omits every value strictly between.

Depends on

Used by

Dependency tree · two levels

52 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