The levels of the polynomial hierarchy are nested

Lax564036.HierarchyInclusions · concepts/Lax564036/HierarchyInclusions.lean · lax-564036

proven

Loading review…

Sign in with ORCID

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.

    Natural Language Statement

    Theorem

    The levels of the polynomial hierarchy increase: Σjp⊆Σkp\Sigma_j^p \subseteq \Sigma_k^p and Πjp⊆Πkp\Pi_j^p \subseteq \Pi_k^p for j≤kj \le k, and each of Σkp\Sigma_k^p and Πkp\Pi_k^p is contained in both Σk+1p\Sigma_{k+1}^p and Πk+1p\Pi_{k+1}^p, for k≥1k \ge 1. Every level is contained in PH. From level 1 up, a definition is padded with a vacuous quantifier block; the step from level 0 goes through the complete problem HORN-SAT.

    Concept map
    23 concepts
    100%
    Proven claimDefinitionThis conceptRelated conceptA → B: B builds on A
    Evidence

    This concept declares 8 statements. Each proof establishes one of them relative to its assumptions.

    4 piP_subset_sigmaP_succ proven

    7 sigmaP_subset_piP_succ proven

    8 sigmaP_subset_sigmaP_succ proven

    Lean source view on GitHub

    1import Lax904597.Problems
    2import Lax904597.Interpretations
    3import Lax904597.Relativized
    4import Lax904597.SecondOrder
    5import Lax904597.Classes
    6import Lax904597.Sat
    7import Lax904597.Machines
    8import Lax485149.Problems
    9import Lax485149.Complement
    10import Lax535992.ClassPTIME
    11import Lax564036.Hierarchy
    12import Lax564036.Difference
    13import Lax564036.Tautology
    14import Lax564036.ThreeDnfTautology
    15import Lax564036.SatUnsat
    16import Lax564036.QuantifiedBooleanFormulas
    17import Lax564036.AlternatingMachines
    18
    19/-!
    20---
    21title: The levels of the polynomial hierarchy are nested
    22type: theorem
    23---
    24The levels of the polynomial hierarchy increase:
    25Σjp⊆Σkp\Sigma_j^p \subseteq \Sigma_k^p and Πjp⊆Πkp\Pi_j^p \subseteq \Pi_k^p for
    26j≤kj \le k, and each of Σkp\Sigma_k^p and Πkp\Pi_k^p is contained in both
    27Σk+1p\Sigma_{k+1}^p and Πk+1p\Pi_{k+1}^p, for k≥1k \ge 1. Every level is
    28contained in PH. From level 1 up, a definition is padded with a vacuous
    29quantifier block; the step from level 0 goes through the complete problem
    30HORN-SAT.
    31-/
    32
    33namespace Lax564036.HierarchyInclusions
    34
    35open FirstOrder FirstOrder.Language
    36open Lax904597.Problems Lax904597.Interpretations Lax904597.Relativized Lax904597.SecondOrder
    37open Lax904597.Classes Lax904597.Sat Lax904597.Machines
    38open Lax485149.Problems Lax485149.Complement Lax535992.ClassPTIME
    39open Lax564036.Hierarchy Lax564036.Difference Lax564036.Tautology Lax564036.ThreeDnfTautology
    40open Lax564036.SatUnsat Lax564036.QuantifiedBooleanFormulas Lax564036.AlternatingMachines
    41
    42/-- `Σₖ₊₁ᵖ ⊆ Σₖ₊₂ᵖ`. -/
    43axiom sigmaP_subset_sigmaP_succ : ∀ (k : ℕ) {L : Language.{0, 0}} [L.IsRelational]
    44 (P : DecisionProblem L), (SigmaP (k + 1)).Mem P → (SigmaP (k + 2)).Mem P
    45
    46/-- `Σₖ₊₁ᵖ ⊆ Πₖ₊₂ᵖ`. -/
    47axiom sigmaP_subset_piP_succ : ∀ (k : ℕ) {L : Language.{0, 0}} [L.IsRelational]
    48 (P : DecisionProblem L), (SigmaP (k + 1)).Mem P → (PiP (k + 2)).Mem P
    49
    50/-- `Πₖ₊₁ᵖ ⊆ Σₖ₊₂ᵖ`. -/
    51axiom piP_subset_sigmaP_succ : ∀ (k : ℕ) {L : Language.{0, 0}} [L.IsRelational]
    52 (P : DecisionProblem L), (PiP (k + 1)).Mem P → (SigmaP (k + 2)).Mem P
    53
    54/-- `Πₖ₊₁ᵖ ⊆ Πₖ₊₂ᵖ`. -/
    55axiom piP_subset_piP_succ : ∀ (k : ℕ) {L : Language.{0, 0}} [L.IsRelational]
    56 (P : DecisionProblem L), (PiP (k + 1)).Mem P → (PiP (k + 2)).Mem P
    57
    58/-- The `Σ` levels increase. -/
    59axiom sigmaP_mono :
    60 ∀ {j k : ℕ}, j ≤ k → ∀ {L : Language.{0, 0}} [L.IsRelational] (P : DecisionProblem L),
    61 (SigmaP j).Mem P → (SigmaP k).Mem P
    62
    63/-- The `Π` levels increase. -/
    64axiom piP_mono :
    65 ∀ {j k : ℕ}, j ≤ k → ∀ {L : Language.{0, 0}} [L.IsRelational] (P : DecisionProblem L),
    66 (PiP j).Mem P → (PiP k).Mem P
    67
    68/-- Every `Σ` level is contained in PH. -/
    69axiom sigmaP_subset_PH : ∀ (k : ℕ) {L : Language.{0, 0}} [L.IsRelational]
    70 (P : DecisionProblem L), (SigmaP k).Mem P → PH.Mem P
    71
    72/-- Every `Π` level is contained in PH. -/
    73axiom piP_subset_PH : ∀ (k : ℕ) {L : Language.{0, 0}} [L.IsRelational]
    74 (P : DecisionProblem L), (PiP k).Mem P → PH.Mem P
    75
    76end Lax564036.HierarchyInclusions
    77
    Show ProofShow ProofShow ProofShow ProofShow ProofShow ProofShow ProofShow Proof

    Discussion

    Ask a question or add context. Endorsements and structured flags are kept in the review panel above.

    Loading discussion…