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.

Endpoint regularization and associator coherence

Statement

For q≥0, let A^C(q) be the degreewise completion of the algebra generated by tij=tji for 1≤i<j≤q, with [tij,tkl]=0 for four distinct indices and [tij,tik+tjk]=0 for distinct i,j,k. The generator tij is a chord joining strands i,j. Set Ωq=(2πi)−1∑i<jtij dlog⁡(zi−zj); tangential endpoint transport removes the local residue factors. For 1≤i≤q, let ϵi:A^C(q)→A^C(q−1) delete strand i and kill any diagram with a chord endpoint on it. Let Δi:A^C(q)→A^C(q+1) double strand i into adjacent parallel copies and sum over all assignments of its chord endpoints to either copy. For Φ on three strands, let Φijk relabel strands 1,2,3 as i,j,k; Φ⊗id and id⊗Φ place the associator on the indicated three adjacent strands. Products stack from bottom to top, so the rightmost factor acts first. Put Rij:=exp⁡(tij/2).

Let ΦKZ be the regularized KZ transport changing the ordered binary parenthesization ((12)3) to (1(23)). It is invertible, obeys ΦKZ−1=(ΦKZ)321 and ϵi(ΦKZ)=1, and satisfies the pentagon and two positive hexagon identities (id⊗Φ)(Δ2Φ)(Φ⊗id)=(Δ3Φ)(Δ1Φ),Δ1R=Φ312R13Φ132−1R23Φ,Δ2R=Φ231−1R13Φ213R12Φ−1. Here Φ=ΦKZ, and Δ1R (respectively Δ2R) doubles the first (respectively second) strand of R. The negative hexagons are the inverse equations Δ1(R−1)=Φ−1R23−1Φ132R13−1Φ312−1,Δ2(R−1)=ΦR12−1Φ213−1R13−1Φ231. Regularized KZ transports assigned to the same geometric parenthesized braid are independent of the sequence of parenthesization changes.

The diagram shows the five binary parenthesizations of four ordered strands and the associator rotations around the pentagon. It records the face labels used in the proof; the argument uses paths in configuration space.

¢1©¢3©id¬©¢2©©¬id(((12)3)4)((12)(34))1(2(34))1((23)4)((1(23))4)K4

The braid diagram records a positive crossing of strand 1 past the two-strand block (2,3): the lower labels are the strand labels, height increases upward, and each bold right-bottom branch is the overstrand. The crossings occur in the order (1,2) then (1,3); the proof justifies the corresponding path homotopy independently of the drawing.

123231t

Facts & Assumptions

Given: The completed strand algebras, the KZ form, tangential endpoints specified by binary parenthesizations, and a finite degree cutoff N.

[F1]

The Kontsevich integral on parenthesized braids: Ωq=(2πi)−1∑i<jtij dlog⁡(zi−zj); in normalized three-strand coordinates (0,z,1) the equation is G′=(a/z+b/(z−1))G with a=t12/(2πi) and b=t23/(2πi); tangential endpoints remove the local residue factors; strand multiplication stacks diagrams.

[F2]

Tangential KZ regularization and the hump normalization: every nested endpoint cluster has a unique coefficientwise regularized transport; for a cluster S the radial residue is AS=(2πi)−1∑i<j∈Stij.

[F3]

Flatness of the KZ connection and braid relations: the KZ connection is flat in every finite degree, so its transport is invariant under fixed-endpoint path homotopy.

[F4]

Compactified Kontsevich configuration spaces and faces: nested collision diagonals have nonnegative radial coordinates and smooth limiting directions after real oriented blow-up.

[F5]

Framed chord diagrams and four-term relations: the strand algebra imposes the local 4T relation, and its degreewise completion is finite-dimensional at every cutoff.

[F6]

Convergence and composition of Morse tangle integrals: in vertical stacking, the upper tangle factor multiplies on the left, so a later path segment acts on the left of the earlier segment.

Proof

Given: As above. All algebraic operations and limits are performed after truncation at degree N; the compatible finite-degree identities give the completed identities.

1.1F1F5givenconstructalgebra

For a degree-d strand diagram, Δi is the finite sum over the 2k assignments of its k endpoints on strand i to the two new copies. Under this sum, each 4T generator expands into 4T generators on the cabled skeleton: fix the copy choices for endpoints outside the local 4T disk, and the four terms inside that disk are precisely one 4T relation. The same local check shows that deletion either kills all four terms or leaves a 4T relation. Endpoint assignments on stacked diagrams are independent, so cabling preserves stacking; deletion does as well. Thus these operations are algebra maps on the framed 4T quotient and extend degreewise to the completion.

1.2F1F2F4algebra

In a collision chart for a cluster S, write zj=zS+ρuj for j∈S. For internal pairs, dlog⁡(zi−zj)=dlog⁡ρ+dlog⁡(ui−uj); pairs with one label outside S have nonzero limiting denominator and hence are regular in ρ. Therefore the singular radial part of Ωq is AS dρ/ρ with AS from [F2]. Removing ρAS gives the unique tangential transport from [F2]; its degree-zero term is the unit, hence Φ and every endpoint transport are invertible in the product completion.

1.3F1F6constructalgebra

