Hubbry Logo
Modulus of continuityModulus of continuityMain
Open search
Modulus of continuity
Community hub
Modulus of continuity
logo
7 pages, 0 posts
0 subscribers
Be the first to start a discussion here.
Be the first to start a discussion here.
Modulus of continuity
Modulus of continuity
from Wikipedia

In mathematical analysis, a modulus of continuity is a function ω : [0, ∞] → [0, ∞] used to measure quantitatively the uniform continuity of functions. So, a function f : IR admits ω as a modulus of continuity if

for all x and y in the domain of f. Since moduli of continuity are required to be infinitesimal at 0, a function turns out to be uniformly continuous if and only if it admits a modulus of continuity. Moreover, relevance to the notion is given by the fact that sets of functions sharing the same modulus of continuity are exactly equicontinuous families. For instance, the modulus ω(t) := kt describes the k-Lipschitz functions, the moduli ω(t) := ktα describe the Hölder continuity, the modulus ω(t) := kt(|log t|+1) describes the almost Lipschitz class, and so on. In general, the role of ω is to fix some explicit functional dependence of ε on δ in the (ε, δ) definition of uniform continuity. The same notions generalize naturally to functions between metric spaces. Moreover, a suitable local version of these notions allows to describe quantitatively the continuity at a point in terms of moduli of continuity.

A special role is played by concave moduli of continuity, especially in connection with extension properties, and with approximation of uniformly continuous functions. For a function between metric spaces, it is equivalent to admit a modulus of continuity that is either concave, or subadditive, or uniformly continuous, or sublinear (in the sense of growth). Actually, the existence of such special moduli of continuity for a uniformly continuous function is always ensured whenever the domain is either a compact, or a convex subset of a normed space. However, a uniformly continuous function on a general metric space admits a concave modulus of continuity if and only if the ratios

are uniformly bounded for all pairs (x, x′) bounded away from the diagonal of X x X. The functions with the latter property constitute a special subclass of the uniformly continuous functions, that in the following we refer to as the special uniformly continuous functions. Real-valued special uniformly continuous functions on the metric space X can also be characterized as the set of all functions that are restrictions to X of uniformly continuous functions over any normed space isometrically containing X. Also, it can be characterized as the uniform closure of the Lipschitz functions on X.

Formal definition

[edit]

Formally, a modulus of continuity is any increasing real-extended valued function ω : [0, ∞] → [0, ∞], vanishing at 0 and continuous at 0, that is

Moduli of continuity are mainly used to give a quantitative account both of the continuity at a point, and of the uniform continuity, for functions between metric spaces, according to the following definitions.

A function f : (X, dX) → (Y, dY) admits ω as (local) modulus of continuity at the point x in X if and only if,

Also, f admits ω as (global) modulus of continuity if and only if,

One equivalently says that ω is a modulus of continuity (resp., at x) for f, or shortly, f is ω-continuous (resp., at x). Here, we mainly treat the global notion.

Elementary facts

[edit]
  • If f has ω as modulus of continuity and ω1 ≥ ω, then f admits ω1 too as modulus of continuity.
  • If f : XY and g : YZ are functions between metric spaces with moduli respectively ω1 and ω2 then the composition map has modulus of continuity .
  • If f and g are functions from the metric space X to the Banach space Y, with moduli respectively ω1 and ω2, then any linear combination af+bg has modulus of continuity |a1+|b2. The set of all functions from X to Y that have ω as a modulus of continuity is a convex subset of the vector space C(X, Y), closed under pointwise convergence.
  • If f and g are bounded real-valued functions on the metric space X, with moduli respectively ω1 and ω2, then the pointwise product fg has modulus of continuity .
  • If is a family of real-valued functions on the metric space X with common modulus of continuity ω, then the inferior envelope , respectively, the superior envelope , is a real-valued function with modulus of continuity ω, provided it is finite valued at every point. If ω is real-valued, it is sufficient that the envelope be finite at one point of X at least.

Remarks

[edit]
  • Some authors do not require monotonicity, and some require additional properties such as ω being continuous. However, if f admits a modulus of continuity in the weaker definition, it also admits a modulus of continuity which is increasing and infinitely differentiable in (0, ∞). For instance, is increasing, and ω1 ≥ ω; is also continuous, and ω2 ≥ ω1,
    and a suitable variant of the preceding definition also makes ω2 infinitely differentiable in [0, ∞].
  • Any uniformly continuous function admits a minimal modulus of continuity ωf, that is sometimes referred to as the (optimal) modulus of continuity of f: Similarly, any function continuous at the point x admits a minimal modulus of continuity at x, ωf(t; x) (the (optimal) modulus of continuity of f at x) : However, these restricted notions are not as relevant, for in most cases the optimal modulus of f could not be computed explicitly, but only bounded from above (by any modulus of continuity of f). Moreover, the main properties of moduli of continuity concern directly the unrestricted definition.
  • In general, the modulus of continuity of a uniformly continuous function on a metric space needs to take the value +∞. For instance, the function f : NR such that f(n) := n2 is uniformly continuous with respect to the discrete metric on N, and its minimal modulus of continuity is ωf(t) = +∞ for any t≥1, and ωf(t) = 0 otherwise. However, the situation is different for uniformly continuous functions defined on compact or convex subsets of normed spaces.

