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
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
- 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
Objective. This page defines continuity of a real function on a subset of , proves the toolkit that makes the notion usable, and then proves the four theorems that continuity exists for: the image of a compact set is compact, the extreme value theorem, the intermediate value theorem, and Heine-Cantor. Along the way it states the dictionary that reconciles the vocabulary of this page with the metric-space vocabulary of the earlier topology track, and it closes with counterexamples showing that compactness is needed for the extreme-value and uniform-continuity conclusions; the intermediate value theorem instead rests on the interval/connectedness hypothesis.
The definition, and the clause that is easy to get wrong. Continuity of at a point of and on : the - condition, its agreement with at a limit point, and continuity at an isolated point says that is continuous at when for every real there is a real with for every satisfying . Note the two differences from the limit of the previous page: the point is required to lie in , and the condition is unpunctured, so is allowed. Three clauses follow, and all three are part of the definition. At a limit point of , continuity at is exactly ; at an isolated point of every function is continuous, because the only admissible is itself; and continuity on is continuity at each point of . The second clause is not the vacuous formula that FALSE: a function has at most one limit at every point of its domain, isolated points included warns about: there the punctured formula was satisfied by every real at once and so defined nothing, whereas here the condition names one well-defined property, and the symbol simply does not exist at an isolated point.
Choice hygiene, and why it shapes the page. is continuous at if and only if for every sequence in converging to , the converse direction costing countable choice proves that is continuous at if and only if for every sequence in converging to — sequences that may hit , which is the difference from Heine criterion: iff for every sequence in converging to and what makes the criterion meaningful at an isolated point. The direction from continuity to sequences is a theorem of ZF; the converse inherits the single use of countable choice made on the previous page, and The sequence-to- direction of the Heine criterion uses countable choice for , and where this library records that cost records exactly what is and is not claimed about that. As on that page, everything provable from and is proved that way: the algebra of continuous functions, composition, the preimage characterisation and the intermediate value theorem spend no choice at all. The two items that do spend it, Heine-Cantor in : a continuous real function on a compact subset of is uniformly continuous, proved -natively from sequential compactness and the converse direction of the sequential criterion, say so in their own statements.
The toolkit. 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 proves that sums, scalar multiples, products, absolute values, maxima, minima and quotients with nonvanishing denominator of continuous functions are continuous, and adds the clause the rest of the page uses constantly: constants, the identity, every power and every polynomial function are continuous on every subset of . A composite of continuous functions is continuous, with no side hypothesis of the kind the composition of limits needs proves that a composite of continuous functions is continuous with no side hypothesis — in contrast with Composition of limits holds under either hypothesis: is defined at with value , or avoids on a punctured neighbourhood of , which needs one of two extra conditions and is false without both (FALSE: whenever and ). The reason is visible in one line: the unpunctured quantifier of Continuity of at a point of and on : the - condition, its agreement with at a limit point, and continuity at an isolated point controls at the very value the limit version cannot see. is continuous on if and only if the preimage of every open subset of is the intersection with of an open subset of , and dually for closed sets then gives the topological form: is continuous on exactly when the preimage of every open set is the trace on of an open subset of , and dually for closed sets. The preimage lives in , not in , so this does not say that preimages of open sets are open; and the witnessing open set is built as a single union over a family cut out by a property, so no choice function on an arbitrary subset of is needed.
Compactness, and the two theorems it buys. The image of a compact subset of under a continuous real function is compact proves that the image of a compact subset of under a continuous function is compact, by an -native cover argument in which the only selection is from a finite list. A continuous real function on a compact subset of is bounded reads off boundedness, and Extreme value theorem: a continuous real function on a nonempty compact subset of attains a greatest and a least value reads off attainment: on a nonempty compact a continuous satisfies and for some . The two ingredients are kept apart in that proof — compactness enters only through compactness of the image, order-completeness only through the existence of and , and closedness of the image is the bridge.
The intermediate value theorem, by a canonical bisection. Intermediate value theorem, by bisection with a canonical left-half rule: a continuous function on takes every value between and proves that a continuous function on takes every value between and . The bisection tests the left half first and takes the right half only when the left is excluded, so the passage from one interval to the next is a function of that interval and The recursion theorem applies with nothing selected; A nested sequence of nonempty closed bounded intervals has nonempty intersection, and the intersection is a single point exactly when the lengths tend to then supplies the point, and only the choice-free direction of the sequential criterion is used to pass to the limit. 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 draws the two standard consequences: the image of an order-convex set is order-convex, hence connected (A subset of is connected if and only if it is order-convex, that is, an interval), and the image of a closed bounded interval is a closed bounded interval. Every continuous map of a closed bounded interval into itself has a fixed point is the third: a continuous map of into itself has a fixed point, because changes sign. The existence of -th roots is not restated here: Existence and uniqueness of -th roots: a unique with already proves it, and the companion page's The intermediate value theorem gives a second proof that every nonnegative real has an -th root, applied to on a closed bounded interval records the second proof without minting a second name for the same statement.
A converse worth having. A function on an interval satisfying whenever , whose image is order-convex, is continuous proves that a function on an interval satisfying whenever , whose image is order-convex, is continuous. It needs no one-sided limits of monotone functions, which are not available at this point in the reading order; the whole proof reads the required off the image. It is stated as a standalone lemma so that a later page may cite it — the classical application is a monotone function built by a limiting construction whose image is known independently.
Uniform continuity, and the dictionary. Uniform continuity of : one serving every pair of points of asks for one serving every pair of points of ; the whole content is that moves to the left of the point quantifier. 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 is then the hinge of the page. It proves that, for with , continuity and uniform continuity in the senses defined here coincide with Continuity of a map between metric spaces, at a point and globally, in the - form and Uniform continuity of a map of metric spaces: one serving every point; that the Lipschitz and Hölder conditions for a real function are Lipschitz map, -Hölder map for rational , and contraction instantiated, and are not redefined here; and — the clause that closes a seam nobody had flagged — that a subset of is compact in the open-cover sense of Open cover, subcover, compact subset of (every open cover has a finite subcover), and sequentially compact subset exactly when it is a compact metric subspace, with the same agreement for sequential compactness. Two consequences are recorded: the implications of 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 transfer verbatim to real functions, and Cauchy sequences of are the same objects in both vocabularies.
Why three theorems are stated twice. The continuous image of a compact set, the extreme value theorem and Heine-Cantor appear on this page in -native form and on the metric-spaces page in metric-general form, with distinct identifiers and distinct proofs. That is deliberate. The proofs here run through A subset of is compact if and only if it is closed and bounded and A subset of is compact iff it is sequentially compact, which are order-based; the metric proofs run through the cover machinery of metric spaces. 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 is the single place in the library where the duplication is acknowledged, and each duplicated item links it.
Heine-Cantor, extension, and the two sharp statements. Heine-Cantor in : a continuous real function on a compact subset of is uniformly continuous, proved -natively from sequential compactness proves that a continuous function on a compact is uniformly continuous, by contradiction from sequential compactness, with countable choice used exactly once and named. A uniformly continuous real function on a subset extends uniquely to a uniformly continuous function on the closure of proves that a uniformly continuous function on a nonempty extends uniquely to a uniformly continuous function on ; that is the statement later pages need in order to define a function on the rationals first and pass to the reals. If on an interval for some rational then is constant explains why Lipschitz map, -Hölder map for rational , and contraction stops at exponent : on an interval, an inequality with rational forces to be constant. Finally 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 is the sharp converse to everything above: on a set that is not compact there is always an unbounded continuous function and a bounded continuous function whose supremum is not attained, and if that set is bounded there is also a continuous function that is not uniformly continuous. All four witness functions are exhibited explicitly.
The three false statements on this page each carry their own witness, verified in full: that continuity implies uniform continuity (FALSE: every continuous real function is uniformly continuous on its domain, refuted by on ), that a continuous image of a closed set is closed (FALSE: the image of a closed subset of under a continuous real function is closed, refuted by on , whose image is ), and that boundedness of the domain suffices for the extreme value theorem (FALSE: a continuous real function on a bounded domain attains a greatest value, refuted by the identity on ). The companion page works the first and the third out again in more detail and adds the witnesses for the regularity hierarchy, the Dirichlet function, and the two examples that turn the intermediate value theorem into a computation.
3 · Logical flowchart
4 · Definitions, theorems and proofs
Continuity of at a point of and on : the - condition, its agreement with at a limit point, and continuity at an isolated point
Definition
Throughout, is the complete ordered field with its order and absolute value (Complete ordered field (least-upper-bound property), Basic properties of the absolute value), and neighbourhoods are those of The -neighbourhood and the punctured -neighbourhood of a point of .
Let , let and let . Then is continuous at when
with and ranging over the positive reals. In the language of neighbourhoods: for every real there is a real with
is continuous on when it is continuous at every point of .
The point is required to lie in , and the condition is unpunctured. Both differ from The - limit of at a limit point of , and deliberately. There the quantifier runs over , which removes ; here is allowed, and at the implication reads , which is automatic. So allowing costs nothing, and it is what lets the definition be stated at every point of , including the points where no limit exists.
Three clauses, and all three are part of the definition.
-
At a limit point. Suppose is a limit point of (Limit point, isolated point, adherent point, derived set, and dense subset of ). Then is continuous at if and only if the limit of at exists and (The - limit of at a limit point of ). Indeed, for a given a witnessing continuity witnesses the limit condition, because the limit condition quantifies over a subset of the points continuity quantifies over; and conversely a witnessing witnesses continuity, because the one point it omits, , satisfies anyway.
-
At an isolated point. Suppose is an isolated point of (Limit point, isolated point, adherent point, derived set, and dense subset of ), so that for some real . Then every is continuous at : take , so that the only with is itself, and .
-
On a set. Continuity on is continuity at each point of , and nothing more. It is not a condition relating to points outside .
Every point of is either a limit point of or an isolated point of , and never both (Limit point, isolated point, adherent point, derived set, and dense subset of ), so clauses 1 and 2 between them describe continuity at every point of .
This is not the raw - formula of FALSE: a function has at most one limit at every point of its domain, isolated points included. That item records what goes wrong when the punctured formula of The - limit of at a limit point of is written down at an arbitrary point of the domain: at an isolated point it is satisfied vacuously by every real at once, so it defines nothing, and this library therefore leaves undefined at an isolated point. Continuity at an isolated point is a different matter: the formula above is not vacuous — it is a genuine condition on , satisfied because is the only value being compared with itself — and it names a single, well-defined property. The limit is undefined there; the continuity is defined, and is automatic. Clause 1 is the only place where the two notions meet, and it is stated only where the limit exists as a notion.
Where the distinction disappears. If is an open subset of (Open subset of (every point has a neighbourhood inside it), closed subset (complement open), and clopen), then every has some , and a punctured neighbourhood is never empty (The -neighbourhood and the punctured -neighbourhood of a point of ), so every point of is a limit point of and clause 1 covers the whole of . The same holds when is a nondegenerate interval (Intervals of : the nine order-convex forms, nondegeneracy, and length). Isolated points are what force clause 2 to exist at all, and they occur as soon as is allowed to be an arbitrary subset of , as in .
Remarks
-
Continuity is local. If and agrees with on , then is continuous at if and only if is: any may be replaced by , after which the condition only ever evaluates the two functions where they agree. So continuity at sees only an arbitrarily small neighbourhood of , exactly as the limit does (The limit at depends only on the restriction of to a punctured neighbourhood of , and passes to any subset of the domain having as a limit point).
-
Continuity passes to subsets of the domain. If and , then continuity of at gives continuity of the restriction at , with the same : the condition on quantifies over fewer points. The converse fails, and the standard witness is the indicator of restricted to , which is constant and hence continuous, while the indicator itself is continuous nowhere (The indicator of is continuous at no point of ↗).
-
The radius is a real number. As in The -neighbourhood and the punctured -neighbourhood of a point of , and range over the positive reals here. Restricting either quantifier to the positive rationals defines the same relation, by the passage recorded in The - limit of at a limit point of : below every positive real lies a positive rational (The rationals embed densely in the reals), and a real may be shrunk to a rational one below it.
-
The word continuous is used for two things in this library, and they agree. Continuity of a map between metric spaces, at a point and globally, in the - form defines continuity of a map between metric spaces, and carries the metric . The two notions coincide, and that is proved, not assumed: 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 is the dictionary, and it is stated on this page precisely so that no later item has to guess.
is continuous at if and only if for every sequence in converging to , the converse direction costing countable choice
Statement
Let , let and let . The following are equivalent.
- 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).
- For every sequence with for every and (Sequences of reals: bounded, eventually, frequently, tails, subsequences, Limits and Cauchy sequences of reals), the sequence converges to .
The sequences here are not required to avoid , which is the one difference from Heine criterion: iff for every sequence in converging to and is exactly what makes the criterion available at an isolated point of , where no limit exists.
The two directions do not cost the same. The implication from 1 to 2 is proved in ZF: the sequence is handed to the proof and nothing is selected. The implication from 2 to 1 is obtained below from Heine criterion: iff for every sequence in converging to , and therefore inherits the one use of the axiom of countable choice (The Axiom of Countable Choice ()) made in that theorem's converse direction. What this library does and does not claim about that cost is recorded once, in The sequence-to- direction of the Heine criterion uses countable choice for , and where this library records that cost, and is not restated here.
Nothing else on this page is routed through this theorem. The algebra of continuous functions, composition, the intermediate value theorem, the extreme value theorem and Heine-Cantor are all proved from and , or from compactness, exactly as the previous page organised itself. The choice-free direction 1 to 2 is used, in the intermediate value theorem and in Heine-Cantor, and each of those two items says which direction it uses.
Facts & Assumptions
Given: A set , a function and a point .
Continuity at : for every real there is a real such that every with satisfies (Continuity of at a point of and on : the - condition, its agreement with at a limit point, and continuity at an isolated point).
A point of is either a limit point of or an isolated point of , and never both; is isolated in when for some real (Limit point, isolated point, adherent point, derived set, and dense subset of , The -neighbourhood and the punctured -neighbourhood of a point of ).
At a limit point of , is continuous at if and only if the limit of at exists and equals ; at an isolated point of every function is continuous (Continuity of at a point of and on : the - condition, its agreement with at a limit point, and continuity at an isolated point, The - limit of at a limit point of ).
Heine criterion for limits: at a limit point of , holds if and only if for every sequence with , for every , and . The direction from the limit to sequences is a theorem of ZF; the converse uses the axiom of countable choice exactly once (Heine criterion: iff for every sequence in converging to , The Axiom of Countable Choice ()).
Convergence of a real sequence: when for every rational there is with for all ; below every positive real lies a positive rational, so the test may equally be run at every real (Limits and Cauchy sequences of reals, Sequences of reals: bounded, eventually, frequently, tails, subsequences, The rationals embed densely in the reals).
Absolute value: , and exactly when (Basic properties of the absolute value).
Proof
The isolated case, both statements at once. Suppose is an isolated point of and fix a real with . Then statement 1 holds by [L3]. Statement 2 also holds: if for every and , then by [L5] there is with for all , so and hence and for all ; a sequence eventually equal to converges to , since for . So 1 and 2 are both true, and in particular equivalent.
The limit-point case, from 1 to 2. Suppose is a limit point of and that is continuous at . Let satisfy for every and , and let a rational be given. By [L1] fix a real with for every satisfying ; by [L5] fix with for all . Every such has and , hence . As the rational was arbitrary, . Nothing was selected, so this is a theorem of ZF.
The limit-point case, from 2 to 1. Suppose is a limit point of and that statement 2 holds. Every sequence with , for every , and is in particular a sequence in converging to , so statement 2 gives . That is the right-hand side of [L4] with , so [L4] yields that the limit of at exists and equals , and [L3] turns that into continuity of at . This is the direction that inherits the single use of countable choice made in [L4].
By [L2] the point is either isolated in or a limit point of . In the first case step 1.1 proves both statements outright; in the second, step 1.2 gives 1 implies 2 and step 1.3 gives 2 implies 1. So statements 1 and 2 are equivalent, with the first implication free of choice and the second inheriting exactly one application of countable choice.
Remarks
-
Why the sequences are allowed to hit . Heine criterion: iff for every sequence in converging to must exclude , because The - limit of at a limit point of says nothing about and a sequence constantly equal to would test the wrong thing. Continuity does look at , so no exclusion is needed, and dropping it is what makes statement 2 meaningful at an isolated point, where the only sequences converging to are those eventually equal to .
-
What the choice cost is, and what it is not. The claim recorded here is that the proof given above of 2 implies 1 uses countable choice, through Heine criterion: iff for every sequence in converging to . No claim is made that it is necessary; The sequence-to- direction of the Heine criterion uses countable choice for , and where this library records that cost states in full what this library does and does not assert, including Sierpiński's ZF theorem that a function continuous sequentially at every point of is continuous, which shows the everywhere-statement and the pointwise statement behave differently.
-
The negative use is the common one. To show that is not continuous at it suffices to exhibit one sequence in converging to whose image sequence does not converge to , and that uses only the choice-free direction. The indicator of is continuous at no point of ↗ on the companion page is proved without sequences at all, directly from density, which is cheaper still.
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
Statement
Let , let , let and let . Suppose and are 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). Then:
- , and are continuous at ;
- , the function , is continuous at ;
- and , defined pointwise by and (Maximum and minimum of a set), are continuous at ;
- if then, writing , the point lies in and the quotient , , is continuous at as a function on .
Moreover, with no hypothesis at all:
- every constant function and the identity , , are continuous on ; hence so is for every (Integer powers ), and hence so is every polynomial function with real coefficients.
Consequently, if and are continuous on then so are , , , , and , and is continuous on .
Claim 4 is stated on because is not defined where vanishes, and may well vanish at points of far from . The hypothesis is , not " nowhere zero"; what it buys is that itself lies in the smaller domain, which is what makes continuity there mean anything.
Nothing here is proved through a sequence. Claims 1 and 4 are read off from Sums, scalar multiples, products and quotients of function limits, the quotient under the hypothesis that the denominator limit is nonzero, which is itself proved from and , and claims 2, 3 and 5 are proved directly below. So no choice principle is used anywhere in this item.
Facts & Assumptions
Given: A set , functions , a real , a point at which and are continuous, and, for claim 4, the hypothesis together with .
Continuity at : for every real there is a real such that every with satisfies (Continuity of at a point of and on : the - condition, its agreement with at a limit point, and continuity at an isolated point).
A point of is either a limit point of or an isolated point of , and never both; at an isolated point of its domain every function is continuous; at a limit point of , continuity of at is exactly the statement that the limit of at exists and equals (Continuity of at a point of and on : the - condition, its agreement with at a limit point, and continuity at an isolated point, Limit point, isolated point, adherent point, derived set, and dense subset of , The -neighbourhood and the punctured -neighbourhood of a point of , The - limit of at a limit point of ).
Algebra of function limits at a limit point of : if the limits of and at exist with values and , then the limits of , and at exist with values , and ; and if then is a limit point of , and the limit of at exists and equals (Sums, scalar multiples, products and quotients of function limits, the quotient under the hypothesis that the denominator limit is nonzero).
Sign preservation: if the limit of at a limit point of exists and is nonzero, then is a limit point of (If then on a punctured neighbourhood of ; in particular if then there).
Reverse triangle inequality: (The reverse triangle inequality); and , exactly when , (Basic properties of the absolute value).
Maximum and minimum of a two-element set of reals exist (Every nonempty finite set of reals has a maximum and a minimum, Maximum and minimum of a set), and for all reals one has and .
Ordered-field arithmetic in : trichotomy and totality of the order, the field identities, and so that and is defined (Ordered field, Field).
Integer powers: and (Integer powers ).
Proof
Justification of the identity in [L6]. Let . By totality either or . If then , so and , while . If the same computation with the roles exchanged applies, since there.
The isolated case. Suppose is an isolated point of , say with real. Then every function on is continuous at by [L2], which gives claims 1, 2 and 3 at once. For claim 4, assume ; then , and with in the left-hand side, so is an isolated point of and every function on , in particular , is continuous at .
Claim 2, at any point of . Let a real be given and let be as in [L1] for and this . For with the reverse triangle inequality gives . So is continuous at , and no case distinction was needed.
Claim 5, constants and the identity. If is constant then for every and every real , so any serves. For the identity, given a real take : every with has . Both are continuous at every point of .
The limit-point case, claim 1. Suppose is a limit point of . By [L2] the limits of and of at exist and equal and . By [L3] the limits of , and at exist and equal , and , which are exactly the values of those three functions at ; by [L2] again, each of them is continuous at .
The limit-point case, claim 4. Suppose is a limit point of and . Then , and by [L4] the point is a limit point of . By [L3] the limit of at exists and equals , which is the value of at ; by [L2] applied on the domain , that function is continuous at .
Claims 1 and 4 in general. By [L2] the point is either isolated in or a limit point of ; step 1.2 settles the first case and steps 1.5 and 1.6 the second. So claims 1 and 4 hold as stated.
Claim 3. By claim 1 the function is continuous at , by step 1.3 so is , and by claim 1 again so are and its scalar multiple by . By step 1.1 that scalar multiple is the function , so the maximum is continuous at ; the same argument with gives the minimum.
Claim 5, powers and polynomials. The map is the constant and is the identity, both continuous on by step 1.4; and if is continuous on then so is , being a product of two functions continuous on by step 2.1. By induction on , is continuous on for every . A polynomial function is obtained from these by finitely many scalar multiplications and additions, each of which preserves continuity by step 2.1.
Claims 1 to 5 are proved, all of them at an arbitrary point of and therefore, applied at every point, on the whole of ; and no sequence and no choice principle was used.
Remarks
-
Why the two-case shape, and why it is not an inconvenience. Continuity is defined at every point of the domain, including isolated points, where no limit exists (Continuity of at a point of and on : the - condition, its agreement with at a limit point, and continuity at an isolated point). The algebra of limits therefore cannot be applied blindly; but at an isolated point every function is continuous, so the case is settled before it is opened. Claims 2 and 5 are proved directly from and and need no case distinction at all.
-
Absolute value, maximum and minimum are not in Sums, scalar multiples, products and quotients of function limits, the quotient under the hypothesis that the denominator limit is nonzero, and the reason is that they are not needed there. They are needed here: the extreme value theorem and the one-dimensional fixed point theorem both build auxiliary functions out of maxima, minima and differences, and 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 builds its witnesses out of and quotients.
-
The converse of claim 2 is false: may be continuous while is continuous nowhere. The function equal to on and to elsewhere has constant absolute value; that it is nowhere continuous follows from the argument of The indicator of is continuous at no point of ↗ applied verbatim, since that argument uses only that the two values are distinct.
A composite of continuous functions is continuous, with no side hypothesis of the kind the composition of limits needs
Statement
Let , let with , and let , so that the composite is defined. Let . If is continuous at and is continuous at , 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).
Consequently, if is continuous on and is continuous on , then is continuous on .
No side hypothesis is needed, and that is the whole point. The composition theorem for limits, Composition of limits holds under either hypothesis: is defined at with value , or avoids on a punctured neighbourhood of , must assume one of two extra conditions: either with , or on a punctured neighbourhood of ; with both dropped the statement is false, which is FALSE: whenever and . The first of those conditions is exactly continuity of at written out, so under the hypotheses above it holds automatically and nothing has to be assumed. The mechanism is visible in the proof: Continuity of at a point of and on : the - condition, its agreement with at a limit point, and continuity at an isolated point quantifies over rather than over , so the value that the limit version cannot control is precisely the one the continuity hypothesis does control.
Facts & Assumptions
Given: Sets , functions with and , a point at which is continuous, and the hypothesis that is continuous at .
Continuity of at : for every real there is a real such that every with satisfies (Continuity of at a point of and on : the - condition, its agreement with at a limit point, and continuity at an isolated point).
Continuity of at : for every real there is a real such that every with satisfies (Continuity of at a point of and on : the - condition, its agreement with at a limit point, and continuity at an isolated point).
Neighbourhoods and the unpunctured quantifier: the condition in [L2] is imposed at every with , the value included (The -neighbourhood and the punctured -neighbourhood of a point of , Continuity of at a point of and on : the - condition, its agreement with at a limit point, and continuity at an isolated point).
Proof
Write ; by hypothesis , since and . Also .
Let a real be given. By [L2] fix a real such that every with satisfies .
By [L1], applied with this , fix a real such that every with satisfies .
Let with . Then and by step 2.1, so is admissible in step 1.2 and gives , that is . Note that the case is included, by [L3].
The real was arbitrary and a was produced for it, so is continuous at ; applying this at every point of gives continuity of on whenever is continuous on and on .
Remarks
-
The contrast with limits, in one sentence. Composition of limits holds under either hypothesis: is defined at with value , or avoids on a punctured neighbourhood of cannot control at the single value , because The - limit of at a limit point of never evaluates there; continuity of at that value is exactly the missing information, and it is hypothesis (i) of that theorem. So the present theorem is not a strengthening obtained by cleverness: it is the composition theorem under the hypothesis that makes the obstruction vanish.
-
What is not claimed. Continuity of at does not follow from continuity of at alone together with merely having a limit at ; nor does it follow from continuity of at together with merely having a limit at , since then need not be at all. Both hypotheses above are hypotheses about the same two points, and .
is continuous on if and only if the preimage of every open subset of is the intersection with of an open subset of , and dually for closed sets
Statement
Let and . Call a set relatively open in when for some open , and relatively closed in when for some closed (Open subset of (every point has a neighbourhood inside it), closed subset (complement open), and clopen). For write . Then the following are equivalent.
- 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).
- is relatively open in for every open .
- is relatively closed in for every closed .
"Relatively open" is defined here inline, and on purpose. At this point in the reading order this library has no subspace-topology item for , and the metric one (Isometry, isometric embedding, and the subspace metric on a subset) may not be reached before 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 has said that the two vocabularies agree, which is later on this page. The phrase above is therefore an abbreviation for the displayed condition and nothing more.
The preimage is taken inside . is a subset of , never of , so claim 2 does not say that preimages of open sets are open. They are open only when is itself open: then is an intersection of two open sets, hence open (Arbitrary unions and finite intersections of open subsets of are open, and dually for closed sets). For and the identity, is not open, and it is the trace on of the open set .
No choice principle is used. The open set witnessing claim 2 is not selected point by point; it is constructed as a single union over a family cut out by a property, which is the device the proof below makes explicit.
Facts & Assumptions
Given: A set and a function ; for , .
Continuity of at : for every real there is a real with for every satisfying ; equivalently (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 ).
Open sets of : is open when every has some ; every neighbourhood is itself open; a set is closed exactly when its complement is open (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 ).
An arbitrary union of open subsets of is open (Arbitrary unions and finite intersections of open subsets of are open, and dually for closed sets).
Set algebra: for one has ; and for , .
Proof
From 1 to 2: the canonical witness. Assume is continuous on and let be open. Define The family being united is cut out by a property of the pair , so it is a set and nothing is selected from it. Each of its members is open by [L2], so is open by [L3].
. Let , so and . Since is open, [L2] gives a real with , and continuity at gives, by [L1], a real with . So this pair contributes to the union, and by [L2]. Hence , and .
From 2 to 1. Assume claim 2, let and let a real be given. The set is open by [L2], so for some open . Since we have , hence , and [L2] gives a real with . Every with then lies in , so , that is . As and were arbitrary, is continuous on .
. Let . Then for some pair occurring in the union, so and therefore by the defining property of that pair. Hence .
Claim 2 holds. By steps 1.2 and 2.1, with open, so is relatively open in ; and was an arbitrary open subset of .
2 and 3 are equivalent. Let be closed and put , which is open by [L2]. If claim 2 holds then with open, and by [L4] with closed by [L2]; so is relatively closed. The converse runs the same computation in the other direction, starting from an open , putting and using .
Statements 1, 2 and 3 are therefore equivalent, and the passage from 1 to 2 selected nothing.
Remarks
-
Why the union, and not a choice of at each point. The textbook proof says "for each pick ", which is a choice function on a subset of that may be uncountable. Nothing in this library licenses that. Uniting all admissible balls avoids the issue completely: the family is defined by a property, membership of in needs only the existence of one admissible for that single , and the reverse inclusion needs only the defining property of whichever pair happens to catch .
-
The dual form is not "preimages of closed sets are closed". As with claim 2, the preimage lives in , and it is relatively closed. The image direction fails outright: a continuous function may carry a closed set to a set that is not closed, which is FALSE: the image of a closed subset of under a continuous real function is closed.
-
This is the statement that survives when is replaced by a metric space or a topological space. The metric version at this point in the reading order is The metric topology: a set is open when every one of its points has a ball around it inside the set; closed means open complement together with Continuity of a map between metric spaces, at a point and globally, in the - form, and the agreement of the two vocabularies for is 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, later on this page.
The image of a compact subset of under a continuous real function is compact
Statement
Let , let be 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 let be compact in the sense of Open cover, subcover, compact subset of (every open cover has a finite subcover), and sequentially compact subset, that is, every family of open subsets of whose union contains has a finite subfamily whose union contains . Then the image
is a compact subset of .
This theorem is stated twice in this library, on purpose. Its metric-space twin is The image of a compact metric space under a continuous map is compact, and so is the image of any compact subset, proved from the cover machinery of metric spaces; the proof below is -native and uses only open subsets of and the definition of continuity of this page. The duplication is deliberate and is acknowledged in exactly one place, 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 later on this page, which proves that the two notions of "compact subset of " and the two notions of "continuous" coincide, so that the two theorems really are the same statement in two vocabularies.
No choice principle is used. The covering family built below is cut out by a property rather than selected point by point, and the only selection made is from a finite list, which needs no axiom.
Facts & Assumptions
Given: A set , a function continuous on , and a compact set ; .
Continuity of at : for every real there is a real with for every satisfying ; equivalently (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 ).
Open sets: is open when every point of has a neighbourhood inside , and every neighbourhood is itself an open set containing (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 ).
Compactness of : for every family of open subsets of with , either and the empty subfamily covers it, or there are and with (Open cover, subcover, compact subset of (every open cover has a finite subcover), and sequentially compact subset).
Proof
If , then , which is compact by [L3]. Hence suppose for the rest of the proof.
Let be a family of open subsets of with . Define This family is cut out by a property of the pair , so it is a set and nothing is selected in forming it; every member is an open subset of by [L2].
covers . Let . Then and , so for some . As is open, [L2] gives a real with , and [L1] gives a real with . Since we get , so , and by [L2]. Hence .
By [L3] there are and members of with . For each the membership asserts the existence of some with ; naming one such for each of the finitely many indices requires no choice principle.
The finite subfamily works. Let , say with . By step 3.1 there is with , hence and . Therefore , a union of finitely many members of .
Every family of open subsets of covering thus has a finite subfamily covering , so is compact.
Remarks
-
The proof is the preimage characterisation, made canonical. is continuous on if and only if the preimage of every open subset of is the intersection with of an open subset of , and dually for closed sets says that is the trace on of an open set; the textbook argument pulls back each to such an open set and covers with those. Doing it that way selects one open set per member of , a family that may be arbitrarily large. Uniting all admissible balls instead, as above, reaches the same cover with no selection, and the only naming step left is over a finite index set.
-
The image of a compact set is closed and bounded, by A subset of is compact if and only if it is closed and bounded. That is what the next two items use, and it is the shortest route to both boundedness and the attainment of extrema.
-
Compactness cannot be weakened to closedness or to boundedness. The image of a closed set need not be closed (FALSE: the image of a closed subset of under a continuous real function is closed), and the image of a bounded set need not be bounded, since carries the bounded set onto .
A continuous real function on a compact subset of is bounded
Statement
Let , let be 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 let be compact (Open cover, subcover, compact subset of (every open cover has a finite subcover), and sequentially compact subset). Then is bounded on : there is a real with
Equivalently, is a bounded subset of (Lower bound, bounded below, bounded set).
The hypothesis is compactness of , not of , and it cannot be relaxed to boundedness of or to closedness of alone: the identity is unbounded on the closed set , and is unbounded on the bounded set . The general statement of that is 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, later on this page.
Facts & Assumptions
Given: A set , a function continuous on , and a compact set .
The image is compact (The image of a compact subset of under a continuous real function is compact, Continuity of at a point of and on : the - condition, its agreement with at a limit point, and continuity at an isolated point, Open cover, subcover, compact subset of (every open cover has a finite subcover), and sequentially compact subset).
A subset of is compact if and only if it is closed and bounded (A subset of is compact if and only if it is closed and bounded).
A set is bounded when there are reals with for every (Lower bound, bounded below, bounded set).
A nonempty finite set of reals has a maximum (Every nonempty finite set of reals has a maximum and a minimum, Maximum and minimum of a set), and the order of is total (Ordered field).
Absolute value: ; when and when ; and for every real (Basic properties of the absolute value).
Proof
By [L1] the set is compact, and by [L2] it is therefore closed and bounded.
By [L3] fix reals and with for every , and put , which exists by [L4] and satisfies by [L5].
Let and put , so . If then ; if then , using and . In both cases .
So for every , with a real; equivalently is bounded, which is what step 1.1 already recorded.
Remarks
-
Boundedness is the weak half of the extreme value theorem. What compactness gives in addition is that the two bounds are attained, which is Extreme value theorem: a continuous real function on a nonempty compact subset of attains a greatest and a least value; the supremum of exists as soon as is nonempty and bounded above, and the work is entirely in showing that it belongs to .
-
Boundedness of the domain is not what is used. The proof never looks at after the first line: the whole content is that the image is compact, hence bounded. That is why the same one-line argument gives boundedness of a continuous function on any compact set, however complicated.
Extreme value theorem: a continuous real function on a nonempty compact subset of attains a greatest and a least value
Statement
Let , let be 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 let be nonempty and compact (Open cover, subcover, compact subset of (every open cover has a finite subcover), and sequentially compact subset). Then and exist and are attained: there are with
Equivalently, the set has a maximum and a minimum (Maximum and minimum of a set), namely and .
Nonemptiness of is a hypothesis, not an oversight. For the set is empty, and neither a supremum nor a maximum of the empty set exists in this library (Complete ordered field (least-upper-bound property) supplies suprema of nonempty sets bounded above only).
This theorem is stated twice in this library, on purpose. Its metric-space twin is A continuous real-valued function on a nonempty compact metric space is bounded and attains a greatest and a least value, proved from the cover machinery of metric spaces; the proof below is -native, running through Heine-Borel for and the order-completeness of , and it uses no cover argument beyond the one already spent in The image of a compact subset of under a continuous real function is compact. That the two statements are the same statement in two vocabularies is proved in 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, later on this page.
Facts & Assumptions
Given: A set , a function continuous on , and a nonempty compact set ; write .
is compact (The image of a compact subset of under a continuous real function is compact), and it is nonempty because is.
is bounded: there is a real with for every , so is a lower bound and an upper bound of (A continuous real function on a compact subset of is bounded, Lower bound, bounded below, bounded set).
Least upper bounds: a nonempty subset of bounded above has a supremum (Complete ordered field (least-upper-bound property)); a nonempty subset bounded below has an infimum (Every nonempty set bounded below has an infimum, Greatest lower bound (infimum)).
Epsilon characterisations: for nonempty bounded above and , every real admits with ; dually for there is with (Epsilon characterisation of the supremum, Epsilon characterisation of the infimum).
Closure: is the set of points every neighbourhood of which meets , and is closed exactly when (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, The -neighbourhood and the punctured -neighbourhood of a point of ).
A maximum of a set is an element of it that bounds it above, and a minimum is an element that bounds it below (Maximum and minimum of a set).
Proof
By [L1] the set is nonempty and compact, and by [L2] it is bounded; by [L3] it is closed.
By [L4] the supremum and the infimum exist.
is adherent to . Let a real be given. By [L5] there is with , and since bounds above; hence , that is . So every neighbourhood of meets .
is adherent to . Symmetrically, [L5] gives with , and since bounds below; hence for every real .
By [L6] the two steps above say and ; and is closed by step 1.1, so and therefore and .
Since there is with , and since there is with .
For every the value lies in , so , that is . Hence is a maximum of and is a minimum of it, both attained at points of .
Remarks
-
The two ingredients, kept apart. Compactness of enters only through the compactness of the image; order-completeness of enters only in the existence of and . The bridge between them is closedness of : a closed set contains the adherent points of itself, and the supremum of a nonempty bounded set is always adherent to it, by Epsilon characterisation of the supremum. Neither ingredient can be dropped: over the supremum need not exist, and on a noncompact domain the supremum exists and is not attained (The identity on is bounded with no greatest value, and on it is continuous and unbounded ↗).
-
Attainment is exactly what the epsilon characterisation cannot give on its own. Epsilon characterisation of the supremum produces points of arbitrarily close to for any nonempty bounded ; nothing there says one of them equals . What closedness adds is that the limiting value is not lost.
-
The converse. If every continuous real function on a set attains a greatest value, then is compact. That is the content 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, which exhibits, for every noncompact , a bounded continuous function on with no greatest value.
Intermediate value theorem, by bisection with a canonical left-half rule: a continuous function on takes every value between and
Statement
Let with , let be continuous on the closed bounded interval (Intervals of : the nine order-convex forms, nondegeneracy, and length, Continuity of at a point of and on : the - condition, its agreement with at a limit point, and continuity at an isolated point), and let satisfy
Then there is with .
The construction is canonical, so no choice principle is used. The bisection below tests the left half first and takes the right half only when the left one has been ruled out, so the passage from one interval to the next is a function of that interval, and The recursion theorem applies with nothing selected. This is the same discipline the library uses wherever a sequence is built one term at a time.
Completeness of is what does the work. The bisection produces a nested sequence of closed bounded intervals whose lengths tend to , and it is A nested sequence of nonempty closed bounded intervals has nonempty intersection, and the intersection is a single point exactly when the lengths tend to — hence the least-upper-bound property — that supplies the point. Over an ordered field that is not complete the theorem fails; the witness for that, stated for an arbitrary ordered field and worked over , is On a closed interval of there is a continuous unbounded function, a bounded one with no maximum, and one without the intermediate value property, which states its own - continuity inline and is not an instance of this page's definition.
Facts & Assumptions
Given: Reals , a function continuous on , and a real with or .
Scalar multiples of continuous functions are continuous, so is continuous on (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).
Recursion: for a set , an element and a function there is a unique with and for every (The recursion theorem).
Nested intervals: if with and for every , then is nonempty, and it is a single point exactly when the lengths tend to (A nested sequence of nonempty closed bounded intervals has nonempty intersection, and the intersection is a single point exactly when the lengths tend to , Intervals of : the nine order-convex forms, nondegeneracy, and length, Limits and Cauchy sequences of reals).
Null geometric sequences: implies ; and a constant multiple of a null sequence is null, while a constant sequence converges to that constant (For the sequence is null, and for the sequence diverges to , Algebra of limits: sums, scalar multiples, products and quotients, Integer powers , Sequences of reals: bounded, eventually, frequently, tails, subsequences).
Powers: for every (Laws of integer exponents, Integer powers ).
Sequential criterion, the choice-free direction: if is continuous at and with , then ( is continuous at if and only if for every sequence in converging to , the converse direction costing countable choice, Continuity of at a point of and on : the - condition, its agreement with at a limit point, and continuity at an isolated point).
Limits preserve non-strict inequalities (Limits preserve non-strict inequalities).
Order and field arithmetic in : trichotomy and totality, so exactly one of and holds; halving and the ordered-field identities (Ordered field, Complete ordered field (least-upper-bound property)); and whenever (Basic properties of the absolute value).
Proof
Reduction. It is enough to prove the theorem under the hypothesis . Indeed, in the remaining case , put and ; then is continuous on by [L1] and , so a point with is a point with .
The bisection map. Assume and put so . For write , which satisfies and so lies in , and define By trichotomy exactly one clause applies, so is a function on ; and in both clauses, since in the first and in the second . The left half is tested first and the right half is taken only when the left is excluded, so nothing is selected.
The nested sequence. By [L2] applied to , the element and the map , there is a unique with and . Write and . Then for every : and , because ; and , since in either clause of the definition of the new endpoints lie in and the new interval is or with .
The lengths. In both clauses the new length is or , so ; with an induction on gives for every , that is by [L5]. Since , [L4] gives and hence .
The point. By [L3] applied to the nested family , whose lengths tend to by step 3.1, the intersection is a single point; call it . Then and for every .
The endpoints converge to . Let a rational be given. By step 3.1 there is with for all . For such , from we get and , so and by [L8]. Hence and .
Passing to the limit. The point lies in , so is continuous at , and [L6] applied to the two sequences of step 5.1 gives and .
By step 2.1, for every ; the constant sequence with value converges to by [L4], so [L7] gives . Likewise for every gives . Hence .
A point with has therefore been constructed, under the reduction of step 1.1 and hence in both cases of the hypothesis.
Remarks
-
Why the left half is tested first. The bisection has to choose one of two halves at every stage, and if the rule were "choose a half in which the sign change persists" the construction would be a dependent choice, not a recursion. Testing and taking the left half in that case makes the successor a function of its predecessor, so The recursion theorem applies verbatim. The same device is used in Every nonempty perfect subset of is uncountable and in the bisection proof of Heine-Borel.
-
What the theorem does not say. It does not say that is unique, and it does not say that the set of solutions is an interval; may take the value on a complicated set. It also does not say that a function with the intermediate value property is continuous — that converse is false, and the witness for it needs machinery that is not available at this point in the reading order.
-
Only the choice-free direction of the sequential criterion is used. Step 6.1 turns a convergent sequence into a convergent image sequence, which is the implication proved in ZF ( is continuous at if and only if for every sequence in converging to , the converse direction costing countable choice); the converse, which spends countable choice, is never invoked here.
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
Statement
Let , let be 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 let be order-convex (Intervals of : the nine order-convex forms, nondegeneracy, and length). Then:
- is order-convex, hence connected (A subset of is connected if and only if it is order-convex, that is, an interval, Separated sets, disconnection, and connected subset of );
- if with , then where and (Maximum and minimum of a set) — a closed bounded interval, degenerate exactly when is constant on .
"Interval" means "order-convex" here. As A subset of is connected if and only if it is order-convex, that is, an interval records, this library proves that the connected subsets of are exactly the order-convex ones, and does not prove that every order-convex subset is one of the nine written forms of Intervals of : the nine order-convex forms, nondegeneracy, and length. Claim 1 is therefore stated as order-convexity, which is what the intermediate value theorem delivers; claim 2 identifies the written form in the one case where the extreme value theorem supplies the endpoints.
Facts & Assumptions
Given: A set , a function continuous on , and an order-convex set .
Intermediate value theorem: if in , if is continuous on and if lies between and in either order, then for some (Intermediate value theorem, by bisection with a canonical left-half rule: a continuous function on takes every value between and ).
Continuity passes to subsets of the domain: if then is continuous on , since the defining condition quantifies over fewer points (Continuity of at a point of and on : the - condition, its agreement with at a limit point, and continuity at an isolated point).
Order-convexity: and imply ; every closed bounded interval with is order-convex and is a subset of any order-convex set containing and (Intervals of : the nine order-convex forms, nondegeneracy, and length).
Connectedness: a subset of is connected if and only if it is order-convex (A subset of is connected if and only if it is order-convex, that is, an interval, Separated sets, disconnection, and connected subset of ).
with is nonempty, closed and bounded (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), hence compact (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).
Extreme value theorem: a continuous real function on a nonempty compact subset of attains a greatest and a least value on it (Extreme value theorem: a continuous real function on a nonempty compact subset of attains a greatest and a least value, Maximum and minimum of a set).
Proof
Claim 1. Let and let satisfy . Write and with , and let be the closed bounded interval with and ; by [L3] and order-convexity of we have .
Claim 2, the endpoints. Suppose with . By [L5] the set is nonempty and compact, so by [L6] there are with for every ; put and , so and and .
By [L2] the restriction of to is continuous on , and lies between and in one order or the other, since and . By [L1] there is with , so .
So is order-convex, and by [L4] it is connected. This is claim 1.
Claim 2, the two inclusions. Every satisfies by step 1.2, so . Conversely, and lie in and is order-convex by step 3.1, so every with lies in ; hence . Therefore , a closed bounded interval, and it is the single point exactly when , that is exactly when is constant on .
Remarks
-
The two halves come from the two theorems. Order-convexity of the image is the intermediate value theorem and needs nothing else; that the image of a closed bounded interval is again closed and bounded is the extreme value theorem, and it fails for other interval forms: the continuous image of under is , and under it is , neither closed.
-
The converse of claim 1 is false. A function whose image on every subinterval is order-convex need not be continuous; this is the intermediate value property without continuity, and the witness for it is not available at this point in the reading order. What is true, and is proved on this page, is that a function which is monotone and has an order-convex image is continuous (A function on an interval satisfying whenever , whose image is order-convex, is continuous).
-
Claim 2 is the shape the -th-root example uses. Applying it to on gives an interval containing and , hence containing ; that is the second proof of the existence of -th roots recorded in The intermediate value theorem gives a second proof that every nonnegative real has an -th root, applied to on a closed bounded interval ↗ on the companion page.
Every continuous map of a closed bounded interval into itself has a fixed point
Statement
Let with and let be 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, Intervals of : the nine order-convex forms, nondegeneracy, and length) with
Then has a fixed point: there is with .
This is the one-dimensional case of Brouwer's theorem, and here it is elementary. The whole content is that is at the left endpoint and at the right, so the intermediate value theorem produces a zero. Nothing about contraction, and no metric hypothesis, is needed: the map is not assumed to shrink distances, and the fixed point need not be unique.
Both hypotheses on the interval are used. The interval must be closed, or the fixed point can escape through an endpoint; and it must be bounded, or there need be no fixed point at all, as on shows.
Facts & Assumptions
Given: Reals and a continuous with for every .
Sums, scalar multiples and the identity: the identity is continuous on , and a sum of two functions continuous on is continuous on , as is a scalar multiple (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).
Intermediate value theorem: if is continuous on with and lies between and in either order, then for some (Intermediate value theorem, by bisection with a canonical left-half rule: a continuous function on takes every value between and ).
Membership in means (Intervals of : the nine order-convex forms, nondegeneracy, and length).
Ordered-field arithmetic in : adding and subtracting preserves order, and exactly when (Ordered field, Complete ordered field (least-upper-bound property)).
Proof
Define by . By [L1] the function is continuous on , being the sum of and times the identity.
By hypothesis , so and hence by [L4]. Likewise gives and hence .
So : the value lies between and . By [L2], applied to on with , there is with .
Then , that is , with : the map has a fixed point.
Remarks
-
Uniqueness is not claimed and is false in general. The identity map of into itself is continuous and fixes every point. What forces uniqueness is a contraction hypothesis, which is the setting of the Banach fixed point theorem in a complete metric space; that theorem also produces the fixed point as a limit of iterates, whereas the argument above only asserts that one exists.
-
The interval may not be replaced by an arbitrary compact set. The map carries the compact set into itself, is continuous, and fixes nothing. Order-convexity, not compactness alone, is what the intermediate value theorem needs.
-
A worked instance is A worked fixed point on for the map , from the one-dimensional fixed point theorem ↗ on the companion page, where maps into itself and its unique fixed point is .
A function on an interval satisfying whenever , whose image is order-convex, is continuous
Statement
Let be order-convex (Intervals of : the nine order-convex forms, nondegeneracy, and length) and let satisfy
If the image is order-convex, 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).
No definition of a monotone function is used, and none is available at this point in the reading order. The hypothesis is written out as the displayed inequality; the classification of monotone functions and their discontinuities comes later in the library. Equivalently, by A subset of is connected if and only if it is order-convex, that is, an interval, the hypothesis on the image is that is connected (Separated sets, disconnection, and connected subset of ).
The hypothesis on the image cannot be dropped. Define on by for and . It satisfies the displayed inequality, its image is , which is not order-convex, and it is not continuous at : no works for , since points of arbitrarily close to have values close to , at distance close to from .
This is a genuine converse to the intermediate value property, in the presence of the inequality. It does not need one-sided limits of monotone functions, which are not available at this point in the reading order; the entire proof is the two paragraphs below, which read the required off the image.
Facts & Assumptions
Given: An order-convex set and a function with whenever and , such that is order-convex; and a point together with a real .
Continuity of at : for every real there is a real with for every satisfying (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 ).
Order-convexity of : if and then (Intervals of : the nine order-convex forms, nondegeneracy, and length); equivalently is connected (A subset of is connected if and only if it is order-convex, that is, an interval, Separated sets, disconnection, and connected subset of ).
Order and field arithmetic in : trichotomy and totality of the order, so any two reals are comparable and exactly one of , , holds; gives and (Ordered field).
The minimum of a two-element set of reals exists and is one of the two elements (Every nonempty finite set of reals has a maximum and a minimum, Maximum and minimum of a set).
Absolute value: for , holds exactly when (Basic properties of the absolute value).
Proof
A point of below with a value close to , when one exists at all. Suppose some has . We claim there is with and . If there were none, then for every with , and in particular . Put , so by [L3]. Since , [L2] gives with . By [L3] exactly one of , , holds: the first gives , the second gives , and the third gives by the monotonicity hypothesis; each contradicts . So the claimed exists.
The left radius. If some has , fix as in step 1.1 and put ; then every with satisfies , hence by monotonicity, hence . If no point of lies below , put ; then the only with is , for which holds as well. In both cases and every with satisfies .
The right radius, symmetrically. Suppose some has . If every with had , then with we would have , so [L2] would give with ; but by [L3] exactly one of , , holds, and the first gives , the second gives , and the third gives by the monotonicity hypothesis, each contradicting . So there is with and ; put . If no point of lies above , put . In both cases and every with satisfies .
Combining. Put , which is a positive real by [L4]. Let with , so by [L5]. By totality either , and then , so step 2.1 gives ; or , and then , so step 2.2 gives . In either case , that is by [L5].
The point and the real were arbitrary, so by [L1] the function is continuous at every point of , that is, continuous on .
Remarks
-
Where order-convexity of the image is used, and where it is not. It is used exactly twice, in steps 1.1 and 2.2, each time to convert a value strictly between two attained values into an attained value. Nothing else in the argument looks at the image. In particular, no continuity of is assumed anywhere, which is what makes the lemma a converse rather than a reformulation.
-
The endpoint cases are not a technicality. If is the left endpoint of there is no point of below it, and the left half of the estimate is vacuous; the same at the right. Handling them by the fixed radius keeps the proof free of any hypothesis that be open or nondegenerate.
-
What this lemma is for. It is the standard route to continuity of a function defined by a monotone construction whose image is known independently — the Cantor function is the classical instance, its image being all of — and it is stated here as a standalone lemma so that a later page may cite it rather than repeat the argument.
Uniform continuity of : one serving every pair of points of
Definition
Let and let . Then is uniformly continuous on when
with and ranging over the positive reals.
The whole content is in the order of the quantifiers. Written out, continuity on (Continuity of at a point of and on : the - condition, its agreement with at a limit point, and continuity at an isolated point) is
and uniform continuity is
Moving to the left of the point quantifier is the entire difference: for continuity the radius may shrink from point to point, for uniform continuity one radius must serve the whole of at once. This is the same distinction, for the same reason, that Uniform continuity of a map of metric spaces: one serving every point draws for maps of metric spaces.
Uniform continuity implies continuity. Given , take the supplied by uniform continuity and, at a point , apply the condition with : every with satisfies . So the same witnesses continuity at every point of simultaneously. The converse fails, and the failure is not marginal: FALSE: every continuous real function is uniformly continuous on its domain refutes it on this page, and the companion page works two witnesses out in full.
Uniform continuity is a property of the pair , not of alone. The same formula may be uniformly continuous on one set and not on another: is uniformly continuous on and not on , and is uniformly continuous on every bounded interval and not on . Restricting the domain therefore never destroys uniform continuity, since the condition then quantifies over fewer pairs; enlarging it may.
The two points are unordered and may coincide. Nothing above excludes , at which the implication reads (Basic properties of the absolute value) and is automatic, and the condition is symmetric in the two points because .
Remarks
-
A single , and a picture. For a uniformly continuous one may slide a rectangle of width and height along the graph and never have the graph leave it through the top or bottom. For a merely continuous the rectangle must be narrowed as one moves, and on over it must be narrowed without limit.
-
Neighbourhood form. The condition says for every , with one (The -neighbourhood and the punctured -neighbourhood of a point of ). That is continuity on with the radius independent of the centre.
-
On an interval this is the notion the extension theorem needs. A uniformly continuous function on a set extends to one on the closure of (A uniformly continuous real function on a subset extends uniquely to a uniformly continuous function on the closure of ); mere continuity does not suffice, since on has no continuous extension to (Intervals of : the nine order-convex forms, nondegeneracy, and length).
-
The two standard witnesses, for orientation. The converse fails in two independent ways, each worked out on the companion page: is continuous on and not uniformly continuous there, the pairs and defeating every ↗ on a bounded domain that is not closed, and is continuous on and not uniformly continuous, the pairs and defeating every ↗ on a closed domain that is not bounded. Both are named here for orientation only; nothing in this definition rests on them.
-
Lipschitz and Hölder conditions are stronger still, and are not redefined here. They are Lipschitz map, -Hölder map for rational , and contraction instantiated at with ; the dictionary that makes that instantiation legitimate, and that transports the implications of 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 to real functions, is 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, immediately below.
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
Statement
Let carry the subspace metric of the usual metric of , that is for (The absolute value makes a metric space: is a metric, its open balls are the intervals , and it is unbounded, Isometry, isometric embedding, and the subspace metric on a subset), and let , regarded also as a map of metric spaces . Then the -native notions of this page and the metric-space notions of the earlier pages are the same notions, in the following five senses.
- Continuity. For every : is continuous at in the sense of Continuity of at a point of and on : the - condition, its agreement with at a limit point, and continuity at an isolated point if and only if is continuous at in the sense of Continuity of a map between metric spaces, at a point and globally, in the - form. Consequently is continuous on if and only if it is continuous as a map of metric spaces.
- Uniform continuity. is uniformly continuous on in the sense of Uniform continuity of : one serving every pair of points of if and only if it is uniformly continuous as a map of metric spaces (Uniform continuity of a map of metric spaces: one serving every point).
- Lipschitz. For a real : is Lipschitz with constant as a map of metric spaces (Lipschitz map, -Hölder map for rational , and contraction) if and only if This displayed condition is what " is Lipschitz with constant " means for a real function on in this library; no second definition is made.
- Hölder. For a rational with and a real : is -Hölder with constant as a map of metric spaces if and only if the power being the rational power of a nonnegative base (Rational powers of a positive base).
- Compactness, in both senses used in this library. For with the subspace metric :
- is compact in the open-cover sense of Open cover, subcover, compact subset of (every open cover has a finite subcover), and sequentially compact subset — every family of open subsets of covering has a finite subfamily covering — if and only if the metric space is compact (Open cover, subcover, compact metric space, and compact subset of a metric space);
- is sequentially compact in the sense of Open cover, subcover, compact subset of (every open cover has a finite subcover), and sequentially compact subset if and only if is sequentially compact as a metric space (Countably compact, sequentially compact and limit point compact metric spaces).
Two consequences are recorded, since they are the reason the dictionary is stated as a lemma rather than as a remark.
- The regularity hierarchy transfers verbatim. By clauses 1 to 4 and 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: a Lipschitz is uniformly continuous on ; an -Hölder with rational is uniformly continuous on ; a uniformly continuous is continuous on ; and if is nonempty and bounded, a Lipschitz is -Hölder for every rational with . No strictness is claimed here, and none is claimed there.
- Cauchy sequences transfer. A sequence with terms in is Cauchy in (Cauchy sequence in a metric space) if and only if it is Cauchy as a sequence of reals (Limits and Cauchy sequences of reals); so by clause 2 and A uniformly continuous map sends Cauchy sequences to Cauchy sequences, a uniformly continuous carries Cauchy sequences of to Cauchy sequences of .
Why this lemma exists, and why it is a lemma. Three results of this page — The image of a compact subset of under a continuous real function is compact, Extreme value theorem: a continuous real function on a nonempty compact subset of attains a greatest and a least value and Heine-Cantor in : a continuous real function on a compact subset of is uniformly continuous, proved -natively from sequential compactness — are stated a second time here, having already been proved metric-generally as The image of a compact metric space under a continuous map is compact, and so is the image of any compact subset, A continuous real-valued function on a nonempty compact metric space is bounded and attains a greatest and a least value and Heine-Cantor: a continuous map from a compact metric space to any metric space is uniformly continuous. The duplication is deliberate: the -native proofs run through A subset of is compact if and only if it is closed and bounded and A subset of is compact iff it is sequentially compact, which are order-based, while the metric proofs run through the cover machinery of metric spaces. This item is the single place in the library where that duplication is acknowledged, and clauses 1 and 5 are what make the two families of statements literally the same statements. It is a lemma, and not a remark, precisely so that later pages can cite it and move between the two vocabularies.
Clause 5 closes a second seam. The phrase compact subset of is defined twice in this library — metrically, as compactness of the metric subspace (Open cover, subcover, compact metric space, and compact subset of a metric space), and -natively, by covers by open subsets of (Open cover, subcover, compact subset of (every open cover has a finite subcover), and sequentially compact subset) — and until this clause no item asserted that the two agree.
Facts & Assumptions
Given: A set with the subspace metric , a function , and a set with the subspace metric .
The usual metric: is a metric on ; its open balls are the intervals ; and a set is open in the metric topology of exactly when it is open in the sense of Open subset of (every point has a neighbourhood inside it), closed subset (complement open), and clopen (The absolute value makes a metric space: is a metric, its open balls are the intervals , and it is unbounded, Metric space: iff , symmetry, and the triangle inequality; pseudometric and ultrametric, Open ball, closed ball and sphere in a metric space, The metric topology: a set is open when every one of its points has a ball around it inside the set; closed means open complement).
Subspace metric: for the restriction of to is a metric on , so for (Isometry, isometric embedding, and the subspace metric on a subset).
Metric continuity at : for every real there is a real such that every with satisfies (Continuity of a map between metric spaces, at a point and globally, in the - form).
Metric uniform continuity: for every real there is a real such that all with satisfy (Uniform continuity of a map of metric spaces: one serving every point).
Continuity and uniform continuity of a real function on , in the forms of Continuity of at a point of and on : the - condition, its agreement with at a limit point, and continuity at an isolated point and Uniform continuity of : one serving every pair of points of .
Lipschitz and Hölder for a map of metric spaces: , respectively for a rational with , the power being that of Rational powers of a positive base with the convention (Lipschitz map, -Hölder map for rational , and contraction).
The regularity hierarchy for maps of metric spaces: Lipschitz implies uniformly continuous, uniformly continuous implies continuous, -Hölder implies uniformly continuous, and on a nonempty bounded space Lipschitz implies -Hölder for every rational (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).
Intrinsic character of compactness: a subset of a metric space is a compact metric space in its own right, with the subspace metric, exactly when every family of open subsets of whose union contains has a finite subfamily whose union contains (A subset of a metric space is open in the subspace metric exactly when it is the trace of an open set of the ambient space, and it is compact as a metric space in its own right exactly when every family of open subsets of the ambient space covering it, indexed or not, has finitely many members covering it, Open cover, subcover, compact metric space, and compact subset of a metric space).
Compactness and sequential compactness of in the -native sense (Open cover, subcover, compact subset of (every open cover has a finite subcover), and sequentially compact subset), and sequential compactness of a metric space (Countably compact, sequentially compact and limit point compact metric spaces).
Metric convergence: in means in (Convergence of a sequence in a metric space: iff in ); convergence and the Cauchy condition for real sequences are those of Limits and Cauchy sequences of reals and Sequences of reals: bounded, eventually, frequently, tails, subsequences; a metric is nonnegative (Nonnegativity of a metric is a consequence of the other axioms, not an axiom); and with (Basic properties of the absolute value).
Cauchy in a metric space: is Cauchy in when for every rational there is with for all (Cauchy sequence in a metric space).
A uniformly continuous map of metric spaces sends Cauchy sequences to Cauchy sequences (A uniformly continuous map sends Cauchy sequences to Cauchy sequences).
Proof
The two distances are the two absolute values. By [L1] and [L2], for we have , and for we have ; in particular .
Clause 5, the cover half. Take the ambient metric space to be and with . By [L8], is a compact metric space exactly when every family of sets open in whose union contains has a finite subfamily whose union contains . By [L1] the sets open in are exactly the open subsets of in the sense of Open subset of (every point has a neighbourhood inside it), closed subset (complement open), and clopen. So the displayed condition is word for word the definition of compactness of in [L9].
Clause 1. Fix . Substituting the identities of step 1.1 into [L3], with , and , turns metric continuity at into: for every real there is a real such that every with satisfies . That is verbatim the condition of [L5] defining continuity of at in the sense of Continuity of at a point of and on : the - condition, its agreement with at a limit point, and continuity at an isolated point. The two conditions are therefore the same condition, and each holds at every point of exactly when the other does.
Clause 2. The same substitution in [L4] turns metric uniform continuity into: for every real there is a real such that all with satisfy , which is verbatim Uniform continuity of : one serving every pair of points of as recorded in [L5].
Clauses 3 and 4. The same substitution in [L6] turns the Lipschitz condition into for all , and the -Hölder condition into , the power being that of Rational powers of a positive base and defined at by the convention recorded in [L6]. Since this library gives no other definition of the two conditions for a real function on , the displayed inequalities are what those words mean here.
Clause 5, the sequential half: convergence first. Let be a sequence with terms in and let . By [L10] and step 1.1, convergence of to in says in ; and says that for every rational there is with for , which is verbatim the statement of [L10]. So the two convergences are the same relation.
Clause 5, the sequential half. A sequence in is exactly a sequence of reals with all terms in , and by step 2.4 a subsequence of it converges to a point of in exactly when it converges to that point in . Hence "every sequence in has a subsequence converging in to a point of " and "every sequence of reals with terms in has a subsequence converging in to a point of " are the same statement, which is the assertion of [L9] and Countably compact, sequentially compact and limit point compact metric spaces.
Clause 6. By clauses 1 to 4, the four -native conditions are the corresponding metric conditions for the map , so the implications of [L7] hold between them verbatim; the boundedness hypothesis in the last of them is boundedness of the metric space , which for is boundedness of as a set of reals, since .
Clause 7. By step 1.1 and [L11], a sequence with terms in is Cauchy in exactly when for every rational there is with for all , which is verbatim the Cauchy condition of [L10] for a sequence of reals. Combining this with clause 2 and [L12] gives that a uniformly continuous carries Cauchy sequences of to Cauchy sequences of reals.
Clauses 1 to 7 are proved, each by rewriting one definition into the other along the identity or, for clause 5, along [L8] and the agreement of the two notions of open subset of .
Remarks
-
Nothing here is a new theorem, and that is the point. Every clause is an identification of two forms of words, and the only clause with any content beyond substitution is 5, which needs A subset of a metric space is open in the subspace metric exactly when it is the trace of an open set of the ambient space, and it is compact as a metric space in its own right exactly when every family of open subsets of the ambient space covering it, indexed or not, has finitely many members covering it to move between covers by relatively open sets and covers by open subsets of , and needs The absolute value makes a metric space: is a metric, its open balls are the intervals , and it is unbounded to know that the metric topology of is the topology of Open subset of (every point has a neighbourhood inside it), closed subset (complement open), and clopen. A reader who takes those two identifications for granted is taking for granted exactly what this library refuses to leave unsaid.
-
The hierarchy of clause 6 is not strict by fiat, and the witnesses live on the companion page. 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 the four implications and claims no converse. That none of them reverses for real functions is witnessed here: On the function is -Hölder and is -Hölder for no rational , so the Hölder classes are strictly nested ↗ gives, for rationals , a function on that is -Hölder and not -Hölder, and in particular () is uniformly continuous and not Lipschitz; and is continuous on and not uniformly continuous there, the pairs and defeating every ↗ gives a continuous function that is not uniformly continuous. Those two items are links, not dependencies: they are examples on the companion page, and nothing on this page rests on them.
-
What the dictionary does not say. It does not say that the two proofs of a duplicated theorem are the same proof, and they are not: the -native ones use the order of and spend no choice beyond what is named in each item, while the metric ones use covers and, where the equivalence of the compactness variants is invoked, countable or dependent choice. What the dictionary establishes is that the two statements coincide, so that a later page may use whichever proof it prefers and cite whichever form it needs.
Heine-Cantor in : a continuous real function on a compact subset of is uniformly continuous, proved -natively from sequential compactness
Statement
Let be compact (Open cover, subcover, compact subset of (every open cover has a finite subcover), and sequentially compact subset) and let be 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). Then is uniformly continuous on (Uniform continuity of : one serving every pair of points of ).
This theorem is stated twice in this library, on purpose. Its metric-space twin is Heine-Cantor: a continuous map from a compact metric space to any metric space is uniformly continuous, proved there from the cover machinery of metric spaces; the proof below is -native and runs through A subset of is compact iff it is sequentially compact, which is order-based. That the two statements are the same statement in two vocabularies is 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, 2 and 5, immediately above.
The choice cost, named. The proof invokes the axiom of countable choice (The Axiom of Countable Choice ()) exactly once, at step 3.1, to select one bad pair of points from each of countably many nonempty sets. The backward implication of A subset of is compact iff it is sequentially compact also spends countable choice, and that item names its own uses; the forward implication used here, from compact to sequentially compact, does not. No claim is made that the axiom is necessary for either.
Facts & Assumptions
Given: A compact set and a function continuous on .
Uniform continuity on : for every real there is a real such that all with satisfy . Its negation: there is a real such that for every real some pair has and (Uniform continuity of : one serving every pair of points of , Ordered field).
A compact subset of is sequentially compact: every sequence with all terms in has a subsequence converging to a point of (A subset of is compact iff it is sequentially compact, Open cover, subcover, compact subset of (every open cover has a finite subcover), and sequentially compact subset, Sequences of reals: bounded, eventually, frequently, tails, subsequences, Limits and Cauchy sequences of reals).
Countable choice: for a family of nonempty sets there is a function on picking an element of each (The Axiom of Countable Choice ()).
A strictly increasing index map satisfies (A strictly increasing index map satisfies , Sequences of reals: bounded, eventually, frequently, tails, subsequences).
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).
Sequential criterion, the choice-free direction: if is continuous at and has terms in with , then ( is continuous at if and only if for every sequence in converging to , the converse direction costing countable choice, Continuity of at a point of and on : the - condition, its agreement with at a limit point, and continuity at an isolated point).
Triangle inequality and absolute value: , , (The triangle inequality, Basic properties of the absolute value).
Convergence of real sequences is tested at rational , and below every positive real lies a positive rational, so the test may equally be run at every real (Limits and Cauchy sequences of reals, The rationals embed densely in the reals).
Proof
Suppose is not uniformly continuous on . By [L1] fix a real such that for every real there are with and .
For put . Since , step 1.1 makes every nonempty.
By [L3] applied to the family fix a function with for every . This is the single use of countable choice in this proof.
is a sequence of reals with all terms in , so by [L2] there are a strictly increasing and with .
The second sequence converges to as well. Let a rational be given. By [L5] and [L8] fix with for every , and by step 4.1 fix with for every . For , using and from [L4], we get , hence by [L7]. So .
The point lies in and is continuous at , so [L6] applied to the two sequences of steps 4.1 and 5.1, both with terms in , gives and .
By [L8] fix a rational with , and by step 6.1 fix with and for every . For such , [L7] gives .
But gives for every , which contradicts step 7.1. The assumption of step 1.1 is therefore false, and is uniformly continuous on .
Remarks
-
Where compactness is used, and where continuity is used. Compactness is used once, in step 4.1, to extract a convergent subsequence; continuity is used once, in step 6.1, at the single point that the extraction produces. Neither can be weakened: on is continuous on a bounded non-closed set and not uniformly continuous ( is continuous on and not uniformly continuous there, the pairs and defeating every ↗), and on is continuous on a closed unbounded set and not uniformly continuous ( is continuous on and not uniformly continuous, the pairs and defeating every ↗).
-
The converse is sharp. For every noncompact that is bounded there is a continuous function on that is not uniformly continuous, and for every noncompact there is an unbounded continuous function and a bounded continuous one with no greatest value. That is 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, later on this page, and together with this theorem it says that compactness is exactly the hypothesis these results need.
-
The pairs, not the points, are what is chosen. A common presentation selects two sequences separately and then extracts twice. Selecting the pair once, as above, keeps the count of choice applications at one and makes the second sequence's convergence a consequence rather than a second extraction.
A uniformly continuous real function on a subset extends uniquely to a uniformly continuous function on the closure of
Statement
Let be nonempty and let be uniformly continuous on (Uniform continuity of : one serving every pair of points of ). Write for the closure of in (Interior, closure, boundary and exterior of a subset of ). Then:
- there is a uniformly continuous with for every ;
- is the only continuous function extending (Continuity of at a point of and on : the - condition, its agreement with at a limit point, and continuity at an isolated point).
Uniform continuity is what is needed, and continuity is not enough. The function is continuous on , whose closure is , and no continuous extends it, since a continuous function on the compact set is bounded (A continuous real function on a compact subset of is bounded) while is not bounded on . By this corollary, is therefore not uniformly continuous on .
This is the metric extension theorem, read through the dictionary. The work is done by A uniformly continuous map from a dense subspace into a complete metric space extends uniquely to a uniformly continuous map on the whole space, applied to the metric space with the subspace metric, its dense subset , and the complete target ( and for with the Euclidean metric are complete, componentwise from the Cauchy criterion in ); 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 translates the hypothesis and the conclusion between the two vocabularies. The extension is constructed there and not selected, so no choice principle enters through it.
Why later pages need exactly this. The exponential and the power functions are defined on first and then extended to , and the extension step is this corollary with the rationals of an interval; that is the use for which it is stated here rather than inside an example.
Facts & Assumptions
Given: A nonempty set and a function uniformly continuous on ; with the subspace metric of .
The usual metric of , its subspace metrics, and its open balls (The absolute value makes a metric space: is a metric, its open balls are the intervals , and it is unbounded, Isometry, isometric embedding, and the subspace metric on a subset, Open ball, closed ball and sphere in a metric space, Metric space: iff , symmetry, and the triangle inequality; pseudometric and ultrametric, The -neighbourhood and the punctured -neighbourhood of a point of ).
Closure in : exactly when for 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).
Density in a metric space: is dense in when every point of is adherent to , that is when every ball of around a point of meets (Interior, closure, boundary, limit point, isolated point and dense subset of a metric space).
Extension theorem: if is dense in a metric space , if is complete and if is uniformly continuous, then there is a uniformly continuous with , and is the only continuous map extending (A uniformly continuous map from a dense subspace into a complete metric space extends uniquely to a uniformly continuous map on the whole space, Uniform continuity of a map of metric spaces: one serving every point, Continuity of a map between metric spaces, at a point and globally, in the - form).
Dictionary: for with the subspace metric, continuity and uniform continuity of a function in the senses of Continuity of at a point of and on : the - condition, its agreement with at a limit point, and continuity at an isolated point and Uniform continuity of : one serving every pair of points of coincide with the metric-space senses (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 and 2).
Proof
Put with the subspace metric , so for ; then , and the subspace metric that inherits from is again , the same one it inherits from . is nonempty, since is and .
is dense in the metric space . Let and let be real. By [L2] there is , and , so lies in the ball of ([L1]) and in . Hence every ball of around a point of meets , which by [L3] says is dense in .
Transport of the hypothesis. By [L6], applied to , the uniform continuity of on in the sense of Uniform continuity of : one serving every pair of points of is uniform continuity of as a map of metric spaces.
By [L4] the target is complete, so [L5] applies with , this , and : there is a uniformly continuous with for every , and is the only continuous map extending .
Transport of the conclusion. By [L6], applied to , uniform continuity of as a map of metric spaces is uniform continuity of on in the sense of Uniform continuity of : one serving every pair of points of , and continuity as a map of metric spaces is continuity on in the sense of Continuity of at a point of and on : the - condition, its agreement with at a limit point, and continuity at an isolated point. So is uniformly continuous on , extends , and is the unique continuous extension of to : claims 1 and 2.
Remarks
-
Uniqueness needs only continuity, and it needs density. Two continuous functions on agreeing on agree everywhere, because is dense; that is the uniqueness half of A uniformly continuous map from a dense subspace into a complete metric space extends uniquely to a uniformly continuous map on the whole space and it is why claim 2 quantifies over continuous extensions rather than over uniformly continuous ones. On a set where is not dense the conclusion is simply false: any values may be assigned off .
-
The extension is uniformly continuous, not merely continuous, and with the same modulus in the following sense: any that works for on and a given works for on and any . That refinement is not asserted here; what is asserted is what A uniformly continuous map from a dense subspace into a complete metric space extends uniquely to a uniformly continuous map on the whole space proves.
-
The same conclusion, reached directly. That is not uniformly continuous on is proved on the companion page by exhibiting the pairs of points that defeat every ( is continuous on and not uniformly continuous there, the pairs and defeating every ↗); that item is named here for orientation only, and nothing in this corollary rests on it.
-
A special case worth naming. If is already closed then (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) and the corollary says nothing. Its content is entirely about the points of , which is where the values have to be created.
If on an interval for some rational then is constant
Statement
Let be order-convex (Intervals of : the nine order-convex forms, nondegeneracy, and length), let , let with , and let with (Order on the rationals). Suppose
the power being the rational power of a nonnegative base (Rational powers of a positive base, with the convention for ). Then is constant on : for all .
The hypothesis is written out, and not expressed through Lipschitz map, -Hölder map for rational , and contraction, because it cannot be. That definition introduces the -Hölder condition for rational with only, and says explicitly that no claim is made about an exponent above . The displayed inequality is the natural extension of the formula to , and this theorem is what that extension is worth: for rational the same inequality is the -Hölder condition of Lipschitz map, -Hölder map for rational , and contraction instantiated at 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, and then it makes uniformly continuous, hence continuous (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, Continuity of at a point of and on : the - condition, its agreement with at a limit point, and continuity at an isolated point); above it makes constant, which is why the definition stops at .
Order-convexity is essential. On a domain that is not order-convex the conclusion fails: on the function , satisfies the inequality with and any , and is not constant. What the proof uses is that the whole segment between two points of lies in , so that the distance between them can be subdivided.
Facts & Assumptions
Given: An order-convex , a function , a real and a rational with for all . Natural numbers are identified with their canonical images in , as elsewhere in this library.
Order-convexity: with gives (Intervals of : the nine order-convex forms, nondegeneracy, and length).
Rational powers of a positive base: is defined for and , with and agreeing with the integer power; and for rational (Rational powers of a positive base, Existence and uniqueness of -th roots: a unique with , Integer powers ).
Laws of rational exponents for and : ; ; ; ; (Laws of rational exponents).
Monotonicity of rational powers: for and rationals one has ; and for rational and one has (Monotonicity of and of ).
Archimedean property: for every real there is a natural with ; and for every real there is a natural with (Every complete ordered field is Archimedean, For every in a complete ordered field there is a natural with ).
Reciprocals: implies , and implies (Inverses of positives are positive, and reciprocation reverses order).
Absolute value and ordered-field arithmetic: ; exactly when ; for ; the order is total; a real that is and smaller than every positive real is (Basic properties of the absolute value, Ordered field, Complete ordered field (least-upper-bound property)).
Proof
Normalisations. Since by [L2] and [L3], the hypothesis with the constant implies the same inequality with the constant ; so we may and do assume . Also, the hypothesis and the conclusion are symmetric in and and are trivial when , so it suffices to prove for with ; fix such a pair and put , a real with by [L3].
The exponent gap. Put , a rational with . By [L6] fix a natural with .
Subdividing. Let with and put and for . For one has , so by [L1]; and for . Define the sequence by , so that , , and for every .
The telescoped estimate. By [L5], , hence , the middle inequality being the hypothesis applied to the pair of points of and the last equality being the constant-sum rule of [L5].
The bound can be made arbitrarily small. Let a real be given and put . By [L6] fix a natural with ; then , since by [L3] and [L2]. By [L4] applied with the rational exponent to the bases , and by [L2] and [L3] which give , we get .
Rewriting the bound. By [L3], , and . Hence , and step 2.1 gives for every natural .
By [L4], : this is an equality if , since then both sides are by [L3], and it is the strict inequality of [L4] for the base and the exponents . Hence , so by [L7] and therefore .
Combining steps 3.1 and 3.2, . The real was arbitrary and , so by [L8], that is . Since in were arbitrary, and by the reduction of step 1.1, is constant on .
Remarks
-
The mechanism in one line. Splitting into equal pieces costs applications of the hypothesis, each of size , for a total of . For the factor is and the estimate says nothing new; for it grows and the estimate is useless; only for does it tend to , and then it forces the increment to vanish.
-
Why the vanishing of is proved rather than asserted. Neither real exponents nor a general theorem of the form is available at this point in the reading order, so the proof supplies the one rational instance it needs. The general real-power theory is developed later in Real powers for positive bases, with the zero-base positive-exponent convention ↗. Steps 2.2 and 3.2 supply the one instance that is needed, by reducing to the exponent with a natural number, where the -th root of Existence and uniqueness of -th roots: a unique with and the Archimedean property do the work.
-
The boundary case is exactly the Lipschitz condition, which does not force constancy: the identity is -Lipschitz and not constant. So the theorem is sharp at the endpoint of the range that Lipschitz map, -Hölder map for rational , and contraction admits, and the strict nesting of the classes below is witnessed on the companion page by On the function is -Hölder and is -Hölder for no rational , so the Hölder classes are strictly nested ↗.
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
Statement
Let be nonempty and not compact (Open cover, subcover, compact subset of (every open cover has a finite subcover), and sequentially compact subset). Then:
- there is a function , 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), that is unbounded on ;
- there is a function , continuous and bounded on , such that exists and is not attained; in particular has no greatest value on (Maximum and minimum of a set);
- if in addition is bounded (Lower bound, bounded below, bounded set), there is a function , continuous on , that is not uniformly continuous on (Uniform continuity of : one serving every pair of points of ).
Together with A continuous real function on a compact subset of is bounded, Extreme value theorem: a continuous real function on a nonempty compact subset of attains a greatest and a least value and Heine-Cantor in : a continuous real function on a compact subset of is uniformly continuous, proved -natively from sequential compactness this says that compactness is exactly the hypothesis those three theorems need: on a compact set every continuous function is bounded, attains its extrema and is uniformly continuous, and on a set that is not compact each of those three conclusions fails for some continuous function.
Claim 3 carries the boundedness hypothesis because it must. On an unbounded closed set every uniformly continuous function is still uniformly continuous, and a noncompact set may well carry only uniformly continuous functions of interest; what claim 3 asserts is the sharp statement for the bounded case, which is the case Heine-Cantor leaves open. The unbounded case is covered by claims 1 and 2, which hold with no extra hypothesis.
Every witness is exhibited, not merely asserted to exist. Four functions do the work: and when is unbounded, and and when is bounded, where is then a point of .
Facts & Assumptions
Given: A nonempty set that is not compact.
A subset of is compact if and only if it is closed and bounded; so is not closed or not bounded (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, Open subset of (every point has a neighbourhood inside it), closed subset (complement open), and clopen, Lower bound, bounded below, bounded set).
Boundedness: is bounded when there are reals with for every ; equivalently when there is a real with for every . So if is unbounded then for every real some has (Lower bound, bounded below, bounded set, Basic properties of the absolute value, Every nonempty finite set of reals has a maximum and a minimum, Maximum and minimum of a set).
Closure: is the set of points every neighbourhood of which meets , it contains , and is closed exactly when (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 , The -neighbourhood and the punctured -neighbourhood of a point of ).
Algebra of continuous functions: constants, the identity and polynomial functions are continuous on any subset of ; sums, scalar multiples, products and absolute values of continuous functions are continuous; and if is continuous on and for every , then is continuous on (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 ).
Suprema: a nonempty subset of bounded above has a least upper bound (Complete ordered field (least-upper-bound property)), and for every real admits with (Epsilon characterisation of the supremum).
Archimedean property in reciprocal form, reciprocals, and squares: for every real there is a natural with ; implies ; implies ; 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, Monotonicity of and of , Integer powers ).
Extension theorem: a uniformly continuous real function on a nonempty extends to a continuous function on (A uniformly continuous real function on a subset extends uniquely to a uniformly continuous function on the closure of , Uniform continuity of : one serving every pair of points of ).
Ordered-field arithmetic in : totality and trichotomy; exactly when ; for every real ; and the minimum of a two-element set of reals (Ordered field, Basic properties of the absolute value, Every nonempty finite set of reals has a maximum and a minimum, Maximum and minimum of a set, Intervals of : the nine order-convex forms, nondegeneracy, and length).
Proof
By [L1] the set is not closed or not bounded, and these two possibilities are exhaustive: if is bounded then it is not closed. The two cases below are treated separately, and claim 3 arises only in the second.
First case: is unbounded. Claim 1. Put , continuous on by [L4]. Given a real , [L2] supplies with , that is ; so is unbounded on .
First case, claim 2. Put . The denominator is a polynomial function, continuous by [L4], and satisfies by [L8], so is continuous on by [L4]; moreover , so for every and is bounded. Hence is nonempty and bounded above by , so exists by [L5] and .
First case: the supremum is and is not attained. Let a real be given and put . By [L2] there is with , so by [L6] and [L8], hence and by [L6], that is . So no real below is an upper bound of , and is one; therefore . Since for every by step 1.3, the value is not attained, and for each the number produces by [L5] some with , so has no greatest value.
Second case: is bounded, hence not closed. By [L3] we have and , so there is . Every neighbourhood of meets by [L3]; and for every , since , so there by [L8].
Second case, claim 1. Put for . The denominator is a polynomial function, continuous by [L4], and does not vanish on by step 2.2, so is continuous on by [L4]. Given a real , step 2.2 supplies with , and , so by [L6]. Hence is unbounded on .
Second case, claim 2. Put for , continuous on by [L4]. Since is bounded, [L2] gives a real with on , so and for every : is bounded, and is nonempty and bounded above by . For a real , step 2.2 supplies with , that is ; so by [L5], and it is not attained because everywhere on . As in step 2.1, therefore has no greatest value on .
Second case, claim 3. Put of step 3.1, continuous on . Suppose were uniformly continuous on . By [L7] there would be a continuous with for , and . Continuity of at with gives a real such that every with satisfies , hence , a real with . Put ; by step 2.2 there is with , and then gives by [L6], while with gives . That is impossible, so is not uniformly continuous on .
The two cases of step 1.1 are exhaustive, and in each of them claims 1 and 2 have been established by exhibiting the functions named, while claim 3, whose hypothesis places in the second case, is step 4.1.
Remarks
-
The bounded non-closed case is where all three failures happen at once. There is a hole in the domain, and blows up at it: it is unbounded, it is not uniformly continuous, and approaches its supremum without reaching it. The unbounded case needs a different witness for claim 2, because need not be bounded there, and is the standard substitute.
-
Claim 3 is proved through the extension theorem rather than through sequences. The textbook route takes a sequence in converging to , notes that it is Cauchy, and observes that a uniformly continuous function must carry it to a Cauchy, hence bounded, sequence. Producing that sequence from adherence spends countable choice (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). The argument above spends none: A uniformly continuous real function on a subset extends uniquely to a uniformly continuous function on the closure of constructs the extension without selecting anything, and the contradiction is then a single - estimate at the point .
-
What "not attained" means here, precisely. The supremum of exists as a real number and equals , and no point of has -value . That is stronger than saying has no maximum: it identifies the value the function fails to reach. The companion page works both witnesses out concretely in The identity on is bounded with no greatest value, and on it is continuous and unbounded ↗.
5 · Examples, counterexamples and false statements
FALSE: every continuous real function is uniformly continuous on its domain
Statement
False claim: if and 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), then is uniformly continuous on (Uniform continuity of : one serving every pair of points of ).
Why it is tempting. Continuity says that for every and every point there is a that works at . It is easy to read that as producing "a ", forgetting that the was produced after was fixed and may depend on it. Uniform continuity demands one 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 : a continuous real function on a compact subset of is uniformly continuous, proved -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 there is a continuous function on that is not uniformly continuous, which is 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 witness below is the smallest familiar instance of that theorem.
Facts & Assumptions
Given: The domain (Intervals of : the nine order-convex forms, nondegeneracy, and length) and the function , . Natural numbers are identified with their canonical images in .
Continuity on and uniform continuity on , in the forms of Continuity of at a point of and on : the - condition, its agreement with at a limit point, and continuity at an isolated point and Uniform continuity of : one serving every pair of points of ; in particular, fails to be uniformly continuous on as soon as some real admits, for every real , a pair with and .
Algebra of continuous functions: the identity is continuous on , and if is continuous on and does not vanish there then is continuous on (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).
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 in : for a natural , , so both lie in ; the product ; and with for (Ordered field, Basic properties of the absolute value, Integer powers ).
Refutation
is continuous on . The identity is continuous on by [L2] and does not vanish on , since for ; so is continuous on by [L2].
For put and . By [L4] both lie in , and , . Note that contains , so the smallest pair is and , and no index produces a point outside .
The gap between the arguments is , using and [L3]. The gap between the values is .
Take and let a real be given. By [L3] there is a natural with ; put , so and hence by [L3]. Then while .
So no serves : by [L1] the function is continuous on and not uniformly continuous on , and the claim is false.
Remarks
-
The domain is bounded, and that is the point. is bounded but not closed, hence not compact (A subset of is compact if and only if it is closed and bounded), so Heine-Cantor in : a continuous real function on a compact subset of is uniformly continuous, proved -natively from sequential compactness does not apply. The obstruction sits at the missing endpoint : the pairs above crowd towards it, their separation shrinking while the values they take diverge.
-
Unboundedness produces the same failure for a different reason. is continuous on the closed set and not uniformly continuous there, the pairs and defeating every ; that witness is is continuous on and not uniformly continuous, the pairs and defeating every ↗ on the companion page, and it shows that closedness alone is no more sufficient than boundedness alone.
-
The witness is worked out in full on the companion page. is continuous on and not uniformly continuous there, the pairs and defeating every ↗ repeats the computation above with the estimates spelled out and records what it witnesses about the regularity hierarchy 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.
FALSE: the image of a closed subset of under a continuous real function is closed
Statement
False claim: if , if 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 if is a closed subset of (Open subset of (every point has a neighbourhood inside it), closed subset (complement open), and clopen), then the image is a closed subset of .
Why it is tempting. Continuity is characterised by the behaviour of preimages: the preimage of every closed set is relatively closed ( is continuous on if and only if the preimage of every open subset of is the intersection with of an open subset of , and dually for closed sets). It is easy to transpose that to images, and images are exactly where the characterisation says nothing.
What is true. Compactness, not closedness, is preserved: the image of a compact set under a continuous function is compact (The image of a compact subset of under a continuous real function is compact), hence closed and bounded (A subset of is compact if and only if it is closed and bounded). Closedness by itself is preserved by neither images nor unions of infinitely many closed sets, and boundedness by itself is not preserved either, since carries the bounded set onto the unbounded set .
Facts & Assumptions
Given: The domain , the closed set , and the function , (Integer powers ).
is a closed subset of , since its complement is open (Open subset of (every point has a neighbourhood inside it), closed subset (complement open), and clopen).
Algebra of continuous functions: polynomial functions are continuous on , and if is continuous and nowhere zero on a set then is continuous there (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).
Squares and order: for every real , so ; and implies (Monotonicity of and of , Inverses of positives are positive, and reciprocation reverses order, Ordered field, Integer powers ).
Square roots: every real has a unique with (Existence and uniqueness of -th roots: a unique with ).
Closure: exactly when for every real ; and is closed exactly when (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 , Limit point, isolated point, adherent point, derived set, and dense subset of , The -neighbourhood and the punctured -neighbourhood of a point of ).
Intervals and minima: (Intervals of : the nine order-convex forms, nondegeneracy, and length); the minimum of a two-element set of reals exists and is one of them (Every nonempty finite set of reals has a maximum and a minimum, Maximum and minimum of a set); and with for (Basic properties of the absolute value).
Refutation
is a closed subset of and is contained in .
is continuous on : the denominator is a polynomial function, hence continuous by [L2], and it satisfies by [L3], so it never vanishes and is continuous by [L2].
. Let satisfy and put . By [L3] we have , so , and [L4] supplies a real with . Then and hence .
is not closed. Let a real be given and put , a real with by [L6], so ; and , so . Hence by [L5], while because is false. So and is not closed by [L5].
. For every real , [L3] gives and hence , that is .
So .
The set is closed, is continuous on , and is not closed: the claim is false.
Remarks
-
The witness is as tame as possible. is a quotient of polynomials, defined on the whole line, bounded, and its image is an interval; the failure is only that the infimum of the image is approached and not attained, because the points that would attain it have escaped to infinity. Replacing by any closed unbounded set on which has infimum , such as , gives the same conclusion.
-
The image of a closed bounded set is closed, because such a set is compact (A subset of is compact if and only if it is closed and bounded) and compactness is preserved (The image of a compact subset of under a continuous real function is compact). So the false claim becomes true exactly when the hypothesis is strengthened from closed to compact, which is what 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 uses in its second half.
-
Openness is not preserved either, in the other direction: the image of the open set under this same is , which is not open, and the image of under a constant function is a single point. Continuity constrains preimages, not images; that asymmetry is the content of is continuous on if and only if the preimage of every open subset of is the intersection with of an open subset of , and dually for closed sets.
FALSE: a continuous real function on a bounded domain attains a greatest value
Statement
False claim: if is nonempty and bounded (Lower bound, bounded below, bounded set) and 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), then attains a greatest value on : there is with for every (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 that is true. The hypothesis that actually does the work is compactness, which for a subset of is closed and bounded (A subset of 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 attains a greatest and a least value gives the conclusion on a nonempty compact domain, and the hypothesis cannot be weakened: for every noncompact there is a bounded continuous function on whose supremum is not attained, which is 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 witness below is that theorem's simplest instance.
Facts & Assumptions
Given: The domain (Intervals of : the nine order-convex forms, nondegeneracy, and length) and the function , .
is nonempty and bounded: , and for every (Lower bound, bounded below, bounded set, Intervals of : the nine order-convex forms, nondegeneracy, and length, Ordered field).
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 ; equivalently a maximum of lying in (Maximum and minimum of a set).
Ordered-field arithmetic in : for one has ; and (Ordered field).
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).
Refutation
is nonempty and bounded by [L1], and is continuous on by [L2], so the hypotheses of the claim are satisfied.
Let be arbitrary, so . Put ; by [L4] we have and , so and . Hence no satisfies for every , and by [L3] the function attains no greatest value on .
The claim is therefore false. Note also what the failure is not: is nonempty and bounded above by , so exists by [L5] and equals , since bounds and for every real the point lies in with . What fails is only that .
Remarks
-
The domain is bounded and not closed, and that is exactly the gap. The set is not closed and hence is not compact by 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. Adding the two endpoints repairs everything: on the same attains the value at the point .
-
Boundedness of the function is not the issue either. The witness above is bounded, so the failure is not a blow-up; it is the loss of the point at which the supremum would be attained. A function on the same domain that is unbounded, such as , fails the conclusion for the cruder reason that no upper bound exists at all, and both failures are catalogued together in The identity on is bounded with no greatest value, and on it is continuous and unbounded ↗ on the companion page.
-
The least value fails in the same way, by symmetry: has no least value on either, and . The statement is written for the greatest value only because that is the form the false claim usually takes.
Sources
Standard references
Recommended treatments; not extraction sources.
- Continuous function (Wikipedia)
- W. Rudin, Principles of Mathematical Analysis, 3rd ed., Ch. 4
- J. Lebl, Basic Analysis I, §3.2
- E. Zakon, Mathematical Analysis, §4.1: Basic Definitions
- W. Rudin, Principles of Mathematical Analysis, 3rd ed., Ch. 4 (Thm 4.2)
- W. Rudin, Principles of Mathematical Analysis, 3rd ed., Ch. 4 (Thm 4.4, 4.9)
- MIT 18.100B lecture notes
- W. Rudin, Principles of Mathematical Analysis, 3rd ed., Ch. 4 (Thm 4.7)
- W. Rudin, Principles of Mathematical Analysis, 3rd ed., Ch. 4 (Thm 4.8)
- D. Ernst, Continuous Real Functions
- Compact space (Wikipedia)
- W. Rudin, Principles of Mathematical Analysis, 3rd ed., Ch. 4 (Thm 4.14)
- J. Lebl, Basic Analysis I, §3.3
- W. Trench, Introduction to Real Analysis, Ch. 8: Metric Spaces
- Extreme value theorem (Wikipedia)
- W. Rudin, Principles of Mathematical Analysis, 3rd ed., Ch. 4 (Thm 4.15)
- Compact space (Encyclopedia of Mathematics)
- W. Rudin, Principles of Mathematical Analysis, 3rd ed., Ch. 4 (Thm 4.16)
- Intermediate value theorem (Wikipedia)
- W. Rudin, Principles of Mathematical Analysis, 3rd ed., Ch. 4 (Thm 4.23)
- E. Zakon, Mathematical Analysis, §4.9: The Intermediate Value Property
- Brouwer fixed-point theorem (Wikipedia)
- K. Conrad, The Contraction Mapping Theorem
- Monotonic function (Wikipedia)
- Uniform continuity (Wikipedia)
- W. Rudin, Principles of Mathematical Analysis, 3rd ed., Ch. 4 (Def. 4.18)
- J. Lebl, Basic Analysis I, §3.4
- J. Lebl, Basic Analysis I, §3.3: Uniform continuity
- Metric space (Wikipedia)
- W. Rudin, Principles of Mathematical Analysis, 3rd ed., Ch. 2 and Ch. 4
- Heine-Cantor theorem (Wikipedia)
- W. Rudin, Principles of Mathematical Analysis, 3rd ed., Ch. 4 (Thm 4.19)
- W. Rudin, Principles of Mathematical Analysis, 3rd ed., Ch. 4 (Exercise 4.13)
- MIT 18.100, Practice Final 3
- Hölder condition (Wikipedia)
- Lipschitz continuity (Wikipedia)
- Cornell numerical methods notes: Calculus
- W. Rudin, Principles of Mathematical Analysis, 3rd ed., Ch. 4 (Thm 4.20)
- W. Rudin, Principles of Mathematical Analysis
- Closed set (Wikipedia)
- University of Edinburgh, The Extreme Value Theorem