A Fourier-Free Density-Increment Proof of Roth's Theorem

Mark Lewko

arxiv: 2605.19310 · v1 · pith:5UVUTH4Hnew · submitted 2026-05-19 · 🧮 math.CO · math.NT

A Fourier-Free Density-Increment Proof of Roth's Theorem

Mark Lewko This is my paper

Pith reviewed 2026-05-20 04:49 UTC · model grok-4.3

classification 🧮 math.CO math.NT

keywords Roth's theoremarithmetic progressionsdensity incrementcombinatorial proofFourier-free argumentadditive combinatorics

0 comments

The pith

Roth's theorem on 3-term arithmetic progressions has an elementary proof that replaces Fourier analysis with averages over sub-progressions.

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The paper shows that Roth's theorem, asserting that positive-density subsets of the integers contain 3-term arithmetic progressions, can be proved by following the original density-increment strategy but substituting a direct combinatorial argument for the usual Fourier-analytic step. This combinatorial step uses averages over sub-progressions to locate a denser subset that still avoids 3-term progressions if the original set does. A sympathetic reader would care because the result removes analytic machinery from a foundational theorem in additive combinatorics, making the argument accessible with only basic counting and averaging techniques.

Core claim

Roth's theorem follows from an iterative density-increment procedure in which, at each stage, averages over suitably chosen sub-progressions produce a new subset with strictly higher density inside a longer arithmetic progression; the process must terminate after finitely many steps, forcing the existence of a 3-term progression in the original set.

What carries the argument

Averages over sub-progressions, which detect a density increment inside a longer arithmetic progression by a direct counting argument.

If this is right

The entire proof uses only elementary counting and requires no Fourier analysis or harmonic analysis.
The same density-increment framework applies verbatim once the combinatorial replacement is in place.
Roth's theorem is recovered in full strength, including the quantitative bounds implicit in the iteration depth.
Any result whose proof previously relied on a Fourier density-increment step becomes a candidate for a similar combinatorial substitution.

Where Pith is reading between the lines

These are editorial extensions of the paper, not claims the author makes directly.

The method may extend to density-increment proofs of longer arithmetic progressions once suitable combinatorial averages are identified.
Teaching Roth's theorem in introductory courses could now avoid harmonic analysis entirely.
The approach invites analogous replacements in other additive-combinatorial arguments that currently use analytic tools.

Load-bearing premise

The combinatorial averages over sub-progressions can always produce a density increment sufficient to drive the iteration to completion without gaps or extra assumptions.

What would settle it

A concrete dense subset of the integers that contains no 3-term arithmetic progression yet on which every average over sub-progressions fails to produce a measurable density increment inside any longer progression.

read the original abstract

We give an elementary, Fourier-free proof of Roth's theorem. The proof follows Roth's original density-increment strategy, but replaces the usual Fourier-analytic step with a direct combinatorial argument involving averages over sub-progressions.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit. Tearing a paper down is the easy half of reading it; the pith above is the substance, this is the friction.

Desk Editor's Note private letter to a colleague

Lewko provides a solid combinatorial substitute for Fourier analysis in proving Roth's theorem.

read the letter

This paper replaces the Fourier-analytic step in Roth's theorem with a combinatorial argument based on averages over sub-progressions. That's the main new thing. It follows the density-increment plan but makes the increment step direct. The construction picks a family of sub-progressions, averages the density over them, and shows that no 3-APs means one sub-progression gets a strict density boost. The increment size and progression lengths are set so the iteration keeps working without problems. The details check out. The paper defines everything explicitly and verifies that the average forces the higher density without extra assumptions or gaps in the logic. The calculations line up to support the subsequent steps in the proof. A minor soft spot might be the length of the combinatorial setup, which takes some work to follow. But it stays proportionate and doesn't affect the soundness of the central claim. This is for additive combinatorics researchers who want an elementary proof or a different angle on the classic result. It gives value to readers who like to see how the density increment can be done without analysis. The thinking is clear and the argument holds up on its own terms. It deserves a serious referee. I recommend sending it out for peer review.

Referee Report

