<p>You are asking about Dinur's proof of the PCP Theorem. The alphabet reduction step does use a PCP, but the PCP has very different parameters from the one you construct, and you don't necessarily have to use recursion to construct it. In particular, in Dinur's proof, because this inner PCP for the alphabet reduction is applied on constant sized input, we don't care if it has huge (say exponential or even more than that) blowup, which makes it comparatively easy to give a direct construction of a good enough PCP. </p>

<p>The entire proof including this stage is described in several places (see <a href="https://cstheory.stackexchange.com/questions/45/what-are-good-references-to-understanding-the-proof-of-the-pcp-theorem">answer to this question</a>), and so you may find a different description that you like better. In particular, in my complexity textbook with Sanjeev Arora this is covered in Chapters 11 and 22, we offer there two alternative ways to achieve the alphabet reduction step. One is using Hadamard-based PCP in the main text. But maybe the simplest self contained variant of it is the construction worked out in   Exercise 22.5. We also have a table, in Section 22.2.1, that shows exactly what very step of the proof does to the alphabet size (and other parameters such as soundness error, size and number of queries) and that may allay your concern.</p>

CC BY-SA 2.5
2010-11-26T16:22:49.550Z
Thanks Boaz. I will check out the sections you mentioned from your book.
Akash Kumar
CC BY-SA 2.5
2010-11-26T14:42:44.940Z
2010-11-26T14:42:44.940Z
2017-04-13T12:32:28.080Z
Boaz Barak
<p>What follows might seem stupid (and that probably reflects my poor understanding - so please bear with me)</p>

<p>I had a query on PCP theorem. We know that after the first three steps viz. Degree Reduction, Expanderization and Gap Amplification, we have a constraint graph $G$ with improved gap and huge alphabet size (like $\Sigma^{d^t}$). It is this problem that the alphabet reduction step addresses.</p>

<p>My question is that as outlined in Venkat Guruswami's lecture notes <a href="http://www.cs.washington.edu/education/courses/cse533/05au/lecture6.pdf" rel="nofollow">Introduction to Composition</a>, it seems to me that the high level idea is to express the constraint $c_e$ over an edge $e$ as a Boolean constraint over boolean variables. This by itself achieves nothing and we also need to apply the PCP reduction ,$P_e$, on this edge. This "looks like" a recursive invocation of PCP and this is where I start getting a little worried. It seems as this recursive invocation would blow up the alphabet size again.</p>

<p>The authors have offered some explanation by observing that this recursion has a "base case" - namely - the "inner" PCP reduction applies only to constraints of constant size. </p>

<p>(By this I understand that the inner recursion gets invoked only when we are looking at constraints $c_e$ over a single edge which is a binary constraint, but still I have not yet come over the fear that somehow we still might blow up the alphabet size instead of shrinking it). To me, it still seems that a recursive repetition of Gap Amplification step will only make matters worse by blowing up the alphabet size unless we incorporate measures to handle the base case a little differently.</p>

<p>I hope my query  (as silly as it is) is probably clear. Please let me know what essential part am I missing (or have misunderstood).</p>

CC BY-SA 2.5
2010-11-26T11:59:39.993Z
Just read the notes of the next lecture. (P.S. You actually mean, you have a question about Dinur's proof of the PCP theorem)
Kristoffer Arnsfelt Hansen
<cc.complexity-theory><pcp>
PCP Theorem - Alphabet Reduction Step
Akash Kumar
# PCP Theorem - Alphabet Reduction Step

(Asked by: username_0 on 2010-11-25)

What follows might seem stupid (and that probably reflects my poor understanding - so please bear with me)

I had a query on PCP theorem. We know that after the first three steps viz. Degree Reduction, Expanderization and Gap Amplification, we have a constraint graph $G$ with improved gap and huge alphabet size (like $\Sigma^{d^t}$). It is this problem that the alphabet reduction step addresses.

My question is that as outlined in Venkat Guruswami's lecture notes [Introduction to Composition](http://www.cs.washington.edu/education/courses/cse533/05au/lecture6.pdf), it seems to me that the high level idea is to express the constraint $c\_e$ over an edge $e$ as a Boolean constraint over boolean variables. This by itself achieves nothing and we also need to apply the PCP reduction ,$P\_e$, on this edge. This "looks like" a recursive invocation of PCP and this is where I start getting a little worried. It seems as this recursive invocation would blow up the alphabet size again.

The authors have offered some explanation by observing that this recursion has a "base case" - namely - the "inner" PCP reduction applies only to constraints of constant size.

(By this I understand that the inner recursion gets invoked only when we are looking at constraints $c\_e$ over a single edge which is a binary constraint, but still I have not yet come over the fear that somehow we still might blow up the alphabet size instead of shrinking it). To me, it still seems that a recursive repetition of Gap Amplification step will only make matters worse by blowing up the alphabet size unless we incorporate measures to handle the base case a little differently.

I hope my query (as silly as it is) is probably clear. Please let me know what essential part am I missing (or have misunderstood).

**Tags:** cc.complexity-theory, pcp

> **Comments:**
> **username_1**: Just read the notes of the next lecture. (P.S. You actually mean, you have a question about Dinur's proof of the PCP theorem)  

---

## 1 answers

### Answer by username_2 on 2010-11-26. Score: 14 | Accepted answer

You are asking about Dinur's proof of the PCP Theorem. The alphabet reduction step does use a PCP, but the PCP has very different parameters from the one you construct, and you don't necessarily have to use recursion to construct it. In particular, in Dinur's proof, because this inner PCP for the alphabet reduction is applied on constant sized input, we don't care if it has huge (say exponential or even more than that) blowup, which makes it comparatively easy to give a direct construction of a good enough PCP.

The entire proof including this stage is described in several places (see [answer to this question](https://cstheory.stackexchange.com/questions/45/what-are-good-references-to-understanding-the-proof-of-the-pcp-theorem)), and so you may find a different description that you like better. In particular, in my complexity textbook with Sanjeev Arora this is covered in Chapters 11 and 22, we offer there two alternative ways to achieve the alphabet reduction step. One is using Hadamard-based PCP in the main text. But maybe the simplest self contained variant of it is the construction worked out in Exercise 22.5. We also have a table, in Section 22.2.1, that shows exactly what very step of the proof does to the alphabet size (and other parameters such as soundness error, size and number of queries) and that may allay your concern.

> **Comments:**
> **username_0**: Thanks Boaz. I will check out the sections you mentioned from your book.  

---

