Plectis Atlas
Search

↑ and ↓ move, Enter opens, Esc closes.

Show on the map

The complete Crouzeix conjecture

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

Resolves the complete Crouzeix conjecture: for every bounded operator A on a complex Hilbert space and every finite matrix-valued polynomial P, one has \(\lVert P[A]\rVert\le2\sup_{z\in W(A)}\lVert P(z)\rVert\), where \(W(A)\) is the numerical range. The constant 2 is sharp, independent of the matrix size, and valid in infinite dimensions. (OpenAI’s Lean note)

Lean is a language for mathematical statements and proofs that a computer can verify. The assessments below ask whether those statements express the result OpenAI describes here.

Both independent assessments find that the Lean statements express or imply the whole result described above. Read the assessments

One problem has been reported by others; the atlas has not judged it.

What the papers state

The paper states

Theorem 1.1

In A direct proof of the complete Crouzeix inequality, 26 September 2026

Possible match to OpenAI’s description, selected from shared wording. No review confirming the selection is recorded.

For every pair of positive integers n,m, every A\in M_n(\C), every nonnegative integer d, and every polynomial P(z)=\sum_{k=0}^d B_kz^k with B_k\in M_m(\C),

\|P[A]\|\le2\max_{z\in W(A)}\|P(z)\|.

The constant two cannot be decreased uniformly over n,m, and d.

No Lean statement in the release is paired with this theorem.

The release does not say which paper theorem its catalogue describes. The statement above shares the most wording with the description; the atlas has not reviewed that choice. Identifying it is listed under Questions awaiting review.

Two more possible matches

  • Theorem 1.3 (A common positive representation) in The complete Crouzeix theorem, 23 September 2026.
  • Theorem 1.2 (The optimal metric) in The complete Crouzeix theorem, 23 September 2026.
Reported proof verification
Five Lean statements in the release; independent groups report that Comparator accepted runs for all these files at the version shown here.

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.

A direct proof of the complete Crouzeix inequality

26 September 2026, current edition.

Read it herePDF

We give a direct proof of the sharp constant-two numerical-range inequality for matrix-valued polynomials in all finite base and coefficient dimensions. This resolves the complete Crouzeix conjecture in its matrix formulation, including matrices whose numerical ranges are points or line segments.

The complete Crouzeix theorem: optimal similarity and a common positive boundary representation

23 September 2026, current edition.

Read it herePDF

We resolve the complete Crouzeix conjecture by proving the sharp constant-two numerical-range inequality for every bounded operator on a complex Hilbert space and every matrix-valued polynomial. No separability assumption is needed. The closure of the numerical range is a complete 2-spectral set, and the bound extends to finite matrix-valued functions holomorphic near that closure. For a finite matrix and a bounded convex domain containing its numerical range with regular real-analytic Jordan boundary, the optimal similarity making its conformal disk image contractive is attained with condition number at most two. For the similar matrix, one continuous positive boundary density of mass the identity represents the evaluation of every matrix-valued function holomorphic near the closed domain.

Five Lean statements in this family

Choose one to see it beside the paper theorem it is paired with.

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

DirectCrouzeix

The paper states

Theorem 3.2 (The bound on an analytic convex domain)

In A direct proof of the complete Crouzeix inequality, 26 September 2026

For positive integers n,m, let \Omega\subset\C be bounded, open, and convex with regular real-analytic Jordan boundary, and let A\in M_n(\C) satisfy W(A)\subset\Omega. For every M_m(\C)-valued polynomial F with \|F(z)\|\le1 on \partial\Omega, one has \|F[A]\|\le2.

The words they share: real, bound, valued, integers, polynomial, crouzeix, complete, positive.

Possible Lean counterpart

Selected from shared wording. No review of whether the statements mean the same thing is recorded.

Complete Crouzeix inequality and sharpness

DirectCrouzeix.lean, the release lists it as a main result.

theorem complete_crouzeix : UniversalBound 2 := by  sorry

This file states the theorem with sorry, a placeholder, in place of its proof. OpenAI supplies a separate proof file. Comparator tests whether that proof proves the statement here.

The file states one more theorem: uniform_sharpness.

three independent groups report that Comparator accepted runs for this Lean statement file: cert-machine; MathVet; Neal McBurnett, openai-math-lean-tooling. Who ran the proof-verification program

  • cert-machine records it as “CERTIFIED”.
  • MathVet records it as “comparator-sandboxed-pass”.
  • Neal McBurnett, openai-math-lean-tooling records it as “accepted”.

