Open and closed sets give us a way to define concepts such as nearness and connectedness without needing a metric space.
There are a couples of ways to introduce open and closed sets.
Here we imagine that we have a device that measures distance imperfectly, it is just good enough to find which elements are adjacent to a given element.
Here we get rid of the concept of distance completely, instead we use subsets. The concept of 'nearness' is now just the elements in the same set.
Below we represent elements of sets as black dots, the sets are indicated by the red, green and blue lines, so if a black dot is inside the red line then it is a member of the red set.
These sets are open, they do not include their boundary.
These sets are closed, they include their boundary.
|Some sets are both or neither open or closed.|
Topology on a Set
A topology on a set X is a collection τ (tau) of subsets of (X), called open sets satisfying the following properties:
- X and Ø are elements of τ.
- τ is closed under finite intersections.
- τ is closed under arbitary unions.
Neighborhood (open sets)
We want to encode concepts like nearness, convergence and continuity. To do this we use the concept of neighborhood. We think of a 'space' as a set of points.
|How do we map from a set of points to neighborhood? An arbitrary mapping would not necessarily have properties like nearness.|
|We can look at the reverse direction: given a neighborhood 'Τ' how do we specify a point.|
|We can keep taking subsets that converge on a point. So we don't have a numerical measure of nearness but we know the points in set 'A' (such as 'X') tend to be closer to each other than, say, the points in set 'B' and so on.|
|We can define morphisms between these neighborhoods (open sets). So, for instance, 'A' can map to 'A' but it can also map to 'B' because all points that are in 'A' are also in 'B'. However 'B' cannot map to 'A' because there may be some points that are in 'B' but are not in 'A'.|
In order to make this diagram commute we need to be able to map the individual points. However 'X' on the left needs to map to both 'X' and 'Y' on the right and a function can't do this. The only way that we can do that is to reverse the direction of the arrows.
So a morphism of open sets is 'contravarient', that is, it goes in the opposite direction to the mapping of the points.
|These subsets can be drawn like this. More generally (semi)lattice.|
Open Set Definition
The open sets of X need to satisfy the following:
- X and Ø are open sets.
- If U, V are open sets then U V is open.
- If ( Uλ)λLis any family of open sets then λL Uλis open.
So different topologies can be defined by specifying the (semi) lattice structure:
Upper Closure (upward closed set )
If, for every open set, we include the open set of all its unions and intersections and then include the unions and intersections of these and so on (closure) we would have every element of a connected topology in every neighborhood. To avoid this we only apply closure in one direction (up or down).
Subset Structure of Open Sets as Category
In this diagram the open set U is a subset of V.
We can represent this as an arrow from V to U
This has the properties we expect from a category, for instance, the identity map:
U->U (identity map)
(U->V)*(V ->W) = U->W (composition)
Subsets of the Poweset
This diagram shows in more detail how we can take subsets of the Powerset and that this is contravarient.
On the top-left is a set consisting of elements A, B and C. We map this into a two-element set below it containing 'AB' and C.
We can think of this joining of A and B as indicating that the two points are connected.
If points 'A' and 'B' are connected in 'X' then if an element of corresponding powerset contains one of them then it must contain both. In other words subsets which contain only 'A' or only 'B' are excluded.
Open Set Criterion for Continuity
A map ƒ: M1 → M2 is continuous if and only if the inverse image of every open set is open.