Smoothness
In mathematical analysis, the smoothness of a function is a property measured by the number of derivatives it has that are continuous. A smooth function is a function that has derivatives of all orders everywhere in its domain.
Contents
Differentiability classes
Differentiability class is a classification of functions according to the properties of their derivatives. Higher order differentiability classes correspond to the existence of more derivatives.
Consider an open set on the real line and a function f defined on that set with real values. Let k be a nonnegative integer. The function f is said to be of (differentiability) class C^{k} if the derivatives f′, f′′, ..., f^{(k)} exist and are continuous (the continuity is implied by differentiability for all the derivatives except for f^{(k)}). The function f is said to be of class C^{∞}, or smooth, if it has derivatives of all orders.^{[1]} The function f is said to be of class C^{ω}, or analytic, if f is smooth and if its Taylor series expansion around any point in its domain converges to the function in some neighborhood of the point. C^{ω} is thus strictly contained in C^{∞}. Bump functions are examples of functions in C^{∞} but not in C^{ω}.
To put it differently, the class C^{0} consists of all continuous functions. The class C^{1} consists of all differentiable functions whose derivative is continuous; such functions are called continuously differentiable. Thus, a C^{1} function is exactly a function whose derivative exists and is of class C^{0}. In general, the classes C^{k} can be defined recursively by declaring C^{0} to be the set of all continuous functions and declaring C^{k} for any positive integer k to be the set of all differentiable functions whose derivative is in C^{k−1}. In particular, C^{k} is contained in C^{k−1} for every k, and there are examples to show that this containment is strict (C^{k} ⊊ C^{k−1}). C^{∞}, the class of infinitely differentiable functions, is the intersection of the sets C^{k} as k varies over the nonnegative integers (i.e. from 0 to ∞).
Examples
The function
is continuous, but not differentiable at x = 0, so it is of class C^{0} but not of class C^{1}.
The function
is differentiable, with derivative
Because cos(1/x) oscillates as x → 0, g’(x) is not continuous at zero. Therefore, this function is differentiable but not of class C^{1}. Moreover, if one takes g(x) = x^{4/3}sin(1/x) (x ≠ 0) in this example, it can be used to show that the derivative function of a differentiable function can be unbounded on a compact set and, therefore, that a differentiable function on a compact set may not be locally Lipschitz continuous.
The functions
where k is even, are continuous and k times differentiable at all x. But at x = 0 they are not (k + 1) times differentiable, so they are of class C^{k} but not of class C^{j} where j > k.
The exponential function is analytic, so, of class C^{ω}. The trigonometric functions are also analytic wherever they are defined.
The function
is smooth, so of class C^{∞}, but it is not analytic at x = ±1, so it is not of class C^{ω}. The function f is an example of a smooth function with compact support.
Multivariate differentiability classes
This section may require cleanup to meet Wikipedia's quality standards. The specific problem is: Inline comments asserting that paragraphs are not correct are not encyclopedic. Also, reference seems doubtful. (June 2016) (Learn how and when to remove this template message)