Read the complete Lean statement

CompleteCrouzeix

The paper states

Theorem 3.2 (The bound on an analytic convex domain)

In A direct proof of the complete Crouzeix inequality, 26 September 2026

For positive integers n,m, let \Omega\subset\C be bounded, open, and convex with regular real-analytic Jordan boundary, and let A\in M_n(\C) satisfy W(A)\subset\Omega. For every M_m(\C)-valued polynomial F with \|F(z)\|\le1 on \partial\Omega, one has \|F[A]\|\le2.

The words they share: real, bound, valued, integers, polynomial, positive.

Possible Lean counterpart

Selected from shared wording. No review of whether the statements mean the same thing is recorded.

Complete polynomial inequality and sharpness

CompleteCrouzeix.lean, the release lists it as a main result.

theorem main : UniversalBound 2 ∧ ∀ C : ℝ, UniversalBound C → 2 ≤ C := by  sorry

This file states the theorem with sorry, a placeholder, in place of its proof. OpenAI supplies a separate proof file. Comparator tests whether that proof proves the statement here.

three independent groups report that Comparator accepted runs for this Lean statement file: cert-machine; MathVet; Neal McBurnett, openai-math-lean-tooling. Who ran the proof-verification program

  • cert-machine records it as “CERTIFIED”.
  • MathVet records it as “comparator-sandboxed-pass”.
  • Neal McBurnett, openai-math-lean-tooling records it as “accepted”.

Read the complete Lean statement

CrouzeixHilbert

The paper states

No paper theorem is paired with this Lean statement.

no paper statement matches the Lean text clearly enough to pair, so the closest candidates are listed below.

Statements it shares words with:

  • Corollary 6.3 (The sharp complete inequality for bounded operators) in The complete Crouzeix theorem, 23 September 2026.
  • Proposition 3.3 (The local projection theorem) in The complete Crouzeix theorem, 23 September 2026.
  • Theorem 2.1 (Exterior Faber coefficients and the positive kernel) in A direct proof of the complete Crouzeix inequality, 26 September 2026.
  • Corollary 6.1 (The sharp complete polynomial inequality for matrices) in The complete Crouzeix theorem, 23 September 2026.
  • Theorem 1.1 in A direct proof of the complete Crouzeix inequality, 26 September 2026.
  • Theorem 3.2 (The bound on an analytic convex domain) in A direct proof of the complete Crouzeix inequality, 26 September 2026.
  • Proposition 2.2 (The coefficient norm estimate) in A direct proof of the complete Crouzeix inequality, 26 September 2026.
  • Theorem 3.1 (The resolvent expansion and double-layer positivity) in A direct proof of the complete Crouzeix inequality, 26 September 2026.

The Lean statement

No paper theorem is paired with it.

Complete sharp Crouzeix theorem on arbitrary Hilbert spaces

CrouzeixHilbert.lean, the release lists it as a supporting statement.

theorem hilbert (H : Type u) [NormedAddCommGroup H] [InnerProductSpace ℂ H]    [CompleteSpace H] (A : Operator H) :    (Nontrivial H → NonzeroConclusion A) ∧    (Subsingleton H → ZeroConclusion A) ∧ SharpConstant := by  sorry

This file states the theorem with sorry, a placeholder, in place of its proof. OpenAI supplies a separate proof file. Comparator tests whether that proof proves the statement here.

two independent groups report that Comparator accepted runs for this Lean statement file: cert-machine; MathVet. Who ran the proof-verification program

  • cert-machine records it as “CERTIFIED”.
  • MathVet records it as “comparator-sandboxed-pass”.

Read the complete Lean statement

HilbertCrouzeix

The paper states

Corollary 6.3 (The sharp complete inequality for bounded operators)

In The complete Crouzeix theorem: optimal similarity and a common positive boundary representation, 23 September 2026

Let \mathcal H be a complex Hilbert space, with no separability assumption, and let A\in\mathcal B(\mathcal H). Suppose first that \mathcal H\ne\{0\}, and put

W(A)=\{\langle x,Ax\rangle:x\in\mathcal H,\ \|x\|=1\}, \qquad K=\overline{W(A)}.

Then K is compact and convex and contains \spec(A). For every positive integer m, every nonnegative integer d, and every matrix polynomial P(z)=\sum_{k=0}^d B_kz^k with B_k\in M_m(\C), the operator P[A]=\sum_{k=0}^d A^k\otimes B_k on \mathcal H\otimes\C^m satisfies

