What was already known
Earlier classification and regularity work left a noncompact disconnected crack with connected complement. The interior conjecture dates to 1989.
AI involvement
Deangelis credits ChatGPT Astra with the initial strategy and draft after detailed human prompts and supplied background. He revised and simplified the proof.
The author specifically attributes the initial central proof strategy and manuscript to ChatGPT Astra, while documenting his own prior work, supplied context and later revisions.
Importance
Would close the remaining global-minimizer case and establish the planar interior regularity conjecture.
Limitations
The new step rules out bounded crack components using relaxed translations and a Hodge identity. Boundary regularity is outside the claim. The October 5 revision does not document a completed proof check.
Technical verification
The first version explicitly says checking was ongoing, and the revised paper documents responsibility and revision without a completed rigorous check of the final theorem. Reported is the evidence default.
Human understanding
Deangelis's revised paper explains the compact translation, optimized second variations, Hodge equality and classification reduction; it documents human command of the central mechanism, independently of proof verification.
Correction and publication history
Would close the remaining global-minimizer case and establish the planar interior regularity conjecture.
Read this published revision