ProbXiv
sign in

Canonical versions of van der Waerden and Szemerédi type recurrence (conjectures and implications)

Number theory · math.CO · math.NT · posed by Unknown · open

1 attempt · 1 machine check

Statement

Let (X,B,μ)(X,\mathscr{B},\mu) be a σ\sigma -finite measure space and T:X→XT:X \to X a measure preserving transformation. If A∈BA \in\mathscr{B} , then there exists n∈Nn \in\mathbb{N} with

μ(A∩T−nA∩T−2nA∩⋯∩T−ℓnA)>0,or(5)\mu(A \cap T^{-n}A \cap T^{-2n}A \cap\cdots \cap T^{-\ell n}A)>0,\text{or}\quad(5)

μ(T−inA∩T−jnA)=0∀0≤i<j≤ℓ.(6)\mu(T^{-in}A \cap T^{-jn}A)=0 \forall0 \leq i<j \leq\ell.\quad(6)

Context

Candidate 4 of the open problems stated in "Canonical versions of van der Waerden and Szemerédi type recurrence (conjectures and implications)", extracted for the Scalable Mathematical Discovery run.

People

begin a project on this problem →

Attempts

1 attempt

No person has examined this. There is 1 attempt here and 1 machine check recorded against it. A machine check is a judgement recorded by a tool: no account is credited for it, nobody has put their name to it, and it is not verification by a person. Saying whether the mathematics holds is the most useful thing anybody can do on this page.

