Logo
ScienceStack
Table of Contents
Fetching ...
Sign In

Expository article: "Bounded orthogonal systems and the $Λ(p)$-set problem'' by Jean Bourgain

Hongki Jung, Bartosz Langowski, Alexander Ortiz, Truong Vu

TL;DR

The work addresses Rudin's conjecture by constructing Λ(p)-sets that are not Λ(q)-sets for any q>p, for every p>2. It develops a robust probabilistic framework within 1-bounded orthogonal systems, coupling random subset selection with decoupling, entropy, and chaining techniques to produce S with |S| ≍ n^{2/p} and K_S≲1, while ensuring failure for larger p's. Central contributions include a Khintchine–Marcinkiewicz–Zygmund type decoupling lemma, a probabilistic inequality linking uncountable suprema to metric entropy, and refined entropy bounds via Lévy means and a method of support-reduction. These tools not only solve the Rudin conjecture in the 1-bounded setting but also illuminate the interplay between probabilistic methods and discrete restriction phenomena in harmonic analysis. The results bridge Λ(p)-set theory with decoupling and entropy methods, offering a blueprint for handling higher p via inductive schemes and for constructing Λ(p)-sets in broader combinatorial settings.

Abstract

In this paper, we present an exposition of the work \cite{B} by Jean Bourgain, in which he resolved the well known conjecture posed by Rudin regarding the existence of $Λ(p)$-sets.

Expository article: "Bounded orthogonal systems and the $Λ(p)$-set problem'' by Jean Bourgain

TL;DR

The work addresses Rudin's conjecture by constructing Λ(p)-sets that are not Λ(q)-sets for any q>p, for every p>2. It develops a robust probabilistic framework within 1-bounded orthogonal systems, coupling random subset selection with decoupling, entropy, and chaining techniques to produce S with |S| ≍ n^{2/p} and K_S≲1, while ensuring failure for larger p's. Central contributions include a Khintchine–Marcinkiewicz–Zygmund type decoupling lemma, a probabilistic inequality linking uncountable suprema to metric entropy, and refined entropy bounds via Lévy means and a method of support-reduction. These tools not only solve the Rudin conjecture in the 1-bounded setting but also illuminate the interplay between probabilistic methods and discrete restriction phenomena in harmonic analysis. The results bridge Λ(p)-set theory with decoupling and entropy methods, offering a blueprint for handling higher p via inductive schemes and for constructing Λ(p)-sets in broader combinatorial settings.

Abstract

In this paper, we present an exposition of the work \cite{B} by Jean Bourgain, in which he resolved the well known conjecture posed by Rudin regarding the existence of -sets.

Paper Structure

This paper contains 18 sections, 33 theorems, 306 equations.

Table of Contents

  1. Introduction and statement of the main result
  2. Acknowledgement
  3. Notation
  4. Setting up the proof of Theorem \ref{['thm:main2']}
  5. Overview and beginning of the proof of Theorem \ref{['thm:main2']}
  6. Decoupling
  7. Randomization of the set $S$
  8. The case $p\in(2,4)$
  9. The case $p\ge4$.
  10. A probabilistic inequality
  11. Entropy estimates
  12. End of the proof of Theorem \ref{['thm:main2']}
  13. Case $2<p<4$
  14. Case $p\ge 4$
  15. Technical results
  16. ...and 3 more sections

Key Result

Theorem 1.2

For any $p>2$ there exists $S\subset\mathbb{Z}$ which is a $\Lambda(p)$-set, but is not a $\Lambda(r)$-set for any $r>p$.

Theorems & Definitions (70)

  • Definition 1.1
  • Theorem 1.2
  • Theorem 1.3
  • Remark 1.4
  • Proposition 1.5
  • proof
  • Lemma 3.1
  • proof
  • Proposition 3.2
  • Remark 3.3
  • ...and 60 more