Theoretical computer science·OpenAI Math·Result 141
Existential–universal real sentences in the counting hierarchy
One of the 372 results in OpenAI's public mathematics catalogue, filed under theoretical computer science: 1 preprint, the latest dated 4 October 2026. This page quotes OpenAI's own summary of the claim, links the paper and abstract, and embeds the animation.
In one line: OpenAI reports a result titled ‘Existential–universal real sentences in the counting hierarchy’ (theoretical computer science) in a preprint dated 4 October 2026. It has not been peer reviewed. The channel's animation, Every OpenAI Math Result, Part 2 of 4: PCP for PPAD, Birkhoff Conjecture and 82 More, is on YouTube.
Chapter 7 of 84 in Every OpenAI Math Result, Part 2 of 4: PCP for PPAD, Birkhoff Conjecture and 82 More · starts at 2:03 · watch from there on YouTube →
What OpenAI claims
Proves that the existential theory of the reals lies in the counting hierarchy. More generally, truth of existential–universal real sentences can be decided at one fixed level of that hierarchy, even when their integer polynomials are specified by arithmetic circuits.
Paper
Existential–universal real sentences in the counting hierarchy
OpenAI's abstract We prove that the existential theory of the reals lies in the counting hierarchy. More generally, we show that the truth of existential–universal sentences over the reals can be decided in a fixed level of the counting hierarchy, even when the integer polynomials are given by arithmetic circuits.
Status
Preprint. The paper has not been independently reviewed. Treat the result as OpenAI's claim until other mathematicians have checked it. If a video exists, it illustrates the statement; it is not the proof.
Quick answers
- Is it proven?
- Not independently yet. OpenAI posted a preprint on 4 October 2026; it has not been peer reviewed, so treat the result as OpenAI's claim until other mathematicians have checked it.
- What exactly does OpenAI claim?
- Proves that the existential theory of the reals lies in the counting hierarchy. More generally, truth of existential–universal real sentences can be decided at one fixed level of that hierarchy, even when their integer polynomials are specified by arithmetic circuits.
- Where is the proof?
- In the paper, Existential–universal real sentences in the counting hierarchy (PDF).
- Is there a video?
- Yes, on YouTube (29:10, chapter 7).
Also in
- Chapter 4 of 9 in L = BPL, Matrix Multiplication Exponent, Integer Multiplication and 6 More · starts at 1:02 · watch from there on YouTube →
The video
Every OpenAI Math Result, Part 2 of 4: PCP for PPAD, Birkhoff Conjecture and 82 More · Compilation · 29:10 · chapter 7 from 2:03 · description, sources and chapters →
Related results in Theoretical computer science
- 142Deterministic polynomial factorization over prime fieldsVideo
- 102The Unique Games Conjecture and optimal approximation thresholdsVideoLean
- 103Exact derandomization of logarithmic space: L=RL=BPLVideoLean
- 104Quasipolynomial algorithms for mean-payoff, stochastic and parity gamesLean
- 105Perfect completeness for 2-to-1 gamesVideoLean
- 106Hardness of coloring three-colorable graphsVideoLean
