Alphabeta Math
CounterexampleConstruction: AI-adaptedVerification: AI-generatedprecheck 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.

On a closed interval of Q there is a continuous unbounded function, a bounded one with no maximum, and one without the intermediate value property

Statement refuted

The notion of continuity used here is stated in full, and is not imported. Let F be an ordered field, D⊆F and φ:D→F. Say φ is continuous at c∈D when

for every ε>0 in F there is δ>0 in F with ∣φ(x)−φ(c)∣<ε whenever x∈D and ∣x−c∣<δ,

and continuous on D when it is continuous at every point of D. This is the ordinary ε-δ condition, read entirely inside F. Nothing below cites a definition of continuity from elsewhere in this library, because there is none yet.

Refuted claim: over every ordered field F, a function φ:[a,b]F→F that is continuous on the closed interval [a,b]F (Sequences, convergence, Cauchyness, monotonicity, boundedness and closed intervals in an arbitrary ordered field) is bounded there, attains a maximum there, and takes every value between φ(a) and φ(b). In other words, the extreme value theorem and the intermediate value theorem hold over an arbitrary ordered field.

The witness is F=Q and D=[0,2]Q, with three functions, one for each clause:

f(x)=1x2−2,g(x)=− (x2−2)2,h(x)=x2−2.

All three are continuous on D in the sense above. f is unbounded; g is bounded and has no maximum; h satisfies h(0)=−2<0<2=h(2) and never takes the value 0. What Q lacks is the least-upper-bound property (LUB) of The five completeness properties of an ordered field: least upper bound, monotone convergence, nested intervals, Bolzano-Weierstrass, and Cauchy completeness, and each of the three clauses fails because of that single omission.

Facts & Assumptions

Given: The ordered field Q; the set D:=[0,2]Q={x∈Q:0≤x≤2}; the functions f,g,h above; and the map T(x):=(2x+2)(x+2)−1.

[L2]

No rational squares to 2 (FALSE: some rational number squares to 2).

[L5]

Absolute value: ∣uv∣=∣u∣∣v∣, ∣u∣≥0, ∣u∣=u for u≥0, and ∣u∣<c exactly when −c<u<c (Basic properties of the absolute value); ∣u+v∣≤∣u∣+∣v∣ (The triangle inequality).

[L6]

