Lean statement

Polynomial hitting lists for rational formulas

Lean is a language for mathematical statements and proofs that a computer can verify. This page shows one statement file from OpenAI’s release, possible paper matches and independent reports. The code-like names below identify the definitions or theorems selected by the proof-verification settings.

Theorem selected for verification: OAI.RationalHitting.main

Lean statement file: RationalHitting.leanShow on the mapFamily 116. OpenAI lists this as a main result in its Lean catalogue.

See the candidate theorem Who ran the proof-verification program Report a comparison with the paper (GitHub issue)

The Lean statement

The lines of the Lean statement that state the theorem, then the definitions in the file that it uses.

def MainStatement : Prop :=  ∃ (m : ℕ) (G : Machine m) (C k : ℕ), 0 < C ∧ 0 < k ∧    ∀ n s : ℕ, 1 ≤ n → 1 ≤ s → ∃ H : Output n,      H.dimension ≤ C * (n + s + 1) ^ k ∧      (encodeOutput H).length ≤ C * (n + s + 1) ^ k ∧      OutputsWithin G s (C * (n + s + 1) ^ k) H ∧ Hits s H⋮theorem main : MainStatement := by  sorry

A Lean statement states the theorem and leaves its proof as sorry on purpose. OpenAI’s proof is in a separate solution module, and a program called Comparator checks that proof against this statement.

Definitions needed to read it

Local definitions the statement names, followed through the definitions they name in turn. The match is by name in the source text, so a name reached only through notation can be missed; the full file is below.

inductive type OAI.RationalHitting.Formula line 9

inductive Formula (n : ℕ) where  | var : Fin n → Formula n  | const : ℚ → Formula n  | add : Formula n → Formula n → Formula n  | mul : Formula n → Formula n → Formula n  | inv : Formula n → Formula n  deriving DecidableEq

definition OAI.RationalHitting.Formula.size line 19

def size {n : ℕ} : Formula n → ℕ  | .var _ | .const _ => 1  | .add f g | .mul f g => f.size + g.size + 1  | .inv f => f.size + 1

inductive type OAI.RationalHitting.Formula.Eval line 26

inductive Eval {n : ℕ} {R : Type u} [Ring R]    (c : ℚ →+* R) (X : Fin n → R) : Formula n → R → Prop where  | var (i) : Eval c X (.var i) (X i)  | const (a) : Eval c X (.const a) (c a)  | add {f g a b} : Eval c X f a → Eval c X g b → Eval c X (.add f g) (a + b)  | mul {f g a b} : Eval c X f a → Eval c X g b → Eval c X (.mul f g) (a * b)  | inv {f a b} : Eval c X f a → a * b = 1 → b * a = 1 → Eval c X (.inv f) b

abbreviation OAI.RationalHitting.Mat line 36

abbrev Mat (d : ℕ) := Matrix (Fin d) (Fin d) ℚ

abbreviation OAI.RationalHitting.Tuple line 37

abbrev Tuple (n d : ℕ) := Fin n → Mat d

definition OAI.RationalHitting.Evaluates line 39

def Evaluates {n d : ℕ} (f : Formula n) (X : Tuple n d) (v : Mat d) : Prop :=  f.Eval (algebraMap ℚ (Mat d)) X v

definition OAI.RationalHitting.Admissible line 42

def Admissible {n : ℕ} (f : Formula n) : Prop :=  ∃ d, 0 < d ∧ ∃ (X : Tuple n d), ∃ v, Evaluates f X v

definition OAI.RationalHitting.Nonzero line 45

def Nonzero {n : ℕ} (f : Formula n) : Prop :=  ∃ d, 0 < d ∧ ∃ (X : Tuple n d), ∃ v, Evaluates f X v ∧ v ≠ 0

structure OAI.RationalHitting.Output line 49

structure Output (n : ℕ) where  dimension : ℕ  dimension_pos : 0 < dimension  tuples : List (Tuple n dimension)

definition OAI.RationalHitting.encodeNat line 56

def encodeNat (a : ℕ) : List Bool :=  let ds := (Nat.digits 2 a).map (fun b => b != 0)  List.replicate ds.length true ++ [false] ++ ds

definition OAI.RationalHitting.encodeRat line 62

def encodeRat (a : ℚ) : List Bool :=  [decide (a.num < 0)] ++ encodeNat a.num.natAbs ++ encodeNat a.den

definition OAI.RationalHitting.encodeTuple line 65

