Alphabeta Math
False statementConstruction: AI-adaptedVerification: 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.

FALSE: every continuous real function is uniformly continuous on its domain

Statement

False claim: if ARA \subseteq \mathbb{R} and f:ARf : A \to \mathbb{R} is 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), then ff is uniformly continuous on AA (Uniform continuity of f:ARf : A \to \mathbb{R}: one δ\delta serving every pair of points of AA).

Why it is tempting. Continuity says that for every ε>0\varepsilon > 0 and every point cc there is a δ>0\delta > 0 that works at cc. It is easy to read that as producing "a δ\delta", forgetting that the δ\delta was produced after cc was fixed and may depend on it. Uniform continuity demands one δ\delta before any point is named, and the two quantifier orders are genuinely different.

What is true. On a compact domain the implication does hold, and that is Heine-Cantor in R\mathbb{R}: a continuous real function on a compact subset of R\mathbb{R} is uniformly continuous, proved R\mathbb{R}-natively from sequential compactness; the metric-space form is Heine-Cantor: a continuous map from a compact metric space to any metric space is uniformly continuous. Compactness is not a convenience there: for every noncompact bounded ERE \subseteq \mathbb{R} there is a continuous function on EE that is not uniformly continuous, 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 the smallest familiar instance of that theorem.

Facts & Assumptions

Given: The domain A:=(0,1)={xR:0<x<1}A := (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:ARf : A \to \mathbb{R}, f(x):=1/xf(x) := 1/x. Natural numbers are identified with their canonical images in R\mathbb{R}.

[L1]

Continuity on AA and uniform continuity on AA, in the forms of 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 Uniform continuity of f:ARf : A \to \mathbb{R}: one δ\delta serving every pair of points of AA; in particular, ff fails to be uniformly continuous on AA as soon as some real ε0>0\varepsilon_0 > 0 admits, for every real δ>0\delta > 0, a pair x,xAx, x' \in A with xx<δ|x - x'| < \delta and f(x)f(x)ε0|f(x) - f(x')| \ge \varepsilon_0.

[L2]

Algebra of continuous functions: the identity is continuous on AA, and if qq is continuous on AA and does not vanish there then 1/q1/q is continuous on AA (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).

[L3]

Archimedean property in reciprocal form: for every real η>0\eta > 0 there is a natural k1k \ge 1 with 1/k<η1/k < \eta; and 0<s<t0 < s < t implies 0<1/t<1/s0 < 1/t < 1/s (For every ε>0\varepsilon > 0 in a complete ordered field there is a natural n1n \ge 1 with 1/n<ε1/n < \varepsilon, Every complete ordered field is Archimedean, Inverses of positives are positive, and reciprocation reverses order).

[L4]

Ordered-field arithmetic in R\mathbb{R}: for a natural kk, 0<1/(k+3)<1/(k+2)<10 < 1/(k+3) < 1/(k+2) < 1, so both lie in (0,1)(0,1); the product (k+2)(k+3)k+22(k+2)(k+3) \ge k+2 \ge 2; and u0|u| \ge 0 with u=u|u| = u for u0u \ge 0 (Ordered field, Basic properties of the absolute value, Integer powers ama^m).

Refutation

technique · direct
1.1

ff is continuous on AA. The identity is continuous on AA by [L2] and does not vanish on AA, since x>0x > 0 for x(0,1)x \in (0,1); so f(x)=1/xf(x) = 1/x is continuous on AA by [L2].

L2L4
1.2

For kNk \in \mathbb{N} put xk:=1/(k+2)x_k := 1/(k+2) and yk:=1/(k+3)y_k := 1/(k+3). By [L4] both lie in (0,1)=A(0,1) = A, and f(xk)=k+2f(x_k) = k+2, f(yk)=k+3f(y_k) = k+3. Note that N\mathbb{N} contains 00, so the smallest pair is x0=1/2x_0 = 1/2 and y0=1/3y_0 = 1/3, and no index kk produces a point outside AA.

L4
2.1

The gap between the arguments is xkyk=1/(k+2)1/(k+3)=1/((k+2)(k+3))1/(k+2)|x_k - y_k| = 1/(k+2) - 1/(k+3) = 1/\bigl((k+2)(k+3)\bigr) \le 1/(k+2), using (k+2)(k+3)k+2>0(k+2)(k+3) \ge k+2 > 0 and [L3]. The gap between the values is f(xk)f(yk)=(k+2)(k+3)=1|f(x_k) - f(y_k)| = |(k+2) - (k+3)| = 1.

step 1.2L3L4
3.1

Take ε0:=1\varepsilon_0 := 1 and let a real δ>0\delta > 0 be given. By [L3] there is a natural m1m \ge 1 with 1/m<δ1/m < \delta; put k:=mk := m, so k+2>m>0k + 2 > m > 0 and hence 1/(k+2)<1/m<δ1/(k+2) < 1/m < \delta by [L3]. Then xkyk1/(k+2)<δ|x_k - y_k| \le 1/(k+2) < \delta while f(xk)f(yk)=1ε0|f(x_k) - f(y_k)| = 1 \ge \varepsilon_0.

step 2.1L3choose
4.1

So no δ>0\delta > 0 serves ε0=1\varepsilon_0 = 1: by [L1] the function ff is continuous on AA and not uniformly continuous on AA, and the claim is false.

step 1.1step 3.1L1

Remarks

Depends on

Used by

Dependency tree · next 3 levels

Direct dependencies and their dependencies through the next three levels: 112 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