# Connected space#

from IPython.display import IFrame


## Drawing topologies#

If you want to try to draw a finite topological space, one option is to include all the open sets:

Notice the left of our two examples is 8. in the list in Finite topological space, mapping our element to theirs by:

• A â†’ b

• B â†’ c

• C â†’ a

If thatâ€™s too cluttered, another option is to exclude all the open sets that are implied by the open sets you choose to draw. That is, choose not to draw any open sets that are either the intersection or union of open sets youâ€™ve chosen to draw. Also always choose to exclude both the empty set and the full set. With this approach, we might simplify the drawing above to:

Unfortunately this drawing strategy isnâ€™t always going to produce the same drawing for the same topology. We could have also drawn the above as:

To be consistent, itâ€™s probably best to only draw the smallest open sets that you can, that still imply the other open sets. Said another way, draw only those open sets that allow you to infer all other open sets via the rule that the union of any open sets is also an open set. In general, this should lead to a less-cluttered drawing. That is, draw only the Base (topology).

Said another way, we donâ€™t draw any open sets that are â€ścoveredâ€ť by other open sets (the â€śopen coversâ€ť) except those open covers that can be produced by a single (the same) open set. We may draw an open set that contains an open set. Said yet another way, in the sublattice (or preordered set) that defines the topology we draw the bottom (leaf) elements first and then keep drawing up any elements that donâ€™t have two arrows pointing into them. Notice these arrows represent â€śinclusionâ€ť morphisms, so we donâ€™t draw any sets that â€śincludeâ€ť two other sets (notably, the same arrows in the opposite category are the restriction morphisms). The topology on the left from this perspective:

save_url = "https://q.uiver.app/#q=WzAsNixbMSwzLCJcXGVtcHR5Il0sWzAsMiwiXFx7QVxcfSJdLFsxLDIsIlxce0JcXH0iXSxbMCwxLCJcXHtBLEJcXH0iXSxbMSwxLCJcXHtBLENcXH0iXSxbMSwwLCJcXHtBLEIsQ1xcfSJdLFswLDJdLFswLDFdLFsxLDNdLFsyLDNdLFszLDVdLFs0LDVdLFsxLDRdXQ=="
IFrame(src=f"{save_url}&embed", width="423", height="423")


## Drawing topologies with color#

In some cases itâ€™s necessary to be able to quickly see what sets are open, which are closed, and which are both. Itâ€™s reasonable to use color to indicate these states, to avoid cluttering the diagram too much.

Weâ€™ll opt to use yellow for open, orange for closed, and green for both. These are simply the remaining colors in the traditional RYB model (see Secondary color Â§ Traditional painting (RYB)), assuming weâ€™re already using blue/red for left/right adjoints and purple for natural transformations. An example topology with this scheme:

## Define connected space#

We define Connected space in a negative way, in terms of whether the whole set can be represented as the union of two (or more) open sets. See Finite topological space; the 9 non-equivalent topologies on three elements from this perspective:

The arrows in the preceding diagram demonstrate the Specialization (pre)order for these topologies, which demonstrates some of the concepts in Finite topological space Â§ Connectivity. The Clopen sets are colored green.

## Review of Chapter 1#

How should we see the â€śtopologiesâ€ť of chapter 1 in terms of this definition? Recall, for example:

These 5 examples are actually partitions of a set, not topologies, though they are introduced with the language of connectedness. There are only 5 partitions on a set of 3 elements, but 29 topologies (see Finite topological space).

However, see Connected space Â§ Connected components. With this perspective we can produce a partition of any of these spaces. You should see that the topologies numbered 1-3 and 5-6 above produce the trivial partition, 4 and 7-8 produce the partition AB|C, and 9 is the finest partition. The arrows in Equation (1.5) are then roughly the âŠ† relationship in Comparison of topologies with 10 topologies under the trivial partition, 5 under each of the middle partitions, and 4 under the finest partition. See The 29 Topologies on a 3 Element Set for help counting these out.