Searcharxiv⌕ Search

arXiv subjects

Jörg Brendle

Publications and source records attributed to Jörg Brendle.

At least 19 recordsLinked to original sources
arXiv2025

Separating cardinal characteristics of the strong measure zero ideal

Let $\mathcal{SN}$ be the $σ$-ideal of the strong measure zero sets of reals. We present general properties of forcing notions that allow to control of the additivity of $\mathcal{SN}$ after finite support iterations. This is applied to force that the four cardinal characteristics associated with $\mathcal{SN}$ are pairwise different: \[\mathrm{add}(\mathcal{SN})<\mathrm{cov}(\mathcal{SN})<\mathrm{non}(\mathcal{SN})<\mathrm{cof}(\mathcal{SN}).\] Furthermore, we construct a forcing extension satisfying the above and Cichoń's maximum (i.e.\ that the non-dependent values in Cichoń's diagram are pairwise different).

math.LO↗
arXiv2025

Almost refinement, reaping, and ultrafilter numbers

We investigate the combinatorial structure of the set of maximal antichains in a Boolean algebra ordered by almost refinement. We also consider the reaping relation and its associated cardinal invariants, focusing in particular on reduced powers of Boolean algebras. As an application, we obtain that, on the one hand, the ultrafilter number of the Cohen algebra is greater than or equal to the cofinality of the meagre ideal and, on the other hand, a suitable parametrized diamond principle implies that the ultrafilter number of the Cohen algebra is equal to $\aleph_1$.

math.LO↗
arXiv2024

Density cardinals

How many permutations are needed so that every infinite-coinfinite set of natural numbers with asymptotic density can be rearranged to no longer have the same density? We prove that the density number $\mathfrak{dd}$, which answers this question, is equal to the least size of a non-meager set of reals, $\mathsf{non} (\mathcal{M})$. The same argument shows that a slight modification of the rearrangement number $\mathfrak{rr}$ of~\cite{BBBHHL20} is equal to $\mathsf{non} (\mathcal{M})$, and similarly for a cardinal invariant related to large-scale topology introduced by Banakh~\cite{Ba23}, thus answering a question of the latter. We then consider variants of $\mathfrak{dd}$ given by restricting the possible densities of the original set and / or of the permuted set, providing lower and upper bounds for these cardinals and proving consistency of strict inequalities. We finally look at cardinals defined in terms of relative density and of asymptotic mean, and relate them to the rearrangement numbers of~\cite{BBBHHL20}.

math.LO↗
arXiv2023

Halfway New Cardinal Characteristics

Based on the well-known cardinal characteristics $\mathfrak{s}$, $\mathfrak{r}$ and $\mathfrak{i}$, we introduce nine related cardinal characteristics by using the notion of asymptotic density to characterise different intersection properties of infinite sets. We prove several bounds and consistency results, e. g. the consistency of $\mathfrak{s} < \mathfrak{s}_{1/2}$, as well as several results about possible values of $\mathfrak{i}_{1/2}$.

math.LO↗
arXiv2022

Combinatorial properties of MAD families

We study some strong combinatorial properties of $\textsf{MAD}$ families. An ideal $\mathcal{I}$ is Shelah-Steprāns if for every set $X\subseteq{\left[ ω\right]}^{<ω}$ there is an element of $\mathcal{I}$ that either intersects every set in $X$ or contains infinitely many members of it. We prove that a Borel ideal is Shelah-Steprāns if and only if it is Katětov above the ideal $\textsf{fin}\times\textsf{fin}$. We prove that Shelah-Steprāns $\textsf{MAD}$ families have strong indestructibility properties (in particular, they are both Cohen and random indestructible). We also consider some other strong combinatorial properties of $\textsf{MAD}$ families. Finally, it is proved that it is consistent to have $\mathrm{non}(\mathcal{M}) = {\aleph}_{1}$ and no Shelah-Steprāns families of size ${\aleph}_{1}$.