Special moduli of continuity

[edit]

Special moduli of continuity also reflect certain global properties of functions such as extendibility and uniform approximation. In this section we mainly deal with moduli of continuity that are concave, or subadditive, or uniformly continuous, or sublinear. These properties are essentially equivalent in that, for a modulus ω (more precisely, its restriction on [0, ∞)) each of the following implies the next:

  • ω is concave;
  • ω is subadditive;
  • ω is uniformly continuous;
  • ω is sublinear, that is, there are constants a and b such that ω(t) ≤ at+b for all t;
  • ω is dominated by a concave modulus, that is, there exists a concave modulus of continuity such that for all t.

Thus, for a function f between metric spaces it is equivalent to admit a modulus of continuity which is either concave, or subadditive, or uniformly continuous, or sublinear. In this case, the function f is sometimes called a special uniformly continuous map. This is always true in case of either compact or convex domains. Indeed, a uniformly continuous map f : CY defined on a convex set C of a normed space E always admits a subadditive modulus of continuity; in particular, real-valued as a function ω : [0, ∞) → [0, ∞). Indeed, it is immediate to check that the optimal modulus of continuity ωf defined above is subadditive if the domain of f is convex: we have, for all s and t:

Note that as an immediate consequence, any uniformly continuous function on a convex subset of a normed space has a sublinear growth: there are constants a and b such that |f(x)| ≤ a|x|+b for all x. However, a uniformly continuous function on a general metric space admits a concave modulus of continuity if and only if the ratios are uniformly bounded for all pairs (x, x′) with distance bounded away from zero; this condition is certainly satisfied by any bounded uniformly continuous function; hence in particular, by any continuous function on a compact metric space.

Sublinear moduli, and bounded perturbations from Lipschitz

[edit]

A sublinear modulus of continuity can easily be found for any uniformly continuous function which is a bounded perturbation of a Lipschitz function: if f is a uniformly continuous function with modulus of continuity ω, and g is a k Lipschitz function with uniform distance r from f, then f admits the sublinear modulus of continuity min{ω(t), 2r+kt}. Conversely, at least for real-valued functions, any special uniformly continuous function is a bounded, uniformly continuous perturbation of some Lipschitz function; indeed more is true as shown below (Lipschitz approximation).

Subadditive moduli, and extendibility

[edit]

The above property for uniformly continuous function on convex domains admits a sort of converse at least in the case of real-valued functions: that is, every special uniformly continuous real-valued function f : XR defined on a metric space X, which is a metric subspace of a normed space E, admits extensions over E that preserves any subadditive modulus ω of f. The least and the greatest of such extensions are respectively:

As remarked, any subadditive modulus of continuity is uniformly continuous: in fact, it admits itself as a modulus of continuity. Therefore, f and f* are respectively inferior and superior envelopes of ω-continuous families; hence still ω-continuous. Incidentally, by the Kuratowski embedding any metric space is isometric to a subset of a normed space. Hence, special uniformly continuous real-valued functions are essentially the restrictions of uniformly continuous functions on normed spaces. In particular, this construction provides a quick proof of the Tietze extension theorem on compact metric spaces. However, for mappings with values in more general Banach spaces than R, the situation is quite more complicated; the first non-trivial result in this direction is the Kirszbraun theorem.

Concave moduli and Lipschitz approximation

[edit]

Every special uniformly continuous real-valued function f : XR defined on the metric space X is uniformly approximable by means of Lipschitz functions. Moreover, the speed of convergence in terms of the Lipschitz constants of the approximations is strictly related to the modulus of continuity of f. Precisely, let ω be the minimal concave modulus of continuity of f, which is

Let δ(s) be the uniform distance between the function f and the set Lips of all Lipschitz real-valued functions on C having Lipschitz constant s :

Then the functions ω(t) and δ(s) can be related with each other via a Legendre transformation: more precisely, the functions 2δ(s) and −ω(−t) (suitably extended to +∞ outside their domains of finiteness) are a pair of conjugated convex functions,[1] for

Since ω(t) = o(1) for t → 0+, it follows that δ(s) = o(1) for s → +∞, that exactly means that f is uniformly approximable by Lipschitz functions. Correspondingly, an optimal approximation is given by the functions

each function fs has Lipschitz constant s and

in fact, it is the greatest s-Lipschitz function that realize the distance δ(s). For example, the α-Hölder real-valued functions on a metric space are characterized as those functions that can be uniformly approximated by s-Lipschitz functions with speed of convergence while the almost Lipschitz functions are characterized by an exponential speed of convergence

Examples of use

