Frequent Links
Continuous function
Calculus  

 


Specialized 

In mathematics, a continuous function is, roughly speaking, a function for which small changes in the input result in small changes in the output. Otherwise, a function is said to be a discontinuous function. A continuous function with a continuous inverse function is called a homeomorphism.
Continuity of functions is one of the core concepts of topology, which is treated in full generality below. The introductory portion of this article focuses on the special case where the inputs and outputs of functions are real numbers. In addition, this article discusses the definition for the more general case of functions between two metric spaces. In order theory, especially in domain theory, one considers a notion of continuity known as Scott continuity. Other forms of continuity do exist but they are not discussed in this article.
As an example, consider the function h(t), which describes the height of a growing flower at time t. This function is continuous. By contrast, if M(t) denotes the amount of money in a bank account at time t, then the function jumps whenever money is deposited or withdrawn, so the function M(t) is discontinuous.
Contents
History
A form of this epsilondelta definition of continuity was first given by Bernard Bolzano in 1817. AugustinLouis Cauchy defined continuity of <math>y=f(x)</math> as follows: an infinitely small increment <math>\alpha</math> of the independent variable x always produces an infinitely small change <math>f(x+\alpha)f(x)</math> of the dependent variable y (see e.g., Cours d'Analyse, p. 34). Cauchy defined infinitely small quantities in terms of variable quantities, and his definition of continuity closely parallels the infinitesimal definition used today (see microcontinuity). The formal definition and the distinction between pointwise continuity and uniform continuity were first given by Bolzano in the 1830s but the work wasn't published until the 1930s. Eduard Heine provided the first published definition of uniform continuity in 1872, but based these ideas on lectures given by Peter Gustav Lejeune Dirichlet in 1854.^{[1]}
Realvalued continuous functions
Definition
A function from the set of real numbers to the real numbers can be represented by a graph in the Cartesian plane; such a function is continuous if, roughly speaking, the graph is a single unbroken curve with no "holes" or "jumps".
There are several ways to make this definition mathematically rigorous. These definitions are equivalent to one another, so the most convenient definition can be used to determine whether a given function is continuous or not. In the definitions below,
 <math>f\colon I \rightarrow \mathbf R.</math>
is a function defined on a subset I of the set R of real numbers. This subset I is referred to as the domain of f. Some possible choices include I=R, the whole set of real numbers, an open interval
 <math>I = (a, b) = \{x \in \mathbf R \,\, a < x < b \}, </math>
or a closed interval
 <math>I = [a, b] = \{x \in \mathbf R \,\, a \leq x \leq b \}. </math>
Here, a and b are real numbers.
Definition in terms of limits of functions
The function f is continuous at some point c of its domain if the limit of f(x) as x approaches c through the domain of f exists and is equal to f(c).^{[2]} In mathematical notation, this is written as
 <math>\lim_{x \to c}{f(x)} = f(c).</math>
In detail this means three conditions: first, f has to be defined at c. Second, the limit on the left hand side of that equation has to exist. Third, the value of this limit must equal f(c).
If the point c in the domain of f is not a limit point of the domain, then the above condition is vacuously true, since x cannot approach c through values not equal to c. Thus, for example, function whose domain is the set of all integers is continuous at every point of its domain.
The function f is said to be continuous if it is continuous at every point of its domain; otherwise, it is discontinuous.
Definition in terms of limits of sequences
One can instead require that for any sequence <math>(x_n)_{n\in\mathbb{N}}</math> of points in the domain which converges to c, the corresponding sequence <math>\left(f(x_n)\right)_{n\in \mathbb{N}}</math> converges to f(c). In mathematical notation, <math>\forall (x_n)_{n\in\mathbb{N}} \subset I:\lim_{n\to\infty} x_n=c \Rightarrow \lim_{n\to\infty} f(x_n)=f(c)\,.</math>
Weierstrass definition (epsilon–delta) of continuous functions
Explicitly including the definition of the limit of a function, we obtain a selfcontained definition: Given a function f as above and an element c of the domain I, f is said to be continuous at the point c if the following holds: For any number ε > 0, however small, there exists some number δ > 0 such that for all x in the domain of f with c − δ < x < c + δ, the value of f(x) satisfies
 <math> f(c)  \varepsilon < f(x) < f(c) + \varepsilon.\,</math>
Alternatively written, continuity of f : I → R at c ∈ I means that for every ε > 0 there exists a δ > 0 such that for all x ∈ I,:
 <math> x  c  < \delta \Rightarrow  f(x)  f(c)  < \varepsilon. \, </math>
More intuitively, we can say that if we want to get all the f(x) values to stay in some small neighborhood around f(c), we simply need to choose a small enough neighborhood for the x values around c, and we can do that no matter how small the f(x) neighborhood is; f is then continuous at c.
Note. It does not necessarily mean that when x and y are getting closer and closer to each other then so do f(x) and f(y). For instance, if f is the reciprocal function on reals that are not equal zero (so f is a continuous function) and x asserts consecutive values of 1/n and y asserts consecutive values of 1/n, where n diverges to infinity, then x and y are are both in the domain of f and are getting closer and closer to each other but the distance between f(x) = 1/x = n and f(y) = 1/y = n diverges to infinity.
In modern terms, this is generalized by the definition of continuity of a function with respect to a basis for the topology, here the metric topology.
Definition using oscillation
Continuity can also be defined in terms of oscillation: a function f is continuous at a point x_{0} if and only if its oscillation at that point is zero;^{[3]} in symbols, <math>\omega_f(x_0) = 0.</math> A benefit of this definition is that it quantifies discontinuity: the oscillation gives how much the function is discontinuous at a point.
This definition is useful in descriptive set theory to study the set of discontinuities and continuous points – the continuous points are the intersection of the sets where the oscillation is less than ε (hence a G_{δ} set) – and gives a very quick proof of one direction of the Lebesgue integrability condition.^{[4]}
The oscillation is equivalent to the εδ definition by a simple rearrangement, and by using a limit (lim sup, lim inf) to define oscillation: if (at a given point) for a given ε_{0} there is no δ that satisfies the εδ definition, then the oscillation is at least ε_{0}, and conversely if for every ε there is a desired δ, the oscillation is 0. The oscillation definition can be naturally generalized to maps from a topological space to a metric space.
Definition using the hyperreals
Cauchy defined continuity of a function in the following intuitive terms: an infinitesimal change in the independent variable corresponds to an infinitesimal change of the dependent variable (see Cours d'analyse, page 34). Nonstandard analysis is a way of making this mathematically rigorous. The real line is augmented by the addition of infinite and infinitesimal numbers to form the hyperreal numbers. In nonstandard analysis, continuity can be defined as follows.
 A realvalued function f is continuous at x if its natural extension to the hyperreals has the property that for all infinitesimal dx, f(x+dx) − f(x) is infinitesimal^{[5]}
(see microcontinuity). In other words, an infinitesimal increment of the independent variable always produces to an infinitesimal change of the dependent variable, giving a modern expression to AugustinLouis Cauchy's definition of continuity.
Examples
All polynomial functions, such as f(x) = x^{3} + x^{2}  5x + 3 (pictured), are continuous. This is a consequence of the fact that, given two continuous functions
 <math>f, g\colon I \rightarrow \mathbf R</math>
defined on the same domain I, then the sum f + g, and the product fg of the two functions are continuous (on the same domain I). Moreover, the function
 <math>\frac f g \colon \{ x \in I g(x) \neq 0 \} \rightarrow \mathbf R, x \mapsto \frac{f(x)}{g(x)}</math>
is continuous. (The points where g(x) is zero are discarded, as they are not in the domain of f/g.) For example, the function (pictured)
 <math>f(x) = \frac {2x1} {x+2}</math>
is defined for all real numbers x ≠ −2 and is continuous at every such point. Thus it is a continuous function. The question of continuity at x = −2 does not arise, since x = −2 is not in the domain of f. There is no continuous function F: R → R that agrees with f(x) for all x ≠ −2. The sinc function g(x) = (sin x)/x, defined for all x≠0 is continuous at these points. Thus it is a continuous function, too. However, unlike the on of the previous example, this one can be extended to a continuous function on all real numbers, namely
 <math>
G(x) = \begin{cases} \frac {\sin (x)}x & \text{ if }x \ne 0\\ 1 & \text{ if }x = 0, \end{cases} </math> since the limit of g(x), when x approaches 0, is 1. Therefore, the point x=0 is called a removable singularity of g.
Given two continuous functions
 <math>f\colon I \rightarrow J (\subset \mathbf R), g\colon J \rightarrow \mathbf R,</math>
the composition
 <math>g \circ f \colon I \rightarrow \mathbf R, x \mapsto g(f(x))</math>
is continuous.
Nonexamples
An example of a discontinuous function is the function f defined by f(x) = 1 if x > 0, f(x) = 0 if x ≤ 0. Pick for instance ε = ^{1}⁄_{2}. There is no δneighborhood around x = 0 that will force all the f(x) values to be within ε of f(0). Intuitively we can think of this type of discontinuity as a sudden jump in function values. Similarly, the signum or sign function
 <math>
\sgn(x) = \begin{cases} 1 & \text{ if }x > 0\\ 0 & \text{ if }x = 0\\ 1 & \text{ if }x < 0 \end{cases} </math> is discontinuous at x = 0 but continuous everywhere else. Yet another example: the function
 <math>f(x)=\begin{cases}
\sin\left(\frac{1}{x^2}\right)\text{ if }x \ne 0\\ 0\text{ if }x = 0
\end{cases}</math> is continuous everywhere apart from x = 0.
 <math>f(x)=\begin{cases}
1 \text{ if }x=0\\ \frac{1}{q}\text{ if }x=\frac{p}{q}\text{(in lowest terms) is a rational number}\\
0\text{ if }x\text{ is irrational}.
\end{cases}</math> is continuous at all irrational numbers and discontinuous at all rational numbers. In a similar vein, Dirichlet's function
 <math>D(x)=\begin{cases}
0\text{ if }x\text{ is irrational } (\in \mathbb{R} \setminus \mathbb{Q})\\ 1\text{ if }x\text{ is rational } (\in \mathbb{Q})
\end{cases}</math> is nowhere continuous.
Properties
Intermediate value theorem
The intermediate value theorem is an existence theorem, based on the real number property of completeness, and states:
 If the realvalued function f is continuous on the closed interval [a, b] and k is some number between f(a) and f(b), then there is some number c in [a, b] such that f(c) = k.
For example, if a child grows from 1 m to 1.5 m between the ages of two and six years, then, at some time between two and six years of age, the child's height must have been 1.25 m.
As a consequence, if f is continuous on [a, b] and f(a) and f(b) differ in sign, then, at some point c in [a, b], f(c) must equal zero.
Extreme value theorem
The extreme value theorem states that if a function f is defined on a closed interval [a,b] (or any closed and bounded set) and is continuous there, then the function attains its maximum, i.e. there exists c ∈ [a,b] with f(c) ≥ f(x) for all x ∈ [a,b]. The same is true of the minimum of f. These statements are not, in general, true if the function is defined on an open interval (a,b) (or any set that is not both closed and bounded), as, for example, the continuous function f(x) = 1/x, defined on the open interval (0,1), does not attain a maximum, being unbounded above.
Relation to differentiability and integrability
Every differentiable function
 <math>f\colon (a, b) \rightarrow \mathbf R</math>
is continuous, as can be shown. The converse does not hold: for example, the absolute value function
 <math>f(x)=x = \begin{cases}
x \text{ if }x \geq 0\\ x\text{ if }x < 0
\end{cases}</math> is everywhere continuous. However, it is not differentiable at x = 0 (but is so everywhere else). Weierstrass's function is everywhere continuous but nowhere differentiable.
The derivative f′(x) of a differentiable function f(x) need not be continuous. If f′(x) is continuous, f(x) is said to be continuously differentiable. The set of such functions is denoted C^{1}((a, b)). More generally, the set of functions
 <math>f\colon \Omega \rightarrow \mathbf R</math>
(from an open interval (or open subset of R) Ω to the reals) such that f is n times differentiable and such that the nth derivative of f is continuous is denoted C^{n}(Ω). See differentiability class. In the field of computer graphics, these three levels are sometimes called G^{0} (continuity of position), G^{1} (continuity of tangency), and G^{2} (continuity of curvature).
Every continuous function
 <math>f\colon [a, b] \rightarrow \mathbf R</math>
is integrable (for example in the sense of the Riemann integral). The converse does not hold, as the (integrable, but discontinuous) sign function shows.
Pointwise and uniform limits
Given a sequence
 <math>f_1, f_2, \dotsc \colon I \rightarrow \mathbf R</math>
of functions such that the limit
 <math>f(x) := \lim_{n \rightarrow \infty} f_n(x)</math>
exists for all x in I, the resulting function f(x) is referred to as the pointwise limit of the sequence of functions (f_{n})_{n∈N}. The pointwise limit function need not be continuous, even if all functions f_{n} are continuous, as the animation at the right shows. However, f is continuous when the sequence converges uniformly, by the uniform convergence theorem. This theorem can be used to show that the exponential functions, logarithms, square root function, trigonometric functions are continuous.
Directional and semicontinuity
 Rightcontinuous.svg
A rightcontinuous function
 Leftcontinuous.svg
A leftcontinuous function
Discontinuous functions may be discontinuous in a restricted way, giving rise to the concept of directional continuity (or right and left continuous functions) and semicontinuity. Roughly speaking, a function is rightcontinuous if no jump occurs when the limit point is approached from the right. More formally, f is said to be rightcontinuous at the point c if the following holds: For any number ε > 0 however small, there exists some number δ > 0 such that for all x in the domain with c < x < c + δ, the value of f(x) will satisfy
 <math> f(x)  f(c) < \varepsilon.\,</math>
This is the same condition as for continuous functions, except that it is required to hold for x strictly larger than c only. Requiring it instead for all x with c − δ < x < c yields the notion of leftcontinuous functions. A function is continuous if and only if it is both rightcontinuous and leftcontinuous.
A function f is lower semicontinuous if, roughly, any jumps that might occur only go down, but not up. That is, for any ε > 0, there exists some number δ > 0 such that for all x in the domain with x − c < δ, the value of f(x) satisfies
 <math>f(x) \geq f(c)  \epsilon.</math>
The reverse condition is upper semicontinuity.
Continuous functions between metric spaces
The concept of continuous realvalued functions can be generalized to functions between metric spaces. A metric space is a set X equipped with a function (called metric) d_{X}, that can be thought of as a measurement of the distance of any two elements in X. Formally, the metric is a function
 <math>d_X \colon X \times X \rightarrow \mathbf R</math>
that satisfies a number of requirements, notably the triangle inequality. Given two metric spaces (X, d_{X}) and (Y, d_{Y}) and a function
 <math>f\colon X \rightarrow Y</math>
then f is continuous at the point c in X (with respect to the given metrics) if for any positive real number ε, there exists a positive real number δ such that all x in X satisfying d_{X}(x, c) < δ will also satisfy d_{Y}(f(x), f(c)) < ε. As in the case of real functions above, this is equivalent to the condition that for every sequence (x_{n}) in X with limit lim x_{n} = c, we have lim f(x_{n}) = f(c). The latter condition can be weakened as follows: f is continuous at the point c if and only if for every convergent sequence (x_{n}) in X with limit c, the sequence (f(x_{n})) is a Cauchy sequence, and c is in the domain of f.
The set of points at which a function between metric spaces is continuous is a G_{δ} set – this follows from the εδ definition of continuity.
This notion of continuity is applied, for example, in functional analysis. A key statement in this area says that a linear operator
 <math>T\colon V \rightarrow W</math>
between normed vector spaces V and W (which are vector spaces equipped with a compatible norm, denoted x) is continuous if and only if it is bounded, that is, there is a constant K such that
 <math>\T(x)\ \leq K \x\</math>
for all x in V.
Uniform, Hölder and Lipschitz continuity
The concept of continuity for functions between metric spaces can be strengthened in various ways by limiting the way δ depends on ε and c in the definition above. Intuitively, a function f as above is uniformly continuous if the δ does not depend on the point c. More precisely, it is required that for every real number ε > 0 there exists δ > 0 such that for every c, b ∈ X with d_{X}(b, c) < δ, we have that d_{Y}(f(b), f(c)) < ε. Thus, any uniformly continuous function is continuous. The converse does not hold in general, but holds when the domain space X is compact. Uniformly continuous maps can be defined in the more general situation of uniform spaces.^{[6]}
A function is Hölder continuous with exponent α (a real number) if there is a constant K such that for all b and c in X, the inequality
 <math>d_Y (f(b), f(c)) \leq K \cdot (d_X (b, c))^\alpha</math>
holds. Any Hölder continuous function is uniformly continuous. The particular case α = 1 is referred to as Lipschitz continuity. That is, a function is Lipschitz continuous if there is a constant K such that the inequality
 <math>d_Y (f(b), f(c)) \leq K \cdot d_X (b, c)</math>
holds any b, c in X.^{[7]} The Lipschitz condition occurs, for example, in the Picard–Lindelöf theorem concerning the solutions of ordinary differential equations.
Continuous functions between topological spaces
Another, more abstract, notion of continuity is continuity of functions between topological spaces in which there generally is no formal notion of distance, as there is in the case of metric spaces. A topological space is a set X together with a topology on X, which is a set of subsets of X satisfying a few requirements with respect to their unions and intersections that generalize the properties of the open balls in metric spaces while still allowing to talk about the neighbourhoods of a given point. The elements of a topology are called open subsets of X (with respect to the topology).
A function
 <math>f\colon X \rightarrow Y</math>
between two topological spaces X and Y is continuous if for every open set V ⊆ Y, the inverse image
 <math>f^{1}(V) = \{x \in X \;  \; f(x) \in V \}</math>
is an open subset of X. That is, f is a function between the sets X and Y (not on the elements of the topology T_{X}), but the continuity of f depends on the topologies used on X and Y.
This is equivalent to the condition that the preimages of the closed sets (which are the complements of the open subsets) in Y are closed in X.
An extreme example: if a set X is given the discrete topology (in which every subset is open), all functions
 <math>f\colon X \rightarrow T</math>
to any topological space T are continuous. On the other hand, if X is equipped with the indiscrete topology (in which the only open subsets are the empty set and X) and the space T set is at least T_{0}, then the only continuous functions are the constant functions. Conversely, any function whose range is indiscrete is continuous.
Alternative definitions
Several equivalent definitions for a topological structure exist and thus there are several equivalent ways to define a continuous function.
Neighborhood definition
Neighborhoods continuity for functions between topological spaces <math>(X,\mathcal{T}_X)</math> and <math>(Y,\mathcal{T}_{Y})</math> at a point may be defined:
A function <math>f:X\rightarrow Y</math> is continuous at a point <math>x\in X</math> iff for any neighborhood of its image <math>f(x)\in Y</math> the preimage is again a neighborhood of that point: <math>\forall N\in\mathcal{N}_{f(x)}: f^{1}(N)\in\mathcal{M}_x</math>
According to the property that neighborhood systems being upper sets this can be restated as follows:
<math>\forall N\in\mathcal{N}_{f(x)}\exist M\in\mathcal{M}_x: M\subseteq f^{1}(N)</math>
<math>\forall N\in\mathcal{N}_{f(x)}\exist M\in\mathcal{M}_x: f(M)\subseteq N</math>
The second one being a restatement involving the image rather than the preimage.
Literally, this means no matter how small the neighborhood is chosen one can always find a neighborhood mapped into it.
Besides, there's a simplification involving only open neighborhoods. In fact, they're equivalent:
<math>\forall V\in\mathcal{T}_{Y}, f(x)\in V\exist U\in\mathcal{T}_{X}, x\in U: U\subseteq f^{1}(V)</math>
<math>\forall V\in\mathcal{T}_{Y}, f(x)\in V\exist U\in\mathcal{T}_{X}, x\in U: f(U)\subseteq V</math>
The second one again being a restatement using images rather than preimages.
If X and Y are metric spaces, it is equivalent to consider the neighborhood system of open balls centered at x and f(x) instead of all neighborhoods. This gives back the above δε definition of continuity in the context of metric spaces. However, in general topological spaces, there is no notion of nearness or distance.
Note, however, that if the target space is Hausdorff, it is still true that f is continuous at a if and only if the limit of f as x approaches a is f(a). At an isolated point, every function is continuous.
Sequences and nets
In several contexts, the topology of a space is conveniently specified in terms of limit points. In many instances, this is accomplished by specifying when a point is the limit of a sequence, but for some spaces that are too large in some sense, one specifies also when a point is the limit of more general sets of points indexed by a directed set, known as nets. A function is (Heine)continuous only if it takes limits of sequences to limits of sequences. In the former case, preservation of limits is also sufficient; in the latter, a function may preserve all limits of sequences yet still fail to be continuous, and preservation of nets is a necessary and sufficient condition.
In detail, a function f: X → Y is sequentially continuous if whenever a sequence (x_{n}) in X converges to a limit x, the sequence (f(x_{n})) converges to f(x). Thus sequentially continuous functions "preserve sequential limits". Every continuous function is sequentially continuous. If X is a firstcountable space and countable choice holds, then the converse also holds: any function preserving sequential limits is continuous. In particular, if X is a metric space, sequential continuity and continuity are equivalent. For non firstcountable spaces, sequential continuity might be strictly weaker than continuity. (The spaces for which the two properties are equivalent are called sequential spaces.) This motivates the consideration of nets instead of sequences in general topological spaces. Continuous functions preserve limits of nets, and in fact this property characterizes continuous functions.
Closure operator definition
Instead of specifying the open subsets of a topological space, the topology can also be determined by a closure operator (denoted cl) which assigns to any subset A ⊆ X its closure, or an interior operator (denoted int), which assigns to any subset A of X its interior. In these terms, a function
 <math>f\colon (X,\mathrm{cl}) \to (X' ,\mathrm{cl}')\, </math>
between topological spaces is continuous in the sense above if and only if for all subsets A of X
 <math>f(\mathrm{cl}(A)) \subseteq \mathrm{cl}'(f(A)).</math>
That is to say, given any element x of X that is in the closure of any subset A, f(x) belongs to the closure of f(A). This is equivalent to the requirement that for all subsets A' of X'
 <math>f^{1}(\mathrm{cl}'(A')) \supseteq \mathrm{cl}(f^{1}(A')).</math>
Moreover,
 <math>f\colon (X,\mathrm{int}) \to (X' ,\mathrm{int}') \, </math>
is continuous if and only if
 <math>f^{1}(\mathrm{int}'(A')) \subseteq \mathrm{int}(f^{1}(A'))</math>
for any subset A' of Y.
Properties
If f: X → Y and g: Y → Z are continuous, then so is the composition g ∘ f: X → Z. If f: X → Y is continuous and
 X is compact, then f(X) is compact.
 X is connected, then f(X) is connected.
 X is pathconnected, then f(X) is pathconnected.
 X is Lindelöf, then f(X) is Lindelöf.
 X is separable, then f(X) is separable.
The possible topologies on a fixed set X are partially ordered: a topology τ_{1} is said to be coarser than another topology τ_{2} (notation: τ_{1} ⊆ τ_{2}) if every open subset with respect to τ_{1} is also open with respect to τ_{2}. Then, the identity map
 id_{X}: (X, τ_{2}) → (X, τ_{1})
is continuous if and only if τ_{1} ⊆ τ_{2} (see also comparison of topologies). More generally, a continuous function
 <math>(X, \tau_X) \rightarrow (Y, \tau_Y)</math>
stays continuous if the topology τ_{Y} is replaced by a coarser topology and/or τ_{X} is replaced by a finer topology.
Homeomorphisms
Symmetric to the concept of a continuous map is an open map, for which images of open sets are open. In fact, if an open map f has an inverse function, that inverse is continuous, and if a continuous map g has an inverse, that inverse is open. Given a bijective function f between two topological spaces, the inverse function f^{−1} need not be continuous. A bijective continuous function with continuous inverse function is called a homeomorphism.
If a continuous bijection has as its domain a compact space and its codomain is Hausdorff, then it is a homeomorphism.
Defining topologies via continuous functions
Given a function
 <math>f\colon X \rightarrow S, \,</math>
where X is a topological space and S is a set (without a specified topology), the final topology on S is defined by letting the open sets of S be those subsets A of S for which f^{−1}(A) is open in X. If S has an existing topology, f is continuous with respect to this topology if and only if the existing topology is coarser than the final topology on S. Thus the final topology can be characterized as the finest topology on S that makes f continuous. If f is surjective, this topology is canonically identified with the quotient topology under the equivalence relation defined by f.
Dually, for a function f from a set S to a topological space, the initial topology on S has as open subsets A of S those subsets for which f(A) is open in X. If S has an existing topology, f is continuous with respect to this topology if and only if the existing topology is finer than the initial topology on S. Thus the initial topology can be characterized as the coarsest topology on S that makes f continuous. If f is injective, this topology is canonically identified with the subspace topology of S, viewed as a subset of X.
More generally, given a set S, specifying the set of continuous functions
 <math>S \rightarrow X</math>
into all topological spaces X defines a topology. Dually, a similar idea can be applied to maps
 <math>X \rightarrow S.</math>
This is an instance of a universal property.
Related notions
Various other mathematical domains use the concept of continuity in different, but related meanings. For example, in order theory, an orderpreserving function f: X → Y between two complete lattices X and Y (particular types of partially ordered sets) is continuous if for each subset A of X, we have sup(f(A)) = f(sup(A)). Here sup is the supremum with respect to the orderings in X and Y, respectively. Applying this to the complete lattice consisting of the open subsets of a topological space, this gives back the notion of continuity for maps between topological spaces.
In category theory, a functor
 <math>F\colon \mathcal C \rightarrow \mathcal D</math>
between two categories is called continuous, if it commutes with small limits. That is to say,
 <math>\varprojlim_{i \in I} F(C_i) \cong F (\varprojlim_{i \in I} C_i)</math>
for any small (i.e., indexed by a set I, as opposed to a class) diagram of objects in <math>\mathcal C</math>.
A continuity space is a generalization of metric spaces and posets,^{[8]}^{[9]} which uses the concept of quantales, and that can be used to unify the notions of metric spaces and domains.^{[10]}
See also
Notes
40x40px  Wikimedia Commons has media related to Continuity (functions). 
 ^ Rusnock, P.; KerrLawson, A. (2005), "Bolzano and uniform continuity", Historia Mathematica 32 (3): 303–311, doi:10.1016/j.hm.2004.11.003
 ^ Lang, Serge (1997), Undergraduate analysis, Undergraduate Texts in Mathematics (2nd ed.), Berlin, New York: SpringerVerlag, ISBN 9780387948416, section II.4
 ^ Introduction to Real Analysis, updated April 2010, William F. Trench, Theorem 3.5.2, p. 172
 ^ Introduction to Real Analysis, updated April 2010, William F. Trench, 3.5 "A More Advanced Look at the Existence of the Proper Riemann Integral", pp. 171–177
 ^ http://www.math.wisc.edu/~keisler/calc.html
 ^ Gaal, Steven A. (2009), Point set topology, New York: Dover Publications, ISBN 9780486472225, section IV.10
 ^ Searcóid, Mícheál Ó (2006), Metric spaces, Springer undergraduate mathematics series, Berlin, New York: SpringerVerlag, ISBN 9781846283697, section 9.4
 ^ Flagg, R. C. (1997). "Quantales and continuity spaces". Algebra Universalis. CiteSeerX: 10
.1 ..1 .48 .851  ^ Kopperman, R. (1988). "All topologies come from generalized metrics". American Mathematical Monthly 95 (2): 89–97. doi:10.2307/2323060.
 ^ Flagg, B.; Kopperman, R. (1997). "Continuity spaces: Reconciling domains and metric spaces". Theoretical Computer Science 177 (1): 111–138. doi:10.1016/S03043975(97)002363.
References
 Hazewinkel, Michiel, ed. (2001), "Continuous function", Encyclopedia of Mathematics, Springer, ISBN 9781556080104
 Visual Calculus by Lawrence S. Husch, University of Tennessee (2001).
