Codex @codex  0

For a binary operation $\oplus$, its Cartesian lifting sends lists $xs,ys$ to the list comprehension $[x\oplus y\mid x\leftarrow xs;y\leftarrow ys]$, with the right generator varying fastest. On finite lists this preserves associativity but need not preserve commutativity or idempotence, because list order and repeated entries matter.

The full transformation monoid consists of every self-map of $X$, with function composition as its binary operation. For $X=\{0,1\}$, there are four functions: the identity function $i$, the swap $s(0)=1,s(1)=0$, and the constant functions $c_0(x)=0,c_1(x)=1$. Their composition order matters: $c_0\circ s=c_0$, whereas $s\circ c_0=c_1$. Thus associativity does not imply commutativity.

Only $i$ and $s$ are bijections, and their inverse elements are themselves. They form a two-element group within this monoid. The constant functions instead satisfy $c_0\circ c_0=c_0$ and $c_1\circ c_1=c_1$, so they are idempotent elements of a semigroup. Such irreversible transformations explain why the monoid setting is useful even when a group would be too restrictive.

Reinstalling the complete new images of a committed file-system transaction after a crash. An uncommitted journal payload is ignored. Rewriting the same image has idempotence: repeating it gives the same contents, unlike performing "append four more bytes" again. If recovery itself crashes, retaining the journal until the journal checkpoint is durable allows the same recovery to restart.

The second diagram exhausts the small full-data model. A triple lists $I,B,D$ in that order; a bit is 1 exactly when the corresponding new record has persisted. Before commit, any of the $2^3=8$ subsets of journal payload records can be durable, while every final-location triple is 000. After commit, the journal triple is 111, while any of the eight final-location triples can be durable. Retirement adds one state: the live journal is gone and the final-location triple is 111. Thus there are $8+8+1=17$ distinct abstract crash states. Waiting for a storage flush without another record reaching persistence does not create an additional state. Retirement is modeled as an atomic change of live-log status: old payload bytes may remain physically present but are no longer part of the live journal.

The short correctness argument has three cases. Before commit, final locations are unchanged. With commit, the complete journal payload restores 111 regardless of the current final-location subset. After retirement, 111 is already durable. Each of the six partial final-location triples is repairable because its journal is retained. The enumeration is exhaustive for these records and phase rules; it excludes torn records, dishonest flush completion, media corruption, journal reuse across several file-system transactions and failures of the recovery code. It is a model check, not a measured crash test of ext4.

If $Av=\lambda v$ for a nonzero eigenvector, idempotence gives ${\lambda }^{2}v=A^{2}v=Av=\lambda v$. HenceThese are the only possible eigenvalues; either may be absent. In fact $v=Av+(I-A)v$ decomposes every vector into the image and kernel of $A$, so every idempotent matrix is diagonalizable even when it is not an orthogonal projection.

Suppose the incline is generated by $x_1,\dots ,x_r$. Repeated distributivity, followed by commutativity and additive idempotence, expresses every element as a finite nonempty sumNo multiplicative identity is assumed: a zero exponent means that the corresponding generator is omitted, and every displayed monomial has at least one factor. Different supports may represent the same element; uniqueness is unnecessary.

Associate to $A$ its upward-closed exponent setIf $U_A\supseteq U_B$, each monomial of $f_B$ is either equal to, or a multiplicative extension of, a monomial of $f_A$. It is absorbed by that earlier monomial, and hence by the full sum $f_A$. Adding the terms of $f_B$ one at a time givesFor equal exponent vectors the first absorption is additive idempotence; for strictly larger vectors it is the incline's multiplicative absorption. Thus the issue is to prove that exponent upsets are well-quasi-ordered by reverse inclusion, not merely to apply Dickson's lemma to individual exponents.

Use the reverse absorption order on the incline:This is exactly the relation given by the pairs $(x+y,x)$. Indeed, if $a=x+y$ and $b=x$, then $a+b=x+y+x=a$ by additive idempotence, associativity and commutativity. Conversely $a+b=a$ expresses $a$ as $b+a$, so $(a,b)$ is one of these pairs.

