Encyclopedia Mathematics Mathematics Knot Invariants From Rs Knot Invariant
ARTICLE 2 claims 1 theorem 1 model
Mathematics Knot Invariants From Rs Knot Invariant
Knot theory classifies tangled loops by invariants; this declaration names five standard families and counts them.
A catalog of five invariants
A knot invariant is a quantity computed from a knot that stays the same under continuous deformation, so it can distinguish knots that look different. The classical catalog includes the genus (the least number of holes in a surface spanning the knot), the crossing number (the fewest crossings in any diagram of it), the Alexander polynomial, the Jones polynomial, and Khovanov homology, a richer algebraic invariant from the 1990s. Each one is a rung on a ladder of discrimination: some tell apart more knots than others, and none alone classifies every knot.
In Recognition Science, the framework models these five families as a single finite type named KnotInvariant. The declaration is an inductive type with exactly five constructors, one for each family, and the framework proves that the number of constructors is five. That count is a theorem checked by the machine-checked library of formal results: the type has exactly five elements, no more and no fewer. A certificate structure bundles this count into a single object, and a definition supplies the certificate from that result.
What the declaration does not claim is just as important. It does not prove that these five invariants are the only possible ones, nor that they form a complete classification of knots. It does not define the invariants themselves: the type names genus, crossing number, Alexander polynomial, Jones polynomial, and Khovanov homology as labels, but the actual mathematical definitions of those objects live in conventional knot theory, not in this file. The declaration is a catalog, not a theory of knots.
The framework's contribution is structural: it records that these five families sit together as a recognized set, and it fixes their count at five. That count is the kind of small, checkable fact that gives the framework a foothold. A reader who wants to know what a genus is, or how the Jones polynomial is computed, must look to the standard literature; this page only says that the framework recognizes these five as the canonical families and proves their number.
THEOREM KnotInvariant · knotInvariant_count · IndisputableMonolith/Mathematics/KnotInvariantsFromRS.lean
inductive KnotInvariant where
| genus
| crossingNumber
| alexanderPoly
| jonesPoly
| khovanovHomology
deriving DecidableEq, Repr, BEq, Fintype
theorem knotInvariant_count : Fintype.card KnotInvariant = 5 := by decide
MODEL KnotInvariantCert · knotInvariantCert · IndisputableMonolith/Mathematics/KnotInvariantsFromRS.lean
structure KnotInvariantCert where
five_invariants : Fintype.card KnotInvariant = 5
def knotInvariantCert : KnotInvariantCert where
five_invariants := knotInvariant_count
What this page does not claim
The declaration does not define the mathematical content of genus, crossing number, Alexander polynomial, Jones polynomial, or Khovanov homology. The declaration does not prove that these five invariants are the only possible knot invariants or that they form a complete classification. The declaration does not establish any relationship between the five families, such as which is strictly stronger than another.
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:
- What is the precise definition of each of the five invariants, and how is each computed from a knot diagram?
- Which of the five invariants can distinguish knots that the others cannot, and are there known pairs of distinct knots that all five fail to separate?
- Does the framework's recognition of these five families as canonical have consequences for how knot invariants are organized or compared?
MACHINE LAYER · GROUNDED CLAIM TABLE · CLICK TO EXPAND
THEOREM KnotInvariant · knotInvariant_count · IndisputableMonolith/Mathematics/KnotInvariantsFromRS.lean
inductive KnotInvariant where | genus | crossingNumber | alexanderPoly | jonesPoly | khovanovHomology deriving DecidableEq, Repr, BEq, Fintypetheorem knotInvariant_count : Fintype.card KnotInvariant = 5 := by decideThe declaration is an inductive type with exactly five constructors, one for each family, and the framework proves that the number of constructors is five. KnotInvariant · knotInvariant_count · IndisputableMonolith/Mathematics/KnotInvariantsFromRS.leanMODEL KnotInvariantCert · knotInvariantCert · IndisputableMonolith/Mathematics/KnotInvariantsFromRS.lean
structure KnotInvariantCert where five_invariants : Fintype.card KnotInvariant = 5def knotInvariantCert : KnotInvariantCert where five_invariants := knotInvariant_countA certificate structure bundles this count into a single object, and a definition supplies the certificate from the proven result. KnotInvariantCert · knotInvariantCert · IndisputableMonolith/Mathematics/KnotInvariantsFromRS.lean