def encodeTuple {n d : ℕ} (X : Tuple n d) : List Bool :=  (List.finRange n).flatMap fun i =>    (List.finRange d).flatMap fun j =>      (List.finRange d).flatMap fun k => encodeRat (X i j k)

definition OAI.RationalHitting.encodeOutput line 70

def encodeOutput {n : ℕ} (H : Output n) : List Bool :=  encodeNat H.dimension ++ encodeNat H.tuples.length ++ H.tuples.flatMap encodeTuple

abbreviation OAI.RationalHitting.Alphabet line 75
```
abbrev Alphabet := Fin 4
```

abbreviation OAI.RationalHitting.Machine line 76

abbrev Machine (m : ℕ) := Turing.TM0.Machine Alphabet (Fin (m + 1))

abbreviation OAI.RationalHitting.Config line 77

abbrev Config (m : ℕ) := Turing.TM0.Cfg Alphabet (Fin (m + 1))

definition OAI.RationalHitting.tapeBit line 79

def tapeBit (b : Bool) : Alphabet := if b then 2 else 1

definition OAI.RationalHitting.unaryInput line 81

def unaryInput (n s : ℕ) : List Alphabet :=  List.replicate n 2 ++ [1] ++ List.replicate s 2

definition OAI.RationalHitting.run line 85

def run {m : ℕ} (G : Machine m) : ℕ → Config m → Option (Config m)  | 0, a => some a  | t + 1, a => (Turing.TM0.step G a).bind (run G t)

definition OAI.RationalHitting.OutputsWithin line 89

def OutputsWithin {m n : ℕ} (G : Machine m) (s bound : ℕ) (H : Output n) : Prop :=  ∃ t ≤ bound, ∃ a : Config m,    run G t (Turing.TM0.init (unaryInput n s)) = some a ∧    Turing.TM0.step G a = none ∧    a.Tape.right₀ = Turing.ListBlank.mk ((encodeOutput H).map tapeBit)

definition OAI.RationalHitting.Hits line 95

def Hits {n : ℕ} (s : ℕ) (H : Output n) : Prop :=  ∀ f : Formula n, f.size ≤ s → Admissible f → Nonzero f →    ∃ X ∈ H.tuples, ∃ v, Evaluates f X v ∧ IsUnit v

Possible paper match, with no recorded review

Atlas selected this possible match by comparing words in the Lean statement with every statement in the family. No review of whether the statements mean the same thing is recorded.

Words of the Lean statement, its names split into words, that also appear in the theorem: advice, signed, works, oracle, denominators, finite, numerators, inverse and 17 more. Found in the paper’s title, which its main theorem states: polynomial. Shared only with the release’s name for the Lean statement or OpenAI’s note on it: variables and invertible.

Statements in Polynomial Hitting Lists for Noncommutative Rational Formulas come first because the release’s name for this Lean statement shares words with that paper’s title.

Theorem 1.1 of Polynomial Hitting Lists for Noncommutative Rational Formulas

Theorem

There are a deterministic Turing machine G and fixed positive integers C,k with the following property. Given 1^n,1^s, where n,s\geq1, the machine outputs a finite list \mathcal H_{n,s} of n-tuples of rational square matrices, in at most C(n+s+1)^k bit operations. The entire output, with signed binary numerators and positive binary denominators, has at most C(n+s+1)^k bits. For every nonzero admissible rational formula \Phi in n variables of size at most s, some tuple in \mathcal H_{n,s} is a defined evaluation of \Phi with invertible value.

The same list works for all such formulas, regardless of the bit lengths of their rational constants or their inverse depth. The generator receives no formula, oracle, randomness, or advice.

Section 1, Introduction Read it in the paper TeX source, line 20

Show the TeX

There are a deterministic Turing machine $G$ and fixed positive integers $C,k$ with the following property. Given $1^n,1^s$, where $n,s\geq1$, the machine outputs a finite list $\mathcal H_{n,s}$ of $n$-tuples of rational square matrices, in at most $C(n+s+1)^k$ bit operations. The entire output, with signed binary numerators and positive binary denominators, has at most $C(n+s+1)^k$ bits. For every nonzero admissible rational formula $\Phi$ in $n$ variables of size at most $s$, some tuple in $\mathcal H_{n,s}$ is a defined evaluation of $\Phi$ with invertible value.

The same list works for all such formulas, regardless of the bit lengths of their rational constants or their inverse depth. The generator receives no formula, oracle, randomness, or advice.

