Plectis Atlas
Search

↑ and ↓ move, Enter opens, Esc closes.

Lean statement

Explicit triangular-cylinder cover below half area

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.TriangularCovering.main

Lean statement file: TriangularCovering.leanShow on the mapOpenAI’s Lean catalogue does not list this as a main result; the release’s Lean notes for family 100 link it.

The Lean statement

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

theorem main : A_min = H ∧ MainAsymptotic ∧ NormalizedCounterexample := 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.

  • abbreviation OAI.TriangularCovering.Space line 11

    abbrev Space := EuclideanSpace ℝ (Fin 3)
  • definition OAI.TriangularCovering.H line 13

    def H : ℝ := Real.sqrt 2
  • definition OAI.TriangularCovering.point line 15

    def point (x y t : ℝ) : Space := !₂[x, y, H * t]
  • definition OAI.TriangularCovering.K line 17

    def K : Set Space :=  {z | ∃ x y t : ℝ, 0 ≤ t ∧ t ≤ 1 ∧ |x| ≤ 1 - t ∧ |y| ≤ t ∧ z = point x y t}
  • definition OAI.TriangularCovering.projection line 20

    def projection (u z : Space) : Space := z - (inner ℝ u z) • u
  • definition OAI.TriangularCovering.area line 22

    def area (B : Set Space) : ℝ := (Measure.euclideanHausdorffMeasure 2 B).toReal
  • definition OAI.TriangularCovering.shadowArea line 24

    def shadowArea (u : Space) : ℝ := area (projection u '' K)
  • definition OAI.TriangularCovering.A_min line 26

    def A_min : ℝ := sInf {a : ℝ | ∃ u : Space, ‖u‖ = 1 ∧ a = shadowArea u}
  • structure OAI.TriangularCovering.TriCylinder line 28

    structure TriCylinder where
    Show the remaining 10 lines
      axis : Space  base : Set Space  unit_axis : ‖axis‖ = 1  perpendicular : ∀ z ∈ base, inner ℝ axis z = 0  triangular : ∃ v : Fin 3 → Space, AffineIndependent ℝ v ∧    base = convexHull ℝ (Set.range v)  compact : IsCompact base  convex : Convex ℝ base  measurable : MeasurableSet base  finite_area : Measure.euclideanHausdorffMeasure 2 base ≠ ⊤
  • definition OAI.TriangularCovering.TriCylinder.carrier line 40

    def TriCylinder.carrier (c : TriCylinder) : Set Space :=  {z | ∃ b ∈ c.base, ∃ r : ℝ, z = b + r • c.axis}
  • definition OAI.TriangularCovering.Covers line 43

    def Covers {m : ℕ} (c : Fin m → TriCylinder) : Prop :=  ∀ z ∈ K, ∃ i : Fin m, z ∈ (c i).carrier
  • definition OAI.TriangularCovering.totalArea line 46

    def totalArea {m : ℕ} (c : Fin m → TriCylinder) : ℝ :=  ∑ i : Fin m, area (c i).base
  • definition OAI.TriangularCovering.relativeCost line 49

    def relativeCost {m : ℕ} (c : Fin m → TriCylinder) : ℝ :=  ∑ i : Fin m, area (c i).base / shadowArea (c i).axis
  • definition OAI.TriangularCovering.n line 52

    def n (ε : ℝ) : ℕ := ⌈2 / ε ^ 2⌉₊
  • definition OAI.TriangularCovering.MainAsymptotic line 54

    def MainAsymptotic : Prop :=  ∃ δ C : ℝ, 0 < δ ∧ 0 < C ∧    ∀ ε : ℝ, 0 < ε → ε < δ →      ∃ c : Fin (2 * n ε) → TriCylinder,        Covers c ∧        |totalArea c / H - (1 / 2 - (13 / 6000 : ℝ) * ε ^ 2)| ≤ C * ε ^ 4 ∧        totalArea c < A_min / 2
  • definition OAI.TriangularCovering.NormalizedCounterexample line 62

    def NormalizedCounterexample : Prop :=  ∃ m : ℕ, ∃ c : Fin m → TriCylinder, Covers c ∧ relativeCost c < 1 / 2

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: 13/6000, sqrt, min, triangular, base, total, area, perpendicular and four more. Found in the paper’s title, which its main theorem states: finite. Shared only with the release’s name for the Lean statement or OpenAI’s note on it: strictly, tetrahedron and bases.

