Examples/classes:
Types
Related concepts:
topology (point-set topology, point-free topology)
see also differential topology, algebraic topology, functional analysis and topological homotopy theory
Basic concepts
fiber space, space attachment
Extra stuff, structure, properties
Kolmogorov space, Hausdorff space, regular space, normal space
sequentially compact, countably compact, locally compact, sigma-compact, paracompact, countably paracompact, strongly compact
Examples
Basic statements
closed subspaces of compact Hausdorff spaces are equivalently compact subspaces
open subspaces of compact Hausdorff spaces are locally compact
compact spaces equivalently have converging subnet of every net
continuous metric space valued function on compact metric space is uniformly continuous
paracompact Hausdorff spaces equivalently admit subordinate partitions of unity
injective proper maps to locally compact spaces are equivalently the closed embeddings
locally compact and second-countable spaces are sigma-compact
Theorems
Analysis Theorems
In an oriented link diagram, we can see there are two types of possible crossing. They are allocated a sign, + or -.
One method of remembering the sign convention is to imagine an approach to the crossing along the underpass in the direction of the orientation:
The writhe of an oriented knot or link diagram is the sum of the signs of all its crossings. If is the diagram, we denote its writhe by .
The writhe is used in the definition of some of the knot invariants.
This is a variant of the writhe that is more adapted for use with links.
Suppose we have an oriented link diagram with components , the linking number of with where and are distinct components of , is to be one half of the sum of the signs of the crossings of with ; it will be denoted .
The linking number of the diagram us then the sum of the linking numbers of all pairs of components:
The writhe of the standard trefoil is 3, of the Hopf link (both components clockwise oriented) is +2, but that of the Borromean rings is 0 although it is a non-trivial link.
The writhe is not an isotopy invariant, as it can be changed but twisting a stand of the knot (or link).
The writhe is an invariant of regular isotopy.
The linking number is a link invariant.
We use Reidemeister moves so have to check that they do not change the linking number of a diagram. Any Reidemeister move that involves at least two components of the link (i.e. which must be an R2 or R3) leaves all linking numbers between components unchanged. An R2 move removes or introduces two crossings of opposite sign, whilst an R3 leaves the number of crossings and their signs unaltered.
We can conclude that the Hopf link is not isotopic to the two component unlink, (which is reassuring) as any assignment of orientations to the Hopf link leads to a non-zero linking number.
Let (resp. ) be the sum of the signs of crossings between a pair of components and of a link in which the over arc belongs to (resp. ). The linking number is then clearly equal to .
Now, take a crossing between and such that the over arc belongs to . Suppose that we switch the crossing type, so that now the under arc belongs to . Then, no matter what the sign of the crossing, it can be verified that the sum remains unchanged by this switch.
We may also obviously make crossing switches to the self-crossings of a component, or to crossings of the two components we are looking at with other components, without affecting the sum .
In addition, it is straightforward to check that the Reidemeister moves do not change the sum .
Now, it is obvious that any pair of components of a link can be unlinked from the link after making appropriate crossing switches. In the case that and are circles disjoint from each other and the rest of the link, we have that .
We deduce that in all cases. Hence , and the linking number is equal to .
In particular, the linking number is an integer.
An immediate consequence of the fact that the sum of the signs of the crossings between and is even is that there must in fact be an even number of such crossings.
Last revised on June 7, 2017 at 19:09:44. See the history of this page for a list of all contributions to it.