Let n and m be some positive integers. If f is a function from an open subset of R^{n} with values in R^{m}, then f has component functions f_{1}, ..., f_{m}. Each of these may or may not have partial derivatives. For a nonnegative integer ℓ, we say that f is of class C^{ℓ} if all of the partial derivatives exist and are continuous, where is a nonnegative integer, is an integer between 1 and m, each of is an integer between 1 and n, each of is an integer between 0 and ℓ, and .^{[1]} The classes C^{∞} and C^{ω} are defined as before.^{[1]}
These criteria of differentiability can be applied to the transition functions of a differential structure. The resulting space is called a C^{k} manifold.
If one wishes to start with a coordinateindependent definition of the class C^{k}, one may start by considering maps between Banach spaces. A map from one Banach space to another is differentiable at a point if there is an affine map which approximates it at that point. The derivative of the map assigns to the point x the linear part of the affine approximation to the map at x. Since the space of linear maps from one Banach space to another is again a Banach space, we may continue this procedure to define higher order derivatives. A map f is of class C^{k} if it has continuous derivatives up to order k, as before.
Note that R^{n} is a Banach space for any value of n, so the coordinatefree approach is applicable in this instance. It can be shown that the definition in terms of partial derivatives and the coordinatefree approach are equivalent; that is, a function f is of class C^{k} by one definition if it is so by the other definition. [Note that both definitions have a continuity condition; see the discussion at Fréchet derivative § Finite dimensions.]
The space of C^{k} functions
Let D be an open subset of the real line. The set of all C^{k} functions defined on D and taking real values is a Fréchet vector space with the countable family of seminorms
where K varies over an increasing sequence of compact sets whose union is D, and m = 0, 1, ..., k.
The set of C^{∞} functions over D also forms a Fréchet space. One uses the same seminorms as above, except that m is allowed to range over all nonnegative integer values.
The above spaces occur naturally in applications where functions having derivatives of certain orders are necessary; however, particularly in the study of partial differential equations, it can sometimes be more fruitful to work instead with the Sobolev spaces.
Parametric continuity
The terms parametric continuity and geometric continuity (G^{n}) were introduced by Barsky to show that the smoothness of a curve could be measured by removing restrictions on the speed with which the parameter traces out the curve.^{[2]}^{[3]}^{[4]}
Parametric continuity is a concept applied to parametric curves describing the smoothness of the parameter's value with distance along the curve.
Definition
A curve can be said to have C^{n} continuity if is continuous of value throughout the curve.
As an example of a practical application of this concept, a curve describing the motion of an object with a parameter of time, must have C^{1} continuity for the object to have finite acceleration. For smoother motion, such as that of a camera's path while making a film, higher orders of parametric continuity are required.
Order of continuity
The various order of parametric continuity can be described as follows:^{[5]}
 C^{−1}: Curves are discontinuous
 C^{0}: Curves are continuous
 C^{1}: First derivatives are continuous
 C^{2}: First and second derivatives are continuous
 C^{n}: First through nth derivatives are continuous
Geometric continuity
Geometric continuity is the continuity of the implicit function.
The concept of geometrical or geometric continuity was primarily applied to the conic sections and related shapes by mathematicians such as Leibniz, Kepler, and Poncelet. The concept was an early attempt at describing, through geometry rather than algebra, the concept of continuity as expressed through a parametric function.
The basic idea behind geometric continuity was that the five conic sections were really five different versions of the same shape. An ellipse tends to a circle as the eccentricity approaches zero, or to a parabola as it approaches one; and a hyperbola tends to a parabola as the eccentricity drops toward one; it can also tend to intersecting lines. Thus, there was continuity between the conic sections. These ideas led to other concepts of continuity. For instance, if a circle and a straight line were two expressions of the same shape, perhaps a line could be thought of as a circle of infinite radius. For such to be the case, one would have to make the line closed by allowing the point x = ∞ to be a point on the circle, and for x = +∞ and x = −∞ to be identical. Such ideas were useful in crafting the modern, algebraically defined, idea of the continuity of a function and of ∞.
Smoothness of curves and surfaces
A curve or surface can be described as having G^{n} continuity, n being the increasing measure of smoothness. Consider the segments either side of a point on a curve:
 G^{0}: The curves touch at the join point.
 G^{1}: The curves also share a common tangent direction at the join point.
 G^{2}: The curves also share a common center of curvature at the join point.
In general, G^{n} continuity exists if the curves can be reparameterized to have C^{n} (parametric) continuity.^{[6]}^{[7]} A reparametrization of the curve is geometrically identical to the original; only the parameter is affected.
Equivalently, two vector functions f(t) and g(t) have G^{n} continuity if f^{(n)}(t) ≠ 0 and f^{(n)}(t) ≡ kg^{(n)}(t), for a scalar k > 0 (i.e., if the direction, but not necessarily the magnitude, of the two vectors is equal).
While it may be obvious that a curve would require G^{1} continuity to appear smooth, for good aesthetics, such as those aspired to in architecture and sports car design, higher levels of geometric continuity are required. For example, reflections in a car body will not appear smooth unless the body has G^{2} continuity.
A rounded rectangle (with ninety degree circular arcs at the four corners) has G^{1} continuity, but does not have G^{2} continuity. The same is true for a rounded cube, with octants of a sphere at its corners and quartercylinders along its edges. If an editable curve with G^{2} continuity is required, then cubic splines are typically chosen; these curves are frequently used in industrial design.
Smoothness of piecewise defined curves and surfaces
This section needs expansion with: Linkage Curve Theorem. You can help by adding to it. (August 2014)

