Next Article in Journal
Fixed Point Theorems for Geraghty Contraction Type Mappings in b-Metric Spaces and Applications
Previous Article in Journal
A Quantum Adiabatic Algorithm for Multiobjective Combinatorial Optimization
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Functional Boundedness of Balleans: Coarse Versions of Compactness

1
Faculty of Mechanics and Mathematics, Ivan Franko National University of Lviv, Universytetska, 79000 Lviv, Ukraine
2
Institute of Mathematics, Jan Kochanowski University, Świȩtokrzyska 15, 25-406 Kielce, Poland
3
Faculty of Cybernetics, Taras Shevchenko National University, Glushkov avenue 4d, 03680 Kyiv, Ukraine
*
Author to whom correspondence should be addressed.
Axioms 2019, 8(1), 33; https://doi.org/10.3390/axioms8010033
Submission received: 9 February 2019 / Revised: 6 March 2019 / Accepted: 8 March 2019 / Published: 14 March 2019

Abstract

:
We survey some results and pose some open problems related to boundedness of real-valued functions on balleans and coarse spaces. Special attention is paid to balleans on groups. The boundedness of functions that respect the coarse structure of a ballean could be considered as a coarse counterpart of pseudo-compactness.

1. Introduction

In this paper, we consider various classes of real-valued functions (bornologous, macro-uniform, eventually macro- uniform, boundedly oscillating, slowly oscilllating) that respect the coarse structure of a ballean and study balleans on which every such function is bounded on the complement of some bounded set. The boundedness of functions with respect to the coarse structure of a ballean could be considered as a coarse counterpart of compactness (which is a very important notion in Topology).
Balleans are sets endowed with the ball structure. Ball structures are bases of coarse structures. Coarse structures play an important role in Geometric Theory of Groups (see ([1], Chapter 3) and ([2], Chapter 4)), where groups G are studied as balleans endowed with the finitary ball structure E = { E F : F [ G ] < ω } where E F = { ( x , y ) G × G : y { x } F x } for a finite subset F of G. The finitary ballean of a group G is a partial case of the κ -ballean where κ is an infinite cardinal. The κ -ballean of a group G consists of entourages E F = { ( x , y ) G × G : y { x } F x } parametrized by subsets F G of cardinality | F | < κ .
Various types of real-valued functions that respect the coarse structure, play an important role in studying balleans and coarse spaces. In particular, macro-uniform maps are natural morphisms between balleans; slowly oscillating functions are used to define the Higson compactification and the Higson corona of a ballean, see [3,4], ([5], Chapter 8), [6], §2.9. Many properties of the coarse structure of a ballean reflect in the topological properties of its Higson corona.
Section 2 is of preliminary character and contains the definitions of various types of real-valued functions on balleans, as well as the corresponding notions of boundedness of balleans.
In Section 3, we study various real-valued functions on discrete balleans and show (in Proposition 3) that a ballean X is discrete if and only if (iff) every real-valued function on X is slowly oscillating. Moreover, if no measurable cardinal exists, then ballean X is discrete iff every real-valued function on X is boundedly oscillating iff every real-valued function on X is eventially macro-uniform. In Proposition 4, we characterize discrete balleans on which every slowly oscillating real-valued function is bounded on the complement of some bounded set (such balleans are called so-bounded).
In Section 4, we put and discuss some open problems on the behavior of functional boundedness under products.
In Section 5, we study the boundedness properties of κ -balleans of groups. In Theorem 3, we prove that the | G | -ballean of infinite group G of regular cardinality is not so-bounded, which meant that G admitts a slowly oscillating function f : G R , which is unbounded on the complement G \ F of any subset F G of cardinality | F | < | G | . For groups of singular cardinality, the situation depends on the algebraic properties of the group. If a group G is free, then its | G | -ballean is not so-bounded (see Theorem 4). On the other hand, the | G | -ballean of any Abelian group G of singular cardinality is emu-bounded and hence so-bounded (see Theorem 7). Moreover, for any cardinal κ < | G | of uncountable cofinality, the κ -ballean of an Abelian group G is emu-bounded and so-bounded. This implies that for any Abelian group G of cardinality continuum (for example, G = R ), the ω 1 -ballean of G is so-bounded iff ω 1 < c (i.e., if the Continuum Hypothesis fails).
In Section 5, we also characterize groups whose finitary ballean is mu-bounded and show that such groups are tightly related with Bergman and (almost) Shelah groups, studied by Bergman [7] and Shelah [8].
In spite of the obtained results, many interesting problems related to the boundedness of real-valued functions on coarse spaces remain open. Such problems are formulated in the corresponding sections of the paper.

2. Preliminaries

A ballean is a pair ( X , E X ) consisting of a set X and a family E X of subsets of the square X × X satisfying the following three axioms:
  • Each E E X contains the diagonal Δ X = { ( x , x ) : x X } of X.
  • for any E , F E X there exists D E X , such that E F 1 D , where
    E F : = { ( x , z ) : y ( x , y ) E , ( y , z ) F } and F 1 : = { ( y , x ) : ( x , y ) F } .
  • E X = X × X .
The family E X is called the ball structure of the ballean ( X , E X ) , and its elements are called entourages. For each entourage E E X and point x X , we could consider the set E [ x ] : = { y X : ( x , y ) E } , called the ball of radius E, centered at x. For a subset A X , the set E [ A ] : = a A E [ a ] is called the E-neighborhood of A. Since E = x X { x } × E [ x ] , the entourage E can be recovered from the family of balls E [ x ] , x X .
For a ballean ( X , E X ) and a subset Y X , the ballean ( Y , E X Y ) is called a subballean of X when endowed with the following ball structure:
E X Y : = { ( Y × Y ) E : E E X } .
Any metric space ( X , d ) carries a natural ball structure { E ε : ε > 0 } consisting of the entourages E ε : = { ( x , y ) X × X : d ( x , y ) < ε } .
A ballean ( X , E X ) is called a coarse space if for any entourage E E X , any subset F E with Δ X F belongs to E X . In this case, E X is called the coarse structure of X. For a coarse structure E , a subfamily B E is called a base of E if each set E E is contained in some set B B . It is easy to see that each base of a coarse structure is a ball structure. On the other hand, each ball structure E on a set X is a base of the unique coarse structure:
E : = { E X × X : Δ X E F for   some F E } .
If the ball (or coarse) structure E X is clear from the context, we shall write X instead of ( X , E X ) . More information on balleans and coarse spaces can be found in [1,5,6,9,10,11].
A subset B X of a ballean ( X , E X ) is called bounded if B E [ x ] for some E E X and x X . A ballean X is bounded if X is a bounded set in ( X , E X ) .
The family B X of all bounded subsets is called the bornology of the ballean ( X , E X ) . If the ballean X is unbounded, then the bornology B X is an ideal of subsets of X. A family I of subsets of a set X is called an ideal on X if I is closed under finite unions and taking subsets, and X I .
A real-valued function f : X R on a ballean X is called:
  • bornologous if f ( B ) is bounded for each B B X ;
  • macro-uniform (or a mu-function) if for every E E X there exists a real number C such that diam f ( E [ x ] ) < C for every x X ;
  • eventually macro-uniform (or an emu-function) if for every E E X there exists a bounded set B B X and a real number C such that diam f ( E [ x ] ) < C for every x X \ B ;
  • boundedly oscillating (or a bo-function) if there exists a real number C such that for every E E X there is B B X such that diam f ( E [ x ] ) < C for each x X \ B ;
  • slowly oscillating (or a so-function) if for every E E X and ε > 0 , there exists B B X such that diam f ( E [ x ] ) < ε for each x X \ B ; and
  • constant at infinity if for every ε > 0 there exists a bounded set B B X such that diam f ( X \ B ) < ε .
