Decompositions of set-valued mappings
Igor Protasov

TL;DR
This paper proves that certain set-valued mappings with bounded fibers can be decomposed into a small family of bijective selectors, with applications to the structure of balleans.
Contribution
It introduces a decomposition theorem for set-valued mappings with bounded fibers, providing a new way to represent such mappings via a small family of bijective selectors.
Findings
Existence of a small family of bijective selectors for set-valued mappings.
Decomposition of set-valued mappings into single-valued functions.
Application to G-space representations of balleans.
Abstract
Let be a set, denotes the family of all subsets of and be a set-valued mapping such that , , for all and some infinite cardinal . Then there exists a family of bijective selectors of such that and for each . We apply this result to -space representations of balleans.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Topology and Set Theory · Rings, Modules, and Algebras · Homotopy and Cohomology in Algebraic Topology
Decompositions of set-valued mappings
Igor Protasov
On 100th anniversary of Professor V.S. arin
Abstract. Let be a set, denotes the family of all subsets of and be a set-valued mapping such that , , for all and some infinite cardinal . Then there exists a family of bijective selectors of such that and for each . We apply this result to -space representations of balleans.
**MSC: ** 03E05, 54E05.
Keywords: set-valued mapping, selector, ballean.
Victor Sil’vestrovich arin is known as the founder of topological algebra in Kyiv University, but his mathematical interests were not bounded by topological groups. He encouraged and supported the activity of students and collaborators in many areas, in particular, in combinatorics.
1. Decompositions
For a set , denotes the family of all subsets of . Given a set-valued mapping , any function such that, for each , is called a selector of . We say that a selector is bijective if is a bijection. For , we denote .
In section 1 we prove the mail result and apply it to -space representations of balleans in section 2.
Theorem 1. Let be a set-valued mapping such that , , for each and some infinite cardinal . Then there exists a family of bijective selectors of such that and for each .
Proof. We consider two cases.
Case . We put and define a graph with the set of vertices and the set of edges . We take a natural number such that , and show that the local degree of each vertices of does not exceed . Assume the contrary and choose and distinct such that for every . Then but, by the choice of , we have .
We use the following simple fact [2]: if the local degree of each vertices of a graph does not exceed then the chromatic number of does not exceed .
Hence the set of vertices of can be partition so that any two vertices from each are not incident.
To construct the family , we enumerate Let . Then we enumerate each (with repetitions, if necessary) . For each , we define a bijective function such that acts as a transposition of and at each and identically at all other elements of . We put and note that is the desired family of selectors of .
Case . We take an infinite cardinal such that and , for each . Then we define a partition of such that each is the minimal by inclusion subset of satisfying , for each . Constructively, every can be obtained applying to the sequence of operations , , , . Then is the union of all numbers of this sequence.
By the choice of , we have . We enumerate , For each , we choose a family of bijective selectors of such that and for each , see the case . Then is the desired family of bijective selectors of .
2. Applications
Let be a set. A family of subsets of is called a coarse structure if
- •
each contains the diagonal , ;
- •
if , then and , where , ;
- •
if and then ;
- •
for any , there exists such that .
A subset is called a base for if, for every , there exists such that . For , we denote , and say and are balls of radius around and .
The pair is called a coarse space [6] or a ballean [5].
Let , be coarse spaces. A mapping is called macro-uniform if, for every there exists such that . If is a bijection such that are macro-uniform then is called an asymorphism.
Now we describe some general way of constructing balleans. Let be a group. A family of subsets of is called an ideal if, for every and , we have and . An ideal is called a group ideal if for every finite subset of and imply .
Let a group acts transitively on a set by the rule , , . Every group ideal on defines the ballean on with the base of entourages . By Theorem 1 from [3], for every ballean , there exist a group of permutations of and a group ideal on such that is asymorphic to .
Theorem 2. Let be a ballean and let be an infinite cardinal such that, for each , . Then there exist a group of permutations of and a group ideal on such that is asymorphic to and for each .
Proof. For each , we define a mapping by . By Theorem 1, there exists a family of permutations of such that and for each . We denote by the minimal by inclusion group ideal of such that for each . Then is asymorphic to .
In the case , Theorem 2 was proved in [4]. For its applications see Remark 3.5 in [1].
A ballean is called cellular if has a base consisting of equivalence relations. By Theorem 3 from [3], every cellular ballean is asymorphic to some ballean such that has a base consisting of subgroups of .
A ballean is called finitary if, for every there exists a natural number such for each . The finitary ballean of a space is the ballean , where is the ideal of all finite subsets of .
Theorem 3. For every finitary cellular ballean there exists a locally finite group of permutations of such that is asymorphic to the finitary ballean of -space .
Proof. We take a base of consisting of partitions of . For every we pick a natural number such that for each . We denote by the direct product of the family of symmetric groups and note that acts on each so that for each . Then the group generated by the family satisfies the conclusion of Theorem 3.
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[1] Y. Cornulier, On the space of ends of infinitely generated groups, ar Xiv: 1901.11073.
- 2[2] A. Harary, Graph Theory , Addison-Wesley, 1994.
- 3[3] O. V. Petrenko, I.V. Protasov, Balleans and G 𝐺 G -spaces , Ukr. Mat. Zh. 64 (2012), 344-350.
- 4[4] I.V. Protasov, Balleans of bounded geometry and G 𝐺 G -space , Algebra Discrete Math. 2008, no 2, 101-108.
- 5[5] I. Protasov, M. Zarichnyi, General Asymptology , Mat. Stud. Monogr. Ser, vol. 12, VNTL, Lviv, 2007.
- 6[6] J. Roe, Lectures on Coarse Geometry , Univ. Lecture Ser., vol. 31, American Mathematical Society, Providence RI, 2003.
