Alphabeta Math
DefinitionDefinition: Literature-sourcedProof: Not applicablePipeline-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.

The Kontsevich integral on parenthesized braids

Definition

Use coordinates (z,t)∈C×R on oriented R3, with t increasing upward. A knot is a smooth embedding K:S1↪C×R with the orientation of S1. A strict Morse presentation is one for which t∣K has nondegenerate critical points, meaning its second derivative in a local coordinate is nonzero there, and pairwise distinct critical values. Write tmin⁡:=min⁡x∈Kt(x), tmax⁡:=max⁡x∈Kt(x), and r(K) for the number of local maxima. A parenthesized q-braid is a smooth braid with q strands, each strictly increasing in t, together with an ordered binary parenthesization of its lower endpoints and an ordered binary parenthesization of its upper endpoints.

For n≥0, a degree-n chord diagram is an oriented circle with n disjoint unordered pairs of distinct points, called chords. Let Anfr be the rational vector space on these diagrams modulo 4T, and let Anun be its quotient by 1T as well. A 4T relation fixes one chord pq and another chord endpoint r, moves the other endpoint of the second chord to just before or after p and just before or after q, and takes the alternating sum of those four diagrams. A chord is isolated when it intersects no other chord, where intersection means that chord endpoints alternate around the circle; 1T sets every such diagram to zero. Put A^Cfr/un:=∏n≥0(Anfr/un⊗QC), with multiplication induced by connected sum of diagrams and unit the empty diagram. For q ordered upward strands, let A^C(q) be the completion of the associative algebra generated by tij=tji for 1≤i<j≤q, with relations [tij,tkl]=0 when i,j,k,l are distinct and [tij,tik+tjk]=0 when i,j,k are distinct. The generator tij is a horizontal chord joining strands i and j; multiplication stacks diagrams from bottom to top.

More generally, a compact strict Morse tangle T is a compact oriented smooth one-dimensional submanifold of C×[a,b], with distinct boundary points on the planes t=a and t=b, transverse to those planes, and with nondegenerate interior critical points of height having distinct critical values. A tangle chord diagram is a finite set of unordered pairs of distinct interior points on the oriented tangle skeleton. Its 4T relation is the same local alternating relation as above on the skeleton. The unframed tangle quotient also sets to zero any chord whose endpoints are consecutive in the order along the same skeleton component; for a circle the order is cyclic and for an arc it is linear. The completed degreewise tangle diagram space is denoted A^Cun(T).

The unframed configuration series of a strict Morse presentation K is the formal degreewise series

Z(K):=∑m≥01(2πi)m∫tmin⁡<tm<⋯<t1<tmax⁡ ∑P(−1)↓(P)[DP]un⋀j=1mdzj−dzj′zj−zj′ ∈A^Cun.

The ordered simplex is divided into chambers by the critical values of t∣K. In each chamber, P ranges over choices, at each level tj, of an unordered pair of distinct points (zj,tj),(zj′,tj) of K. The diagram DP joins the corresponding preimages on the oriented parameter circle. The integer ↓(P) counts endpoints at which t decreases along the orientation of K. The differential form is pulled back to the chamber by the selected local branches. The degree-zero term is the empty diagram with coefficient 1; the displayed integrals are interpreted as improper integrals on each chamber.

For a compact strict Morse tangle T, Z(T) is given by the same formula with T in place of K, the interval (a,b) in place of (tmin⁡,tmax⁡), the chord diagrams on the tangle skeleton in place of circle diagrams, and the corresponding unframed tangle quotient in place of A^Cun. A parenthesized braid is a special case with no interior critical points.

For a parenthesized braid path γ in the configuration space of q distinct complex points, define its Knizhnik–Zamolodchikov (KZ) series by the degreewise iterated-integral holonomy of Ωq=12πi∑1≤i<j≤qtij dlog⁡(zi−zj). Explicitly, if γ:[0,1]→Conf⁡q(C) is an ordinary path with noncolliding endpoints, its holonomy is 1+∑m≥1∫0<tm<⋯<t1<1γ∗Ωq(t1)⋯γ∗Ωq(tm). A tangential endpoint is a limiting collision configuration together with a specified nonzero first-order direction of approach for each colliding cluster. When endpoints have such clusters prescribed by the parenthesizations, the holonomy is the constant term after removing the local logarithmic factors exp⁡(tijlog⁡ε/(2πi)) at each tangential endpoint. A change between the two parenthesizations of three consecutive strands is encoded by the regularized transport ΦKZ.

For parenthesized braids the KZ holonomy takes values in the framed strand algebra, where only tangled 4T is imposed; passing from a closed framed strand diagram to an unframed knot applies the quotient by isolated-chord 1T. Fix a standard hump H by starting with the two-critical-point unknot and inserting one local birth of a maximum-minimum pair; thus H has two local maxima. The normalized unframed Kontsevich series of K is

I(K):=Z(K) Z(H)−r(K)∈A^Cun,

The normalization uses one copy of Z(H) for each local maximum; its degree-zero term is 1, so its inverse is interpreted in the product completion. This definition makes no assertion that the unnormalized KZ coefficients are rational or that equal Kontsevich series separate knot types.

The following figure illustrates the positive Artin generator σ1 and parenthesization conventions. Height increases upward, the right-bottom strand is the overstrand under the determinant crossing convention, and the labels at the ends record the ordered parenthesizations; no proof below relies on the drawing.

((12)3)((21)3)¾1t

Depends on

Used by

Dependency tree · two levels

10 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