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.
Continuity, IVT, EVT, and Uniform Continuity: Examples and Counterexamples
1 · Prerequisites
- Compactness in Metric Spaces
- Completeness, Completion, and Uniform Continuity
- Construction of the Natural Numbers
- Construction of the Real Numbers via Cauchy Sequences
- Construction of the Real Numbers via Dedekind Cuts
- Continuity, IVT, EVT, and Uniform Continuity
- Countability and Uncountability
- Foundations of the Real Numbers for Analysis
- Limits of Real Functions
- Metric Spaces
- Monotone Sequences, Bolzano-Weierstrass, and Cauchy Completeness
- Order, Zorn's Lemma, and the Axiom of Choice
- Relations, Functions, and Quotients
- Roots, Rational Powers, and Classical Inequalities
- Sequences and Limits
- Suprema and Infima
- The ZFC Axioms and the Basic Set Constructions
- Topology of ℝ
2 · Summary
3 · Logical flowchart
4 · Definitions, theorems and proofs
None yet.
5 · Examples, counterexamples and false statements
The distance from a real number to the integers is -Lipschitz, hence uniformly continuous, takes values in , and vanishes exactly on
Example
Take with its usual metric (The absolute value makes a metric space: is a metric, its open balls are the intervals , and it is unbounded), identify with its canonical copy inside (The integers as equivalence classes of pairs of naturals, The naturals embed in the integers, The integers embed in the rationals, The rationals embed densely in the reals), and let
be the distance from to the nonempty set (Bounded subset, diameter, distance from a point to a set, and distance between two sets in a metric space). Then:
- is -Lipschitz on : for all real . Consequently is uniformly continuous on (Uniform continuity of : one serving every pair of points of ) and continuous on (Continuity of at a point of and on : the - condition, its agreement with at a limit point, and continuity at an isolated point).
- The infimum is attained, and computed. Writing for the integer part of (Integer part: for every real there is exactly one integer with ) and , so that , so for or .
- Range. for every real (Intervals of : the nine order-convex forms, nondegeneracy, and length).
- Zero set. if and only if .
Why this example is here. It is the standard uniformly continuous function of this track that is not defined by a formula in the field operations, and it is obtained from the metric machinery rather than rebuilt: claim 1 is , so the distance to a fixed nonempty set is -Lipschitz applied to in the metric space , transported to a statement about a real function by Dictionary: for with the metric , continuity and uniform continuity of agree with the metric-space notions, the Lipschitz and Hölder conditions are the metric ones instantiated, and a subset of is compact in the open-cover sense of exactly when it is a compact metric subspace, clause 3. Only claims 2 to 4, which compute the value, need an argument of their own.
The same function is computed elsewhere, and nothing here depends on that. The trigonometry-free oscillator is well defined and attained at a nearest integer, takes values in , vanishes exactly on , equals at half-integers, and is -periodic introduces on the companion page of The - limit of at a limit point of and proves the same computation together with -periodicity and the value at half-integers. That item lives on an examples page, which is a leaf of the dependency graph, so no item may rest on it; the verification below is therefore self-contained, and the duplication is deliberate rather than an oversight.
Facts & Assumptions
Given: with the metric ; the canonical copy of inside ; a real , the integer and the real ; and .
Distance to a nonempty set: for nonempty in a metric space, , the infimum existing because the set of distances is nonempty and bounded below by (Bounded subset, diameter, distance from a point to a set, and distance between two sets in a metric space, Greatest lower bound (infimum), Metric space: iff , symmetry, and the triangle inequality; pseudometric and ultrametric).
: the distance to a fixed nonempty set is -Lipschitz as a map of metric spaces (, so the distance to a fixed nonempty set is -Lipschitz).
Dictionary: for with , a map is Lipschitz with constant as a map of metric spaces exactly when for all ; and a Lipschitz real function is uniformly continuous, hence continuous (Dictionary: for with the metric , continuity and uniform continuity of agree with the metric-space notions, the Lipschitz and Hölder conditions are the metric ones instantiated, and a subset of is compact in the open-cover sense of exactly when it is a compact metric subspace, clauses 1, 3 and 6, Contraction implies Lipschitz implies uniformly continuous implies continuous; every Hölder map is uniformly continuous, and a Lipschitz map on a bounded space is Hölder for every exponent, Lipschitz map, -Hölder map for rational , and contraction, Uniform continuity of : one serving every pair of points of , Continuity of at a point of and on : the - condition, its agreement with at a limit point, and continuity at an isolated point).
with is a metric space (The absolute value makes a metric space: is a metric, its open balls are the intervals , and it is unbounded), and sits inside as a totally ordered subring containing and and closed under , with no integer strictly between and (The integers as equivalence classes of pairs of naturals, The naturals embed in the integers, The integers embed in the rationals, The rationals embed densely in the reals).
Integer part: for every real there is exactly one integer with (Integer part: for every real there is exactly one integer with ).
Infimum and minimum: a lower bound of a set that belongs to the set is its infimum and its minimum (Greatest lower bound (infimum), Maximum and minimum of a set); and the minimum of a two-element set of reals exists and is one of the two (Every nonempty finite set of reals has a maximum and a minimum).
Absolute value and order: ; exactly when ; for and for ; the order is total; and (Basic properties of the absolute value, Ordered field, Intervals of : the nine order-convex forms, nondegeneracy, and length).
Verification
is a nonempty subset of the metric space , since , so is defined for every real by [L1], and .
By [L5] the integer satisfies , so satisfies , and satisfies .
Claim 1. By [L2], for all real ; by [L3] this says exactly that is Lipschitz with constant as a real function on , hence uniformly continuous on and continuous on .
Every distance from to an integer is at least . Let . By [L4] and totality either or , and in the second case . If then , so . If then , so . Either way .
Both candidate values occur. Since we have , and since we have , with and in .
Claim 2. By steps 2.2 and 2.3 the real is a lower bound of belonging to that set, so by [L6] it is the infimum and the minimum: , attained at or .
Claim 3. since and . And : if then , while if then and . So .
Claim 4. If then by step 3.1; since this forces , that is . Conversely if then is a member of the set of distances and is a lower bound of it by step 1.1, so by [L6].
Claims 1 to 4 are verified: is -Lipschitz and therefore uniformly continuous and continuous on , its value at is and is attained at a nearest integer, its values lie in , and it vanishes exactly on .
Remarks
-
No completeness of is spent on the infimum here. Bounded subset, diameter, distance from a point to a set, and distance between two sets in a metric space produces from the greatest-lower-bound property, but step 3.1 does not need that route: it exhibits an element of the set of distances that is also a lower bound, which is the definition of the infimum read directly (Greatest lower bound (infimum)). Completeness does enter once, through Integer part: for every real there is exactly one integer with , whose existence half is the Archimedean property.
-
Why "nearest integer" is a theorem and not a phrase. The words presuppose that a nearest integer exists, and that is exactly what steps 2.2 and 2.3 establish. When there are two nearest integers, and , and the formula is indifferent to which is taken, so nothing is selected.
-
What this contributes to the hierarchy. is Lipschitz, hence uniformly continuous (Dictionary: for with the metric , continuity and uniform continuity of agree with the metric-space notions, the Lipschitz and Hölder conditions are the metric ones instantiated, and a subset of is compact in the open-cover sense of exactly when it is a compact metric subspace, clause 6), and it is bounded and not monotone; so it is a uniformly continuous function that is neither a polynomial nor eventually constant, and it is the natural domain-wide example to set beside is continuous on and not uniformly continuous there, the pairs and defeating every , where uniform continuity fails.
The indicator of is continuous at no point of
Statement refuted
Refuted claim: every function is continuous at at least one point (Continuity of at a point of and on : the - condition, its agreement with at a limit point, and continuity at an isolated point).
The witness is the Dirichlet function, the indicator of the rationals: writing for the canonical copy of the rationals inside (The rationals embed densely in the reals),
It is continuous at no point of . The mechanism is that both and its complement are dense (Both and are dense in , and every nonempty open subset of is uncountable), so every neighbourhood of every real contains a point of each, and the two values differ by .
The argument is choice free. Density is used in the form "every neighbourhood of every point meets the set", which is The closure equals the set together with its limit points, equals the set of points every neighbourhood of which meets it, and is the smallest closed superset; a set is closed iff it contains its limit points applied to a closure equal to ; no sequence is built, so neither A point lies in the closure of iff some sequence in converges to it, so a subset of is closed iff it is sequentially closed nor is continuous at if and only if for every sequence in converging to , the converse direction costing countable choice is invoked, and the countable choice those two spend is not spent here.
Facts & Assumptions
Given: The canonical copy of the rationals, its complement , and the function taking the value on and on .
Continuity at : for every real there is a real with for every real with . So continuity at fails as soon as some real admits, for every real , a real with and (Continuity of at a point of and on : the - condition, its agreement with at a limit point, and continuity at an isolated point, The -neighbourhood and the punctured -neighbourhood of a point of ).
Both and are dense in , that is, each has closure (Both and are dense in , and every nonempty open subset of is uncountable, Limit point, isolated point, adherent point, derived set, and dense subset of , The rationals embed densely in the reals).
A point lies in the closure of exactly when every neighbourhood of it meets ; so a set with closure meets every , for every real and every real (The closure equals the set together with its limit points, equals the set of points every neighbourhood of which meets it, and is the smallest closed superset; a set is closed iff it contains its limit points, Interior, closure, boundary and exterior of a subset of , Open subset of (every point has a neighbourhood inside it), closed subset (complement open), and clopen, The -neighbourhood and the punctured -neighbourhood of a point of ).
is a well-defined function: is by definition the complement , so every real either lies in or does not, exclusively; and , with and (Basic properties of the absolute value, Ordered field).
Counterexample
is a well-defined function on taking only the values and , and is the disjoint union of and .
Let be arbitrary, put , and let a real be given.
By [L2] and [L3] the neighbourhood meets and it meets : there are reals and , so and , with and .
If then and the point satisfies and . If then and the point satisfies and . By [L4] these two possibilities are exhaustive and exclusive.
So for the fixed no real serves at , and by [L1] the function is not continuous at . As was an arbitrary real, it is continuous at no point of , and the refuted claim is false.
Remarks
-
Why and not . Any works, since the discrepancy produced is exactly . Taking leaves the inequality strict and makes it visible that the failure is not a boundary effect.
-
Restricting the domain repairs it completely. The restriction of to is constantly and the restriction to the irrationals is constantly ; both are continuous. This is the standard warning that continuity is a property of the pair (function, domain), recorded in Continuity of at a point of and on : the - condition, its agreement with at a limit point, and continuity at an isolated point: continuity passes to subsets of the domain, never up from them.
-
A near miss worth naming. Multiplying by repairs continuity at exactly one point: is continuous at and nowhere else, which is is continuous at and at no other point. The same argument as above, applied to any function taking two distinct values densely, shows nowhere-continuity; in particular the function equal to on and elsewhere is nowhere continuous while its absolute value is constant.
is continuous at and at no other point
Example
Let be the indicator of the rationals (The indicator of is continuous at no point of ) and put
so for rational and for irrational . Then:
- is continuous at (Continuity of at a point of and on : the - condition, its agreement with at a limit point, and continuity at an isolated point);
- is not continuous at any .
So the set of points of continuity of a real function can be a single point. Together with The indicator of is continuous at no point of , where that set is empty, this shows how little the set of continuity points is constrained by the mere existence of the function.
The point of the example. Continuity at compares with , and the two branches of agree only where . Multiplying the indicator by damps the jump: near both branches are small, so the discrepancy is at most ; away from the discrepancy is at least on every neighbourhood, because each branch is realised arbitrarily close to .
Facts & Assumptions
Given: The canonical copy of the rationals with complement , and with for and for .
Continuity at , in the form of Continuity of at a point of and on : the - condition, its agreement with at a limit point, and continuity at an isolated point: for every real there is a real with whenever ; and it fails at as soon as some real admits, for every real , a real with and (The -neighbourhood and the punctured -neighbourhood of a point of ).
Both and are dense in , so every meets each of them (Both and are dense in , and every nonempty open subset of is uncountable, The closure equals the set together with its limit points, equals the set of points every neighbourhood of which meets it, and is the smallest closed superset; a set is closed iff it contains its limit points).
is by definition the complement , so every real lies in exactly one of and ; hence is a well-defined function, and for every real (Basic properties of the absolute value, The indicator of is continuous at no point of ).
Absolute value and order: and exactly when (Basic properties of the absolute value); the reverse triangle inequality , hence (The reverse triangle inequality); and the minimum of a two-element set of reals exists and is one of the two (Every nonempty finite set of reals has a maximum and a minimum, Maximum and minimum of a set, Ordered field).
Verification
is well defined and satisfies for every real : on one has and on one has . Also , so .
Claim 2, the setup. Let be real, put by [L4], and let a real be given. Put by [L4].
Claim 1. Let a real be given and take . Every real with satisfies by step 1.1. So is continuous at .
By [L2] the neighbourhood meets and meets : fix and , so and , with and .
The rational case. Suppose , so . Take : then and .
The irrational case. Suppose , so . Take : then , and by [L4] and step 2.2, so .
By [L3] the two cases of steps 3.1 and 3.2 are exhaustive, so for every real some with has ; by [L1] the function is not continuous at . Since was arbitrary, claim 2 holds, and with step 2.1 the set of points of continuity of is exactly .
Remarks
-
Where the damping factor does its work. The estimate of step 1.1 is the whole of claim 1, and it is available only because the two branches of agree at . Replacing by any function vanishing at and continuous there gives the same conclusion at ; replacing it by a nonzero constant gives The indicator of is continuous at no point of back.
-
The choice of is what makes the irrational case work. Without shrinking to the rational point near could be close to , and then would be small; the shrinking keeps away from by at least .
-
This example is choice free, for the same reason as The indicator of is continuous at no point of : density is used only in the form "every neighbourhood meets the set", never to build a sequence.
is continuous on and not uniformly continuous there, the pairs and defeating every
Statement refuted
Refuted claim: the function , , is uniformly continuous on (Uniform continuity of : one serving every pair of points of , Intervals of : the nine order-convex forms, nondegeneracy, and length).
is continuous on (Continuity of at a point of and on : the - condition, its agreement with at a limit point, and continuity at an isolated point) and its domain is bounded, so this is the sharpest simple instance of FALSE: every continuous real function is uniformly continuous on its domain: neither continuity nor boundedness of the domain implies uniform continuity, and what Heine-Cantor in : a continuous real function on a compact subset of is uniformly continuous, proved -natively from sequential compactness actually needs is compactness, which does not have because it is not closed (A subset of is compact if and only if it is closed and bounded).
The refutation exhibits, for every , a pair of points of closer than whose -values differ by exactly . The pairs are
and the shift by and is not cosmetic: contains here (Sequences of reals: bounded, eventually, frequently, tails, subsequences is -indexed), so is undefined at and leaves at .
Facts & Assumptions
Given: The interval and the function , . Naturals are identified with their canonical images in .
Uniform continuity on fails as soon as some real admits, for every real , a pair with and (Uniform continuity of : one serving every pair of points of , Ordered field).
Algebra of continuous functions: the identity is continuous on , and the reciprocal of a continuous nowhere-vanishing function is continuous (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, Continuity of at a point of and on : the - condition, its agreement with at a limit point, and continuity at an isolated point).
Archimedean property in reciprocal form: for every real there is a natural with ; and implies (For every in a complete ordered field there is a natural with , Every complete ordered field is Archimedean, Inverses of positives are positive, and reciprocation reverses order).
Ordered-field arithmetic: for one has , so and both lie in ; and (Ordered field, Intervals of : the nine order-convex forms, nondegeneracy, and length, Basic properties of the absolute value).
is bounded but not closed, hence not compact, so Heine-Cantor in : a continuous real function on a compact subset of is uniformly continuous, proved -natively from sequential compactness does not apply to it (Lower bound, bounded below, bounded set, Open subset of (every point has a neighbourhood inside it), closed subset (complement open), and clopen, A subset of is compact if and only if it is closed and bounded, Open cover, subcover, compact subset of (every open cover has a finite subcover), and sequentially compact subset).
Counterexample
is continuous on : the identity is continuous there by [L2] and satisfies for every , so its reciprocal is continuous on by [L2].
For put and . By [L4] both lie in , and , . At the first index, , this reads and , both in .
The separation of the arguments is , using and [L3]; the separation of the values is .
Put and let a real be given. By [L3] fix a natural with , and take . Then , so by [L3], and step 2.1 gives while .
So no real serves , and by [L1] the function is not uniformly continuous on , although by step 1.1 it is continuous there: the refuted claim is false.
Remarks
-
What this witnesses in the regularity hierarchy. Contraction implies Lipschitz implies uniformly continuous implies continuous; every Hölder map is uniformly continuous, and a Lipschitz map on a bounded space is Hölder for every exponent, transported to real functions by Dictionary: for with the metric , continuity and uniform continuity of agree with the metric-space notions, the Lipschitz and Hölder conditions are the metric ones instantiated, and a subset of is compact in the open-cover sense of exactly when it is a compact metric subspace, gives uniformly continuous continuous and asserts no converse. This item is the witness that the converse fails, and it is one of the two named in the remarks of Dictionary: for with the metric , continuity and uniform continuity of agree with the metric-space notions, the Lipschitz and Hölder conditions are the metric ones instantiated, and a subset of is compact in the open-cover sense of exactly when it is a compact metric subspace; the other, On the function is -Hölder and is -Hölder for no rational , so the Hölder classes are strictly nested, separates the Hölder classes below it.
-
The failure is at the missing endpoint, and it is repaired by restoring it. On with the same formula is uniformly continuous, by Heine-Cantor in : a continuous real function on a compact subset of is uniformly continuous, proved -natively from sequential compactness, since is closed and bounded. It is also repaired by an explicit estimate: on one has , so is even Lipschitz there.
-
A second reading of the same fact. By A uniformly continuous real function on a subset extends uniquely to a uniformly continuous function on the closure of , a uniformly continuous function on would extend continuously to and hence be bounded there (A continuous real function on a compact subset of is bounded); is unbounded on , so it cannot be uniformly continuous. That route is shorter but rests on more, and the computation above is the elementary one.
is continuous on and not uniformly continuous, the pairs and defeating every
Statement refuted
Refuted claim: the function , (Integer powers ), is uniformly continuous on (Uniform continuity of : one serving every pair of points of ).
is continuous on (Continuity of at a point of and on : the - condition, its agreement with at a limit point, and continuity at an isolated point) and is a closed subset of itself, so this is the complement of is continuous on and not uniformly continuous there, the pairs and defeating every : there the domain was bounded and not closed, here it is closed and not bounded, and uniform continuity fails in both cases. Neither half of compactness suffices on its own, and Heine-Cantor in : a continuous real function on a compact subset of is uniformly continuous, proved -natively from sequential compactness needs both (A subset of is compact if and only if it is closed and bounded).
The refutation exhibits, for every , a pair of reals closer than whose squares differ by more than . The pairs are
and the shift by is not cosmetic: contains here (Sequences of reals: bounded, eventually, frequently, tails, subsequences is -indexed), so the reciprocal would be undefined at the first index.
Facts & Assumptions
Given: The function , . Naturals are identified with their canonical images in .
Uniform continuity on fails as soon as some real admits, for every real , a pair with and (Uniform continuity of : one serving every pair of points of , Ordered field).
Polynomial functions are continuous on ; in particular so is (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, Continuity of at a point of and on : the - condition, its agreement with at a limit point, and continuity at an isolated point, Integer powers ).
Archimedean property in reciprocal form: for every real there is a natural with ; and implies (For every in a complete ordered field there is a natural with , Every complete ordered field is Archimedean, Inverses of positives are positive, and reciprocation reverses order).
Ordered-field arithmetic: for one has , so is defined and positive; the identity ; and with for (Ordered field, Basic properties of the absolute value, Integer powers ).
is closed in itself but not bounded, hence not compact, so Heine-Cantor in : a continuous real function on a compact subset of is uniformly continuous, proved -natively from sequential compactness does not apply to it (Open subset of (every point has a neighbourhood inside it), closed subset (complement open), and clopen, Lower bound, bounded below, bounded set, A subset of is compact if and only if it is closed and bounded, Open cover, subcover, compact subset of (every open cover has a finite subcover), and sequentially compact subset).
Counterexample
is continuous on , being a polynomial function.
For put and , both defined because by [L4]. At the first index, , this reads and .
The separation of the arguments is . The separation of the values is, by [L4],
Put and let a real be given. By [L3] fix a natural with and take ; then , so by [L3], while step 2.1 gives .
So no real serves , and by [L1] the function is not uniformly continuous on , although by step 1.1 it is continuous there: the refuted claim is false.
Remarks
-
The mechanism is the growing slope, not a singularity. The increment is chosen to be the reciprocal of the point, so the product stays above however small the increment becomes. Nothing blows up: is a polynomial, bounded on every bounded set, and the failure is entirely about how far out one is allowed to look.
-
On every bounded interval it is uniformly continuous. On one has , so is Lipschitz there, hence uniformly continuous (Dictionary: for with the metric , continuity and uniform continuity of agree with the metric-space notions, the Lipschitz and Hölder conditions are the metric ones instantiated, and a subset of is compact in the open-cover sense of exactly when it is a compact metric subspace, clause 6). That is also what Heine-Cantor in : a continuous real function on a compact subset of is uniformly continuous, proved -natively from sequential compactness gives, since is compact.
-
The consequence for products. The identity is uniformly continuous on and its square is not, so the product of two uniformly continuous functions need not be uniformly continuous; that is The identity is uniformly continuous on and its square is not, so uniform continuity is not preserved by products, which is this item read once more.
On the function is -Hölder and is -Hölder for no rational , so the Hölder classes are strictly nested
Example
Let with (Order on the rationals) and let
be the rational power of a nonnegative base (Rational powers of a positive base, with the convention ), on the closed bounded interval (Intervals of : the nine order-convex forms, nondegeneracy, and length). Hölder conditions for a real function on are the metric ones instantiated, by Dictionary: for with the metric , continuity and uniform continuity of agree with the metric-space notions, the Lipschitz and Hölder conditions are the metric ones instantiated, and a subset of is compact in the open-cover sense of exactly when it is a compact metric subspace, clause 4: is -Hölder with constant when for all (Lipschitz map, -Hölder map for rational , and contraction). Then:
- is -Hölder with constant :
- is -Hölder for no rational with : for such an there is no real with throughout .
- The classes are nested: if are rational and is -Hölder with constant , then is -Hölder with the same constant .
- Hence the nesting is strict, at every pair of rational exponents : the -Hölder functions on form a proper subclass of the -Hölder ones, lying in the second and not the first. Taking : for rational the function is uniformly continuous on (Uniform continuity of : one serving every pair of points of ) and is not Lipschitz.
What this witnesses. Contraction implies Lipschitz implies uniformly continuous implies continuous; every Hölder map is uniformly continuous, and a Lipschitz map on a bounded space is Hölder for every exponent asserts Lipschitz uniformly continuous continuous and -Hölder uniformly continuous, and claims no converse; it says so explicitly. This item supplies the missing witnesses on the real line, and it is one of the two named in the remarks of Dictionary: for with the metric , continuity and uniform continuity of agree with the metric-space notions, the Lipschitz and Hölder conditions are the metric ones instantiated, and a subset of is compact in the open-cover sense of exactly when it is a compact metric subspace. The other is is continuous on and not uniformly continuous there, the pairs and defeating every , which separates continuity from uniform continuity.
Why the exponents are rational. Rational powers of a positive base is the exponent theory available at this page's position in the reading order, so the example is stated for rational exponents. The later Real powers for positive bases, with the zero-base positive-exponent convention ↗ supplies real exponents; the restriction here belongs to the local toolkit, not to the Hölder notion. Exponents above are excluded there for a reason of substance: they force constancy (If on an interval for some rational then is constant).
Facts & Assumptions
Given: A rational with , the interval , and . Naturals are identified with their canonical images in .
Rational powers: is defined for and , with and agreeing with the integer power; for rational ; and (Rational powers of a positive base, Existence and uniqueness of -th roots: a unique with , Integer powers , Monotonicity of and of ).
Laws of rational exponents for and : ; ; ; ; . The product law persists for when (Laws of rational exponents).
Monotonicity: for and rationals one has ; for and one has ; for all powers are ; and for rational and one has (Monotonicity of and of ).
Hölder conditions for real functions on are for all , and an -Hölder real function with rational is uniformly continuous, hence continuous; "Lipschitz" is the case (Dictionary: for with the metric , continuity and uniform continuity of agree with the metric-space notions, the Lipschitz and Hölder conditions are the metric ones instantiated, and a subset of is compact in the open-cover sense of exactly when it is a compact metric subspace, Lipschitz map, -Hölder map for rational , and contraction, Contraction implies Lipschitz implies uniformly continuous implies continuous; every Hölder map is uniformly continuous, and a Lipschitz map on a bounded space is Hölder for every exponent, Uniform continuity of : one serving every pair of points of , Continuity of at a point of and on : the - condition, its agreement with at a limit point, and continuity at an isolated point).
Archimedean property: for every real there is a natural with , and for every real a natural with ; and implies (For every in a complete ordered field there is a natural with , Every complete ordered field is Archimedean, Inverses of positives are positive, and reciprocation reverses order).
Absolute value and order in : ; for ; the order is total, so two points of may be named so that one is the other; and (Basic properties of the absolute value, Ordered field, Intervals of : the nine order-convex forms, nondegeneracy, and length).
Verification
For one has . If then by [L1]; if then by [L1]. If then, when , [L3] with gives , and when it is an equality.
Claim 3. Let be rational and let satisfy on . For put , so by [L6]. If then by [L1]; if then both are by [L1]; and if then [L3] with gives . In every case , so and is -Hölder with the same constant.
Claim 2, the setup. Let with and suppose, for contradiction, that some real satisfies for all . Taking and gives by [L1], so . Taking and an arbitrary with gives .
Subadditivity: for all reals . If then and both sides are by [L1]. Otherwise put , and , so and , whence and . By step 1.1, and , so . By the product law of [L2], valid for nonnegative bases since , and ; hence , using from [L2].
Claim 2, the estimate. Put , a rational with . For , dividing the inequality of step 1.3 by and using [L2] gives , that is and hence by [L5]. Applying this at for a natural , and using from [L2], gives for every natural .
Claim 1. Let ; by [L6] name them so that . Put and , so . By step 2.1, , that is . Also : for this reads by [L1] and [L2], and for it is [L3] with the exponent , together with equality when . Hence , so is -Hölder with constant .
Claim 2, the contradiction. By [L5] fix a natural with , and then a natural with ; since we have , and since we have and so . By [L3] with the exponent applied to the bases , and by from [L1] and [L2], we get ; and by [L3] with the base and the exponents we get . That contradicts step 2.2, so no such exists and claim 2 holds.
Claim 4. Let be rational. Every -Hölder function on is -Hölder by step 1.2, and is -Hölder by step 3.1 and not -Hölder by step 3.2; so the inclusion of classes is proper. With and : is -Hölder, hence uniformly continuous on by [L4], and it is not -Hölder, that is not Lipschitz.
Remarks
-
The witness is as concrete as it can be here. For the function is , and the failure of the Lipschitz condition is the familiar one: exceeds for every once . Step 2.2 is that computation written for a general rational exponent.
-
Subadditivity is the whole of claim 1, and it is proved by normalising to and using on . No derivative and no convexity argument is used; neither is available at this point in the reading order.
-
What happens at the two ends of the range. At the function is the identity, Lipschitz and not -Hölder for any rational — indeed no nonconstant function is, by If on an interval for some rational then is constant, which is why Lipschitz map, -Hölder map for rational , and contraction stops at . As decreases the class grows, and claim 4 says it grows strictly at every rational step.
The identity is uniformly continuous on and its square is not, so uniform continuity is not preserved by products
Statement refuted
Refuted claim: if are uniformly continuous on (Uniform continuity of : one serving every pair of points of ) then so is their pointwise product .
The witness is the simplest possible one: and , the identity. The identity is uniformly continuous on — one may take — and its product with itself is , which is not uniformly continuous on ( is continuous on and not uniformly continuous, the pairs and defeating every ).
The contrast with continuity is the point. Products do preserve continuity, with no hypothesis at all (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). The reason the proof there does not transfer is visible in the estimate: bounding requires a bound on the values of and near the two points, and for continuity that bound is local, supplied afresh at each point, whereas uniform continuity would need one bound valid on the whole domain. On an unbounded domain no such bound need exist.
Facts & Assumptions
Given: The domain , the identity , , and its square (Integer powers ).
Uniform continuity on : for every real there is a real such that all with satisfy (Uniform continuity of : one serving every pair of points of ).
is continuous on and is not uniformly continuous on ( is continuous on and not uniformly continuous, the pairs and defeating every , Continuity of at a point of and on : the - condition, its agreement with at a limit point, and continuity at an isolated point).
The pointwise product of with itself is , and products of continuous functions are continuous (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, Integer powers ).
Absolute value and order: and exactly when ; the order is total (Basic properties of the absolute value, Ordered field).
Counterexample
The identity is uniformly continuous on : given a real , take ; then all with satisfy .
The pointwise product of the identity with itself is the function .
By [L2] the function is not uniformly continuous on .
So and are uniformly continuous on while is not: the refuted claim is false.
Remarks
-
Where the implication survives. On a bounded domain the product of two uniformly continuous functions is uniformly continuous, because each factor is then bounded: a uniformly continuous function on a bounded set is bounded, and the estimate closes. Nothing on this page asserts that, and it is not used anywhere here; the witness above shows only that the unrestricted claim fails.
-
Sums and scalar multiples are safe. If and are uniformly continuous on then so are and , by the same and arguments that work for continuity, with the 's inherited uniformly. It is only the product, and the quotient, that need a bound on values.
-
A second witness on a bounded domain. is not uniformly continuous on ( is continuous on and not uniformly continuous there, the pairs and defeating every ) although the identity is; that failure is a quotient rather than a product, and it shows that boundedness of the domain does not rescue every algebraic operation.
The identity on is bounded with no greatest value, and on it is continuous and unbounded
Statement refuted
Refuted claim: for the conclusions of the extreme value theorem it is enough that the domain be bounded, or that it be closed; that is, a continuous real function on a bounded domain attains a greatest value, and a continuous real function on a closed domain is bounded (Continuity of at a point of and on : the - condition, its agreement with at a limit point, and continuity at an isolated point, Lower bound, bounded below, bounded set, Maximum and minimum of a set).
Both halves are false, and one function refutes both:
- on , which is bounded and not closed, the identity is continuous and bounded, of its image exists and equals , and no point of attains it;
- on , which is closed and not bounded, the identity is continuous and unbounded.
Neither nor is compact (A subset of is compact if and only if it is closed and bounded), so Extreme value theorem: a continuous real function on a nonempty compact subset of attains a greatest and a least value does not apply to either, and both are instances of Rudin 4.20, the sharp converse: on a noncompact there is an unbounded continuous function and a bounded continuous function with no greatest value, and if is bounded there is a continuous function on that is not uniformly continuous: the first is its bounded-not-closed case, the second its unbounded case. Together they show that neither half of "closed and bounded" can be dropped.
This item is the worked witness for FALSE: a continuous real function on a bounded domain attains a greatest value, which refutes the first half alone.
Facts & Assumptions
Given: The sets and (Intervals of : the nine order-convex forms, nondegeneracy, and length) and the identity on each of them.
The identity is continuous on every subset of (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, Continuity of at a point of and on : the - condition, its agreement with at a limit point, and continuity at an isolated point).
A greatest value of on is a point with for every ; a set is bounded when it lies between two reals (Maximum and minimum of a set, Lower bound, bounded below, bounded set).
Suprema: a nonempty set bounded above has a least upper bound, and for every real admits with (Complete ordered field (least-upper-bound property), Epsilon characterisation of the supremum).
Archimedean property: for every real there is a natural with (Every complete ordered field is Archimedean).
Ordered-field arithmetic: for one has ; the maximum of a two-element set of reals exists and is one of them; and for a natural (Ordered field, Every nonempty finite set of reals has a maximum and a minimum, Maximum and minimum of a set).
is bounded and not closed, is closed and not bounded, and neither is compact (Intervals of : the nine order-convex forms, nondegeneracy, and length, Open subset of (every point has a neighbourhood inside it), closed subset (complement open), and clopen, Lower bound, bounded below, bounded set, A subset of is compact if and only if it is closed and bounded, Open cover, subcover, compact subset of (every open cover has a finite subcover), and sequentially compact subset).
Counterexample
The identity is continuous on and on by [L1], and is bounded while is closed, by [L6].
On the identity is bounded. Every satisfies , so the image lies between and and is bounded by [L2].
On the identity is unbounded. Let a real be given. By [L4] there is a natural with , and so with . So no real bounds above, and by [L2] the identity is unbounded on .
On there is no greatest value. Let , so . By [L5] the point satisfies and , so and . Hence no satisfies for every , and by [L2] the identity attains no greatest value on .
The supremum exists and equals . By step 1.2 and [L3] the nonempty set has a least upper bound , and since bounds it above. For a real the point lies in by [L5] and satisfies , so no real below bounds above; hence . By step 2.1 no point of has value , so the supremum is not attained.
So on the bounded set a continuous function attains no greatest value, and on the closed set a continuous function is unbounded: both halves of the refuted claim are false, and by [L6] neither domain is compact, so no conflict with Extreme value theorem: a continuous real function on a nonempty compact subset of attains a greatest and a least value arises.
Remarks
-
The two failures are of different kinds. On the function is bounded and the supremum exists as a real number; what is missing is a point at which it is attained, and adding the endpoint restores it. On there is no supremum at all, and no endpoint can be added. That is the distinction Rudin 4.20, the sharp converse: on a noncompact there is an unbounded continuous function and a bounded continuous function with no greatest value, and if is bounded there is a continuous function on that is not uniformly continuous draws between its bounded-not-closed and unbounded cases.
-
The domains are exactly the two minimal ways to fail compactness. By A subset of is compact if and only if it is closed and bounded a subset of fails compactness by failing closedness or by failing boundedness; fails only the first, only the second, and each already kills the theorem.
-
The same domains kill uniform continuity too, but with different witnesses: on it is ( is continuous on and not uniformly continuous there, the pairs and defeating every ) and on an unbounded closed set it is ( is continuous on and not uniformly continuous, the pairs and defeating every ). The identity itself is uniformly continuous on both, so a single witness cannot serve every conclusion at once.
The intermediate value theorem gives a second proof that every nonnegative real has an -th root, applied to on a closed bounded interval
Example
Let with and let with . Put and consider
(Integer powers , Intervals of : the nine order-convex forms, nondegeneracy, and length). Then is continuous on , , and the intermediate value theorem (Intermediate value theorem, by bisection with a canonical left-half rule: a continuous function on takes every value between and ) supplies with
Moreover is the only nonnegative real with this property, so in the notation of Existence and uniqueness of -th roots: a unique with .
This is a second proof of an existing theorem, not a new one. Existence and uniqueness of -th roots: a unique with already proves existence and uniqueness of -th roots, by an argument that runs directly from the least-upper-bound property and the factorisation of ; it is the item the rest of the library cites, and no second identifier is minted for the same statement. What is recorded here is that the intermediate value theorem gives the existence half in three lines once continuity of is available, which is the standard modern route and the reason the theorem is usually met in this form.
No circularity. Intermediate value theorem, by bisection with a canonical left-half rule: a continuous function on takes every value between and rests on A nested sequence of nonempty closed bounded intervals has nonempty intersection, and the intersection is a single point exactly when the lengths tend to , on the algebra of continuous functions and on the sequential criterion, none of which uses -th roots; and the uniqueness half below is Monotonicity of and of , which is pure ordered-field arithmetic. So this argument could have been the library's definition of ; it is not, only because the roots were needed at order , long before continuity existed.
Facts & Assumptions
Given: A real , a natural , and ; the function on .
Polynomial functions, in particular , are continuous on every subset of (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, Continuity of at a point of and on : the - condition, its agreement with at a limit point, and continuity at an isolated point, Integer powers ).
Intermediate value theorem: for , a function continuous on takes every value between and (Intermediate value theorem, by bisection with a canonical left-half rule: a continuous function on takes every value between and ).
Powers and order: for ; if and then ; and is strictly increasing on the nonnegative reals for , hence injective there (Monotonicity of and of , Integer powers ).
Existence and uniqueness of -th roots: for and there is a unique with , written (Existence and uniqueness of -th roots: a unique with ).
Ordered-field arithmetic: gives and ; and (Ordered field, Complete ordered field (least-upper-bound property)).
Verification
by [L5], so is a nonempty closed bounded interval, and is continuous on it by [L1].
by [L3] and the hypothesis ; and by [L3] and [L5]. So .
By [L2] applied on with the value , there is with ; in particular .
is the only nonnegative real with : by [L3] the map is injective on the nonnegative reals, so two nonnegative solutions would coincide. Hence in the notation of [L4], and the existence half of [L4] has been re-proved from the intermediate value theorem.
Remarks
-
Why and not . For the value is at most , so need not reach at its right endpoint; adding makes , and then by Monotonicity of and of . Taking works equally well and is the usual textbook choice; avoids naming a maximum.
-
The same argument through the image. 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 says is a closed bounded interval containing and , hence containing ; that is the intermediate value theorem repackaged, and it is the form in which the statement generalises to other continuous increasing functions.
-
What this does not give. The argument produces a root but no way to compute it, and no rate: it is a pure existence proof, exactly like the bisection that underlies Intermediate value theorem, by bisection with a canonical left-half rule: a continuous function on takes every value between and . The companion example A worked fixed point on for the map , from the one-dimensional fixed point theorem identifies the same number, for and , as the fixed point of on .
A worked fixed point on for the map , from the one-dimensional fixed point theorem
Example
Let
(Intervals of : the nine order-convex forms, nondegeneracy, and length). Then:
- is continuous on (Continuity of at a point of and on : the - condition, its agreement with at a limit point, and continuity at an isolated point);
- for every ;
- by Every continuous map of a closed bounded interval into itself has a fixed point, has a fixed point in ; and
- that fixed point is unique and equals (Existence and uniqueness of -th roots: a unique with ).
What the example is for. It is the smallest nontrivial instance of the one-dimensional fixed point theorem in which the fixed point can be named, and it shows that the theorem, which asserts existence only, may be combined with an algebraic identity to pin the point down. The identity is elementary: says , that is .
No derivative is used, and none is available at this point in the reading order. The usual argument that maps into itself computes the minimum of by differentiation; the two-line order estimate of step 1.2 below replaces it. The same map is treated as a contraction of in The map is a contraction of with fixed point , and the a priori bound gives the error after steps, where the Banach fixed point theorem gives the same point together with an error bound after iterations; that route needs completeness of the metric subspace, this one needs only the intermediate value theorem.
Facts & Assumptions
Given: The interval and the function on it.
Algebra of continuous functions: the identity and constants are continuous, sums and scalar multiples of continuous functions are continuous, and the reciprocal of a continuous nowhere-vanishing function is continuous (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, Continuity of at a point of and on : the - condition, its agreement with at a limit point, and continuity at an isolated point).
One-dimensional fixed point theorem: a continuous with and for all has a fixed point in (Every continuous map of a closed bounded interval into itself has a fixed point, Intermediate value theorem, by bisection with a canonical left-half rule: a continuous function on takes every value between and ).
Reciprocals and order: for one has , hence and so (Inverses of positives are positive, and reciprocation reverses order, Ordered field).
Square roots: for there is a unique with , written ; and is strictly increasing on the nonnegative reals (Existence and uniqueness of -th roots: a unique with , Monotonicity of and of , Integer powers ).
Ordered-field arithmetic: ; halving preserves order; and (Ordered field, Complete ordered field (least-upper-bound property), Integer powers ).
Verification
Claim 1. On the identity is continuous and does not vanish, since ; so is continuous there by [L1], and is continuous on as a scalar multiple of a sum of continuous functions.
Claim 2. Let . By [L3] we have , and by hypothesis ; adding, , and halving gives by [L5]. So .
Claim 3. By [L2], applied with , and the map , which is continuous by step 1.1 and maps into itself by step 1.2, there is with .
Every fixed point squares to . Let satisfy . Then , so multiplying by gives , that is .
Claim 4. By [L4] there is exactly one nonnegative real whose square is , namely ; since every fixed point is and satisfies by step 3.1, the fixed point is unique and equals . And does lie in : from and the strict monotonicity of on the nonnegative reals ([L4], [L5]) one gets .
Remarks
-
A sharper bound, from a square. For one has , and expanding gives , so for every . That is the same identity The map is a contraction of with fixed point , and the a priori bound gives the error after steps uses, and it shows that maps into ; the crude estimate of step 1.2 is all that claim 2 needs, and it avoids square roots entirely.
-
Existence and identification are separate steps. Every continuous map of a closed bounded interval into itself has a fixed point gives claim 3 with no information about where the point is; claim 4 is pure algebra and would be equally valid if no fixed point existed, since it only says which number a fixed point must be. It is the combination that names .
-
The interval matters. On the same formula has the fixed point , and on an interval straddling the map is not even defined. Choosing is what makes claim 2 true and isolates the positive root.
Sources
Standard references
Recommended treatments; not extraction sources.
- Lipschitz continuity (Wikipedia)
- Floor and ceiling functions (Wikipedia)
- Triangle wave (Wikipedia)
- J. Heinonen, Lectures on Lipschitz Analysis
- Dirichlet function (Wikipedia)
- Continuous function (Wikipedia)
- W. Rudin, Principles of Mathematical Analysis, 3rd ed., Ch. 4
- E. Zakon, Mathematical Analysis, §4.1: Basic Definitions
- J. Lebl, Basic Analysis I, §3.2
- E. Boman and R. Rogers, An Analytic Definition of Continuity
- Uniform continuity (Wikipedia)
- J. Lebl, Basic Analysis I, §3.4
- J. Lebl, Basic Analysis I, §3.3: Uniform continuity
- Hölder condition (Wikipedia)
- University of Zaragoza thesis on Hölder continuity
- University of Wisconsin Math 521 exercises
- Rutgers Mathematics 300, Fall 2017 examination solutions
- Extreme value theorem (Wikipedia)
- J. Lebl, Basic Analysis I, §3.3
- University of Edinburgh, The Extreme Value Theorem
- Intermediate value theorem (Wikipedia)
- Nth root (Wikipedia)
- W. Rudin, Principles of Mathematical Analysis, 3rd ed., Ch. 1 and Ch. 4
- E. Zakon, Mathematical Analysis, §4.9: The Intermediate Value Property
- Fixed point (mathematics) (Wikipedia)
- Methods of computing square roots (Wikipedia)