A theorem of Galvin asserts that if the unordered pairs of reals are partitioned into finitely many Borel classes then there is a perfect set P such that all pairs from P lie in the same class. The generalization to n-tuples for n >= 3 is false. Let us identify the reals with 2^omega ordered by the lexicographical ordering and define for distinct x,y in 2^omega, D(x,y) to be the least n such that x(n) not= y(n). Let the type of an increasing n-tuple {x_0, ... x_{n-1}}_< be the ordering <^* on {0, ...,n-2} defined by i<^*j iff D(x_i,x_{i+1})< D(x_j,x_{j+1}). Galvin proved that for any Borel coloring of triples of reals there is a perfect set P such that the color of any triple from P depends only on its type. Blass proved an analogous result is true for any n. As a corollary it follows that if the unordered n-tuples of reals are colored into finitely many Borel classes there is a perfect set P such that the n-tuples from P meet at most (n-1)! classes. We consider extensions of this result to partitions of infinite increasing sequences of reals. We show, that for any Borel or even analytic partition of all increasing sequences of reals there is a perfect set P such that all strongly increasing sequences from P lie in the same class.
We investigate the consistency strength of the statement: $κ$ is weakly compact and there is no tree on $κ$ with exactly $κ^{+}$ many branches. We show that this statement fails strongly (in the sense that there is a sealed tree with exactly $κ^{+}$ many branches) if there is no inner model with a Woodin cardinal. Moreover, we show that for a weakly compact cardinal $κ$ the nonexistence of a tree on $κ$ with exactly $κ^{+}$ many branches and, in particular, the Perfect Subtree Property for $κ$, implies the consistency of $AD_{\mathbb{R}} + DC$.
We show that, consistently, there exists a Borel set B subset Cantor admitting a sequence (eta_alpha:alpha<lambda) of distinct elements of Cantor such that (eta_alpha+B) cap (eta_beta+B) is uncountable for all alpha,beta<lambda but with no perfect set P such that |(eta+B) cap (nu+B)|>5 for any distinct eta,nu from P. This answers two questions from our previous works.
For a cardinal lambda<lambda_{omega_1} we give a ccc forcing notion P which forces that for some Borel subset B of the Cantor space (1) there a sequence (eta_alpha:alpha<lambda) of distinct elements such that |(eta_alpha+B) cap (eta_beta+B)|>5 for all alpha,beta<lambda, but (2) there is no perfect set of such eta's. The construction closely follows the one from Shelah math.LO/9802134
We expand the results of Roslanowski and Shelah arXive:1806.06283 , arXive:1909.00937 to all perfect Abelian Polish groups $(H,+)$. In particular, we show that if $α<ω_1$ and $4\leq k<ω$, then there is a ccc forcing notion adding a $Σ^0_2$ set $B\subseteq H$ which has $\aleph_α$ many pairwise $k$--overlapping translations but not a perfect set of such translations.
In a game where both contestants have perfect information, there is a strict limit on how perfect that information can be. By contrast, when one player is deprived of all information, the limit on the other player's information disappears, admitting a hierarchy of levels of lopsided perfection of information. We turn toward the question of when the player with super-perfect information has a winning strategy, and we exactly answer this question for a specific family of lopsided-information games which we call guessing games.
We characterize the structural impediments to the existence of Borel perfect matchings for acyclic locally countable Borel graphs admitting a Borel selection of finitely many ends from their connected components. In particular, this yields the existence of Borel matchings for such graphs of degree at least three. As a corollary, it follows that acyclic locally countable Borel graphs of degree at least three generating $μ$-hyperfinite equivalence relations admit $μ$-measurable matchings. We establish the analogous result for Baire measurable matchings in the locally finite case, and provide a c…
In this paper we prove three theorems about the theory of Borel sets in models of ZF without any form of the axiom of choice. We prove that if B is a G-delta-sigma set, then either B is countable or B contains a perfect subset. Second, we prove that if the real line is the countable union of countable sets, then there exists an F-sigma-delta set which is uncountable but contains no perfect subset. Finally, we construct a model of ZF in which we have an infinite Dedekind finite set of reals which is F-sigma-delta.
We prove that every two-player non-zero-sum Borel game with lower-semi-continuous payoffs admits a subgame-perfect $\ep$-equilibrium. This result complements Example 3 in Solan and Vieille (2003), which shows that a subgame-perfect $\ep$-equilibrium need not exists when the payoffs are not lower-semi-continuous.
Let $(X,τ)$ be a Polish space with Borel probability measure $μ,$ and $G$ a locally finite one-ended Borel graph on $X.$ We show that $G$ admits a Borel one-ended spanning tree generically. If $G$ is induced by a free Borel action of an amenable (resp., polynomial growth) group then we show the same result $μ$-a.e. (resp., everywhere). Our results generalize recent work of Timár, as well as of Conley, Gaboriau, Marks, and Tucker-Drob, who proved this in the probability measure preserving setting. We apply our theorem to find Borel orientations in even degree graphs and measurable and Baire mea…
We discuss the relationship between perfect sets of random reals, dominating reals, and the product of two copies of the random algebra B. Recall that B is the algebra of Borel sets of 2^omega modulo the null sets. Also given two models M subseteq N of ZFC, we say that g in omega^omega cap N is a dominating real over M iff forall f in omega^omega cap M there is m in omega such that forall n geq m (g(n) > f(n)); and r in 2^omega cap N is random over M iff r avoids all Borel null sets coded in M iff r is determined by some filter which is B-generic over M. We show that there is a ccc partial ord…
We show that the Dual Borel Conjecture implies that ${\mathfrak d}> \aleph_1$ and find some topological characterizations of perfectly meager and universally meager sets.
A canonization scheme for smooth equivalence relations on $\mathbb R^ω$ modulo restriction to infinite perfect products is proposed. It shows that given a pair of Borel smooth equivalence relations $\mathsf E,\mathsf F$ on $\mathbb R^ω$, there is an infinite perfect product $P\subseteq\mathbb R^ω$ such that either ${\mathsf F}\subseteq{\mathsf E}$ on $P$, or, for some $j<ω$, the following is true for all $x,y\in P$: $x\,\mathsf E \,y$ implies $x(j)=y(j)$, and $x\restriction{(ω\smallsetminus\{j\})}=y\restriction{(ω\smallsetminus\{j\})}$ implies $x\,\mathsf F \,y$.
We show that, consistently, there is a Borel set which has uncountably many pairwise very non-disjoint translations, but does not allow a perfect set of such translations.
Blackwell games are infinite games of imperfect information. The two players simultaneously make their moves, and are then informed of each other's moves. Payoff is determined by a Borel measurable function $f$ on the set of possible resulting sequences of moves. A standard result in Game Theory is that finite games of this type are determined. Blackwell proved that infinite games are determined, but only for the cases where the payoff function is the indicator function of an open or $G_δ$ set. For games of perfect information, determinacy has been proven for games of arbitrary Borel complexit…
We investigate forcing properties of perfect tree forcings defined by Prikry to answer a question of Solovay in the late 1960's regarding first failures of distributivity. Given a strictly increasing sequence of regular cardinals $\langle κ_n: n< ω\rangle$, Prikry defined the forcing $\mathbb{P}$ all perfect subtrees of $\prod_{n<ω}κ_n$, and proved that for $κ=\sup_{n<ω}κ_n$, assuming the necessary cardinal arithmetic, the Boolean completion $\mathbb{B}$ of $\mathbb{P}$ is $(ω,μ)$-distributive for all $μ<κ$ but $(ω,κ,δ)$-distributivity fails for all $δ<κ$, implying failure of the $(ω,κ)$-d.l. …
n infinite two-player zero-sum game with a Borel winning set, in which the opponent's actions are monitored eventually but not necessarily immediately after they are played, is determined. The proof relies on a representation of the game as a stochastic game with perfect information, in which Chance operates as a delegate for the players and performs the randomizations for them, and on Martin's Theorem about the determinacy of such games.
Let I be an ideal of subsets of a Polish space X, containing all singletons and possessing a Borel basis. Assuming that I does not satisfy ccc, we consider the following conditions (B), (M) and (D). Condition (B) states that there is a disjoint family F subseteq P(X) of size c, consisting of Borel sets which are not in I. Condition (M) states that there is a function f:X-> X with f^{-1}[{x}] notin I for each x in X. Provided that X is a group and I is invariant, condition (D) states that there exist a Borel set B notin I and a perfect set P subseteq X for which the family {B+x: x in P} is disj…
The usual definition of the set of constructible reals is $Σ^1_2$. This set can have a simpler definition if, for example, it is countable or if every real is constructible. H. Friedman asked if the set of constructible reals can be analytic or even Borel in a nontrivial way. A related problem was posed by K. Prikry: can there exist a nonconstructible perfect set of constructible reals? The main result of this paper is a negative answer to Friedman's question. In fact we prove that if $M$ is an inner model of set theory and the set of reals in $M$ is analytic then either all reals are in $M$ o…
We prove that there exists a countable family of continuous real functions whose graphs together with their inverses cover an uncountable square, i.e. a set of the form $X\times X$, where $X$ is an uncountable subset of the real line. This extends Sierpiński's theorem from 1919, saying that $S\times S$ can be covered by countably many graphs of functions and inverses of functions if and only if the size of $S$ does not exceed $\aleph_1$. Our result is also motivated by Shelah's study of planar Borel sets without perfect rectangles.