[edit]
  • Let f : [a, b] → R a continuous function. In the proof that f is Riemann integrable, one usually bounds the distance between the upper and lower Riemann sums with respect to the Riemann partition P := {t0, ..., tn} in terms of the modulus of continuity of f and the mesh of the partition P (which is the number )
  • For an example of use in the Fourier series, see Dini test.

History

[edit]

Steffens (2006, p. 160) attributes the first usage of omega for the modulus of continuity to Lebesgue (1909, p. 309/p. 75) where omega refers to the oscillation of a Fourier transform. De la Vallée Poussin (1919, pp. 7–8) mentions both names (1) "modulus of continuity" and (2) "modulus of oscillation" and then concludes "but we choose (1) to draw attention to the usage we will make of it".

The translation group of Lp functions, and moduli of continuity Lp.

[edit]

Let 1 ≤ p; let f : RnR a function of class Lp, and let hRn. The h-translation of f, the function defined by (τhf)(x) := f(xh), belongs to the Lp class; moreover, if 1 ≤ p < ∞, then as ǁhǁ → 0 we have:

Therefore, since translations are in fact linear isometries, also

as ǁhǁ → 0, uniformly on vRn.

In other words, the map h → τh defines a strongly continuous group of linear isometries of Lp. In the case p = ∞ the above property does not hold in general: actually, it exactly reduces to the uniform continuity, and defines the uniform continuous functions. This leads to the following definition, that generalizes the notion of a modulus of continuity of the uniformly continuous functions: a modulus of continuity Lp for a measurable function f : XR is a modulus of continuity ω : [0, ∞] → [0, ∞] such that

This way, moduli of continuity also give a quantitative account of the continuity property shared by all Lp functions.

Modulus of continuity of higher orders

[edit]

It can be seen that formal definition of the modulus uses notion of finite difference of first order:

If we replace that difference with a difference of order n, we get a modulus of continuity of order n:

See also

[edit]

References

[edit]
Revisions and contributorsEdit on WikipediaRead on Wikipedia
from Grokipedia
In mathematical analysis, the modulus of continuity of a function f:XYf: X \to Y between metric spaces (X,dX)(X, d_X) and (Y,dY)(Y, d_Y) is defined as the function ωf:[0,)[0,]\omega_f: [0, \infty) \to [0, \infty] given by ωf(δ)=sup{dY(f(x),f(y)):x,yX,dX(x,y)δ}\omega_f(\delta) = \sup \{ d_Y(f(x), f(y)) : x, y \in X, \, d_X(x, y) \leq \delta \}, which quantifies the maximum possible change in the function's values over all pairs of points separated by at most distance δ\delta. This measure captures the uniformity of the function's continuity across its domain, with ωf(0)=0\omega_f(0) = 0 always holding, and the function being non-decreasing and subadditive, meaning ωf(δ1+δ2)ωf(δ1)+ωf(δ2)\omega_f(\delta_1 + \delta_2) \leq \omega_f(\delta_1) + \omega_f(\delta_2) for all δ1,δ20\delta_1, \delta_2 \geq 0. A function ff is uniformly continuous if and only if limδ0+ωf(δ)=0\lim_{\delta \to 0^+} \omega_f(\delta) = 0. The concept was introduced by French mathematician in his 1910 paper "Sur la représentation trigonométrique approchée des fonctions satisfaisant à une condition de ," in the study of approximations for continuous functions, building on earlier work in by figures like René Baire. Lebesgue's formulation provided a tool to quantify continuity for approximation purposes, and it has since been generalized to arbitrary metric spaces. Key properties include the fact that ωf\omega_f is continuous at 0 if ff is uniformly continuous, and it provides a way to extend continuity notions beyond ε-δ definitions by encoding the "rate" of continuity. The modulus of continuity plays a central role in and approximation theory, where it helps characterize classes of functions with controlled regularity, such as functions (when ωf(δ)[K](/page/K)δ\omega_f(\delta) \leq [K](/page/K) \delta for some constant [K](/page/K)>[0](/page/0)[K](/page/K) > [0](/page/0)) and Hölder continuous functions (when ωf(δ)[K](/page/K)δα\omega_f(\delta) \leq [K](/page/K) \delta^\alpha for 0<α10 < \alpha \leq 1). It is essential for proving extension theorems, such as McShane-Whitney extensions that preserve the modulus, and for analyzing convergence in series expansions like Fourier series, where bounds on ωf\omega_f determine approximation rates by polynomials or trigonometric sums. Additionally, in stochastic processes and partial differential equations, it quantifies path regularity, as seen in bounds for the modulus of Brownian motion paths.

Definition and Properties

Formal Definition

