The conjecture on a stationary process without a good ARMA approximation
The conjecture on a stationary process without a good ARMA approximation
Let be uncorrelated white noise random variables, and define the stationary process
For integers , consider an ARMA model
with moving-average terms and autoregressive terms, and the truncation
Conjecture on the absence of a good ARMA approximation. The process does not have a good ARMA model of the displayed form that is better than the simple -term truncation (or moving-average approximation) .
Sources & referencesView supporting material
Primary source
Anand Ganesh, Babhrubahan Bose and Anand Rajagopalan, “On an L^2 norm for stationary ARMA processes”, arXiv:2408.10610 (2026).
Progress summary
A 2024 paper records the conjecture but leaves it open, and the scan found no later proof or counterexample.
The conjecture concerns whether the logarithmic-coefficient process can be approximated by an ARMA model more accurately than its corresponding finite truncation. It is explicitly presented as unresolved in the 2024 paper that formulates the example.
Known results
- A rational/operator approximation theorem applies when , but the example has and does not satisfy this condition.
August 2024 unresolved formulation
The paper states that the conjectured absence of a good ARMA approximation “requires further justification” and notes that its theorem cannot decide this example. The retrieved sources report no proof, counterexample, verification, or claimed AI-generated solution.
Current status (as of August 2026): The conjecture remains open; no proof, counterexample, or verification was found in the retrieved public sources.
Sources
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.
The conjecture is underspecified because “better” is undefined. If “better” refers to the L2 approximation criterion introduced in the source paper, then the conjecture is refuted by the stable AR(1) model
Yt=ϵt−21Yt−1.