# A question about the polynomial hierarchy

Why does $\Pi_i^p \subseteq \Sigma_i^p$ imply $\Pi_i^p = \Sigma_i^p$?

Hint: $L \in \Sigma_i^p$ iff $\overline{L} \in \Pi_i^p$. (Here $\overline{L}$ is the complement of $L$.)
• Well, this shows that $L \in \Sigma_i^p \text{iff} \bar{L} \in \Sigma_i^p$. And since by definition $\Pi_i^p = co\Sigma_i^p$, I guess it follows? (I was trying to show that $\Pi_i^p \subseteq \Sigma_i^p \implies \Sigma_i^p \subseteq \Pi_i^p$ but I couldn't do this. – ComplexityStudent Aug 12 '15 at 18:17
• :D Okay! My approach is this : for some $x$ whose membership in $L \in \Sigma_i^p$ is being tested we have a decision predicate of the form $\exists y_1 .. Qy_i f(x,\vec{y})$ which is equivalent to its double negated form $\neg(\forall y_i .. \bar{Q} y_i \bar{f}(x,\vec{y}))$. But since $\Pi_i^p \subseteq \Sigma_i^p$ for a predicate like $\forall y_i .. \bar{Q} y_i \bar{f}(x,\vec{y})$ there exists an equivalent predicate like $\exists z_1.. Q z_i g(x,\vec{z})$ and then $\neg(\exists z_i .. Q z_i g(x,\vec{z}))$ is a predicate in $\Pi_i^p$. – ComplexityStudent Aug 12 '15 at 18:29