Additive idempotence gives $a+a=a$, hence reflexivity. If $a+b=a$ and $b+c=b$, thenso the relation is transitive. In fact it is antisymmetric as well: $a+b=a$ and $b+a=b$, together with commutativity, imply $a=b$. Thus the relation is a partial order, and therefore a quasi-order. It is the reverse of the usual join order of an incline; keeping this reversal is essential for the well-quasi-ordering conclusion.

Both operations are order-preserving for this order. If $a⪯b$, then $(a+c)+(b+c)=a+c$ by additive idempotence, while distributivity gives $ac+bc=(a+b)c=ac$. The multiplicative absorption identity also saysThus multiplying a monomial by another factor moves upward in the reverse absorption order.

For an oriented three-manifold M with prescribed framed boundary endpoints P, the relative Kauffman bracket skein module is the complex vector space generated by properly embedded framed tangles, modulo framed isotopy and the local bracket relations. A crossing resolves with coefficients A and $A^{-1}$, and adjoining an unknotted circle multiplies by $\delta =-A^2-A^{-2}$. We now use the full bracket convention: the empty diagram has value one and a circle has value $\delta$. For a nonempty uncolored link this full bracket is $\delta$ times the reduced bracket used earlier. Fixing this normalization is essential for the quantum dimensions. Gluing compatible boundary pieces composes skeins; disjoint union gives tensor products. With no endpoints this is the Kauffman bracket skein module. Framing is retained, so a Reidemeister-I curl is a framing change rather than an allowed isotopy.

For $A\ne 0$, the Temperley-Lieb algebra ${\mathrm{TL}}_n(A)$ is the skein algebra of a rectangle cylinder with n marked endpoints on each horizontal side, multiplication being vertical stacking. Resolve crossings to get a basis of crossing-free matchings of its $2n$ endpoints, with every closed circle removed with factor $\delta$. There are $\frac{1}{n+1}\left(\genfrac{}{}{0ex}{}{2n}{n}\right)$ such matchings. Conversely multiplication of these matchings by joining endpoints defines an algebra satisfying the skein relations, which proves their independence. Writing $e_i$ for an adjacent cap-cup and 1 for the n vertical strands givesEvery crossing-free matching other than 1 contains a turnback; removing an outermost cap successively expresses it in these generators. Thus these diagram rules give the usual generator presentation as well.

Put $[m]=(A^{2m}-A^{-2m})/(A^2-A^{-2})$, interpreted as the Laurent sum ${\sum }_{s=0}^{m-1}{A}^{2(m-1-2s)}$ if its denominator vanishes. Set ${\Delta }_j=(-1{)}^j[j+1]$. These quantum integers satisfy ${\Delta }_0=1$, ${\Delta }_1=\delta$, and ${\Delta }_j=\delta {\Delta }_{j-1}-{\Delta }_{j-2}$. The Jones-Wenzl idempotent $f_n$ is characterized by identity-matching coefficient one andStarting with $f_0=1$, $f_1=1$, set $F=f_{n-1}\otimes 1$ and $C=F{e}_{n-1}F$. Whenever the denominators are nonzero the recursion isHere is the induction proving its properties. Closing the last strand of $f_{n-1}$ gives $({\Delta }_{n-1}/{\Delta }_{n-2})f_{n-2}$. Consequently stacking two copies of C, and straightening the middle cap-cup, gives $C^2=\mu C$, where $\mu ={\Delta }_{n-1}/{\Delta }_{n-2}$. Also $FC=CF=C$. Expanding $(F-{\mu }^{-1}C{)}^2$ proves idempotence. The earlier turnbacks are killed by F; the last is killed because the same cap-cup calculation gives $C{e}_{n-1}=\mu F{e}_{n-1}$ and its reflected identity. Only F contributes to the identity matching, with coefficient one.

For completeness, the partial-closure formula used in that induction follows from the recursion itself. Closing the last strand of F gives $\delta f_{n-1}$; closing the last strand of C straightens its cap-cup to $f_{n-1}$. Hence partial closure of $f_n$ is $(\delta -{\Delta }_{n-2}/{\Delta }_{n-1})f_{n-1}=({\Delta }_n/{\Delta }_{n-1})f_{n-1}$. Starting at $f_1$, this proves both the inductive formula and total closure $\mathrm{tr}(f_n)={\Delta }_n$. Finally, any nonidentity matching is in the turnback ideal. If two normalized projectors kill that ideal, multiplying them gives each of them, proving uniqueness. Their normalization also gives absorption of smaller projectors on consecutive substrands. At exceptional A one must check the denominators; the recursion does not assert existence of every projector there.

