Plectis Atlas
Search

↑ and ↓ move, Enter opens, Esc closes.

Existential–universal real sentences in the counting hierarchy

OpenAI groups related papers into a “family”. OpenAI’s catalogue describes this one:

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.

The release has no Lean statement for this family, so there is no formal statement to compare with the result described above.

The paper states

Theorem 1.1

In Existential–universal real sentences in the counting hierarchy, 4 October 2026

Possible match to OpenAI’s description, selected from the papers’ main statements because it shares the most wording. No review confirming the selection is recorded.

There is an absolute integer j such that

\EATR\in\Clevel j.

The level j is independent of the input length, the numbers of variables, the degrees of the circuit polynomials, and their coefficient magnitudes.

Reported proof verification
The release has no Lean statement for this family. The papers are available to read and assess.

Papers

Each paper opens as a reading page in the browser, with the PDF beside it. The statements each paper opens with are on its reading page.

Existential–universal real sentences in the counting hierarchy

4 October 2026, current edition.

Read it herePDF

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.

Lean statements

The release has no Lean statement for this family. Its papers remain available to read, and contributors can propose a formal statement of a result. Suggest a change

Independent comparisons and proof-verification reports

Does the Lean express the advertised result?

The release contains no Lean statement for this family, so there is no formal statement to compare with OpenAI’s description.

What these papers cite in the release, and what cites them

These links come from the papers’ bibliographies. A citation records that one paper cites another; how each cited result is used has not been examined here.

Papers elsewhere in the release that this family’s papers cite

This family’s papers cite no paper elsewhere in the release.

Papers elsewhere in the release that cite this family’s papers

No paper elsewhere in the release cites this family’s papers.

References outside the release

Each paper’s outside references are listed with it on its reading page, where each citation is placed. Every outside work cited in the release: References outside the release

Explain a result, compare statements or propose a correction

Atlas has no contributed explanation for this family yet. You can offer one with a GitHub account. You receive named credit and disclose any AI assistance.

Each button opens a GitHub form with this page and its source version filled in. Opening the form does not reserve the work.

Offer to write an explanationSuggest a source attributionSuggest a change

What people have said

Commentary on this family by others, dated and credited. It is commentary, not a finding.

  • An unsigned public tier list, the OpenAI Math Tier List, classes it as a proof and rates its significance, if it holds up, as “Major math journal”. The page says that nothing on it is verified.

    Author not stated. Source

  • Alex Meiburg, $\exists \mathbb{R} \subseteq \textsf{CH}$, 7 October 2026. Source

    Meiburg posted a 114-page ChatGPT-derived proof that the existential theory of the reals lies in the fourth level of the counting hierarchy, noting OpenAI’s very similar result has a slightly weaker bound.

Questions awaiting review

Each item identifies a statement, definition or report that needs further review. Its link opens a GitHub form with the source version already recorded.

Identify the theorem the catalogue describes

  • Family 141 The theorem shown was selected from shared wording with OpenAI’s description. Atlas records no review confirming that it is the theorem the description means. Open the form

State the result in Lean

  • Family 141 The release has no Lean statement for this family. Open the form