Proximity space
Template:Short description In topology, a proximity space, also called a nearness space, is an axiomatization of the intuitive notion of "nearness" that hold set-to-set, as opposed to the better known point-to-set notion that characterize topological spaces.
The concept was described by Template:Harvs but ignored at the time.<ref>W. J. Thron, Frederic Riesz' contributions to the foundations of general topology, in C.E. Aull and R. Lowen (eds.), Handbook of the History of General Topology, Volume 1, 21-29, Kluwer 1997.</ref> It was rediscovered and axiomatized by V. A. Efremovič in 1934 under the name of infinitesimal space, but not published until 1951. In the interim, Template:Harvs discovered a version of the same concept under the name of separation space.
DefinitionEdit
A Template:Em <math>(X, \delta)</math> is a set <math>X</math> with a relation <math>\delta</math> between subsets of <math>X</math> satisfying the following properties:
For all subsets <math>A, B, C \subseteq X</math>
- <math>A \;\delta\; B</math> implies <math>B \;\delta\; A</math>
- <math>A \;\delta\; B</math> implies <math>A \neq \varnothing</math>
- <math>A \cap B \neq \varnothing</math> implies <math>A \;\delta\; B</math>
- <math>A \;\delta\; (B \cup C)</math> if and only if (<math>A \;\delta\; B</math> or <math>A \;\delta\; C</math>)
- (For all <math>E,</math> <math>A \;\delta\; E</math> or <math>B \;\delta\; (X \setminus E)</math>) implies <math>A \;\delta\; B</math>
Proximity without the first axiom is called Template:Em (but then Axioms 2 and 4 must be stated in a two-sided fashion).
If <math>A \;\delta\; B</math> we say <math>A</math> is near <math>B</math> or <math>A</math> and <math>B</math> are Template:Em; otherwise we say <math>A</math> and <math>B</math> are Template:Em. We say <math>B</math> is a Template:Em or Template:Em of <math>A,</math> written <math>A \ll B,</math> if and only if <math>A</math> and <math>X \setminus B</math> are apart.
The main properties of this set neighborhood relation, listed below, provide an alternative axiomatic characterization of proximity spaces.
For all subsets <math>A, B, C, D \subseteq X</math>
- <math>X \ll X</math>
- <math>A \ll B</math> implies <math>A \subseteq B</math>
- <math>A \subseteq B \ll C \subseteq D</math> implies <math>A \ll D</math>
- (<math>A \ll B</math> and <math>A \ll C</math>) implies <math>A \ll B \cap C</math>
- <math>A \ll B</math> implies <math>X \setminus B \ll X \setminus A</math>
- <math>A \ll B</math> implies that there exists some <math>E</math> such that <math>A \ll E \ll B.</math>
A proximity space is called Template:Em if <math>\{ x \} \;\delta\; \{ y \}</math>implies <math>x = y.</math>
A Template:Em or Template:Em is one that preserves nearness, that is, given <math>f : (X, \delta) \to \left(X^*, \delta^*\right),</math> if <math>A \;\delta\; B</math> in <math>X,</math> then <math>f[A] \;\delta^*\; f[B]</math> in <math>X^*.</math> Equivalently, a map is proximal if the inverse map preserves proximal neighborhoodness. In the same notation, this means if <math>C \ll^* D</math> holds in <math>X^*,</math> then <math>f^{-1}[C] \ll f^{-1}[D]</math> holds in <math>X.</math>
PropertiesEdit
Given a proximity space, one can define a topology by letting <math>A \mapsto \left\{ x : \{ x \} \;\delta\; A \right\}</math> be a Kuratowski closure operator. If the proximity space is separated, the resulting topology is Hausdorff. Proximity maps will be continuous between the induced topologies.
The resulting topology is always completely regular. This can be proven by imitating the usual proofs of Urysohn's lemma, using the last property of proximal neighborhoods to create the infinite increasing chain used in proving the lemma.
Given a compact Hausdorff space, there is a unique proximity space whose corresponding topology is the given topology: <math>A</math> is near <math>B</math> if and only if their closures intersect. More generally, proximities classify the compactifications of a completely regular Hausdorff space.
A uniform space <math>X</math> induces a proximity relation by declaring <math>A</math> is near <math>B</math> if and only if <math>A \times B</math> has nonempty intersection with every entourage. Uniformly continuous maps will then be proximally continuous.
See alsoEdit
ReferencesEdit
Template:Reflist Template:Reflist