Êtes-vous un étudiant de l'EPFL à la recherche d'un projet de semestre?
Travaillez avec nous sur des projets en science des données et en visualisation, et déployez votre projet sous forme d'application sur GraphSearch.
Concept
Titchmarsh convolution theorem
Résumé
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.
Source officielle
À propos de ce résultat
Cette page est générée automatiquement et peut contenir des informations qui ne sont pas correctes, complètes, à jour ou pertinentes par rapport à votre recherche. Il en va de même pour toutes les autres pages de ce site. Veillez à vérifier les informations auprès des sources officielles de l'EPFL.