Statements in Finite angular cylinder covers below the half-area bound come first because the release’s name for this Lean statement shares words with that paper’s title.

Theorem 1.1 of Finite angular cylinder covers below the half-area bound

Theorem

The tetrahedron (eq:tetrahedron) has A_{\min}(K)=\sqrt2. For every 0<\eps\le1/2000, it admits a covering by m=2\lceil2/\eps^2\rceil cylinders with compact triangular perpendicular bases such that

\frac1{\sqrt2}\sum_{i=1}^m|B_i| =\frac12-\frac{13}{6000}\eps^2+O(\eps^4).

The remainder has absolute value at most 2\eps^4, and the total base area is strictly less than A_{\min}(K)/2.

Section 1, Introduction Read it in the paper TeX source, line 32
Show the TeX
The tetrahedron \eqref{eq:tetrahedron} has $A_{\min}(K)=\sqrt2$.
For every $0<\eps\le1/2000$, it admits a covering by
$m=2\lceil2/\eps^2\rceil$ cylinders with compact triangular perpendicular
bases such that
\begin{equation}
 \frac1{\sqrt2}\sum_{i=1}^m|B_i|
 =\frac12-\frac{13}{6000}\eps^2+O(\eps^4).
\end{equation}
The remainder has absolute value at most $2\eps^4$, and the total base
area is strictly less than $A_{\min}(K)/2$.

Other possible paper matches, closest wording first

  • Proposition 4.4 of Finite triangular approximation of radial sweeps. Words of the Lean statement, its names split into words, that also appear in the theorem: normalized, cost, sqrt, min, triangular, base and eight more. Shared only with the release’s name for the Lean statement or OpenAI’s note on it: strictly, whose, small, tetrahedron and bases.
  • Proposition 6.1 of Finite angular cylinder covers below the half-area bound. Words of the Lean statement, its names split into words, that also appear in the theorem: min, triangular, base, total, area, perpendicular and four more. Shared only with the release’s name for the Lean statement or OpenAI’s note on it: tetrahedron and bases.
  • Proposition B.1 of Finite triangular approximation of radial sweeps. Words of the Lean statement, its names split into words, that also appear in the theorem: costs, normalized, sqrt and finite. Shared only with the release’s name for the Lean statement or OpenAI’s note on it: strict, saving, giving, small and tetrahedron.
  • Theorem 5.1 of Slope-field perturbations of the two-cylinder covering. Words of the Lean statement, its names split into words, that also appear in the theorem: asymptotic, sqrt, triangular, base, total, finite and six more. Shared only with the release’s name for the Lean statement or OpenAI’s note on it: regular, small, bound, tetrahedron and bases.
  • Theorem 5.1 of Finite angular cylinder covers below the half-area bound. Words of the Lean statement, its names split into words, that also appear in the theorem: range, independent, real, base, total, area and five more. Shared only with the release’s name for the Lean statement or OpenAI’s note on it: small, tetrahedron and bases.
  • Proposition 6.4 of Slope-field perturbations of the two-cylinder covering. Words of the Lean statement, its names split into words, that also appear in the theorem: convex, min, total, finite, area, perpendicular and four more. Shared only with the release’s name for the Lean statement or OpenAI’s note on it: whose, tetrahedron and bases.

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 272 s; peak memory 6.3 GiB).

    Reported 10 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 100’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.

