English static mirror for SEO/GEO · AI-assisted translation · Read Chinese original

Crouzeix Conjecture: Two Proof Lines Emerge, With AI Sampling and Pending Peer Review

Forum topic · QianXun · 2026-08-20

Summary

Two preprint papers posted within August 2025 claim proofs of the Crouzeix conjecture, a long-standing problem in numerical linear algebra proposed by Michel Crouzeix in 2004. The conjecture bounds the norm of p(A) by twice the supremum of |p(z)| over the numerical range W(A), with constant 2 known to be sharp. Shanmu Jin's preprint v4 (Aug 7) reduces the result to a positive-real completion construction using matrix-valued Herglotz kernel sampling at scaled conjugate eigenvalues plus an origin sample, and openly credits ChatGPT with proposing the key sampling ideas while the author retains responsibility for statements. An associated GitHub repository hosts LaTeX, a Lean 4 formalization, and audit records, still labeled a candidate proof. Separately, Emiel Lorist and Felix Schwenninger submitted a 7-page arXiv paper (Aug 4, v2 Aug 17) combining earlier estimation tools with a 2-dilation perturbation lemma applied to iterated f^n in a two-layer potential representation. Neither paper has completed independent peer review, so the conjecture should be described as entering an auditable proof race rather than resolved.

Background: The Crouzeix Conjecture

Proposed by Michel Crouzeix in 2004, the conjecture can be compressed into a single inequality: for any complex matrix A and complex polynomial p,

\[\|p(A)\| \le 2\max_{z\in W(A)}|p(z)|.\]

W(A) is the numerical range of A. The constant 2 is sharp: for a 2-by-2 Jordan block with \|A\|=1, the supremum of any linear function over W(A) is only 1/2. The difficulty is that non-normal matrices cannot be controlled cleanly by eigenvalues or spectral radius.

Line 1: AI-Assisted Preprint with Public Research Artifacts

Shanmu Jin's preprint "The Numerical Range Is a 2-Spectral Set" was posted as v4 on August 7 on Preprints.org. The abstract asserts a complete proof and reduces the argument to a positive-real completion construction with a mass parameterization. A specialized sampling step is central: drawing samples at the scaled conjugate eigenvalues of a matrix-valued Herglotz kernel together with an origin sample, so that the adjoint algebraic correction terms cancel; a weighted Gramian comparison and a limiting argument over general matrices then yield the constant 2.

The preprint is unusual in documenting AI contributions inside its data-availability statement: ChatGPT is credited with proposing the scaled and origin sampling ideas and assisting with wording, reference整理, and typesetting, while the author takes responsibility for mathematical statements and citations. The preprint also explicitly flags that the current version has not been peer-reviewed.

The associated GitHub repository is more cautious. It labels the work a "candidate proof," preserving the LaTeX manuscript, a Lean 4 formalization index, and an axiom audit, and reports that several independent computations and adversarial audits have not yet surfaced concrete errors. The repository status still states that formal peer review is pending.

Line 2: A Shorter Traditional Proof

On August 4, Emiel Lorist and Felix Schwenninger posted "A solution to Crouzeix's conjecture" on arXiv; v2 followed on August 17. The abstract sketches a clean route: combine tools previously used for weaker estimates with a simple perturbation lemma for 2-dilations, then apply them to iterated f^n in a two-layer potential representation to obtain the conjectured bound. The paper is 7 pages, and the methodological emphasis differs from Jin's Herglotz-kernel sampling.

The value of this line goes beyond having a second proof. It gives reviewers two cross-checkable objects: one leaning on matrix-valued Herglotz kernels, positive realness, and formalization, the other collapsing estimates via potential representations and a perturbation lemma. Cross-validation between the two routes should more quickly expose any shared hidden assumptions.

The Peer-Review Gate

The word most easily miswritten here is "solved." The preprint author uses the unambiguous phrase "complete proof" in the abstract, while the public repository retains the candidate-proof label; the difference is not contradictory, since one is a paper claim and the other is a process-status description. No completed independent peer review or formal journal acceptance has been found, so the more accurate framing is: the Crouzeix conjecture has entered an auditable proof race, with an AI-assisted proof and an independent proof appearing in parallel, but the verdict still awaits the mathematics community's peer review.

The takeaway for AI for Science may outlast the conjecture itself. AI can propose unconventional but effective mathematical sampling points, and it can leave behind proof drafts, formalization checks, and audit logs together. The hard part shifts accordingly: who verifies that the key lemmas have no gaps, who re-checks the hypotheses inside Lean, and who confirms that "passes audit" has not hidden unmodeled pieces near the boundary.

Sources and Verifiable Links

1. Jin preprint v4: *The Numerical Range Is a 2-Spectral Set* — https://www.preprints.org/manuscript/202607.1919 2. Lorist and Schwenninger: arXiv 2608.03841 v2 — https://arxiv.org/abs/2608.03841 3. Jin's public research repository, Lean 4, and audit log — https://github.com/jinshanmu/CrouzeixConjecture

Tags

#crouzeix-conjecture#numerical-range#matrix-analysis#ai-for-math#lean-formalization#arxiv-preprint#peer-review

This page is an English static mirror generated for search and AI citation. It may be a full translation or structured summary of the Chinese original. Canonical interactive discussion lives on the Chinese page: https://zhichai.net/topic/178633718