VibeMathedMath problems solved with AI

The Quartic Hessian Conjecture in Dimension Four

The Hessian conjecture HCnHC_n asks whether every polynomial ff with detHess(f)C×\det \mathrm{Hess}(f) \in \mathbb{C}^\times has a polynomial gradient inverse. It is known for n3n \le 3, false for n5n \ge 5, and open exactly in dimension four, where it implies the plane Jacobian conjecture. Proved for every quartic polynomial in dimension four: the quartic case reduces to f=P(x1,x2,x3)+x4Q(x1,x2,x3)+ax42f = P(x_1,x_2,x_3) + x_4 Q(x_1,x_2,x_3) + a x_4^2 with degQ2\deg Q \le 2, and every constant-Hessian polynomial of this form has a polynomial gradient inverse.

Result
Proved
Status
Partial result
AI contribution
AI-assisted
Method
Argument
Field
Polynomial automorphisms
Posed by
The Hessian conjecture (de Bondt, van den Essen line)
Year posed
Years open
Solved
2026-08-14
Model
GPT-5.6 Sol, GPT-5.6 Luna, Claude Fable 5, DeepSeek V4 Pro
Vendor
OpenAI, Anthropic, DeepSeek
Collaborators
Zixiang Ni
Verification
Unreviewed
Publication
Preprint
Significance
15 / 100
Disclosed cost
Wikipedia
No dedicated article

What the AI did

The acknowledgement credits four systems - GPT-5.6 Sol, GPT-5.6 Luna, Claude Fable 5 and DeepSeek V4 Pro - with exploring candidate arguments, adversarial proof review, algebraic checking and editorial assistance, with the author independently reviewing all arguments. No individual step is attributed, so the lower tier applies.

Verification

Checked by this site on 17 August 2026 against the paper's LaTeX (arXiv:2608.14217): the acknowledgement is verbatim as quoted, and the introduction's status summary (known for n <= 3 by Dillen and de Bondt, false for n >= 5, open for n = 4, HC_4 implies the plane Jacobian conjecture) matches the literature, including the n >= 5 counterexample recorded as this catalog's sibling entry. Sole-author preprint, days old, not checked here, no independent review.

Source

Related entries

Changelog1 change
  • Rasmus Lindahladded this entry

Discussion