In a metric space (X,d)(X, d), the modulus of continuity of a function f:XRf: X \to \mathbb{R} at a scale δ0\delta \geq 0 is defined by ω(f,δ)=sup{f(x)f(y):x,yX,d(x,y)δ}.\omega(f, \delta) = \sup \{ |f(x) - f(y)| : x, y \in X, \, d(x, y) \leq \delta \}. This quantity captures the maximum variation of ff over all pairs of points separated by at most distance δ\delta. The definition extends naturally to vector-valued functions f:XRmf: X \to \mathbb{R}^m (or more generally, to codomains that are metric spaces (Y,ρ)(Y, \rho)) by replacing the absolute value with the metric ρ\rho on the range, yielding ω(f,δ)=sup{ρ(f(x),f(y)):x,yX,d(x,y)δ}.\omega(f, \delta) = \sup \{ \rho(f(x), f(y)) : x, y \in X, \, d(x, y) \leq \delta \}. The modulus ω(f,):[0,)[0,)\omega(f, \cdot): [0, \infty) \to [0, \infty) quantifies uniform continuity of ff, in the sense that ff is uniformly continuous on XX if and only if limδ0+ω(f,δ)=0\lim_{\delta \to 0^+} \omega(f, \delta) = 0. By construction, ω(f,0)=0\omega(f, 0) = 0, since d(x,y)0d(x, y) \leq 0 forces x=yx = y and thus f(x)f(y)=0|f(x) - f(y)| = 0. Moreover, ω(f,)\omega(f, \cdot) is non-decreasing, as increasing δ\delta enlarges the set over which the supremum is computed. Lipschitz continuity provides a special case, where there exists K>0K > 0 such that ω(f,δ)Kδ\omega(f, \delta) \leq K \delta for all δ0\delta \geq 0.

Elementary Properties

The modulus of continuity of a function f:XRf: X \to \mathbb{R} defined on a (X,d)(X, d) is given by ω(f,δ)=sup{f(x)f(y):x,yX,d(x,y)δ}\omega(f, \delta) = \sup \{ |f(x) - f(y)| : x, y \in X, \, d(x, y) \leq \delta \} for δ0\delta \geq 0. This quantity inherits several elementary properties from its definition as a supremum. One fundamental property is monotonicity: ω(f,δ)\omega(f, \delta) is non-decreasing in δ\delta. To see this, suppose 0δ1δ20 \leq \delta_1 \leq \delta_2. The set of pairs (x,y)(x, y) with d(x,y)δ1d(x, y) \leq \delta_1 is contained in the set with d(x,y)δ2d(x, y) \leq \delta_2, so the supremum over the smaller set cannot exceed that over the larger set, yielding ω(f,δ1)ω(f,δ2)\omega(f, \delta_1) \leq \omega(f, \delta_2). Another immediate consequence is a lower bound for specific differences: for any x,yXx, y \in X with d(x,y)δd(x, y) \leq \delta, it holds that ω(f,δ)f(x)f(y)\omega(f, \delta) \geq |f(x) - f(y)|. This follows directly because the supremum includes the particular value f(x)f(y)|f(x) - f(y)| among its candidates. Regarding boundedness, if ff is bounded on XX with f=supxXf(x)<\|f\|_\infty = \sup_{x \in X} |f(x)| < \infty, then ω(f,δ)2f\omega(f, \delta) \leq 2 \|f\|_\infty for all δ0\delta \geq 0. Indeed, for any x,yXx, y \in X, f(x)f(y)f(x)+f(y)2f|f(x) - f(y)| \leq |f(x)| + |f(y)| \leq 2 \|f\|_\infty, so the supremum is similarly bounded. Finally, ω(f,δ)\omega(f, \delta) relates directly to the oscillation of ff, defined for a subset EXE \subseteq X as osc(f,E)=supx,yEf(x)f(y)\operatorname{osc}(f, E) = \sup_{x, y \in E} |f(x) - f(y)|. Specifically, ω(f,δ)\omega(f, \delta) equals the supremum of osc(f,E)\operatorname{osc}(f, E) over all subsets EXE \subseteq X with diameter at most δ\delta, i.e., sup{d(x,y):x,yE}δ\sup \{ d(x, y) : x, y \in E \} \leq \delta. This equivalence holds because the defining supremum of ω(f,δ)\omega(f, \delta) captures the maximum possible variation within any such bounded-diameter set, and balls of radius δ/2\delta/2 achieve sets of diameter δ\delta.

Remarks

The modulus of continuity quantifies uniform continuity by providing a uniform bound on function variations across the entire domain, in contrast to pointwise continuity, which allows the controlling δ to depend on the specific point in the domain. This uniform behavior ensures that the same δ(ε) works globally, highlighting a stricter condition than local pointwise limits at each point. Notational conventions for the modulus vary in the literature; while ω(δ) is standard, with δ denoting the distance parameter, some authors employ ω(h) where h represents the increment size. For multivariable functions on , the argument often involves a norm such as ||h|| to account for vector differences. The modulus of continuity is not unique, as any function that majorizes the original—such as ω(2δ)—also serves equivalently by providing a comparable bound on oscillations. One can always select a minimal modulus defined by the supremum of differences over balls of radius δ. In ordered spaces like the real line, semi-moduli of continuity extend the concept to one-sided continuity, measuring variations from the left or right to capture directional uniform behavior on intervals.

