Kourovka Notebook Problem 21.107
Status Open · unsolvedmath.comLLM status Open unverified
Top Open Problems Not reported cataloguedOpenOpenStatement
Definitions and mathematical statement
A topological group is a group $G$ equipped with a topology for which multiplication $G\times G\to G$ and inversion $G\to G$ are continuous. A subset $D\subseteq G$ is dense if its closure is $G$, equivalently if it intersects every nonempty open subset of $G$.Assume the underlying set of $G$ is countable and admits a partition into countably infinitely many dense subsets: \[ G=\bigcup_{j\ge1}D_j,\qquad D_i\cap D_j=\varnothing\ (i\ne j), \qquad\overline{D_j}=G\ (j\ge1). \] Is there a sequence $(F_n)_{n\ge1}$ of pairwise disjoint finite subsets of $G$ such that for every nonempty open set $U\subseteq G$, \[ \exists m=m(U)\quad\forall n>m:\quad F_n\cap U\ne\varnothing? \] Such a sequence is called expansive in the problem. The finite sets need not have equal sizes, and no bound on their sizes is requested.
The threshold may depend on the open set. Requiring intersection for every sufficiently large $n$ is stronger than requiring only that $\bigcup_nF_n$ be dense. The $F_n$ need not themselves partition $G$ and are not required to lie in the particular dense parts $D_j$. The countability assumption concerns the group itself, not a topological basis. The qualifier "nonempty" makes explicit the intended open-set convention, since no subset can intersect the empty open set.
Short English statement
Does every countable topological group partitionable into infinitely many dense subsets admit disjoint finite sets that eventually meet each nonempty open set?Sources
- S1 ULAM.AI and the UnsolvedMath Contributors, supplied problems.json, record 2616 (KOU-21.107), Kourovka Notebook - New Problems, Issue 21. Catalogue identity and source transcription; CC BY 4.0. https://huggingface.co/datasets/ulamai/UnsolvedMath.
- S2 The Kourovka Notebook, 21st edition, new problems, Problem 21.107. Expanded formulation of the supplied catalogue statement. https://arxiv.org/pdf/1401.0300v47.
Statement licence: CC-BY-4.0 · Source file
Contributions 0
No attempts yet. Significant partial results and substantial reductions are welcome. Contribute an attempt.