Are you an EPFL student looking for a semester project?
Work with us on data science and visualisation projects, and deploy your project as an app on top of GraphSearch.
Concept
Titchmarsh convolution theorem
Summary
The Titchmarsh convolution theorem describes the properties of the support of the convolution of two functions. It was proven by Edward Charles Titchmarsh in 1926.
If and are integrable functions, such that
almost everywhere in the interval , then there exist and satisfying such that almost everywhere in and almost everywhere in
As a corollary, if the integral above is 0 for all then either or is almost everywhere 0 in the interval Thus the convolution of two functions on cannot be identically zero unless at least one of the two functions is identically zero.
As another corollary, if for all and one of the function or is almost everywhere not null in this interval, then the other function must be null almost everywhere in .
The theorem can be restated in the following form:
Let . Then if the left-hand side is finite. Similarly, if the right-hand side is finite.
Above, denotes the support of a function and and denote the infimum and supremum. This theorem essentially states that the well-known inclusion is sharp at the boundary.
The higher-dimensional generalization in terms of the convex hull of the supports was proven by Jacques-Louis Lions in 1951:
If , then
Above, denotes the convex hull of the set and denotes the space of distributions with compact support.
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 has stated that no proof yet addresses the theorem's underlying combinatorial structure, which he believes is necessary for complete understanding.
Official source
About this result
This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.