R ENDICONTI
del
S EMINARIO M ATEMATICO
della
U NIVERSITÀ DI P ADOVA
D INO S OLA
Nullification number and flyping conjecture
Rendiconti del Seminario Matematico della Università di Padova, tome 86 (1991), p. 1-16
<http://www.numdam.org/item?id=RSMUP_1991__86__1_0>
© Rendiconti del Seminario Matematico della Università di Padova, 1991, tous droits réservés.
L’accès aux archives de la revue « Rendiconti del Seminario Matematico della Università di Padova » (http://rendiconti.math.unipd.it/) implique l’accord avec les conditions générales d’utilisation (http://www.numdam.org/conditions).
Toute utilisation commerciale ou impression systématique est constitutive d’une infraction pénale. Toute copie ou impression de ce fichier doit conte- nir la présente mention de copyright.
Article numérisé dans le cadre du programme Numérisation de documents anciens mathématiques
http://www.numdam.org/
DINO
SOLA (*)
1. Introduction.
In this paper we shall introduce a new invariant for
alternating
knots and links in
R 3, namely
the nullificationnumber,
andapply
it tosolve the
« flyping conjecture-
in someparticular
cases.The
concept
of nullification number is a very natural one: it pro-vides,
in one sense, a measure of thecomplexity
of the link. Its defini- tion isquite
similar to that ofunknotting
number(even
if thedevelop-
ment of the relative
theory
iscompletely different),
and arises from theconcept
of nullification of acrossing.
The latter notion has come force-fully
on to the scene of knottheory
thanks to the appearenceduring
thelast six years, of a
great
manypolynomial
invariants definedthrough
formulas
involving operations
ondiagrams.
One of thesepolynomial
in-variants is the two-variable
polynomial K(l, ~n)
of Lickorish and Millett([Lickorish
andMillett]),
ad it is not atall surprising
that the nullifica- tion number of a minimalalternating projection
K is thehighest
powerof m
appearing
in thepolynomial K(l, ~n).
This will beproved
in anotherpaper
(see [Sola]).
In the second
section,
webegin by defining
the nullification number of a minimalprojection,
and then showthat,
foralternating
minimalprojections,
the nullification number caneasily
be calculated from theprojection.
We also show that twoprojections
ofisotopic
links have thesame nullification number. The
proof
of these facts are based on somerecent results from the
theory
ofalternating
knots. Even if the nullifi- cation number is also defined fornon-alternating
minimalprojections,
it is still an open
problem
to understand how to calculate it in this case, and whether any two minimalprojections
ofisotopic non-alternating
links have the same nullification number.
(*) Indirizzo dell’A.:
Department
of Mathematics,University
of California, Santa Barbara, CA 93106, U.S.A.In the third section we
apply
the invariance of the nullification num-ber to show that certain
alternating
links admitexactly
one minimalprojection (up
to ambientisotopy)
onS~.
For these links we thus prove the
famous flyping conjecture
of P. G.Tait,
which states that any two minimalalternating projections
of thesame
alternating
link are related via a finite sequence offlyping operations:
We obtain the result of the
uniqueness
of the minimalprojection
forthose
alternating
linkshaving
nullification numberequal
to1, n -1,
and
2,
where n is thecrossing
number of the links. While the first two classes containonly
one link fore each value of thecrossing number,
theother one is a very
large
classe. Forexample,
the classicalpretzel
knotsp(a, b, c)
with a,b,
c all even or allodd,
have nullification numberequal
to 2.
If x is an
alternating
link with 3o(x) % n(X) -
2(where o(x)
de-notes the nullification number and
n(x)
the number ofcrossings
in aminimal
projection), x
may have more than one minimalprojection.
Inthese cases,
given
a minimalprojection K,
there can be some non-triv-ial
flyping operations
which transform K into differentprojections.
2. Nullification number.
If x is a tame link in
R 3,
we shallalways
denoteby K
a minimal pro-jection
of x onS2,
andby k
ageneric regular projection
of x. IfIK
is notminimal, K
denotes a minimalprojection
of the linkrepresented by K.
All theprojections
we consider are orientend.Let us recall that
by
an orientednullification
of acrossing
of a reg- ularprojection
K is meant thefollowing
process on thediagram
K:Fig.
1.(X means Z
or~).
For aprojection K, ,Ko
is theprojection
obtainedfrom K
by nullifying
acrossing (Ko ,
as well as all theprojections
weconsider,
is defined up to ambientisotopy
ofS2 ).
HenceK
andKo
areprojections
which areeverywhere identical, except
in a small diskwhere
they
differ as shown infig.
1.EXAMPLE. Let K be the
following (minimal) projection
of thefigure-8-knot:
By
the aboveconventions,
if wenullify
the centralcrossing
weobtain:
Now,
let K be a minimalregular projection
of a nontrivial linkX,
Koi
a nullification of K(that
is aprojection
obtained from Knullifying
one of its
crossings)
andKol
a minimalprojection equivalent
toKo,,
inthe sense that
ko,
andKol
areprojections
ofisotopic
links. IfKol
doesnot
represent
a triviallink,
we cannullify
acrossing of Ko,
and callKoi o2
a minimal
projection
of the nullification ofK01.
This process can go onuntil
Kol ... 0, represent
a trivial link. The sequence of minimalprojec-
tions
~Kol , Kol ~ , ... , Ko1...or ~
is called anullification
sequence for the minimalprojection K;
r is thelength
of the sequence. A nullification se- quence for K is said to be minimacl if it is of minimallength
among all the nullification sequences for K.DEFINITION. If K is a minimal
projection,
thenullification
num-ber
o(K)
of K is thelength
of a minimal nullification sequence for K.Obviously o(K)
= 0 if andonly
if Krepresents
a trivial link. If K is theprojection
of thefigure-8-knot
of theprevious example,
it is easy tosee that
o(K)
= 2. A minimalprojection
of the trefoil knot has nullifica- tion numberequal
to 2. There are minimalprojections K
with arbitrari-ly high crossing
number and witho(K) = 1;
forexample:
We shall see that the nullification number of a minimal
alternating projection
can beeasily calculated,
and also that minimalalternating projections
ofisotopic
links have the same nullification number. To dothat,
we shall use some facts aboutalternating
knots. Let usbegin
withthe
following
fundamental result([Kauffman]):
THEOREM 1. An
alternating projection
is minimal if andonly
if itdoes not contain an isthmus.
An isthmus in a
projection
onS 2
is acrossing
such that two of thefour local
regions
ofS2
around thatcrossing globally belong
to the sameregion.
Hence ageneric
isthmus of aprojection
onS’
is in thefollowing
situation:
Fig.
2.Notice that a
projection containing
isthmi isnecessarily
the con-nected sum of two
simpler projections,
that is:Fig.
3.Another fact we shall use is the
following (Corollary
6 in[Mura- sugi]) :
THEOREM 2. If
~1 and e2
arealternating links,
thenwhere
n(2)
denotes thecrossing
number of the link2,
and # denotes the connected sum.It follows from Theorem 2 that a
projection
which is a connectedsum of two minimal
alternating projections
isnecessarily minimal,
even if
non-alternating:
COROLLARY 3. Let K be a
regular projection
such that K == K1 # K2 , K1
andK2 being
minimalalternating projections.
Then K isalso minimal.
PROOF. We have x
= xi # 3Q and, by
Theorem2, n(x)
=n(X1)
++
n(,N2).
Then:hence K is a minimal
projection. 8
LEMMA 4. If K is an
alternating projection
thenKo
is alsoalternating.
PROOF. We use the
following
notation:Then an
alternating projection « locally »
looks like:No matter which way we
nullify
acrossing
in thepreceding picture,
we still
get
analternating diagram.
Now we introduce a useful definition.
DEFINITION. Let
K
be aregular projection
onS2.
Twocrossings
Pand
Q
are said to befacing
ifthey
are in thefollowing
situation:Fig.
4.The
following
fact isevident,
and will berepeatedly
used.LEMMA 5. Two
crossings
in aprojection
K arefacing
if andonly
ifnullifying
one of the twocrossings produces
an isthmus in the other.If P
and Q
arefacing
we write P 1~iQ.
To befacing
defines anequiv-
alence relation in the set of the
crossings
of agiven projection,
once weassume,
by convention,
that acrossing
isalways facing
to itself. Acrossing
which is notfacing
to any othercrossing
is said to beisolated.
If P is a
crossing
of a minimalprojection K,
let us suppose that thew-equivalence
class of P contains rcrossings,
r > 1.If Ko
is theprojec-
tion obtained from K
by nullifying
one of these rcrossings,
we haven(Ko ) % n(10 - r,
whereKo
is minimal aprojection equivalento
to K.This is clear from
fig.
5Fig.
5.If K is a minimal
alternating projection
the lastinequality
becomesan
equality.
PROPOSITION 6. Let K be a minimal
alternating projection,
P acrossing
of K andKo
theprojection
obtained from Kby nullifying
P. IfKo
is a minimalprojection equivalent
toKo ,
thenwhere r is the
cardinality
of the!~-equivalence
class of P.PROOF. Let us first suppose that P is an isolated
crossing,
i.e.r = 1. We want to show that
Ko
is a minimalprojection.
Since
Ko
isalternating (Lemma 4), by
Theorem 1 it suffices to show thatKo
does not have isthmi.Suppose
thatKo
has an isthmusQ: then, by
theprevious lemma,
Pand Q
would befacing, contradicting
thehy- pothesis
that P is isolated. HenceKo
is minimal.Let us now consider the case in which P is not
isolated,
that is r~ 1.We want to show that
Ko
is a minimalprojection.
Since
Ko
isalternating, (fig. 5),
it suffices to show thatKo
does not have istmi. Let us suppose thatKo
has an isthmusQ: then,
as we havealready pointed out,
Pand Q
would befacing
in K(clearly Q
can be alsoconsidered a
crossing
ofI~.
But then the~-equivalence
class of Pwould contain more than r
elements,
a contradiction. Hence K is minimal.The
preceeding proposition
is false fornon-alternating projections;
a
counterexample
isgiven by projection 820
in the table of Rolfsen’s book[Rolfsen].
If we
nullify
thecrossing brought
outby
the arrows weget:
Any
othernullification
of K =820 (that
is anyprojection
obtainedfrom K
nullifying
acrossing
different fromP)
does notrepresent
a triv- ial link. Henceo(K)
=1,
butonly
one nullification sequence is minimalsuch a situation could not
happen
for minimalalternating projections:
in fact we will prove
(Theorem 8)
that all the nullification sequences ofa minimal
alternating projection
have the samelength.
We are now
ready
to calculate the nullification number of a minimalalternating projection.
We recall that theSeifert
circles of aregular projection K
onS2
are thedisjoint
closed curves into which theprojec-
tion is transformed if we
nullify
all thecrossings simultaneausly.
Example:
We will indicate
by s(K)
the number of Seifert circles of theprojec-
tion
K. Hence,
if K is the minimalprojection
of the trefoil of theprevi-
ous
picture,
we haves(K)
= 2.The next observation will be used in the
proof
of Theorem 8.LEMMA 8. If
K1
andK2
are minimalalternating projections
of thelink
X,
thens(K1 )
=s(K2 ).
PROOF. Let
Sx
denote the Seifert surface for the link x builtby
ap-plying
Seifert’salgorithm ([Rolfsen],
p.120)
to theprojection
K. It iswell-know
(see
for instance[Burde-Zieschang]
prop.13.26)
thatSx
is aspanning
surface of minimal genus forx,
this genusbeing equal
to thegenus
g(X)
of x. Now(see [Rolfsen],
exercise10,
p.121)
the genus ofSx
isgiven by:
where
c(x)
= number ofcomponents
of ~,.The lemma follows
immediately
from the above formula.THEOREM 9. If K is a minimal
alternating projection,
any nullifi- cation sequence of K haslength n(K) - s(K)
+1,
therefore is minimal.Hence,
the nullification number of a minimalalternating projection
isgiven by
the formula:PROOF. Induction on n =
n(K),
the number ofcrossings
of K. Ifn = 0 the result is true.
Then,
let us supposen(K) = n > 0.
If is a nullification sequence ofK,
let P be a cross-ing
of K that one hasnullify
to transform K intoKo,.
Wedistinguish
two cases.
i)
P is an isolatedcrossing
of K. ThenKo,
is a minimalprojection
(Proposition 7)
andMoreover
by
Lemma 8. Since and (the inductive
hypothesis,
we have r =n(K) - s(K)
+ 1.ii)
P is not isolated. Let{P = PI, P2, ..., Pt}
be the)o(-equiva-
lence class of P. If
Ko
is the minimalprojection equivalent
toKol
ob-tained as in
fig. 5,
we haven(Ko )
=n(K) - t (Proposition 7).
We seefrom
fig.
5 thats(K)
=s(Ko )
+ t -1. Now we haven(Kol ) = n(Ko )
ands(K01)
=s(Ko ), by
Lemma 7. Sinceo(K)
=o(K01)
+1,
from the inductivehypothesis o(K01)
=n(K01) -
+1,
so we stillget
the result for K.Now we show that the nullification number is an invariant for alter-
nating
links.THEOREM 10. If K and K’ are minimal
alternating projection
ofisotopic
links x andx’,
theno(K)
=o(K’).
PROOF. If we compare the formula for in Lemma 8 with the formula of Theorem 9 we obtain:
which proves the invariance of
By
Theorem10,
thefollowing
definition makes sense:DEFINITION. If x is an
alternating link,
the nullification number of is the nullification number of a minimalalternating projection
of x.
Theorem 9 remains true if K is
merely supposed
to be a connectedsum of minimal
alternating projections (then K
is alsominimal,
in viewof
Corollary 3).
To see this let us first show that the nullification num-ber behawes well with
respect
to connected sums.PROPOSITION 11.
If K1
andK2
are minimalalternating projections
and
K = Kl # K2 ,
thenPROOF. The situation is the
following:
Let us recall
that , by Corollary 3,
if K’ and K" are minimal alternat-ing projections,
then K’ # K" is also minimal. Itreadily
followsthat,
inthe
hypothesis
of theproposition, o(K)
=o(Kl )
+o(K2 ).
Nowapplying
Theorem 9 to
K,
andK2 yields:
3.
Application
to theflyping conjecture.
Now we want to
apply
the invariance of the nullification number to show that certainalternating
links admitonly
one minimalprojection on S.
Alternating
links x with = 1.If K is a minimal
alternating projection
of x witho(K) = 1,
from theformula
o(K)
=n(K) - s(K)
+ 1 weget n(K)
=s(K). Now,
we can look atthe Seifert circles as
«polygons»,
where the verticescorrespond
tocrossings
of theprojection.
If aprojection
has noisthmi,
all its Seifertpolygons
have at least two vertices. Ifs(K)
=n(K),
every Seifertpoly-
gon must have
exactly
twovertices; hence,
ifo(K) = 1,
thefamily
of theSeifert
polygons
of K on S is thefollowing
Hence the
projection K
must be of this form:(n(K ) crossings; n(K ) even)
Fig.
6.Alternating
links x with =n(x) -
1.If K is a minimal
alternating projection
of witho(K)
=n(K) + 1,
then
s(K)
=2,
so that every Seifertpolygon
hasn(K)
vertices. Thus there isonly
onepossible
minimalalternating projection, namely:
(n(K) crossings)
Fig.
7.Alternating
links x witho(X)
= 2.For all minimal
alternating projections
of % we haves(K)
=n(K)
+ 1. Since the total number of vertices of the Seifertpoly-
gons of K is 2 -
n(K),
there areonly
twopossibilities:
i)
there aren(K) -
32-gons
and two3-gons.
ii)
there aren(K) -
22-gons
and one4-gons.
It is now worth
recalling
that theSeifert
circlesof first type
are those which bound asimply
connectedregion
of82 - (K),
where(K)
isthe union of the Seifert circles of K. A Seifert circle which is not of first
type
is said aSeifert
circleof
secondtype.
It is clear that if a
2-gon
is of secondtype
its vertices areisthmi:
Hence the
2-gons
of K are of firsttype.
Case
i)
Let us see that both the3-gons
arenecessarily
of firsttype.
Infact,
if one of the3-gons
were of secondtype,
we would havethe
following
situation for K:Since such a
projection
containsisthmi,
it cannot be minimal. Hence in casei)
all the Seifertpolygons
are of firsttype,
and there areonly
two
possible
kinds of minimalprojections
for every each value ofn(K):
a,
b,
codd;
knotFig.
8.3-component
linka, b, c even and # 0
Fig.
9.Note that the
preceding projections represent pretzel
linksp(a, b, c),
where theintegers
a,b,
c have the samesign.
Case
ii) According
to whether the4-gon
is of first or of secondtype,
there are twopossible projections:
a and b even and # 0;
non-prime
link with 3 componentsFig.
10.a and b even and # 0; knot.
Fig.
11.So we have classified all the minimal
alternating proj ections K
with= 2 and
(and n(m * 4).
Now we want to show that a link repre- sentedby
one of theseprojections
admitsonly
one minimalprojection.
First of all we observe that
projections
whichbelong
to differenttypes
among the four we have listed cannot
represent isotopic
links: this fol-lows
easily
from a calculation ofcrossing
numbers and of the number ofcomponents, together
with the fact thatpretzel
links areprime.
It
only
remains to prove that twoprojections belonging
to the sametype represent isotopic
links if andonly
ifthey
are the sameprojection (in S2 ).
Aproof
of this isgiven
in the nextsection,
where the variousprojections
aredistinguished by
means of their Kauffman’s bracketpolynomial.
4. Calculations.
In this section we shall see that each of the
projections
infig.
8through
11 areuniquely
determinedby
the set of coefficients involved in our notation. This isenough
to conclude that twoprojections belong- ing
to the sametype
offigure represent isotopic
links if andonly
ifthey
are the same
projection
onS2. By
section3,
this proves theuniqueness
of the minimal
projection
for thealternating
links with nullification number 2.Our tool will be the bracket
polynominal
defined in[Kauffman].
If K is an unoriented linkdiagram,
the bracket of K is theelement (K)
ofZ[A,
A-1 ]
definedby
means of thefollowing
rules:where,
in formulas(i)
and(ii),
0 denotes the unknot.If each
crossing
of an oriented knotprojection
isgiven
a value + 1 or-1,
wheresigns
are chosenaccording
tofig. 1,
the twist number(or writhe) w(K)
of K is defined as the sum of the values of thecrossing
ofK. Then the Laurent
polynomial f [K]
definedby
is an ambient
isotopy
invariant for oriented links(see [Kaufmann]).
Let us denote
by (n)
theprojection
offig.
6(or 7),
where n is thenumber of
crossings.
Wehave,
for n >3,
since ((2)) = A + A -1.
If
b, c)
denotes the unorientedprojections
offig.
8 or9,
wehave:
Now observe that if and
only
if(p(a, b, c))
=~~(a’ , b’ , c’)).
It is easy to see that the coefficient ofA a-2
in the aboveexpression
for(p(a, b, c))
is a + 1.Calculating (p(a, b, c))
in a different way we obtain that the coefficientof A b-2
and ofA c-2
are b + 1 and c + 1respectively.
This shows thatp(a, b, c)
de-pends
on the(non-oriented)
set{ a, b, c } ,
once we have noted thatp(a, b, c) = p(b,
c,a) ~ p(c,
a,b) = p(b,
a,c).
Let us now observe that the
projection
offig.
10 is(a)
#(b).
Sincexi # 3Q = 21 # j62
if andonly
if:Xl = 21
and3Q = £% (up
toreordering),
we deduce the
uniqueness
of the minimalprojection
for the links repre- sentedby fig.
10.To obtain the same result for the
projections
offig. 11,
let us calcu-late the bracket
polynomial
of thoseprojections,
which we denoteby
(a, b).
Since(a, b) = (b, a)
it will beenough
to showthat ((a, 6))
de-pends only
on the set{a, b}.
We have:Last
expression depends
on the set{a, b} (not only
on the sum a +b),
as
required.
REFERENCES
G. BURDE - H.
ZIESCHANG., Knots,
DeGruyter
Studies inMathematics,
5, DeGruyter,
Berlin-NewYork,
1985.L. H.
KAUFFMAN.,
State models and the Jonespolynomial, Topology,
26(1987),
pp. 395-407.
W. B. R. LICKORISH - K. C.
MILLETT.,
Apolynomial
invariantof oriented
links,Topology,
26(1987),
pp. 107-141.K.
MURASUGI.,
Jonespolynomial
and classicalconjectures
in knottheory, Topology,
26(1987),
pp. 187-194.D.
ROLFSEN.,
Knots andlinks,
Publish or Perish Math. Lecture Ser.(1976).
D.
SOLA.,
On them-degree of
the two-variablepolynomial P(l,
m)of
a link,preprint.
Manoscritto pervenuto in redazione il 3
gennaio
1990 e, in formarevisionata,
il 31 marzo 1990.