Smoothness

From The Right Wiki
(Redirected from Infinitely differentiable)
Jump to navigationJump to search
File:Bump2D illustration.png
A bump function is a smooth function with compact support.

In mathematical analysis, the smoothness of a function is a property measured by the number of continuous derivatives (differentiability class) it has over its domain.[1] A function of class Ck is a function of smoothness at least k; that is, a function of class Ck is a function that has a kth derivative that is continuous in its domain. A function of class C or C-function (pronounced C-infinity function) is an infinitely differentiable function, that is, a function that has derivatives of all orders (this implies that all these derivatives are continuous). Generally, the term smooth function refers to a C-function. However, it may also mean "sufficiently differentiable" for the problem under consideration.

Differentiability classes

Differentiability class is a classification of functions according to the properties of their derivatives. It is a measure of the highest order of derivative that exists and is continuous for a function. Consider an open set U on the real line and a function f defined on U with real values. Let k be a non-negative integer. The function f is said to be of differentiability class Ck if the derivatives f,f,,f(k) exist and are continuous on U. If f is k-differentiable on U, then it is at least in the class Ck1 since f,f,,f(k1) are continuous on U. The function f is said to be infinitely differentiable, smooth, or of class C, if it has derivatives of all orders on U. (So all these derivatives are continuous functions over U.)[2] The function f is said to be of class Cω, or analytic, if f is smooth (i.e., f is in the class C) and its Taylor series expansion around any point in its domain converges to the function in some neighborhood of the point. There exist functions that are smooth but not analytic; Cω is thus strictly contained in C. Bump functions are examples of functions with this property. To put it differently, the class C0 consists of all continuous functions. The class C1 consists of all differentiable functions whose derivative is continuous; such functions are called continuously differentiable. Thus, a C1 function is exactly a function whose derivative exists and is of class C0. In general, the classes Ck can be defined recursively by declaring C0 to be the set of all continuous functions, and declaring Ck for any positive integer k to be the set of all differentiable functions whose derivative is in Ck1. In particular, Ck is contained in Ck1 for every k>0, and there are examples to show that this containment is strict (CkCk1). The class C of infinitely differentiable functions, is the intersection of the classes Ck as k varies over the non-negative integers.

Examples

Example: Continuous (C0) But Not Differentiable

File:C0 function.svg
The C0 function f(x) = x for x ≥ 0 and 0 otherwise.
File:X^2sin(x^-1).svg
The function g(x) = x2 sin(1/x) for x > 0.
File:The function x^2*sin(1 over x).svg
The function f: with f(x)=x2sin(1x) for x0 and f(0)=0 is differentiable. However, this function is not continuously differentiable.
File:Mollifier Illustration.svg
A smooth function that is not analytic.