Other possible paper matches, closest wording first

Proposition 5.3 of Polynomial Hitting Lists for Noncommutative Rational Formulas. Words of the Lean statement, its names split into words, that also appear in the theorem: encoding, list, turing, machine, bounded, binary and five more. Shared only with the release’s name for the Lean statement or OpenAI’s note on it: number.
Corollary 6.1 of Polynomial Hitting Lists for Noncommutative Rational Formulas. Words of the Lean statement, its names split into words, that also appear in the theorem: oracle, encoding, unary, finite, ordinary, dimension and twelve more. Shared only with the release’s name for the Lean statement or OpenAI’s note on it: complete and number.
Theorem 1.1 of Uniform Matrix Hitting Points in Every Positive Characteristic. Words of the Lean statement, its names split into words, that also appear in the theorem: included, unary, ordinary, dimensions, output, turing and 13 more. Shared only with the release’s name for the Lean statement or OpenAI’s note on it: running.
Theorem 1.1 of One Rational Matrix Hitting Point for Noncommutative Formulas. Words of the Lean statement, its names split into words, that also appear in the theorem: canonical, denominators, numerators, time, bit, zero and six more. Found in the paper’s title, which its main theorem states: one, rational, formulas and matrix.
Proposition 4.2 of Polynomial Hitting Lists for Noncommutative Rational Formulas. Words of the Lean statement, its names split into words, that also appear in the theorem: common, inverse, admissible, positive, one, size and three more. Shared only with the release’s name for the Lean statement or OpenAI’s note on it: invertible.
Proposition 5.1 of Polynomial Hitting Lists for Noncommutative Rational Formulas. Words of the Lean statement, its names split into words, that also appear in the theorem: admissible, evaluation, size, formula, tuple and nonzero. Shared only with the release’s name for the Lean statement or OpenAI’s note on it: invertible.

How Atlas selects possible matches: it compares words in the Lean statement with every statement in the family. It also splits Lean names into words. The release’s label and note receive less weight; a main theorem wins a close match. If the Lean wording yields no clear match, Atlas uses the catalogue description. This selects passages to compare; it does not establish that they mean the same thing.

Reported Comparator runs

three independent groups report that Comparator accepted runs for this Lean statement file: Carlos Toledo’s cert-machine; MathVet; Neal McBurnett’s openai-math-lean-tooling. Each group reports its own Comparator run for this statement file. Atlas has not repeated the runs.

For a configured theorem, Comparator tests whether OpenAI’s proof proves the exact Lean statement. Some files instead configure definitions for comparison by name and type. Acceptance does not establish that the statement means the same thing as the paper’s theorem.

Carlos Toledo’s cert-machine

How they ran it, in their words

Every Comparator challenge re-run on Linux with nanoda switched on, decided by a preregistered rule; every family’s challenge statements read against OpenAI’s headline, clause by clause. Decider: Comparator (leanprover/comparator d03acab1 = tag v4.34.0, built with the release’s toolchain v4.34.1), lean4export 076e8e57, landrun 811cfff5, nanoda_lib 3a240721 — on GitHub’s Linux runners (.github/workflows/openai-math-kernel.yml), one j…

Accepted Their term: “CERTIFIED”.
Re-run through Comparator with the independent nanoda kernel switched on: Lean’s kernel and nanoda both accept OpenAI’s solution.
Reported 10 October 2026, at the release version shown here. Original verification report

MathVet

How they ran it, in their words

An independent, model-assisted, pre-referee reading of each family’s challenge statements against its headline claim under a published rubric (PROTOCOL.md), with its own Comparator runs per challenge. Its protocol describes a planned error-rate study; this import does not establish that the study has been completed.

Accepted Their term: “comparator-sandboxed-pass”.
Re-run through Comparator in a sandboxed virtual machine: accepted.
Reported 8 October 2026, at the release version shown here. Original verification report

Neal McBurnett’s openai-math-lean-tooling

How they ran it, in their words

Each challenge’s solution is built and checked by Comparator at the pinned release, on Lean leanprover/lean4:v4.34.1, recording the verdict, the check time and the peak memory; the run was still in progress at this snapshot (192 accepted, 224 pending).

Accepted Their term: “accepted”.
Re-run through Comparator with Lean’s kernel: accepted (the check took 188 s; peak memory 6.6 GiB).
Reported 11 October 2026, at the release version shown here. Original verification report