MathVet and cert-machine agree on how much of the advertised result the Lean statements express.

  • MathVet

    Finds the whole advertised result stated or implied Their term: “full”.

    The challenge statements imply the headline claim after unpacking definitions or one routine step. Their record

    Their note: None for the headline; the aggregate file additionally states ruled-set and radial-sweep approximation results.

    Definitions the group asks readers to compare with the paper: CylinderCovering.lean contains ten run_cmd Lean.modifyEnv fun env => Lean.Meta.auxLemmasExt.setState env {} lines (environment-resetting metaprogramming inside a challenge file; a memory/performance hack that does not change statements)

  • Carlos Toledo’s cert-machine

    Finds the whole advertised result stated or implied Their term: “MATCHES”.

    The challenge statements state the headline as OpenAI wrote it. Their record

Read the complete assessments on the family page.

OpenAI’s own note on what this Lean statement covers

“The formalization constructs finite covers of a regular tetrahedron by cylinders with compact triangular bases whose total area is strictly below that bound. For the explicit small parameter $\varepsilon$, the normalized area is $1/2-(13/6000)\varepsilon^2+O(\varepsilon^4)$, giving the strict saving.”

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

Supporting material

The complete Lean statement file

72 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: 39 to its own declarations, 27 to Mathlib’s documentation. 17 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.

import Mathlibnamespace OAIopen Set MeasureTheoryopen scoped InnerProductSpace BigOperators Intervalnoncomputable sectionnamespace TriangularCoveringabbrev Space := EuclideanSpace ℝ (Fin 3)def H : ℝ := Real.sqrt 2def point (x y t : ℝ) : Space := !₂[x, y, H * t]def K : Set Space :=  {z | ∃ x y t : ℝ, 0 ≤ t ∧ t ≤ 1 ∧ |x| ≤ 1 - t ∧ |y| ≤ t ∧ z = point x y t}def projection (u z : Space) : Space := z - (inner ℝ u z) • udef area (B : Set Space) : ℝ := (Measure.euclideanHausdorffMeasure 2 B).toRealdef shadowArea (u : Space) : ℝ := area (projection u '' K)def A_min : ℝ := sInf {a : ℝ | ∃ u : Space, ‖u‖ = 1 ∧ a = shadowArea u}structure TriCylinder where  axis : Space  base : Set Space  unit_axis : ‖axis‖ = 1  perpendicular : ∀ z ∈ base, inner ℝ axis z = 0  triangular : ∃ v : Fin 3 → Space, AffineIndependent ℝ v ∧    base = convexHull ℝ (Set.range v)  compact : IsCompact base  convex : Convex ℝ base  measurable : MeasurableSet base  finite_area : Measure.euclideanHausdorffMeasure 2 base ≠ ⊤def TriCylinder.carrier (c : TriCylinder) : Set Space :=  {z | ∃ b ∈ c.base, ∃ r : ℝ, z = b + r • c.axis}def Covers {m : ℕ} (c : Fin m → TriCylinder) : Prop :=  ∀ z ∈ K, ∃ i : Fin m, z ∈ (c i).carrierdef totalArea {m : ℕ} (c : Fin m → TriCylinder) : ℝ :=  ∑ i : Fin m, area (c i).basedef relativeCost {m : ℕ} (c : Fin m → TriCylinder) : ℝ :=  ∑ i : Fin m, area (c i).base / shadowArea (c i).axisdef n (ε : ℝ) : ℕ := ⌈2 / ε ^ 2⌉₊def MainAsymptotic : Prop :=  ∃ δ C : ℝ, 0 < δ ∧ 0 < C ∧    ∀ ε : ℝ, 0 < ε → ε < δ →      ∃ c : Fin (2 * n ε) → TriCylinder,        Covers c ∧        |totalArea c / H - (1 / 2 - (13 / 6000 : ℝ) * ε ^ 2)| ≤ C * ε ^ 4 ∧        totalArea c < A_min / 2def NormalizedCounterexample : Prop :=  ∃ m : ℕ, ∃ c : Fin m → TriCylinder, Covers c ∧ relativeCost c < 1 / 2theorem main : A_min = H ∧ MainAsymptotic ∧ NormalizedCounterexample := by  sorryend TriangularCoveringendend 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.

