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 satisfieswe 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 meanOuter regularity and a smooth cutoff give this choice; the stipulated bound on leaves room between the two exponentials. The Schwarz integral on the unit diskhas positive real part in the disk, , and boundary real part . Its holomorphic logarithmsatisfies 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 , andThe radial function is analytic beyond the closed unit disk, so the Taylor truncation is uniform on the whole circle. For , putIts 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. SetFor 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. ThenEach 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 setSince , 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 provedThis establishes divergence on every prescribed null set, including dense nonclosed null sets; it does not assert that the divergence set is exactly .
Use the uniform bound for harmonic sine polynomialsFor completeness, reduce to and split at . The first part is bounded by . Geometric-series summation bounds every interval sum of by . Summation by parts bounds the remaining harmonic-weighted tail by . Negative follows by oddness and is immediate.
Let . Choose so large that , and positive integers such that the intervals are strictly separated and increase. DefineThe bound makes this a continuous function with .
Each Fourier coefficient of has modulus , so the sum of the absolute coefficients is . Therefore every prefix of a normalized block has norm at most one. At any Fourier cutoff, all earlier blocks are complete, at most one block is partial and all later blocks are absent. HenceAt zero, a completed block contributes zero, but its prefix through frequency consists of the negative-frequency sine coefficients and equals . ThusBoth index sequences tend to infinity. The uniformly bounded partial sums fail to converge at the origin, even though the function is continuous and zero there.
Articles by others on the same topic
There are currently no matching articles.