What an accepted Comparator run would establish

If Comparator is run under this configuration and accepts, the solution proves the configured theorem using only the allowed axioms, and the Lean kernel accepts every step.

This configuration lists no definition holes, so every definition the statement uses is compared as it is written in this file.

Allowed axioms: propext, Quot.sound, Classical.choice

Acceptance leaves open whether the Lean statement means the same thing as the paper’s theorem, whether the paper’s other claims are correct, and whether the result is new. Those questions require comparing the definitions and statements, reviewing the paper’s arguments, and reading the earlier literature.

Do family 116’s Lean statements express the advertised result?

These assessments compare all the family’s Lean statements with the whole result OpenAI describes in its catalogue. They do not assess this statement alone. Each group uses its own published rules.

Neither group finds that the Lean statements express or imply the whole advertised result. They describe what the statements express in different terms.

MathVet
Finds part of it stated, or a narrower or weaker statement Their term: “partial”.
Only a special case is stated, or a co-equal headline claim has no challenge statement. Their record
Their note: Characteristic-zero existence of one hitting tuple (no complexity claim) and the poly-time rational hitting lists are stated; positive-characteristic constructions and the polynomial-bit-time bound for the single tuple are not.
Definitions the group asks readers to compare with the paper: Hits quantifies over Admissible/Nonzero formulas via a hand-rolled relational Eval (inverse requires an actual two-sided inverse of the evaluated operand); machine is Mathlib Turing.TM0.Machine (Fin 4) (Fin (m+1)) with unary input n,1,s (time polynomial in n + s, not in a binary length)
Carlos Toledo’s cert-machine
Finds part of it stated, or a narrower or weaker statement Their term: “NARROWER — UNLINKED”.
The challenge statements state less than the headline; the missing part comes from a paper the Lean note does not link. Their record
Their note: Every positive characteristic: no challenge states a hitting tuple over 𝔽_p or over fields of characteristic p (the October-4 manuscript 'Uniform Matrix Hitting Points in Every Positive Characteristic', which the scope note does not link). Also not asserted, but declared: the polynomial bit-time construction of the characteristic-zero tuple.

Read the complete assessments on the family page.

OpenAI’s own note on what this Lean statement covers

“Given the number of variables and a formula-size bound, one deterministic polynomial-time machine outputs rational matrix tuples of a common positive dimension. Every admissible nonzero formula within the size bound evaluates to an invertible matrix on some listed tuple. The matrix dimension, complete binary output length, and running time are all polynomially bounded.”
Quoted from OpenAI’s Lean note for this family

An AI agent drafted an interpretation of that note, classifying this statement as “states a paper’s theorem as the paper does”. No human review of the draft is recorded.

Supporting material

The complete Lean statement file

113 lines, copied from release version fd4aeeb. A name defined in this file links to its line; pointing at the name shows its definition.

Declared in this fileOpenAI’s library at fd4aeebOther linked names open the current documentation for Mathlib, Lean’s mathematical library.

Links in the file: 68 to its own declarations, 44 to Mathlib’s documentation. 22 declared names also link to the same declaration in OpenAI’s library. OpenAI uses Mathlib version d13f23b. The linked documentation describes the current version, so names that have since changed may be missing there.

Definitions and lemmas named by the statement

If Comparator accepts a proof, it proves main exactly as written here. To compare that statement with the paper, also read the definitions and lemmas listed below. Atlas found them by following names in the source text and lists each after the names it uses. For x.foo, Atlas includes every foo defined here for a type, even when the statement may use only one of them.

It reaches all 22 other declarations of the file; with the theorem itself they span 66 lines. 1 of them is named in the statement itself.

Names in the namespace OAI.RationalHitting are listed without it.

inductive Formulaline 9library
def Formula.sizeline 19library
inductive Formula.Evalline 26library
abbrev Matline 36library
abbrev Tupleline 37library
def Evaluatesline 39library
def Admissibleline 42library
def Nonzeroline 45library
structure Outputline 49library
def encodeNatline 56library
def encodeRatline 62library
def encodeTupleline 65library
def encodeOutputline 70library
abbrev Alphabetline 75library
abbrev Machineline 76library
abbrev Configline 77library
def tapeBitline 79library
def unaryInputline 81library
def runline 85library
def OutputsWithinline 89library
def Hitsline 95library
def MainStatementline 101in the statementlibrary
theorem mainline 108selected theorem