Here, for a subset A of the real line, we put diam A = sup ( { 0 } { | x y | : x , y A } ) . We say that a ballean X is:
  • b-bounded if every bornologous function f : X R is bounded;
  • mu-bounded if every mu-function f : X R is bounded;
  • emu-bounded if for every emu-function f : X R there exists B B X such that f is bounded on X \ B ;
  • bo-bounded if for every bo-function f : X R there exists B B X such that f is bounded on X \ B ;
  • so-bounded (or pseudobounded) if for every so-function f : X R there exists B B X such that f is bounded on X \ B .
For any ballean X, we would have the following implications:
b - bounded mu - bounded emu - bounded bo - bounded so - bounded .
If a ballean X is unbounded and E X has a linearly ordered base, then X is b-unbounded iff X is mu-unbounded iff E X has a countable base.
We say that a ballean X is locally finite if B X = [ X ] < ω , equivalently, each ball in X is finite. Here, for a set X and a cardinal κ by [ X ] < κ , we denote the family of subsets A X of cardinality | A | < κ .
A locally finite ballean X is emu-bounded iff X is mu-bounded. If a locally finite ballean X is bo-bounded (so-bounded), then every bo-function (so-function) on X is bounded.
Example 1.
Let κ , μ be infinite cardinals such that κ μ . We denote by S κ the group of all permutations of κ and, for each F [ S κ ] < μ , put E F = { ( x , y ) κ × κ : y { x } { f ( x ) } f F } . Then the family { E F : F [ S κ ] < μ } forms a base for some coarse structure E on κ . We denote the ballean ( κ , E ) by B κ , μ and observe that a subset B κ is bounded iff | B | < μ .
We show that B κ , μ is emu-bounded (and hence mu-bounded).
First, we check that B κ , μ is mu-bounded. Given any unbounded function f : κ R , we shall prove that f is not macro-uniform. We choose a sequence ( x n ) n ω in κ such that | f ( x n + 1 ) f ( x n ) | > n and define a bijection h : κ κ by the rule h ( x 2 n ) = x 2 n + 1 , h ( x 2 n + 1 ) = x 2 n and h ( x ) = x for all x X \ { x n : n ω } . Then diam f ( E { h } [ x n ] ) > n , which means that f is not macro-unifiorm.
Next, we show that the ballean B κ , μ is emu-bounded. Given an eventually macro-uniform function f : κ R , we should find a set B κ of cardinality | B | < μ such that the set f ( κ \ B ) is bounded. If μ = ω , then the eventually macro-uniform function f is macro-uniform and f is bounded by the mu-boundedness of B κ , μ . So, we assume that the cardinal μ is uncountable.
To derive a contradiction, assume that for any subset B κ of cardinality | B | < μ , the set f ( κ \ B ) is unbounded. By transfinite induction, for every ordinal α < μ , we can construct a sequence { x α , n } n ω κ such that | f ( x α , n + 1 ) f ( x α , n ) | > n and x α , n { x β , m : β < α , m ω } for every n ω . Consider a permutation h S κ such that h ( x α , 2 n ) = x α , 2 n + 1 , h ( x α , 2 n + 1 ) = x α , 2 n for all α < μ and n ω . Since the sets { x α , n } n ω , α < μ , are pairwise disjoint, for any set B κ of cardinality | B | < μ there exists an ordinal α < μ such that B { x α , n } n ω = . Then diam f ( E { h } [ x α , 2 n ] ) diam { f ( x α , 2 n + 1 ) , f ( x α , 2 n ) } > 2 n , which means that f is not eventually macro-uniform. But this contradicts the choice of f. This contradiction implies that for some set B κ of cardinality | B | < μ the set f ( κ \ B ) is bounded.
Let ( X , E ) , ( X , E ) be balleans. A mapping f : X X is called macro-uniform if for every E E there is E E such that f ( E [ x ] ) E [ f ( x ) ] for all x X . A bijection f : X X is called an asymorphism if f , f 1 are macro-uniform. The balleans ( X , E ) , ( X , E ) are called coarsely equivalent if there exists a large subset Y X , Y X such that the balleans ( Y , E Y ) and ( Y , E Y ) are asymorphic. A subset Y is called large if X = E [ Y ] for some E E .
It can be shown that all the notions of boundedness, as defined above, are stable under coarse equivalences.
By a bornology on a set X, we understand any family B of subsets of X such that B = X and B is closed under finite unions and taking subsets. In particular, for any infinite cardinal κ , the family
[ X ] < κ : = { A X : | A | < κ }
is a bornology on X.
A bornology B on a set X is called tall if every infinite subset of X has an infinite bounded subset. A bornology B is tall iff every bornologous function on X is bounded. Hence, a ballean X is b-bounded iff its bornology B X is tall.
A bornology B on X is called antitall if every unbounded subset of X contains an unbounded subset Y such that all bounded subsets of Y are finite. A bornology B is antitall iff for every unbounded subset Y of X there is a bornologous function on X such that f is unbounded on Y.
By Proposition 1 in [12], each bornology is the intersection of tall and antitall bornologies.

3. Discrete Balleans