math.LO↗
arXiv2022

Orderings of ultrafilters on Boolean algebras

We study two generalizations of the Rudin-Keisler ordering to ultrafilters on complete Boolean algebras. To highlight the difference between them, we develop new techniques to construct incomparable ultrafilters in this setting. Furthermore, we discuss the relation with Tukey reducibility and prove that, assuming the Continuum Hypothesis, there exist ultrafilters on the Cohen algebra which are RK-equivalent in the generalized sense but Tukey-incomparable, in stark contrast with the classical setting.

math.LO↗
arXiv2022

Higher Dimensional Cardinal Characteristics for Sets of Functions II

We study the values of the higher dimensional cardinal characteristics for sets of functions $f:ω^ω\to ω^ω$ introduced by the second author. We prove that while the bounding numbers for these cardinals can be strictly less than the continuum, the dominating numbers cannot. We compute the bounding numbers for the higher dimensional relations in many well known models of $\neg\mathsf{CH}$ such as the Cohen, random and Sacks models and, as a byproduct show that, with possibly one exception, for the bounding numbers there are no $\mathsf{ZFC}$ relations between them beyond those in the higher dimensional Cichoń diagram. In the case of the dominating numbers we show that in fact they collapse in the sense that modding out by the ideal does not change their values. Moreover, they are closely related to the dominating numbers $\mathfrak{d}^λ_κ$.

math.LO↗
arXiv2021

Combinatorics of ultrafilters on Cohen and random algebras

We investigate the structure of ultrafilters on Boolean algebras in the framework of Tukey reducibility. In particular, this paper provides several techniques to construct ultrafilters which are not Tukey maximal. Furthermore, we connect this analysis with a cardinal invariant of Boolean algebras, the ultrafilter number, and prove consistency results concerning its possible values on Cohen and random algebras.

math.LO↗
arXiv2020

Filter-linkedness and its effect on preservation of cardinal characteristics

We introduce the property ``$F$-linked'' of subsets of posets for a given free filter $F$ on the natural numbers, and define the properties ``$μ$-$F$-linked'' and ``$θ$-$F$-Knaster'' for posets in a natural way. We show that $θ$-$F$-Knaster posets preserve strong types of unbounded families and of maximal almost disjoint families. Concerning iterations of such posets, we develop a general technique to construct $θ$-$\mathrm{Fr}$-Knaster posets (where $\mathrm{Fr}$ is the Frechet ideal) via matrix iterations of ${<}θ$-ultrafilter-linked posets (restricted to some level of the matrix). This is applied to prove consistency results about Cichoń's diagram (without using large cardinals) and to prove the consistency of the fact that, for each Yorioka ideal, the four cardinal invariants associated with it are pairwise different. At the end, we show that three strongly compact cardinals are enough to force that Cichoń's diagram can be separated into $10$ different values.

math.LO↗
arXiv2019

The Rearrangement Number

How many permutations of the natural numbers are needed so that every conditionally convergent series of real numbers can be rearranged to no longer converge to the same sum? We define the \emph{rearrangement number}, a new cardinal characteristic of the continuum, as the answer to this question. We compare the rearrangement number with several natural variants, for example one obtained by requiring the rearranged series to still converge but to a new, finite limit. We also compare the rearrangement number with several well-studied cardinal characteristics of the continuum. We present some new forcing constructions designed to add permutations that rearrange series from the ground model in particular ways, thereby obtaining consistency results going beyond those that follow from comparisons with familiar cardinal characteristics. Finally, we deal briefly with some variants concerning rearrangements by a special sort of permutation and with rearranging some divergent series to become (conditionally) convergent.

math.LO↗
arXiv2019

Definable Maximal Independent Families

We study maximal independent families (m.i.f.) in the projective hierarchy. We show that (a) the existence of a $\boldsymbolΣ^1_2$ m.i.f. is equivalent to the existence of a $\boldsymbolΠ^1_1$ m.i.f., (b) in the Cohen model, there are no projective maximal independent families, and (c) in the Sacks model, there is a $\boldsymbolΠ^1_1$ m.i.f. We also consider a new cardinal invariant related to the question of destroying or preserving maximal independent families.