For a concatenation of paths γ1 followed by γ2, split the ordered integration simplex for each degree according to the number of integration times lying in the second segment. The later times occur on the left in the integrand, so summing the pieces gives U(γ2∗γ1)=U(γ2)U(γ1), the declared bottom-to-top convention. This also proves that subdivision does not change the total holonomy.

2.1F1F2F3F4step 1.2step 1.3constructalgebra

For four ordered real strand positions, quotient by translation and positive scaling and write the three normalized gaps as g1,g2,g3>0 with g1+g2+g3=1. Their chamber is an open triangle. The two corners g1=g2=0 and g2=g3=0 are triple collisions; real oriented blow-up replaces each corner by the interval of relative gap scales. The compactified chamber is a pentagon. Its five vertices are (((12)3)4), ((12)(34)), 1(2(34)), 1((23)4), and ((1(23))4). One route from (((12)3)4) to 1(2(34)) follows the two edges through ((12)(34)); the other follows the three edges through ((1(23))4) and 1((23)4). The edge transports are respectively Δ1Φ,Δ3Φ and Φ⊗id,Δ2Φ,id⊗Φ: a rotation inside a block doubles the strand occupied by that block. Choose the same small interior truncation point in each endpoint collar for both routes. The two truncated paths then have fixed common endpoints in the open triangle of positive gaps; their straight-line homotopy stays in that triangle and avoids every collision. Flatness [F3] and the concatenation rule of step 1.3 equate their transports. Taking the regularized limits supplied by [F2] gives (id⊗Φ)(Δ2Φ)(Φ⊗id)=(Δ3Φ)(Δ1Φ).

2.2F1F2F3step 1.2step 1.3algebra

For two points, a positive half-turn changes arg⁡(z1−z2) by π. Integrating the single commuting KZ term (2πi)−1t12 dlog⁡(z1−z2) gives R12=exp⁡(t12/2). For three points, let strands 2 and 3 approach their prescribed nested collision while strand 1 makes a positive half-turn around their common limiting position. In the limit, dlog⁡(z1−z2) and dlog⁡(z1−z3) become the same differential, so the connection along this path is (2πi)−1(t12+t13)dlog⁡(z1−z2) and its transport is exp⁡((t12+t13)/2)=Δ2R. The underlying braid has two positive crossings, first between labels 1 and 2, then between labels 1 and 3. Cut it at the nested collision endpoints: from bottom to top the factors are Φ−1,R12,Φ213,R13,Φ231−1. The associator factors change only the indicated parenthesizations. The factorized path has the same ordered pairwise crossings; moving their heights continuously while preserving their order is a collision-free homotopy, because each half-turn keeps its crossing pair distinct and the third point remains outside its crossing disk. Flatness [F3] and the path-composition rule of step 1.3 equate the transports, and taking the regularized limits at the nested endpoints using [F2] gives Δ2R=Φ231−1R13Φ213R12Φ−1.

2.3F1F2step 1.2algebra

Reversing the associating path interchanges its two endpoint clusters. Relabeling strands 1,2,3 as 3,2,1 identifies that reversed path with the KZ path defining Φ321; path reversal inverts holonomy, so Φ−1=Φ321. Under deletion of strand 1 or 3, one of the two residues a,b in the reduced equation of [F1] is zero; the equation is then scalar in its sole generator and its two unit-leading tangential solutions agree, so their ratio is 1. Deleting strand 2 sets both residues to zero. Hence ϵi(Φ)=1 for each i.

3.1F1F2F3step 1.1step 1.3step 2.2algebra

When strand 1 is doubled, let its two copies form the left cluster and move strand 3 in a positive half-turn around that cluster. The limiting logarithmic forms agree, giving transport exp⁡((t13+t23)/2)=Δ1R. Its underlying braid crosses labels 2 and 3 first and then labels 1 and 3. Cutting at the nested collision endpoints gives, from bottom to top, Φ,R23,Φ132−1,R13,Φ312. The factorization preserves this ordered crossing list; moving the crossing heights while preserving their order gives the collision-free homotopy described in step 2.2. Flatness [F3] and the regularized endpoint limits [F2] therefore give Δ1R=Φ312R13Φ132−1R23Φ. Inverting each positive equality reverses the factor order and inverts every factor, yielding the two displayed negative hexagons.

4.1F2F3F4step 1.3algebra∎

For a fixed parenthesized braid, first fix its collision-free path in Conf⁡q(C). Any two subdivisions of that path into ordinary braid pieces have the same transport by the concatenation rule of step 1.3; homotopic choices have the same transport by flatness [F3]. A parenthesization change is a path in the resolved real chamber of ordered positions. Translation and positive scaling identify its interior with the convex simplex of normalized positive gaps. For each tangential endpoint, use [F4] to choose one interior truncation point by assigning each nested collision radius a fixed positive power of ε; use the same point for every decomposition. After joining each truncated edge path to these common collar points, the paths lie in the simplex with fixed endpoints. Their straight-line homotopy stays in the simplex and avoids collisions, so flatness equates their transports. Letting ε↓0 and removing the nested residue factors gives equality of the regularized transports by [F2]. Thus changing the sequence of parenthesization changes does not change the transport assigned to the fixed geometric braid.

Depends on

Used by

Nothing in the library uses this result yet.

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