A ballean X is discrete if X is not bounded and for any E E X there exists a bounded set B X such that E [ x ] = { x } for all x X \ B . More information on discrete balleans can be found in ([5], Chapter 3).
Example 2.
Let X be a discrete ballean with bornology that coincides with the family [ X ] ω of at most countable sets on an uncountable set X. The ballean X is mu-bounded, but each function f : X R is slowly oscillating and hence eventually macro-uniform. So, X is not emu-bounded and not so-bounded.
Since each macro-uniform function is eventually macro-uniform, each emu-bounded ballean is mu-bounded. Example 2 shows that the converse implication does not hold, even for discrete balleans.
Proposition 1.
For a ballean X, the following statements are equivalent:
1. 
Every function f : X R is macro-uniform.
2. 
X is discrete and B X = [ X ] < ω .
Proof. 
( 2 ) ( 1 ) is evident. To verify ( 1 ) ( 2 ) , assume that each real-valued function on X is macro-uniform. In this case, B X = [ X ] < ω . To derive a contradiction, assume that X is not discrete. Then there exists E E X and a sequence ( x n ) n ω in X such that the subsets { E [ x n ] : n ω } are pairwise disjoint and | E [ x n ] | > 1 for all n ω . Then the function f : X R defined by f ( x n ) = n and f ( x ) = 0 for x { x n : n ω } is not macro-uniform, which contradicts our assumption. □
The following characterization can be easily derived from the definitions.
Proposition 2.
For a discrete ballean X, the following conditions are equivalent:
1. 
X is b-bounded.
2. 
X is mu-bounded.
3. 
The bornology of X is tall.
A characterization of emu-bounded discrete balleans is more complicated and involves countably complete ultrafilters.
A filter F on a set X is called countably-complete if for any countable subfamily C F the intersection C belongs to the filter F .
A cardinal κ is measurable if there exists a countably complete free ultrafilter U on κ . A measurable cardinal, if it exists, is not smaller than the first strongly inaccessible cardinal, see ([13], Chapter 20). This implies that the existence of measurable cardinals cannot be proved in Zermelo-Fraenkel set theory (ZFC).
Proposition 3.
For a ballean X, the following statements are equivalent:
1. 
Every function f : X R is slowly oscillating.
2. 
Every function f : X { 0 , 1 } is slowly oscillating.
3. 
X is discrete.
If any unbounded subset of X contains an unbounded set of non-measurable cardinality, then conditions(1)–(3)are equivalent to:
4. 
Every function f : X R is boundedly oscillating.
5. 
Every function f : X R is eventually macro-uniform.
In particular, conditions(1)–(5)are equivalent if no measurable cardinal exists.
Proof. 
The equivalence of conditions (1)–(3) has been proven in Theorem 3.3.1 of [5], and the implications ( 1 ) ( 4 ) ( 5 ) are trivial. Now, assuming that any unbounded subset of X contains an unbounded set of non-measurable cardinality, we shall prove that ( 5 ) ( 3 ) (which is equivalent to ¬ ( 3 ) ¬ ( 5 ) ). Assume that X is not discrete. Then there exists an entourage E E X such that the set L = { x X : E [ x ] { x } } is unbounded. Using Zorn’s Lemma, find a maximal subset M L such that E [ x ] E [ y ] = for any distinct elements x , y M . The maximality of M ensures that L E 1 [ E [ M ] ] , which implies that the set M is unbounded. By our assumption, the unbounded set M contains an unbounded subset N M of non-measurable cardinality | N | . Using the Zorn’s Lemma, extend the free filter { N \ B : B B X } to any (free) ultrafilter U . Since N U and the cardinal | N | are not measurable, the ultrafilter U is not countably-complete, so there exists a decreasing sequence of subsets { U n } n ω U of N such that n ω U n U . Consider the function f : X R assigning to each x X the number:
f ( x ) = n if   x U n \ U n + 1 for   some   n ω ; 0 otherwise .
Assuming that f is eventually macro-uniform, we could find a bounded set B X such that C : = sup x X \ B diam f ( E [ x ] ) < . Choose any number n ω with n > C . It follows from U n \ B = U n ( X \ B ) U and m ω U m U that U n \ B m ω U m and hence U n \ B U m for some m ω . So, we can find a point x U n \ B such that x U m . It follows that x U k \ U k + 1 for some k [ n , m ) and hence diam f ( E [ x ] ) diam { f ( x ) , 0 } = k n > C , which contradicts the definition of C. This contradiction shows that the function f is not eventually macro-uniform, which means that condition (5) does not hold. □
Example 3.
Let X be a set of measurable cardinality | X | . We define a coarse structure E on X such that ( X , E ) is not discrete but each function f : X R is eventually macro-uniform. Write X as the union X = Y Z of two disjoint sets of the same cardinality and fix any bijection h : Y Z . Let Γ : = { ( x , h ( x ) ) : x Y } be the graph of the bijection h.
By the measurability of the cardinal | X | = | Y | , there exists a countably complete ultrafilter p on Y. For any set P p , consider the subset:
B P : = ( Y \ P ) h ( Y \ P )
of X and the entourage:
E P : = ( B P × B P ) Δ X Γ Γ 1
on X. Let E be the coarse structure on X, generated by the base { E P : P p } . It is easy to check that the bornology of the coarse space ( X , E ) is generated by the base { B P : P p } . Using this fact and looking at the definition of the basic entourages E P , we can conclude that the ballean ( X , E X ) is not discrete.
Now we check that each function f : X R is eventually macro-uniform. Given any set P p , we should find a bounded set B B X such that sup x X \ B diam f ( E P [ x ] ) < . Observe that for any x P = Y \ B P we get E P [ x ] = { x , h ( x ) } = E P [ h ( x ) ] . This implies that diam f ( E P [ x ] ) < and hence P = n ω P n where P n = { x P : diam f ( E P [ x ] ) n } for n ω . Since the ultrafilter p is countably complete, there exists n ω such that P n p . Then for the bounded set B = B P n and any x X \ B we get diam f ( E P [ x ] ) n . Indeed, if x Y , then x Y \ B P n = P n and hence diam f ( E P [ x ] ) = diam { x , h ( x ) } n by the definition of P n . If x Z , then x Z \ B P n = h ( P n ) and then h 1 ( x ) P n and E P [ x ] = { x , h 1 ( x ) } = E P [ h 1 ( x ) ] and diam f ( E P [ x ] ) = diam f ( E P [ h 1 ( x ) ] ) n .
Given a ballean X, we denote by X the set of all ultrafilters p on X such that each member of p is unbounded in X. It is easy to see that the set X is closed in the Stone–Čech extension β X of X endowed with the discrete topology.
Proposition 4.
For a discrete ballean X, the following statements are equivalent:
1. 
X is emu-bounded.
2. 
X is bo-bounded.
3. 
X is so-bounded.
4. 
X is finite and each ultrafilter p X is countably complete.
5. 
each ultrafilter p X is countably complete.
Proof. 
The implication ( 3 ) ( 4 ) is proven in Theorem 3.3.2 of [5], and ( 1 ) ( 2 ) ( 3 ) are evident.
( 4 ) ( 1 ) Assume that X is finite and each ultrafilter p X is countably complete. To show that X is emu-bounded, take any eventually macro-uniform function f : X R . Let X = { p 1 , , p k } and observe that i = 1 k p k = { X \ B : B B X } where B X is the bornology of the ballean X. For every n ω consider the set X n = { x X : | f ( x ) | n } and observe that X = n ω X n . For every i k , the countable completeness of the ultrafilter p i n ω X n yields a number n i ω such that X n i p i . Then for the number n = max i k n i , we obtain X n i = 1 k p i = { X \ B : B B X } . Therefore, the complement B : = X \ X n is bounded and f ( X \ B ) = f ( X n ) [ n , n ] is bounded in the real line.
The implication ( 4 ) ( 5 ) is trivial. To prove that ( 5 ) ( 4 ) , assume that the set X is infinite and hence contains a sequence ( p n ) n ω of pairwise distinct ultrafilters. Since X is a closed subspace of the compact Hausdorff space β X , we can replace ( p n ) n ω by a suitable subsequence and assume that the subspace { p n } n ω is discrete in X . Fix any free ultrafilter U on the set ω and consider the ultrafilter p = lim n U p n , consisting of the sets n U P n where U U and P n p n for all n U . Since the set X is closed in β X , the ultrafilter p belongs to the set X , being an accumulation point of the set { p n : n ω } in β X . We claim that the ultrafilter p is not countably complete. Using the discreteness of the subspace { p n } n ω in X , in each ultrafilter p n we can choose a set P n so that the family ( P n ) n ω is disjoint. Now observe that for every n ω the set Q n = m n P m belongs to the ultrafilter p but n ω Q n = , witnessing that p is not countably complete. □
A discrete ballean X is called ultradiscrete if the family { X \ B : B B X } is an ultrafilter on X. Proposition 4 implies the following characterization.
Corollary 1.
For an ultradiscrete ballean X, the following statements are equivalent:
1. 
X is emu-bounded.
2. 
X is bo-bounded.
3. 
X is so-bounded.
4. 
The bornology B X of X is σ-additive.

