D'Alembert's formula 2026-10-14
For constant wave speed , the whole-line Cauchy problem
has the unique classical solution, for and ,
The first term evolves displacement released from rest; the second evolves initial velocity. The factor converts an integral of velocity over distance into displacement. On a finite string the formula applies before the backward characteristic curves reach an endpoint, or globally after an extension that enforces the boundary conditions. [ref]
For a completely smooth example, choose a bump function with compact support:
where sets the half-width and sets the initial peak. Then
At the two copies coincide, recovering peak . At , . At the pulses are separated, centred at , each of width and peak . Zero initial velocity forces equal left and right contributions; a purely right-moving initial profile instead requires . Thus “released from rest” and “launched to the right” describe different Cauchy data.
Figure 1.
A smooth pulse released from rest splits in two, while backward characteristics select a causal interval
. Details.
The domain of dependence of , for , is contained in on the initial line. More precisely, displacement contributes only through the two endpoints, while initial velocity contributes throughout the interval. With , and , that interval is . Changing either initial datum outside it cannot change . If both initial data vanish outside , the solution vanishes outside : this is finite propagation speed. The expanding interval bounds possible influence; it need not be filled by nonzero displacement, as the separated bumps demonstrate.
Historically, d'Alembert studied the vibrating-string problem in “Recherches sur la courbe que forme une corde tendue mise en vibration”, in the Berlin Academy's volume for the year 1747, pages 214–219. The memoir introduces the differential equation and integrates it through two arbitrary one-variable functions. The original geometric problem makes the formula's enduring appeal clear: arbitrary initial shapes can be handled without first decomposing them into normal modes. [ref]
For a brief derivation, use characteristic coordinates and . The chain rule gives , so . The initial conditions yield and . Integrating these relations gives the displayed formula; the arbitrary integration constants cancel in their sum.
For the unit ball of measured in the uniform metric, . The lower bound uses disjoint bump functions of spatial scale , height proportional to and independently chosen zero/one coefficients: there are functions separated at scale . For the upper bound, Multivariable Jackson approximation gives a trigonometric polynomial of degree . Its coefficients are bounded and can be rounded with coefficient accuracy proportional to divided by the coefficient count. Counting those rounded coefficient arrays supplies the logarithmic factor. The continuous-function unit ball without derivative bounds has infinite entropy for , by an infinite sequence of disjoint height-one bumps.
Finite propagation speed Created 2026-09-28 Updated 2026-10-14
For the unforced, constant- one-dimensional wave equation, finite propagation speed says that changing Cauchy data outside cannot change the solution at , where and . This interval is the initial-data domain of dependence. Its endpoints are found by following the two characteristic lines for the one-dimensional wave equation backwards from the observation. D'Alembert's formula makes the dependence sharper: initial displacement is sampled at the endpoints, while initial velocity is integrated over the entire interval.[ref]
Figure 1.
Synthetic constant-speed spacetime geometry: backward dependence and widening support
. Details.
For the synthetic choice , has initial-data domain of dependence . A change confined near is irrelevant to that observation, however large it is. If both Cauchy data vanish outside , their compact support can influence only at . Thus an observer at sees exactly zero displacement for . There is no nonzero precursor beyond this causal cone for the constant-speed wave equation in the ideal model. This is an exact statement about the partial differential equation, stronger than an experimental failure to detect a small signal.
Support widening for the wave equation is a bound on possible influence, not a claim that every point inside the expanding interval moves. A bump function released with zero initial velocity splits into two separated travelling waves; the middle can become empty. An initial kick can instead leave an interior tail, as in the D'Alembert formula with initial velocity. Consequently finite propagation speed does not imply the Strong Huygens principle. A finite string needs boundary conditions, and the whole-line formula applies locally only until its backward causal cone for the constant-speed wave equation encounters an endpoint.
Compactly supported Hamiltonian vector fields can attain any prescribed tangent vector at a point of a symplectic manifold: prescribe the derivative of a local Hamiltonian and multiply by a bump function. Composing flows for a tangent basis gives an open orbit by the inverse function theorem. Every orbit is open, so on a connected manifold the compactly supported Hamiltonian transformations act transitively.
For a nonnegative smooth bump function supported in an open set, multiplying a Riemannian metric by increases volume there for while leaving the metric elsewhere fixed. For distinct regular compact domains a perturbation supported in the interior of one outside the other breaks equal volume, and therefore breaks any isometry between the domains. The perturbations tend to the original metric in the smooth topology.
For a bounded Fourier multiplier operator on and a bump function , the displayed convolution identity follows by multiplying Fourier transforms. The convergence holds in and almost everywhere by the approximate identity theorem, after accounting for the integral of the kernel. The limit is when . Smoothness and compact support alone do not imply this normalization.
One-dimensional wave equation Created 2026-09-28 Updated 2026-10-14
On the whole line, the homogeneous one-dimensional wave equation with constant wave speed is
Here is displacement in the string interpretation; is initial displacement and is initial velocity. Its two directions of travel give
This is D'Alembert's formula, including both Cauchy data. The countertravelling decomposition of the one-dimensional wave equation identifies as the right-moving travelling wave and as the left-moving travelling wave. Their sum is permitted by the superposition principle. For and , it is a classical solution. More generally, travelling waves with profiles and that are locally integrable functions solve the equation as distributions, with derivatives interpreted distributionally.[ref]
Figure 1.
Synthetic pulse solutions: release from rest splits a profile, while matched initial velocity launches it rightward
. Details.
The synthetic diagram uses the smooth bump function defined in D'Alembert's formula, with and . Releasing this displacement from rest, , gives . Each emerging travelling wave has half the original peak. Launching the identical initial displacement solely to the right instead requires and gives , . At , the released profiles have peaks at , while the launched profile has peak at . These are calculated model values. A purely left-moving launch requires . The initial velocity therefore selects the balance of directions; the initial shape alone does not.
Use the Fourier transform convention . The deleted-ball kernel need not be integrable at infinity, so first work with finite annuli. Write
We will prove a uniform bound, convergence as , and then convergence as . This makes all Fourier-transform assertions precise for the annularly cancelling singular convolution kernel.
Fix and put , so . For , let and define
The Hörmander integral kernel condition gives
On changing variables , the phase factor shows . The symmetric difference between and lies in the two shells whose radii are within of and . On each such shell, the kernel's size bound gives, by polar integration,
Therefore
and adding the two comparisons proves the oscillatory tail estimate for a singular kernel:
The integral on the right is at most . Moreover, for fixed , it tends to zero as because the translated difference is absolutely integrable outside . The shell term also tends to zero. Thus the far Fourier integral is Cauchy and converges as its outer radius tends to infinity.
Set . If , annular cancellation allows subtraction of the constant phase on the near annulus:
The same estimate applies to a shorter near annulus when . The far annulus is bounded by , using the tail estimate; if , apply that estimate with . At the annular integral vanishes by cancellation. We have proved
For each fixed , the size bound makes , and in as . By the Plancherel theorem, their Fourier transforms converge in to . The pointwise improper limits just established identify this transform, up to a null set, with
For example identification follows by selecting an almost-everywhere convergent subsequence from the convergence. Hence
The near-annulus integral with the constant phase subtracted converges absolutely at zero, since its bound is proportional to . The far integral has already converged. Therefore for every , with the same uniform bound; the value at zero may be set arbitrarily.
For , the convolution is absolutely convergent for each by Cauchy-Schwarz inequality. Its Fourier transform is : first prove this for Schwartz functions and then approximate any input. The convolutions converge uniformly under this approximation by the same Cauchy-Schwarz bound, and the multiplier outputs converge in by their uniform operator bound, so these two definitions agree. Define the bounded Fourier multiplier operator by . Dominated convergence theorem and the Plancherel theorem now give
For the final request, use a normalized bump function, , so that its dilates form an approximate identity. Multiplying Fourier transforms gives
These products are integrable by Cauchy-Schwarz inequality, since , and also define functions because and are bounded. Thus the convolution identity is justified even though need not be in :
The allowed standard approximate identity results, applied to , prove convergence to in norm and almost everywhere. This is the mass normalization in mollified singular integrals; it does not require proving almost-everywhere convergence of the sharp truncations .
If “bump function” means merely smooth with compact support, the stated limit needs the unit-integral qualification. For arbitrary such , the limit is instead. This is also the almost-everywhere limit: at each Lebesgue point of , subtract inside the convolution and bound the remaining local average by the boundedness and compact support of . As a concrete counterexample without normalization, take in dimension one and for a unit-integral mollifier . This kernel has the required size, odd annular cancellation, and translation-difference integral on for every . Its limit operator is the nonzero Hilbert transform; by the Hilbert-transform Fourier multiplier, it is an isometry. For any nonzero the mollified limit is , not .
Let be the uncentered maximal function of , defined by its averages over balls. First establish the strong estimate needed below. The uncentered maximal weak-type inequality gives the weak bound with , and plainly for bounded inputs. For , split it into its parts on and . The first part is in , since , and the second part contributes at most to the maximal function. Sublinearity therefore gives
Integrating this bound with layer cake representation and Tonelli theorem yields
This proves the strong Lp bound from weak L1 and L-infinity bounds directly. In particular is finite almost everywhere.
Now split the positive Riesz potential of at a radius . In the near region, decompose into annuli . On the th annulus,
The geometric series converges because . In the far region, Hölder's inequality, with , gives
The radial integral is finite exactly because . Combining these bounds, including the fixed Riesz normalization constant, gives
For , choose . If , every ball average vanishes and almost everywhere, so the assertion is trivial. The zero-norm case is likewise trivial. The resulting Hedberg inequality is
This proves absolute convergence of the defining integral for almost every , also for signed or complex . Put . The proposed exponent satisfies , so . Raising the pointwise estimate to the th power and using the proved maximal bound gives
Thus the Hardy–Littlewood–Sobolev inequality follows from the estimates just derived, rather than being quoted in place of its proof.
For uniqueness of the target exponent, suppose such a uniform estimate holds with index instead. Choose a nonzero nonnegative bump function and let for . Homogeneity of the Riesz potential gives
The assumed estimate at makes the nonzero output's norm finite. For all it must therefore satisfy
with when . Letting tend to zero or infinity forces the power of to vanish:
Hence no other target index is possible.
For the Sobolev embedding, take and , so the preceding result is available with . For , the vector field has zero divergence in away from . Integrating by parts outside the ball , its inner boundary contributes times the spherical average of about . The outer boundary contributes zero because has compact support. Letting proves
The absolute value is at most . Thus
For a general member of the first-order Sobolev space , approximate in the Sobolev norm by compactly supported smooth functions. This density of smooth functions in a Sobolev space follows from cutoffs tending to one and subsequent mollification: the cutoff-gradient term tends to zero in , and a mollifier approximates both the function and each weak derivative. The displayed estimate makes the approximants Cauchy in . Their limit is the original function, so subsequences converging almost everywhere identify the limit with it. This proves continuous embedding. The range is essential for this consequence; the formula is not a general critical embedding into .
Let be the local flow of a vector field . The Lie derivative of a differential form is . We prove Cartan's magic formula
Both sides are degree-zero derivations of an algebra on the exterior algebra of differential forms. They agree on a function , since . They also agree on : pullback commutes with the exterior derivative, so , while . Locally every differential form is a sum of products of functions and coordinate differentials, proving the identity in every degree.
For a compactly supported Hamiltonian vector field , take the convention . Since , Cartan's magic formula gives , so its complete flow of a vector field consists of symplectomorphisms. Given and , a bump function lets us choose a compactly supported with , and hence . Choose such fields for a basis of . Their successive small-time flows give a map with invertible derivative at the origin. The inverse function theorem makes the orbit of open. Every orbit is open; because is connected, there is only one orbit. Thus the compactly supported symplectomorphisms act transitively on points, by Hamiltonian transitivity on a connected symplectic manifold.
On the unit sphere, the standard symplectic area is . The equator has complementary disks of areas , whereas the latitude at height has complementary disks of areas : the cap above height has area . A symplectomorphism must preserve the unordered pair of complementary areas. Therefore no such symplectomorphism exists, by complementary areas obstruct symplectic equivalence of separating curves.
Figure 1.
Complementary sphere areas distinguish the equator from the latitude at height one half
. Details.
Use and the uniform metric . Let be the least number of radius- balls in this metric covering . The Kolmogorov entropy, equivalently metric entropy, is
It is infinite if no finite cover exists; set the entropy of the empty set to zero. Changing the logarithm base or requiring centres in changes only the constants and resolution factors in the estimates below.
For an explicit appropriate norm, take
An equivalent standard norm gives the same exponents, with different constants. We prove the two bounds for the entropy of a smooth periodic function ball separately.
For the lower bound, choose a nonnegative bump function with and . Let bound all its derivatives of orders at most , and choose with . For sufficiently small , place translates of its scaled support disjointly on the torus, for instance by taking grid centres separated by in a fundamental cube. Define the real functions
using periodic extension. Disjointness means that at any point only one summand contributes. For every , its derivative is bounded by . Thus every lies in . If , evaluate at a centre where the binary coefficients differ to obtain
Choose for sufficiently small . The functions are more than apart, so no radius- ball covers two of them. The metric covering number consequently satisfies
To include the remaining , observe that the two constant functions belong to the ball and require distinct covering balls. Reducing the positive lower-bound constant extends the estimate over that fixed remaining interval.
For the upper bound, use this precise version of multivariable Jackson approximation: for every and integer , there exists a real trigonometric polynomial with in every coordinate and
Choose . Then the approximation error is at most , and . Write . There are coefficients, and normalized integration gives .
Round their real and imaginary parts with mesh , respecting so the rounded polynomial remains real. Each coefficient changes by at most , and hence the uniform change in the polynomial is at most . At most choices are needed; allowing redundant choices only enlarges this bound. These rounded polynomials form an -net for the ball, and
Here , and the last logarithm absorbs the constant and for . Together the bounds give
For the unit ball of alone, take infinitely many disjoint small neighbourhoods and a height-one continuous bump supported in each. Distinct such functions have uniform distance one. Thus no finite -net exists when , and
The derivative bound was essential for total boundedness; mere continuity gives no common small-scale oscillation bound.
For the final composition estimate, interpret outer periodic functions on by their -periodic extensions to . Since , each satisfies
by integrating its first partial derivatives along coordinate segments. This uniform Lipschitz continuity controls errors in the inner functions.
Choose an outer net of radius for and an inner net of radius for . For each choose corresponding approximants . No derivative bound for is needed: use the derivative bound of before replacing the outer function. Pointwise,
All composed centres are continuous. Multiplying the numbers of outer and inner choices gives the entropy of Lipschitz compositions inequality
Apply the proved upper bound with dimension , and the assumed estimate for . Fixed rescalings of preserve its exponent and change by only an additive constant. Therefore
In this context a nowhere locally homogeneous metric, also called a bumpy metric, is a smooth Riemannian metric for which no two distinct nonempty open subsets are isometric with their induced metrics. Equivalently every local isometry between open subsets is the identity wherever defined: a nonidentity local isometry sends some point to a distinct point, and restriction to sufficiently small disjoint neighborhoods would violate the first formulation. This is the local-isometry meaning of the terminology here; degeneracy of periodic geodesics is a different use of the word bumpy.
Sunada's local isometry lemma states that on a compact smooth manifold without boundary of dimension the nowhere locally homogeneous metrics contain a residual set in the space of smooth Riemannian metrics with its topology. In particular they are dense, by the Baire category theorem. A residual set is a countable intersection of open dense sets. The dimension assumption matters: every one-dimensional Riemannian metric is locally in arclength coordinates and has local translations.
The jet bundle of maps consists of equivalence classes of smooth maps near , where two maps agree to order at in coordinate charts. Its projection to sends to . For a multi-index in variables there are derivatives of order . Thus a coordinate chart consists of the source point, the target point, and coefficients for every derivative order through . Summing the counts gives
This includes . The fibre over is the space of truncated Taylor maps with fixed constant term , locally modeled on
For its identification with is canonical. For higher , changes of target coordinates mix derivatives of different orders, so this is a coordinate or connection-dependent description, not a canonical vector-bundle identification. The truncation is an affine bundle modeled on the pullback of over .
For the density assertion put and . Their closures must be distinct. If , the identity is an isometry for every Riemannian metric, and the requested complement is empty. Under the intended distinct-domain assumption, the smooth closed-ball hypothesis makes and regular closed domains, equal to the closures of their interiors. After interchanging them if necessary, there is a nonempty open set with compact closure in . Otherwise each interior would be contained in the other closure, forcing .
Take any smooth Riemannian metric . If , it already lies outside , because an isometry preserves the Riemannian volume form. If the volumes agree, choose a nonzero nonnegative smooth bump function supported in and set
These are positive definite Riemannian metrics, they agree with on , and in as , since every derivative of is times a fixed compactly supported smooth tensor. Their Riemannian volume forms satisfy
Hence whereas for every . In particular
The two domains cannot be isometric for . Every neighborhood of therefore meets the complement of , proving
This localized volume perturbation proves the requested density even when the two domains overlap, and works in every positive dimension. It does not by itself prove the stronger residual local-isometry statement: fixed isometric closures and arbitrary isometric open subsets are different conditions.
Smooth cutoff function Created 2026-09-28 Updated 2026-10-06
A smooth cutoff function is a smooth function used to localize an argument, typically equal to one on one region and zero outside a slightly larger region. Such functions can be built from bump functions and smooth partitions of unity.