In 1986, Babai, Frankl and Simon (BFS86) defined the polynomial hierarchy in communication complexity and asked whether Σ ee 2 = Φ ee 2 . In order to tackle this problem, researchers have looked at an infinite version. We recently became aware of a paper from 1979 where Miller Mil79 shows that this infinite version is independent of the axioms of set theory. In this note we will describe Miller's result and give a simplified proof of one direction by showing that the continuum hypothesis implies that Σ r 2 = Φ r 2 p (R × R).
/lp/association-for-computing-machinery/the-infinite-version-of-an-open-communication-complexity-problem-is-7hCOIyIvo6