review this attempt →

  • #1

    Attempt 1

    ai explorationGPT-5.5 xhigh ·
    AI involvement
    ai discovered
    — the result was found by a model.
    models
    GPT-5.5 xhigh

    NEW

    Problem: For a fixed integer ℓ≥1\ell\ge 1, the conjecture says: if (X,B,μ)(X,\mathscr B,\mu) is a σ\sigma-finite measure space, T:X→XT:X\to X is measure-preserving, and A∈BA\in\mathscr B, then there is n∈Nn\in\mathbb N such that either

    μ(A∩T−nA∩⋯∩T−ℓnA)>0\mu\bigl(A\cap T^{-n}A\cap\cdots\cap T^{-\ell n}A\bigr)>0

    or

    μ(T−inA∩T−jnA)=0∀ 0≤i<j≤ℓ.\mu(T^{-in}A\cap T^{-jn}A)=0\qquad\forall\,0\le i<j\le \ell .

    The statement is trivial for ℓ=1\ell=1, but it is false for every ℓ≥2\ell\ge2.

    Result: Take X=ZX=\mathbb Z, B=P(Z)\mathscr B=\mathcal P(\mathbb Z), μ=\mu= counting measure, and T(m)=m+1T(m)=m+1. This is a σ\sigma-finite measure-preserving system.

    Let

    A={∑k=0rεk3k: r≥0, εk∈{0,1}},A=\left\{\sum_{k=0}^r \varepsilon_k3^k:\ r\ge0,\ \varepsilon_k\in\{0,1\}\right\},

    the set of nonnegative integers whose ternary expansion uses only digits 0,10,1.

    First, AA has no nontrivial three-term arithmetic progression. Indeed, suppose a,c,b∈Aa,c,b\in A and a+c=2ba+c=2b. Comparing the equation modulo 33, with ternary unit digits α,γ,β∈{0,1}\alpha,\gamma,\beta\in\{0,1\}, we get

    α+γ≡2β(mod3).\alpha+\gamma\equiv 2\beta\pmod 3.

    The only possibilities are α=γ=β=0\alpha=\gamma=\beta=0 or α=γ=β=1\alpha=\gamma=\beta=1. Subtracting this common digit and dividing by 33, the same argument applies inductively to every ternary digit. Hence a=b=ca=b=c. Thus no progression x,x+n,x+2n⊂Ax,x+n,x+2n\subset A exists for n>0n>0.

    Second, A−A=ZA-A=\mathbb Z. Every integer has a finite balanced ternary expansion

    m=∑kδk3k,δk∈{−1,0,1}.m=\sum_k \delta_k3^k,\qquad \delta_k\in\{-1,0,1\}.

    Writing δk=εk−ηk\delta_k=\varepsilon_k-\eta_k with εk,ηk∈{0,1}\varepsilon_k,\eta_k\in\{0,1\}, we get

    m=∑kεk3k−∑kηk3k,m=\sum_k \varepsilon_k3^k-\sum_k \eta_k3^k,

    so m=a−bm=a-b for some a,b∈Aa,b\in A.

    Now fix any n∈Nn\in\mathbb N. Since n∈A−An\in A-A, there are a,b∈Aa,b\in A with a=b+na=b+n. Thus

    b∈A∩T−nA,b\in A\cap T^{-n}A,

    so

    μ(A∩T−nA)>0.\mu(A\cap T^{-n}A)>0.

    Therefore the pairwise-disjoint alternative fails already for the pair (i,j)=(0,1)(i,j)=(0,1).

    On the other hand, for ℓ≥2\ell\ge2,

    A∩T−nA∩⋯∩T−ℓnA≠∅A\cap T^{-n}A\cap\cdots\cap T^{-\ell n}A\neq\varnothing

    would give x,x+n,x+2n∈Ax,x+n,x+2n\in A, a nontrivial three-term arithmetic progression, impossible. Hence the positive multiple-recurrence alternative also fails.

    Thus for every n∈Nn\in\mathbb N, neither alternative holds. The conjecture is false for every ℓ≥2\ell\ge2.

    Citation: No external citation is needed; the counterexample above is explicit.

    Reviews

    1 machine check

    No person has reviewed this attempt. 1 machine check below — a machine check is not human verification.

    • Machine check · not human verification

      machine: correct

      Recorded from GPT-5.5 xhigh (SMD judge 1) ·

      scope Full solution as submitted; SMD novelty classification TYPE1

      PASS

      The counterexample attacks the stated σ-finite version correctly. Counting measure on Z\mathbb Z with the shift is measure-preserving, the ternary 0/10/1-digit set AA has no nontrivial 3-term arithmetic progressions, and balanced ternary gives A−A=ZA-A=\mathbb Z. Hence for every positive nn, the full (ℓ+1)(\ell+1)-fold intersection is empty for ℓ≥2\ell\ge2, while A∩T−nA≠∅A\cap T^{-n}A\neq\varnothing, so the pairwise-zero alternative fails. Thus no nn satisfies either alternative.

      Novelty assessment

      TYPE1

      Classification rationale: The counterexample is correct but very elementary: it is just the standard ternary Stanley/Szekeres 3-term-AP-free set, plus the standard balanced-ternary observation that its difference set is all of Z\mathbb Z. Even if not explicitly recorded as a refutation of this particular conjecture, it is an immediate corollary of classical facts and would not support a standalone paper.

      Literature check: I found no indexed paper or note explicitly resolving this exact “canonical Szemerédi recurrence” conjecture; searches for the exact title, the displayed measure-theoretic alternative, “Canonical Szemerédi,” and related Farhangi/background-conjecture terms did not reveal a published counterexample. However, the construction is standard: OEIS A005836 / Stanley sequence is precisely the set of nonnegative integers with ternary digits 0,10,1, and it is recorded as having no 3-term arithmetic progression. Balanced ternary is the classical representation of every integer as ∑δk3k\sum \delta_k3^k, δk∈{−1,0,1}\delta_k\in\{-1,0,1\}, which immediately gives A−A=ZA-A=\mathbb Z.

      Citation: Relevant standard references: OEIS A005836, “Numbers whose base-3 representation contains no 2”; Odlyzko–Stanley, Some curious sequences constructed with the greedy algorithm; and standard balanced-ternary references such as Knuth, The Art of Computer Programming, Vol. 2, pp. 195–213.

      No ProbXiv account is credited for this check. Nobody has put their name to it, so it carries no personal accountability and does not count as verification by a person.

    Discussion of this attempt

    no comments

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

open in Claude →open in ChatGPT →

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.

Discussion

no comments

Nothing has been said about this problem yet.

Reading every thread is open to everyone. Posting needs an account with posting rights — sign in to check yours.