Special Classes

Sublinear Moduli

A modulus of continuity ω\omega is sublinear if it satisfies ω(λδ)λω(δ)\omega(\lambda \delta) \leq \lambda \omega(\delta) for all λ1\lambda \geq 1 and δ0\delta \geq 0. This condition is equivalent to the ratio ω(δ)/δ\omega(\delta)/\delta being non-increasing in δ>0\delta > 0. Functions admitting a sublinear modulus of continuity exhibit controlled growth that aligns closely with behavior, up to a bounded perturbation. Specifically, if f:XRf: X \to \mathbb{R} is a function on a (X,d)(X, d) with sublinear modulus ω\omega, then there exist constants K,C>0K, C > 0 depending only on ω\omega such that f(x)f(y)Kd(x,y)+C|f(x) - f(y)| \leq K \, d(x,y) + C for all x,yXx, y \in X. To see this, note that the non-increasing property of g(δ)=ω(δ)/δg(\delta) = \omega(\delta)/\delta implies g(δ)g(1)g(\delta) \leq g(1) for δ1\delta \geq 1, so ω(δ)=δg(δ)g(1)δ\omega(\delta) = \delta g(\delta) \leq g(1) \delta. For 0<δ10 < \delta \leq 1, ω(δ)ω(1)=g(1)\omega(\delta) \leq \omega(1) = g(1). Setting K=g(1)K = g(1) and C=g(1)C = g(1) yields ω(δ)Kδ+C\omega(\delta) \leq K \delta + C for all δ0\delta \geq 0. Thus, f(x)f(y)ω(d(x,y))Kd(x,y)+C|f(x) - f(y)| \leq \omega(d(x,y)) \leq K \, d(x,y) + C. This proof relies directly on the sublinearity assumption via the monotonicity of gg. This bounded perturbation from Lipschitz continuity has significant implications for approximation theory. Functions with sublinear moduli can be uniformly approximated by Lipschitz functions on compact subsets of the domain, with the approximation error controlled by the constants KK and CC. Such approximations are achieved constructively using linear operators, such as those based on partitions of unity in doubling metric spaces, ensuring the Lipschitz constant of the approximant is bounded independently of the specific function.

Subadditive Moduli

A subadditive modulus of continuity is a function ω:[0,)[0,)\omega: [0, \infty) \to [0, \infty) that is non-decreasing, satisfies ω(0)=0\omega(0) = 0, and obeys the subadditivity condition ω(δ+η)ω(δ)+ω(η)\omega(\delta + \eta) \leq \omega(\delta) + \omega(\eta) for all δ,η0\delta, \eta \geq 0. This property ensures that the modulus captures a form of controlled growth compatible with triangle inequalities in metric spaces, distinguishing it from more restrictive classes like sublinear moduli, which emphasize homogeneity. A key application of subadditive moduli arises in extension theorems for functions defined on subsets of metric spaces. Specifically, consider a real-valued function f:ARf: A \to \mathbb{R} defined on a subset AA of a metric space (X,d)(X, d), where f(x)f(y)ω(d(x,y))|f(x) - f(y)| \leq \omega(d(x, y)) for all x,yAx, y \in A and some subadditive modulus ω\omega. A variant of the McShane-Whitney extension theorem guarantees that ff extends to a function F:XRF: X \to \mathbb{R} preserving the same modulus, meaning F(x)F(y)ω(d(x,y))|F(x) - F(y)| \leq \omega(d(x, y)) for all x,yXx, y \in X. The extension is constructed explicitly as F(x)=infaA(f(a)+ω(d(x,a))),F(x) = \inf_{a \in A} \left( f(a) + \omega(d(x, a)) \right), assuming ff is bounded below (a sup construction handles the case when ff is bounded above). This formula ensures FF agrees with ff on AA and inherits the subadditivity for control. The proof of the modulus preservation relies on the inf-sup structure and subadditivity. To show F(x)F(y)ω(d(x,y))|F(x) - F(y)| \leq \omega(d(x, y)), assume without loss of generality that d(x,y)δd(x, y) \leq \delta. Then, F(y)=infbA(f(b)+ω(d(y,b)))infaA(f(a)+ω(d(y,a))).F(y) = \inf_{b \in A} \left( f(b) + \omega(d(y, b)) \right) \leq \inf_{a \in A} \left( f(a) + \omega(d(y, a)) \right). By the triangle inequality, d(y,a)d(x,y)+d(x,a)δ+d(x,a)d(y, a) \leq d(x, y) + d(x, a) \leq \delta + d(x, a), so subadditivity yields ω(d(y,a))ω(δ)+ω(d(x,a))\omega(d(y, a)) \leq \omega(\delta) + \omega(d(x, a)). Thus, f(a)+ω(d(y,a))f(a)+ω(δ)+ω(d(x,a)),f(a) + \omega(d(y, a)) \leq f(a) + \omega(\delta) + \omega(d(x, a)), and taking the infimum over aAa \in A gives F(y)F(x)+ω(δ)F(y) \leq F(x) + \omega(\delta). The reverse inequality follows symmetrically, confirming the extension preserves ω\omega. When AA is dense in XX and ff is uniformly continuous on AA with subadditive modulus ω\omega, the extension FF is the unique continuous extension to XX, as uniform continuity on dense subsets implies a unique limit, and the construction above ensures the modulus is retained. This extendibility highlights the role of subadditivity in bridging local control on subsets to global properties on larger spaces.