4. Products

In this section, we discuss the problem of preservation of various notions of boundedness by products of balleans.
Theorem 1.
The product X × Y of two mu-bounded balleans X , Y is mu-bounded.
Proof. 
Let f : X × Y R be a mu-function. For each x X , the function f x : Y R , defined as f x ( y ) = f ( x , y ) , is a mu-function, so f x is bounded. It is easy to check that the function s : X R , s : x sup { | f x ( y ) | : y Y } is macro-uniform and hence bounded (as X is mu-bounded). Then the function f is bounded, as well. □
Theorem 2.
Let X , Y be balleans and Y is either bounded or locally finite. If X , Y are either emu-bounded or bo-bounded or so-bounded, then the product X × Y has the same property.
Proof. 
We proved only the third statement. Assume that the balleans X , Y are so-bounded. Take any so-function f : X × Y R . Assume that Y is bounded, fix any y 0 Y and consider the so-function f y 0 : X R , f y 0 : x f ( x , y 0 ) . Since X is so-bounded, there exists a bounded set B X such that f y 0 is bounded on X \ B . Since Y is bounded and f is slowly oscillating, we can replace B by a larger bounded set, and assume that the number c : = sup x X \ B diam f ( { x } × Y ) is finite. Then f is bounded on ( X × Y ) \ ( B × Y ) .
Now assume that Y is locally finite. In this case, for every x X the so-function f x : Y R , f x : y f ( x , y ) , is bounded. Then the function s : X R , s : x sup y Y | f x ( y ) | , is well-defined and slowly oscillating. Since X is so-bounded, there is B B X such s is bounded on X \ B . Then f is bounded on ( X × Y ) \ ( B × Y ) . By first case, there is a bounded subset C of Y such f is bounded on ( B × Y ) \ ( B × C ) . □
Question 1.
Is the product of any two emu-bounded balleans emu-bounded?
Question 2.
Is the product of any two bo-bounded balleans bo-bounded?
Question 3.
Is the product of any two so-bounded balleans so-bounded?
For more results on products of balleans, see [14]. Now, we give some partial answers to Questions 1–3.
For any bornology B on a set X B , consider the cardinal characteristics:
add ( B ) = min { | A | : A B , A B } , non ( B ) = min { | A | : A X , A B } , cov ( B ) = min { | A | : A B , A = X } , cof ( B ) = min { | A | : A B , B B A A ( B A ) }
It is known (and easy to see) that:
add ( B ) min { cov ( B ) , non ( B ) } max { cov ( B ) , non ( B ) } cof ( B ) .
Proposition 5.
Let X , Y be two balleans with cof ( B X ) < non ( B Y ) . If X and Y are emu-bounded (bo-bounded or so-bounded, respectively), then so is the product X × Y .
Proof. 
We shall present a proof only for the case of emu-boundedness. The other two cases can be considered by analogy. Assume that the balleans X , Y are emu-bounded. If the ballean X is bounded, then the product X × Y is emu-bounded by Theorem 2. So we assume that X is unbounded. By the definition of the cardinal κ = cof ( B X ) , the bornology B X of X has a base B B X of cardinality | B | = κ .
To prove that the product X × Y is emu-bounded, take any emu-function f : X × Y R . Fix any point y 0 Y . Since the function f y 0 : X R , f y 0 : x f ( x , y 0 ) , is emu-bounded, for any entourage E E Y there exists a bounded set B E B such that:
c E : = sup x X \ B E diam f ( { x } × E [ y 0 ] )
is finite. We claim that for some B B and m N , the union
U B , m : = { E [ y 0 ] : E E Y , B E = B , c E m }
equals Y. To derive a contradiction, assume that for every B B and m N the union U B , m does not contain some point y B , m Y . Since ω κ < non ( B Y ) , the set V = { y B , m : B B , m N } is bounded in Y and hence is contained in the ball E [ y 0 ] for some E E Y . Then for the set B = B E and any number m N with m c E , we get y B , m E [ y 0 ] U B , m , which contradicts the choice of y B , m . This contradiction shows that U B , m = Y for some B B and m N .
Then diam f ( { x } × Y ) 2 m for each x X \ B . Since X is emu-bounded, there exists D B X such that the number c : = sup x X \ D | f ( x , y 0 ) | is finite. Replacing D by B D , we can assume that B D . Then | f ( x , y ) | < c + 2 m for all ( x , y ) ( X \ D ) × Y . By Theorem 2, the ballean D × Y is emu-bounded, which implies that the function f is bounded on the complement D × Y \ D × C for some bounded set C B Y . Now we see that f is bounded on X × Y \ D × C , witnessing that the ballean X × Y is emu-bounded. □
Proposition 6.
Let X , Y be two so-bounded balleans. If cov ( B X ) < add ( B Y ) , then the product X × Y is so-bounded.
Proof. 
By the definition of the cardinal κ = cov ( B X ) , there exists a subfamily { B α } α κ B X with α κ B α X .
To show that the ballean X × Y is so-bounded, take any so-function f : X × Y R . Fix any point x 0 X , and for every α κ find an entourage E α on X such that B α E α [ x 0 ] . Then X = α κ E α [ x 0 ] . Since f is slowly oscillating, there exists C α B Y such that sup y Y \ C α diam f ( E α [ x 0 ] × { y } ) 1 . Since add ( B Y ) > cov ( B X ) = κ , the set C = α < κ C α is bounded in Y. If y Y \ C , then diam f ( E α [ x 0 ] × { y } ) 1 for every α κ and hence diam f ( X × { y } ) 2 .
Since Y is so-bounded, there exists a bounded set D B Y such that sup y Y \ D | f ( x 0 , y ) | < 1 . Replacing D by C D , we can assume that C D . Then | f ( x , y ) | < 1 + diam f ( X × { y } ) 1 + 2 = 3 for all x X and y Y \ D . Therefore, f is bounded on the set ( X × Y ) \ ( X × D ) .
By Theorem 2, X × D is so-bounded, so there exists a bounded set B X such that f is bounded on the set ( X × D ) \ ( B × D ) . Summing up, we conclude that f is bounded on the complement of the bounded set B × D . □
Proposition 7.
Let X , Y be two balleans such that cov ( B X ) < add ( B Y ) and the bornology B X is tall. If X and Y are emu-bounded (respectively, bo-bounded), then so is the product X × Y .
Proof. 
We shall provide a detailed proof only for the case of emu-boundedness. The case of bo-boundedness can be considered by analogy. So assume that the balleans X , Y are emu-bounded. By the definition of the cardinal κ = cov ( B X ) , there exists a subfamily { B α } α κ B X with α κ B α X .
To show that the ballean X × Y is emu-bounded, take any emu-function f : X × Y R . Fix any point x 0 X , and for every α κ find an entourage E α on X such that B α E α [ x 0 ] . Since f is eventually macro-uniform, there exists C α B Y such that:
c α : = sup y Y \ C α diam f ( E α [ x 0 ] × { y } )
is finite. For every m N let K m = { α κ : c α m } . We claim that for some m N the union U m = α K m E α [ x 0 ] coincides with X. In the opposite case, for every m N , we can choose a point x m X \ U m . Since the bornology B X is tall, there exists an increasing number sequence ( m k ) k ω such that the set { x m k } k ω is bounded and hence is contained in B α E α [ x 0 ] for some α κ . Then, for any k ω with m k c α , we have x m k E α [ x 0 ] U m k , which contradicts the choice of x m k . This contradiction shows that U m = X for some m N .
Since add ( B Y ) > cov ( B X ) = κ | K m | , the set C = α K m C α is bounded in Y. If y Y \ C then diam f ( E α [ x 0 ] × { y } ) c α m for every α K m and hence diam f ( X × { y } ) = diam ( U m × { y } ) 2 m .
Since Y is emu-bounded, there exists a bounded set D B Y such that the number
c : = sup y Y \ D | f ( x 0 , y ) |
is finite. Replacing the set D by C D , we can assume that C D . Then | f ( x , y ) | < c + diam f ( X × { y } ) < c + 2 m for all x X and y Y \ D . Therefore, f is bounded on the set ( X × Y ) \ ( X × D ) .
By Theorem 2, the ballean X × D is emu-bounded, so there exists a bounded set B X such that f is bounded on the set ( X × D ) \ ( B × D ) . Summing up, we conclude that f is bounded on ( X × Y ) \ ( B × D ) , witnessing that X × Y is emu-bounded. □

