Alphabeta Math
False statementConstruction: AI-adaptedVerification: AI-generatedSession-authored (Fable 5 assisted)precheck passverified 2026-08-09 (gpt-5.6-terra-codex-subscription)
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: a continuous real function on a bounded domain attains a greatest value

Statement

False claim: if ERE \subseteq \mathbb{R} is nonempty and bounded (Lower bound, bounded below, bounded set) and f:ERf : E \to \mathbb{R} is continuous on EE (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), then ff attains a greatest value on EE: there is pEp \in E with f(x)f(p)f(x) \le f(p) for every xEx \in E (Maximum and minimum of a set).

Why it is tempting. The extreme value theorem is often remembered as "a continuous function on a bounded interval attains its bounds", and on [a,b][a,b] that is true. The hypothesis that actually does the work is compactness, which for a subset of R\mathbb{R} is closed and bounded (A subset of R\mathbb{R} is compact if and only if it is closed and bounded); dropping closedness loses the theorem even though the function may stay bounded.

What is true. Extreme value theorem: a continuous real function on a nonempty compact subset of R\mathbb{R} attains a greatest and a least value gives the conclusion on a nonempty compact domain, and the hypothesis cannot be weakened: for every noncompact EE there is a bounded continuous function on EE whose supremum is not attained, which is Rudin 4.20, the sharp converse: on a noncompact ERE \subseteq \mathbb{R} there is an unbounded continuous function and a bounded continuous function with no greatest value, and if EE is bounded there is a continuous function on EE that is not uniformly continuous. The witness below is that theorem's simplest instance.

Facts & Assumptions

Given: The domain E:=(0,1)={xR:0<x<1}E := (0,1) = \{\, x \in \mathbb{R} : 0 < x < 1 \,\} (Intervals of R\mathbb{R}: the nine order-convex forms, nondegeneracy, and length) and the function f:ERf : E \to \mathbb{R}, f(x):=xf(x) := x.

[L1]

EE is nonempty and bounded: 1/2E1/2 \in E, and 0x10 \le x \le 1 for every xEx \in E (Lower bound, bounded below, bounded set, Intervals of R\mathbb{R}: the nine order-convex forms, nondegeneracy, and length, Ordered field).

[L3]

A greatest value of ff on EE is a point pEp \in E with f(x)f(p)f(x) \le f(p) for every xEx \in E; equivalently a maximum of f[E]f[E] lying in f[E]f[E] (Maximum and minimum of a set).

[L4]

Ordered-field arithmetic in R\mathbb{R}: for 0<x<10 < x < 1 one has x<(x+1)/2<1x < (x+1)/2 < 1; and 0<10 < 1 (Ordered field).

[L5]

Suprema: a nonempty set bounded above has a least upper bound, and for u=supSu = \sup S every real ε>0\varepsilon > 0 admits sSs \in S with uε<su - \varepsilon < s (Complete ordered field (least-upper-bound property), Epsilon characterisation of the supremum).

Refutation

technique · direct
1.1

EE is nonempty and bounded by [L1], and ff is continuous on EE by [L2], so the hypotheses of the claim are satisfied.

L1L2
2.1

Let pEp \in E be arbitrary, so 0<p<10 < p < 1. Put p:=(p+1)/2p' := (p+1)/2; by [L4] we have p<p<1p < p' < 1 and 0<p0 < p', so pEp' \in E and f(p)=p>p=f(p)f(p') = p' > p = f(p). Hence no pEp \in E satisfies f(x)f(p)f(x) \le f(p) for every xEx \in E, and by [L3] the function ff attains no greatest value on EE.

step 1.1L3L4
3.1

The claim is therefore false. Note also what the failure is not: f[E]=Ef[E] = E is nonempty and bounded above by 11, so supf[E]\sup f[E] exists by [L5] and equals 11, since 11 bounds f[E]f[E] and for every real ε>0\varepsilon > 0 the point x:=max{1/2, 1ε/2}x := \max\{1/2,\ 1 - \varepsilon/2\} lies in EE with x>1εx > 1 - \varepsilon. What fails is only that 1f[E]1 \notin f[E].

step 2.1L1L4L5

Remarks

Depends on

Used by

Dependency tree · next 3 levels

Direct dependencies and their dependencies through the next three levels: 92 results over 18 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