ConceptComplete

Seifert Surfaces and Genus - Core Definitions

Seifert surfaces provide a crucial bridge between one-dimensional knots and two-dimensional topology, enabling powerful algebraic and geometric techniques.

Definition

A Seifert surface for a knot KS3K \subset S^3 is a compact, connected, orientable surface FF embedded in S3S^3 with boundary F=K\partial F = K.

The genus g(K)g(K) of a knot is the minimum genus among all Seifert surfaces for KK: g(K)=min{g(F):F is a Seifert surface for K}g(K) = \min\{g(F) : F \text{ is a Seifert surface for } K\}

where the genus g(F)g(F) is the number of handles: FF is homeomorphic to a sphere with gg handles attached.

Every knot admits a Seifert surface (proven by Seifert's algorithm), but finding minimal genus surfaces is generally difficult. The genus measures "complexity" differently than crossing number, providing complementary topological information.

Definition

Seifert's Algorithm constructs a Seifert surface from any oriented knot diagram DD:

  1. Smooth all crossings following orientation: replace each crossing with two arcs that don't cross
  2. Identify Seifert circles: the smoothed diagram consists of ss disjoint circles
  3. Span disks: each Seifert circle bounds a disk in R3\mathbb{R}^3
  4. Attach bands: at each original crossing, attach a half-twisted band connecting the appropriate disks
  5. Result: a connected oriented surface FF with F=K\partial F = K

The genus satisfies: g(F)=12(c(D)s(D)+1)g(F) = \frac{1}{2}(c(D) - s(D) + 1) where c(D)c(D) is crossings and s(D)s(D) is Seifert circles.

Example

Trefoil knot 313_1:

  • Standard 3-crossing diagram has s=2s = 2 Seifert circles
  • Seifert's algorithm gives g(F)=12(32+1)=1g(F) = \frac{1}{2}(3 - 2 + 1) = 1
  • This is minimal: g(31)=1g(3_1) = 1

Unknot:

  • Any diagram has Seifert surface of genus 0 (a disk)
  • g(unknot)=0g(\text{unknot}) = 0 characterizes it among knots

Figure-eight 414_1:

  • Standard 4-crossing diagram: s=3s = 3 circles
  • Seifert algorithm: g(F)=12(43+1)=1g(F) = \frac{1}{2}(4 - 3 + 1) = 1
  • Minimal: g(41)=1g(4_1) = 1
Remark

Seifert's algorithm doesn't always produce minimal genus surfaces. For some diagrams, the computed surface has higher genus than g(K)g(K). However, for alternating knots, Seifert's algorithm on a reduced alternating diagram often yields minimal genus.

Computing g(K)g(K) exactly is algorithmically difficult (NP-hard in general), though bounds exist from Alexander polynomial: deg(ΔK)2g(K)\deg(\Delta_K) \leq 2g(K).

Definition

The Seifert matrix V=(vij)V = (v_{ij}) of a Seifert surface FF with genus gg encodes linking information:

  • Choose basis {α1,,α2g}\{\alpha_1, \ldots, \alpha_{2g}\} for H1(F;Z)H_1(F; \mathbb{Z})
  • Push each αi\alpha_i slightly off FF in positive normal direction: αi+\alpha_i^+
  • Define vij=lk(αi,αj+)v_{ij} = \text{lk}(\alpha_i, \alpha_j^+) (linking number in S3S^3)

The Seifert matrix is a 2g×2g2g \times 2g integer matrix encoding the surface's self-linking properties.

From VV, compute fundamental invariants:

  • Alexander polynomial: ΔK(t)=det(tVVT)\Delta_K(t) = \det(tV - V^T)
  • Signature: σ(K)=signature(V+VT)\sigma(K) = \text{signature}(V + V^T)
  • Determinant: det(K)=det(V+VT)\det(K) = |\det(V + V^T)|

These algebraic invariants derived from Seifert surfaces provide powerful tools for distinguishing knots and proving theoretical results about knot properties.