Open problem. Nothing on this page solves it; each theorem below is a kernel-checked statement about a symmetry the problem is posed across.
P vs NP — P = NP ? — is every problem whose solution is verifiable in polynomial time also solvable in polynomial time, where P = ⋃ₖ TIME(nᵏ) and NP = ⋃ₖ NTIME(nᵏ). Conjectured: P ≠ NP. (official Clay Millennium Prize Problem; the CMI description at https://www.claymath.org/millennium-problems/ remains authoritative).
12 theorems, every one checked by the Lean 4 kernel — 1 rest on no axiom at all, and none on more than propext and Quot.sound. Each is a formalisation of a stated result, dated and citable. None is a novelty claim.