5. Group Balleans

A bornology B on a group G is called a group bornology if for any sets A , B B the set A B 1 = { a b 1 : a A , b B } belongs to B .
Each group bornology B on a group G induces the coarse structure E B , generated by the base { E B : B B } consisting of the entourages E B = { ( x , y ) G × G : y { x } B x } where B B .
It is easy to see that for any infinite cardinal κ and any group G, the family
[ G ] < κ : = { B G : | B | < κ }
is a group bornology on G. It induces the coarse structure E [ G ] < κ on G. The ballean ( G , E [ G ] < κ ) will be called the κ-ballean of G. The ω -ballean of G is called the finitary ballean of G. It should be mentioned that the finitary balleans of finitely generated groups G have been intensively studied in Geometrical Group Theory, see [2], Chapter 4. For properties of the κ -balleans of groups, see [15,16,17].
Theorem 3.
For any infinite regular cardinal κ, the κ-ballean of any group G of cardinality | G | = κ is not so-bounded.
Proof. 
Since κ is regular, the coarse structure E [ G ] < κ has a linearly ordered base. By Proposition 3.1 of [18], the κ -ballean ( G , E [ G ] < κ ) is not so-bounded. □
Example 3.3 from [19] shows that the finitary ballean of any infinite free group F ( X ) is not so-bounded.
Theorem 4.
For any infinite cardinal κ and set X of cardinality | X | κ the κ-ballean of the free group G = F ( X ) is not so-bounded.
Proof. 
We partition X = n N X n so that | X n | = | X | for each n N , and define a function h : X { e } X 1 R by h ( e ) = 0 and h ( x ) = h ( x 1 ) = n for any x X n , n N . Then we define a mapping f : G R , assigning to each word w G = F ( X ) the number h ( a ) where a is the last letter in the irreducible representation of w. It is easy to see that f is unbounded on the complement G \ B of any set B [ G ] < κ .
To show that f is slowly oscillating, we take an arbitrary subset B [ G ] < κ and denote by S the subgroup of G generated by all letters which appear in the (irreducible) words from B. If w G \ S and y S , then f ( y w ) = f ( w ) , so diam f ( S w ) = 0 . □
Following [20], we define group G to be κ -normal if every subset F [ G ] < κ is contained in a normal subgroup H [ G ] < κ of G.
Theorem 5.
Let κ be a cardinal of uncountable cofinality and G be a group of cardinality | G | > κ . If the group G is κ + -normal, then the κ-ballean of G is emu-bounded.
Proof. 
Given any emu-function f : G R , we should prove that f is bounded on the complement G \ B of some set B [ G ] < κ . First, we prove two claims.
Claim 1.
There exists a normal subgroup H G of cardinality κ such that:
sup x G \ H diam f ( H x ) < .
Proof. 
Since G is a κ + -normal group of cardinality | G | > κ , there exists a normal subgroup H 0 G of cardinality | H 0 | = κ . By transfinite induction of length ω 1 , we shall construct an increasing sequence ( H α ) α ω 1 of normal subgroups of cardinality κ such that for any ordinal α < ω 1 the supremum sup x X \ H α + 1 diam f ( H α x ) is finite.
Assume that, for some non-zero ordinal α < ω 1 , we have constructed an increasing sequence ( H β ) β < α of normal subgroups of cardinality κ in G such that for any ordinal β with β + 1 < α the supremum sup x X \ H β + 1 diam f ( H β x ) is finite. If α is a limit ordinal, put H α = β < α H β .
If α = β + 1 is a successor ordinal, then write the group H β as the union H β = i cf ( κ ) Γ i of an increasing sequence ( Γ i ) i cf ( κ ) of sets of cardinality | Γ i | < κ . Since f is eventually macro-uniform, for every i cf ( κ ) there exists a set B i [ G ] < κ such that c i : = sup x G \ B i diam f ( Γ i x ) is finite. Since G is κ + -normal, the set H β i cf ( κ ) B i is contained in a normal subgroup H α of cardinality | H α | = κ . Since the cardinal cf ( κ ) is uncountable and regular, there exists c N such that the set Ω = { i cf ( κ ) : c i c } is unbounded in cf ( κ ) . Then H β = i Ω Γ i and for any x X \ H α = X \ H β + 1 :
diam f ( H β x ) = sup i Ω diam f ( Γ i x ) sup i Ω c i c .
 □