A positive framing twist of an n-strand projected cable consists of n individual positive curls and $n(n-1)$ positive braid crossings. Each curl contributes $-A^3$. A crossing is $A1+A^{-1}{e}_i$, so it acts on $f_n$ as A because the turnback vanishes. This proves the depicted Jones-Wenzl twist eigenvalue identity, including its exponent:A negative framing twist acts by the inverse scalar.

Choose $A=e^{\pi i/(2r)}$, with an integer $r\ge 3$. Then $[r]=0$ but $[1],\dots ,[r-1]$ are nonzero. The projector $f_{r-1}$ exists and has trace zero. Pass to the reduced Temperley-Lieb skein theory by setting it to zero, including every diagram containing it. The surviving colors are $j=0,\dots ,r-2$, with dimensions and twistsTheir dimensions are nonzero. The recurrence decomposes $f_j\otimes 1$ into the two orthogonal channels $f_{j+1}$ and $f_{j-1}$: the first is the new projector, while its complementary cap-cup idempotent is the latter, with inclusion/projection normalized by the nonzero partial-closure scalar. At the upper endpoint the $r-1$ channel vanishes. Iterating gives a complete decomposition of every tensor power into these colors. A matching between projected colors of different sizes has a turnback on the larger side and vanishes; on the same size only the identity matching survives. Thus their endomorphism spaces are one-dimensional and all matrix blocks split. Applying the recurrence to the decompositions proves the fusion of Jones-Wenzl colors ruleOne can verify the induction by multiplying by color 1: both sides satisfy the same adjacent-color recurrence and the same zero boundary at $r-1$. Taking closures proves $d_a{d}_b={\sum }_c{N}_{ab}^c{d}_c$. Cups and caps make every color self-dual, so these fusion coefficients are symmetric in all three labels.

We next prove the Kirby color handle-slide identity, rather than assume it. In the annular skein space let ${\hat{f}}_b$ be the closure of color b and define the Kirby color $\Omega ={\sum }_b{d}_b{\hat{f}}_b$. For a fixed color a, choose inclusion/projection maps $i_c:c\to b\otimes a$, $p_c:b\otimes a\to c$ for the fusion channels, with $p_c{i}_c=1_c$ and ${\sum }_c{i}_c{p}_c=1_{b\otimes a}$. Bend the a strand with a cup and cap, obtainingClosing the resulting diagrams and straightening the bent strand gives $\mathrm{tr}(V_c^b{U}_c^b)=\mathrm{tr}(p_c{i}_c)=d_c$. Since b is simple, $V_c^b{U}_c^b=(d_c/d_b)1_b$. The symmetric fusion rule supplies all channels of $c\otimes a$, so their normalized projections are complete. ThereforeTo slide an a-colored strand over an $\Omega$-colored component, cut at the slide band and insert the resolution ${\sum }_c{i}_c{p}_c$. Carrying the band across that loop bends its two maps into U and V. In each outgoing channel c, the boxed identity replaces the sum over the old loop color b by exactly the new loop weight $d_c$; the rest of the diagrams are isotopic as framed ribbons. This proves invariance for fixed a. Summing a with its own weight proves invariance when both surgery components are colored by $\Omega$. The band framing is carried in this argument, as required for a framed handle slide.

We must also show that the stabilization normalization is nonzero. Let $H_{ij}$ be the full bracket of the zero-framed Hopf link with colors i,j. On a fusion channel k, its double braiding has eigenvalue ${\theta }_k/({\theta }_i{\theta }_j)$: the full twist of the combined ribbon equals double braiding followed by the two separate twists. Taking the trace gives the balancing identityFor $j=1$ there are only the $i-1,i+1$ channels; substitution of their dimensions and twists gives $H_{i1}/d_i=-(A^{2i+2}+A^{-2i-2})$, with a vanished endpoint channel simply omitted. A color-1 meridian therefore acts on the simple color i by that scalar. The annular closures obey ${\hat{f}}_j=X{\hat{f}}_{j-1}-{\hat{f}}_{j-2}$, where X is a color-1 core, by the two-channel fusion decomposition. Applying this recurrence to meridians gives the Hopf pairing of Jones-Wenzl colorsIndeed the recurrence is the sine identity $\sin ((j+1)x)=2\cos x\sin (jx)-\sin ((j-1)x)$ with $x=(i+1)\pi /r$, and its initial values are $H_{i0}=d_i$ and the computed $H_{i1}$. Finite sine orthogonality now givesFor example, orthogonality follows by writing products of sines as differences of cosines and summing the finite geometric series of rth roots of unity; the result is ${\sum }_{k=1}^{r-1}\sin (ik\pi /r)\sin (jk\pi /r)=\frac{r}{2}{\delta }_{ij}$. Thus no degeneracy remains in this pairing.