The function f(x)={xif x0,0if x<0 is continuous, but not differentiable at x = 0, so it is of class C0, but not of class C1.

Example: Finitely-times Differentiable (Ck)

For each even integer k, the function f(x)=|x|k+1 is continuous and k times differentiable at all x. At x = 0, however, f is not (k + 1) times differentiable, so f is of class Ck, but not of class Cj where j > k.

Example: Differentiable But Not Continuously Differentiable (not C1)

The function g(x)={x2sin(1x)if x0,0if x=0 is differentiable, with derivative g(x)={cos(1x)+2xsin(1x)if x0,0if x=0. Because cos(1/x) oscillates as x → 0, g(x) is not continuous at zero. Therefore, g(x) is differentiable but not of class C1.

Example: Differentiable But Not Lipschitz Continuous

The function h(x)={x4/3sin(1x)if x0,0if x=0 is differentiable but its derivative is unbounded on a compact set. Therefore, h is an example of a function that is differentiable but not locally Lipschitz continuous.

Example: Analytic (Cω)

The exponential function ex is analytic, and hence falls into the class Cω. The trigonometric functions are also analytic wherever they are defined, because they are linear combinations of complex exponential functions eix and eix.

Example: Smooth (C) but not Analytic (Cω)

The bump function f(x)={e11x2 if |x|<1,0 otherwise  is smooth, so of class C, but it is not analytic at x = ±1, and hence is not of class Cω. The function f is an example of a smooth function with compact support.

Multivariate differentiability classes

A function f:Un defined on an open set U of n is said[3] to be of class Ck on U, for a positive integer k, if all partial derivatives αfx1α1x2α2xnαn(y1,y2,,yn) exist and are continuous, for every α1,α2,,αn non-negative integers, such that α=α1+α2++αnk, and every (y1,y2,,yn)U. Equivalently, f is of class Ck on U if the k-th order Fréchet derivative of f exists and is continuous at every point of U. The function f is said to be of class C or C0 if it is continuous on U. Functions of class C1 are also said to be continuously differentiable. A function f:Unm, defined on an open set U of n, is said to be of class Ck on U, for a positive integer k, if all of its components fi(x1,x2,,xn)=(πif)(x1,x2,,xn)=πi(f(x1,x2,,xn)) for i=1,2,3,,m are of class Ck, where πi are the natural projections πi:m defined by πi(x1,x2,,xm)=xi. It is said to be of class C or C0 if it is continuous, or equivalently, if all components fi are continuous, on U.

The space of Ck functions

Let D be an open subset of the real line. The set of all Ck real-valued functions defined on D is a Fréchet vector space, with the countable family of seminorms pK,m=supxK|f(m)(x)| 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 non-negative 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.

Continuity

The terms parametric continuity (Ck) and geometric continuity (Gn) were introduced by Brian 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.[4][5][6]

Parametric continuity

Parametric continuity (Ck) is a concept applied to parametric curves, which describes the smoothness of the parameter's value with distance along the curve. A (parametric) curve s:[0,1]n is said to be of class Ck, if dksdtk exists and is continuous on [0,1], where derivatives at the end-points 0 and 1 are taken to be one sided derivatives (from the right at 0 and from the left at 1). As a practical application of this concept, a curve describing the motion of an object with a parameter of time must have C1 continuity and its first derivative is differentiable—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 parametric continuity

File:Parametric continuity C0.svg
Two Bézier curve segments attached that is only C0 continuous
File:Parametric continuity vector.svg
Two Bézier curve segments attached in such a way that they are C1 continuous

The various order of parametric continuity can be described as follows:[7]

  • C0: zeroth derivative is continuous (curves are continuous)
  • C1: zeroth and first derivatives are continuous
  • C2: zeroth, first and second derivatives are continuous
  • Cn: 0-th through n-th derivatives are continuous

Geometric continuity

File:Curves g1 contact.svg
Curves with G1-contact (circles,line)
File:Kegelschnitt-Schar.svg
(1ε2)x22px+y2=0,p>0,ε0
pencil of conic sections with G2-contact: p fix, ε variable
(ε=0: circle,ε=0.8: ellipse, ε=1: parabola, ε=1.2: hyperbola)

A curve or surface can be described as having Gn continuity, with n being the increasing measure of smoothness. Consider the segments either side of a point on a curve:

  • G0: The curves touch at the join point.
  • G1: The curves also share a common tangent direction at the join point.
  • G2: The curves also share a common center of curvature at the join point.

In general, Gn continuity exists if the curves can be reparameterized to have Cn (parametric) continuity.[8][9] 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) such that f(1)=g(0) have Gn continuity at the point where they meet if they satisfy equations known as Beta-constraints. For example, the Beta-constraints for G4 continuity are:

g(1)(0)=β1f(1)(1)g(2)(0)=β12f(2)(1)+β2f(1)(1)g(3)(0)=β13f(3)(1)+3β1β2f(2)(1)+β3f(1)(1)g(4)(0)=β14f(4)(1)+6β12β2f(3)(1)+(4β1β3+3β22)f(2)(1)+β4f(1)(1)

where β2, β3, and β4 are arbitrary, but β1 is constrained to be positive.[8]: 65  In the case n=1, this reduces to f(1)0 and f(1)=kg(0), for a scalar k>0 (i.e., the direction, but not necessarily the magnitude, of the two vectors is equal). While it may be obvious that a curve would require G1 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 G2 continuity.[citation needed] A rounded rectangle (with ninety degree circular arcs at the four corners) has G1 continuity, but does not have G2 continuity. The same is true for a rounded cube, with octants of a sphere at its corners and quarter-cylinders along its edges. If an editable curve with G2 continuity is required, then cubic splines are typically chosen; these curves are frequently used in industrial design.

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 that are not analytic. Simple examples of functions that 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 that are analytic on A and nowhere else [citation needed]. 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 [citation needed].

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 f(x)>0 for a<x<b. Given a number of overlapping intervals on the line, bump functions can be constructed on each of them, and on semi-infinite 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 do not 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 on and between manifolds

Given a smooth manifold M, of dimension m, and an atlas 𝔘={(Uα,ϕα)}α, then a map f:M is smooth on M if for all pM there exists a chart (U,ϕ)𝔘, such that pU, and fϕ1:ϕ(U) is a smooth function from a neighborhood of ϕ(p) in m to (all partial derivatives up to a given order are continuous). Smoothness can be checked with respect to any chart of the atlas that contains p, since the smoothness requirements on the transition functions between charts ensure that if f is smooth near p in one chart it will be smooth near p in any other chart. If F:MN is a map from M to an n-dimensional manifold N, then F is smooth if, for every pM, there is a chart (U,ϕ) containing p, and a chart (V,ψ) containing F(p) such that F(U)V, and ψFϕ1:ϕ(U)ψ(V) is a smooth function from n. Smooth maps between manifolds induce linear maps between tangent spaces: for F:MN, at each point the pushforward (or differential) maps tangent vectors at p to tangent vectors at F(p): F*,p:TpMTF(p)N, and on the level of the tangent bundle, the pushforward is a vector bundle homomorphism: F*:TMTN. The dual to the pushforward is the pullback, which "pulls" covectors on N back to covectors on M, and k-forms to k-forms: F*:Ωk(N)Ωk(M). In this way smooth functions between manifolds can transport local data, like vector fields and differential forms, from one manifold to another, or down to Euclidean space where computations like integration are well understood. Preimages and pushforwards along smooth functions are, in general, not manifolds without additional assumptions. Preimages of regular points (that is, if the differential does not vanish on the preimage) are manifolds; this is the preimage theorem. Similarly, pushforwards along embeddings are manifolds.[10]

Smooth functions between subsets of manifolds

There is a corresponding notion of smooth map for arbitrary subsets of manifolds. If f:XY is a function whose domain and range are subsets of manifolds XM and YN respectively. f is said to be smooth if for all xX there is an open set UM with xU and a smooth function F:UN such that F(p)=f(p) for all pUX.

See also

References

  1. Weisstein, Eric W. "Smooth Function". mathworld.wolfram.com. Archived from the original on 2019-12-16. Retrieved 2019-12-13.
  2. Warner, Frank W. (1983). Foundations of Differentiable Manifolds and Lie Groups. Springer. p. 5 [Definition 1.2]. ISBN 978-0-387-90894-6. Archived from the original on 2015-10-01. Retrieved 2014-11-28.
  3. Henri Cartan (1977). Cours de calcul différentiel. Paris: Hermann.
  4. Barsky, Brian A. (1981). The Beta-spline: A Local Representation Based on Shape Parameters and Fundamental Geometric Measures (Ph.D.). University of Utah, Salt Lake City, Utah.
  5. Brian A. Barsky (1988). Computer Graphics and Geometric Modeling Using Beta-splines. Springer-Verlag, Heidelberg. ISBN 978-3-642-72294-3.
  6. 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 978-1-55860-400-1.
  7. van de Panne, Michiel (1996). "Parametric Curves". Fall 1996 Online Notes. University of Toronto, Canada. Archived from the original on 2020-11-26. Retrieved 2019-09-01.
  8. 8.0 8.1 Barsky, Brian A.; DeRose, Tony D. (1989). "Geometric Continuity of Parametric Curves: Three Equivalent Characterizations". IEEE Computer Graphics and Applications. 9 (6): 60–68. doi:10.1109/38.41470. S2CID 17893586.
  9. Hartmann, Erich (2003). "Geometry and Algorithms for Computer Aided Design" (PDF). Technische Universität Darmstadt. p. 55. Archived (PDF) from the original on 2020-10-23. Retrieved 2019-08-31.
  10. Guillemin, Victor; Pollack, Alan (1974). Differential Topology. Englewood Cliffs: Prentice-Hall. ISBN 0-13-212605-2.