Claim 2.
The function f is bounded on the set G \ H .
Proof. 
To derive a contradiction, assume that f is unbounded on G \ H and choose a sequence ( g n ) n ω in G \ H such that the set { f ( g n ) : n ω } is unbounded. We put K = { g n g 0 1 : n ω } and choose B [ G ] < κ such that the number
C : = sup x X \ B diam f ( K x )
is finite. By Claim 1, the supremum
c : = sup x G \ H diam f ( H x )
is finite. Since | H | = κ > | B | = | g 0 1 B | , there exists x H \ g 0 1 B . Then g 0 x B and | f ( g n g 0 1 ( g 0 x ) ) f ( g 0 x ) | diam f ( K x ) C for each n > 0 . Since H is normal, g n x g n H = H g n , and then
| f ( g n ) | = | f ( g n ) f ( g n x ) + f ( g n x ) f ( g 0 x ) + f ( g 0 x ) | | f ( g n ) f ( g n x ) | + | f ( g n x ) f ( g 0 x ) | + | f ( g 0 x ) | < < diam f ( H g n ) + C + | f ( g 0 x ) | < c + C + | f ( g 0 x ) |
for every n, which contradicts the choice of ( g n ) n ω . This contradiction shows that f is bounded on G \ H . □
Fix any element g G \ H and observe that g H G \ H , and hence the set f ( g H ) f ( G \ H ) is bounded in the real line (according to Claim 2). Consequently, the supremum
c : = sup x G \ H | f ( x ) |
is finite.
Since f is eventually macro-uniform, there exists a set B [ G ] < κ such that the number
c : = sup x G \ B | f ( g x ) f ( x ) |
is finite. Now take any x H \ B and observe that
| f ( x ) | | f ( g x ) f ( x ) | + | f ( g x ) | c + c ,
witnessing that f is bounded on H \ B and, consequently, bounded on G \ B = ( G \ H ) ( H \ B ) . □
A subset A of a group G is defined to be κ -large if G = F A for some F [ G ] < κ . In the proof of Theorem 7, we shall need the following result, proven in [20].
Theorem 6
(Protasov, Slobodianiuk). Let κ be a singular cardinal and let G be a κ-normal group of cardinality κ. For every finite partition of G, at least one cell of the partition is κ-large.
Theorem 7.
Let κ be a singular cardinal and let G be a group of cardinality | G | = κ . If the group G is κ-normal, then the κ-ballean of G is emu-bounded.
Proof. 
Assuming that the κ -ballean of G is not emu-bounded, we can find an emu-function f : G N such that f ( G \ B ) is unbounded for every | B | [ G ] < κ . This property of f implies that for any m N the preimage f 1 ( [ m , ) ) has cardinality κ .
Claim 3.
There exists a number sequence ( n i ) i ω such that n 0 = 0 , n i + 1 n i > i for all i ω and for every m ω and r { 0 , 1 , 2 , 3 } the set
X m , r : = k = m f 1 ( [ n 4 k + r , n 4 k + r + 1 ) )
has cardinality | X m , r | = κ .
Proof. 
Separately, we shall consider two cases.
1. The set W = { n ω : | f 1 ( [ n , n + 1 ) ) | = κ } is infinite. In this case let { n i } i ω ω be any increasing number sequence such that n 0 = 0 , n i + 1 n i > i and [ n i + 1 , n i ) W for all i ω . It is clear that the sequence ( n i ) i ω has the required property.
2. The set W is finite. Put n 0 = 0 and find a number n 1 N with W [ n 0 , n 1 ) . The definition of W implies that for any m > n 1 the preimage f 1 ( [ n 1 , m ) ) has cardinality < κ . Taking into account that f 1 ( [ n 1 , ) ) = m > n 1 f 1 ( [ n 1 , m ) ) has cardinality κ , we conclude that the cardinal κ has countable cofinality. So, we can find a strictly increasing sequence of cardinals ( κ i ) i ω with sup i ω κ i = κ . Since f 1 ( [ n 1 , ) ) = n > m f 1 ( [ n 1 , m ) ) has cardinality κ , there exists a number n 2 > n 1 + 1 such that | f 1 ( [ n 1 , n 2 ) ) | κ 1 . Proceeding by induction, for every i N we can find a number n i + 1 > n i + i such that | f 1 ( [ n i , n i + 1 ) ) | > κ i . It is easy to see that the sequence ( n i ) i ω has the required property. □
Since G = r = 0 3 X 0 , r , we can apply Theorem 6 and find a number r { 0 , 1 , 2 , 3 } such that the set X 0 , r is κ -large in G and hence G = F X 0 , r for some set F [ G ] < κ containing the unit e of G.
Since the function f is eventually macro-uniform, there exists a set B [ G ] < κ such that sup x G \ B diam f ( F x ) < m for some number m N . Let q { 0 , 1 , 2 , 3 } be a unique number with | q r | = 2 . Since | X m , q | = κ > | F B | , there exists an element y X m , q \ F B . Taking into account that y G \ F B = F X 0 , r \ F B = F ( X 0 , r \ B ) , we see that y F x for some x X 0 , r \ B . The choice of B ensures that diam f ( F x ) m and hence | f ( y ) f ( x ) | diam f ( F x ) m . It follows from x X 0 , r = k = 0 f 1 ( [ n 4 k + r , n 4 k + r + 1 ) ) that f ( x ) [ n 4 i + r , n 4 i + r + 1 ) for some i ω . On the other hand, y X m , q = k = m f 1 ( [ n 4 k + q , n 4 k + q + 1 ) ) yields a number j m such that f ( y ) [ n 4 j + q , n 4 j + q + 1 ) . Now, we arrive at a contradiction with | f ( y ) f ( x ) | m , considering the following four cases.
If i < j , then 4 i + r + 1 4 ( j 1 ) + 1 + r 4 j 3 + q + | r q | = 4 j + q 1 and hence
f ( y ) n 4 j + q > n 4 j + q 1 + ( 4 j + q 1 ) n 4 i + r + 1 + ( 4 m + q 1 ) > f ( x ) + m .
If j < i , then 4 j + q + 1 4 ( i 1 ) + 1 + q 4 i 3 + r + | r q | = 4 i + r 1 and hence
f ( x ) n 4 i + r > n 4 i + r 1 + ( 4 i + r 1 ) n 4 j + q + 1 + ( 4 j + r + 3 ) > f ( y ) + m .
If i = j and r < q , then
f ( y ) n 4 j + q > n 4 j + q 1 + ( 4 j + q 1 ) = n 4 j + r + 1 + ( 4 j + q 1 ) > f ( x ) + m .
If i = j and q < r , then
f ( x ) n 4 i + r > n 4 i + r 1 + ( 4 i + r 1 ) = n 4 j + q + 1 + ( 4 j + r 1 ) > f ( y ) + m .
 □
