Wiki
Wiki

Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.

Updated


Source. Conjecture 1.3, p. 3 of arXiv:2210.09775v2, read on the page image and the text layer. The conjecture is stated, not proved; the paper proves nothing about it beyond the small computer tests reported on the same page.

Statement

The paper writes 1P1_{\mathcal P} for the indicator function of the primes, Λ\Lambda for the von Mangoldt function, νH(p)\nu_{\mathcal H}(p) for the number of residue classes modulo pp occupied by H={h1,…,hk}\mathcal H=\{h_1,\dots,h_k\},

S(H)=∏p1−νH(p)/p(1−1/p)k,li⁡k(x)=∫2xdy(log⁡y)k,\mathfrak S(\mathcal H)=\prod_{p}\frac{1-\nu_{\mathcal H}(p)/p}{(1-1/p)^k}, \qquad \operatorname{li}_k(x)=\int_2^x\frac{dy}{(\log y)^k},

and calls H\mathcal H admissible when νH(p)<p\nu_{\mathcal H}(p)<p for every prime pp.

Conjecture 1.3 (Hardy–Littlewood kk-tuples conjecture, uniform version). "There exist two absolute constants ϵ>0\epsilon>0 and C>0C>0 such that for all xx, for all k≤(log⁡log⁡x)3k\le(\log\log x)^3, and for all admissible tuples H={h1,…,hk}⊂[0,(log⁡x)2]\mathcal H=\{h_1,\dots,h_k\}\subset[0,(\log x)^2],

∣∑n≤x1P(n+h1)⋯1P(n+hk)−S(H)li⁡k(x)∣≤Cx1−ε.\Bigl|\sum_{n\le x}1_{\mathcal P}(n+h_1)\cdots1_{\mathcal P}(n+h_k) -\mathfrak S(\mathcal H)\operatorname{li}_k(x)\Bigr|\le Cx^{1-\varepsilon}.

Equivalently, for possibly different values of ε\varepsilon and CC,

∣∑n≤xΛ(n+h1)⋯Λ(n+hk)−S(H)x∣≤Cx1−ε."\Bigl|\sum_{n\le x}\Lambda(n+h_1)\cdots\Lambda(n+h_k) -\mathfrak S(\mathcal H)x\Bigr|\le Cx^{1-\varepsilon}."

The first display is the paper's equation (7) and the second its equation (8); the paper writes ϵ\epsilon in the preamble and ε\varepsilon in the displays.

The quantifier order matters: one pair (ε,C)(\varepsilon,C) serves every xx, every kk in the range and every admissible tuple in the window. The ordinary Hardy–Littlewood conjecture, one asymptotic for each fixed tuple, does not supply this uniformity. The paper adds (p. 3) that computer tests for several sets of size k=10k=10 and x≤5500x\le5500 found errors below (log⁡x)6x1/2(\log x)^6x^{1/2}, and that the range of kk and hh "is also likely possible to extend", while "it is difficult to say when Hardy–Littlewood convergencee [sic] should break down."

Versions used by other sources

  • Tao (arXiv:2308.07205, Conjecture 1.3, p. 2; the card tao_2023_convergence_alternating_series_erdos_assuming_hardy) cites this conjecture and states it for all x≥10x\ge10, all k≤(log⁡log⁡x)5k\le(\log\log x)^5 and all tuples of distinct integers in [0,log⁡2x][0,\log^2x], remarking that restricting to admissible tuples is unnecessary because the bound is easy when S(H)=0\mathfrak S(\mathcal H)=0, and that the exponent 55 replaces Kuperberg's 33 "for technical reasons." The phrase "x≥10x\ge10" is Tao's; the original says "for all xx".
  • Land's 2026 manuscript (Conjecture 1, form (K), p. 1; the card land_2026_conditional_proof_irrationality_prime_series) uses a "large-xx form": constants ε,C>0\varepsilon,C>0 such that for every sufficiently large xx and every admissible A⊆[0,(log⁡x)2]∩ZA\subseteq[0,(\log x)^2]\cap\mathbb Z with 1≤∣A∣≤(log⁡log⁡x)31\le|A|\le(\log\log x)^3, $|\sum_{1\le m\le x}\prod_{a\in A}1_{\mathcal P}(m+a) -\mathfrak S(A)\operatorname{li}_{|A|}(x)|\le Cx^{1-\varepsilon}$. Its Lean predicate UniformHardyLittlewoodConjecture quantifies ε\varepsilon, CC and a threshold x0x_0 before xx and AA.
  • Ringer's 2026 manuscript (equation (22), p. 19; the card ringer_2026_local_gap_statistics_telescoping_normality) quotes (7) for admissible distinct E⊂[0,(log⁡x)2]E\subset[0,(\log x)^2] with ∣E∣≤(log⁡log⁡x)3|E|\le(\log\log x)^3 and derives from it the averaged one-sided hypothesis (AHLκ)(\mathrm{AHL}_\kappa) of its Theorem 1.1 (Section 5.4), noting that a uniform error OA(xexp⁡{−A(log⁡log⁡x)2})O_A(x\exp\{-A(\log\log x)^2\}) for tuples of order at most (A/2)log⁡log⁡x(A/2)\log\log x would already suffice for its qualitative conclusions.

Standing

A conjecture. No unconditional theorem of this uniformity is known; the fixed-kk Hardy–Littlewood conjecture itself is open for every k≥2k\ge2. Tao remarks (p. 2 of arXiv:2308.07205) that the conjecture "has been verified almost surely" for the random sifted model of the primes of Banks, Ford and Tao, which is evidence about the model, not about the primes. Every result that assumes this conjecture is conditional, and its acceptance would not make the assumed statement true.

Bears on. #251, as the hypothesis of the claimed conditional results of Land (Theorem 2) and Ringer (Corollary 1.2); it is not a result on the problem.