How statement and proof provenance work
The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.
- Literature-sourced: the exact statement appears in a cited source; only wording and notation differ.
- AI-adapted: a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
- AI-generated: a genuinely novel statement formulated by AI, with no source for the claim itself.
These labels describe origin, not correctness: citations and verification chips remain separate evidence.
Weight-system integration proof boundary
Remark
The converse integration theorem is a separate established result: over , every unframed weight system is the top symbol of a finite-type knot invariant, by the Kontsevich integral. For every characteristic-zero field , the same existence follows from the rational theorem by the finite-dimensional scalar-extension argument below. The Kontsevich integration proof itself belongs to the later authoring pair KT-35 and is not supplied here. This converse is not a premise for the KT-34 symbol theorem or its local relations, and it is an established theorem rather than an open problem.
Remark references
Facts & Assumptions
Given: A degree , a characteristic-zero field , and an unframed -valued weight system on degree- chord diagrams modulo 4T and 1T.
Framed chord diagrams and four-term relations: in degree the unframed symbol module is generated by finitely many chord diagrams modulo 4T and 1T relations, each an integer-coefficient linear combination of diagrams; a weight system is a linear functional on this quotient.
Chmutov and Lando, “Mutant knots and intersection graphs,” §2, PDF pp. 2–3: over , the Kontsevich invariant integrates every unframed rational weight system to the top symbol of a finite-type knot invariant.
Proof
A degree- chord diagram is a pairing of cyclically ordered endpoints, so only finitely many such diagrams exist. A 4T relation is determined by a background diagram and finitely many endpoint positions, and a 1T relation by one diagram; hence there are finitely many relation vectors. By [F1], each has integer coefficients, so they form the rows of a finite integer matrix . Write and . Since has characteristic zero, embeds in . The rank of is unchanged by this field extension: a nonzero maximal minor over remains nonzero in , while every larger minor that vanishes over still vanishes in . Thus the row space over is the scalar extension of the rational row space, and .
The quotient is finite-dimensional, so extending a rational basis and its dual basis gives . If , the sole diagram is the empty diagram and any weight system is its value ; the constant invariant has top symbol . For , choose a finite -basis of ; finite-dimensional row reduction chooses this basis without a choice axiom. By [F2], for each there is a rational-valued finite-type invariant with top symbol . Write the given weight system as with , and define , viewing each rational value in . Linearity of the finite-difference operator gives top symbol . If , the sum is empty and the zero invariant supplies the zero weight system.
Depends on
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
2 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.
Sources
- The Fundamental Theorem of Vassiliev Invariants (standard reference, not scraped)
- Introduction to Vassiliev Knot Invariants (standard reference, not scraped)
- Sergei V. Chmutov and Sergei K. Lando, Mutant knots and intersection graphs, Algebraic & Geometric Topology 7 (2007), 1579–1598 (standard reference, not scraped)