HOME

TheInfoList



OR:

In
topology In mathematics, topology (from the Greek words , and ) is concerned with the properties of a geometric object that are preserved under continuous deformations, such as stretching, twisting, crumpling, and bending; that is, without closing ...
, an Alexandrov topology is a
topology In mathematics, topology (from the Greek words , and ) is concerned with the properties of a geometric object that are preserved under continuous deformations, such as stretching, twisting, crumpling, and bending; that is, without closing ...
in which the intersection of any family of
open set In mathematics, open sets are a generalization of open intervals in the real line. In a metric space (a set along with a distance defined between any two points), open sets are the sets that, with every point , contain all points that are su ...
s is open. It is an axiom of topology that the intersection of any ''finite'' family of open sets is open; in Alexandrov topologies the finite restriction is dropped. A set together with an Alexandrov topology is known as an Alexandrov-discrete space or finitely generated space. Alexandrov topologies are uniquely determined by their specialization preorders. Indeed, given any preorder ≤ on a set ''X'', there is a unique Alexandrov topology on ''X'' for which the specialization preorder is ≤. The open sets are just the
upper set In mathematics, an upper set (also called an upward closed set, an upset, or an isotone set in ''X'') of a partially ordered set (X, \leq) is a subset S \subseteq X with the following property: if ''s'' is in ''S'' and if ''x'' in ''X'' is larger ...
s with respect to ≤. Thus, Alexandrov topologies on ''X'' are in
one-to-one correspondence In mathematics, a bijection, also known as a bijective function, one-to-one correspondence, or invertible function, is a function between the elements of two sets, where each element of one set is paired with exactly one element of the other ...
with preorders on ''X''. Alexandrov-discrete spaces are also called finitely generated spaces since their topology is uniquely determined by the family of all finite subspaces. Alexandrov-discrete spaces can thus be viewed as a generalization of
finite topological space In mathematics, a finite topological space is a topological space for which the underlying point set is finite. That is, it is a topological space which has only finitely many elements. Finite topological spaces are often used to provide example ...
s. Due to the fact that inverse images commute with arbitrary
union Union commonly refers to: * Trade union, an organization of workers * Union (set theory), in mathematics, a fundamental operation on sets Union may also refer to: Arts and entertainment Music * Union (band), an American rock group ** ''Un ...
s and intersections, the property of being an Alexandrov-discrete space is preserved under quotients. Alexandrov-discrete spaces are named after the Russian topologist
Pavel Alexandrov Pavel Sergeyevich Alexandrov (russian: Па́вел Серге́евич Алекса́ндров), sometimes romanized ''Paul Alexandroff'' (7 May 1896 – 16 November 1982), was a Soviet mathematician. He wrote about three hundred papers, ma ...
. They should not be confused with the more geometrical
Alexandrov space In geometry, Alexandrov spaces with curvature ≥ ''k'' form a generalization of Riemannian manifolds with sectional curvature ≥ ''k'', where ''k'' is some real number. By definition, these spaces are locally compact complete length spaces where t ...
s introduced by the Russian mathematician
Aleksandr Danilovich Aleksandrov Aleksandr Danilovich Aleksandrov (russian: Алекса́ндр Дани́лович Алекса́ндров, alternative transliterations: ''Alexandr'' or ''Alexander'' (first name), and ''Alexandrov'' (last name)) (4 August 1912 – 27 July 19 ...
.


Characterizations of Alexandrov topologies

Alexandrov topologies have numerous characterizations. Let ''X'' = <''X'', ''T''> be a topological space. Then the following are equivalent: *Open and closed set characterizations: ** Open set. An arbitrary intersection of open sets in ''X'' is open. ** Closed set. An arbitrary union of closed sets in ''X'' is closed. *Neighbourhood characterizations: ** Smallest neighbourhood. Every point of ''X'' has a smallest
neighbourhood A neighbourhood (British English, Irish English, Australian English and Canadian English) or neighborhood (American English; American and British English spelling differences, see spelling differences) is a geographically localised community ...
. ** Neighbourhood filter. The neighbourhood filter of every point in ''X'' is closed under arbitrary intersections. *Interior and closure algebraic characterizations: ** Interior operator. The interior operator of ''X'' distributes over arbitrary intersections of subsets. ** Closure operator. The
closure operator In mathematics, a closure operator on a set ''S'' is a function \operatorname: \mathcal(S)\rightarrow \mathcal(S) from the power set of ''S'' to itself that satisfies the following conditions for all sets X,Y\subseteq S : Closure operators are de ...
of ''X'' distributes over arbitrary unions of subsets. *Preorder characterizations: ** Specialization preorder. ''T'' is the finest topology consistent with the specialization preorder of ''X'' i.e. the finest topology giving the preorder ≤ satisfying ''x'' ≤ ''y'' if and only if ''x'' is in the closure of in ''X''. ** Open up-set. There is a preorder ≤ such that the open sets of ''X'' are precisely those that are upward closed i.e. if ''x'' is in the set and ''x'' ≤ ''y'' then ''y'' is in the set. (This preorder will be precisely the specialization preorder.) ** Closed down-set. There is a preorder ≤ such that the closed sets of ''X'' are precisely those that are downward closed i.e. if ''x'' is in the set and ''y'' ≤ ''x'' then ''y'' is in the set. (This preorder will be precisely the specialization preorder.) ** Downward closure. A point ''x'' lies in the closure of a subset ''S'' of ''X'' if and only if there is a point ''y'' in ''S'' such that ''x'' ≤ ''y'' where ≤ is the specialization preorder i.e. ''x'' lies in the closure of . *Finite generation and category theoretic characterizations: ** Finite closure. A point ''x'' lies within the closure of a subset ''S'' of ''X'' if and only if there is a finite subset ''F'' of ''S'' such that ''x'' lies in the closure of ''F''. (This finite subset can always be chosen to be a singleton.) ** Finite subspace. ''T'' is coherent with the finite subspaces of ''X''. ** Finite inclusion map. The inclusion maps ''f''''i'' : ''X''''i'' → ''X'' of the finite subspaces of ''X'' form a final sink. ** Finite generation. ''X'' is finitely generated i.e. it is in the final hull of the finite spaces. (This means that there is a final sink ''f''''i'' : ''X''''i'' → ''X'' where each ''X''''i'' is a finite topological space.) Topological spaces satisfying the above equivalent characterizations are called finitely generated spaces or Alexandrov-discrete spaces and their topology ''T'' is called an Alexandrov topology.


Equivalence with preordered sets


The Alexandrov topology on a preordered set

Given a preordered set \mathbf = \langle X, \le\rangle we can define an Alexandrov topology \tau on ''X'' by choosing the open sets to be the
upper set In mathematics, an upper set (also called an upward closed set, an upset, or an isotone set in ''X'') of a partially ordered set (X, \leq) is a subset S \subseteq X with the following property: if ''s'' is in ''S'' and if ''x'' in ''X'' is larger ...
s: :\tau = \ We thus obtain a topological space \mathbf(\mathbf) = \langle X, \tau\rangle. The corresponding closed sets are the
lower set In mathematics, an upper set (also called an upward closed set, an upset, or an isotone set in ''X'') of a partially ordered set (X, \leq) is a subset S \subseteq X with the following property: if ''s'' is in ''S'' and if ''x'' in ''X'' is larger ...
s: ::\


The specialization preorder on a topological space

Given a topological space ''X'' = <''X'', ''T''> the specialization preorder on ''X'' is defined by: : ''x'' ≤ ''y'' if and only if ''x'' is in the closure of . We thus obtain a preordered set ''W''(''X'') = <''X'', ≤>.


Equivalence between preorders and Alexandrov topologies

For every preordered set ''X'' = <''X'', ≤> we always have ''W''(''T''(''X'')) = ''X'', i.e. the preorder of ''X'' is recovered from the topological space ''T''(''X'') as the specialization preorder. Moreover for every ''Alexandrov-discrete space'' ''X'', we have ''T''(''W''(''X'')) = ''X'', i.e. the Alexandrov topology of ''X'' is recovered as the topology induced by the specialization preorder. However for a topological space in general we do not have ''T''(''W''(''X'')) = ''X''. Rather ''T''(''W''(''X'')) will be the set ''X'' with a finer topology than that of ''X'' (i.e. it will have more open sets). The topology of ''T''(''W''(''X'')) induces the same specialization preorder as the original topology of the space ''X'' and is in fact the finest topology on ''X'' with that property.


Equivalence between monotonicity and continuity

Given a
monotone function In mathematics, a monotonic function (or monotone function) is a function between ordered sets that preserves or reverses the given order. This concept first arose in calculus, and was later generalized to the more abstract setting of order ...
:''f'' : ''X''→''Y'' between two preordered sets (i.e. a function :''f'' : ''X''→''Y'' between the underlying sets such that ''x'' ≤ ''y'' in ''X'' implies ''f''(''x'') ≤ ''f''(''y'') in ''Y''), let :''T''(''f'') : ''T''(''X'')→''T''(''Y'') be the same map as ''f'' considered as a map between the corresponding Alexandrov spaces. Then ''T''(''f'') is a
continuous map In mathematics, a continuous function is a function such that a continuous variation (that is a change without jump) of the argument induces a continuous variation of the value of the function. This means that there are no abrupt changes in valu ...
. Conversely given a continuous map :''g'': ''X''→''Y'' between two topological spaces, let :''W''(''g'') : ''W''(''X'')→''W''(''Y'') be the same map as ''f'' considered as a map between the corresponding preordered sets. Then ''W''(''g'') is a monotone function. Thus a map between two preordered sets is monotone if and only if it is a continuous map between the corresponding Alexandrov-discrete spaces. Conversely a map between two Alexandrov-discrete spaces is continuous if and only if it is a monotone function between the corresponding preordered sets. Notice however that in the case of topologies other than the Alexandrov topology, we can have a map between two topological spaces that is not continuous but which is nevertheless still a monotone function between the corresponding preordered sets. (To see this consider a non-Alexandrov-discrete space ''X'' and consider the
identity map Graph of the identity function on the real numbers In mathematics, an identity function, also called an identity relation, identity map or identity transformation, is a function that always returns the value that was used as its argument, un ...
''i'' : ''X''→''T''(''W''(''X'')).)


Category theoretic description of the equivalence

Let Set denote the
category of sets In the mathematical field of category theory, the category of sets, denoted as Set, is the category whose objects are sets. The arrows or morphisms between sets ''A'' and ''B'' are the total functions from ''A'' to ''B'', and the composition o ...
and
maps A map is a symbolic depiction emphasizing relationships between elements of some space, such as objects, regions, or themes. Many maps are static, fixed to paper or some other durable medium, while others are dynamic or interactive. Although ...
. Let Top denote the category of topological spaces and
continuous maps In mathematics, a continuous function is a function such that a continuous variation (that is a change without jump) of the argument induces a continuous variation of the value of the function. This means that there are no abrupt changes in va ...
; and let Pro denote the category of preordered sets and
monotone function In mathematics, a monotonic function (or monotone function) is a function between ordered sets that preserves or reverses the given order. This concept first arose in calculus, and was later generalized to the more abstract setting of order ...
s. Then :''T'' : Pro→Top and :''W'' : Top→Pro are concrete functors over Set that are left and right adjoints respectively. Let Alx denote the
full subcategory In mathematics, specifically category theory, a subcategory of a category ''C'' is a category ''S'' whose objects are objects in ''C'' and whose morphisms are morphisms in ''C'' with the same identities and composition of morphisms. Intuitive ...
of Top consisting of the Alexandrov-discrete spaces. Then the restrictions :''T'' : Pro→Alx and :''W'' : Alx→Pro are inverse concrete isomorphisms over Set. Alx is in fact a bico-reflective subcategory of Top with bico-reflector ''T''◦''W'' : Top→Alx. This means that given a topological space ''X'', the identity map :''i'' : ''T''(''W''(''X''))→''X'' is continuous and for every continuous map :''f'' : ''Y''→''X'' where ''Y'' is an Alexandrov-discrete space, the composition :''i'' −1◦''f'' : ''Y''→''T''(''W''(''X'')) is continuous.


Relationship to the construction of modal algebras from modal frames

Given a preordered set ''X'', the interior operator and
closure operator In mathematics, a closure operator on a set ''S'' is a function \operatorname: \mathcal(S)\rightarrow \mathcal(S) from the power set of ''S'' to itself that satisfies the following conditions for all sets X,Y\subseteq S : Closure operators are de ...
of ''T''(''X'') are given by: :Int(''S'') = , and :Cl(''S'') = for all ''S'' ⊆ ''X.'' Considering the interior operator and closure operator to be modal operators on the
power set In mathematics, the power set (or powerset) of a set is the set of all subsets of , including the empty set and itself. In axiomatic set theory (as developed, for example, in the ZFC axioms), the existence of the power set of any set is post ...
Boolean algebra In mathematics and mathematical logic, Boolean algebra is a branch of algebra. It differs from elementary algebra in two ways. First, the values of the variables are the truth values ''true'' and ''false'', usually denoted 1 and 0, whereas i ...
of ''X'', this construction is a special case of the construction of a modal algebra from a
modal frame A modal frame in music is "a number of types permeating and unifying Music of Africa, African, Music of Europe, European, and Music of the United States, American song" and melody., quoted in Richard Middleton (1990/2002). ''Studying Popular Musi ...
i.e. from a set with a single binary relation. (The latter construction is itself a special case of a more general construction of a complex algebra from a relational structure i.e. a set with relations defined on it.) The class of modal algebras that we obtain in the case of a preordered set is the class of interior algebras—the algebraic abstractions of topological spaces.


Properties

Any subspace of an Alexandrov-discrete space is Alexandrov-discrete. The product of two Alexandrov-discrete spaces is Alexandrov-discrete. Every Alexandrov topology is locally compact in the sense that every point has a
local base In topology and related areas of mathematics, the neighbourhood system, complete system of neighbourhoods, or neighbourhood filter \mathcal(x) for a point x in a topological space is the collection of all neighbourhoods of x. Definitions Neighbour ...
of compact neighbourhoods, since the smallest neighbourhood of a point is always compact. Indeed, if U is the smallest (open) neighbourhood of a point x, in U itself with the subspace topology any open cover of U contains a neighbourhood of x included in U. Such a neighbourhood is necessarily equal to U, so the open cover admits \ as a finite subcover. Every Alexandrov topology is locally path connected.


History

Alexandrov spaces were first introduced in 1937 by P. S. Alexandrov under the name discrete spaces, where he provided the characterizations in terms of sets and neighbourhoods. The name discrete spaces later came to be used for topological spaces in which every subset is open and the original concept lay forgotten in the topological literature. On the other hand, Alexandrov spaces played a relevant role in Øystein Ore pioneering studies on closure systems and their relationships with
lattice theory A lattice is an abstract structure studied in the mathematical subdisciplines of order theory and abstract algebra. It consists of a partially ordered set in which every pair of elements has a unique supremum (also called a least upper bou ...
and topology.O. Ore, ''Some studies on closure relations'', Duke Math. J. 10 (1943), 761–785. See Marcel Erné, ''Closure'', in Frédéric Mynard, Elliott Pearl (Editors), ''Beyond Topology'', Contemporary mathematics vol. 486, American Mathematical Society, 2009, p.170ff With the advancement of categorical topology in the 1980s, Alexandrov spaces were rediscovered when the concept of finite generation was applied to
general topology In mathematics, general topology is the branch of topology that deals with the basic set-theoretic definitions and constructions used in topology. It is the foundation of most other branches of topology, including differential topology, geometri ...
and the name finitely generated spaces was adopted for them. Alexandrov spaces were also rediscovered around the same time in the context of topologies resulting from denotational semantics and
domain theory Domain theory is a branch of mathematics that studies special kinds of partially ordered sets (posets) commonly called domains. Consequently, domain theory can be considered as a branch of order theory. The field has major applications in computer ...
in
computer science Computer science is the study of computation, automation, and information. Computer science spans theoretical disciplines (such as algorithms, theory of computation, information theory, and automation) to practical disciplines (includi ...
. In 1966 Michael C. McCord and A. K. Steiner each independently observed an equivalence between
partially ordered set In mathematics, especially order theory, a partially ordered set (also poset) formalizes and generalizes the intuitive concept of an ordering, sequencing, or arrangement of the elements of a set. A poset consists of a set together with a bina ...
s and spaces that were precisely the T0 versions of the spaces that Alexandrov had introduced. P. T. Johnstone referred to such topologies as Alexandrov topologies. F. G. Arenas independently proposed this name for the general version of these topologies. McCord also showed that these spaces are weak homotopy equivalent to the order complex of the corresponding partially ordered set. Steiner demonstrated that the equivalence is a contravariant
lattice Lattice may refer to: Arts and design * Latticework, an ornamental criss-crossed framework, an arrangement of crossing laths or other thin strips of material * Lattice (music), an organized grid model of pitch ratios * Lattice (pastry), an orna ...
isomorphism preserving arbitrary meets and joins as well as complementation. It was also a well-known result in the field of modal logic that a equivalence exists between finite topological spaces and preorders on finite sets (the finite
modal frame A modal frame in music is "a number of types permeating and unifying Music of Africa, African, Music of Europe, European, and Music of the United States, American song" and melody., quoted in Richard Middleton (1990/2002). ''Studying Popular Musi ...
s for the modal logic S4). A. Grzegorczyk observed that this extended to a equivalence between what he referred to as ''totally distributive spaces'' and preorders. C. Naturman observed that these spaces were the Alexandrov-discrete spaces and extended the result to a category-theoretic equivalence between the category of Alexandrov-discrete spaces and (open) continuous maps, and the category of preorders and (bounded) monotone maps, providing the preorder characterizations as well as the interior and closure algebraic characterizations. A systematic investigation of these spaces from the point of view of general topology, which had been neglected since the original paper by Alexandrov was taken up by F. G. Arenas.


See also

* ''P''-space, a space satisfying the weaker condition that countable intersections of open sets are open


References

{{DEFAULTSORT:Alexandrov Topology Properties of topological spaces Order theory Closure operators