Skip to main content
Mathematics & StatisticsMathematics37 lines

Knot Theory Diagrams and Invariants

Analyze knot diagrams with explicit crossing data, Reidemeister moves and correctly limited invariant comparisons.

Quick Summary7 lines
Use this skill for introductory knot-theory reasoning and reproducible diagram analysis. Establish whether the object is a knot, a link, a tangle or an open curve, and whether orientation matters. State the ambient space and equivalence convention. Do not confuse a knot diagram with the knot it represents.

## Key Points

- [Berkeley knot theory lecture notes](https://math.berkeley.edu/~jhicks/classes/spring15math191/math191lecturenotes.pdf)
skilldb get mathematics-skills/knot-theoryFull skill: 37 lines
Paste into your CLAUDE.md or agent config

Knot Theory Diagrams and Invariants

Use this skill for introductory knot-theory reasoning and reproducible diagram analysis. Establish whether the object is a knot, a link, a tangle or an open curve, and whether orientation matters. State the ambient space and equivalence convention. Do not confuse a knot diagram with the knot it represents.

Make the diagram unambiguous

Record overcrossings and undercrossings at every intersection. Label crossings and trace each component to confirm connectivity. An ordinary drawing of intersecting lines is insufficient if it does not indicate which strand passes over.

Choose a consistent orientation when using signed crossings or oriented invariants. Record the sign convention and show one worked crossing. Use a diagram encoding or labeled image when a verbal description would be ambiguous. Preserve the original diagram before simplifying it.

Simplify through valid moves

Apply planar deformation and Reidemeister moves with their local conditions visible. Type I adds or removes a curl, type II adds or removes a canceling crossing pair, and type III rearranges three strands without changing their crossing relationships in the required way.

Show the intermediate diagram for each move and verify that no strand passes through another accidentally. A crossing change is not generally an allowed equivalence move. Do not replace a difficult simplification with an unexplained redraw.

Distinguish the crossing count of the current diagram from the knot's minimum crossing number. Failing to find a simplification does not prove minimality or nontriviality.

Compute and interpret invariants

Select an invariant appropriate to the question and learner level, such as component count, linking number for oriented links or a polynomial invariant. State normalization conventions, since different references may report equivalent polynomial expressions differently.

Work through a small example and verify invariance under representative allowed moves. For a linking-number computation, include only crossings between the relevant distinct components and apply the chosen signed-crossing convention consistently.

Different invariant values can prove that two objects are inequivalent when the invariant and conventions are appropriate. Equal invariants do not generally prove equivalence. A successful sequence of allowed moves, however, provides constructive evidence for the equivalence it demonstrates.

Deliver the labeled diagrams, move sequence, calculation and exact conclusion. Mark unresolved cases as unresolved. If software assists the computation, record its version and encoding, and check a simple known case before trusting a complicated result.

References

Install this skill directly: skilldb add mathematics-skills

Get CLI access →

Related Skills

Linear Algebra

Triggers when users need help with linear algebra. Activate for questions about vectors, matrices, vector spaces, linear transformations, eigenvalues, eigenvectors, determinants, rank, null space, SVD, LU decomposition, QR decomposition, orthogonality, inner product spaces, least squares, matrix factorizations, and applications in machine learning, computer graphics, and physics.

Mathematics•117L

Mathematical Logic

Triggers when users need help with mathematical logic and foundations. Activate for questions about propositional logic, predicate logic, proof techniques, direct proof, proof by contradiction, mathematical induction, contrapositive proofs, set theory, ZFC axioms, completeness theorem, incompleteness theorems, Godel, computability, decidability, model theory, formal verification, and automated theorem proving.

Mathematics•152L

Mathematical Modeling

Triggers when users need help with mathematical modeling. Activate for questions about model formulation, dimensional analysis, scaling, population models, logistic growth, Lotka-Volterra predator-prey, diffusion models, network models, Monte Carlo simulation, sensitivity analysis, model validation, parameter estimation, compartmental models, epidemiological models, and communicating mathematical results.

Mathematics•147L

Number Theory

Triggers when users need help with number theory. Activate for questions about divisibility, prime numbers, fundamental theorem of arithmetic, modular arithmetic, congruences, Euler's theorem, Fermat's little theorem, quadratic reciprocity, continued fractions, Diophantine equations, primality testing, RSA encryption, elliptic curve cryptography, the Chinese remainder theorem, and number-theoretic algorithms.

Mathematics•125L

Numerical Methods

Triggers when users need help with numerical methods and scientific computing. Activate for questions about root finding, Newton's method, bisection method, secant method, interpolation, Lagrange interpolation, splines, numerical integration, Simpson's rule, Gaussian quadrature, numerical linear algebra, iterative solvers, condition numbers, numerical ODE solvers, numerical PDE solvers, floating-point arithmetic, error analysis, and numerical stability.

Mathematics•142L

Optimization

Triggers when users need help with mathematical optimization. Activate for questions about linear programming, simplex method, interior point methods, convex optimization, gradient descent, Newton's method for optimization, proximal methods, constrained optimization, KKT conditions, Lagrange multipliers, integer programming, combinatorial optimization, metaheuristics, genetic algorithms, simulated annealing, and operations research.

Mathematics•129L