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.

Compactified Kontsevich configuration spaces and faces

Statement

Fix either a strict Morse presentation K:S1↪C×R or a compact strict Morse tangle T⊂C×[a,b], and an integer m≥1. For each chamber of the ordered level simplex and each choice of the local branches paired at its levels, let Cm be the resulting open configuration cell. The finite union of these cells has a compactification C‾m that is a compact manifold with corners. Its boundary strata record exactly: adjacent level collisions ti=ti+1; the endpoint faces at tmin⁡,tmax⁡ for a knot or at a,b for a tangle; levels reaching a critical value of the height function; and compatible intersections of these events. Whenever endpoint positions coalesce, real oriented blow-up records their relative scale and limiting direction, including nested collision clusters. The branch-evaluation maps extend smoothly to the resolved faces. Orient each open cell by dt1∧⋯∧dtm and orient every new collision face by the outward-normal-first convention using its nonnegative radial coordinate; a critical-level face uses the local Morse coordinate s≥0 with t−c=±s2 and the same boundary-orientation convention.

The diagram shows the level simplex for m=2. Its diagonal is the equal-level face, the outer edges are the minimum/maximum endpoint faces, and the dashed cuts are critical levels; their intersections are the corner strata.

t2t1t2=ct1=c0t2<t1t1=tmaxt2=tmint2=t1

Facts & Assumptions

Given: Either a strict Morse knot presentation or a compact strict Morse tangle with regular boundary levels, its height function t, and a finite degree m≥1.

[F1]

The Kontsevich integral on parenthesized braids: the degree-m integration domain is the ordered simplex between the boundary or extreme levels with critical levels removed; at each level a pairing chooses two distinct points on the knot or tangle and determines their chord endpoints.

[F2]

Singular knots and Vassiliev derivatives: the knot skeleton is a compact smooth circle. For tangles, the compact one-dimensional skeleton and regular boundary levels are as in [F1]; nondegenerate critical points are isolated.

[F3]

Framed chord diagrams and four-term relations: a degree-m chord diagram has finitely many endpoints, each endpoint lying on the oriented parameter circle.

Proof

Given: As above. All compactifications below are finite-degree and choice-free.

1.1givenF1F2

The critical points are isolated in the compact one-dimensional skeleton and absent from the tangle boundary, so there are finitely many critical points and critical values. On every open interval between consecutive critical values or boundary levels, the inverse image is a finite union of arcs on which t is a local diffeomorphism. Thus the number of branches, and the finite set of allowed pairs at a level, are constant on each such interval.

1.2givenF1F2construct

At a regular level, each branch is a smooth graph z=zλ(t), so its evaluation extends smoothly to any regular face. Near a critical point, choose a local parameter x with t(0)=c, t′(0)=0, and t′′(0)≠0. The function h(x)=(t(x)−c)/x2 extends smoothly with h(0)=t′′(0)/2≠0; after shrinking the coordinate interval, s=x∣h(x)∣ is a smooth coordinate with nonzero derivative and t=c+sgn⁡(h(0))s2. Since z=z(x(s)) is smooth, the two local branches and their limiting common point extend to the critical face in this coordinate.

2.1F1step 1.1algebra

Fix a chamber and let kr be the number of its ordered levels in the rth interval between critical or boundary levels. The chamber is a product of open simplices, one for each interval, with kr ordered coordinates. Its closure is the product of the corresponding closed simplices, hence compact. The facets of a closed simplex are exactly adjacent-coordinate equalities or a coordinate reaching one endpoint of its interval; across the finite family of chambers those endpoints are the knot extrema, tangle boundary levels, or critical values. Thus before resolving endpoint collisions the only faces are level collisions, outer endpoints, and critical-level events.

2.2F1F2step 1.2construct

In a regular-level collision, endpoints on distinct branches remain distinct because K is embedded; endpoints on one branch coalesce along a smooth arc. In the latter case, use local parameters s1,…,sk for the colliding endpoints, their center p=k−1∑sj, the radius r=(∑j∣sj−p∣2)1/2, and the normalized shape (sj−p)/r. Replacing the diagonal r=0 by this shape data is the real oriented blow-up of that collision diagonal; its local coordinates are r≥0 and smooth shape coordinates. At a critical point, step 1.2 supplies the same form with the Morse coordinate s.

3.1F1F3step 2.2construct

For a cluster of several endpoints, first blow up the full collision diagonal and then each proper collision diagonal in its limiting shape space, from larger clusters to smaller ones. Collision subsets in any limiting configuration are either nested or disjoint, so these blow-ups introduce finitely many nonnegative radii rC and smooth shape coordinates. Each resulting chart is a product of half-lines rC≥0 and an open smooth coordinate set; transition maps are smooth because they are changes of center, scale, and unit direction. Hence the resolved cell is a manifold with corners. Each added boundary hypersurface is a collision cluster, and its boundary orientation is determined by the outward vector −∂rC. The original simplex orientation and the local coordinates s≥0 at critical levels give the stated orientations on all remaining faces.

4.1F1F2F3step 2.1step 3.1construct∎

Each chamber closure is compact by step 2.1, and real oriented blow-up replaces a closed collision diagonal by a compact sphere of limiting directions without losing compactness. Only finitely many chambers, branch pairings, and endpoint subsets occur at fixed m, so their resolved union is compact. The boundary labels from steps 2.1 and 3.1 exhaust its boundary faces; no additional face can occur because every boundary coordinate is either a level-gap, a distance to a critical/global endpoint, or one of the finitely many collision radii. The branch evaluations extend by steps 1.2 and 2.2.

Depends on

Used by

Dependency tree · two levels

7 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