Knot Theory: Diagrams and Reidemeister Moves Explained

Added:

Diagrams
Good Shadows
Reidemeister
Moves Defined
Move Proofs
R1 Example
R2 Example
Summary

Diagrams

0:01
Playing Section
  • 1

    Defines link diagrams via projections from 3D to 2D.

  • 2

    Explains shadows and the need for good crossing data.

Basic intuitive understanding of topology, specifically the concept of continuous deformation (ambient isotopy) without cutting or gluing.
The mathematical definition of a knot as a closed, non-self-intersecting loop embedded in three-dimensional space (an embedding of S¹ in ℝ³).
The concept of a link, which consists of one or more disjoint knots tangled together.
How 3D objects are projected onto a 2D plane, including the notation used to represent over-crossings and under-crossings (regular projections).
The definition and computation of basic knot invariants, which are properties of a knot that remain unchanged under Reidemeister moves (e.g., tricolorability, unknotting number, and crossing number).
Introduction to polynomial invariants, such as the Kauffman Bracket, Jones Polynomial, and Alexander Polynomial, which are used to rigorously distinguish between different knots.
The study of Seifert surfaces and knot genus, exploring how knots can form the boundaries of two-dimensional orientable surfaces.
The connection between braids (Braid Group) and knots, including Alexander's Theorem and Markov's Theorem.
Real-world applications of knot theory in molecular biology (DNA supercoiling and enzyme action) and quantum physics.
4.9K views61likes14:39@richardhepworth1441Original Release: 2015-01-16

Reidemeister's Theorem states that two knot diagrams represent equivalent links in three-dimensional space if and only if they can be transformed into each other through a sequence of Reidemeister moves (R1, R2, R3), which are three specific local transformations that modify diagrams while preserving their topological structure; a diagram is defined as a 'good shadow' (a projection of a link onto a plane with no triple crossings, tangents, or cusps) equipped with crossing data specifying which strand passes over or under at each intersection.