Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedPipeline-generated
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.

Scalar evaluation of framed Kauffman link diagrams

Statement

Put A=Z[a±1,s,d±1]/(s(d−1)−(a−a−1)). This ring is an integral domain and embeds in Q(i)(a,s) by d↦1+(a−a−1)/s, where i2=−1. A link diagram means a finite generic immersion of circles in the oriented plane with over/under data at its double points. Regular isotopy is generated by planar isotopy and Reidemeister moves II and III. A positive curl is a one-crossing curl whose oriented self-crossing has sign +1; its sign is independent of the direction chosen on its component. There is a unique function P from link diagrams, including the empty diagram, to A with P(∅)=1, unchanged by regular isotopy, satisfying the following local rules: a positive or negative curl multiplies P by a or a−1; a disjoint trivial circle multiplies P by d; and P(L+)−P(L−)=s(P(L0)−P(L∞)). Here in an oriented disk with four cyclically labelled endpoints 1,2,3,4, L+ connects 1 to 3 over the strand from 2 to 4, and the two smoothings are chosen so that the oriented smoothing for any orientation making this crossing positive is L0; L− reverses the crossing and L∞ is the other smoothing. Rotating the disk interchanges both differences and preserves the rule. In particular the empty diagram freely generates the quotient of the free A-module on closed diagrams by these rules.

Facts & Assumptions

Given: Finite link diagrams, the Reidemeister moves, and the indicated crossing, curl and smoothing conventions.

[F1]

Crossings can be switched independently. Switching changes only over/under data, and smoothing a crossing removes that crossing. Operations in disjoint crossing disks commute.

[F2]

The oriented crossing sign changes when exactly one of its two incident strands is reversed. The sum of crossing signs between two distinct oriented closed components is even: modulo two it is the number of transverse intersections of their closed planar shadows, which is even by the inside/outside parity rule for a closed plane curve.

[F4]

Gauss lemma over a UFD: products of primitive polynomials over a UFD are primitive, and a primitive polynomial is irreducible exactly when it is irreducible over the fraction field. Its proof also shows irreducibles of a UFD are prime.

[F5]

Proof

1.1givenconstructbase

We first construct the original, sum-skein version over F=Q(b,t). Set h=(b+b−1)/t−1. Its desired normalization is L(◯)=1, positive and negative curls have factors b,b−1, an extra trivial circle has factor h, and its skein equation is L(D)+L(ScD)=tCc(D), where Sc switches crossing c and Cc(D)=L(EcD)+L(ecD) is the sum over its two smoothings. All constructions are by induction on the crossing number N. At a given N, first define single-component diagrams; then define diagrams with increasing numbers of components. The crossing-free value on r≥1 circles is hr−1. Throughout the induction the lower-crossing functions satisfy the stated equations and invariance under moves whose diagrams have fewer than N crossings.

2.1F1step 1.1algebraIH

Assuming the function known below N, switching crossing c transports a proposed value x to Tc(x)=−x+tCc(D). Repeating this switch is the identity because its two smoothings do not depend on the crossing sign. Two switches c,j commute as transports: applying the lower-crossing skein relation at the remaining crossing in each smoothing gives Cc(D)+Cc(SjD)=t∑u∈{Ec,ec},v∈{Ej,ej}L(uvD)=Cj(D)+Cj(ScD). Consequently TjTc(x)=x−tCc(D)+tCj(ScD)=x−tCj(D)+tCc(SjD)=TcTj(x). Thus an expansion along a fixed set of switches is independent of their order. Explicitly, for an ordered list c1,…,ck and Dj=Scj⋯Sc1D, its value obtained from a prescribed terminal value u(Dk) is (−1)ku(Dk)+t∑j=1k(−1)j−1Ccj(Dj−1). This identity follows successively from the two-term transport rule, so it uses only already-defined evaluations of diagrams with at most N−1 crossings.

3.1step 1.1step 2.1construct

For a directed point p on a one-component diagram, switch exactly those crossings first encountered underneath when following the component from p. The terminal diagram Up is descending and is an unknot: lift its traversed part above the untraversed part and draw that part away successively until only framing curls remain. Give it terminal value bw(Up), where w is oriented writhe. Define Q(D,p) by the switch expansion of step 2.1 with this terminal value, and define L(D)=(Q(D,p)+Q(D,pˉ))/2, where pˉ reverses the direction at the same point. Use this average also when D is descending for one directed point; bw(Up) is a terminal scalar, not a second prescription for L(D). For a multi-component diagram having a component over all the others, prescribe L(D)=hL(C)L(D−C), with C considered alone. If no component is over all the others, for every component C choose a point and either direction, switch its undercrossings with other components so that it lies over all the others, and use terminal value hL(C)L(D−C). Define L(D) as the average of these 2r switch expansions, where r is the number of components. The terminal factors are already defined: single-component diagrams are defined first at level N, and deleting one component decreases component number if the remaining crossing number is still N. The expansion sums have fewer crossings.

