Four-Color Theorem Gets Its First New Proof Since 1976
Mathematicians published a new proof of the four-color theorem — that any map can be colored with just four colors so no adjacent regions share a color — the first fundamentally new proof since Kenneth Appel and Wolfgang Haken's 1976 computer-assisted version, long criticized for being unverifiable by hand.
- The 1976 proof required checking roughly 1,800 special cases by computer; the new approach reduces structural complexity substantially
- The result does not change the theorem but finally gives mathematicians a proof they can actually read
- Arrives the week after AI systems claimed proofs of Navier-Stokes and Fermat's Last Theorem — a remarkable week for formal mathematics