ConceptComplete

Seifert Surfaces and Genus - Examples and Constructions

Explicit constructions of Seifert surfaces illustrate key techniques and demonstrate how geometric and algebraic methods interact.

Example

Constructing Seifert Surface for (p,q)(p,q)-Torus Knot: The torus knot T(p,q)T(p,q) lives on the standard torus T2⊂S3T^2 \subset S^3. A canonical Seifert surface is:

  1. Fiber surface: The torus T2T^2 minus a small neighborhood of the knot
  2. Compress: Surgically modify to reduce genus using handle decomposition
  3. Result: Surface with genus g=(p−1)(q−1)2g = \frac{(p-1)(q-1)}{2}

For T(2,3)T(2,3) (trefoil): g=1⋅22=1g = \frac{1 \cdot 2}{2} = 1 (once-punctured torus).

Alternatively, view T(p,q)T(p,q) as the closure of the (p,q)(p,q)-braid. Seifert's algorithm on the standard diagram produces a genus-gg surface directly.

Definition

Murasugi sum of Seifert surfaces: If a knot diagram DD decomposes into two subdiagrams D1D_1 and D2D_2 glued along a disk, and each subdiagram admits a Seifert surface, the Murasugi sum F1∗MF2F_1 *_M F_2 combines them into a Seifert surface for DD.

The genus satisfies: g(F1∗MF2)≤g(F1)+g(F2)g(F_1 *_M F_2) \leq g(F_1) + g(F_2)

with equality when surfaces are "incompressible" in an appropriate sense. This provides systematic ways to bound genus for composite diagrams.

Example

Minimal genus computation for pretzel knots: The pretzel knot P(−2,3,7)P(-2,3,7) has:

Using Seifert's algorithm on standard diagram:

  • Crossing number: c=∣−2∣+3+7=12c = |-2| + 3 + 7 = 12
  • Seifert circles: s=3s = 3 (one per tangle strand)
  • Upper bound: g≤12−3+12=5g \leq \frac{12 - 3 + 1}{2} = 5

Using Alexander polynomial:

  • deg⁡(Δ)=10\deg(\Delta) = 10 (can be computed)
  • Lower bound: g≥5g \geq 5

Therefore g(P(−2,3,7))=5g(P(-2,3,7)) = 5 exactly. The Seifert algorithm yields minimal genus in this case!

Remark

Incompressibility: A Seifert surface FF is incompressible if every essential disk DD in S3∖int(F)S^3 \setminus \text{int}(F) with ∂D⊂F\partial D \subset F is boundary-parallel in FF.

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.

Example

Fiber surface for figure-eight knot: The figure-eight 414_1 is fibered, so its minimal Seifert surface is a fiber FF of the fibration S3∖41→S1S^3 \setminus 4_1 \to S^1.

Explicitly:

  • FF is a punctured torus (genus 1 surface with one boundary component)
  • Monodromy h:F→Fh: F \to F is a Dehn twist
  • The fiber is incompressible and minimal genus

The fibration structure makes 414_1 particularly tractable: many invariants can be computed from the monodromy alone.

Definition

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 g(K)g(K) for alternating knots: simply apply Seifert's algorithm to any reduced alternating diagram.

Example

Non-minimal Seifert surfaces: The unknot has minimal genus 0, but non-minimal Seifert surfaces exist with any genus g≥0g \geq 0.

Explicitly construct genus gg Seifert surface for unknot:

  1. Start with a standard disk (genus 0)
  2. Attach gg handles arbitrarily
  3. Result: genus gg surface with boundary the unknot

These "stabilized" surfaces demonstrate that higher-genus Seifert surfaces always exist, making genus minimization nontrivial.

Remark

Computational methods for genus:

  • Normal surface theory (Haken): Enumerate all normal surfaces in knot complement triangulation, find minimal genus (exponential time)
  • Floer homology: Compute τ(K)\tau(K) invariant, which often equals g4(K)g_4(K) and bounds g(K)g(K)
  • Alexander polynomial: Quick lower bound from degree
  • Experimental: For small knots (≤12\leq 12 crossings), genus is tabulated in KnotInfo

For practical purposes, combining polynomial bounds with Seifert's algorithm usually determines genus for knots with ≤15\leq 15 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.