4.1F1step 2.1step 3.1algebra

The multi-component switch set for lifting a fixed component is independent of point and direction, so step 2.1 makes its expansion independent of these choices. For a knot, moving the point past one encounter with a crossing toggles exactly that crossing in the descending switch set. The two terminal descending diagrams differ by switching this crossing, which is the first or last encounter from the new point. Their terminal values satisfy the required sum-skein equation: if their writhes are v+1,v−1, the two smoothings have values bv and hbv. To see this, the smoothing that separates the traversed initial portion produces two descending unknots with one over the other; the other is their connected sum with possibly one direction reversed. Their total self-writhe is v, since the mutual crossing-sign sum of the two separated portions is zero: one lies over the other, and their algebraic planar intersection number is zero. Both diagrams reduce by pulling these overlying arcs away, followed by removing curls, so their evaluations follow from lower-crossing invariance and curl factors. The equation is bv+1+bv−1=t(1+h)bv. By commuting the toggled switch to the beginning of the expansion, this terminal equality makes Q(D,p) unchanged. Moving the point around all arcs proves point independence. Averaging the two directions makes direction independence explicit. Agreement with the terminal scalar on descending diagrams is deferred until after regular-isotopy invariance; point independence alone does not identify the two directed expansions.

5.1step 2.1step 3.1step 4.1induction

The resulting function satisfies the sum-skein equation at every crossing. For a knot choose the directed point so the selected crossing is first in the expansion of the diagram in which it is incorrect; the two expansions differ by that initial transport, giving the equation. For a link, compare the expansions used in step 3.1. If the crossing is a self-crossing of the component being lifted, apply the lower-complexity equation to its single-component terminal factor and to every smoothing term. If it belongs only to the remaining link, apply the equation to that terminal factor and to every smoothing term. If its two strands lie on different components and the lifted component is one of them, commute that crossing to the first switch position; the two terminal lift diagrams agree and the initial transport gives the equation. If the lifted component is neither one, the lower-crossing equation applies to all smoothing terms and to the remaining-link factor. For clarity, the consistency with an already overlying component has a separate two-layer comparison. Suppose A is above the rest and the selected lift is B. Commute the switches of B with components other than A before its mutual switches with A. Smoothing one of these earlier switches leaves A over the resulting lower-crossing diagram, so induction factors out hL(A); their alternating sum is exactly the lift expansion for D−A. For the remaining comparison both A and B are above the remaining link R. If R is nonempty, every smoothing of an A,B crossing merges them into a single component above R; induction factors its value as hL(R) times its isolated knot value. Both terminal orders have the identical value h2L(A)L(B)L(R). If R is empty, there is no factor hL(R) to extract, and both terminal orders instead have value hL(A)L(B). It remains to compare the two-component lift expansion with hL(A)L(B). Switch self-crossings in A and B until each is descending; the difference of these two quantities changes sign under each such switch, since every smoothing correction has fewer crossings and agrees by induction. For descending A,B with A above B, straighten the descending two-component diagram to two disjoint circles by nonincreasing moves and curl removals. This comparison respects each such move directly at the level of its switch expansion: for a cancelling crossing pair u,v, the correction is t(Cu(D)−Cv(SuD))=0, since the two opening smoothings agree and the other two give the same signed curl; a move III changes the order of two switches and is exactly the transport-square identity of step 2.1, with its smoothed diagrams related by a cancelling pair. Terminal writhe and scalar products obey the same curl factors. Thus the difference is zero at the end and hence at the start. This proves the required two-component comparison, and then the preceding factorizations prove the direct-overlying prescription for the original link. Every averaging summand therefore obeys the same skein equation.

6.1step 1.1step 2.1step 3.1step 4.1step 5.1induction

