Next Article in Journal
Applications Optimal Math Model to Solve Difficult Problems for Businesses Producing and Processing Agricultural Products in Vietnam
Next Article in Special Issue
Distinguished Property in Tensor Products and Weak* Dual Spaces
Previous Article in Journal
Analyzing Uncertain Dynamical Systems after State-Space Transformations into Cooperative Form: Verification of Control and Fault Diagnosis
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

On Factoring Groups into Thin Subsets

Department of Computer Science and Cybernetics, Taras Shevchenko National University of Kyiv, Academic Glushkov pr. 4d, 03680 Kyiv, Ukraine
Axioms 2021, 10(2), 89; https://doi.org/10.3390/axioms10020089
Submission received: 2 April 2021 / Revised: 13 May 2021 / Accepted: 13 May 2021 / Published: 14 May 2021

Abstract

:
A subset X of a group G is called thin if, for every finite subset F of G, there exists a finite subset H of G such that F x F y = , x F y F = for all distinct x , y X \ H . We prove that every countable topologizable group G can be factorized G = A B into thin subsets A , B .
MSC:
20F69; 54C65

1. Introduction

Let G be a group, and [ G ] < ω denote the set of all finite subsets of G. A subset X of is called:
  • left thin if, for every F [ G ] < ω , there exists H [ G ] < ω such that F x F y = for all distinct x , y X \ H ;
  • right thin if, for every F [ G ] < ω , there exists H [ G ] < ω such that x F y F = for all distinct x , y X \ H ;
  • thin if X is left and right thin.
The notion of left thin subsets was introduced in [1]. For motivation to study left thin, right thin and thin subsets and some results and references, see Comments and surveys [2,3,4,5]. In asymptology, thin subsets play the part of discrete subsets (see Comments 1 and 2).
We recall that the product A B of subsets A , B of a group G is a factorization if G = A B and each element g G has the unique representation g = a b , a A , b B (equivalently, the subsets { a B : a A } are pairwise disjoint). For factorizations of groups into subsets, see [6].
Our goal is to prove the following theorem. By a countable set, we mean a countably infinite set. The group topology τ is supposed to be Hausdorff.
Theorem 1.
Let ( G , τ ) be a non-discrete countable topological group. Then G can be factorized G = A B into thin subsets A , B .

2. Proof

Proof of Theorem 1.
Let G = { g n : n < ω } , g 0 = e , e is the identity of G, F n = { g i : i n } .
Given two sequences ( a n ) n < ω , ( b n ) n < ω in G, we denote
A n = { a i , a i 1 : i n } , B n = { b i : i n } , A = n < ω A n , B = n < ω B n .
We want to choose ( a n ) n < ω , ( b n ) n < ω so that A B is a factorization of G and A , B are thin.
Let X , Y be subsets of G. We say that X Y is a partial factorization of G if the subsets { X y : y Y } are pairwise disjoint (equivalently, the subsets { Y x : x X } are pairwise disjoint).
We put a 0 = e , b 0 = e and suppose that a 0 , , a n and b 0 , , b n have been chosen so that the following conditions are satisfied
( 1 ) A n B n is a partial factorization of G and g n A n B n ;
( 2 ) F i b i F j b j = , b i F i b j F j = for all distinct i , j { 0 , , n } ;
( 3 ) F i a i F j a j = , a i F i a j F j = , F i a i 1 F j a j 1 = , a i 1 F i a j 1 F j = and
F i a i 1 F j a j , a i 1 F i a j F j = for all distinct i , j { 0 , , n } ;
( 4 ) if a i a i 1 then F i a i F i a i 1 = , a i F i a i 1 F i = , i { 0 , , n } .
We take the first element g m G \ A n B n , put g = g m and show that there exists a symmetric neighborhood U of e such that
( 5 ) ( A n { x , x 1 } ) ( B n { x g } ) is a partial factorization for each x U \ { e } .
We choose a symmetric neighborhood V of e such that ( A n { x , x 1 } ) B n is a partial factorization of G for each x V \ { e } .
Then we use A n = A n 1 , g G \ A n B n and e A n B n to choose a symmetric neighborhood U of e such that U V and
( A n { x , x 1 } ) B n ( A n { x , x 1 } ) x g = ,
equivalently, A n B n A n x g = , A n B n { x , x 1 } x g = , { x , x 1 } B n A n x g = , { x , x 1 } B n { x , x 1 } x g = for each x U \ { e } , so we get ( 5 ) . By the continuity of the group operations, the latter is possible because these 4 equalities hold for x = e .
If the set { x U : x 2 = e } is infinite then we use ( 5 ) and choose a n + 1 U , a n + 1 = a n + 1 1 and b n + 1 = a n + 1 g to satisfy ( 1 ) ( 3 ) with n + 1 in place of n. Otherwise, we choose a n + 1 U , a n + 1 a n + 1 1 and b n + 1 = a n + 1 g to satisfy ( 1 ) ( 4 ) .
After ω steps, we get the desired factorization G = A B . □

3. Comments

1. Given a set X, a family E of subsets of X × X is called a coarse structure on X if
  • each E E contains the diagonal X : = { ( x , x ) : x X } of X;
  • if E, E E then E E E and E 1 E , where E E = { ( x , y ) : z ( ( x , z ) E , ( z , y ) E ) } , E 1 = { ( y , x ) : ( x , y ) E } ;
  • if E E and X E E then E E .
