| Knot Genus |
Website Links For Seifert |
Information AboutKnot Genus |
| CATEGORIES ABOUT SEIFERT SURFACE | |
| geometric topology | |
| knot theory | |
| surfaces | |
|
Specifically, let ''L'' be a Tame Oriented knot or link in Euclidean 3-space (or in the 3-sphere ). A Seifert surface is a Compact , Connected , Oriented Surface ''S'' embedded in 3-space whose boundary is ''L'' such that the orientation on ''L'' is just the induced orientation from ''S''. It is a Theorem that there always exists such a surface. This theorem was first published by F. Frankl and Lev Pontrjagin in 1930 . A different proof was published in 1934 by Herbert Seifert and relies on what is now called the Seifert algorithm. The Algorithm produces a Seifert surface, given a knot or link diagram. The algorithm also computes the 2g2g integer Seifert Matrix A of the linking numbers of the 2g linearly independent cycles generating the torsion-free quotient of the homology group of the Seifert surface, where g is the Genus of the surface; the (i,j) entry in A is the linking number in Euclidean 3-space (or in the 3-sphere ) of the ith cycle and the pushoff of the jth cycle out of the surface. Note that any compact, connected, oriented surface with nonempty boundary is the Seifert surface associated to its boundary link. A single knot or link can have many different inequivalent Seifert surfaces. It is important to note that a Seifert surface must be ''oriented''. It is possible to associated unoriented surfaces to knots as well. EXAMPLES The standard Möbius Strip has the Unknot for a boundary but is not considered to be a Seifert surface for the unknot because it is not orientable. The "checkerboard" coloring of the minimal crossing projection of the Trefoil Knot gives a Mobius strip with three half twists. As with the previous example, this is not a Seifert surface as it is not orientable. Applying Seifert's algorithm to this diagram, as expected, does produce a Seifert surface; in this case, it is a punctured torus of genus g=1, and the Seifert matrix is
|
|
|