31,630 research outputs found

    Disjoint Borel Functions

    Full text link
    For each a∈Ra \in \mathbb{R}, we define a Borel function fa:R→Rf_a : \mathbb{R} \to \mathbb{R} which encodes aa in a certain sense. We show that for each Borel g:R→Rg : \mathbb{R} \to \mathbb{R}, fa∩g=∅f_a \cap g = \emptyset implies a∈Δ11(c)a \in \Delta^1_1(c) where cc is any code for gg. We generalize this theorem for gg in larger pointclasses Γ\Gamma. Specifically, if Γ=Δ21\Gamma = \mathbf{\Delta}^1_2, then a∈L[c]a \in L[c]. Also for all n∈ωn \in \omega, if Γ=Δ3+n1\Gamma = \mathbf{\Delta}^1_{3 + n}, then a∈M1+n(c)a \in \mathcal{M}_{1 + n}(c).Comment: 15 page

    Disjoint Infinity-Borel Functions

    Full text link
    This is a followup to a paper by the author where the disjointness relation for definable functions from ωω{^\omega \omega} to ωω{^\omega \omega} is analyzed. In that paper, for each a∈ωωa \in {^\omega \omega} we defined a Baire class one function fa:ωω→ωωf_a : {^\omega \omega} \to {^\omega \omega} which encoded aa in a certain sense. Given g:ωω→ωωg : {^\omega \omega} \to {^\omega \omega}, let Ψ(g)\Psi(g) be the statement that gg is disjoint from at most countably many of the functions faf_a. We show the consistency strength of (∀g) Ψ(g)(\forall g)\, \Psi(g) is that of an inaccessible cardinal. We show that AD+\textrm{AD}^+ implies (∀g) Ψ(g)(\forall g)\, \Psi(g). Finally, we show that assuming large cardinals, (∀g) Ψ(g)(\forall g)\, \Psi(g) holds in models of the form L(R)[U]L(\mathbb{R})[\mathcal{U}] where U\mathcal{U} is a selective ultrafilter on ω\omega.Comment: 16 page

    Disjoint Infinity Borel Functions

    Get PDF
    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

    Menger curvature and rectifiability

    Full text link
    For a Borel set E in R^n, the total Menger curvature of E, or c(E), is the integral over E^3 (with respect to 1-dimensional Hausdorff measure in each factor of E) of c(x,y,z)^2, where 1/c(x,y,z) is the radius of the circle passing through three points x, y, and z in E. Let H^1(X) denote the 1-dimensional Hausdorff measure of a set X. A Borel set E in R^n is purely unrectifiable if for any Lipschitz function gamma from R to R^n, H^1(E cap gamma(R)) = 0. It is said to be rectifiable if there exists a countable family of Lipschitz functions gamma_i from R to R^n such that H^1(E - union gamma_i(R)) = 0. It may be seen from this definition that any 1-set E (that is, E Borel and 0<H^1(E)<\infty) can be decomposed into two disjoint subsets E_irr and E_rect, where E_irr is purely unrectifiable and E_rect is rectifiable. Theorem. If E is a 1-set in R^n and c(E)^2 is finite, then E is rectifiable.Comment: 39 pages, 3 figures, published version, abstract added in migratio

    On disjoint Borel uniformizations

    Get PDF
    Larman showed that any closed subset of the plane with uncountable vertical cross-sections has aleph_1 disjoint Borel uniformizing sets. Here we show that Larman's result is best possible: there exist closed sets with uncountable cross-sections which do not have more than aleph_1 disjoint Borel uniformizations, even if the continuum is much larger than aleph_1. This negatively answers some questions of Mauldin. The proof is based on a result of Stern, stating that certain Borel sets cannot be written as a small union of low-level Borel sets. The proof of the latter result uses Steel's method of forcing with tagged trees; a full presentation of this method, written in terms of Baire category rather than forcing, is given here

    Baire measurable paradoxical decompositions via matchings

    Full text link
    We show that every locally finite bipartite Borel graph satisfying a strengthening of Hall's condition has a Borel perfect matching on some comeager invariant Borel set. We apply this to show that if a group acting by Borel automorphisms on a Polish space has a paradoxical decomposition, then it admits a paradoxical decomposition using pieces having the Baire property. This strengthens a theorem of Dougherty and Foreman who showed that there is a paradoxical decomposition of the unit ball in R3\mathbb{R}^3 using Baire measurable pieces. We also obtain a Baire category solution to the dynamical von Neumann-Day problem: if aa is a nonamenable action of a group on a Polish space XX by Borel automorphisms, then there is a free Baire measurable action of F2\mathbb{F}_2 on XX which is Lipschitz with respect to aa.Comment: Minor revision
    • …
    corecore