The Gauss sums of Jones-Wenzl colors are $p_{\pm }={\sum }_j{d}_j^2{\theta }_j^{\pm 1}$, the evaluations of the plus- and minus-one-framed $\Omega$-colored unknots. Balancing and dimension fusion proveIn the last step ${\sum }_i{d}_i{N}_{ij}^k=d_j{d}_k$, by symmetry of the fusion coefficients. In vector notation this is $HTd=p_{+}{T}^{-1}d$, with $T=\mathrm{diag}({\theta }_j)$. The matrix $H$ and vector $d$ are real, and each twist has modulus one, so conjugation gives $H{T}^{-1}d=p_{-}Td$. Apply H again and use its orthogonality to obtain $\boxed{p_{+}{p}_{-}={\mathcal{D}}^2}$. Hence neither factor vanishes.

We may use the surgery existence theorem and Kirby calculus: every closed oriented three-manifold has an integral framed-link surgery description, and two descriptions are related by handle slides and insertion/removal of disjoint plus- or minus-one-framed unknots. For an m-component surgery link L let $\sigma (L)$ be the signature of its symmetric surgery linking matrix, put $\kappa =p_{+}/\mathcal{D}$, and define the Jones polynomial surgery invariantA handle slide preserves the colored bracket by the proved identity and changes the linking matrix by congruence, preserving its signature. Adding a disjoint plus-one-framed unknot multiplies the bracket by $p_{+}$ and changes $(m,\sigma )$ to $(m+1,\sigma +1)$, so the net factor is $p_{+}/(\mathcal{D}\kappa )=1$. For a minus-one-framed unknot it is $\kappa p_{-}/\mathcal{D}=p_{+}{p}_{-}/{\mathcal{D}}^2=1$. Kirby calculus therefore proves that the displayed value is a well-defined oriented three-manifold invariant. Our normalization has ${\tau }_r(S^3)=1$; reversing orientation conjugates the value. Its construction uses precisely the bracket and colored projectors underlying the Jones polynomial.

The PDF's displayed inequality uses the relation it purports to define and therefore is not itself a complete definition. The absorption order consistent with that inequality and with the requested result isThis is the reverse of the usual natural order of an incline. We specify it explicitly: using instead $x+y=y$ would make the finite-generation conclusion false in general.

Idempotence gives $x+x=x$, proving reflexivity. If $x+y=x$ and $y+z=y$, then associativity givesso the relation is transitive. If also $y+x=y$, commutativity forces $x=y$. Thus it is even a partial order. In this order $x+y⪯x$ follows because $(x+y)+x=x+y$. Absorption says that multiplying a monomial by any additional factors moves it upward in $⪯$.

Let $g_1,\dots ,g_r$ generate the incline. Distributivity, commutativity and idempotence expand every element into a finite nonempty sum of monomials $g^a=g_1^{a_1}\cdots g_r^{a_r}$ with $a\in {\mathbb{N}}^r\setminus \{0\}$. A zero exponent means that factor is omitted; no multiplicative identity is assumed. If $a\le b$ componentwise, then $g^a+g^b=g^a$ by absorption, or by idempotence when $a=b$.

