The Ibragimov–Iosifescu conjecture for φ-mixing sequences
Ibragimov conjectured that if is a strictly stationary, -mixing sequence withandthenGPT-6 Astra constructs a counterexample satisfying all these hypotheses for which, along a subsequence ,in probability. Hence the conjectured central limit theorem fails.
- Result
- Disproved(see note)
- Status
- Candidate (review pending)
- AI contribution
- AI-discovered
- Method
- Argument
- Field
- Stationary stochastic processes
- Posed by
- I. A. Ibragimov
- Year posed
- 1971
- Years open
- 55y
- Solved
- 2026-09-05
- Model
- GPT-6 Astra (pre-release)
- Vendor
- OpenAI
- Collaborators
- Tom Adamczewski
- Verification
- Lean-checked, statement unaudited
- Publication
- Announced
- Significance
- 40 / 100
- Disclosed cost
- $261
- Wikipedia
- No dedicated article
What was actually shown
Astra constructs a strictly stationary real processwhere the innovations are i.i.d. Gaussian variables convolved with a symmetric rare-spike law, and is bounded, continuous, and odd. The process is -mixing, centered, square-integrable, and satisfiesNevertheless there are times such thatin probability. Therefore the normalized sums cannot converge in distribution to .
The same example also rules out Iosifescu's stronger weak invariance-principle conjecture, since Brownian convergence would imply the CLT at time .
What the AI did
GPT-6 Astra autonomously constructed the counterexample and wrote its Lean proof. The run lasted about 12 hours and 1054 turns. The core idea is to build a stationary causal process from Gaussian-smoothed rare spikes plus a bounded nonlinear feedback correction. The feedback suppresses ordinary fluctuations along selected times, while extremely rare large spikes keep . Astra also proves that the resulting process remains genuinely -mixing by constructing a bounded causal inverse with square-summable tail variation.
Verification
Lean-checked, statement unaudited. Checked here on 6 September 2026 from a clone of tadamcz/phi-mixing-clt at 8e08498: 13,047 lines, zero sorry outside the statement stubs, zero axiom declarations, no native_decide, unsafe or implemented_by; the repository's recorded verifier accepted the disproof with the default kernel and only the three standard axioms. The statement, however, was produced by Epoch's AI-autoformalized 'wikipedia' run, not by a human-curated repository, and this site has not audited the formal definitions of strict stationarity and the φ-mixing coefficient against the sources beyond reading the docstring, which is careful about conventions. The repository's own audit finds no mismatch, but that audit is machine-written. No probabilist outside the run has read the 12,900-line construction. Hence Candidate.
Sources
- Lean proofThe Lean development (submission/Spec.lean)
- Lean statementChallenge.lean: the compared statement
- CodeGithub
- Problem recordPeligrad (1990), On Ibragimov–Iosifescu conjecture for φ-mixing sequences
Submitted by VibeGene on