Seifert Surfaces and Genus - Examples and Constructions
Explicit constructions of Seifert surfaces illustrate key techniques and demonstrate how geometric and algebraic methods interact.
Constructing Seifert Surface for -Torus Knot: The torus knot lives on the standard torus . A canonical Seifert surface is:
- Fiber surface: The torus minus a small neighborhood of the knot
- Compress: Surgically modify to reduce genus using handle decomposition
- Result: Surface with genus
For (trefoil): (once-punctured torus).
Alternatively, view as the closure of the -braid. Seifert's algorithm on the standard diagram produces a genus- surface directly.
Murasugi sum of Seifert surfaces: If a knot diagram decomposes into two subdiagrams and glued along a disk, and each subdiagram admits a Seifert surface, the Murasugi sum combines them into a Seifert surface for .
The genus satisfies:
with equality when surfaces are "incompressible" in an appropriate sense. This provides systematic ways to bound genus for composite diagrams.
Minimal genus computation for pretzel knots: The pretzel knot has:
Using Seifert's algorithm on standard diagram:
- Crossing number:
- Seifert circles: (one per tangle strand)
- Upper bound:
Using Alexander polynomial:
- (can be computed)
- Lower bound:
Therefore exactly. The Seifert algorithm yields minimal genus in this case!
Incompressibility: A Seifert surface is incompressible if every essential disk in with is boundary-parallel in .
Incompressible surfaces are "minimal" in a strong sense: they cannot be simplified by compression. However, not all minimal genus Seifert surfaces are incompressible, showing genus minimization is subtle.
Fiber surface for figure-eight knot: The figure-eight is fibered, so its minimal Seifert surface is a fiber of the fibration .
Explicitly:
- is a punctured torus (genus 1 surface with one boundary component)
- Monodromy is a Dehn twist
- The fiber is incompressible and minimal genus
The fibration structure makes particularly tractable: many invariants can be computed from the monodromy alone.
Canonical Seifert surface for alternating knots: For a reduced alternating diagram, Seifert's algorithm produces a surface whose genus equals the minimal genus of the knot (proven using Kauffman-Murasugi-Thistlethwaite results on spanning trees and checkerboard colorings).
This provides an algorithmic way to compute for alternating knots: simply apply Seifert's algorithm to any reduced alternating diagram.
Non-minimal Seifert surfaces: The unknot has minimal genus 0, but non-minimal Seifert surfaces exist with any genus .
Explicitly construct genus Seifert surface for unknot:
- Start with a standard disk (genus 0)
- Attach handles arbitrarily
- Result: genus surface with boundary the unknot
These "stabilized" surfaces demonstrate that higher-genus Seifert surfaces always exist, making genus minimization nontrivial.
Computational methods for genus:
- Normal surface theory (Haken): Enumerate all normal surfaces in knot complement triangulation, find minimal genus (exponential time)
- Floer homology: Compute invariant, which often equals and bounds
- Alexander polynomial: Quick lower bound from degree
- Experimental: For small knots ( crossings), genus is tabulated in KnotInfo
For practical purposes, combining polynomial bounds with Seifert's algorithm usually determines genus for knots with crossings.
These constructions show how geometric intuition (building surfaces), algebraic tools (polynomials), and modern topology (Floer homology) work together to understand and compute the fundamental invariant of genus.