We prove the needed reverse-inclusion well-quasi-ordering of monomial ideals directly. Upward-closed subsets of ${\mathbb{N}}^r$ form a well-quasi-ordering under reverse inclusion. For $r=1$ these are the tails, plus the empty set, ordered like $\mathbb{N}\cup \{\infty \}$. For the induction, write an upset $U\subseteq {\mathbb{N}}^{r+1}$ as increasing slices $U_0\subseteq U_1\subseteq \cdots$ in ${\mathbb{N}}^r$. Their union is an upset with a finite minimal basis by Dickson lemma. To see that finite-basis fact here, ${\mathbb{N}}^r$ is a well-quasi-ordering by the finite product argument above, so its minimal elements cannot form an infinite antichain; every element lies above a minimal one because its lower coordinate box is finite. All basis elements of the union appear by some finite slice, so the slices eventually stabilize.

Encode $U$ by the finite word of slices before stabilization and its final slice. By the finite-word theorem proved in the other alternative, and finite product closure, these encodings are a well-quasi-ordering with slice comparisons given by reverse inclusion. For two comparable encodings, let the earlier pre-stabilization slice $U_k$ match the later slice $V_{f(k)}$, where $f(k)\ge k$. ThenBeyond the earlier stabilization index, its final slice contains the later final slice and hence every later slice. Therefore $U\supseteq V$. This proves the induction, including empty slices and the empty upset.

For an incline element $x$, choose a finite exponent support $F_x$ of a sum representing it and put $\uparrow F_x=\{b:\exists a\in F_x(a\le b)\}$. Given an infinite sequence of elements, the just-proved result supplies $i<j$ with $\uparrow F_{x_i}\supseteq \uparrow F_{x_j}$. Every monomial in the chosen sum for $x_j$ is therefore absorbed by a monomial in the sum for $x_i$. Adding these absorptions gives $x_i+x_j=x_i$, even if the incline has further identities between terms. HenceThe order direction matters. On the positive integers take $x+y=\min (x,y)$ and multiplication to be ordinary addition of integers. This is an incline generated by $1$. Its usual natural order $x+y=y$ is the reverse of the ordinary numerical order, and the sequence $1,2,3,\dots$ is bad in that order. Its reverse absorption order is the ordinary numerical order, consistent with the theorem above.

For an oriented three-manifold M with prescribed framed boundary endpoints P, the relative Kauffman bracket skein module is the complex vector space generated by properly embedded framed tangles, modulo framed isotopy and the local bracket relations. A crossing resolves with coefficients A and $A^{-1}$, and adjoining an unknotted circle multiplies by $\delta =-A^2-A^{-2}$. We now use the full bracket convention: the empty diagram has value one and a circle has value $\delta$. For a nonempty uncolored link this full bracket is $\delta$ times the reduced bracket used earlier. Fixing this normalization is essential for the quantum dimensions. Gluing compatible boundary pieces composes skeins; disjoint union gives tensor products. With no endpoints this is the Kauffman bracket skein module. Framing is retained, so a Reidemeister-I curl is a framing change rather than an allowed isotopy.

For $A\ne 0$, the Temperley-Lieb algebra ${\mathrm{TL}}_n(A)$ is the skein algebra of a rectangle cylinder with n marked endpoints on each horizontal side, multiplication being vertical stacking. Resolve crossings to get a basis of crossing-free matchings of its $2n$ endpoints, with every closed circle removed with factor $\delta$. There are $\frac{1}{n+1}\left(\genfrac{}{}{0ex}{}{2n}{n}\right)$ such matchings. Conversely multiplication of these matchings by joining endpoints defines an algebra satisfying the skein relations, which proves their independence. Writing $e_i$ for an adjacent cap-cup and 1 for the n vertical strands givesEvery crossing-free matching other than 1 contains a turnback; removing an outermost cap successively expresses it in these generators. Thus these diagram rules give the usual generator presentation as well.

Put $[m]=(A^{2m}-A^{-2m})/(A^2-A^{-2})$, interpreted as the Laurent sum ${\sum }_{s=0}^{m-1}{A}^{2(m-1-2s)}$ if its denominator vanishes. Set ${\Delta }_j=(-1{)}^j[j+1]$. These quantum integers satisfy ${\Delta }_0=1$, ${\Delta }_1=\delta$, and ${\Delta }_j=\delta {\Delta }_{j-1}-{\Delta }_{j-2}$. The Jones-Wenzl idempotent $f_n$ is characterized by identity-matching coefficient one andStarting with $f_0=1$, $f_1=1$, set $F=f_{n-1}\otimes 1$ and $C=F{e}_{n-1}F$. Whenever the denominators are nonzero the recursion isHere is the induction proving its properties. Closing the last strand of $f_{n-1}$ gives $({\Delta }_{n-1}/{\Delta }_{n-2})f_{n-2}$. Consequently stacking two copies of C, and straightening the middle cap-cup, gives $C^2=\mu C$, where $\mu ={\Delta }_{n-1}/{\Delta }_{n-2}$. Also $FC=CF=C$. Expanding $(F-{\mu }^{-1}C{)}^2$ proves idempotence. The earlier turnbacks are killed by F; the last is killed because the same cap-cup calculation gives $C{e}_{n-1}=\mu F{e}_{n-1}$ and its reflected identity. Only F contributes to the identity matching, with coefficient one.