\|P[A]\|\le 2\sup_{z\in W(A)}\|P(z)\| =2\max_{z\in K}\|P(z)\|.

More generally, if U is an open neighborhood of K and F=(f_{ij}):U\to M_m(\C) is holomorphic, its entrywise holomorphic evaluation, in the same base-first tensor convention, satisfies

F[A]:=\sum_{i,j=1}^m f_{ij}(A)\otimes E_{ij}, \qquad \|F[A]\|\le2\max_{z\in K}\|F(z)\|.

Here E_{ij} are the standard matrix units and f_{ij}(A) is given by the holomorphic functional calculus. In particular, K is a complete 2-spectral set for A: the same estimate holds at every finite coefficient size for every matrix-valued rational function whose poles lie outside K, with evaluation by the rational functional calculus. The constant two is optimal uniformly over all these choices.

If \mathcal H=\{0\}, every evaluation is the zero operator. With the supremum over the empty numerical range defined to be zero, the corresponding supremum-norm inequalities are 0\le0; the compact spectral-set assertion above is stated for nonzero \mathcal H.

The words they share: tensor, range, calculus, zero, numerical, units, complex, rational, space, compact, norm, convex, function, finite, matrix, holomorphic, integer, polynomial.

Possible Lean counterpart

Selected from shared wording. No review of whether the statements mean the same thing is recorded.

Numerical-range geometry and finite-compression support

HilbertCrouzeix.lean, the release lists it as a supporting statement.

theorem numericalClosure_geometry (A : H →L[ℂ] H) :    IsCompact (numericalClosure A) ∧ Convex ℝ (numericalClosure A) ∧      spectrum ℂ A ⊆ numericalClosure A := by  sorry

This file states the theorem with sorry, a placeholder, in place of its proof. OpenAI supplies a separate proof file. Comparator tests whether that proof proves the statement here.

The file states three more theorems: exists_finite_compression, rational_denominator_isUnit, zeroConclusion.

three independent groups report that Comparator accepted runs for this Lean statement file: cert-machine; MathVet; Neal McBurnett, openai-math-lean-tooling. Who ran the proof-verification program

  • cert-machine records it as “CERTIFIED”.
  • MathVet records it as “comparator-sandboxed-pass”.
  • Neal McBurnett, openai-math-lean-tooling records it as “accepted”.

Read the complete Lean statement

StructuralCrouzeix

The paper states

It is paired with Theorem 1.2 and Theorem 1.3, each shown below.

Theorem 1.2 (The optimal metric)

In The complete Crouzeix theorem: optimal similarity and a common positive boundary representation, 23 September 2026

For every admissible \Omega, every finite n\ge1, every A\in M_n(\C) with W(A)\subset\Omega, and the interior conformal coordinate f above, the problem (1.1) is strictly feasible and has an attained minimum 1\le\kappa^2\le4. If H is a minimizing metric, then

S=H^{1/2},\qquad A'=SAS^{-1},\qquad D=Sf(A)S^{-1}=f(A')

satisfy

D^*D\preceq I,\qquad \rho(D)<1, \qquad \|S\|\|S^{-1}\|=\kappa\le2.

Theorem 1.3 (A common positive representation)

In The complete Crouzeix theorem: optimal similarity and a common positive boundary representation, 23 September 2026

With the same \Omega,A,f,G and any chosen minimizing metric in Theorem 1.2, there is one continuous function \Lambda:\T\to M_n(\C) satisfying

\Lambda(t)\succeq0,\qquad \int_\T\Lambda(t)\,d\sigma(t)=I_n,

such that, for every positive integer m and every M_m(\C)-valued function v holomorphic on a neighborhood of \overline\Omega,

