A ballean B (or a coarse structure) on a set X is a family of subsets of X called balls (or entourages of the diagonal in X ×X) defined in such a way that B can be considered as the asymptotic counterpart of a uniform topological space. The aim of this paper is to study two concrete balleans defined by the ideals in the Boolean algebra of all subsets of X and their hyperballeans, with particular emphasis on their connectedness structure, more specifically the number of their connected components.MSC :54E15
A ballean (or coarse structure) is a set endowed with some family of subsets, the balls, is such a way that balleans with corresponding morphisms can be considered as asymptotic counterparts of uniform topological spaces. For a ballean B on a set X, the hyperballean B ♭ is a ballean naturally defined on the set X ♭ of all bounded subsets of X. We describe all balleans with hyperballeans of bounded geometry and analyze the structure of these hyperballeans.MSC 54E35, 51F99
. Lattices of coarse structures, Mat. Stud. 48 (2017), 115-123. We consider the lattice of coarse structures on a set X and study metrizable, locally finite and cellular coarse structures on X from the lattice point of view.To Michael Zarichnyi on 60th birthday 1. Introduction. Following [11], we say that a family E of subsets of X × X is a coarse structure on a set X ifEach ε ∈ E is called an entourage of the diagonal. We note that E is closed under finite unions (as ε ∪ δ ⊆ εδ), but E is not an ideal in the Boolean algebra of all subsets of X × X because E is not closed under formation of all subsets of its members.A subset E ′ ⊆ E is called a base for E if, for every ε ∈ E there exists ε ′ ∈ E ′ such that ε ⊆ ε ′ . The pair (X, E) is called a coarse space. For x ∈ X and ε ∈ E, we denote B(x, ε) = {y ∈ X : (x, y) ∈ ε} and say that B(x, ε) is a ball of radius ε around x. We note that a coarse space can be considered as an asymptotic counterpart of a uniform topological space and could be defined in terms of balls, see [7], [9]. In this case a coarse space is called a ballean. For categorical look at the balleans and coarse structures as two faces of the same coin, see [1].A coarse structure E on X is called connected if, for any x, y ∈ X, there is ε ∈ E such that y ∈ B(x, ε). A subset Y of X is called bounded if there exist x ∈ X and ε ∈ E such that Y ⊆ B(x, ε). A coarse structure E is called bounded if X is bounded, otherwise E is called unbounded. We note that on every set X, there exists the unique connected bounded coarse structure {ε ⊆ X × X : △ X ⊆ ε}, and if X is finite this structure is the unique connected coarse structure on X.In what follows, we consider only connected coarse structures on infinite sets. Given a set X, the family L X of all coarse structures on X is partially ordered by the inclusion, and L X can be considered as a lattice with the operations ∧ and ∨:• E ∧ E ′ is the strongest coarse structure such that E ∧ E ′ ⊆ E, E ∧ E ′ ⊆ E ′ ;2010 Mathematics Subject Classification: 06B05.
A set X endowed with a coarse structure is called ballean or coarse space. For a ballean (X, E), we say that two subsets A, B of X are close (linked) if there exists an entourage E ∈ E such that A ⊆ E[B], B ⊆ E[A] (either A, B are bounded or contain unbounded close subsets). We explore the following general question: which information about a ballean is contained and can be extracted from the relations of closeness and linkness. 1991 MSC: 54E99, 54D80.
No abstract
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.
customersupport@researchsolutions.com
10624 S. Eastern Ave., Ste. A-614
Henderson, NV 89052, USA
This site is protected by reCAPTCHA and the Google Privacy Policy and Terms of Service apply.
Copyright © 2024 scite LLC. All rights reserved.
Made with 💙 for researchers
Part of the Research Solutions Family.