Powers: a0=1, an+1=ana (Integer powers am); for 0≤a<b and n≥1, an<bn (Monotonicity of x↦xn and of n↦an); (1+x)n≥1+nx for x≥−1 (Bernoulli's inequality (1+x)n≥1+nx).

[L7]

Recursion theorem (The recursion theorem) and induction principle (The principle of mathematical induction).

[L8]

Order arithmetic: a positive element is invertible with positive inverse and reciprocation reverses the order (Inverses of positives are positive, and reciprocation reverses order); for c>0, a<b if and only if ac<bc (Sign rules for products and monotonicity of multiplication); adding a constant preserves the order and inequalities add (Order is preserved by adding a constant and by adding inequalities); canonical naturals are positive (Canonical naturals are positive and strictly increasing); the order is total and transitive (Ordered field).

Counterexample

technique · direct
1.1

For every x∈D one has x2≠2, so x2−2≠0 and ∣x2−2∣>0; and 0≤x≤2 gives 0≤x2≤4, so ∣x2−2∣≤2. Hence f, g and h are defined on all of D.

L2L5L6L8
1.2

Q is an ordered field that is not complete: a complete ordered field has a square root of 2, and no rational squares to 2.

L1L2L3L4
1.3

For x∈D one has x+2≥2>0, so T(x)=2−2(x+2)−1 is defined, and (x+2)−1 lies between (4)−1 and (2)−1, so 1≤T(x)≤3/2 and T(x)∈D; moreover T(x)2−2=2(x2−2)(x+2)−2 and (x+2)2≥4, so ∣T(x)2−2∣≤∣x2−2∣ (2)−1.

L5L6L8
1.4

For all x,c∈D: ∣x2−c2∣=∣x−c∣ ∣x+c∣≤4 ∣x−c∣, since 0≤x+c≤4.

L5L8
2.1

h is continuous on D: given ε>0 take δ:=ε (4)−1, and ∣x−c∣<δ gives ∣h(x)−h(c)∣=∣x2−c2∣≤4∣x−c∣<ε.

step 1.4L5L8
2.2

g is continuous on D: ∣g(x)−g(c)∣=∣x2−c2∣⋅∣(x2−2)+(c2−2)∣≤4∣x−c∣⋅4=16∣x−c∣, using step 1.1 for the second factor, so δ:=ε (16)−1 works.

step 1.1step 1.4L5L8
2.3

f is continuous on D: fix c∈D and put A:=∣c2−2∣>0; for x∈D with ∣x−c∣<A (8)−1 one gets ∣x2−c2∣<A (2)−1 and hence ∣x2−2∣≥A−∣x2−c2∣>A (2)−1, so ∣f(x)−f(c)∣=∣c2−x2∣(∣x2−2∣ ∣c2−2∣)−1<8∣x−c∣ A−2; taking δ to be the smaller of A(8)−1 and εA2(8)−1 gives ∣f(x)−f(c)∣<ε.

step 1.1step 1.4L5L8
2.4

By the recursion theorem applied to D, the element 1∈D and the map T, there is a sequence (xn) in D with x0=1 and xn+1=T(xn); and by induction ∣xn2−2∣≤(2n)−1, the base case being ∣1−2∣=1 and the step being step 1.3.

step 1.3L6L7
2.5

g is bounded on D, with −4≤g(x)≤0, and has no maximum: for every c∈D the point T(c) lies in D and satisfies ∣T(c)2−2∣≤∣c2−2∣(2)−1<∣c2−2∣, so (T(c)2−2)2<(c2−2)2 and g(T(c))>g(c).

step 1.1step 1.3L6L8
3.1

f is unbounded on D: ∣f(xn)∣=∣xn2−2∣−1≥2n, and given any M∈Q the Archimedean property supplies n with M<n⋅1, whence 2n≥1+n⋅1>M by Bernoulli.

step 2.4L1L6L8
3.2

h is continuous on D with h(0)=−2 and h(2)=2, so 0 lies strictly between h(0) and h(2), and yet h(x)=0 has no solution in D, since that would be a rational squaring to 2.

step 1.1step 2.1L2
4.1

Over the ordered field Q, on the closed interval D=[0,2]Q: f is continuous and unbounded, g is continuous and bounded with no maximum, and h is continuous and omits a value strictly between its values at the endpoints. All three clauses of the claim are therefore false, and the field involved is exactly one failing (LUB).

step 1.2step 2.2step 2.3step 2.5step 3.1step 3.2∎

Remarks

  • One mechanism, three failures. All three functions are built from x2−2, whose zero is missing from Q. The map T is a contraction towards that missing zero: it halves ∣x2−2∣ at every step while staying inside D. So ∣x2−2∣ has infimum 0 on D and does not attain it, and the three failures are three ways of reading that one sentence.

  • Nothing here is peculiar to Q. The same construction runs in any ordered subfield of R that omits 2, since every step above uses only the field operations, the order, and the absence of a square root of 2. This item exhibits the cheapest witness; no claim is made here about ordered fields in general.

  • This item does not use, and does not need, a general theory of continuous functions. The ε-δ condition is stated in the Statement refuted and every use of it above is a direct verification, so the item is self-contained and nothing here waits on a later page. That is deliberate and not a placeholder: the claim refuted here is a claim about an arbitrary ordered field, and it is refuted over Q, so a definition of continuity written for real functions on subsets of R would not apply to it. This library has no notion of continuity over a general ordered field and needs none elsewhere, and inventing an id for one would put an unused definition on a page about completeness properties. The condition above is the ordinary one read inside F, and it specialises to the real-variable definition at F=R.

  • What is true over Q. Continuity, sums and products of continuous functions, and composition all behave normally; what fails is every statement whose proof needs a supremum. That is the content of the page this one belongs to.

Depends on

Used by

Dependency tree · two levels

53 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