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.