Mathematics Knot Invariants From Rs Knot Invariant Count

The count of five

A knot invariant is a property of a knot that does not change when the knot is deformed without cutting it. The classical examples include the genus, the minimum number of crossings in a diagram, the Alexander polynomial, the Jones polynomial, and Khovanov homology. Each one assigns a value or algebraic object to a knot, and if two knots differ in that value, they cannot be the same knot. The Recognition Science framework's machine-checked library of formal theorems contains a declaration, knotInvariant_count, that establishes exactly this: the framework's formal enumeration of these five canonical invariant families has cardinality five.

The theorem is proved by a direct computation in the framework's library, which is a collection of theorems verified by a computer. The declaration states that the type of knot invariants, as defined in the framework, has exactly five elements. These five are the genus, crossing number, Alexander polynomial, Jones polynomial, and Khovanov homology. The proof is a simple case analysis, and the library records that the proof uses no axioms beyond the standard logical ones and contains no unfinished proofs.

In Recognition Science, this count is described as a rung on a complexity ladder of knot-type discrimination. The idea is that these five invariants represent a structural depth in low-dimensional topology, a way of organizing how much information each invariant carries about a knot. The framework does not claim that these five are the only possible invariants, nor that they are the strongest ones. It claims only that this particular formal list, chosen as a canonical set, has five members.

The declaration does not assert that these five invariants distinguish all knots, nor that they are independent of each other. It does not prove any relationship between them, such as whether the Jones polynomial determines the Alexander polynomial. The count is a structural fact about the framework's definition, not a theorem about the nature of knots themselves. A reader should not take this as a claim that knot theory has exactly five invariants; the framework simply chose these five as a representative set for its own structural analysis.

What the declaration does establish is a clean, machine-checked starting point. It gives the framework a precise object to reason about, and it provides a certificate that the count is correct. This matters because the framework aims to build larger results on top of such basic facts. The count is the foundation, not the conclusion.

theorem knotInvariant_count : Fintype.card KnotInvariant = 5 := by decide

inductive KnotInvariant where
  | genus
  | crossingNumber
  | alexanderPoly
  | jonesPoly
  | khovanovHomology
  deriving DecidableEq, Repr, BEq, Fintype

theorem knotInvariant_count : Fintype.card KnotInvariant = 5 := by decide

What this page does not claim

The five invariants distinguish all knots or are the strongest possible invariants. The invariants are independent of each other or that any one determines another. Knot theory itself has exactly five invariants; the count is about the framework's chosen set.

Verify this page

Every tagged claim above names its theorem. To check one yourself rather than trust this page, elaborate the source module with Lean 4 and audit its axiom basis:

$ lake env lean IndisputableMonolith/Mathematics/KnotInvariantsFromRS.lean
expected axiom basis: [propext, Classical.choice, Quot.sound] (the Lean kernel's standard three; no RS-specific axioms)

A page whose claims cannot be reproduced this way does not ship. In production, every anchor links to the exact declaration in the public source release, and this block carries the build receipt for the page itself.

Derived articles

This page is generated by a question-recursion engine: the questions its answers raise become the next pages. The current agenda, with open targets marked red: