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.

Tangential KZ regularization and the hump normalization

Statement

For each finite degree cutoff N, every parenthesized endpoint cluster of the KZ connection has a unique coefficientwise tangentially regularized transport, obtained by removing its local residue factor. For three strands, fix the normalized positions (0,z,1) and put a=t12/(2πi) and b=t23/(2πi). The equation G′(z)=(az+bz−1)G(z) has unique solutions G0,G1 with G0(z)=f(z)za, G1(z)=g(1−z)(1−z)b, where f and g are analytic near 0 and f(0)=g(0)=1. Their ratio ΦKZ:=G1(z)−1G0(z) is independent of z and equals the regularized limit ΦKZ=lim⁡ε↓0ε−bGε(1−ε)εa,Gε(ε)=1. If K+ is obtained from a strict Morse knot presentation K by inserting one copy of the fixed standard hump H, then Z(K+)=Z(H)Z(K), r(K+)=r(K)+1, and hence I(K+)=I(K). The inverse in I(K) exists degreewise because the degree-zero coefficient of Z(H) is 1. The associator identities and independence under arbitrary changes of parenthesization are separate claims.

Facts & Assumptions

Given: The completed strand algebra, the KZ form, the compactified level cells, the fixed standard hump H, and a finite degree cutoff N.

[F1]

The Kontsevich integral on parenthesized braids: the KZ form is Ωq=(2πi)−1∑i<jtij dlog⁡(zi−zj); parenthesizations specify nested tangential collision directions; Z(K) is the degreewise improper configuration integral in the unframed 4T+1T quotient; I(K)=Z(K)Z(H)−r(K).

[F2]

Compactified Kontsevich configuration spaces and faces: each nested collision has a nonnegative radial coordinate and a smooth limiting direction; branch evaluations extend smoothly to its resolved face.

[F3]

Closure and connected sum for the Kontsevich integral of one-strand tangles: closing the standard one-in one-out hump tangle gives H, and closure of a vertical composite multiplies the closed series by connected sum.

[F4]

External input — local hump identity for closed knots. Bar-Natan–Stoimenow, §2.5.4, Theorem 2.9 and its proof, printed/PDF pp. 15–16, establishes Z(Kc)=Z(∞)Z(Ks) for arbitrary closed Morse knots identical outside the local maximum-minimum insertion in figure (2.9). Their ∞ is the two-maxima unknot H of [F1]. Chmutov–Duzhin–Mostovoy gives the same identity as equation (1), printed p. 226, with its justification in §8.7.1, printed p. 238. This is an imported established result for closed knots, not a consequence of cutting an arbitrary knot into a tangle lying between its endpoint planes. Actual reading: Bar-Natan–Stoimenow §§2.5.1–2.5.4, pp. 13–16, including the separation argument and figures; Chmutov–Duzhin–Mostovoy p. 226 and §§8.6–8.7, pp. 232–239. The separation argument is imported, not reconstructed here as a uniform estimate for arbitrary shrinking families.

Proof

Given: As above. Work first in the finite-dimensional quotient through degree N; all limits and products below are coefficientwise. No choice axiom is used.

1.1givenF1algebra

On the normalized three-strand slice, the three positions are 0,z,1. The t13 term of Ω3 is constant in these coordinates, while dlog⁡(z1−z2)=dlog⁡z and dlog⁡(z2−z3)=dlog⁡(z−1). Thus the reduced equation is exactly the displayed equation with residues a at 0 and b at 1.

2.1givenF1step 1.1constructalgebra

Near z=0, substitute G0(z)=f(z)za with f(z)=1+∑n≥1fnzn. Comparing coefficients in the differential equation gives (n−ad⁡a)fn=−b∑j=0n−1fj, where ad⁡a(x)=[a,x]. On the degree-N quotient, ad⁡a raises degree and is nilpotent, so (n−ad⁡a)−1=∑s=0N(ad⁡a)s/ns+1 is defined. This determines every fn uniquely. If Sn=∑j=0n∥fj∥ in any norm on the finite-dimensional quotient, the recurrence gives Sn≤(1+CN/n)Sn−1 for a constant CN; hence Sn grows at most polynomially, and f converges for ∣z∣<1. It solves the equation by termwise differentiation.

