SearcharxivSearch

arXiv · 1508.02053

Set-theoretical problems concerning Hausdorff measures

Abstract

J. Zapletal asked if all the forcing notions considered in his monograph are homogeneous. Specifically, he asked if the forcing consisting of Borel sets of $\sigma$-finite 2-dimensional Hausdorff measure in $\mathbb{R}^3$ (ordered under inclusion) is homogeneous. We give a partial negative answer to both questions by showing that this $\sigma$-ideal is not homogeneous. Let $\mathcal{N}^1_2$ be the $\sigma$-ideal of sets in the plane of 1-dimensional Hausdorff measure zero. D. H. Fremlin determined the position of the cardinal invariants of this $\sigma$-ideal in the Cicho\'n Diagram. This required proving numerous inequalities, and in all but three cases it was known that the inequalities can be strict in certain models. For one of the remaining ones Fremlin posed this as an open question in his monograph. We answer this by showing that consistently $\mathrm{cov}(\mathcal{N}^1_2) > \mathrm{cov}(\mathcal{N})$, where $\mathcal{N}$ is the usual Lebesgue null ideal. We also prove that the remaining two inequalities can be strict. Moreover, we fit the cardinal invariants of the $\sigma$-ideal of sets of $\sigma$-finite Hausdorff measure into the diagram. P. Humke and M. Laczkovich raised the following question. Is it consistent that there is an ordering of the reals in which all proper initial segments are Lebesgue null but for every ordering of the reals there is a proper initial segment that is not null with respect to the $1/2$-dimensional Hausdorff measure? We determine the values of the cardinal invariants of the Cicho\'n Diagram as well as the invariants of the nullsets of Hausdorff measures in the first model mentioned in the previous paragraph, and as an application we answer this question of Humke and Laczkovich affirmatively.

Explore related subjects

Keep this discovery

BibTeXRIS

Márton Elekes, Juris Steprāns. 2015-08-09. Set-theoretical problems concerning Hausdorff measures. https://arxiv.org/abs/1508.02053

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

There is no maximal $K$-degree

The Kolmogorov complexity of a string characterize how complex it is to describe the string. If every prefix of a real $x$ is more complex to describe than every prefix (of the same length) of real $y$, then it is seen as $x$ is more complex to describe than $y$. It is wondered if there is a real $x$ so that no other reals are strictly more complex (to describe) than $x$. The behavior of Kolmogorov complexity functions generated by reals (namely $n\mapsto$ the minimal description length of the real) is quite chaos. Therefore, it is widely believed that there are many reals that are maximally complex to describe. For instance, it is conjectured that all random enough reals have maximal $K$-degree. In this paper, it is shown that there is no real with maximal $K$-degree. Actually, for almost all real $x$, we can uniformly computably find another real whose $K$-degree is strictly above $x$.

math.LO

Quadruples and cubes

We prove, in $\mathsf{ZFC}$, that the $\lambda$-terraced cube relation fails whenever $\lambda$ is an uncountable cardinal. The corresponding terraced relation for quadruples fails for every $\lambda$. If $\lambda$ is $\aleph_0$ then the pretinent terraced relation has consistency strength of at least one Woodin cardinal. We prove positive polarized relations at a successor and a double successor from wondrous ideals. We show, however, that there are no such ideals over two consecutive cardinals simultaneously.

math.LO

Possibilistic Logic over a Logic of Formal Inconsistency

In this article, we have introduced a new possibilistic logic on a logic of formal inconsistency with the aim of developing a possibility theoretic framework to deal with uncertainty and inconsistency meaningfully without leading to a system collapse. We have discussed the syntax and semantics for this logic and have proved the soundness and completeness theorems. A set of new measures of consistency, contradictoriness, and triviality of a set of formulas have been defined. These have then been put to use in an example to show that this framework can provide better means of machine reasoning.

math.LO