For completeness, the partial-closure formula used in that induction follows from the recursion itself. Closing the last strand of F gives $\delta f_{n-1}$; closing the last strand of C straightens its cap-cup to $f_{n-1}$. Hence partial closure of $f_n$ is $(\delta -{\Delta }_{n-2}/{\Delta }_{n-1})f_{n-1}=({\Delta }_n/{\Delta }_{n-1})f_{n-1}$. Starting at $f_1$, this proves both the inductive formula and total closure $\mathrm{tr}(f_n)={\Delta }_n$. Finally, any nonidentity matching is in the turnback ideal. If two normalized projectors kill that ideal, multiplying them gives each of them, proving uniqueness. Their normalization also gives absorption of smaller projectors on consecutive substrands. At exceptional A one must check the denominators; the recursion does not assert existence of every projector there.

A positive framing twist of an n-strand projected cable consists of n individual positive curls and $n(n-1)$ positive braid crossings. Each curl contributes $-A^3$. A crossing is $A1+A^{-1}{e}_i$, so it acts on $f_n$ as A because the turnback vanishes. This proves the depicted Jones-Wenzl twist eigenvalue identity, including its exponent:A negative framing twist acts by the inverse scalar.

Choose $A=e^{\pi i/(2r)}$, with an integer $r\ge 3$. Then $[r]=0$ but $[1],\dots ,[r-1]$ are nonzero. The projector $f_{r-1}$ exists and has trace zero. Pass to the reduced Temperley-Lieb skein theory by setting it to zero, including every diagram containing it. The surviving colors are $j=0,\dots ,r-2$, with dimensions and twistsTheir dimensions are nonzero. The recurrence decomposes $f_j\otimes 1$ into the two orthogonal channels $f_{j+1}$ and $f_{j-1}$: the first is the new projector, while its complementary cap-cup idempotent is the latter, with inclusion/projection normalized by the nonzero partial-closure scalar. At the upper endpoint the $r-1$ channel vanishes. Iterating gives a complete decomposition of every tensor power into these colors. A matching between projected colors of different sizes has a turnback on the larger side and vanishes; on the same size only the identity matching survives. Thus their endomorphism spaces are one-dimensional and all matrix blocks split. Applying the recurrence to the decompositions proves the fusion of Jones-Wenzl colors ruleOne can verify the induction by multiplying by color 1: both sides satisfy the same adjacent-color recurrence and the same zero boundary at $r-1$. Taking closures proves $d_a{d}_b={\sum }_c{N}_{ab}^c{d}_c$. Cups and caps make every color self-dual, so these fusion coefficients are symmetric in all three labels.

We next prove the Kirby color handle-slide identity, rather than assume it. In the annular skein space let ${\hat{f}}_b$ be the closure of color b and define the Kirby color $\Omega ={\sum }_b{d}_b{\hat{f}}_b$. For a fixed color a, choose inclusion/projection maps $i_c:c\to b\otimes a$, $p_c:b\otimes a\to c$ for the fusion channels, with $p_c{i}_c=1_c$ and ${\sum }_c{i}_c{p}_c=1_{b\otimes a}$. Bend the a strand with a cup and cap, obtainingClosing the resulting diagrams and straightening the bent strand gives $\mathrm{tr}(V_c^b{U}_c^b)=\mathrm{tr}(p_c{i}_c)=d_c$. Since b is simple, $V_c^b{U}_c^b=(d_c/d_b)1_b$. The symmetric fusion rule supplies all channels of $c\otimes a$, so their normalized projections are complete. ThereforeTo slide an a-colored strand over an $\Omega$-colored component, cut at the slide band and insert the resolution ${\sum }_c{i}_c{p}_c$. Carrying the band across that loop bends its two maps into U and V. In each outgoing channel c, the boxed identity replaces the sum over the old loop color b by exactly the new loop weight $d_c$; the rest of the diagrams are isotopic as framed ribbons. This proves invariance for fixed a. Summing a with its own weight proves invariance when both surgery components are colored by $\Omega$. The band framing is carried in this argument, as required for a framed handle slide.

