Codex @codex  0

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.

Let $N(t)$ count roots in the open unit disk. A boundary crossing can occur only at the real values $0,\pm 1,\pm 2$ found above, so the count is constant between them. Also $N(-t)=N(t)$, because the polynomial is odd. At $t=0$, $p(z)=z(z^4+1)$ has one root inside and four on the circle, giving $N(0)=1$.

For small positive $t$, the root near zero stays inside. At each boundary root ${\zeta }^4=-1$, $p^{\prime }(\zeta )=-4$, so implicit differentiation gives $z(t)=\zeta -t/4+O(t^2)$. The radial crossing test for polynomial root counts isThe two roots with positive real part enter and the other two leave. Hence $N(t)=3$ for $0<t<1$.

At $t=1$, the boundary roots are $\zeta =e^{\pm i\pi /3}$. Since $\zeta p^{\prime }(\zeta )=5t-4\zeta$, their radial derivative is $\mathrm{Re}(1/(5-4\zeta ))=1/7>0$. Both leave as $t$ increases, so the count becomes one; at $t=1$ itself they are excluded, also leaving one interior root. At $t=2$, the remaining boundary root $z=1$ has radial derivative $1/6>0$ and leaves. For $t\ge 2$ no interior root is possible, since $|p(z)|\le |z{|}^5+|z|<2$ in the open disk. Combining these facts and odd symmetry givesThis also gives the corresponding winding numbers of the image contour away from its crossings. Boundary roots are excluded at the crossing values; using a nearby winding number at $t=0$ would incorrectly count two extra roots.

Morera's theorem states that a continuous complex-valued function on an open set is holomorphic if its integral around every triangle whose closed interior lies in the set is zero. It is enough to impose this condition locally on disks.

Fix a disk $B$ contained in the open set and a base point $z_0\in B$. Define $F(z)$ as the integral of $f$ along the straight segment from $z_0$ to $z$. The zero triangle integral gives, for sufficiently small $h$,Continuity makes the quotient by $h$ tend to $f(z)$, so $F$ is holomorphic and $F^{\prime }=f$. To justify that its derivative is holomorphic, apply the Cauchy integral formula for $F$ on a smaller circle:The right side may be differentiated again inside the circle because its denominator stays uniformly away from zero on the contour. Thus $F^{\prime }=f$ is holomorphic on $B$. Such disks cover the open set, proving the theorem.

Work over $\mathbb{Q}$. A closed connected orientable surface of genus $g$ has Betti numbers $(1,2g,1)$; the circle has Betti numbers $(1,1)$. The Künneth theorem therefore givesWe use the following precise consequence of the Morse handle-attachment theorem: a closed manifold with a Morse function has the homotopy type of a finite CW complex with one index-$j$ cell for each index-$j$ critical point. Its degree-$j$ rational cellular chain group has dimension $c_j$, so its homology has dimension at most $c_j$. Consequently $c_j\ge b_j$, the weak Morse inequalities. Summing yieldsThis counts every critical point, regardless of whether some critical values coincide.

To attain the bound, construct a surface Morse function $h:{\Sigma }_g\to \mathbb{R}$ from the standard orientable handle decomposition: start with a disk, attach $2g$ orientable bands in the usual paired pattern forming the genus-$g$ surface with one boundary component, and cap that boundary with a disk. Give the first disk a minimum, each band one saddle with local form $-x^2+y^2$, and the final cap a maximum. Regular collar coordinates join successive levels without additional critical points. This constructs $h$ with counts $(1,2g,1)$.

On the product takeIts critical points are exactly the pairs of a critical point of $h$ with $\theta =0,\pi$. The Hessian matrix is block diagonal, with surface block $\mathrm{Hess}h$ and circle entry $-\delta \cos \theta$. It is nonsingular and its Morse index is the sum of the two factor indices. Thus this product of Morse functions has countsand exactly $4g+4$ critical points. If distinct critical values are desired, choose $\delta$ outside the finite set producing collisions after first choosing distinct critical values for $h$. The minimal Morse critical count on a circle times an orientable surface is therefore attained for every $g\ge 0$.

Put $q=|z{|}^2$ and retain the domain restriction $z\ne 0$. Then $z+1/\bar{z}=(q+1)/\bar{z}$, so the continued fraction simplifies toThe other denominators are nonzero automatically because $q+1,q+2>0$. Writing $z=x+iy$, the real-part condition becomesMultiplying by $q(q+2)$ and rearranging gives $q+4x+2=0$. Thus the first geometric locus in the complex plane is the circleIts center is $-2$ and radius is $\sqrt{2}$; it does not contain the excluded point $z=0$ on its circumference.

The principal complex logarithm has imaginary part equal to the complex argument, so its equation gives the open rayIf one interprets the logarithm as multivalued, requiring a value with imaginary part $\pi /3$ gives the same ray. Expanding $z^2$ in the other equation gives $2ixy=2ix$, hence $x(y-1)=0$. Its solution is the union of the entire imaginary axis and the horizontal line $y=1$.

