SearcharxivSearch

arXiv · 1305.5234

Countable subgroups of Euclidean Space

Abstract

In his PhD Thesis Konstantinos Beros proved a number of results about compactly generated subgroups of Polish groups. Such a group is K-sigma - the countable union of compact sets. He notes that the group of rationals under addition with the discrete topology is an example of a Polish group which is K-sigma (since it is countable) but not compactly generated. Beros showed that for any Polish group G, every K-sigma subgroup of G is compactly generated iff every countable subgroup of G is compactly generated. Beros showed that any K-sigma subgroup of Z^omega (infinite product of the integers) is compactly generated and more generally, for any Polish group G, if every countable subgroup of G is finitely generated, then every countable subgroup of G^omega is compactly generated. In unpublished work Beros asked whether finitely generated may be replaced by compactly generated in his theorem. He conjectured that the reals R under addition might be an example such that every countable subgroup of R is compactly generated but not every countable subgroup of R^omega is compactly generated. We prove that this is not true. The general question remains open. In the course of our proof we came up with some interesting countable subgroups. We show that there is a dense subgroup of the plane which meets every line in a discrete set. Furthermore, for each n there is a dense subgroup of Euclidean space R^n which meets every (n-1)-dimensional subspace in a discrete set. Similarly there is a dense subgroup of R^omega which meets every finite dimensional subspace of R^omega in a discrete set.

Explore related subjects

Keep this discovery

BibTeXRIS

Arnold W. Miller. 2013-05-22. Countable subgroups of Euclidean Space. https://arxiv.org/abs/1305.5234

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