HOME

TheInfoList



OR:

The Titchmarsh convolution theorem describes the properties of the support of the
convolution In mathematics (in particular, functional analysis), convolution is a operation (mathematics), mathematical operation on two function (mathematics), functions f and g that produces a third function f*g, as the integral of the product of the two ...
of two functions. It was proven by
Edward Charles Titchmarsh Edward Charles "Ted" Titchmarsh (June 1, 1899 – January 18, 1963) was a leading British mathematician. Education Titchmarsh was educated at King Edward VII School (Sheffield) and Balliol College, Oxford, where he began his studies in October 1 ...
in 1926.


Titchmarsh convolution theorem

If \varphi(t)\, and \psi(t) are integrable functions, such that :\varphi * \psi = \int_0^x \varphi(t)\psi(x-t)\,dt=0
almost everywhere In measure theory (a branch of mathematical analysis), a property holds almost everywhere if, in a technical sense, the set for which the property holds takes up nearly all possibilities. The notion of "almost everywhere" is a companion notion to ...
in the interval 0, then there exist \lambda\geq0 and \mu\geq0 satisfying \lambda+\mu\ge\kappa such that \varphi(t)=0\, almost everywhere in 0 and \psi(t)=0\, almost everywhere in 0 As a corollary, if the integral above is 0 for all x>0, then either \varphi\, or \psi is almost everywhere 0 in the interval [0,+\infty). Thus the convolution of two functions on [0,+\infty) cannot be identically zero unless at least one of the two functions is identically zero. As another corollary, if \varphi * \psi (x) = 0 for all x\in [0, \kappa] and one of the function \varphi or \psi is almost everywhere not null in this interval, then the other function must be null almost everywhere in [0,\kappa]. The theorem can be restated in the following form: :Let \varphi, \psi\in L^1(\mathbb). Then \inf\operatorname \varphi\ast \psi=\inf\operatorname \varphi+\inf\operatorname \psi if the left-hand side is finite. Similarly, \sup\operatorname \varphi\ast\psi = \sup\operatorname\varphi + \sup\operatorname \psi if the right-hand side is finite. Above, \operatorname denotes the support of a function f (i.e., the closure of the complement of f−1(0)) and \inf and \sup denote the
infimum and supremum In mathematics, the infimum (abbreviated inf; : infima) of a subset S of a partially ordered set P is the greatest element in P that is less than or equal to each element of S, if such an element exists. If the infimum of S exists, it is unique, ...
. This theorem essentially states that the well-known inclusion \operatorname\varphi\ast \psi \subset \operatorname\varphi+\operatorname\psi is sharp at the boundary. The higher-dimensional generalization in terms of the
convex hull In geometry, the convex hull, convex envelope or convex closure of a shape is the smallest convex set that contains it. The convex hull may be defined either as the intersection of all convex sets containing a given subset of a Euclidean space, ...
of the supports was proven by Jacques-Louis Lions in 1951: :If \varphi, \psi\in\mathcal'(\mathbb^n), then \operatorname \operatorname \varphi\ast \psi=\operatorname \operatorname \varphi+\operatorname\operatorname \psi Above, \operatorname denotes the
convex hull In geometry, the convex hull, convex envelope or convex closure of a shape is the smallest convex set that contains it. The convex hull may be defined either as the intersection of all convex sets containing a given subset of a Euclidean space, ...
of the set and \mathcal' (\mathbb^n) denotes the space of distributions with
compact support In mathematics, the support of a real-valued function f is the subset of the function domain of elements that are not mapped to zero. If the domain of f is a topological space, then the support of f is instead defined as the smallest closed ...
. The original proof by Titchmarsh uses complex-variable techniques, and is based on the Phragmén–Lindelöf principle, Jensen's inequality, Carleman's theorem, and Valiron's theorem. The theorem has since been proven several more times, typically using either real-variable or complex-variable methods.
Gian-Carlo Rota Gian-Carlo Rota (April 27, 1932 – April 18, 1999) was an Italian-American mathematician and philosopher. He spent most of his career at the Massachusetts Institute of Technology, where he worked in combinatorics, functional analysis, proba ...
has stated that no proof yet addresses the theorem's underlying combinatorial structure, which he believes is necessary for complete understanding.


References

{{reflist Theorems in harmonic analysis Theorems in complex analysis Theorems in real analysis