26 research outputs found
Disjoint Borel Functions
For each , we define a Borel function which encodes in a certain sense. We show that for each Borel
, implies where is any code for . We generalize this theorem for
in larger pointclasses . Specifically, if , then . Also for all , if
, then .Comment: 15 page
Disjoint Infinity Borel Functions
Consider the statement that every uncountable set of reals can be surjected onto R by a Borel function. This is implied by the statement that every uncountable set of reals has a perfect subset. It is also implied by a new statement D which we will discuss: for each real a there is a Borel function fa : RtoR and for each function g : RtoR there is a countable set G(g) of reals such that the following is true: for each a in R and for each function g : R to R, if fa is disjoint from g, then a is in G(g). We will show that D follows from ZF +AD+ whereas the negation of D follows from ZFC