The difference between the two cumulative sums of Fourier partial sums is
Hence the de la Vallée Poussin sum satisfies
Using the uniform-norm contraction of Fejér summation on each term and the triangle inequality in the supremum norm,
This proves the requested operator norm bound. When the identity reduces to and the bound is one.
For a continuous -periodic function, define the Fourier coefficients and Fourier partial sum by
The Fejér sum is the arithmetic average of the first Fourier partial sums:
Thus has degree at most , whereas has degree at most . These indexing conventions matter in the identity in (b). Throughout, is a positive integer; when , any term is interpreted as zero without introducing .
For later estimates, the Fejér kernel in the PDF's normalization is
The apparent singularities are removable. The squared modulus makes nonnegative, and integrating its finite exponential expansion leaves only the diagonal terms, so . In particular Fejér summation is a uniform-norm contraction:
Write for the symmetric Fourier partial sum, with normalized Fourier coefficients on . We will prove the stronger conclusion
If 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 define
Each 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 . Then
After multiplication by the weight , this contribution is at least ; all the other contributions have positive real part. Throughout the arc union we therefore have
This 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 and
where 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. Hence
on 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. Set
Since 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 which
Each 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 series
The 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 gives
Every lies in infinitely many such unions, and . Therefore the boxed unboundedness holds at every point of , completing the proof for arbitrary null sets.
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, so
is 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 and
The last equality is the Plancherel theorem. Apply the inverse integral to the finite symmetric Fourier partial sums. Since
we 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 gives
The 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 put
The 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.
We give a quantitative construction for the whole open set, including the case of infinitely many component intervals. Pointwise divergence at a single point is insufficient here. Write and use normalized measure on .
First let be a finite union of closed arcs with , where is small. Choose a smooth function nonnegative function , equal to one on , with and . This follows by making the transition regions around the finitely many arc endpoints sufficiently short. Define the analytic Herglotz integral
Its real part is , where is the disk Poisson integral, and . Smoothness of makes continuous and smooth function up to the circle; on its boundary real part is at least . The branch therefore has and
The complex logarithm has no branch problem because lies in the right half-plane. Its smooth function boundary values give absolutely summable Taylor coefficients. Choose an analytic polynomial , with zero constant coefficient, uniformly within of on the closed disk. Put . Then .
If and , the modulated trigonometric polynomial has spectrum in . A sharp Fourier partial sum at selects exactly the negative-frequency half of , since :
Consequently, for every ,
The carrier frequency can be arbitrarily large. This compact-set Fourier amplification lemma uses a bounded imaginary part to obtain a large one-sided Fourier multiplier; no assertion about pointwise divergence is used.
Now let be any open set of measure . Define
If this is zero take . Otherwise choose a decreasing sequence , with , so small for that
For this inequality also holds: and . Let be an increasing compact exhaustion of .
Using compact batching of a small open set, we recursively choose finite closed-arc unions , of measure at most , such that is covered by the interiors of and
Here is the measure-theoretic justification. At step , the uncovered portion has measure at most . Its intersection with after removing the previously covered interiors is compact, and can be covered by finitely many closed arcs lying in with total length at most plus an arbitrarily small excess. By inner regularity of Lebesgue measure, a further compact subset of the uncovered open portion captures all but of its measure; cover it similarly. The combined finite arc union has length at most . This both covers the outstanding part of and ensures the next remainder estimate. In particular .
Apply the finite-arc construction to to get of degree . Choose carriers recursively so that the bands are positive and strictly ordered with no overlap. Set
The frequency-separated Fourier block series and the Weierstrass M-test give a continuous complex-valued function with . At the cutoff , all earlier bands have been included in full and every later band is absent. Thus on ,
Every point of lies in some , so
Values of outside may be defined arbitrarily. The construction handles an arbitrary open set, not just one point or a finite collection of intervals. It also prevents cancellation explicitly: earlier bands contribute a bounded complete sum, and later bands contribute nothing at the chosen cutoff.
Take . In the normalization used here, the Dirichlet kernel has the finite expansion
Averaging a finite number of the integral formulas for the Fourier partial sums is legitimate by linearity of the integral. Hence the Fejér sum is convolution with
To obtain the nonnegative form of the Fejér kernel, expand a squared geometric sum:
The coefficient counts pairs of indices whose difference is . Dividing by and summing the geometric progression gives
At the ratio has its continuous limiting value . Thus this is a continuous, nonnegative trigonometric polynomial, not a kernel with genuine singularities.
Integration over a full period kills every nonconstant cosine term, so
Translation invariance of integration over the circle consequently gives, for every ,
The first step is the integral triangle inequality, the second uses nonnegativity, and the last uses the mass just computed. Taking the supremum norm proves
In particular, Fejér summation is a uniform-norm contraction. The factor , rather than , is essential for the half-normalized Dirichlet kernel and Fejér kernel in this problem.
Let be a positive integer and let the trigonometric polynomial have frequencies only in . For every , its Fourier partial sum is the polynomial itself: . Every term in the defining average of the de la Vallée Poussin sum therefore equals , giving
This is exact reproduction of the degree-at-most- trigonometric polynomials, irrespective of the positive averaging length .
The indexing of the Fejér sums gives
Subtracting removes precisely the initial Fourier partial sums. Thus
For , omit the second term, so that no undefined is needed. Apply the triangle inequality and the uniform-norm contraction of Fejér summation estimate to get
Hence the operator norm of the de la Vallée Poussin sum is at most .
Apply part (i) to the continuous difference . Every Fourier coefficient of vanishes, so every Fourier partial sum is zero. The orthogonal projection convergence from part (i) therefore gives .
If , continuity gives an interval on which is bounded below by a positive number. That interval would contribute positively to , a contradiction. Hence
The continuity hypothesis upgrades equality almost everywhere to pointwise equality.
Use normalized Fourier coefficients and the inner product
The functions are orthonormal. Hence the Fourier partial sum is the orthogonal projection onto the trigonometric polynomials of degree at most . For any such polynomial , orthogonality gives
so .
Given , the permitted density result supplies a trigonometric polynomial with . Once includes its degree,
Therefore the Fourier partial sums converge to in the normalized norm, giving exactly the stated mean-square limit.
Part (i) and the Cauchy-Schwarz inequality show
Direct integration of this finite Fourier partial sum gives
Moreover Bessel's inequality puts both coefficient sequences in , so their product series is absolutely convergent by the Cauchy-Schwarz inequality. Consequently the cross form of Parseval's identity is
Taking also gives equality of the squared function norm and the squared coefficient norm.
We prove the Kahane-Katznelson divergence theorem through an explicit small-norm block construction. Let be normalized Lebesgue measure on the circle.
First establish the compact-set Fourier amplification lemma. If a compact set satisfies
we can make a trigonometric polynomial with , supported in any sufficiently high interval of positive frequencies, whose partial prefix has magnitude greater than on .
To construct it, choose a smooth nonnegative function equal to one near , with values at most one and mean
Outer regularity and a smooth cutoff give this choice; the stipulated bound on leaves room between the two exponentials. The Schwarz integral on the unit disk
has positive real part in the disk, , and boundary real part . Its holomorphic logarithm
satisfies and . On , the boundary value has . Smoothness of makes continuous at the boundary, and its positive boundary real part near makes continuous there.
Choose a radius just below one, then truncate the Taylor series of at that radius. This gives an analytic polynomial with zero constant term, degree , and
The radial function is analytic beyond the closed unit disk, so the Taylor truncation is uniform on the whole circle. For , put
Its frequencies lie between and , all positive. Its prefix through frequency includes exactly the negative-frequency half of shifted into this interval:
Consequently on , whereas . Increasing places the entire block above any previously used frequency.
We next use compact batching of a small open set to handle an arbitrary null set, without assuming that it is compact or a countable union of compact null sets. Set
For each , choose an open with . Decompose into countably many closed subarcs with pairwise disjoint interiors: subdivide each open component into closed pieces accumulating only at its excluded endpoints. Group these subarcs into finite successive batches . After batch , include enough pieces that the remaining total length is less than . Require each batch endpoint in the enumeration to increase. Then
Each batch is compact; endpoints shared by pieces have zero measure and do not affect the estimates.
Enumerate the pairs in diagonal order. Apply the block lemma with target to each , and shift its spectrum above all preceding blocks. Denote the resulting polynomial by and set
Since , this series is uniformly convergent and defines a continuous complex-valued function.
Fix . For every there is a with . The difference between the Fourier partial sum just before that block and the sum at its midpoint has magnitude greater than : previous blocks cancel in the difference, and future blocks have not yet entered. As , these cutoffs tend to infinity. At least one of the two partial sums therefore has magnitude greater than . The Fourier partial sums are unbounded, hence not Cauchy, at . We have proved
This establishes divergence on every prescribed null set, including dense nonclosed null sets; it does not assert that the divergence set is exactly .
Averaging the given Dirichlet kernels gives the normalized Fejér kernel
The geometric-series identity, or summing the sine terms, proves the second equality. At multiples of use its removable value . Therefore , and
is a positive linear operator on continuous functions. The Fourier partial sums, viewed as orthogonal projections, fix , so and . They also fix and for degrees at least one, whereas annihilates them. Consequently
All three periodic Korovkin theorem tests converge uniformly. Hence Fejér sums converge uniformly for every continuous periodic function:
Use the unnormalized Fourier transform in the question and the Plancherel theorem, with inverse factor . For a general scaling function, the transform is interpreted in the sense; the printed integral need not be absolutely convergent. All frequency identities are almost-everywhere statements.
Changing variables in the Fourier transform gives
Thus taking the transform of the scaling refinement equation gives , or
Conversely the same calculation and injectivity of the Fourier transform recover refinement, with convergence understood in .
To justify both the orthogonality assertion and this convergence precisely, put . It belongs to by monotone integration. The Plancherel theorem gives
Hence orthonormality of all integer translates is equivalent, by uniqueness of Fourier coefficients in L1, to the periodized-energy condition
When this holds, the squared norm of is , so square-summable coefficient series converge in . In the converse direction the refinement identity and give, by splitting the periodization of into even and odd translates,
Thus is bounded and its Fourier coefficients are square summable. If are its Fourier partial sum, then
This verifies the transformed refinement series converges to , completing the equivalence of the two pairs of conditions without imposing an unnecessary assumption on .
Averaging the integral representations of the Fourier partial sums gives
The finite trigonometric sum is
Since , the Fejér kernel is therefore
and
The displayed square shows that . Every Fourier partial sum preserves the constant function, so . Substituting in the integral formula gives
Nonnegativity then yields
Substituting the Fourier coefficients into the Fourier partial sum and summing the finite geometric series gives
where
The truncated Fourier cosine series gives the better approximation on the closed interval, in the senses of uniform convergence and the asymptotic L2 norm error. To make the comparison precise, let and retain the frequencies , with the constant term also included in .
The cosine Fourier coefficients are . In fact, absolute convergence gives the uniform tail bound
For the Fourier sine series, every Fourier partial sum satisfies . Thus
so there is no uniform convergence to on the closed interval. Its odd extension has jump discontinuities, producing the Gibbs phenomenon near the endpoints; its Fourier coefficients decrease only like .
The advantage persists in the L2 norm, which ignores individual endpoint values. By Parseval's identity and Fourier orthogonality,
The nonzero odd cosine coefficients and both parity classes of sine coefficients also give matching lower bounds of these orders by comparison with the corresponding p-series. Hence their L2 norm errors decrease respectively like and . This is a comparison of approximation quality in specified norms, not a claim that one finite sum has smaller error at every individual interior point.
Write . For the partial sum , ordinary multiplication gives
On , the integrals of every nonconstant sine or cosine vanish. Fourier orthogonality further gives and the same identity for two sines, while every sine-cosine integral is zero. Thus
For square-integrable , its Fourier partial sums converge to in L2 space, so their squared norms converge to the squared norm of . Passing to the limit proves Parseval's identity:
Working with finite partial sums before taking the norm limit avoids an unjustified interchange of an infinite double series and integration.
Let be the Fourier partial sum through frequency . By orthogonality and the coefficient formulas,
Expanding the nonnegative squared L2 norm of the error gives the exact finite identity
For in the L2 space, completeness of the Fourier basis makes the left-hand side tend to zero. Dividing the resulting equality by proves Parseval's identity:
This argument uses convergence in L2 rather than an unqualified exchange of an infinite sum with the integral of its square. The function in part (c) is continuous and piecewise polynomial, so these hypotheses hold.
Take the inner product of the Fourier series with . Fourier orthogonality eliminates the constant, all cosine terms, and all sine terms except the th. The remaining squared norm is
so
For a square-integrable function, the calculation is justified by taking inner products of finite Fourier partial sums and passing to their mean-square limit.