To verify the curl rule, place the point outside the curl and commute its switch, if any, to the end of the expansion. At lower crossing number the skein equation and descending values recover every directed expansion from L, by step 2.1 and induction. For either direction, if the curl of sign ε∈{1,−1} is first encountered over, its terminal factor is bε and every smoothing outside the curl retains it, giving bεL(D0), where D0 has the curl removed. If first encountered under, switch it; the switched curl has factor b−ε by the preceding case. Its two smoothings are D0 and D0⊔◯, so the transport gives (−b−ε+t(1+h))L(D0)=bεL(D0). Here the lower-crossing circle rule applies, and t(1+h)=b+b−1. This proves the curl rule for both directed summands and hence their average; the component-lift products give the same calculation for links. An extra disjoint circle contributes h in every terminal product and every smoothing term, so induction gives the circle rule as well. A descending arc can be pulled away without adding crossings by moves III and cancelling pairs by moves II, leaving curls. When used in step 4.1 these reductions concern diagrams with fewer than N crossings, so they use only the induction hypothesis.

7.1step 2.1step 5.1step 6.1induction

For move II, switching both crossings of a cancellable bigon leaves the evaluation unchanged. Indeed, expand at one crossing and then the other: the switched-diagram terms have positive combined sign, and the two smoothing sums cancel. The smoothings in which the bigon opens are the same diagram on either expansion; the other two smoothings each produce the same curl of the same sign on the same strand, so their values agree by step 6.1. Choose the basepoint and component lift so that the overpassing local arc is traversed or lifted first. Neither crossing is then switched in that local portion; all switches occur outside it, each smoothing term has fewer crossings, and the terminal descending or layered product loses the bigon without changing its writhe or factors. Induction gives invariance. If the chosen lift instead meets the underpassing arc, use the just-proved simultaneous switching identity to make it the overpassing arc; the same argument applies. This covers a bigon on one component and on two distinct components, and proves both directions of move II.

8.1step 2.1step 5.1step 6.1step 7.1induction

For move III, label the three local arcs by their height order. First give them the height order in which they are first encountered in a chosen traversal or component-lift expansion. There are then no local switches, and corresponding switches outside the disk produce identical terminal values and lower-crossing smoothing terms related by the same move, giving invariance by induction. The six possible height orders are connected by exchanging adjacent heights. Such an exchange switches one corresponding crossing on both sides of the move. Apply the sum-skein equation at those crossings: each sum of the old and switched evaluations is t times a pair of smoothing evaluations. The two pairs agree. One smoothing cancels the two remaining crossings by move II or identifies them by planar isotopy; the other slides a cup past them. Here is an endpoint description of the cup slide, independent of any BMW presentation. In the following diagram words the factors are stacked from top to bottom in their written left-to-right order. In a three-strand rectangle let ej denote the actual crossing-free cup and cap joining adjacent positions j,j+1, and xj the actual crossing at those positions. The diagrams e1x2x1 and x2x1e2 both reduce to the diagram with upper cup (1,2), lower cap (2′,3′), and an untwisted strand from 3 to 1′. Slide the arc attached to the cup across the two crossing disks; the two successive over/under encounters then bound a bigon and cancel by move II. Likewise x1x2e1 and e2x1x2 reduce to upper cup (2,3), lower cap (1′,2′), and the strand from 1 to 3′. Reflecting the crossing data gives the same cancellations for x1−1,x2−1. These are identities of the smoothed diagrams by planar deformation and move II, concerning at most N−1 crossings, rather than assumed identities in an abstract algebra. Thus the equality of old evaluations is equivalent to equality of switched evaluations. The adjacent-height exchanges reach every type III configuration, proving move III invariance for every traversal, component choice and outside diagram. Consequently a descending knot U now has L(U)=bw(U): pull its descending arc away by nonincreasing moves II and III until only curls remain, then use step 6.1. This uses the just-proved invariance at N, not a direct prescription in step 3.1. Finally expand the established skein equation along the switches for any directed point p. The terminal value is now L(Up)=bw(Up), so step 2.1 gives Q(D,p)=L(D), for both directions. Thus the average agrees with every directed expansion, including on descending knots. This closes the simultaneous crossing-number induction over F.

9.1F2step 6.1step 8.1algebra

Extend the field by i2=−1, replace b by ia and t by −is, and for a nonempty unoriented diagram D temporarily choose orientations and put D♭(D)=−i−w(D)(−1)c(D)L(D;ia,−is), where c(D) is its number of components. This does not depend on orientations. Reversing one whole component changes writhe by minus twice its mutual crossing-sign sum with all the other components, hence by a multiple of four by [F2]. The phase is unchanged. The same formula is unchanged by moves II and III because writhe and component number are unchanged by these moves and L is invariant. A positive curl multiplies the phase by i−1 and L by ia, giving factor a; a negative curl gives i(ia)−1=a−1. Its value on one trivial circle is 1.

