I was looking for some information on 1-in-3 SAT and came across this paper, last updated 9 days ago, which claims that the Polynomial Time Hierarchy collapses "to the level above P=NP". That's quite exciting if you ask me, although I don't have the toolkit to understand the actual proof. My question is about something much simpler.
Specifically, in the abstract on arxiv, the author writes,
Our proof shows the structure formerly known as the Polynomial Hierarchy collapses to the level above P=NP. That is, we show that coNP⊆NP∖P.
Could anyone help me understand why these two statements are equivalent?