Other concepts
Relation to analyticity
While all analytic functions are "smooth" (i.e. have all derivatives continuous) on the set on which they are analytic, examples such as bump functions (mentioned above) show that the converse is not true for functions on the reals: there exist smooth real functions which are not analytic. Simple examples of functions which are smooth but not analytic at any point can be made by means of Fourier series; another example is the Fabius function. Although it might seem that such functions are the exception rather than the rule, it turns out that the analytic functions are scattered very thinly among the smooth ones; more rigorously, the analytic functions form a meagre subset of the smooth functions. Furthermore, for every open subset A of the real line, there exist smooth functions which are analytic on A and nowhere else.
It is useful to compare the situation to that of the ubiquity of transcendental numbers on the real line. Both on the real line and the set of smooth functions, the examples we come up with at first thought (algebraic/rational numbers and analytic functions) are far better behaved than the majority of cases: the transcendental numbers and nowhere analytic functions have full measure (their complements are meagre).
The situation thus described is in marked contrast to complex differentiable functions. If a complex function is differentiable just once on an open set, it is both infinitely differentiable and analytic on that set.
Smooth partitions of unity
Smooth functions with given closed support are used in the construction of smooth partitions of unity (see partition of unity and topology glossary); these are essential in the study of smooth manifolds, for example to show that Riemannian metrics can be defined globally starting from their local existence. A simple case is that of a bump function on the real line, that is, a smooth function f that takes the value 0 outside an interval [a,b] and such that
Given a number of overlapping intervals on the line, bump functions can be constructed on each of them, and on semiinfinite intervals (∞, c] and [d, +∞) to cover the whole line, such that the sum of the functions is always 1.
From what has just been said, partitions of unity don't apply to holomorphic functions; their different behavior relative to existence and analytic continuation is one of the roots of sheaf theory. In contrast, sheaves of smooth functions tend not to carry much topological information.
Smooth functions between manifolds
Smooth maps between smooth manifolds may be defined by means of charts, since the idea of smoothness of function is independent of the particular chart used.^{[clarification needed]} If F is a map from an mmanifold M to an nmanifold N, then F is smooth if, for every p ∈ M, there is a chart (U, φ) in M containing p and a chart (V, ψ) in N containing F(p) with F(U) ⊂ V, such that ψ ∘ F ∘ φ^{−1} is smooth from φ(U) to ψ(V) as a function from R^{m} to R^{n}.
Such a map has a first derivative defined on tangent vectors; it gives a fibrewise linear mapping on the level of tangent bundles.
Smooth functions between subsets of manifolds
There is a corresponding notion of smooth map for arbitrary subsets of manifolds. If f : X → Y is a function whose domain and range are subsets of manifolds X ⊂ M and Y ⊂ N respectively. f is said to be smooth if for all x ∈ X there is an open set U ⊂ M with x ∈ U and a smooth function F : U → N such that F(p) = f(p) for all p ∈ U ∩ X.
See also
 Nonanalytic smooth function
 Quasianalytic function
 Spline
 Smooth number (number theory)
 Sinuosity
References
This article includes a list of references, but its sources remain unclear because it has insufficient inline citations. (May 2009) (Learn how and when to remove this template message)

 ^ ^{a} ^{b} ^{c} Warner (1983), p. 5, Definition 1.2.
 ^ Barsky, Brian A. (1981). The Betaspline: A Local Representation Based on Shape Parameters and Fundamental Geometric Measures (Ph.D.). University of Utah, Salt Lake City, Utah.
 ^ Brian A. Barsky (1988). Computer Graphics and Geometric Modeling Using Betasplines. SpringerVerlag, Heidelberg. ISBN 9783 642722943.
 ^ Richard H. Bartels; John C. Beatty; Brian A. Barsky (1987). An Introduction to Splines for Use in Computer Graphics and Geometric Modeling. Morgan Kaufmann. Chapter 13. Parametric vs. Geometric Continuity. ISBN 9781558604001.
 ^ Parametric Curves
 ^ Brian A. Barsky and Tony D. DeRose, "Geometric Continuity of Parametric Curves: Three Equivalent Characterizations," IEEE Computer Graphics and Applications, 9(6), Nov. 1989, pp. 60–68.
 ^ Erich Hartmann:Geometry and Algorithms for COMPUTER AIDED DESIGN, page 55
 This article incorporates text from a publication now in the public domain: Chisholm, Hugh, ed. (1911). "article name needed". Encyclopædia Britannica (11th ed.). Cambridge University Press.
 Guillemin, Victor; Pollack, Alan (1974). Differential Topology. Englewood Cliffs: PrenticeHall. ISBN 0132126052.
 Warner, Frank Wilson (1983). Foundations of differentiable manifolds and Lie groups. Springer. ISBN 9780387908946.