Finite angular cylinder covers below the half-area bound

Theorem

The tetrahedron (eq:tetrahedron) has A_{\min}(K)=\sqrt2. For every 0<\eps\le1/2000, it admits a covering by m=2\lceil2/\eps^2\rceil cylinders with compact triangular perpendicular bases such that

\frac1{\sqrt2}\sum_{i=1}^m|B_i| =\frac12-\frac{13}{6000}\eps^2+O(\eps^4).

The remainder has absolute value at most 2\eps^4, and the total base area is strictly less than A_{\min}(K)/2.

Section 1, Introduction Read it in the paper TeX source, line 32
Show the TeX
The tetrahedron \eqref{eq:tetrahedron} has $A_{\min}(K)=\sqrt2$.
For every $0<\eps\le1/2000$, it admits a covering by
$m=2\lceil2/\eps^2\rceil$ cylinders with compact triangular perpendicular
bases such that
\begin{equation}
 \frac1{\sqrt2}\sum_{i=1}^m|B_i|
 =\frac12-\frac{13}{6000}\eps^2+O(\eps^4).
\end{equation}
The remainder has absolute value at most $2\eps^4$, and the total base
area is strictly less than $A_{\min}(K)/2$.
Corollary

Every nondegenerate tetrahedron T\subset\R^3 admits a finite cylinder covering with compact triangular perpendicular bases for which

\sum_{i=1}^m\frac{|B_i|}{|\pi_{u_i^\perp}T|}<\frac12.

Thus the 1-Codimensional Cylinder Covering Conjecture is false.

Section 1, Introduction Read it in the paper TeX source, line 50
Show the TeX
Every nondegenerate tetrahedron $T\subset\R^3$ admits a finite cylinder
covering with compact triangular perpendicular bases for which
\[
 \sum_{i=1}^m\frac{|B_i|}{|\pi_{u_i^\perp}T|}<\frac12.
\]
Thus the 1-Codimensional Cylinder Covering Conjecture is false.

Finite cylinder approximation of ruled sets

Proposition (Perpendicular base area)

Let h>0, let T\subset\R^2 be bounded and measurable, and let g\in\R^2. The image F_h(\Cyl(T,g)) is a cylinder whose perpendicular base has area h|T|J_h(g). A compact nondegenerate parallelogram tile has a compact nondegenerate parallelogram base. An open tile gives an open base. The formula is unchanged after a Euclidean isometry.

Section 1, The finite approximation problem Read it in the paper TeX source, line 50
Show the TeX
Let $h>0$, let $T\subset\R^2$ be bounded and measurable, and let
$g\in\R^2$. The image $F_h(\Cyl(T,g))$ is a cylinder whose perpendicular
base has area $h|T|J_h(g)$. A compact nondegenerate parallelogram tile
has a compact nondegenerate parallelogram base. An open tile gives an
open base. The formula is unchanged after a Euclidean isometry.
Theorem (Finite approximation by square tiles)

Let D\subset\R^2 be compact, let V be C^1 on an open neighborhood of D, and let L,h>0. Suppose that

\tr DV(p)=0,\qquad -L^{-2}<\det DV(p)\le0 \quad(p\in D).

For every \varepsilon>0, there are finitely many compact nondegenerate square tiles T_i\subset\R^2, with possibly different orientations, and velocities g_i\in\R^2 such that

E(D,V,L)\subset\bigcup_i\Cyl(T_i,g_i),\qquad \sum_i |T_i|J_h(g_i) \le\int_D J_h(V(p))\,dp+\varepsilon.

