Set of uniqueness
A subset E of the circle is called a set of uniqueness, or a U-set, if any trigonometric expansion
which converges to zero for is identically zero; that is, such that
- c(n) = 0 for all n.
Otherwise E is a set of multiplicity (sometimes called an M-set or a Menshov set). Analogous definitions apply on the real line, and in higher dimensions. In the latter case one needs to specify the order of summation, e.g. "a set of uniqueness with respect to summing over balls".
To understand the importance of the definition it is important to get out of the Fourier mind-set. In Fourier analysis there is no question of uniqueness, since the coefficients c(n) are derived by integrating the function. Hence in Fourier analysis the order of actions is
- Start with a function f.
- Calculate the Fourier coefficients using
- Ask: does the sum converge to f? In which sense?
In the theory of uniqueness the order is different:
- Start with some coefficients c(n) for which the sum converge in some sense
- Ask: does this means that they are the Fourier coefficients of the function?
In effect, it is usually sufficiently interesting (as in the definition above) to assume that the sum converges to zero and ask if that means that all the c(n) must be zero. As is usual in analysis, the most interesting questions arise when one discusses pointwise convergence. Hence the definition above, which arose when it became clear that neither convergence everywhere nor convergence almost everywhere give a satisfactory answer.
The empty set is a set of uniqueness. This is just a fancy way to say that if a trigonometric series converges to zero everywhere then it is trivial. This was proved by Riemann, using a delicate technique of double formal integration; and showing that the resulting sum has some generalized kind of second derivative using Toeplitz operators. Later on, Cantor generalized Riemann's techniques to show that any countable, closed set is a set of uniqueness, a discovery which led him to the development of set theory. Interestingly, Paul Cohen, another great innovator in set theory, started his career with a thesis on sets of uniqueness.
As the theory of Lebesgue integration developed, it was assumed that any set of zero measure would be a set of uniqueness — in one dimension the locality principle for Fourier series shows that any set of positive measure is a set of multiplicity (in higher dimensions this is still an open question). This was disproved by D. E. Menshov who in 1916 constructed an example of a set of multiplicity which has measure zero.
A translation and dilation of a set of uniqueness is a set of uniqueness. A union of a countable family of closed sets of uniqueness is a set of uniqueness. There exists an example of two sets of uniqueness whose union is not a set of uniqueness, but the sets in this example are not Borel. It is an open problem whether the union of any two Borel sets of uniqueness is a set of uniqueness.
( here are the Fourier coefficients). In all early examples of sets of uniqueness the distribution in question was in fact a measure. In 1954, though, Ilya Piatetski-Shapiro constructed an example of a set of uniqueness which does not support any measure with Fourier coefficients tending to zero. In other words, the generalization of distribution is necessary.
Complexity of structure
The first evidence that sets of uniqueness have complex structure came from the study of Cantor-like sets. Salem and Zygmund showed that a Cantor-like set with dissection ratio ξ is a set of uniqueness if and only if 1/ξ is a Pisot number, that is an algebraic integer with the property that all its conjugates (if any) are smaller than 1. This was the first demonstration that the property of being a set of uniqueness has to do with arithmetic properties and not just some concept of size (Nina Bary had proved the case of ξ rational -- the Cantor-like set is a set of uniqueness if and only if 1/ξ is an integer -- a few years earlier).
Since the 50s, much work has gone into formalizing this complexity. The family of sets of uniqueness, considered as a set inside the space of compact sets (see Hausdorff distance), was located inside the analytical hierarchy. A crucial part in this research is played by the index of the set, which is an ordinal between 1 and ω1, first defined by Pyatetskii-Shapiro. Nowadays the research of sets of uniqueness is just as much a branch of descriptive set theory as it is of harmonic analysis. See the Kechris-Louveau book referenced below.
- Paul J. Cohen (1958), Topics in the theory of uniqueness of trigonometrical series , http://www.lix.polytechnique.fr/Labo/Ilan.Vardi/cohen.ps
- Alexander S. Kechris and Alain Louveau (1987), Descriptive set theory and the structure of sets of uniqueness (London Mathematical Society lecture series 128), Cambridge University Press. ISBN 0-521-35811-6.
- Jean-Pierre Kahane and Raphaël Salem (1994), Ensembles parfaits et séries trigonométrique, Hermann, Paris. ISBN 2-7056-6193-X (in French).
Wikimedia Foundation. 2010.
Look at other dictionaries:
Set theory (music) — Example of Z relation on two pitch sets analyzable as or derivable from Z17 (Schuijer 2008, p.99), with intervals between pitch classes labeled for ease of comparison between the two sets and their common interval vector, 212320. Musical set… … Wikipedia
M-set — In mathematics, the term M set may refer to:* The set of uniqueness or Menshov set of harmonic analysis. * The Mandelbrot set. * A monoid acting on a set, also known as an act.* In Sydney, Australia, M set can also refer to CityRail s Millennium… … Wikipedia
Naive set theory — This article is about the mathematical topic. For the book of the same name, see Naive Set Theory (book). Naive set theory is one of several theories of sets used in the discussion of the foundations of mathematics. The informal content of… … Wikipedia
Empty set — ∅ redirects here. For similar looking symbols, see Ø (disambiguation). The empty set is the set containing no elements. In mathematics, and more specifically set theory, the empty set is the unique set having no elements; its size or cardinality… … Wikipedia
List of mathematics articles (S) — NOTOC S S duality S matrix S plane S transform S unit S.O.S. Mathematics SA subgroup Saccheri quadrilateral Sacks spiral Sacred geometry Saddle node bifurcation Saddle point Saddle surface Sadleirian Professor of Pure Mathematics Safe prime Safe… … Wikipedia
Roman letters used in mathematics — NOTOC Many Roman letters, both capital and small, are used in mathematics, science and engineering to denote by convention specific or abstracted constants, variables of a certain type, units, multipliers, physical entities. Certain letters, when … Wikipedia
U (disambiguation) — U is the twenty first letter of the Latin alphabet.U may also refer to:Mathematics* cup, union (set theory) * U set, a set of uniqueness * U, the unitary groupChemistry* Uranium, a metallic chemical element * Unified atomic mass unit, used to… … Wikipedia
List of harmonic analysis topics — This is a list of harmonic analysis topics, by Wikipedia page. See also list of Fourier analysis topics and list of Fourier related transforms, which are more directed towards the classical Fourier series and Fourier transform of mathematical… … Wikipedia
List of Fourier analysis topics — This is an alphabetical list of Fourier analysis topics. See also the list of Fourier related transforms, and the list of harmonic analysis topics. Almost periodic function ATS theorem Autocorrelation Autocovariance Banach algebra Bessel function … Wikipedia
Candidate key — In the relational model, a candidate key of a relvar (relation variable) is a set of attributes of that relvar such that # at all times it holds in the relation assigned to that variable that there are no two distinct tuples with the same values… … Wikipedia