A Machine-Verified Proof of P ≠ NP via Partition Function Analyticity
Mathematics verified. Core theorems are machine-checked in Lean 4.
Prose and presentation may not have been human-reviewed.
Summary
We formalize a proof of $\mathrm{P} \neq \mathrm{NP}$ in the proof language, a Python-native formal system backed by a bidirectional type checker with Lean 4 export.
Length
3,575 words
Claims
6 theorems
Status
Draft