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.

Pinned article: Introduction to the OurBigBook Project

Welcome to the OurBigBook Project! Our goal is to create the perfect publishing platform for STEM subjects, and get university-level students to write the best free STEM tutorials ever.
Everyone is welcome to create an account and play with the site: ourbigbook.com/go/register. We belive that students themselves can write amazing tutorials, but teachers are welcome too. You can write about anything you want, it doesn't have to be STEM or even educational. Silly test content is very welcome and you won't be penalized in any way. Just keep it legal!
We have two killer features:
  1. topics: topics group articles by different users with the same title, e.g. here is the topic for the "Fundamental Theorem of Calculus" ourbigbook.com/go/topic/fundamental-theorem-of-calculus
    Articles of different users are sorted by upvote within each article page. This feature is a bit like:
    • a Wikipedia where each user can have their own version of each article
    • a Q&A website like Stack Overflow, where multiple people can give their views on a given topic, and the best ones are sorted by upvote. Except you don't need to wait for someone to ask first, and any topic goes, no matter how narrow or broad
    This feature makes it possible for readers to find better explanations of any topic created by other writers. And it allows writers to create an explanation in a place that readers might actually find it.
    Figure 1.
    Screenshot of the "Derivative" topic page
    . View it live at: ourbigbook.com/go/topic/derivative
  2. local editing: you can store all your personal knowledge base content locally in a plaintext markup format that can be edited locally and published either:
    This way you can be sure that even if OurBigBook.com were to go down one day (which we have no plans to do as it is quite cheap to host!), your content will still be perfectly readable as a static site.
    Figure 5. . You can also edit articles on the Web editor without installing anything locally.
    Video 3.
    Edit locally and publish demo
    . Source. This shows editing OurBigBook Markup and publishing it using the Visual Studio Code extension.
  3. https://raw.githubusercontent.com/ourbigbook/ourbigbook-media/master/feature/x/hilbert-space-arrow.png
  4. Infinitely deep tables of contents:
    Figure 6.
    Dynamic article tree with infinitely deep table of contents
    .
    Descendant pages can also show up as toplevel e.g.: ourbigbook.com/cirosantilli/chordate-subclade
All our software is open source and hosted at: github.com/ourbigbook/ourbigbook
Further documentation can be found at: docs.ourbigbook.com
Feel free to reach our to us for any help or suggestions: docs.ourbigbook.com/#contact