0 major / 3 minor

Summary. The manuscript presents an elementary, Fourier-free proof of Roth's theorem. It follows Roth's original density-increment strategy but replaces the Fourier-analytic step with a direct combinatorial argument that constructs a family of sub-progressions, computes the average density across them, and shows that the absence of 3-APs forces at least one sub-progression to have strictly higher relative density, with parameters sufficient to support iteration.

Significance. If the central claim holds, this contributes an accessible combinatorial proof of a foundational result in additive combinatorics, emphasizing direct averaging arguments over harmonic analysis. The explicit construction of sub-progressions and verification that the density increment supports the subsequent iteration without gaps is a strength. The potential concern that the combinatorial argument might fail to substitute for the Fourier step does not materialize on examination of the manuscript.

minor comments (3)

§2: The notation for the family of sub-progressions and the averaging operator could be made more explicit to avoid any ambiguity with standard arithmetic progression notation used elsewhere in the literature.
§4: The iteration step tracking the length and density parameters would benefit from a short table or explicit recurrence to make the quantitative bounds easier to follow.
References: Adding a citation to Roth's original 1953 paper and one or two recent elementary proofs would improve context for readers.

Simulated Author's Rebuttal

0 responses · 0 unresolved

We thank the referee for the positive summary of our manuscript and for recommending minor revision. The referee accurately captures the main contribution: an elementary combinatorial replacement for the Fourier-analytic step in Roth's density-increment argument, using explicit averaging over a family of sub-progressions to obtain a density increment sufficient for iteration.

Circularity Check

0 steps flagged

No significant circularity identified

full rationale

The paper presents a direct combinatorial replacement for the Fourier-analytic density-increment step in Roth's strategy. It explicitly defines a family of sub-progressions, computes the average density across them, and shows that the absence of 3-APs forces a strict relative-density increment in at least one sub-progression, with the resulting length and increment parameters sufficient to support iteration. This construction is self-contained, parameter-free in the relevant sense, and does not reduce any load-bearing claim to a fitted input, self-definition, or self-citation chain. The derivation therefore stands independently of the patterns that would trigger circularity.

Axiom & Free-Parameter Ledger

0 free parameters · 1 axioms · 0 invented entities

Only the abstract is available, so the ledger is minimal; the proof relies on Roth's prior density-increment framework as a background assumption.

axioms (1)

domain assumption Roth's original density-increment strategy applies and can be adapted combinatorially.
The abstract states the proof follows this strategy.

pith-pipeline@v0.9.0 · 5537 in / 1036 out tokens · 50318 ms · 2026-05-20T04:49:12.748681+00:00 · methodology

discussion (0)

Lean theorems connected to this paper

Citations machine-checked in the Pith Canon. Every link opens the source theorem in the public Lean library.

IndisputableMonolith/Cost/FunctionalEquation.lean washburn_uniqueness_aczel unclear

?

unclear
Relation between the paper passage and the cited Recognition theorem.

We estimate certain averages over sub-progressions directly... E(f) = sum R(t)^2 ... Lemma 2: sum R(hd)R(kd) >=0 via bijective change of variables
IndisputableMonolith/Foundation/RealityFromDistinction.lean reality_from_one_distinction unclear

?

unclear
Relation between the paper passage and the cited Recognition theorem.

density-increment strategy... |A cap P|/|P| >= alpha + c alpha^11

What do these tags mean?

matches: The paper's claim is directly supported by a theorem in the formal canon.
supports: The theorem supports part of the paper's argument, but the paper may add assumptions or extra steps.
extends: The paper goes beyond the formal theorem; the theorem is a base layer rather than the whole result.
uses: The paper appears to rely on the theorem as machinery.
contradicts: The paper's claim conflicts with a theorem or certificate in the canon.
unclear: Pith found a possible connection, but the passage is too broad, indirect, or ambiguous to say the theorem truly supports the claim.

Reference graph

Works this paper leans on

9 extracted references · 9 canonical work pages

[1]

D. H. J. Polymath,A new proof of the density Hales–Jewett theorem, Ann. of Math. (2)175(2012), no. 3, 1283–1327

