Alphabeta Math
CorollaryStatement: AI-adaptedProof: AI-generatedSession-authored (Fable 5 assisted)precheck 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.

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 ARA \subseteq \mathbb{R}, let f:ARf : A \to \mathbb{R} be continuous on AA (Continuity of f:ARf : A \to \mathbb{R} at a point of AA and on AA: the ε\varepsilon-δ\delta condition, its agreement with limxcf(x)=f(c)\lim_{x \to c} f(x) = f(c) at a limit point, and continuity at an isolated point) and let IAI \subseteq A be order-convex (Intervals of R\mathbb{R}: the nine order-convex forms, nondegeneracy, and length). Then:

  1. f[I]f[I] is order-convex, hence connected (A subset of R\mathbb{R} is connected if and only if it is order-convex, that is, an interval, Separated sets, disconnection, and connected subset of R\mathbb{R});
  2. if I=[a,b]I = [a,b] with aba \le b, then f[I]=[m,M]f[I] = [m, M] where m=minf[I]m = \min f[I] and M=maxf[I]M = \max f[I] (Maximum and minimum of a set) — a closed bounded interval, degenerate exactly when ff is constant on [a,b][a,b].

"Interval" means "order-convex" here. As A subset of R\mathbb{R} is connected if and only if it is order-convex, that is, an interval records, this library proves that the connected subsets of R\mathbb{R} 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 R\mathbb{R}: 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 ARA \subseteq \mathbb{R}, a function f:ARf : A \to \mathbb{R} continuous on AA, and an order-convex set IAI \subseteq A.

[L1]

Intermediate value theorem: if uvu \le v in R\mathbb{R}, if ff is continuous on [u,v][u,v] and if ww lies between f(u)f(u) and f(v)f(v) in either order, then f(t)=wf(t) = w for some t[u,v]t \in [u,v] (Intermediate value theorem, by bisection with a canonical left-half rule: a continuous function on [a,b][a,b] takes every value between f(a)f(a) and f(b)f(b)).

[L2]

Continuity passes to subsets of the domain: if BAB \subseteq A then fBf|_B is continuous on BB, since the defining condition quantifies over fewer points (Continuity of f:ARf : A \to \mathbb{R} at a point of AA and on AA: the ε\varepsilon-δ\delta condition, its agreement with limxcf(x)=f(c)\lim_{x \to c} f(x) = f(c) at a limit point, and continuity at an isolated point).

[L3]

Order-convexity: x,zSx, z \in S and xwzx \le w \le z imply wSw \in S; every closed bounded interval [u,v][u,v] with uvu \le v is order-convex and is a subset of any order-convex set containing uu and vv (Intervals of R\mathbb{R}: the nine order-convex forms, nondegeneracy, and length).

[L6]

Extreme value theorem: a continuous real function on a nonempty compact subset of R\mathbb{R} attains a greatest and a least value on it (Extreme value theorem: a continuous real function on a nonempty compact subset of R\mathbb{R} attains a greatest and a least value, Maximum and minimum of a set).

Proof

technique · direct
1.1

Claim 1. Let u,vf[I]u', v' \in f[I] and let ww satisfy uwvu' \le w \le v'. Write u=f(p)u' = f(p) and v=f(q)v' = f(q) with p,qIp, q \in I, and let [s,t][s,t] be the closed bounded interval with {s,t}={p,q}\{s,t\} = \{p,q\} and sts \le t; by [L3] and order-convexity of II we have [s,t]IA[s,t] \subseteq I \subseteq A.

L3choose
1.2

Claim 2, the endpoints. Suppose I=[a,b]I = [a,b] with aba \le b. By [L5] the set [a,b][a,b] is nonempty and compact, so by [L6] there are q,p[a,b]q, p \in [a,b] with f(q)f(x)f(p)f(q) \le f(x) \le f(p) for every x[a,b]x \in [a,b]; put m:=f(q)m := f(q) and M:=f(p)M := f(p), so m=minf[I]m = \min f[I] and M=maxf[I]M = \max f[I] and mMm \le M.

L5L6choose
2.1

By [L2] the restriction of ff to [s,t][s,t] is continuous on [s,t][s,t], and ww lies between f(s)f(s) and f(t)f(t) in one order or the other, since {f(s),f(t)}={u,v}\{f(s), f(t)\} = \{u', v'\} and uwvu' \le w \le v'. By [L1] there is c[s,t]Ic \in [s,t] \subseteq I with f(c)=wf(c) = w, so wf[I]w \in f[I].

step 1.1L1L2
3.1

So f[I]f[I] is order-convex, and by [L4] it is connected. This is claim 1.

step 2.1L4
4.1

Claim 2, the two inclusions. Every zf[I]z \in f[I] satisfies mzMm \le z \le M by step 1.2, so f[I][m,M]f[I] \subseteq [m,M]. Conversely, mm and MM lie in f[I]f[I] and f[I]f[I] is order-convex by step 3.1, so every ww with mwMm \le w \le M lies in f[I]f[I]; hence [m,M]f[I][m,M] \subseteq f[I]. Therefore f[I]=[m,M]f[I] = [m,M], a closed bounded interval, and it is the single point {m}\{m\} exactly when m=Mm = M, that is exactly when ff is constant on [a,b][a,b].

step 3.1step 1.2L3

Remarks

Depends on

Used by

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