arXiv subjects
Publications and source records attributed to Joerg Brendle.
We show in ZFC that there is no set of reals of size continuum which can be translated away from every set in the Marczewski ideal. We also show that in the Cohen model, every set with this property is countable.
We develop iterated forcing constructions dual to finite support iterations in the sense that they add random reals instead of Cohen reals in limit steps. In view of useful applications we focus in particular on two-dimensional "random" iterations, which we call shattered iterations. As basic tools for such iterations we investigate several concepts that are interesting in their own right. Namely, we discuss correct diagrams, we introduce the amalgamated limit of cBa's, a construction generalizing both the direct limit and the two-step amalgamation of cBa's, we present a detailed account of cBa's carrying finitely additive strictly positive measures, and we prove a general preservation theorem for such cBa's in amalgamated limits. As application, we obtain new consistency results on cardinal invariants in Cichon's diagram. For example, we show the consistency of aleph_1 < cov (meager) < non (meager), thus answering an old question of A. Miller.
This is a survey on the amalgamated limit, a limit construction for complete Boolean algebras in iterated forcing theory, which generalizes both the direct limit and the two-step amalgamation. We focus in particular on examples of the amalgamated limit from the literature and on the topological amalgamated limit for compact Hausdorff spaces.
For a regular uncountable cardinal kappa, we discuss the order relationship between the unbounding and dominating numbers on kappa and cardinal invariants of the higher meager ideal M_kappa. In particular, we obtain a complete characterization of add(M_kappa) and cof(M_kappa) in terms of cov(M_kappa) and non(M_kappa) and unbounding and dominating numbers, and we provide models showing that there are no restrictions on the value of non(M_kappa) in the degenerate case 2^{ kappa except 2^{<kappa} leq non(M_kappa) leq 2^kappa. The corresponding question for cof(M_kappa) remains open. Our results answer questions of joint work of the author with Brooke-Taylor, Friedman, and Montoya.
This is an expository paper about several sophisticated forcing techniques closely related to standard finite support iterations of ccc partial orders. We focus on the four topics of ultrapowers of forcing notions, iterations along templates, Boolean ultrapowers of forcing notions, and restrictions of forcing notions to elementary submodels.
A classical theorem of Balcar, Pelant, and Simon says that there is a base matrix of height h, where h is the distributivity number of P(omega)/fin. We show that if the continuum c is regular, then there is a base matrix of height c, and that there are base matrices of any regular uncountable height less or equal than c in the Cohen and random models. This answers questions of Fischer, Koelbing, and Wohofsky.
We show that for any nonprincipal ultrafilter $U$ on the positive integers, then probability measure induced by the $U$-limit of asymptotic density is not a universally measurable function.
We develop a version of Cichon's diagram for cardinal invariants on the generalized Cantor space 2^kappa or the generalized Baire space kappa^kappa where kappa is an uncountable regular cardinal. For strongly inaccessible kappa, many of the ZFC-results about the order relationship of the cardinal invariants which hold for omega generalize; for example we obtain a natural generalization of the Bartoszynski-Raisonnier-Stern Theorem. We also prove a number of independence results, both with <kappa-support iterations and kappa-support iterations and products, showing that we consistently have strict inequality between some of the cardinal invariants.
We show that the cofinalities of both the Miller ideal m^0 (the sigma-ideal naturally related to Miller forcing) and the Laver ideal ell^0 (related to Laver forcing) are larger than the size of the continuum in ZFC.
We show that, consistently, there can be maximal subtrees of P (omega) and P (omega) / fin of arbitrary regular uncountable size below the size of the continuum. We also show that there are no maximal subtrees of P (omega) / fin with countable levels. Our results answer several questions of Campero, Cancino, Hrusak, and Miranda.
Say that a function pi:n^{ n (henceforth called a predictor) k-constantly predicts a real x in n^omega if for almost all intervals I of length k, there is i in I such that x(i)=pi (x restriction i). We study the k-constant prediction number v_n^const(k), that is, the size of the least family of predictors needed to k --constantly predict all reals, for different values of n and k, and investigate their relationship.