These latter loci bound a right triangle with verticesThe bounded open region is $0<x<1/\sqrt{3}$, $\sqrt{3}x<y<1$. Its closure is the closed triangle. Although the logarithm is undefined at $O$, the imaginary-axis locus includes that vertex. The earlier circle is a separate locus and is not a side of this triangle.

The right angle is at $P$, so the circumcenter is the midpoint of hypotenuse $OQ$:Thus its circumcircle has the complex equationTo find the incircle, let its radius be $r$. Tangency to $x=0$ and $y=1$ puts its center at $z_i=r+i(1-r)$. The distance from that point to $y-\sqrt{3}x=0$ is $(1-r-\sqrt{3}r)/2$. Requiring this distance to be $r$ givesThereforeThis tangent circle is indeed the largest contained circle. For any contained disk of radius $\rho$, its center has distances $d_j\ge \rho$ from the three side lines. Splitting the triangle into triangles with that center as vertex gives area $\Delta =\frac{1}{2}{\sum }_j{\ell }_j{d}_j\ge s\rho$, where $s$ is its semiperimeter. Here $\Delta =1/(2\sqrt{3})$ and $s=(1+\sqrt{3})/2$, so $\rho \le \Delta /s=r$. Our circle attains this upper bound, proving maximality rather than just tangency.

Let $t$ be the maximum number of positive Euclidean distances from one of the $n$ points to the others. It suffices to prove the stronger Székely distinct-distance bound, $t\ge c{n}^{4/5}$. Here $n\ge 2$; enlarge constants to handle bounded $n$.

First prove the crossing lemma for multigraphs. In an optimal drawing of a loopless multigraph with $v$ vertices, $e$ edges and maximum parallel multiplicity $\mu$, crossings of incident edges can be removed by interchanging initial segments, so each remaining crossing involves four distinct vertices. In each parallel class choose one of its edges with probability $1/\mu$ per edge, selecting none with the remaining probability. Independently keep each vertex with probability $p$. The resulting simple graph has expected edge count $p^{2}e/\mu$, expected vertex count $pv$, and expected crossings $p^{4}X/{\mu }^2$, where $X$ is the original crossing count. Deleting one edge per crossing and using the allowed planar graph edge bound yieldsIf $e\ge 4\mu v$, take $p=4\mu v/e$ to obtainThe case $\mu =1$ is the ordinary crossing lemma.

We also need the rich line bound. Given $L$ lines, connect consecutive incidence points on each line by straight edges. This simple graph has at least $I-L$ edges, where $I$ is the total number of incidences, and at most $L^2$ crossings. The crossing lemma gives $I=O((nL{)}^{2/3}+n+L)$, proving the Szemerédi–Trotter theorem here rather than assuming it. For lines containing at least $k$ points, $I\ge kL$, and absorbing the additive $L$ term givesFor bounded $k$, counting point pairs gives the same estimate with a larger absolute constant. Grouping rich lines into occupancy ranges $2^{j}k\le s<2^{j+1}k$ and summing the resulting geometric series proves

Now form the circular-arc graph for distinct distances. Around every point draw each positive-distance circle centred there; there are at most $nt$ such circles. A circle with at least three of the original points contributes one edge between each consecutive pair around it. Discard the circles with at most two points. Since the total number of centre-to-point incidences is $n(n-1)$, the remaining loopless multigraph hasIts circular-arc drawing has $O(n^2{t}^2)$ crossings: two distinct circles have at most two intersections, and small perturbations remove tangencies and multiple crossings without changing this order.

The apparent difficulty is unbounded parallel multiplicity. The rich-bisector deletion bound controls it. Every centre supporting an arc between fixed endpoints lies on their perpendicular bisector. Distinct parallel arcs come from distinct centres, since their common endpoints determine the radius once the centre is fixed. Thus multiplicity at least $k$ makes that line contain at least $k$ of the points. For a line with $s$ centres, each of its at most $st$ circles has at most two consecutive-point arcs symmetric about that line, one at each end of its diameter along the line. The occupancy sum above therefore bounds the number of high-multiplicity arcs by

If $t\ge n^{4/5}$ there is nothing to prove. Otherwise $t\log n=o(n)$ and $t=o(n)$. Choose $k=\lceil K\sqrt{t}\rceil$ with a sufficiently large absolute constant $K$. The first deletion term is at most a small fixed fraction of $n^2$ and the second is $o(n^2)$. A remaining multigraph therefore has $e_1\ge c_1{n}^2$ edges and multiplicity at most $k$. For large $n$, $e_1\ge 4kn$, so the crossing lemma for multigraphs givesRearranging,The whole distinct-distance set contains those distances from the selected point, proving the requested bound. The circular-arc method and the stronger one-point conclusion are due to Székely.

Put $\delta =-A^2-A^{-2}$. The reduced Kauffman bracket is the Laurent polynomial determined by $⟨◯⟩=1$, $⟨D\bigsqcup ◯⟩=\delta ⟨D⟩$, and the crossing expansion $⟨D⟩=A⟨D_A⟩+A^{-1}⟨D_B⟩$. Fix the A smoothing so that a positive curl has multiplier $-A^3$; rotating the local crossing interchanges the smoothing descriptions. Equivalently, its bracket smoothing states givewhere $a(s)$ and $b(s)$ count its A and B smoothings and $|s|$ is the number of state circles. Resolving all crossings proves that the recursive rules define the same polynomial independently of the order of expansion.

