Interactive proofs and a Shamir-like result for real number computations

We introduce and study interactive proofs in the framework of real number computations as introduced by Blum, Shub, and Smale. Ivanov and de Rougemont started this line of research showing that an analogue of Shamir’s result holds in the real additive Blum–Shub–Smale model of computation when only Boolean messages can be exchanged. Here, we introduce interactive proofs in the full BSS model in which also multiplications can be performed and reals can be exchanged. The ultimate goal is to give a Shamir-like characterization of the real counterpart IP R of classical IP. Whereas classically Shamir’s result implies IP = PSPACE = PAT = PAR, in our framework a major difficulty arises: In contrast to Turing complexity theory, the real number classes PAR R and PAT R differ and space resources considered separately are not meaningful. It is not obvious how to figure out whether at all IP R is characterized by one of the above classes—and if so by which. We obtain two main results, an upper and a lower bound for the new class IP R . As upper bound we establish IP R ⊆ MA ∃ R , where MA ∃ R is a real complexity class introduced by Cucker and Briquel satisfying PAR R ⊊ MA ∃ R ⊆ PAT R and conjectured to be different from PAT R . We then complement this result and prove a non-trivial lower bound for IP R . More precisely, we design interactive real protocols verifying function values for a large class of functions introduced by Koiran and Perifel and denoted by UniformVPSPACE 0 . As a consequence, we show PAR R ⊆ IP R , which in particular implies co- NP R ⊆ IP R , and P R Res ⊆ IP R , where Res denotes certain multivariate Resultant polynomials. Our proof techniques are guided by the question in how far Shamir’s classical proof can be used as well in the real number setting. Towards this aim results by Koiran and Perifel on UniformVPSPACE 0 are extremely helpful.