3.1givenF1F2step 2.1constructinductionalgebra

Replacing z by 1−z and interchanging a,b gives the same recurrence at z=1 and uniquely constructs G1(z)=g(1−z)(1−z)b with g(0)=1. Any two fundamental solutions differ by a constant right multiplier; uniqueness of the analytic normalized factor follows from the recurrence in step 2.1. For a smooth tangential endpoint chart, write each within-cluster difference as ρuij(ρ) with uij smooth and nonzero at ρ=0. Factoring these differences in the KZ form gives the radial equation G′=(A/ρ+B(ρ))G, where A=(2πi)−1∑i<j∈Stij and B is smooth, not necessarily analytic. Construct G=f(ρ)ρA degreewise with f0=1 and, for 1≤d≤N, fd(ρ)=∫0ρ([A,fd−1(u)]u+∑j=1dBj(u)fd−j(u)) du. For d=1 the commutator with f0=1 is zero. Inductively fd−1(0)=0 for d>1, so fd−1(u)/u=∫01fd−1′(vu) dv is smooth. Thus each integrand is smooth, fd(0)=0, and the integral uniquely solves the degree-d equation. This proves existence and uniqueness of the smooth normalized factor with no Taylor expansion assumption. In the specified nested collision tree apply this construction successively in each radial variable, treating the remaining positive scales and the prescribed directions as parameters. Disjoint or nested cluster residues commute: for S⊂T, each tij with i,j∈S commutes with tik+tjk for k∈T∖S, and the internal terms commute with their total by the same relations in [F1]. Hence removing earlier residue factors preserves the next leading residue. Smooth dependence in the displayed finite recursion gives the successive tangential limits and their unique prescribed normalization. This concerns the fixed endpoint tree; it does not assert invariance under changes of parenthesization.

4.1step 2.1step 3.1algebra

Both G0 and G1 solve the same left differential equation. Differentiating G1−1G0 therefore gives zero, so their ratio is constant. For Gε(z)=G0(z)G0(ε)−1, the endpoint expansions and G0(ε)−1=ε−af(ε)−1 give ε−bGε(1−ε)εa=ε−bf(1−ε)(1−ε)aε−af(ε)−1εa=ε−bg(ε)εb ΦKZ ε−af(ε)−1εa, where the second equality follows from G1(1−ε)ΦKZ=G0(1−ε). In each degree, f(ε)−1−1 and g(ε)−1 are O(ε). Since a and b have positive degree, conjugation by ε±a or ε±b is a finite polynomial in log⁡ε in the degree-N quotient. Thus both outside factors in the last expression differ from 1 by O(ε(1+∣log⁡ε∣)N) in each degree, which tends to zero; the limit is ΦKZ.

5.1givenF1F3F4algebra∎

The admissible standard one-in one-out hump tangle closes to the two-maxima unknot H by [F3], identifying the normalization factor with the fixed hump in [F1]. For an arbitrary closed K, apply the closed-knot identity [F4] directly to its local insertion: Z(K+)=Z(H)Z(K). A maximum-minimum birth adds exactly one maximum, so r(K+)=r(K)+1. Write Z(H)=1+h, where h has positive degree. Through degree N its inverse is ∑j=0N(−h)j, and these inverses are compatible as N increases. Connected-sum multiplication is commutative, so I(K+)=Z(H)Z(K)Z(H)−r(K)−1=Z(K)Z(H)−r(K)=I(K). Deleting a standard hump is the inverse equality.

Depends on

Used by

Dependency tree · two levels

8 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