SearcharxivSearch

arXiv · 1109.5308

Covering locally compact groups by less than $2^\om$ many translates of a compact nullset

Abstract

Gruenhage asked if it was possible to cover the real line by less than continuum many translates of a compact nullset. Under the Continuum Hypothesis the answer is obviously negative. Elekes and Steprāns gave an affirmative answer by showing that if $C_{EK}$ is the well known compact nullset considered first by Erd\H os and Kakutani then $\RR$ can be covered by $\cof(\iN)$ many translates of $C_{EK}$. As this set has no analogue in more general groups, it was posed as an open question whether such a result holds for uncountable locally compact Polish groups. In this paper we give an affirmative answer in the abelian case. More precisely, we show that if $G$ is a nondiscrete locally compact abelian group in which every open subgroup is of index at most $\cof(\iN)$ then there exists a compact set $C$ of Haar measure zero such that $G$ can be covered by $\cof(\iN)$ many translates of $C$. This result, which is optimal in a sense, covers the cases of uncountable compact abelian groups and of nondiscrete separable locally compact abelian groups. We use Pontryagin's duality theory to reduce the problem to three special cases; the circle group, countable products of finite discrete abelian groups, and the groups of $p$-adic integers, and then we solve the problem on these three groups separately. In addition, using representation theory, we reduce the nonabelian case to the classes of Lie groups and profinite groups, and we also settle the problem for Lie groups. We remark that M.~Abért recently gave an affirmative answer for profinite groups.

Explore related subjects

Keep this discovery

BibTeXRIS

Márton Elekes, Árpád Tóth. 2011-09-24. Covering locally compact groups by less than $2^\om$ many translates of a compact nullset. https://arxiv.org/abs/1109.5308

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