math.LO↗
arXiv2018

The subseries number

Every conditionally convergent series of real numbers has a divergent subseries. How many subsets of the natural numbers are needed so that every conditionally convergent series diverges on the subseries corresponding to one of these sets? The answer to this question is defined to be the subseries number, a new cardinal characteristic of the continuum. This cardinal is bounded below by $\aleph_1$ and above by the cardinality of the continuum, but it is not provably equal to either. We define three natural variants of the subseries number, and compare them with each other, with their corresponding rearrangement numbers, and with several well-studied cardinal characteristics of the continuum. Many consistency results are obtained from these comparisons, and we obtain another by computing the value of the subseries number in the Laver model.

math.LO↗
arXiv2016

Towers in filters, cardinal invariants, and Luzin type families

We investigate which filters on $ω$ can contain towers, that is, a modulo finite descending sequence without any pseudointersection (in $[ω]^ω$). We prove the following results: - Many classical examples of nice tall filters contain no towers (in ZFC). - It is consistent that tall analytic P-filters contain towers of arbitrary regular height (simultaneously for many regular cardinals as well). - It is consistent that all towers generate non-meager filters, in particular (consistently) Borel filters do not contain towers. - The statement "Every ultrafilter contains towers." is independent of ZFC. Furthermore, we study many possible logical (non)implications between the existence of towers in filters, inequalities between cardinal invariants of filters ($\mbox{add}^*(\mathcal F)$, $\mbox{cof}^*(\mathcal F)$, $\mbox{non}^*(\mathcal F)$, and $\mbox{cov}^*(\mathcal F)$), and the existence of Luzin type families (of size $\geq ω_2$), that is, if $\mathcal F$ is a filter then $X\subseteq [ω]^ω$ is an $\mathcal F$-Luzin family if $\{A\in X:|A\setminus F|=ω\}$ is countable for every $F\in \mathcal F$.

math.LO↗
arXiv2014

An analogy between cardinal characteristics and highness properties of oracles

We present an analogy between cardinal characteristics from set theory and highness properties from computability theory, which specify a sense in which a Turing oracle is computationally strong. While this analogy was first studied explicitly by Rupprecht in his PhD thesis, many prior results can be viewed from this perspective. After a comprehensive survey of the analogy for characteristics from Cichon's diagram, we extend it to Kurtz randomness and the analogue of the Specker-Eda number.

math.LO↗
arXiv2014

Rothberger gaps in fragmented ideals

The~\emph{Rothberger number} $\mathfrak{b} (\mathcal{I})$ of a definable ideal $\mathcal{I}$ on $ω$ is the least cardinal $κ$ such that there exists a Rothberger gap of type $(ω,κ)$ in the quotient algebra $\mathcal{P} (ω) / \mathcal{I}$. We investigate $\mathfrak{b} (\mathcal{I})$ for a subclass of the $F_σ$ ideals, the fragmented ideals, and prove that for some of these ideals, like the linear growth ideal, the Rothberger number is $\aleph_1$ while for others, like the polynomial growth ideal, it is above the additivity of measure. We also show that it is consistent that there are infinitely many (even continuum many) different Rothberger numbers associated with fragmented ideals.

math.LO↗
arXiv2014

A variant proof of Con(b<a)

We present a variation of the proof in the first author's "Mob families and mad families" of Con(b<a), which in particular removes some of the obstacles to generalising the argument to uncountable cardinals.

math.LO↗
arXiv2012

Bounding, splitting, and almost disjointness

We investigate some aspects of bounding, splitting, and almost disjointness. In particular, we investigate the relationship between the bounding number, the closed almost disjointness number, splitting number, and the existence of certain kinds of splitting families.

math.LO↗