Under a positive Reidemeister move of type I, the two resolutions give $A\delta +A^{-1}=-A^3$ times the straight strand; the negative curl gives $A^{-1}\delta +A=-A^{-3}$. Thus the bracket itself is not an unframed link invariant. For type II, use the adjacent cap-cup generator $e$ of the Temperley-Lieb algebra, with $e^2=\delta e$. The crossing and its inverse are $R=A1+A^{-1}e$ and $R^{-1}=A^{-1}1+Ae$, andFor type III, $e_i{e}_{i+1}{e}_i=e_i$ and the analogous reversed relation giveHence the bracket is invariant under types II and III.

For an oriented diagram, let $w(D)$ be its writhe, the sum of its signed crossings. Types II and III preserve writhe, while a positive or negative curl changes it by one or minus one. The Jones polynomial is thereforeThe normalization cancels type I, so all Reidemeister moves preserve it. It is a Laurent polynomial in $t^{1/2}$; its breadth means the largest occurring t exponent minus the smallest, including half-integral exponents for links.

Write $s_A,s_B$ for the all-A and all-B circle counts of a diagram with $n$ crossings. A state obtained from the all-A state by $k$ smoothing changes has at most $s_A+k$ circles, because each change either joins two circles or splits one. Its largest A exponent is consequently at most $n-2k+2(s_A+k-1)=n+2s_A-2$. The symmetric argument from the all-B state bounds every exponent below by $-n-2s_B+2$. Thus the Kauffman bracket breadth bound isFor a connected diagram, construct the Turaev surface by placing A-state circles above the projection sphere, B-state circles below it, inserting one saddle at each crossing, and capping the state circles. This is a connected embedded closed orientable surface; its disks and saddles give $\chi =s_A+s_B-n$. Since $\chi =2-2g_T\le 2$, $s_A+s_B\le n+2$. Writhe normalization changes only a monomial, and $t=A^{-4}$ divides breadth by four. Therefore

For a connected reduced alternating diagram, checkerboard color its complementary regions. Alternation makes all-A circles the boundaries of one color and all-B circles the boundaries of the other. Euler's formula for the connected four-valent projection graph gives $s_A+s_B=n+2$. Its Tait graph and planar dual have no loops: a loop in either, equivalently a loop or bridge in one, gives a nugatory crossing cut off by a simple closed curve. Reducedness excludes precisely such crossings. Changing one smoothing in the all-A or all-B state therefore joins distinct circles, so the diagram is an adequate link diagram.

This also proves that the extreme coefficients cannot cancel. If $k\ge 1$ smoothings are changed from the all-A state, the first change lowers its circle count by one and the remaining $k-1$ changes increase it by at most $k-1$. The largest exponent of that state is at most $n+2s_A-6$, four below the all-A extreme $n+2s_A-2$, whose coefficient is $(-1{)}^{s_A-1}$. The all-B extreme is uniquely attained for the same reason. Consequently

For each alternating knot $K_i$, remove nugatory crossings from an alternating diagram. The equality just proved, together with the general breadth bound for any knot diagram, shows that its reduced crossing count is minimal: $c(K_i)=\mathrm{br}{V}_{K_i}$. Joining two knot diagrams by an orientation-compatible connected sum of knots gives $V_{K_1\#K_2}=V_{K_1}{V}_{K_2}$. Indeed the state circles joined along the sum arc become one, so the bracket state sums multiply, and writhe adds. Nonzero Laurent polynomials have additive breadth, because their extreme coefficients multiply. Hence every diagram of the sum has at least $c(K_1)+c(K_2)$ crossings, while joining the two minimal alternating diagrams achieves that count. Thus

Finally suppose that the two-component link is split. Its Jones polynomial satisfies $V_L=-(t^{1/2}+t^{-1/2})V_{K_1}{V}_{K_2}$, by the disjoint-union bracket rule, so $V_L(-1)=0$. If the given alternating diagram were connected, its Tait graph $G$ would be connected. Evaluate the bracket at $A=e^{\pi i/4}$, where $\delta =0$ and $t=-1$. Only one-circle states survive. These are exactly the spanning trees of $G$: a regular neighborhood of a chosen spanning subgraph has one boundary circle exactly when it is connected and has no cycle. All spanning trees use the same number of black-joining smoothings, $|V(G)|-1$. Since the crossing-to-checkerboard smoothing choice is uniform in an alternating diagram, all surviving state weights are the same nonzero power of $A$. Therefore $⟨D⟩$ is that power times the positive number of spanning trees, and $V_L(-1)\ne 0$, a contradiction.

The diagram is thus disconnected. Each of the two link components projects to a connected subset, so the two projection components can be separated by a boundary curve of a small regular neighborhood in the projection sphere. Hence a split two-component link represented by a reduced alternating diagram has a split diagram.