Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · math/9602204

Narrow coverings of omega-product spaces

Randall Dougherty
View original source ↗Read source document ↗Export metadata ↓

Abstract

Results of Sierpinski and others have shown that certain finite-dimensional product sets can be written as unions of subsets, each of which is "narrow" in a corresponding direction; that is, each line in that direction intersects the subset in a small set. For example, if the set (omega \times omega) is partitioned into two pieces along the diagonal, then one piece meets every horizontal line in a finite set, and the other piece meets each vertical line in a finite set. Such partitions or coverings can exist only when the sets forming the product are of limited size. This paper considers such coverings for products of infinitely many sets (usually a product of omega copies of the same cardinal kappa). In this case, a covering of the product by narrow sets, one for each coordinate direction, will exist no matter how large the factor sets are. But if one restricts the sets used in the covering (for instance, requiring them to be Borel in a product topology), then the existence of narrow coverings is related to a number of large cardinal properties: partition cardinals, the free subset problem, nonregular ultrafilters, and so on. One result given here is a relative consistency proof for a hypothesis used by S. Mrowka to construct a counterexample in the dimension theory of metric spaces.

Explore related subjects

math.LO

Keep this discovery

BibTeXRIS

Randall Dougherty. 1996-02-20. Narrow coverings of omega-product spaces. https://doi.org/10.1016/s0168-0072(97)00013-4

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

KEEP EXPLORING

Related papers

arXiv2026

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↗
arXiv2026

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↗
arXiv2026

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↗