Under F_h, the perpendicular bases are compact nondegenerate parallelograms and have total area h\sum_i|T_i|J_h(g_i). No condition on the area of \partial D or smallness of \|DV\| is required.

Section 1, The finite approximation problem Read it in the paper TeX source, line 74
Show the TeX
Let $D\subset\R^2$ be compact, let $V$ be $C^1$ on an open
neighborhood of $D$, and let $L,h>0$. Suppose that
\begin{equation}
 \tr DV(p)=0,\qquad -L^{-2}<\det DV(p)\le0
 \quad(p\in D).
\end{equation}
For every $\varepsilon>0$, there are finitely many compact
nondegenerate square tiles $T_i\subset\R^2$, with possibly different
orientations, and velocities $g_i\in\R^2$ such that
\begin{equation}
 E(D,V,L)\subset\bigcup_i\Cyl(T_i,g_i),\qquad
 \sum_i |T_i|J_h(g_i)
 \le\int_D J_h(V(p))\,dp+\varepsilon.
\end{equation}
Under $F_h$, the perpendicular bases are compact nondegenerate
parallelograms and have total area $h\sum_i|T_i|J_h(g_i)$.
No condition on the area of $\partial D$ or smallness of $\|DV\|$
is required.

Slope-field perturbations of the two-cylinder covering

Theorem

Every regular tetrahedron K\subset\R^3 of positive edge length admits a finite cylinder cover with compact parallelogram perpendicular bases such that

\sum_i|B_i|<\tfrac12 A_{\min}(K), \qquad \sum_i\frac{|B_i|}{|\pi_{u_i^\perp}K|}<\tfrac12.

It also admits finite covers with bounded open measurable bases satisfying both inequalities.

Section 1, Introduction Read it in the paper TeX source, line 51
Show the TeX
Every regular tetrahedron $K\subset\R^3$ of positive edge length admits a finite
cylinder cover with compact parallelogram perpendicular bases such that
\[
 \sum_i|B_i|<\tfrac12 A_{\min}(K),
 \qquad
 \sum_i\frac{|B_i|}{|\pi_{u_i^\perp}K|}<\tfrac12.
\]
It also admits finite covers with bounded open measurable bases
satisfying both inequalities.
Corollary

Every nondegenerate tetrahedron T\subset\R^3 admits a finite cylinder cover \mathcal C with compact parallelogram perpendicular bases and \mathcal R(\mathcal C;T)<1/2. The same conclusion holds with bounded open measurable bases.

Section 1, Introduction Read it in the paper TeX source, line 67
Show the TeX
Every nondegenerate tetrahedron $T\subset\R^3$ admits a finite cylinder
cover $\mathcal C$ with compact parallelogram perpendicular bases and
$\mathcal R(\mathcal C;T)<1/2$. The same conclusion holds with bounded
open measurable bases.

Finite triangular approximation of radial sweeps

Theorem

For the data in (eq:radial-sweep), suppose that

w'(t)=\lambda(t)(a+tb)\qquad(t\in J)

for a continuous real function \lambda. For any finite partition \alpha=t_0<t_1<\cdots<t_N=\beta, put I_i=[t_{i-1},t_i] and choose arbitrary tags c_i\in I_i. There are N cylinders covering \mathcal S, with axes parallel to e+w(c_i) and nondegenerate compact triangular perpendicular bases. These covers can be chosen so that their total base area tends to \mathcal A as the mesh \delta=\max_i|I_i| tends to zero, uniformly over the partitions and tags.

Alternatively, take each base to be the perpendicular projection of the actual compact sweep with t\in I_i, in the same frozen direction e+w(c_i). These N cylinders cover \mathcal S, and their total base area also tends to \mathcal A, uniformly over the partitions and tags.