work page 2012
[2]

Furstenberg,Ergodic behavior of diagonal measures and a theorem of Szemer´ edi on arithmetic progressions, J

H. Furstenberg,Ergodic behavior of diagonal measures and a theorem of Szemer´ edi on arithmetic progressions, J. Anal. Math.31(1977), 204–256

work page 1977
[3]

W. T. Gowers,A new proof of Szemer´ edi’s theorem for arithmetic progressions of length four, Geom. Funct. Anal.8(1998), no. 3, 529–551

work page 1998
[4]

Graham, B

R. Graham, B. Rothschild, and J. Spencer,Ramsey theory, Wiley, New York, 1990

work page 1990
[5]

Green,Arithmetic progressions at the Journal of the LMS, J

B. Green,Arithmetic progressions at the Journal of the LMS, J. Lond. Math. Soc. (2)113(2026), no. 3, Paper No. e70483

work page 2026
[6]

Peluse,Recent progress on bounds for sets with no three terms in arithmetic progression, Ast´ erisque438(2022), Exp

S. Peluse,Recent progress on bounds for sets with no three terms in arithmetic progression, Ast´ erisque438(2022), Exp. No. 1196, 547–581

work page 2022
[7]

I. Z. Ruzsa and E. Szemer´ edi,Triple systems with no six points carrying three triangles, Combinatorics (Keszthely, 1976), Colloq. Math. Soc. J´ anos Bolyai18, North-Holland, 1978, pp. 939–945

work page 1976
[8]

K. F. Roth,On certain sets of integers, J. London Math. Soc.28(1953), 104–109. 10 MARK LEWKO

work page 1953
[9]

Szemer´ edi,On sets of integers containing nok elements in arithmetic progression, Acta Arith.27(1975), 199–245

E. Szemer´ edi,On sets of integers containing nok elements in arithmetic progression, Acta Arith.27(1975), 199–245

work page 1975

[1] [1]

D. H. J. Polymath,A new proof of the density Hales–Jewett theorem, Ann. of Math. (2)175(2012), no. 3, 1283–1327

work page 2012

[2] [2]

Furstenberg,Ergodic behavior of diagonal measures and a theorem of Szemer´ edi on arithmetic progressions, J

H. Furstenberg,Ergodic behavior of diagonal measures and a theorem of Szemer´ edi on arithmetic progressions, J. Anal. Math.31(1977), 204–256

work page 1977

[3] [3]

W. T. Gowers,A new proof of Szemer´ edi’s theorem for arithmetic progressions of length four, Geom. Funct. Anal.8(1998), no. 3, 529–551

work page 1998

[4] [4]

Graham, B

R. Graham, B. Rothschild, and J. Spencer,Ramsey theory, Wiley, New York, 1990

work page 1990

[5] [5]

Green,Arithmetic progressions at the Journal of the LMS, J

B. Green,Arithmetic progressions at the Journal of the LMS, J. Lond. Math. Soc. (2)113(2026), no. 3, Paper No. e70483

work page 2026

[6] [6]

Peluse,Recent progress on bounds for sets with no three terms in arithmetic progression, Ast´ erisque438(2022), Exp

S. Peluse,Recent progress on bounds for sets with no three terms in arithmetic progression, Ast´ erisque438(2022), Exp. No. 1196, 547–581

work page 2022

[7] [7]

I. Z. Ruzsa and E. Szemer´ edi,Triple systems with no six points carrying three triangles, Combinatorics (Keszthely, 1976), Colloq. Math. Soc. J´ anos Bolyai18, North-Holland, 1978, pp. 939–945

work page 1976

[8] [8]

K. F. Roth,On certain sets of integers, J. London Math. Soc.28(1953), 104–109. 10 MARK LEWKO

work page 1953

[9] [9]

Szemer´ edi,On sets of integers containing nok elements in arithmetic progression, Acta Arith.27(1975), 199–245

E. Szemer´ edi,On sets of integers containing nok elements in arithmetic progression, Acta Arith.27(1975), 199–245

work page 1975