We prove several reflection theorems on $D$-spaces, which are Hausdorff topological spaces $X$ in which for every open neighbourhood assignment $U$ there is a closed discrete subspace $D$ such that \[ \bigcup\{U(x): x\in D\}=X. \] The upwards reflection theorems are obtained in the presence of a forcing axiom, while most of the downwards reflection results use large cardinal assumptions.
The combinatorial content of arguments showing that a given space is a $D$-space, can be formulated using the concept of discrete families. We note the connection between non-reflection arguments involving discrete families and the well known question of the existence of families allowing partial transversals without having a transversal themselves, and use it to give non-trivial instances of the incompactness phenomenon in the context of discretisations.
We develop the theory of set-indexed families of sets and subsets within the informal Bishop Set Theory BST, a reconstruction of Bishop's theory of sets.
We prove that, for any $d$ linearly independent functions from some set into a $d$-dimensional vector space over any field, the family of zero sets of all non-trivial linear combination of these functions has VC-dimension and Littlestone dimension $d-1$. Additionally, we characterize when such families are maximal of VC-dimension $d-1$ and give a sufficient condition for when they are maximal of Littlestone dimension $d-1$.
We prove several reflection theorems on $D$-spaces, which are Hausdorff topological spaces $X$ in which for every open neighbourhood assignment $U$ there is a closed discrete subspace $D$ such that \[ \bigcup\{U(x): x\in D\}=X. \] The upwards reflection theorems are obtained in the presence of a forcing axiom, while most of the downwards reflection results use large cardinal assumptions. The combinatorial content of arguments showing that a given space is a $D$-space, can be formulated using the concept of discrete families. We note the connection between non-reflection arguments involving dis…
We provide a proof that analytic almost disjoint families of infinite sets of integers cannot be maximal using a result of Bourgain about compact sets of Baire class one functions. Inspired by this and related ideas, we then provide a new proof of that there are no maximal almost disjoint families in Solovay's model. We then use the ideas behind this proof to provide an extension of a dichotomy result by Rosenthal and by Bourgain, Fremlin and Talagrand to general pointwise bounded functions in Solovay's model. We then show that the same conclusions can be drawn about the model obtained when we…
We propose a new, game-theoretic, approach to the idealized forcing, in terms of fusion games. This generalizes the classical approach to the Sacks and the Miller forcing. For definable ($\mathbfΠ^1_1$ on $\mathbfΣ^1_1) $σ$-ideals we show that if a $σ$-ideal is generated by closed sets, then it is generated by closed sets in all forcing extensions. We also prove an infinite-dimensional version of the Solecki dichotomy for analytic sets. Among examples, we investigate the $σ$-ideal $\E$ generated by closed null sets and $σ$-ideals connected with not piecewise continuous functions.
We consider strong combinatorial principles for sigma-directed families of countable sets in the ordering by inclusion modulo finite, e.g. P-ideals of countable sets. We try for principles as strong as possible while remaining compatible with CH, and we also consider principles compatible with the existence of nonspecial Aronszajn trees. The main thrust is towards abstract principles with game theoretic formulations. Some of these principles are purely combinatorial, while the ultimate principles are primarily combinatorial but also have aspects of forcing axioms.
We define the notions of relative $e$-spectra, with respect to $E$-operators, relative closures, and relative generating sets. We study properties connected with relative $e$-spectra and relative generating sets.
We present the first steps of a predicative reconstruction of the constructive Bishop-Cheng measure theory. Working in a semi-formal elaboration of Bishop's set theory and invoking the notion of a set-indexed family of subsets (of a given set), we arrive at notions of a pre-integration space and of a pre-measure space. We then construct the pre-integration space of simple functions associated to a pre-measure space and the $L^1$-completion of a pre-integration space. Unlike the standard presentation of Bishop-Cheng measure theory, our development is completely predicative and avoids the axiom …
Let m>2 be an integer. We show that ZF + "For every integer n, Every countable family of non-empty sets of cardinality at most n has an infinite partial choice function" is not strong enough to prove that every countable set of m-element sets has a choice function. In the case where m=p is prime, to obtain the independence result we make use of a permutation model in which the set of atoms has the structure of a vector space over the field of p elements. When m is non-prime, a suitable permutation model is built from the models used in the prime cases.
This paper deals with the uniqueness of $L$-fuzzy sets in the representation of a given family of subsets of nonempty set. It first shows a formula of the number of $L$-fuzzy sets whose collection of cuts coincides with a given family of subsets of a nonempty set, and then provides a necessary and sufficient condition under which such $L$-fuzzy sets are unique.
We prove new upper bounds on homotopy and homology groups of o-minimal sets in terms of their approximations by compact o-minimal sets. In particular, we improve the known upper bounds on Betti numbers of semialgebraic sets defined by quantifier-free formulae, and obtain for the first time a singly exponential bound on Betti numbers of sub-Pfaffian sets.
Two uniqueness results on representations of sets constructible in a directed family of sets are given. In the unpackable case, swiss cheese decompositions are unique. In the packable case, they are not unique but admit a quasi-ordering under which the minimal decomposition is unique. Both cases lead to a one-dimensional elimination of imaginaries in VC-minimal and quasi-VC-minimal theories.
Two applications of Nash-Williams' theory of barriers to sequences on Banach spaces are presented: The first one is the $c_0$-saturation of $C(K)$, $K$ countable compacta. The second one is the construction of weakly-null sequences generalizing the example of Maurey-Rosenthal.
Miller's 1937 splitting theorem was proved for pairs of cardinals $(\n,ρ)$ in which $n$ is finite and $ρ$ is infinite. An extension of Miller's theorem is proved here in ZFC for pairs of cardinals $(ν,ρ)$ in which $ν$ is arbitrary and $ρ\ge \beth_\om(ν)$. The proof uses a new general method that is based on Shelah's revises Generalized Continuum Hypothesis theorem. Upper bounds on conflict-free coloring numbers of families of sets and a general comparison theorem follow as corollaries of the main theorem. Other corollaries eliminate the use of additional axioms from splitting theorems due to E…
We survey results regarding the definability and size of maximal discrete sets in analytic hypergraphs. Our main examples include maximal almost disjoint (or mad) families, $\mathcal I$-mad families, maximal eventually different families, and maximal cofinitary groups. We discuss the non-increasing sequence of cardinal characteristics $\mathfrak a_ξ$, for $ξ<ω_1$ as well as the notions of spectra of characteristics and optimal projective witnesses. We give an account of Zhang's forcing to add generic cofinitary permutations, and of a version of this forcing with built-in coding.
We show that it is consistent that the continuum is as large as you wish, and for each uncountable cardinal $κ$ below the continuum, there are a subset $T$ of the reals and a family $A$ of countable subsets of $T$ such that (1) both $T$ and $A$ have cardinality $κ$, (2) $|\bar{a}\cap T|=κ$ for each $a\in A$, (3) for each uncountable subset of $T$ contains some elements of $A$, and so (i) there is an almost disjoint family of subsets of the reals with size and chromatic number $κ$, (ii) there is a locally compact, locally countable $T_2$ space with cardinality spectrum $\{ω,κ\}$.
Our main result is that, given a collection $\mathcal{R}$ of meager relations on a Polish space $X$ such that $|\mathcal{R}|\leqω$, there exists a dense Baire subspace $F$ of $X$ (equivalently, a nowhere meager subset $F$ of $X$) such that $F$ is $R$-free for every $R\in\mathcal{R}$. This generalizes a recent result of Banakh and Zdomskyy. As an application, we show that there exists a non-meager independent family on $ω$, and define the corresponding cardinal invariant. Furthermore, assuming Martin's Axiom for countable posets, our result can be strengthened by substituting "$|\mathcal{R}|\le…
We study density requirements on a given Banach space that guarantee the existence of subsymmetric basic sequences by extending Tsirelson's well-known space to larger index sets. We prove that for every cardinal $κ$ smaller than the first Mahlo cardinal there is a reflexive Banach space of density $κ$ without subsymmetric basic sequences. As for Tsirelson's space, our construction is based on the existence of a rich collection of homogeneous families on large index sets for which one can estimate the complexity on any given infinite set. This is used to describe detailedly the asymptotic struc…
