Coarse structure

From testwiki
Jump to navigation Jump to search

Template:Short description In the mathematical fields of geometry and topology, a coarse structure on a set X is a collection of subsets of the cartesian product X Γ— X with certain properties which allow the large-scale structure of metric spaces and topological spaces to be defined.

The concern of traditional geometry and topology is with the small-scale structure of the space: properties such as the continuity of a function depend on whether the inverse images of small open sets, or neighborhoods, are themselves open. Large-scale properties of a space—such as boundedness, or the degrees of freedom of the space—do not depend on such features. Coarse geometry and coarse topology provide tools for measuring the large-scale properties of a space, and just as a metric or a topology contains information on the small-scale structure of a space, a coarse structure contains information on its large-scale properties.

Properly, a coarse structure is not the large-scale analog of a topological structure, but of a uniform structure.

Definition

A Template:Em on a set X is a collection 𝐄 of subsets of XΓ—X (therefore falling under the more general categorization of binary relations on X) called Template:Em, and so that 𝐄 possesses the identity relation, is closed under taking subsets, inverses, and finite unions, and is closed under composition of relations. Explicitly:

  1. Identity/diagonal:
    The diagonal Ξ”={(x,x):x∈X} is a member of 𝐄—the identity relation.
  2. Closed under taking subsets:
    If Eβˆˆπ„ and FβŠ†E, then Fβˆˆπ„.
  3. Closed under taking inverses:
    If Eβˆˆπ„ then the inverse (or transpose) Eβˆ’1={(y,x):(x,y)∈E} is a member of 𝐄—the inverse relation.
  4. Closed under taking unions:
    If E,Fβˆˆπ„ then their union EβˆͺF is a member of𝐄.
  5. Closed under composition:
    If E,Fβˆˆπ„ then their product E∘F={(x,y): there exists z∈X such that (x,z)∈E and (z,y)∈F} is a member of 𝐄—the composition of relations.

A set X endowed with a coarse structure 𝐄 is a Template:Em.

For a subset K of X, the set E[K] is defined as {x∈X:(x,k)∈E for some k∈K}. We define the Template:Em of E by x to be the set E[{x}], also denoted Ex. The symbol Ey denotes the set Eβˆ’1[{y}]. These are forms of projections.

A subset B of X is said to be a Template:Em if BΓ—B is a controlled set.

Intuition

The controlled sets are "small" sets, or "negligible sets": a set A such that A×A is controlled is negligible, while a function f:X→X such that its graph is controlled is "close" to the identity. In the bounded coarse structure, these sets are the bounded sets, and the functions are the ones that are a finite distance from the identity in the uniform metric.

Coarse maps

Given a set S and a coarse structure X, we say that the maps f:Sβ†’X and g:Sβ†’X are Template:Em if {(f(s),g(s)):s∈S} is a controlled set.

For coarse structures X and Y, we say that f:Xβ†’Y is a Template:Em if for each bounded set B of Y the set fβˆ’1(B) is bounded in X and for each controlled set E of X the set (fΓ—f)(E) is controlled in Y.[1] X and Y are said to be Template:Em if there exists coarse maps f:Xβ†’Y and g:Yβ†’X such that f∘g is close to idY and g∘f is close to idX.

Examples

  • The Template:Em on a metric space (X,d) is the collection 𝐄 of all subsets E of XΓ—X such that sup(x,y)∈Ed(x,y) is finite. With this structure, the integer lattice β„€n is coarsely equivalent to n-dimensional Euclidean space.
  • A space X where XΓ—X is controlled is called a Template:Em. Such a space is coarsely equivalent to a point. A metric space with the bounded coarse structure is bounded (as a coarse space) if and only if it is bounded (as a metric space).
  • The trivial coarse structure only consists of the diagonal and its subsets. In this structure, a map is a coarse equivalence if and only if it is a bijection (of sets).
  • The Template:Em on a metric space (X,d) is the collection of all subsets E of XΓ—X such that for all Ξ΅>0 there is a compact set K of E such that d(x,y)<Ξ΅ for all (x,y)∈Eβˆ–KΓ—K. Alternatively, the collection of all subsets E of XΓ—X such that {(x,y)∈E:d(x,y)β‰₯Ξ΅} is compact.
  • The Template:Em on a set X consists of the diagonal Ξ” together with subsets E of XΓ—X which contain only a finite number of points (x,y) off the diagonal.
  • If X is a topological space then the Template:Em on X consists of all Template:Em subsets of XΓ—X, meaning all subsets E such that E[K] and Eβˆ’1[K] are relatively compact whenever K is relatively compact.

See also

References

Template:Reflist

Template:Topology