ArticleslgStudy

mathematics

Savitch's theorem

Savitch's theorem is a mathematics topic covered in the lgStudy science library. This page brings together a partial reference excerpt, illustrations, worked examples, real-world applications and a short study plan, so you can understand Savitch's theorem rather than just read about it. In short: In computational complexity theory, Savitch's theorem, proved by Walter Savitch in 1970, gives a relationship between deterministic and non-deterministic space complexity. It states that for any space-constructable function f ∈ Ω ( log ⁡ ( n ) ) {\displaystyle f\in \Omega (\log(n))} , N S P A C E ( f ( n ) ) ⊆ D S P A C E ( f ( n ) 2 ) . {\displaystyle {\mathsf {NSPACE}}\left(f\left(n\right)\right)\subseteq {\mathsf…

Key takeaways

  • Savitch's theorem belongs to mathematics; place it in that map before memorising details.
  • Learn the definition first, then one example that makes the definition concrete.
  • Connect Savitch's theorem to a quantity you can measure, compute or draw — that is where exam questions come from.
  • Reproduce the core statement of Savitch's theorem from memory before moving on to harder problems.

Reference excerpt

In computational complexity theory, Savitch's theorem, proved by Walter Savitch in 1970, gives a relationship between deterministic and non-deterministic space complexity. It states that for any space-constructable function f ∈ Ω ( log ⁡ ( n ) ) {\displaystyle f\in \Omega (\log(n))} ,

N S P A C E ( f ( n ) ) ⊆ D S P A C E ( f ( n ) 2 ) . {\displaystyle {\mathsf {NSPACE}}\left(f\left(n\right)\right)\subseteq {\mathsf {DSPACE}}\left(f\left(n\right)^{2}\right).}

In other words, if a nondeterministic Turing machine can solve a problem using f ( n ) {\displaystyle f(n)} space, a deterministic Turing machine can solve the same problem in the square of that space bound. Although it seems that nondeterminism may produce exponential gains in time (as formalized in the unproven exponential time hypothesis), Savitch's theorem shows that it has a markedly more limited effect on space requirements. The theorem can be relativized. That is, for any oracle, replacing every "Turing machine" with "oracle Turing machine" would still result in a theorem.

Proof The proof relies on an algorithm for STCON, the problem of determining whether there is a path between two vertices in a directed graph, which runs in O ( ( log ⁡ n ) 2 ) {\displaystyle O\left((\log n)^{2}\right)} space for n {\displaystyle n} vertices. The basic idea of the algorithm is to solve recursively a somewhat more general problem, testing the existence of a path from a vertex s {\displaystyle s} to another vertex t {\displaystyle t} that uses at most k {\displaystyle k} edges, for a parameter k {\displaystyle k} given as input. STCON is a special case of this problem where k {\displaystyle k} is set large enough to impose no restriction on the paths (for instance, equal to the total number of vertices in the graph, or any larger value). To test for a k {\displaystyle k} -edge path from s {\displaystyle s} to t {\displaystyle t} , a deterministic algorithm can iterate through all vertices u {\displaystyle u} , and recursively search for paths of half the length from s {\displaystyle s} to u {\displaystyle u} and from u {\displaystyle u} to t {\displaystyle t} . This algorithm can be expressed in pseudocode (in Python syntax) as follows:

… excerpt ends here. Continue reading the full article.

Worked examples

Example 1 — a first encounter with Savitch's theorem

Start with the simplest possible case. Write down what Savitch's theorem claims or describes in one sentence, then invent the smallest concrete situation in which that sentence is true. In mathematics, the smallest case is usually a single object, a single equation or a single measurement. Check that every symbol or term in your sentence has a meaning in that case.

Example 2 — changing one variable

Take the situation from Example 1 and change exactly one quantity: double it, halve it, or set it to zero. Predict what should happen to Savitch's theorem before you calculate. Comparing your prediction with the result is the fastest way to find out whether you understand the idea or only the words.

Example 3 — an exam-style question

Typical questions about Savitch's theorem ask you to (a) state it precisely, (b) apply it to given data, and (c) explain a limitation. Practise writing all three answers in under five minutes; the third part is what separates a full-mark answer from an average one.

Applications of Savitch's theorem

In research
Savitch's theorem appears in mathematics research whenever the underlying quantities have to be modelled precisely. Papers usually cite it as a starting assumption and then explore where it breaks down.
In technology and industry
Engineering practice reuses Savitch's theorem in design rules, simulations and safety margins. Knowing the idea lets you read a specification sheet and understand why the numbers look the way they do.
In the classroom
Savitch's theorem is common in secondary-school and first-year university syllabi. It links to neighbouring topics Structural complexity theory, Theorems in computational complexity theory, so understanding it makes those chapters shorter.
In everyday life
Look for Savitch's theorem outside the textbook — in sport, cooking, traffic, electronics or the sky above you. An example you found yourself is remembered far longer than one you were given.
Ask Teacher Smith questions about this articleOpens your AI tutor with a question about “Savitch's theorem” →

Affiliate

Preply — study more efficiently by working with a personal tutor. 50% off.

How to study Savitch's theorem in 20 minutes

  1. Read the reference excerpt below once, without taking notes.
  2. Close the page and write down what Savitch's theorem means in your own words.
  3. Compare your version with the excerpt and mark what you missed.
  4. Work through the three examples above with pen and paper.
  5. Explain Savitch's theorem out loud to somebody else — or to Teacher Smith in the lgStudy chat.

Frequently asked questions

What is Savitch's theorem in simple terms?

In computational complexity theory, Savitch's theorem, proved by Walter Savitch in 1970, gives a relationship between deterministic and non-deterministic space complexity. It states that for any space-constructable function f ∈ Ω ( log ⁡ ( n ) ) {\displaystyle f\in \Omega (\log(n))} , N S P A C E (…

Why does Savitch's theorem matter?

Because it connects several mathematics ideas at once: it gives you a definition you can apply, a quantity you can calculate, and a way to check whether a result is plausible.

How should I study Savitch's theorem?

Read the excerpt, restate it from memory, then work through the examples and applications listed on this page. The five-step study plan above takes about twenty minutes.

What does this page cover?

It gives you a compact reference excerpt plus original lgStudy explanations, examples, applications and study material on Savitch's theorem.

Tags

  • Structural complexity theory
  • Theorems in computational complexity theory

Keep exploring