Section 1, Radial sweeps and finite cylinders Read it in the paper TeX source, line 64
Show the TeX
For the data in \eqref{eq:radial-sweep}, suppose that
\[
 w'(t)=\lambda(t)(a+tb)\qquad(t\in J)
\]
for a continuous real function $\lambda$.
For any finite partition
\(\alpha=t_0<t_1<\cdots<t_N=\beta\), put \(I_i=[t_{i-1},t_i]\)
and choose arbitrary tags \(c_i\in I_i\). There are \(N\) cylinders
covering \(\mathcal S\), with axes parallel to \(e+w(c_i)\) and
nondegenerate compact triangular perpendicular bases. These covers
can be chosen so that their total base area tends to \(\mathcal A\)
as the mesh \(\delta=\max_i|I_i|\) tends to zero, uniformly over the
partitions and tags.

Alternatively, take each base to be the perpendicular projection of
the actual compact sweep with \(t\in I_i\), in the same frozen
direction \(e+w(c_i)\). These \(N\) cylinders cover \(\mathcal S\),
and their total base area also tends to \(\mathcal A\), uniformly
over the partitions and tags.
Corollary

Every regular tetrahedron K\subset\R^3 of positive edge length has a finite cylinder cover B_i+\R u_i, with unit axes u_i and nondegenerate compact triangular bases B_i\subset u_i^\perp, such that

\sum_i\area(B_i)<\frac{A_{\min}(K)}2, \qquad \sum_i\frac{\area(B_i)}{\area(\pi_{u_i^\perp}K)}<\frac12.
Section 1, Radial sweeps and finite cylinders Read it in the paper TeX source, line 95
Show the TeX
Every regular tetrahedron $K\subset\R^3$ of positive edge length has
a finite cylinder cover $B_i+\R u_i$, with unit axes $u_i$ and
nondegenerate compact triangular bases $B_i\subset u_i^\perp$, such that
\[
 \sum_i\area(B_i)<\frac{A_{\min}(K)}2,
 \qquad
 \sum_i\frac{\area(B_i)}{\area(\pi_{u_i^\perp}K)}<\frac12.
\]
Configuration and file facts
OpenAI’s Lean catalogue
OpenAI’s Lean catalogue does not list this as a main result; the release’s Lean notes for family 100 link it.
Solution module
OAI.Geometry.TriangularCovering.Main
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
16 local vocabulary declarations
Lines of Lean, without comments or blank lines
40
Second proof-verification program (nanoda)
Off in OpenAI's configuration.

Statement comparison

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

Plectis Atlas

Explicit triangular-cylinder cover below half area

Family 100: Cylinder coverings below the half-area bound

Candidate pairing

Theorem

The tetrahedron (eq:tetrahedron) has A_{\min}(K)=\sqrt2. For every 0<\eps\le1/2000, it admits a covering by m=2\lceil2/\eps^2\rceil cylinders with compact triangular perpendicular bases such that

\frac1{\sqrt2}\sum_{i=1}^m|B_i| =\frac12-\frac{13}{6000}\eps^2+O(\eps^4).

The remainder has absolute value at most 2\eps^4, and the total base area is strictly less than A_{\min}(K)/2.

Finite angular cylinder covers below the half-area bound

TeX label thm:counterexample, build/sections/introduction.tex, line 32

The Lean statement says

theorem main : A_min = H ∧ MainAsymptotic ∧ NormalizedCounterexample := 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.

Atlas selected this possible match because the two statements share words. No review of whether they mean the same thing is recorded.three independent groups report that Comparator accepted runs for this file at the release version shown here.Statement review: none recorded

16 local vocabulary declarationsAllowed axioms: propext, Quot.sound, Classical.choiceopenai/math at fd4aeebwcook04.github.io/plectis-atlas/statements/TriangularCovering.html

Recorded comparisons with the paper

Atlas records no contributed comparison of this statement with the paper.

Contributed Comparator run reports

Atlas records no contributed report of running Comparator for this statement file.

Compare this statement with the paperShare a Comparator run reportSuggest a change