v[A']=\int_\T\Lambda(t)\otimes v(G(t))\,d\sigma(t), \qquad \|v[A]\|\le\kappa\max_{\overline\Omega}\|v\|.

The same S, \Lambda, and \kappa work for all m and v.

The words it shares with Theorem 1.2: strictly, coordinate, feasible, interior, admissible, eq, minimizing, metric, attained, optimal, finite; with Theorem 1.3: structural, representation, minimizing, metric, max, integer, continuous, valued, one, positive.

Possible Lean counterpart

Selected from shared wording. No review of whether the statements mean the same thing is recorded.

Optimal similarity and boundary representation

StructuralCrouzeix.lean, the release lists it as a main result.

theorem challenge : StructuralCrouzeix.FullEndpoint ∧    StructuralCrouzeix.IsAdmissible (Metric.ball (0 : ℂ) 1) := by  sorry

This file states the theorem with sorry, a placeholder, in place of its proof. OpenAI supplies a separate proof file. Comparator tests whether that proof proves the statement here.

two independent groups report that Comparator accepted runs for this Lean statement file: cert-machine; MathVet. Who ran the proof-verification program

  • cert-machine records it as “CERTIFIED”.
  • MathVet records it as “comparator-sandboxed-pass”.

Read the complete Lean statement

Other mathematical statements in OpenAI’s Lean library

Atlas found these propositions by scanning the text of the project’s Model.lean file. Each name links to its definition, with any associated statement file beside it. This list does not record running Lean to interpret or verify those definitions.

Independent comparisons and proof-verification reports

Does the Lean express the advertised result?

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

MathVet and Carlos Toledo’s cert-machine independently assessed whether this family’s Lean statements express the whole result OpenAI describes in its catalogue. These are assessments of the family as a whole, not of each paper theorem separately.

MathVet finds that the Lean statements express or imply the whole advertised result (their term: “full”).

Their note: CrouzeixHilbert.hilbert states, for every complete complex inner-product space H (any dimension, no separability) and bounded A, ‖Σ_k A^k ⊗ B_k‖ ≤ 2·sup_{W(A)} ‖Σ z^k B_k‖ for all m > 0, degrees d and complex m×m coefficients (numerical range {⟨x,Ax⟩ : ‖x‖ = 1}, amplification = completed H ⊗ ℂ^m), plus an explicit SharpConstant witness (A on ℂ², scalar degree-1 polynomial, sup = 1 and ‖P[A]‖ = 2); CompleteCrouzeix/DirectCrouzeix give the matrix case with UniversalBound 2 ∧ ∀ C, UniversalBound C → 2 ≤ C. HilbertCrouzeix (compactness/convexity of the closed numerical range, finite compressions, trivial space) is supporting-only and StructuralCrouzeix (optimal similarity and boundary density for regular analytic convex Jordan domains) is an extra finite-dimensional result.

Definitions the group asks readers to compare with the paper: HilbertCrouzeix: def chosenContour (K U : Set ℂ) : ℝ → ℂ := Classical.epsilon (IsCauchyContour K U) feeds holomorphicCalculus, but the only theorem using it (zeroConclusion) is for a subsingleton H, where every operator is 0, so the choice cannot matter; CrouzeixHilbert: holomorphicEval A U f := if h : Nonempty (CalculusContour (numericalClosure A) U) then contourEval A (Classical.choice h).toSmoothContour f else 0; harmless because NonzeroConclusion itself asserts the contour exists and that the value equals contourEval A Γ for every contour Γ; supNorm S F := sSup (insert 0 ((fun z => ‖F z‖) '' S)) (the insert 0 only handles the empty numerical range of the zero space)

“full”, in their words: The challenge statements imply the headline claim after unpacking definitions or one routine step.

Their method: 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.

cert-machine finds that the Lean statements express or imply the whole advertised result (their term: “MATCHES”).

“MATCHES”, in their words: The challenge statements state the headline as OpenAI wrote it.

Their method: Every Comparator challenge re-run on Linux with nanoda switched on, decided by a preregistered rule.

OpenAI’s own note on what its Lean covers

The complete Crouzeix inequality bounds a matrix-valued polynomial evaluated at a matrix by its maximum norm on the numerical range. The formalized result proves the bound with constant $2$ for every positive matrix and coefficient size, every polynomial degree, and arbitrary complex coefficients. It also proves that no smaller universal constant works. Normality of the matrix and nonempty interior of its numerical range are not assumed.

The formalization proves the complete Crouzeix inequality with sharp constant two for every bounded operator on an arbitrary complex Hilbert space. For every matrix-valued polynomial, its operator evaluation has norm at most twice its supremum norm on the numerical range. The same bound holds for finite matrix-valued functions holomorphic near the closure of the numerical range and for rational functions with poles outside that closure. No separability assumption is required. For finite matrices in a bounded convex domain with regular real-analytic Jordan boundary, the structural result gives an attained optimal similarity with condition number at most two and one continuous positive boundary density of mass the identity representing every matrix-valued analytic test. The linked supporting statements include numerical-range geometry and finite-compression identities.

AI-drafted comparisons, with no recorded human review

  • Complete Crouzeix inequality and sharpness DirectCrouzeix

    Unreviewed AI draft: states a paper’s theorem as the paper does. States the main theorem of the direct-proof paper: the complete Crouzeix inequality with constant 2 for matrix-valued polynomials of every size, with sharpness of the constant.

  • Complete polynomial inequality and sharpness CompleteCrouzeix

    Unreviewed AI draft: states a paper’s theorem as the paper does. States the same complete Crouzeix inequality with constant 2 and its optimality as DirectCrouzeix, in a separately written statement; it is also the polynomial corollary of the structural paper.

  • Complete sharp Crouzeix theorem on arbitrary Hilbert spaces CrouzeixHilbert

    Unreviewed AI draft: states a paper’s theorem as the paper does. States the complete Crouzeix inequality with sharp constant 2 for every bounded operator on every complex Hilbert space, the structural paper’s Hilbert-space corollary; it contains the direct paper’s matrix theorem.

  • Numerical-range geometry and finite-compression support HilbertCrouzeix

    Unreviewed AI draft: states a supporting result. States supporting numerical-range geometry and finite-compression statements used for the Hilbert-space theorem.

  • Optimal similarity and boundary representation StructuralCrouzeix

    Unreviewed AI draft: states a paper’s theorem as the paper does. States the structural paper’s main theorems: an attained optimal similarity with condition number at most two and a common positive boundary representation, for admissible domains.

Who ran the proof-verification program?

These groups report running Comparator with the release’s Lean statement files. For a configured theorem, it verifies OpenAI’s separate proof against the exact statement; some files instead configure definitions for comparison by name and type. Each row is the named group’s report. Atlas has not repeated the runs.

These reports do not list the software versions, proof-verification programs, axioms, time or memory in separate fields. Any such details in a report’s prose are reproduced below.

Complete Crouzeix inequality and sharpness DirectCrouzeix

Three reports, all at the release’s recorded version.

Reported byTheir wordTheir accountDateOriginal report
cert-machine“CERTIFIED”Re-run through Comparator with the independent nanoda kernel switched on: Lean’s kernel and nanoda both accept OpenAI’s solution.10 October 2026Original report
MathVet“comparator-sandboxed-pass”Re-run through Comparator in a sandboxed virtual machine: accepted.8 October 2026Original report
Neal McBurnett, openai-math-lean-tooling“accepted”Re-run through Comparator with Lean’s kernel: accepted (the check took 213 s; peak memory 6.5 GiB).11 October 2026Original report

Complete polynomial inequality and sharpness CompleteCrouzeix

Three reports, all at the release’s recorded version.

Reported byTheir wordTheir accountDateOriginal report
cert-machine“CERTIFIED”Re-run through Comparator with the independent nanoda kernel switched on: Lean’s kernel and nanoda both accept OpenAI’s solution.10 October 2026Original report
MathVet“comparator-sandboxed-pass”Re-run through Comparator in a sandboxed virtual machine: accepted.8 October 2026Original report
Neal McBurnett, openai-math-lean-tooling“accepted”Re-run through Comparator with Lean’s kernel: accepted (the check took 433 s; peak memory 6.6 GiB).11 October 2026Original report

Complete sharp Crouzeix theorem on arbitrary Hilbert spaces CrouzeixHilbert

Two reports, all at the release’s recorded version.

Reported byTheir wordTheir accountDateOriginal report
cert-machine“CERTIFIED”Re-run through Comparator with the independent nanoda kernel switched on: Lean’s kernel and nanoda both accept OpenAI’s solution.10 October 2026Original report
MathVet“comparator-sandboxed-pass”Re-run through Comparator in a sandboxed virtual machine: accepted.8 October 2026Original report

Numerical-range geometry and finite-compression support HilbertCrouzeix

Three reports, all at the release’s recorded version.

Reported byTheir wordTheir accountDateOriginal report
cert-machine“CERTIFIED”Re-run through Comparator with the independent nanoda kernel switched on: Lean’s kernel and nanoda both accept OpenAI’s solution.10 October 2026Original report
MathVet“comparator-sandboxed-pass”Re-run through Comparator in a sandboxed virtual machine: accepted.8 October 2026Original report
Neal McBurnett, openai-math-lean-tooling“accepted”Re-run through Comparator with Lean’s kernel: accepted (the check took 151 s; peak memory 6.3 GiB).10 October 2026Original report

Optimal similarity and boundary representation StructuralCrouzeix

Two reports, all at the release’s recorded version.

Reported byTheir wordTheir accountDateOriginal report
cert-machine“CERTIFIED”Re-run through Comparator with the independent nanoda kernel switched on: Lean’s kernel and nanoda both accept OpenAI’s solution.10 October 2026Original report
MathVet“comparator-sandboxed-pass”Re-run through Comparator in a sandboxed virtual machine: accepted.8 October 2026Original report

Other reports of proof verification

Other people’s accounts of running proof-verification software, with links to their reports.

  • Beltran12138, oai-math-recheck: re-check one result family from openai/math yourself (worked example: family 325, Crouzeix), 8 October 2026. Source

    DirectCrouzeix: 42/42 modules built; complete_crouzeix and uniform_sharpness depend only on propext, Classical.choice, Quot.sound; statement equal to the challenge by definitional unfolding, with a failing negative control at the wrong constant.

  • Beltran12138, oai-math-recheck: re-check one result family from openai/math yourself (worked example: family 325, Crouzeix), 8 October 2026. Source

    CrouzeixHilbert (90 files), CompleteCrouzeix (48 files, cross-checked against DirectCrouzeix), StructuralCrouzeix and the support file HilbertCrouzeix all rebuilt with passing gates.

Other proofs and exact calculations

These reports examine claims in the papers using HOL Light, a different proof assistant, independently of the release’s Lean proofs. Read each report for the exact claim it covers.

  • x² + y² = 1 ⇒ |2xy| ≤ 1 (real form of the sharpness case)

    HOL Light card 325

    Reported by
    Ben Knill, openai-math-hol-cards
    Method
    Proof of a selected step in HOL Light
    Their verdict
    “PASS” The report records a proof of a supporting fact.
    What it covers
    Cross-check of a Lean-covered result; on-screen value
    Original report
    Their report

Problems reported by others

Reports of errors and corrections from outside readers, as they state them. The atlas has not judged them.

  • Beltran12138, [Correction] JSP-000042 (Crouzeix): earlier human proofs of the scalar statement; independent Lean verification evidence (issue 4871), 8 October 2026. Source

    Requests that the catalogue’s attribution for the scalar Crouzeix problem name the earlier human proofs, which OpenAI’s own bibliography cites.

Explanations by others

Explanations of this family written elsewhere, by the people named. Each is their own reading of the mathematics.

  • Beltran12138, oai-math-recheck: re-check one result family from openai/math yourself (worked example: family 325, Crouzeix), 8 October 2026. Source

    Scalar Crouzeix was claimed by humans in Aug 2026 (arXiv:2608.03841); OpenAI’s contribution is the complete matrix-coefficient form.

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.

Within this family

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.

Follow-up work by others

  • The Justin Sun Prize, The Justin Sun Prize: problem bank and award records, 11 October 2026. Source

    JSP-000042 lists the release’s claim as Solved with independent mathematical review pending; Lean proof column: reported complete, independent verification pending.

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 explanationCompare one Lean statement with its paper: DirectCrouzeix, CompleteCrouzeix, StructuralCrouzeix, CrouzeixHilbert, HilbertCrouzeixSuggest 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 “Career-defining publication”. The page says that nothing on it is verified.

    Author not stated. Source

  • ajt60gaibb, ajt60gaibb/OpenProblemsInNLA: catalogue of numerical linear algebra open problems with reviews of claimed solutions, 8 October 2026. Source

    Catalogue marked the matrix-coefficient Crouzeix inequality solved on 8 Oct after two AI-agent audits; Lean status left unverified.

  • JohnDriscollAcademic, Significant Number of OpenAI Results Appearing to Resolve AIM Problems (issue 36), 7 October 2026. Source

    AIM problem 023 (complete Crouzeix) corresponds to family 325.

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.

Read the Lean statement against the paper

  • An AI agent drafted an assessment of which part of the paper this Lean statement expresses. No named human review is recorded. Open the form
  • An AI agent drafted an assessment of which part of the paper this Lean statement expresses. No named human review is recorded. Open the form
  • An AI agent drafted an assessment of which part of the paper this Lean statement expresses. No named human review is recorded. Open the form
  • An AI agent drafted an assessment of which part of the paper this Lean statement expresses. No named human review is recorded. Open the form
  • An AI agent drafted an assessment of which part of the paper this Lean statement expresses. No named human review is recorded. Open the form

Identify the theorem the catalogue describes

  • Family 325 No single paper statement clearly matches OpenAI’s description by wording, and no review identifying the intended theorem is recorded. Open the form

Address a question raised in an independent assessment

Compare the proposed paper and Lean matches

  • Family 325 Atlas records no review of whether each linked Lean statement and paper theorem mean the same thing. Open the form