Concave Moduli

A concave modulus of continuity ω:[0,)[0,)\omega: [0, \infty) \to [0, \infty) is defined as a continuous, non-decreasing function with ω(0)=0\omega(0) = 0 that satisfies the concavity inequality ω(δ+η2)ω(δ)+ω(η)2\omega\left(\frac{\delta + \eta}{2}\right) \geq \frac{\omega(\delta) + \omega(\eta)}{2} for all δ,η0\delta, \eta \geq 0. This property ensures that ω\omega lies above its chords, reflecting a sublinear growth rate that is useful in controlling function behavior near points of continuity. Every modulus of continuity admits a least concave majorant ω\overline{\omega} such that ω(δ)ω(δ)2ω(δ)\omega(\delta) \leq \overline{\omega}(\delta) \leq 2\omega(\delta) for δ>0\delta > 0, allowing any uniform continuity estimate to be refined to a concave one without significant loss. Concave moduli play a key role in extension theorems for continuous functions. In particular, McShane's extension theorem guarantees that a function f:ERf: E \to \mathbb{R} defined on a closed EE of a , with concave modulus of continuity ω\omega, can be extended to a function f~\tilde{f} on the entire space preserving the same modulus ω\omega, thereby controlling the generalized Lipschitz constant supδ>0ω(δ)δ\sup_{\delta > 0} \frac{\omega(\delta)}{\delta}. This result generalizes the classical Kirszbraun theorem for functions (where ω(δ)=Kδ\omega(\delta) = K\delta) to broader classes, enabling extensions in s while maintaining bounds on the growth rate dictated by ω\omega. For instance, in Hilbert spaces, such extensions align with vector-valued generalizations, ensuring the controlled modulus translates to bounded in the target space. In Lipschitz approximation theory, concave moduli provide sharp error estimates. For a uniformly continuous function ff on a doubling metric space with concave modulus ω\omega, there exists a function gg with constant K=ω(δ)δK = \frac{\omega(\delta)}{\delta} such that the uniform approximation error fgω(δ)\|f - g\| \leq \omega(\delta) for any δ>0\delta > 0. This bound is optimal in scale, as the choice of δ\delta balances the trade-off between the constant and the error term, with concavity ensuring ω(δ)δ\frac{\omega(\delta)}{\delta} is non-increasing. Representative examples include Hölder moduli ω(δ)=δα\omega(\delta) = \delta^\alpha for 0<α10 < \alpha \leq 1, which are concave and yield error bounds of order δα\delta^\alpha under constant δα1\delta^{\alpha-1}.

Applications

Examples in Analysis

In the Weierstrass approximation theorem, the modulus of continuity provides quantitative bounds on the error when approximating continuous functions by polynomials on a compact interval. Specifically, for a function fC[0,1]f \in C[0,1], the Bernstein polynomials fn(x)=j=0nf(j/n)(nj)xj(1x)njf_n(x) = \sum_{j=0}^n f(j/n) \binom{n}{j} x^j (1-x)^{n-j} satisfy ffn<94ω(f,n1/2)\|f - f_n\|_\infty < \frac{9}{4} \omega(f, n^{-1/2}), where ω(f,δ)\omega(f, \delta) is the modulus of continuity of ff. This estimate demonstrates how the rate of approximation improves with the regularity measured by the modulus, as smaller ω(f,δ)\omega(f, \delta) for small δ\delta yields faster convergence to ff. Dini's test leverages the modulus of continuity to establish uniform convergence of Fourier series for continuous functions on a closed interval [a,b][a, b]. If ff is continuous on [a,b][a, b] with modulus of continuity ω(δ)\omega(\delta), and if 0πω(δ)δdδ<\int_0^\pi \frac{\omega(\delta)}{\delta} \, d\delta < \infty, then the Fourier series of ff converges uniformly to ff on [a,b][a, b]. This condition quantifies the smoothness required for uniform convergence, distinguishing it from mere pointwise results by ensuring the partial sums remain controlled globally. The Arzelà-Ascoli theorem employs the modulus of continuity to characterize precompact families of continuous functions on a compact metric space (T,d)(T, d). A subset FC(T,R)F \subset C(T, \mathbb{R}) is relatively compact in the supremum norm if and only if it is pointwise bounded and uniformly equicontinuous, meaning there exists a common modulus of continuity ω(δ)\omega(\delta) such that supfFωf(δ)0\sup_{f \in F} \omega_f(\delta) \to 0 as δ0\delta \to 0. Families sharing a uniform modulus are thus precompact, enabling the extraction of uniformly convergent subsequences essential for proving existence in differential equations and variational problems. A prominent example of a modulus of continuity arises in Hölder continuous functions, where ff is α\alpha-Hölder continuous with 0<α10 < \alpha \leq 1 if there exists K>0K > 0 such that ω(f,δ)Kδα\omega(f, \delta) \leq K \delta^\alpha. This sublinear modulus captures fractional regularity stronger than mere continuity but weaker than differentiability, playing a key role in theorems and regularity theory for partial differential equations.

