An Improved Lower Bound for the Complex Grothendieck Constant

Shengtao Guo, Ethan X. Fang, Junwei Lu

Guo, Fang and Lu prove the strict bound K_G^C>1.35584631827168 using a Gaussian Hermite multiplier, exact rational parameters and a weighted operator-norm criterion.

Sources for this record

What was already known

Davie’s earlier lower bound was about 1.33807. A later independent paper obtained the stronger bound 1.4.

AI involvement AI-led

The authors credit the Odin Automatic AI Research Agent with the lower bound and proof. They wrote the exposition and released certificate code.

The authors explicitly credit Odin with the central result and proof; exact autonomy from human direction is undocumented.

Importance Notable

Introduces a certified method that improved the lower bound when published.

Limitations

Interval arithmetic checks finite Gram, Schur and ratio inequalities; a completed check of the full analytic reduction is not documented. The later 1.4 result supersedes this numerical record without checking this proof.

Technical verification Partial

The numerical certificate components have rigorous source-reported interval checks, but no explicit complete human or formal check of the analytic reduction is documented.

Independent checking

The numerical certificate components have rigorous source-reported interval checks, but no explicit complete human or formal check of the analytic reduction is documented.

Checker
Authors’ interval-arithmetic verifier
Scope
finite parameter positivity and ratio establishing the 1.35584631827168 lower bound conditional on the analytic criterion
Basis
Reported by the linked checker
Evidence source

Human understanding Full

The authors’ exposition explains the Hermite multiplier, shared radial weight, operator norm reduction and finite certificate.

Correction and publication history