Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedverified 2026-10-22 (gpt-6.1-sol)
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.

Finite-type truncations of the Kontsevich integral

Statement

Assume countable choice, and let Im(K) be the degree-m homogeneous coefficient of the normalized unframed Kontsevich series I(K) of a smooth oriented knot type K. For n≥0, put I≤n(K)=∑m=0nIm(K). A function on knot types is of type at most n when its alternating resolution sum on every (n+1)-singular knot is zero. Then I≤n is a type-at-most-n invariant with values in the complexified direct sum ⨁m=0n(Amun⊗QC) of the rational unframed degree-m chord-diagram modules. For every n-singular knot with chord diagram D, its n-fold finite difference satisfies DnI≤n(K)=D. In particular, the degree-n symbol is the identity on rational chord diagrams after extending scalars to C; no rational-coefficient claim is made about Im(K).

Facts & Assumptions

Given: Countable choice, a degree cutoff n, and the unframed normalized series of a strict Morse presentation of each oriented knot type.

[A1]

The Axiom of Countable Choice (ACω): countable choice is assumed only through the ambient-isotopy invariance supplier.

[F1]

The Kontsevich integral on parenthesized braids: I(K) is the degreewise series in the completed unframed 4T+1T chord-diagram module.

[F2]

Singular knots and Vassiliev derivatives: DkF(K) is the alternating sum over the 2k resolutions of a k-singular knot; type at most n means Dn+1F=0 on every (n+1)-singular knot.

[F3]

The Kontsevich integral induces the identity on the associated graded: on a k-singular knot with chord diagram D, DkI(K) has zero degrees below k and degree-k component exactly D.

[F4]

Braid and knot isotopy invariance of the normalized integral: under countable choice, I(K) is independent of the strict Morse presentation and is invariant under ambient isotopy of oriented knots.

[F5]

Framed chord diagrams and four-term relations: each degreewise unframed chord-diagram module is the rational 4T+1T quotient, and its complexification is the target of Im.

Proof

Given: As above. Let π≤n denote projection to homogeneous degrees 0,1,…,n; it is linear and commutes with finite sums.

1.1A1F1F4F5algebra

By [F4] the normalized series is invariant under ambient isotopy and independent of its strict Morse presentation. Applying the degree projection π≤n preserves equality, so I≤n=π≤nI is a well-defined invariant on oriented knot types with the stated target.

2.1F2F3step 1.1algebra

Let K be an (n+1)-singular knot with chord diagram D. By [F3], every homogeneous component of Dn+1I(K) in degree at most n is zero. Since π≤n commutes with the alternating resolution sum, Dn+1I≤n(K)=π≤nDn+1I(K)=0. This is exactly the type-at-most-n condition from [F2].

3.1F1F2F3step 1.1step 2.1algebra∎

Let K instead be n-singular with diagram D. By [F3], the projection of DnI(K) to degrees at most n has no terms below degree n and has degree-n term D. Therefore DnI≤n(K)=π≤nDnI(K)=D. For n=0, the same statement is the degree-zero unit term of [F1]. Thus the degree-n symbol of the truncation is the identity on rational chord diagrams, with coefficients regarded in their complexification.

Depends on

Used by

Dependency tree · two levels

26 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