Lax Lean Archive

Draft — mutable and not usable as a dependency; its citation marks the draft state.

Lax554803.ComplementClosure

P is closed under complement

concepts/Lax554803/ComplementClosure.lean · lax-554803

proven

Loading review…

Community review

Flags

Each flag is tied to a public ORCID identity and explains why this concept may be incorrect.

No flags have been submitted.

    Community review

    Flag this concept

    State precisely what appears incorrect. This explanation will be public under your ORCID name.

    No source line selected.

    Concept map

    Proven claimDefinitionThis conceptRelated conceptA → B: B builds on A

    Evidence

    Each proof establishes this claim relative to its assumptions.

    Theorem

    If a language of binary strings belongs to P\mathrm{P}, then its complement also belongs to P\mathrm{P}. The complement is taken in the set of all finite binary strings.

    Lean source view on GitHub

    1import Lax554803.PolynomialTime
    2
    3/-!
    4---
    5title: P is closed under complement
    6type: theorem
    7---
    8If a language of binary strings belongs to P\mathrm{P}, then its complement
    9also belongs to P\mathrm{P}. The complement is taken in the set of all finite
    10binary strings.
    11-/
    12
    13namespace Lax554803.ComplementClosure
    14
    15open Lax554803.PolynomialTime
    16
    17/-- The complement of a polynomial-time decidable language is polynomial-time decidable. -/
    18axiom closed_under_complement (L : Language) : L ∈ P → Lᶜ ∈ P
    19
    20end Lax554803.ComplementClosure
    21
    Show Proof

    Builds on

    Used by

    none

    From Mathlib

    none

    Community review

    Discussion

    Ask a question or add context. Endorsements and structured flags are kept in the review panel above; your ORCID profile must share a public name.

    0 comments

    Loading discussion…