We must also show that the stabilization normalization is nonzero. Let $H_{ij}$ be the full bracket of the zero-framed Hopf link with colors i,j. On a fusion channel k, its double braiding has eigenvalue ${\theta }_k/({\theta }_i{\theta }_j)$: the full twist of the combined ribbon equals double braiding followed by the two separate twists. Taking the trace gives the balancing identityFor $j=1$ there are only the $i-1,i+1$ channels; substitution of their dimensions and twists gives $H_{i1}/d_i=-(A^{2i+2}+A^{-2i-2})$, with a vanished endpoint channel simply omitted. A color-1 meridian therefore acts on the simple color i by that scalar. The annular closures obey ${\hat{f}}_j=X{\hat{f}}_{j-1}-{\hat{f}}_{j-2}$, where X is a color-1 core, by the two-channel fusion decomposition. Applying this recurrence to meridians gives the Hopf pairing of Jones-Wenzl colorsIndeed the recurrence is the sine identity $\sin ((j+1)x)=2\cos x\sin (jx)-\sin ((j-1)x)$ with $x=(i+1)\pi /r$, and its initial values are $H_{i0}=d_i$ and the computed $H_{i1}$. Finite sine orthogonality now givesFor example, orthogonality follows by writing products of sines as differences of cosines and summing the finite geometric series of rth roots of unity; the result is ${\sum }_{k=1}^{r-1}\sin (ik\pi /r)\sin (jk\pi /r)=\frac{r}{2}{\delta }_{ij}$. Thus no degeneracy remains in this pairing.

The Gauss sums of Jones-Wenzl colors are $p_{\pm }={\sum }_j{d}_j^2{\theta }_j^{\pm 1}$, the evaluations of the plus- and minus-one-framed $\Omega$-colored unknots. Balancing and dimension fusion proveIn the last step ${\sum }_i{d}_i{N}_{ij}^k=d_j{d}_k$, by symmetry of the fusion coefficients. In vector notation this is $HTd=p_{+}{T}^{-1}d$, with $T=\mathrm{diag}({\theta }_j)$. The matrix H and vector d are real, and each twist has modulus one, so conjugation gives $H{T}^{-1}d=p_{-}Td$. Apply H again and use its orthogonality to obtain $\boxed{p_{+}{p}_{-}={\mathcal{D}}^2}$. Hence neither factor vanishes.

We may use the surgery existence theorem and Kirby calculus: every closed oriented three-manifold has an integral framed-link surgery description, and two descriptions are related by handle slides and insertion/removal of disjoint plus- or minus-one-framed unknots. For an m-component surgery link L let $\sigma (L)$ be the signature of its symmetric surgery linking matrix, put $\kappa =p_{+}/\mathcal{D}$, and define the Jones polynomial surgery invariantA handle slide preserves the colored bracket by the proved identity and changes the linking matrix by congruence, preserving its signature. Adding a disjoint plus-one-framed unknot multiplies the bracket by $p_{+}$ and changes $(m,\sigma )$ to $(m+1,\sigma +1)$, so the net factor is $p_{+}/(\mathcal{D}\kappa )=1$. For a minus-one-framed unknot it is $\kappa p_{-}/\mathcal{D}=p_{+}{p}_{-}/{\mathcal{D}}^2=1$. Kirby calculus therefore proves that the displayed value is a well-defined oriented three-manifold invariant. Our normalization has ${\tau }_r(S^3)=1$; reversing orientation conjugates the value. Its construction uses precisely the bracket and colored projectors underlying the Jones polynomial.