Moduli in L^p Spaces

In the context of L^p spaces on \mathbb{R}^n with 1 \leq p < \infty, the modulus of continuity is defined with respect to the translation operator \tau_h f(x) = f(x - h), where h \in \mathbb{R}^n. Specifically, for f \in L^p(\mathbb{R}^n), the L^p modulus of continuity is given by ωp(f,δ)=suphδτhffp,\omega_p(f, \delta) = \sup_{\|h\| \leq \delta} \|\tau_h f - f\|_p, where |\cdot|_p denotes the L^p norm (Rnpdx)1/p.\left( \int_{\mathbb{R}^n} | \cdot |^p \, dx \right)^{1/p}. This quantity measures the uniform variation of f under small translations in the L^p norm. The modulus \omega_p(f, \delta) characterizes the continuity of f with respect to the translation group action on L^p spaces. For 1 \leq p < \infty, the translation operators are strongly continuous, meaning that for every f \in L^p(\mathbb{R}^n), \lim_{\delta \to 0} \omega_p(f, \delta) = 0. This follows from the density of continuous compactly supported functions in L^p and the dominated convergence theorem applied to the differences \tau_h f - f. However, this convergence is not uniform over the unit ball of L^p, as the space lacks uniform continuity under translations due to the unbounded nature of the domain and the lack of compactness. Steklov means provide a useful averaging technique to bound and estimate the L^p modulus of continuity. The first-order Steklov mean of f is defined as s_h f(x) = \frac{1}{h} \int_0^h f(x + t) , dt for h > 0 (with analogous definitions in higher dimensions). It satisfies |s_h f - f|_p \leq \omega_p(f, h), and more generally, the modulus can be bounded by integrals involving Steklov averages, such as \omega_p(f, \delta) \leq \frac{2}{\delta} \int_0^\delta \omega_p(f, t) , dt. These estimates arise from properties of the generalized translation and are employed to derive quantitative rates of convergence for approximations in L^p settings.

Higher-Order Moduli

The higher-order modulus of continuity, often referred to as the modulus of smoothness of order kk for kNk \in \mathbb{N}, extends the first-order modulus to characterize smoother functions via iterated finite differences. For a function ff defined on a compact interval or the circle T\mathbb{T}, the kk-th finite difference operator is defined recursively by Δh1f(x)=f(x+h)f(x)\Delta_h^1 f(x) = f(x + h) - f(x) and Δhkf(x)=Δhk1(f(x+h))Δhk1f(x)\Delta_h^k f(x) = \Delta_h^{k-1} (f(x + h)) - \Delta_h^{k-1} f(x) for h0h \neq 0, or explicitly as Δhkf(x)=i=0k(1)ki(ki)f(x+ih).\Delta_h^k f(x) = \sum_{i=0}^k (-1)^{k-i} \binom{k}{i} f(x + i h). The modulus of smoothness of order kk is then given by ωk(f,δ)=sup0<hδΔhkf,\omega_k(f, \delta) = \sup_{0 < |h| \leq \delta} \|\Delta_h^k f\|_\infty, where \|\cdot\|_\infty denotes the supremum norm. This quantity measures the uniform control of the kk-th order variations of ff over scales up to δ>0\delta > 0. If ff is kk-times continuously differentiable on its domain, the higher-order modulus relates directly to the kk-th via the integral representation Δhkf(x)=0h0u10uk1f(k)(x+u1++uk)dukdu1,\Delta_h^k f(x) = \int_0^h \int_0^{u_1} \cdots \int_0^{u_{k-1}} f^{(k)}(x + u_1 + \cdots + u_k) \, du_k \cdots du_1, which implies the estimate ωk(f,δ)δkf(k).\omega_k(f, \delta) \leq \delta^k \|f^{(k)}\|_\infty. Conversely, under suitable conditions, the behavior ωk(f,δ)=O(δk)\omega_k(f, \delta) = O(\delta^k) as δ0\delta \to 0 implies that ff admits a kk-th in the sense of distributions, with boundedness in appropriate norms. This equivalence highlights how higher-order moduli quantify the scale of smoothness beyond mere continuity. Zygmund classes provide a refinement for borderline smoothness cases using these moduli. Zygmund classes of order kk consist of functions where the (k+1)(k+1)-th modulus of smoothness satisfies ωk+1(f,δ)=O(δk+1log(1/δ))\omega_{k+1}(f, \delta) = O(\delta^{k+1} \log(1/\delta)), capturing logarithmic perturbations in , such as in the classical Zygmund space, distinguishing them from Ck+1C^{k+1} functions while indicating kk-times differentiability with Zygmund continuity for the kk-th . These classes arise naturally in and approximation theory. In applications to s, higher-order moduli estimate embeddings into spaces. For the Wk,p(Ω)W^{k,p}(\Omega) with ΩRn\Omega \subset \mathbb{R}^n and kp>nkp > n, the embedding into C(Ω)C(\overline{\Omega}) is continuous, and the modulus ωk(f,δ)\omega_k(f, \delta) provides optimal control on the Hölder continuity of functions in this space, with ωk(f,δ)δα[fLp+j=1kjfLp]\omega_k(f, \delta) \lesssim \delta^\alpha [\|f\|_{L^p} + \sum_{j=1}^k \|\nabla^j f\|_{L^p}] for some α>0\alpha > 0 depending on k,p,nk, p, n. This characterizes the gain in regularity, ensuring functions are continuous with a specific decay rate for their oscillations, crucial for elliptic PDEs and variational problems.

