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 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 be an ordered field, and . Say is continuous at when
and continuous on when it is continuous at every point of . This is the ordinary - condition, read entirely inside . Nothing below cites a definition of continuity from elsewhere in this library, because there is none yet.
Refuted claim: over every ordered field , a function that is continuous on the closed interval (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 and . In other words, the extreme value theorem and the intermediate value theorem hold over an arbitrary ordered field.
The witness is and , with three functions, one for each clause:
All three are continuous on in the sense above. is unbounded; is bounded and has no maximum; satisfies and never takes the value . What 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 ; the set ; the functions above; and the map .
is an ordered field (The rationals form a totally ordered field, The rationals as equivalence classes of pairs of integers, Field, Ordered field) and is Archimedean (The rationals are Archimedean).
No rational squares to (FALSE: some rational number squares to 2).
In a complete ordered field every element has a square root (Square roots exist: a unique with ; the positives are , Complete ordered field (least-upper-bound property)).
Closed intervals of an ordered field (Sequences, convergence, Cauchyness, monotonicity, boundedness and closed intervals in an arbitrary ordered field); the properties (LUB) and the rest (The five completeness properties of an ordered field: least upper bound, monotone convergence, nested intervals, Bolzano-Weierstrass, and Cauchy completeness).
Absolute value: , , for , and exactly when (Basic properties of the absolute value); (The triangle inequality).
Powers: , (Integer powers ); for and , (Monotonicity of and of ); for (Bernoulli's inequality ).
Recursion theorem (The recursion theorem) and induction principle (The principle of mathematical induction).
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 , if and only if (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
For every one has , so and ; and gives , so . Hence , and are defined on all of .
is an ordered field that is not complete: a complete ordered field has a square root of , and no rational squares to .
For one has , so is defined, and lies between and , so and ; moreover and , so .
For all : , since .
is continuous on : given take , and gives .
is continuous on : , using step 1.1 for the second factor, so works.
is continuous on : fix and put ; for with one gets and hence , so ; taking to be the smaller of and gives .
By the recursion theorem applied to , the element and the map , there is a sequence in with and ; and by induction , the base case being and the step being step 1.3.
is bounded on , with , and has no maximum: for every the point lies in and satisfies , so and .
is unbounded on : , and given any the Archimedean property supplies with , whence by Bernoulli.
is continuous on with and , so lies strictly between and , and yet has no solution in , since that would be a rational squaring to .
Over the ordered field , on the closed interval : is continuous and unbounded, is continuous and bounded with no maximum, and 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).
Remarks
-
One mechanism, three failures. All three functions are built from , whose zero is missing from . The map is a contraction towards that missing zero: it halves at every step while staying inside . So has infimum on and does not attain it, and the three failures are three ways of reading that one sentence.
-
Nothing here is peculiar to . The same construction runs in any ordered subfield of that omits , since every step above uses only the field operations, the order, and the absence of a square root of . 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 , so a definition of continuity written for real functions on subsets of 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 , and it specialises to the real-variable definition at .
-
What is true over . 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
- Sequences, convergence, Cauchyness, monotonicity, boundedness and closed intervals in an arbitrary ordered field
- The five completeness properties of an ordered field: least upper bound, monotone convergence, nested intervals, Bolzano-Weierstrass, and Cauchy completeness
- The rationals as equivalence classes of pairs of integers
- The rationals form a totally ordered field
- The rationals are Archimedean
- Square roots exist: a unique $\sqrt{a} \ge 0$ with $(\sqrt{a})^2 = a$; the positives are $\{x^2 : x \neq 0\}$
- FALSE: some rational number squares to 2
- Integer powers $a^m$
- Monotonicity of $x \mapsto x^n$ and of $n \mapsto a^n$
- Bernoulli's inequality $(1+x)^n \ge 1 + nx$
- The recursion theorem
- The principle of mathematical induction
- Basic properties of the absolute value
- The triangle inequality
- Inverses of positives are positive, and reciprocation reverses order
- Sign rules for products and monotonicity of multiplication
- Order is preserved by adding a constant and by adding inequalities
- Canonical naturals are positive and strictly increasing
- Ordered field
- Complete ordered field (least-upper-bound property)
- Field
Used by
Dependency tree · next 3 levels
Direct dependencies and their dependencies through the next three levels: 89 results over 26 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
- Extreme value theorem (Wikipedia) (standard reference, not scraped)
- Intermediate value theorem (Wikipedia) (standard reference, not scraped)
- J. Lebl, Basic Analysis I, §3.3 (standard reference, not scraped)