Editing Set of uniqueness (section)

== Definition ==
A subset ''E'' of the circle is called a '''set of uniqueness''', or a '''''U''-set''', if any trigonometric expansion 

:<math>\sum_{n=-\infty}^{\infty}c(n)e^{int}</math> 

which converges to zero for <math> t\notin E</math> 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 series|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
:<math>c(n)=\int_0^{2\pi}f(t)e^{-int}\,dt</math>
* 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 converges in some sense
* Ask: does this mean 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 [[Mathematical analysis|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.