Theorem 8.
Let G be a group. If the κ-ballean of each subgroup H of G with | H | = κ is emu-bounded, then the κ-ballean of G is emu-bounded.
Proof. 
Assuming that the κ -ballean of G is not emu-bounded, we can find an emu-function f : G N , which is unbounded on each subset G \ B , | B | < κ . This property of f implies that for every m N the set f 1 ( [ m , ) has cardinality κ and hence contains a subset X m of cardinality | X m | = κ . Then the set m ω X m generates a subgroup H G of cardinality | H | = κ such that f ( H \ B ) is unbounded for any B [ H ] < κ . Now we see that the restriction f H witnesses that H is not emu-bounded. □
Remark 1.
By Theorems 3, 4, 5, 7 and 8, for an uncountable cardinal κ , the κ -ballean of an Abelian group G is emu-bounded iff either κ is singular or κ is regular and | G | > κ . In this case, the emu-boundedness is equivalent to the so-boundedness. If κ is regular and G is an Abelian group of cardinality | G | > κ , then the κ -ballean of G is emu-bounded but the κ -ballean of every subgroup H, | H | = κ is not emu-bounded.
Remark 2.
By Theorems 3 and 5, the ω 1 -ballean of the group R is emu-bounded iff CH holds. On the other hand, by Theorem 4, the ω 1 -ballean of the free group F ( R ) is not emu-bounded in ZFC.
Question 4.
Is the ω 1 -ballean of the permutation group S ω emu-bounded in ZFC?
By analogy with Theorem 3.1 of [19], the following theorem can be proven.
Theorem 9.
If G is an uncountable ω 1 -normal group, then the finitary ballean of G is bo-bounded and so-bounded, and every so-function on G is constant at infinity.
Question 5.
Assume that the finitary ballean of a group G is so-bounded. Is every so-function on G constant at infinity?
Question 6.
Is the so-boundedness of the finitary ballean of a group equivalent to its bo-boundedness?
Finally, we shall discuss the mu-boundedness of finitary balleans on groups. Since the fintary ballean of any group is locally finite, each emu-function is a mu-function. Consequently, the finitary ballean of any group is mu-bounded iff it is emu-bounded.
Definition 1.
A group G is defined to be:
  • n-Shelah for some n N if for each subset A G of cardinality | A | = | G | we have A n = G ;
  • Shelah if it is n-Shelah for some n N ;
  • almost Shelah if for each subset A G of cardinality | A | = | G | there exists n N such that A n = G ;
  • Jónsson if each subsemigroup A G of cardinality | A | = | G | coincides with G;
  • Kurosh if each subgroup A G of cardinality | A | = | G | coincides with G;
  • Bergman if G cannot be written as the union a strictly increasing sequence ( X n ) n ω of subsets such that X n = X n 1 and X n 2 X n + 1 for all n ω .
For any group G, the following implications hold:
finite 1 - Shelah Shelah almost Shelah Jónsson Kurosh .
In [8], Shelah constructed a ZFC-example of an uncountable Jónsson group and a CH-example of an infinite 6640-Shelah group. More precisely, for every cardinal κ with κ + = 2 κ , there exists a 6640-Shelah group of cardinality κ + = 2 κ . In [7], Bergman proved that the permutation group S X of any set X is Bergman. Later it was shown [21,22,23] that many automorphism groups (of sufficiently homogeneous structures) are Bergman.
Theorem 10.
For a group G the following conditions are equivalent:
1. 
The finitary ballean of G is mu-bounded.
2. 
The finitary ballean of G is emu-bounded.
3. 
The group G is Bergman.
The conditions(1)–(3)follow from:
4. 
G is almost Shelah and cf ( | G | ) > ω .
Proof. 
The equivalence ( 1 ) ( 2 ) follows from the local finiteness of the finitary ballean on G.
( 1 ) ( 3 ) . Assume that the group G fails to be Bergman. Then G = n ω X n for some strictly increasing sequence of subsets of G such that X n = X n 1 and X n 2 X n + 1 for all n ω . We lose no generality assuming that X 0 = .
We claim that the function φ : G N R assigning to each x X the unique number n N such that x X n \ X n 1 is macro-uniform. It follows from X n 2 X n + 1 that
φ ( g x ) 1 + max { φ ( g ) , φ ( x ) } φ ( x ) + ( 1 + φ ( g ) )
for every g , x . Then φ ( x ) = φ ( g 1 g x ) φ ( g x ) + ( 1 + φ ( g 1 ) ) and hence φ ( g x ) φ ( x ) ( 1 + φ ( g 1 ) . Therefore,
φ ( x ) ( 1 + φ ( g 1 ) ) φ ( g x ) φ ( x ) + ( 1 + φ ( g ) ) ,
which implies that the map φ is macro-uniform. Since the sequence ( X n ) n ω is strictly increasing, the map φ is unbounded, so the finitary ballean of G is not m u -bounded.
( 3 ) ( 1 ) Assume that G admits an unbounded macro-uniform function φ : G R . We lose no generality assuming that φ ( e ) = 0 where e is the unit of the group G. Then for every finite set F G there exists a number n F N such that φ ( F x ) [ n F , n F ] + φ ( x ) for every x G . For every n N let X n = { g G : n { g , g 1 } n } and observe that ( X n ) n ω is an increasing sequence such that X n = X n 1 and n ω X n = G . For every n ω let Y n = X n 2 n and observe that Y n = Y n 1 and Y n · Y n = X n 2 n X n 2 n = X n 2 n + 1 X n + 1 2 n + 1 = Y n + 1 .
Assuming that G is Bergman, we conclude that G = Y n = X n 2 n for some n ω .
By induction, we shall prove that φ ( X n k ) [ n k , n k ] for k ω . For k = 0 , we have φ ( X n 0 ) = φ ( { e } ) = { 0 } = [ n 0 , n 0 ] . Assume that for some k ω we have proven that φ ( X n k ) [ n k , n k ] . Taking into account that for every g X n and x G we have φ ( g x ) φ ( x ) + [ n { g } , n { g } ] φ ( x ) + [ n , n ] , we conclude that φ ( X n x ) φ ( x ) + [ n , n ] and hence,
φ ( X n k + 1 ) = φ ( X n · X n k ) φ ( X n k ) + [ n , n ] [ n k , n k ] + [ n , n ] [ n ( k + 1 ) , n ( k + 1 ) ] .
Then φ ( G ) = φ ( X n 2 n ) [ n 2 n , n 2 n ] , which means that the function φ is bounded.
Finally, we prove that ( 4 ) ( 3 ) . Assume that G is almost Shelah and cf ( | G | ) > ω . Assume that G = n ω X n for some increasing sequence of subsets such that X n = X n 1 and X n · X n X n + 1 for all n ω . By induction we can show that X n 2 k X n + k for every k ω .
Since cf ( | G | ) > ω , there exists n ω such that | X n | = | G | . Since G is almost Shelah, G = X n 2 m X n + m for some m ω and hence X n + m = G , which contradicts the choice of the sequence ( X k ) k ω . □
Corollary 2.
The finitary ballean of the permutation group S X of any set X is mu-bounded.
Question 7.
Is every so-function on a Bergman group (in particular, on the group S X ) constant at infinity?
Problem 1.
Find the largest n for which every n-Shelah group is finite.
Remark 3.
Answering the problem [24], Yves Cornulier proved that each 3-Shelah group is finite.

Author Contributions

The principal ideas of this paper belong to I.P. who wrote an initial draft; T.B. improved the proofs of some theorems and made the final editing of the paper.

Funding

This research received no external funding.

Conflicts of Interest

The authors declare no conflict of interest.

References

  1. 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]
  2. De la Harpe, P. Topics in Geometric Group Theory; University Chicago Press: Chicago, IL, USA, 2000. [Google Scholar]
  3. Dranishnikov, A.N.; Ferri, S. On the Higson-Roe corona. Russ. Math. Surv. 1997, 52, 1017–1028. [Google Scholar] [CrossRef]
  4. Protasov, I.V. Coronas of balleans. Topol. Appl. 2005, 149, 149–160. [Google Scholar] [CrossRef] [Green Version]
  5. Protasov, I.; Zarichnyi, M. General Asymptology; VNTL Publ.: Lviv, Ukraine, 2007. [Google Scholar]
  6. Roe, J. Lectures on Coarse Geometry; Univ. Lecture Ser. 31; American Mathematical Society: Providence, RI, USA, 2003. [Google Scholar]
  7. Bergman, G.M. Generating infinite symmetric groups. Bull. Lond. Math. Soc. 2006, 38, 429–440. [Google Scholar] [CrossRef]
  8. Shelah, S. On a problem of Kurosh, Jónsson groups, and applications. In Word Problems, II, Conference on Decision Problems in Algebra, Oxford, 1976; Studies in Logic and the Foundations of Mathematics 95; North-Holland Publishing Company: Amsterdam, The Netherlands, 1980; pp. 373–394. [Google Scholar]
  9. Dranishnikov, A.N. Asymptotic topology. Russ. Math. Surv. 2000, 55, 1085–1129. [Google Scholar] [CrossRef] [Green Version]
  10. Dydak, J.; Hoffland, C. An alternative definition of coarse structures. Topol. Appl. 2008, 155, 1013–1021. [Google Scholar] [CrossRef] [Green Version]
  11. Protasov, I.; Banakh, T. Ball Stuctures and Colorings of Graphs and Groups; VNTL Publ.: Lviv, Ukraine, 2003; 148p. [Google Scholar]
  12. Protasov, I.V. A note on bornologies. Mat. Stud. 2018, 49, 13–18. [Google Scholar] [CrossRef]
  13. Jech, T. Set Theory; Springer: Berlin, Germany, 2003. [Google Scholar]
  14. Banakh, T.; Protasov, I. The Normality and Bounded Growth of Balleans. Available online: https://arxiv.org/abs/1810.07979 (accessed on 18 October 2018).
  15. Banakh, T.; Higes, J.; Zarichnyi, I. The coarse classification of countable abelian groups. Trans. Amer. Math. Soc. 2010, 362, 4755–4780. [Google Scholar] [CrossRef] [Green Version]
  16. Banakh, T.; Protasov, I.; Repovs, D.; Slobodianiuk, S. Classifying homogeneous cellular ordinal balleans up to coarse equivalence. Colloq. Math. 2017, 149, 211–224. [Google Scholar] [CrossRef] [Green Version]
  17. Protasov, I.; Slobodianiuk, S. On asymorphisms of groups. J. Group Theory 2017, 20, 393–399. [Google Scholar] [CrossRef]
  18. Protasov, I.V. Normal ball structures. Math. Stud. 2003, 20, 3–16. [Google Scholar]
  19. Filali, M.; Protasov, I.V. Slowly oscillating functions on locally compact groups. Appl. Gen. Topol. 2005, 6, 67–77. [Google Scholar]
  20. Protasov, I.; Slobodianiuk, S. A note on partitions of groups. Quest. Answ. Gen. Topol. 2015, 33, 61–70. [Google Scholar]
  21. Droste, M.; Holland, W.C. Generating automorphism groups of chains. Forum Math. 2005, 17, 699–710. [Google Scholar] [CrossRef]
  22. Droste, M.; Truss, J. The uncountable cofinality of the automorphism group of the countable universal distributive lattice. Demonstr. Math. 2011, 44, 473–479. [Google Scholar] [CrossRef] [Green Version]
  23. Tolstykh, V. On Bergman’s property for the automorphism groups of relatively free groups. J. Lond. Math. Soc. 2006, 73, 669–680. [Google Scholar] [CrossRef]
  24. Banakh, T. A Shelah Group in ZFC. Available online: https://mathoverflow.net/questions/313516 (accessed on 22 Octobe 2018).

Share and Cite

MDPI and ACS Style

Banakh, T.; Protasov, I. Functional Boundedness of Balleans: Coarse Versions of Compactness. Axioms 2019, 8, 33. https://doi.org/10.3390/axioms8010033

AMA Style

Banakh T, Protasov I. Functional Boundedness of Balleans: Coarse Versions of Compactness. Axioms. 2019; 8(1):33. https://doi.org/10.3390/axioms8010033

Chicago/Turabian Style

Banakh, Taras, and Igor Protasov. 2019. "Functional Boundedness of Balleans: Coarse Versions of Compactness" Axioms 8, no. 1: 33. https://doi.org/10.3390/axioms8010033

APA Style

Banakh, T., & Protasov, I. (2019). Functional Boundedness of Balleans: Coarse Versions of Compactness. Axioms, 8(1), 33. https://doi.org/10.3390/axioms8010033

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