The levels of the polynomial hierarchy are nested
Lax564036.HierarchyInclusions · concepts/Lax564036/HierarchyInclusions.lean · lax-564036
No public endorsements yet.
Loading review…
Sign in with ORCIDNatural Language Statement
Theorem
The levels of the polynomial hierarchy increase: and for , and each of and is contained in both and , for . 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
Evidence
This concept declares 8 statements. Each proof establishes one of them relative to its assumptions.
1 piP_mono proven
2 piP_subset_PH proven
3 piP_subset_piP_succ proven
4 piP_subset_sigmaP_succ proven
5 sigmaP_mono proven
6 sigmaP_subset_PH proven
7 sigmaP_subset_piP_succ proven
8 sigmaP_subset_sigmaP_succ proven
Lean source view on GitHub
| 1 | import Lax904597.Problems |
| 2 | import Lax904597.Interpretations |
| 3 | import Lax904597.Relativized |
| 4 | import Lax904597.SecondOrder |
| 5 | import Lax904597.Classes |
| 6 | import Lax904597.Sat |
| 7 | import Lax904597.Machines |
| 8 | import Lax485149.Problems |
| 9 | import Lax485149.Complement |
| 10 | import Lax535992.ClassPTIME |
| 11 | import Lax564036.Hierarchy |
| 12 | import Lax564036.Difference |
| 13 | import Lax564036.Tautology |
| 14 | import Lax564036.ThreeDnfTautology |
| 15 | import Lax564036.SatUnsat |
| 16 | import Lax564036.QuantifiedBooleanFormulas |
| 17 | import Lax564036.AlternatingMachines |
| 18 | |
| 19 | /-! |
| 20 | --- |
| 21 | title: The levels of the polynomial hierarchy are nested |
| 22 | type: theorem |
| 23 | --- |
| 24 | The levels of the polynomial hierarchy increase: |
| 25 | and for |
| 26 | , and each of and is contained in both |
| 27 | and , for . Every level is |
| 28 | contained in PH. From level 1 up, a definition is padded with a vacuous |
| 29 | quantifier block; the step from level 0 goes through the complete problem |
| 30 | HORN-SAT. |
| 31 | -/ |
| 32 | |
| 33 | namespace Lax564036.HierarchyInclusions |
| 34 | |
| 35 | open FirstOrder FirstOrder.Language |
| 36 | open Lax904597.Problems Lax904597.Interpretations Lax904597.Relativized Lax904597.SecondOrder |
| 37 | open Lax904597.Classes Lax904597.Sat Lax904597.Machines |
| 38 | open Lax485149.Problems Lax485149.Complement Lax535992.ClassPTIME |
| 39 | open Lax564036.Hierarchy Lax564036.Difference Lax564036.Tautology Lax564036.ThreeDnfTautology |
| 40 | open Lax564036.SatUnsat Lax564036.QuantifiedBooleanFormulas Lax564036.AlternatingMachines |
| 41 | |
| 42 | /-- `Σₖ₊₁ᵖ ⊆ Σₖ₊₂ᵖ`. -/ |
| 43 | axiom 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 | /-- `Σₖ₊₁ᵖ ⊆ Πₖ₊₂ᵖ`. -/ |
| 47 | axiom 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 | /-- `Πₖ₊₁ᵖ ⊆ Σₖ₊₂ᵖ`. -/ |
| 51 | axiom 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 | /-- `Πₖ₊₁ᵖ ⊆ Πₖ₊₂ᵖ`. -/ |
| 55 | axiom 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. -/ |
| 59 | axiom 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. -/ |
| 64 | axiom 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. -/ |
| 69 | axiom 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. -/ |
| 73 | axiom piP_subset_PH : ∀ (k : ℕ) {L : Language.{0, 0}} [L.IsRelational] |
| 74 | (P : DecisionProblem L), (PiP k).Mem P → PH.Mem P |
| 75 | |
| 76 | end Lax564036.HierarchyInclusions |
| 77 |
Builds on
Lax485149.ComplementLax485149.ProblemsLax535992.ClassPTIMELax564036.AlternatingMachinesLax564036.DifferenceLax564036.HierarchyLax564036.QuantifiedBooleanFormulasLax564036.SatUnsatLax564036.TautologyLax564036.ThreeDnfTautologyLax904597.ClassesLax904597.InterpretationsLax904597.MachinesLax904597.ProblemsLax904597.RelativizedLax904597.SatLax904597.SecondOrder
Used by
none
From Mathlib
none
Discussion
Ask a question or add context. Endorsements and structured flags are kept in the review panel above.
0 comments