Kolmogorov rearrangement problem and Garsia's conjecture
Let be a probability space and let be a complete uniformly bounded orthonormal system in , meaning that . The rearrangement assertion asks whether there always exists a permutation of such that, for every coefficient sequence , the series converges for -almost every . Equivalently, the claimed counterexample is a complete uniformly bounded orthonormal system for which, for every permutation , there exists such that diverges for almost every .
Equivalent formulations 1Other wordings
Other statements of this same problem, merged from separate entries. Each is equivalent to the statement above — proving any one settles them all.
Counterexample formulation
There exists a complete uniformly bounded orthonormal system such that for every permutation of , there is a sequence for which the rearranged orthogonal series diverges almost everywhere.
source: On Kolmogorov's rearrangement problem and Garsia's conjecture
References
Primary source
Additional references
- On Kolmogorov's rearrangement problem and Garsia's conjecture — arXiv — Mark Lewko
Progress summary
A September 2026 preprint claims to disprove both longstanding questions, but its result has not yet been independently confirmed.
The problem concerns two longstanding questions about rearrangements of orthonormal systems and almost-everywhere convergence. The claimed construction uses two differently ordered copies of the trigonometric system to give negative answers to both questions.
September 2026 claimed counterexample
Mark Lewko's preprint claims a construction that disproves both the Kolmogorov rearrangement assertion and Garsia's conjecture. The claim is explicitly awaiting peer review, so it remains unverified.
Current status (as of September 2026): Both questions are claimed to have negative answers, but the construction remains unverified pending peer review.
Solutions 0
No solutions have been posted yet.