The two-point Chowla conjecture (ordinary averages)
Let be the Liouville function. Chowla's conjecture predicts that for every fixed set of distinct shifts. Its two-point case asks whether the parities of and become uncorrelated. Matomaki and Radziwill obtained a bound , Matomaki-Radziwill-Tao proved cancellation on average over shifts, and Tao proved the logarithmically averaged version, with quantitative log-averaged savings by Helfgott-Radziwill and Pilatte. Does hold for every fixed ?
- Result
- Proved(see note)
- Status
- Candidate (review pending)
- AI contribution
- AI-discovered
- Method
- Argument
- Field
- Analytic number theory; correlations of multiplicative functions
- Posed by
- Sarvadaman Chowla, The Riemann Hypothesis and Hilbert's Tenth Problem (Gordon and Breach, 1965)
- Year posed
- 1965
- Years open
- 61y
- Solved
- 2026-09-24
- Model
- Unreleased internal OpenAI model
- Vendor
- OpenAI
- Collaborators
- —
- Verification
- Lean-checked, statement unaudited
- Publication
- Announced
- Collection
- OpenAI math release (October 2026), version adc7f12
- Significance
- 58 / 100
- Disclosed cost
- —
- Wikipedia
- No dedicated article
What was actually shown
There is an absolute such that for all fixed integers , with , for every real . With , , this is the ordinary two-point Chowla conjecture with a power-of-log saving. Constants are ineffective, and coefficients may not grow with . Nothing is proved for three or more points.
What the AI did
The release README says the results were produced by an unreleased internal OpenAI model with a fixed procedure, on average about three hours of ChatGPT Pro thinking compute per result, and that some outputs build on earlier model results. This result is not among the README's exceptions (the Hodge conjecture for CM abelian varieties and the Re(s) > 11/12 zero-free region). The manuscript is authored 'OpenAI' and names no human author. Single manuscript, dated September 24, 2026. The release also publishes an abridged summary of the model's reasoning for this family (reasoning_traces/ordinary-two-point-correlations.pdf).
Verification
No independent mathematician has checked this yet. Checked here: Theorem 1.1 was read against the two-point case of Chowla's conjecture with ordinary averages. The challenges are not in the formalization catalogue (lean/formalization.yaml); lean/ComparatorChallenges/OrdinaryTwoPointCorrelations.json and OrdinaryElliott.json exist with solution modules OAI.NumberTheory.TwoPointCorrelations.FinalMain and OAI.NumberTheory.OrdinaryCorrelations.Elliott.Main present at the pinned commit, permitted axioms propext, Quot.sound and Classical.choice. The statement OAI.OrdinaryTwoPointCorrelations.liouville_log_saving was read: an absolute c > 0 such that for natural a1, a2 >= 1, b1, b2 with a1 b2 != a2 b1 there is C > 0 with |sum_{n <= X} lambda(a1 n + b1) lambda(a2 n + b2)| <= C X / (log X)^c for all real X >= 3. That covers the headline, including every shift h >= 1. Not rebuilt here. The paper says the constants need not be effective and no uniformity in the forms is claimed.
Sources
- Lean proofLean proof: OAI/NumberTheory/TwoPointCorrelations/FinalMain.leanLean proof: OAI/NumberTheory/OrdinaryCorrelations/Elliott/Main.lean
- CodeOpenAI math release: Ordinary two-point correlations of multiplicative functions
- OtherAbridged summary of the model's reasoning (release reasoning_traces)Matomaki, Radziwill, Tao, An averaged form of Chowla's conjecture (Algebra Number Theory 2015)