import Mathlibnamespace OAInamespace RationalHittinguniverse uinductive Formula (n : ℕ) where  | var : Fin n → Formula n  | const : ℚ → Formula n  | add : Formula n → Formula n → Formula n  | mul : Formula n → Formula n → Formula n  | inv : Formula n → Formula n  deriving DecidableEqnamespace Formuladef size {n : ℕ} : Formula n → ℕ  | .var _ | .const _ => 1  | .add f g | .mul f g => f.size + g.size + 1  | .inv f => f.size + 1/-- Evaluation in any rational algebra; a unary inverse requires an actual    two-sided inverse of the evaluated operand, not a totalized inverse. -/inductive Eval {n : ℕ} {R : Type u} [Ring R]    (c : ℚ →+* R) (X : Fin n → R) : Formula n → R → Prop where  | var (i) : Eval c X (.var i) (X i)  | const (a) : Eval c X (.const a) (c a)  | add {f g a b} : Eval c X f a → Eval c X g b → Eval c X (.add f g) (a + b)  | mul {f g a b} : Eval c X f a → Eval c X g b → Eval c X (.mul f g) (a * b)  | inv {f a b} : Eval c X f a → a * b = 1 → b * a = 1 → Eval c X (.inv f) bend Formulaabbrev Mat (d : ℕ) := Matrix (Fin d) (Fin d) ℚabbrev Tuple (n d : ℕ) := Fin n → Mat ddef Evaluates {n d : ℕ} (f : Formula n) (X : Tuple n d) (v : Mat d) : Prop :=  f.Eval (algebraMap ℚ (Mat d)) X vdef Admissible {n : ℕ} (f : Formula n) : Prop :=  ∃ d, 0 < d ∧ ∃ (X : Tuple n d), ∃ v, Evaluates f X vdef Nonzero {n : ℕ} (f : Formula n) : Prop :=  ∃ d, 0 < d ∧ ∃ (X : Tuple n d), ∃ v, Evaluates f X v ∧ v ≠ 0/-- All output tuples have one common positive dimension. -/structure Output (n : ℕ) where  dimension : ℕ  dimension_pos : 0 < dimension  tuples : List (Tuple n dimension)/-- Little-endian unsigned binary, prefixed by a unary bit-length and a zero    terminator. This is a self-delimiting binary encoding, including zero. -/def encodeNat (a : ℕ) : List Bool :=  let ds := (Nat.digits 2 a).map (fun b => b != 0)  List.replicate ds.length true ++ [false] ++ ds/-- Sign bit, binary numerator magnitude, and positive binary denominator.    Rat.num and Rat.den are the canonical reduced numerator and denominator. -/def encodeRat (a : ℚ) : List Bool :=  [decide (a.num < 0)] ++ encodeNat a.num.natAbs ++ encodeNat a.dendef encodeTuple {n d : ℕ} (X : Tuple n d) : List Bool :=  (List.finRange n).flatMap fun i =>    (List.finRange d).flatMap fun j =>      (List.finRange d).flatMap fun k => encodeRat (X i j k)def encodeOutput {n : ℕ} (H : Output n) : List Bool :=  encodeNat H.dimension ++ encodeNat H.tuples.length ++ H.tuples.flatMap encodeTuple/-- 0 is blank, 1 and 2 are the two literal binary digits, 3 is work space.    Fixed finite tape alphabet and finite state space; no advice or oracle. -/abbrev Alphabet := Fin 4abbrev Machine (m : ℕ) := Turing.TM0.Machine Alphabet (Fin (m + 1))abbrev Config (m : ℕ) := Turing.TM0.Cfg Alphabet (Fin (m + 1))def tapeBit (b : Bool) : Alphabet := if b then 2 else 1def unaryInput (n s : ℕ) : List Alphabet :=  List.replicate n 2 ++ [1] ++ List.replicate s 2/-- Exactly t ordinary deterministic TM0 transitions. -/def run {m : ℕ} (G : Machine m) : ℕ → Config m → Option (Config m)  | 0, a => some a  | t + 1, a => (Turing.TM0.step G a).bind (run G t)def OutputsWithin {m n : ℕ} (G : Machine m) (s bound : ℕ) (H : Output n) : Prop :=  ∃ t ≤ bound, ∃ a : Config m,    run G t (Turing.TM0.init (unaryInput n s)) = some a ∧    Turing.TM0.step G a = none ∧    a.Tape.right₀ = Turing.ListBlank.mk ((encodeOutput H).map tapeBit)def Hits {n : ℕ} (s : ℕ) (H : Output n) : Prop :=  ∀ f : Formula n, f.size ≤ s → Admissible f → Nonzero f →    ∃ X ∈ H.tuples, ∃ v, Evaluates f X v ∧ IsUnit v/-- A fixed polynomial bound on bit time, full binary output length,and common positive dimension. -/def MainStatement : Prop :=  ∃ (m : ℕ) (G : Machine m) (C k : ℕ), 0 < C ∧ 0 < k ∧    ∀ n s : ℕ, 1 ≤ n → 1 ≤ s → ∃ H : Output n,      H.dimension ≤ C * (n + s + 1) ^ k ∧      (encodeOutput H).length ≤ C * (n + s + 1) ^ k ∧      OutputsWithin G s (C * (n + s + 1) ^ k) H ∧ Hits s Htheorem main : MainStatement := by  sorryend RationalHittingend OAI

