If p equals np then np is fixed
NOT A NOVELTY CLAIM. This is a machine-checked formalisation, checked by the Lean 4 kernel and depending on no axiom. It is dated and citable. Prior art, where it exists, is cited below. No discovery is claimed.
THE EASY DIRECTION, FOR EVERY PAIR OF CLASSES: if P is closed under complement (σ P = P) and P = NP, then NP is closed under complement, i.e. NP = coNP. Its contrapositive is NP ≠ coNP ⇒ P ≠ NP. Nothing here decides whether P = NP or NP = coNP.
Proposition
∀ P NP : Class, σ P = P → P = NP → σ NP = NPProof
By intro P NP hP hPNP; subst hPNP; exact hP in p-vs-np.lean. Checked by the Lean kernel.
- Debit
if_p_equals_np_then_np_is_fixed— this theorem- Credit
of_decide_eq_true:∀ {p : Prop} [inst : Decidable p], decide p = true → p— the kernel itself: the statement reduces to true by computation, and the rule that turns that reduction into a proof rests on no axiom
Sources and identifiers
- Lean source · src/4/p-vs-np.lean
- Typeset paper · src/research/lean-theorems.tex
- Repository deposit · doi:10.5281/zenodo.21787144
- Author · ORCID 0009-0000-7312-9778
- Deposit record ·
p-vs-np--if_p_equals_np_then_np_is_fixed