The typical example of a uniformity-type result in descriptive set theory is the Souslin-Kleene Theorem, which says that the separation property of the class of analytic sets can be witnessed by a recursive function in the codes. An important consequence of the latter is the extension of the result HYP is effectively bi-analytic, in all recursive Polish spaces.

In this talk we present the uniform version of two more separation theorems about analytic sets by Dyck and Preiss. The former deals with the monotone analytic subsets of the Cantor space, and the latter with the convex analytic subsets of \(\mathbbR\). (A subset of the powerset of the naturals is monotone if it is closed upwards under inclusion.) We show that the separation can be realized by a recursive and a HYP function in the codes respectively. As in the case of the Souslin-Kleene Theorem, these results have the analogous constructive consequence. It follows for example, that every HYP convex subset of \(\mathbbR\) can be obtained from the class of HYP compact convex sets by taking HYP increasing unions and HYP intersections.