10.1F2step 5.1step 9.1algebra

We verify the difference-skein signs rather than importing the Dubrovnik conversion. If the chosen global orientations make the crossing in L+ negative, interchange L+,L− and also L0,L∞; proving the equation after both interchanges is equivalent to the original equation. We may therefore take this crossing positive and write w=w(L+) and c=c(L+). Switching gives writhe w−2 and the same component number, so D♭(L+)−D♭(L−)=−i−w(−1)c(L(L+)+L(L−)). The sum-skein equation gives the common factor (−i−w(−1)c)(−is) times the sum of the two smoothing evaluations. For the oriented smoothing L0, writhe is w−1 and component parity reverses; its phase is therefore exactly (−i−w(−1)c)(−i). The other smoothing has the opposite phase. If the original crossing is between distinct components, orient it after first reversing one entire incident component: that changes writhe by a multiple of four, changes the removed crossing to negative, and merging gives writhe congruent to w+1 modulo four and reverses component parity. If the crossing is a self-crossing, the oriented smoothing splits its component into two; to orient the other smoothing reverse one of these portions. Their mutual crossing-sign sum is even by [F2], so this reversal changes the remaining writhe by a multiple of four. The other smoothing then has writhe congruent to w−1 and retains component parity. In both cases its phase is the negative of the phase for L0. Substitution proves D♭(L+)−D♭(L−)=s(D♭(L0)−D♭(L∞)).

11.1F3F4F5step 9.1step 10.1algebra

Under the substitution, the original extra-circle factor becomes h=((ia)+(ia)−1)/(−is)−1=−(a−a−1)/s−1. The extra factor (−1) from component number changes this to 1+(a−a−1)/s. Let d denote this element and put P(D)=dD♭(D) for nonempty D, and P(∅)=1. It has the desired curl, skein and loop rules, including the first circle. We justify every factorization fact needed for the coefficient injection. A polynomial ring B[x] over a UFD B is a UFD: factor the content using factorization in B, factor its primitive part over Frac⁡(B)[x] by [F5], and clear denominators and contents of the factors. Their product is primitive by [F4], so comparison of contents makes the remaining scalar a unit of B. Irreducibility of the primitive factors is [F4]; comparing contents and the fraction-field factorizations proves uniqueness. Starting from Z by [F3] and iterating proves Z[a,d,s] is a UFD. Inverting a and d preserves this property: factor each numerator, discard factors associated to a or d since they become units, and compare two such factorizations by clearing powers of a,d and using uniqueness in the polynomial ring. A remaining prime stays prime because divisibility after clearing those powers is ordinary divisibility by a prime different from a,d. Thus B=Z[a±1,d±1] and B[s] are UFDs. The element d−1 is prime in B, since substituting d=1 has kernel (d−1) and domain quotient Z[a±1]. It does not divide a−a−1, whose value at d=1 is nonzero. Hence f=s(d−1)−(a−a−1) is primitive over B, and it is irreducible over Frac⁡(B) because it is linear. By [F4] it is irreducible and therefore prime in B[s]. Its quotient A is a domain. Its localization at the nonzero element s is injective: sku=0 in a domain implies u=0. Eliminating d there gives a subring of Q(i)(a,s) with d=1+(a−a−1)/s, and thus the claimed injection. No choice principle is needed in these finite factorizations.

12.1step 3.1step 6.1step 10.1step 11.1discharge-induction∎

In fact every value P(D) belongs to A. Induct on crossing number, and at fixed crossing number on the incorrect crossings of a chosen traversal: the difference-skein rule changes an incorrect crossing to a correct one plus two diagrams with fewer crossings, with coefficients ±s. A fully descending diagram is a disjoint union of unknots with framing curls, so its value is a product of powers of a±1 and d. The induction therefore uses only coefficients in A. The same reduction proves uniqueness of a function satisfying the stated rules. Extend P linearly to the free A-module on diagrams. Its kernel contains the defining skein, curl and loop relations and regular-isotopy differences, so it descends to their quotient; its value on the empty diagram is 1. The descending reduction shows the empty diagram spans this quotient, and the descended function is a left inverse to the scalar map A→KT0(A). This map is consequently injective as well as surjective, proving the freeness assertion.

Depends on

Used by

Dependency tree · two levels

35 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