Every extracted statement of the accompanying papers

The statements the atlas extracted automatically from each accompanying paper’s TeX source, with links to the full sources.

One Rational Matrix Hitting Point for Noncommutative Formulas

Theorem

There is a deterministic algorithm which, given integers n,s\ge1, constructs a tuple

\mathbf T_{n,s}\in\Mat_d(\Q)^n, \qquad d\le 2ns^2,

in time polynomial in n,s, measured in bit operations. The numerators and denominators of its entries have bit length O(\log(ns+1)+ns^2\log(n+1)). For every field F of characteristic zero and every 0\ne f\in\mathsf{Form}_{n,s}(F),

f(\mathbf T_{n,s})\ne0,

where the tuple is viewed over F through the canonical embedding \Q\hookrightarrow F. The construction uses d=2ns^2 when ns\ge2 and d=1 when n=s=1.

Section 1, Introduction Read it in the paper TeX source, line 24

Show the TeX

There is a deterministic algorithm which, given integers $n,s\ge1$,
constructs a tuple
\[
 \mathbf T_{n,s}\in\Mat_d(\Q)^n,
 \qquad d\le 2ns^2,
\]
in time polynomial in $n,s$, measured in bit operations. The numerators and
denominators of its entries have bit length
$O(\log(ns+1)+ns^2\log(n+1))$.
For every field $F$ of characteristic zero and every
$0\ne f\in\mathsf{Form}_{n,s}(F)$,
\[
 f(\mathbf T_{n,s})\ne0,
\]
where the tuple is viewed over $F$ through the canonical embedding
$\Q\hookrightarrow F$. The construction uses $d=2ns^2$ when $ns\ge2$
and $d=1$ when $n=s=1$.

Polynomial Hitting Lists for Noncommutative Rational Formulas

Theorem

The same list works for all such formulas, regardless of the bit lengths of their rational constants or their inverse depth. The generator receives no formula, oracle, randomness, or advice.

Section 1, Introduction Read it in the paper TeX source, line 20

Show the TeX

There are a deterministic Turing machine $G$ and fixed positive integers $C,k$ with the following property. Given $1^n,1^s$, where $n,s\geq1$, the machine outputs a finite list $\mathcal H_{n,s}$ of $n$-tuples of rational square matrices, in at most $C(n+s+1)^k$ bit operations. The entire output, with signed binary numerators and positive binary denominators, has at most $C(n+s+1)^k$ bits. For every nonzero admissible rational formula $\Phi$ in $n$ variables of size at most $s$, some tuple in $\mathcal H_{n,s}$ is a defined evaluation of $\Phi$ with invertible value.

The same list works for all such formulas, regardless of the bit lengths of their rational constants or their inverse depth. The generator receives no formula, oracle, randomness, or advice.

Configuration and file facts

File: lean/ComparatorChallenges/RationalHitting.lean
OpenAI’s Lean catalogue: OpenAI lists this as a main result in its Lean catalogue.
Solution module: OAI/Computability/RationalHitting/Main.lean
Allowed axioms: propext, Quot.sound, Classical.choiceThe axioms this configuration allows a proof to use. A replay shows which of them a proof uses.
Imports: Mathlib
Imports from outside Mathlib: None
Local vocabulary: 22 local vocabulary declarations
Lines of Lean, without comments or blank lines: 66
Second proof-verification program (nanoda): Off in OpenAI's configuration.

A shareable summary of this page: the proposed paper match, what the Lean statement expresses, and which reviews are recorded.

Plectis Atlas