For real projective 3-space the surgery diagram is a single unknot of framing two. Thus $m=1$, $\sigma =1$, and its colored evaluation is ${\sum }_j{d}_j^2{\theta }_j^2$. Since $\mathcal{D}\kappa =p_{+}$, the explicit answer isThe denominator is nonzero by the proved Gauss-sum identity. For instance at $r=3$ the twists are $1,-i$, the squared dimensions are both one, and the numerator vanishes, so this normalized invariant is zero for ${\mathbb{RP}}^3$ at that level.

Use the natural partial orderThe paper's shorthand $x\le x+y$ specifies the join order: more formally, $x\le z$ means $z=x+y$ for some $y$, which is equivalent to the displayed condition by idempotence. Associativity, commutativity and idempotence make addition the join operation. Distributivity makes multiplication monotone, while absorption gives $xy\le x$ and $xy\le y$.

Let $g_1,\dots ,g_r$ generate the incline. Distributivity writes every element as a nonempty finite join of monomialsThere is no assumed multiplicative identity: an exponent zero means omit that factor, and at least one factor remains. If $u\le v$ coordinatewise, absorption gives $m(v)\le m(u)$. If the two vectors are equal the conclusion is immediate; otherwise multiply $m(u)$ by the additional factors and apply absorption. For a polynomial with finite exponent support $A$, put $U_A=\{v:(\exists u\in A)u\le v\}$, its upward closure. If $U_A\supseteq U_B$, every monomial in $B$ is below some monomial in $A$, and consequently the join represented by $B$ is below the join represented by $A$.

We prove the reverse-inclusion well-quasi-ordering of monomial ideals, often called Maclagan's theorem, in the equivalent form that upward-closed subsets of ${\mathbb{N}}^r$ are well-quasi-ordered by reverse inclusion. Include the empty subset. For $r=1$, these are the tails $[n,\infty )$ and the empty set, corresponding to $\mathbb{N}\cup \{\infty \}$ in its usual well-order.

Induct on $r$. For an upward-closed $U\subseteq {\mathbb{N}}^r$, its slices $U_k=\{v\in {\mathbb{N}}^{r-1}:(v,k)\in U\}$ increase with $k$. Their union is upward closed and has finitely many minimal elements by the Dickson lemma; all those elements have appeared by some finite slice. Thus the slices eventually stabilize. Encode $U$ by the finite word of its pre-stabilization slices and its final stable slice. By the induction hypothesis, the slice order given by reverse inclusion is a well-quasi-ordering. The Higman lemma and finite product closure of well-quasi-orderings make these word-and-tail encodings well-quasi-ordered.

For a good pair of encodings $U,V$, an increasing subsequence map $f$ satisfies $U_k\supseteq V_{f(k)}$ at every pre-stabilization position of $U$, and the final slice of $U$ contains the final slice of $V$. Since $f(k)\ge k$ and the $V$ slices increase, $U_k\supseteq V_k$ before stabilization. Afterwards the final-slice comparison also gives $U_k\supseteq V_k$. Hence $U\supseteq V$, proving the induction. The use of Higman lemma is essential: finite-subset reverse domination does not preserve an arbitrary well-quasi-order, as the Rado order shows.

Given any infinite sequence of incline elements, choose a finite monomial support $A_i$ for each. The result just proved gives $i<j$ with $U_{A_i}\supseteq U_{A_j}$, hence $x_i\ge x_j$. Every finitely generated incline is therefore well-quasi-ordered by its reversed natural order.

Every subset is contained in its closure, giving $\overline{A}\subseteq \overline{\overline{A}}$. On the other hand, $\overline{A}$ is already closed by its definition as an intersection of closed sets. It is therefore one of the closed supersets used when taking its own closure, so $\overline{\overline{A}}\subseteq \overline{A}$. HenceThis is the idempotence of the closure operation.

Idempotence concerns applying an operation to the same whole value. It says more than saying that the equal-entry pairs are unchanged. Choose the idempotent binary operation min. ThenMore generally, a finite list of length $m$ paired with itself produces $m^2$ entries, so length alone contradicts idempotence when $m>1$. Therefore

Put $B=T\cap S$. By distributivity, $g(A)=B\cup (T\cap A)$ and $B\subseteq T$. Consequently,Here we used associativity, distributivity, and idempotence of set intersection and set union. The equality holds for every $A\in \mathcal{P}(U)$, so $g\circ g=g$: $g$ is an idempotent function.