Elements E E of the coarse structure are called entourages on X.
For x X and E E the set E [ x ] : = { y X : ( x , y ) E } is called the ball of radius E centered at x. Since E = x X ( { x } × E [ x ] ) , the entourage E is uniquely determined by the family of balls { E [ x ] : x X } . A subfamily E E is called a base of the coarse structure E if each set E E is contained in some E E .
The pair ( X , E ) is called a coarse space [7] or a ballean [8,9].
A subset B of X is called bounded if B E [ x ] for some E E and x X . A subset Y of X is called discrete if, for every E E , there exists a bounded subset B such that E [ x ] E [ y ] = for all distinct x , y Y \ B .
2. Formally, coarse spaces can be considered as asymptotic counterparts of uniform topological spaces. However, actually, this notion is rooted in geometry, geometrical group theory and combinatorics (see [7,8,10,11]).
Given a group G, we denote by E l and E r the coarse structures on G with the bases
{ { ( x , y ) : x F y } : F [ G ] < ω , e F } , { { ( x , y ) : x y F } : F [ G ] < ω , e F }
and note that a subset A of G is left (resp. right) thin if and only if A is discrete in the coarse space ( G , E l ) (resp. ( G , E r ) ).
3. By [12], every countable group G has a thin subset A such that G = A A 1 . By [13], every countable topological group G has a closed discrete subset A such that G = A A 1 . For thin subsets of topological groups and factorizations into dense subsets, see [14,15].
4. Can every countable group G be factorized G = A B into infinite subsets A , B ? By Theorem 1, an answer to the following question could be negative only in the case of a non-topologizable group G.
On the other hand, analyzing the proof, one can see that Theorem 1 remains true if all mappings x x g , x g x , g G , x x 1 and x x 2 are continuous at e. By [16], every countable group G admits a non-discrete Hausdorff topology in which all shifts and the inversion x x 1 are continuous.

Funding

This research received no external funding.

Conflicts of Interest

The authors declare no conflict of interest.

References

  1. Chou, C. On the size of the set of left invariant means on a semigroup. Proc. Am. Math. Soc. 1969, 23, 199–205. [Google Scholar] [CrossRef]
  2. Protasov, I. Selective survey on subset combinatorics of groups. J. Math. Sci. 2011, 174, 486–514. [Google Scholar] [CrossRef] [Green Version]
  3. Protasov, I.; Protasova, K. Resent progress in subset combinatorics of groups. J. Math. Sci. 2018, 234, 49–60. [Google Scholar] [CrossRef] [Green Version]
  4. Protasov, I.; Slobodianiuk, S. Partitions of groups. Math. Stud. 2014, 42, 115–128. [Google Scholar]
  5. Banakh, T.; Protasov, I. Set-Theoretical Problems in Asymptology. Available online: https://arxiv.org/abs/2004.01979 (accessed on 7 May 2020).
  6. Szabo, S.; Sands, A. Factoring Groups into Subsets; CRS Press: Boca Raton, FL, USA, 2009. [Google Scholar]
  7. Roe, J. Lectures on Coarse Geometry; Univ. Lecture Ser., 31; American Mathematical Society: Providence, RI, USA, 2003. [Google Scholar]
  8. Protasov, I.; Banakh, T. Ball Structures and Colorings of Groups and Graphs; VNTL Publ.: Lviv, Ukraine, 2003. [Google Scholar]
  9. Protasov, I.; Zarichnyi, M. General Asymptology; VNTL: Lviv, Ukraine, 2007. [Google Scholar]
  10. De la Harpe, P. Topics in Geometrical Group Theory; University Chicago Press: Chicago, IL, USA, 2000. [Google Scholar]
  11. Cornulier, Y.; de la Harpe, P. Metric Geometry of Locally Compact Groups; EMS Tracts in Mathematics; European Mathematical Society: Zürich, Switzerland, 2016. [Google Scholar]
  12. Lutsenko, I. Thin systems of generators of groups. Algebra Discret. Math. 2010, 9, 108–114. [Google Scholar]
  13. Protasov, I. Generating countable groups by discrete subsets. Topol. Appl. 2016, 204, 253–255. [Google Scholar] [CrossRef] [Green Version]
  14. Protasov, I. Thin subsets of topological groups. Topol. Appl. 2013, 160, 1083–1087. [Google Scholar] [CrossRef]
  15. Protasov, I.; Slobodianiuk, S. A note on factoring groups into dense subsets. J. Group Theory 2017, 20, 33–38. [Google Scholar] [CrossRef]
  16. Zelenyuk, Y. On topologizing groups. J. Group Theory 2007, 10, 235–244. [Google Scholar] [CrossRef]
Publisher’s Note: MDPI stays neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Share and Cite

MDPI and ACS Style

Protasov, I. On Factoring Groups into Thin Subsets. Axioms 2021, 10, 89. https://doi.org/10.3390/axioms10020089

AMA Style

Protasov I. On Factoring Groups into Thin Subsets. Axioms. 2021; 10(2):89. https://doi.org/10.3390/axioms10020089

Chicago/Turabian Style

Protasov, Igor. 2021. "On Factoring Groups into Thin Subsets" Axioms 10, no. 2: 89. https://doi.org/10.3390/axioms10020089

APA Style

Protasov, I. (2021). On Factoring Groups into Thin Subsets. Axioms, 10(2), 89. https://doi.org/10.3390/axioms10020089

Note that from the first issue of 2016, this journal uses article numbers instead of page numbers. See further details here.

Article Metrics

Back to TopTop