Ergodic Pythagorean recurrence conjecture

A multiplicative measure-preserving system is a probability space (X,μ)(X,\mu) equipped with an action T=(Tn)nNT=(T_n)_{n\in\mathbb{N}} of (N,×)(\mathbb{N},\times) such that every TnT_n preserves μ\mu. Let AXA\subset X, and suppose that for some rNr\in\mathbb{N},

μ(AT11ATr1A)=1.\mu\left(A\cup T_1^{-1}A\cup\cdots\cup T_r^{-1}A\right)=1.

Ergodic Pythagorean recurrence conjecture. There exists a solution (x,y,z)N3(x,y,z)\in\mathbb{N}^3 of x2+y2=z2x^2+y^2=z^2 such that

μ(Tx1ATy1ATz1A)>0.\mu\left(T_x^{-1}A\cap T_y^{-1}A\cap T_z^{-1}A\right)>0.

This is presented as an equivalent ergodic form of the monochromatic Pythagorean-triples conjecture via Furstenberg's correspondence principle. Since the underlying partition-regularity conjecture remains open, this equivalent formulation is also open.

Sources & referencesView supporting material

Primary source

Guilherme Azevedo and Joel Moreira, “Pythagorean triples in level sets of completely multiplicative functions”, arXiv:2607.04903 (2026).

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.