Identify the circle with and use normalized Fourier coefficients and convolution:For , summing two geometric series gives the Poisson kernel on the circle:This Fourier series converges absolutely and uniformly for each fixed . Consequently we can integrate it term by term in the convolution; the substitution givesThe resulting series is itself absolutely and uniformly convergent, since and .
The Poisson kernel on the circle is nonnegative and has normalized integral one, as its constant Fourier coefficient is one. Its mass concentrates near zero. Indeed, for and ,Hence its normalized integral outside tends to zero as . Given , uniform continuity of gives a such that whenever the circular distance of from zero is less than . Splitting the convolution error into this arc and its complement yieldsThe second term tends to zero, and is arbitrary. Thus the Abel sums converge uniformly to , or . This is uniform Poisson summability of continuous circle functions: positivity, unit mass and concentration supply the required approximate identity argument.
Use the given integer satisfying . The Euclidean lattice under consideration has basis , because every vector in it is uniquely with . Its fundamental parallelogram therefore has areaWe use the following two-dimensional form of the Minkowski convex body theorem: a convex, centrally symmetric measurable subset of of area strictly greater than four times the covolume of a full-rank Euclidean lattice contains a nonzero vector of that lattice. Apply it to the closed disk of squared radius . Its area is , so it contains a nonzero lattice vector satisfyingOn the other hand the defining modular congruence and implyThere is exactly one positive multiple of strictly below , so . Neither coordinate can be zero, since a prime is not the square of an integer. This congruence lattice proof of the prime sum of two squares proves the required case of the sum of two squares theorem without assuming any conclusion at the critical area .
Write for the symmetric Fourier partial sum, with normalized Fourier coefficients on . We will prove the stronger conclusionIf is empty, take . Otherwise the proof of the Kahane-Katznelson divergence theorem has three steps: a bounded trigonometric polynomial whose partial sum is large on short arcs, a finite-arc batching of an arbitrary null set, and a uniformly convergent sequence of separated frequency blocks. In particular, no assumption that is closed or compact is needed.
First consider a nonempty finite family of arcs with centers , half-lengths , and . On the closed unit disk defineEach summand has positive real part there, and . Thus the principal complex logarithm is holomorphic on a neighborhood of the closed disk, , and . To bound its real part on an arc, put with and . ThenAfter multiplication by the weight , this contribution is at least ; all the other contributions have positive real part. Throughout the arc union we therefore haveThis is the positive-real logarithmic amplifier for short arcs. Since is holomorphic beyond the closed unit disk, its Taylor series converges uniformly there. Choose a polynomial with . There is no constant term because . Set andwhere the integer may be chosen arbitrarily large. We have , and its frequencies lie in . At the cut , the positive-frequency half of is excluded and the negative-frequency half is included. Henceon the arc union. In particular, for any , a total half-length gives there. This proves the needed compact-set Fourier amplification lemma, with the additional freedom to place its entire frequency block above any prescribed frequency.
Next we construct the null-set limsup cover by finite arc families. SetSince has Lebesgue measure zero, for every row choose a countable arc cover of with positive half-lengths and . We can take closed arcs by slightly enlarging an open cover; their half-lengths are less than one. The whole two-index array has total half-length less than . Absolute convergence of this sum lets us choose strictly increasing integers such that the sum outside the finite square is less than . Put and let contain those arcs for whichEach family is finite. Its total half-length is less than : for use the total sum, and for use the tail outside the preceding square. Moreover, every belongs to arcs with unbounded row index, so belongs to the unions of infinitely many of the families . This batching is essential: a dense null set need not have a finite cover of small total length, whereas the infinitely-often finite covers above suffice.
Apply the amplification construction to with height , obtaining with and on that family's union. Choose the modulation integers successively so that the frequency intervals are positive and each lies strictly above the preceding one. Empty families may be represented by and an unused frequency interval. Define the frequency-separated Fourier block seriesThe bound gives absolute uniform convergence, so is continuous. Uniform convergence also justifies computing every Fourier coefficient term by term. At frequency , all earlier blocks have been included in full and all later blocks are absent:For in the union of , the reverse triangle inequality givesEvery lies in infinitely many such unions, and . Therefore the boxed unboundedness holds at every point of , completing the proof for arbitrary null sets.
Use the angular-frequency Fourier transform conventionA precise sufficient interpretation of the regularity assumption is , in the first-order Sobolev space and ; in particular, nonzero Schwartz functions are admissible. We use the Plancherel theorem, in the normalization , together with its derivative identity . Both identities hold in for , by extending their identities for Schwartz functions. Thus the frequency factor isFor a Schwartz function, integration by parts gives . This remains true under the stated assumptions: insert a smooth cutoff into the derivative of , where is one near zero and compactly supported. Integration givesThe cutoff-derivative term tends to zero, since is bounded independently of and supported in a tail. The other terms converge by dominated convergence and the integrability of , furnished by the Cauchy-Schwarz inequality. HenceAfter squaring and using the Plancherel theorem, we obtain the uncentred Fourier uncertainty principle:If equality holds, both displayed inequalities must be equalities. The equality condition in the Cauchy-Schwarz inequality gives almost everywhere for a constant ; the real-part inequality and the identity for then force with real. The weak derivative equation has the solution : locally multiply by to obtain a function whose weak derivative is zero, hence a constant. Conversely, for this Gaussian function the normalized second moments are in position and in angular frequency, whose product is . ThereforeThese are raw second moments, rather than variances about their respective means. Consequently translations and nonzero frequency modulations of the Gaussian function are not equality cases here; the equality case of the Heisenberg uncertainty relation for centred variances has those additional freedoms.
Use and interpret the regularity assumption to include with the continuous representative furnished by Fourier inversion. Write . The bandwidth assumption implies as well as , by the Cauchy-Schwarz inequality on its finite support, sois continuous and defined at every . The integer samples are precisely the Fourier coefficients of with the sign convention appropriate to the basis :The completeness and Parseval identity for the exponential orthonormal basis on give in andThe last equality is the Plancherel theorem. Apply the inverse integral to the finite symmetric Fourier partial sums. Sincewe obtain the Nyquist–Shannon sampling theorem in this normalization:where the quotient is one at . This is a sampling expansion by periodic Fourier projection, not merely an almost-everywhere inversion. Indeed, the inverse integral of an error is bounded, uniformly in , by . Hence the symmetric finite sampling sums converge uniformly on all of . Moreover, the Parseval identity applied to givesThe Cauchy-Schwarz inequality therefore makes the sampling series absolutely convergent at every , with its absolute tail bounded uniformly by . Thus the integer samples recover the function everywhere.
For the nonuniqueness beyond this bandwidth, fix and a nonzero smooth function compactly supported in . Let be its inverse Fourier transform and putThe function , and hence , is a Schwartz function. The two shifted spectral supports are disjoint, so , but its support is contained strictly inside . Every integer sample of is zero. Therefore and the zero function have identical samples but are distinct, providing a strictly supercritical sampling alias counterexample for every positive bandwidth enlargement.
For the Riemann-Lebesgue lemma, a half-period shift of the oscillation gives a direct proof. For a nonzero integer , set . Periodicity and a change of variable show that the Fourier coefficient of at is . ThusThe right side tends to zero as by uniform continuity on the circle. Consequently .
There is nevertheless no prescribed rate shared by all continuous functions. Choose increasing positive integers with , which is possible since . DefineThe series converges absolutely and uniformly, so is continuous. Termwise integration is justified by uniform convergence, and the orthogonality of distinct exponential modes gives . HenceThis arbitrarily slow Fourier coefficient decay is compatible with the Riemann-Lebesgue lemma: for this particular function all Fourier coefficients still tend to zero, but along the selected subsequence they beat the proposed decay scale by an unbounded factor.
Put and represent the circle by . The full orthonormal basis of Haar wavelets includes the constant and, for every dyadic interval of length , the normalized detailTake half-open intervals and the corresponding values at their boundaries, so every point belongs to exactly one interval at each level. The constant basis function is necessary: if it were omitted, even could not satisfy the asserted convergence. We use the full conventional Haar wavelet system in the threshold sum.
Let be the function equal to the mean of on each level- dyadic interval. Comparing the means on a parent and its two children proves the Haar refinement identity directly: the difference between the child mean and the parent mean is the appropriate value of . Inductively this gives the Haar projectionWriting for the modulus of continuity, the cell-average formula yieldsFor a detail on a cell , its integral is zero. Subtracting for any therefore gives the coefficient estimateIn particular , so for every only finitely many details can have . The hard-threshold sumis thus a well-defined finite sum. Its chosen details need not form a complete set of levels; this is why convergence of the Haar projections alone does not prove the result.
Fix . Choose so that . All finer details satisfy at level . For sufficiently small , every nonzero coefficient at levels below , and the constant coefficient if nonzero, is retained. Also choose the unique integer such thatFor we have , so no such detail is retained. Consequently differs from only by omitted details at levels through . At any point there is at most one supported detail per level, and an omitted detail has magnitude at most . The geometric bound for omitted Haar details givesSince , we concludeThe right side can be made arbitrarily small, proving uniform hard-threshold convergence of normalized Haar expansions:The square-root scaling imposed by the specified normalization is what makes the omitted contributions a controlled geometric series.
Articles by others on the same topic
There are currently no matching articles.