History

Origins

The concept of the modulus of continuity traces its origins to the early development of rigorous in the , particularly in Augustin-Louis Cauchy's foundational contributions to limits and continuity. In his 1821 textbook Cours d'analyse de l'École Royale Polytechnique, Cauchy introduced the epsilon-delta formulation of continuity, which quantified how small changes in the input affect the output of a function, providing an early metric for assessing continuity that implicitly foreshadowed the modulus as a tool for measuring uniform variation over intervals. This approach emphasized the need for bounds on function oscillations, setting the stage for more explicit quantitative measures in later work. An initial, implicit application of ideas akin to the modulus of continuity emerged in Ulisse Dini's 1878 investigations into the . In his Lezioni di analisi infinitesimale, Dini examined conditions on function oscillations near points of interest to determine series convergence, employing bounds on differences that effectively captured local continuity behavior without formalizing the modulus. This work highlighted the utility of such metrics in , influencing subsequent studies on series representation. The formal definition of the modulus of continuity was introduced by in 1905, within his studies of for real-valued functions. Lebesgue conceptualized it as a non-decreasing function ω(δ) that bounds the supremum of |f(x) - f(y)| for |x - y| ≤ δ, enabling precise characterization of how uniformly a function approaches its values across domains. This appeared in his paper "Sur les fonctions représentables analytiquement," where it facilitated analysis of representability and integration properties. Parallel developments occurred in the Russian mathematical school, notably through Sergei 's papers from to on . In his 1912 work "Démonstration du théorème de Weierstrass fondée sur le calcul des probabilités," employed the modulus to estimate errors by polynomials, proving the Weierstrass theorem via probabilistic methods and demonstrating how the modulus controls convergence rates. Subsequent 1914 papers extended this to trigonometric approximations, solidifying the modulus's role in quantitative theory within the Russian tradition.

Key Developments

In 1935, published his seminal work Trigonometric Series, which introduced higher-order moduli of continuity as a tool for analyzing the of functions represented by trigonometric series. These moduli, defined iteratively through finite differences, allowed Zygmund to derive precise estimates for the rate of convergence of and the behavior of partial sums for functions with controlled higher-order variations. Building on earlier concepts of , the 1930s saw significant advances in extension theorems tailored to functions governed by specific moduli. In 1934, Mojżesz Kirszbraun proved that continuous functions—a subclass with linear modulus of continuity ω(t) = Kt—from subsets of to another can be extended to the entire space while preserving the same constant, a result pivotal for and problems in . Complementing this, Edward J. McShane in 1934 established an extension for real-valued functions defined on subsets of metric spaces, ensuring the extension retains the original modulus of continuity, thus generalizing extensions to broader classes of uniformly continuous functions. Following , the 1940s and 1950s marked a surge in the application of moduli of continuity within theory, particularly through the works of Jean Favard and contemporaries like and Aleksandr Timan. Favard's contributions, including his development of operators and estimates for , utilized moduli to quantify the best rates for continuous functions on compact sets, establishing direct theorems linking the modulus to the error in trigonometric and algebraic approximations. These efforts solidified moduli as essential for Jackson-type inequalities, where the approximation order is bounded by ω(f, 1/n) for degree-n polynomials. In the mid-20th century, moduli of continuity found profound applications in nonlinear analysis and the regularity theory of partial differential equations (PDEs). Ennio De Giorgi's 1957 breakthrough demonstrated that weak solutions to linear elliptic PDEs in higher dimensions are Hölder continuous, employing an iterative argument that refines an initial L² modulus of continuity into a Hölder-type estimate through oscillation decay and higher integrability. This method, independent of John Nash's concurrent probabilistic approach, revolutionized PDE regularity by showing how controlled moduli imply analyticity under suitable conditions, influencing subsequent developments in quasilinear and nonlinear elliptic systems.

References

Add your contribution
Related Hubs
User Avatar
No comments yet.