Space Hierarchy Theorem - Proof

Proof

The goal here is to define a language that can be decided in space but not space . Here we define the language :

L = \{~ (\langle M \rangle, 10^k): M \mbox{ does not accept } (\langle M \rangle, 10^k) \mbox{ using space } \le f(|\langle M \rangle, 10^k|) ~ \}

Now, for any machine that decides a language in space, will differ in at least one spot from the language of, namely at the value of . The algorithm for deciding the language is as follows:

  1. On an input, compute using space-constructibility, and mark off cells of tape. Whenever an attempt is made to use more than cells, reject.
  2. If is not of the form for some TM, reject.
  3. Simulate on input for at most steps (using space). If the simulation tries to use more than space or more than operations, then reject.
  4. If accepted during this simulation, then reject; otherwise, accept.

Note on step 3: Execution is limited to steps in order to avoid the case where does not halt on the input . That is, the case where consumes space of only as required, but runs for infinite time.

The above proof holds for the case of PSPACE whereas we must make some change for the case of NPSPACE. The crucial point is that while on a deterministic TM we may easily invert acceptance and rejection (crucial for step 4), this is not possible on a non-deterministic machine.
For the case of NPSPACE we will first modify step 4 to:

  1. If accepted during this simulation, then accept; otherwise, reject.

We will now prove by contradiction that can not be decided by a TM using cells.
Assuming can be decided by a TM using cells, and following from the Immerman–Szelepcsényi theorem follows that can also be determined by a TM (which we will call ) using cells.
Here lies the contradiction, therefor our assumption must be false:

  1. If (for some large enough k) is in then will accept it, therefor rejects, therefor is not in (contradiction).
  2. If (for some large enough k) is not in then will reject it, therefor accepts, therefor is in (contradiction).

Read more about this topic:  Space Hierarchy Theorem

Famous quotes containing the word proof:

    “If some books are deemed most baneful and their sale forbid, how, then, with deadlier facts, not dreams of doting men? Those whom books will hurt will not be proof against events. Events, not books, should be forbid.”
    —Herman Melville (1819–1891)

    “O, popular applause! what heart of man
    Is proof against thy sweet, seducing charms?”
    —William Cowper (1731–1800)

    “He who has never failed somewhere, that man can not be great. Failure is the true test of greatness. And if it be said, that continual success is a proof that a man wisely knows his powers,—it is only to be added, that, in that case, he knows them to be small.”
    —Herman Melville (1819–1891)