A NEW DECOMPOSITION THEOREM FOR 3-MANIFOLDS

Size: px
Start display at page:

Download "A NEW DECOMPOSITION THEOREM FOR 3-MANIFOLDS"

Transcription

1 Illinois Journal of Mathmatics Volum 46, Numbr 3, Fall 2002, Pags S A NEW DECOMPOSITION THEOREM FOR 3-MANIFOLDS BRUNO MARTELLI AND CARLO PETRONIO Abstract. Lt M b a (possibly non-orintabl) compact 3-manifold with (possibly mpty) boundary consisting of tori and Klin bottls. Lt X M b a trivalnt graph such that M \ X is a union of on disc for ach componnt of M. Building on prvious work of Matvv, w dfin for th pair (M, X) a complxity c(m, X) N and show that, whn M is closd, irrducibl and P 2 -irrducibl, c(m, ) is th minimal numbr of ttrahdra in a triangulation of M. Morovr c is additiv undr connctd sum, and, givn any n 0, thr ar only finitly many irrducibl and P 2 -irrducibl closd manifolds having complxity up to n. W prov that vry irrducibl and P 2 -irrducibl pair (M, X) has a finit splitting along tori and Klin bottls into pairs having th sam proprtis, and complxity is additiv on this splitting. As opposd to th JSJ dcomposition, our splitting is not canonical, but it involvs much asir blocks than all Sifrt and simpl manifolds. In particular, most Sifrt and hyprbolic manifolds appar to hav nontrivial splitting. In addition, a givn st of blocks can b combind to giv only a finit numbr of pairs (M, X). Our splitting thorm provids th thortical background for an algorithm which classifis 3-manifolds of any givn complxity. This algorithm has bn alrady implmntd and provd ffctiv in th orintabl cas for complxity up to 9. W dvlop in this papr a thory of complxity for pairs (M, X), whr M is a compact 3-manifold such that χ(m) = 0, and X is a collction of trivalnt graphs, ach graph τ bing mbddd in on componnt C of M so that C \ τ is on disc. In th spcial cas whr M is closd, so that X =, our complxity coincids with that introducd by Matvv [6]. Extnding his rsults w show that complxity of pairs is additiv undr connctd sum and that, whn M is closd, irrducibl, P 2 -irrducibl and diffrnt from S 3, L 3,1, P 3, its complxity is prcisly th minimal numbr of ttrahdra in a triangulation. Ths two facts show that complxity is indd a vry natural masur of how complicatd a manifold or pair is. Th formr fact was known to Matvv in th closd cas, th lattr in th orintabl cas. Rcivd Octobr 2, 2001; rcivd in final form Novmbr 11, Mathmatics Subjct Classification. Primary 57M50. Scondary 57M c 2002 Univrsity of Illinois

2 756 BRUNO MARTELLI AND CARLO PETRONIO Th most rlvant fatur of our thory is that it lads to a splitting thorm along tori and Klin bottls for irrducibl and P 2 -irrducibl pairs (so, in particular, for irrducibl and P 2 -irrducibl closd manifolds). Th blocks of th splitting ar thmslvs pairs, and th complxity of th original pair is th sum of th complxitis of th blocks. Rcalling that in [6] a complxity c(m) was dfind also for th cas whn M, w mphasiz hr that our complxity c(m, X) is typically diffrnt from c(m). So th splitting thorm crucially dpnds on th xtnsion of c from manifolds to pairs. Our splitting diffrs from th JSJ dcomposition [2][3] sinc it is not uniqu (s blow for a furthr discussion of this point), but it has th grat advantag that th blocks it involvs, which w call bricks, ar much asir than all Sifrt and simpl manifolds. As a mattr of fact, our splitting is non-trivial on almost all Sifrt and hyprbolic manifolds it has bn tstd on. Anothr advantag is that th graphs in th boundary rduc th flxibility of possibl gluings of bricks. As a consqunc, a givn st of bricks can only b combind in a finit numbr of ways. This proprty is of cours crucial for computations, and our thory actually lads to vry ffctiv algorithms for th numration of closd manifolds having small complxity. Rturning to th rlation btwn our splitting and th JSJ dcomposition, w mntion that all th bricks found so far [4] ar gomtrically atoroidal, which suggsts that our splitting is actually always a rfinmnt of th JSJ dcomposition (and w know it is in th orintabl cas for complxity up to 9; s [4]). Morovr, non-uniqunss for a Sifrt manifold typically corrsponds to non-uniqunss of its ralization as a graph-manifold. W hav also found som non-uniqunss instancs in th hyprbolic cas [5]. Th orintabl vrsion of th thory dvlopd in this papr, culminating in th splitting thorm, was stablishd in [4]. In th sam papr w hav provd svral strong rstrictions on th topology of bricks and, using a computr program, w hav bn abl to classify all orintabl bricks of complxity up to 9. Using th bricks w hav thn listd all closd irrducibl orintabl 3-manifolds up to complxity 9, showing in particular that th only four hyprbolic ons ar prcisly thos of last known volum. Th splitting thorm provd blow is th main thortical tool ndd to xtnd our program of numrating 3-manifolds of small complxity from th orintabl to th gnral cas. W ar planning to raliz this program in th clos futur. This will allow us to provid information on th smallst non-orintabl hyprbolic manifolds and on th dnsity, in ach givn complxity, of orintabl manifolds among all 3-manifolds. W hav dcidd to dvot th prsnt papr to th gnral thory and th splitting thorm, laving computr implmntation for a subsqunt papr, bcaus th non-orintabl cas displays crtain rmarkabl phnomna which

3 A NEW DECOMPOSITION THEOREM FOR 3-MANIFOLDS 757 do not appar in th orintabl cas. To bgin with, toric boundary componnts rstrict th shap of th trivalnt graph thy contain to only on possibility, whil Klin bottls allow two. Nxt, th assumption of P 2 -irrducibility has to b addd to irrducibility to gt th finitnss of closd manifolds of a givn complxity. Mor surprisingly, ths assumptions do not suffic whn a non-mpty boundary is allowd, bcaus th drilling of a boundary-paralll orintation-rvrsing loop nvr changs complxity. Bcaus of ths facts, th intrinsic dfinition of brick givn blow is somwhat subtlr than that givn in [4], and th proof of som of th ky rsults (including additivity undr connctd sum) is considrably hardr. 1. Manifolds with markd boundary If C is a connctd surfac, w call spin of C a trivalnt graph τ mbddd in C in such a way that C \ τ is an opn disc. If C is disconnctd thn a spin of C is a collction of spins for all its componnts. W dnot by X th st of all pairs (M, X), whr M is a connctd and compact 3-manifold with (possibly mpty) boundary mad of tori and Klin bottls, and X is a spin of M. Elmnts of X will b viwd up to homomorphism of pairs. Rmark 1.1. Sinc S 2 and P 2 do not admit spins with vrtics, a pair (M, X) with X a spin of M blongs to X if and only if χ(m) = 0 and all th lmnts of X hav vrtics. Spins of th torus T and th Klin bottl K. A spin of T or K must b a trivalnt graph with two vrtics, and thr ar prcisly two such graphs, namly th θ-curv and th fram σ of a pair of spctacls. Both θ and σ can srv as spins of K, as shown in Fig. 1, lft and cntr. Th following rsult will b shown in th appndix: Proposition 1.2. (1) Evry spin of K is isotopic to on of th two graphs shown in Fig. 1. (2) With notation as in Fig. 1, for both τ = θ and τ = σ thr xists f Aut(K) such that f(τ) = τ, f( ) =, and f( ) =, but for all f Aut(K) such that f(τ) = τ w hav f( ) =. Th situation for T is compltly diffrnt. First of all, σ is not a spin of T. In addition, θ can b usd as a spin of T in infinitly many non-isotopic ways, bcaus th position of θ on T is dtrmind by th tripl of loops on T which ar containd in θ. Not that any two of ths loops gnrat H 1 (T ; Z), and any such tripl dtrmins on spin θ. Howvr w hav th following rsult, which w lav to th radr to prov using th facts just statd.

4 758 BRUNO MARTELLI AND CARLO PETRONIO (K, θ) (K, σ) (T,θ) Figur 1. Spins of th Klin bottl and th torus. Proposition 1.3. If θ is a spin of T thn all automorphisms of θ ar inducd by automorphisms of T. If θ, θ ar spins of T thr xists f Aut(T ) such that f(θ) = θ. Exampls of pairs. If M is a closd 3-manifold thn (M, ) is an lmnt of X. For simplicity w will oftn writ only M instad of (M, ). W list hr svral mor lmnts of X ndd blow. Our notation will b consistnt with that of [4]. Th radr is invitd to us Propositions 1.2 and 1.3 to mak sur that all th pairs w introduc ar wll-dfind up to homomorphism. W start with th product pairs: B 0 = (T [0, 1], {θ {0}, θ {1}}), B 0 = (K [0, 1], {θ {0}, θ {1}}), B 0 = (K [0, 1], {σ {0}, σ {1}}). W nxt hav two pairs B 1 and B 2 basd on th solid torus T and shown in Fig. 2-lft, and two on th solid Klin bottl K, namly B 1 = (K, θ) and B 2 = (K, σ). For k 1 w tak now th 2-orbifold D 2 with k mirror sgmnts on D 2 and w dfin Z k X as th Sifrt manifold without singular fibrs ovr this orbifold [10], with a spin σ in ach of th k Klin bottls on th boundary. Not that Z k can also b viwd as th complmnt of k disjoint orintationrvrsing loops in S 2 S 1. Anothr dscription of Z k is givn in Fig. 2-right.

5 A NEW DECOMPOSITION THEOREM FOR 3-MANIFOLDS 759 B 1 k 1 B 2 Z k Figur 2. Th pairs B 1, B 2, and Z k for k 1. W also not that Z 1 = B 2 and Z 2 = B 0. W dfin now B 2 to b Z 3, for a spcific rason xplaind blow. W will now introduc thr oprations on pairs which allow us to construct nw pairs from givn ons. Th ultimat goal is to show that all manifolds can b constructd via ths oprations using only crtain building blocks. Connctd sum of pairs. Th opration of connctd sum obviously xtnds from manifolds to pairs. Namly, givn (M, X) and (M, X ) in X, w dfin (M, X)#(M, X ) as (M#M, X X ), whr M#M is on of th two possibl connctd sums of M and M. Of cours S 3 = (S 3, ) X is th idntity lmnt for opration #. It is now natural to dfin (M, X) to b prim or irrducibl if M is. Of cours th only prim non-irrducibl pairs ar S 2 S 1 and S 2 S 1. Assmbling of pairs. Givn (M, X) and (M, X ) in X, w pick spins τ X and τ X with τ C M and τ C M. If thr is a homomorphism ψ : C C such that ψ(τ) = τ w can construct th pair (N, Y ) = (M ψ M, (X X ) \ {τ, τ }). W call this an assmbling of (M, X) and (M, X ) and w writ (N, Y ) = (M, X) (M, X ). Of cours two givn lmnts of X can only b assmbld in a finit numbr of inquivalnt ways. Considring th pairs Bi and Z k introducd abov, th radr may asily chck as an xrcis that Z k Z h = Z h+k 2 and that th following holds: Rmark (M, X) B 0 = (M, X) for any (M, X) X. 2. For (i, j) qual to (1, 1), (1, 2), or (2, 1), it is possibl to assmbl B i and B j along a crtain map ψ in ordr to gt S 3. So, for any (M, X), if w assmbl (M, X)#B i to B j along ψ, w gt th original (M, X) as a rsult.

6 760 BRUNO MARTELLI AND CARLO PETRONIO 3. Th assmbling of B 2 with B 2 givs B 0, so ((M, X) B 2 ) B 2 = (M, X) providd B 2 is assmbld to on of th fr boundary componnts of B 2. This shows that w can discard various assmblings without impairing our capacity of constructing nw manifolds. So w will call trivial an assmbling (M, X) (M, X ) if, up to intrchanging (M, X) and (M, X ), on of th following holds: (1) (M, X ) is of typ B0. (2) (M, X ) = B j for j {1, 2} and (M, X) can b xprssd as (N, Y )#B i for i {1, 2} with (N, Y ) S 3 in such a way that th assmbling is prformd along th boundary of B i and B i B j = S 3. (3) (M, X ) = B 2 and (M, X) = (N, Y ) B 2 with B 2 bing assmbld to B 2. Slf-assmbling. Givn (M, X) X, w pick two distinct τ, τ X with τ C and τ C. If thr is a homomorphism ψ : C C w can choos on such that ψ(τ) and τ intrsct transvrsly in two points, and w dfin (N, Y ) as (M ψ, X \ {τ, τ }). W call this a slf-assmbling of (M, X) and w writ (N, Y ) = (M, X). As abov, only a finit numbr of slf-assmblings of a givn lmnt of X ar possibl. In th squl it will b convnint to rfr to a combination of assmblings and slf-assmblings of pairs just as an assmbling. Not that of cours w can first do th assmblings and thn th slf-assmblings. 2. Complxity, bricks, and th dcomposition thorm In th following sctions w will introduc and discuss a crtain function c : X N which w call complxity. In th prsnt sction w anticipat th dfinition of c vry brifly and stat svral rsults about this function, which could also b takn as axiomatic proprtis. Thn w show how to dduc th splitting thorm from ths proprtis only. Proofs of th proprtis ar givn in Sctions 3 5. Givn (M, X) X w dnot by c(m, X) th minimal numbr of vrtics of a polyhdron P mbddd in M such that P M is simpl, P M = X, and th complmnt of P M is an opn 3-ball. Hr simpl mans that th link of vry point mbds in th 1-sklton of th ttrahdron, and a point of P is a vrtx if its link is prcisly th 1-sklton of th ttrahdron. W obviously hav c(m, ) = c(m) if M is a closd 3-manifold and c(m) is Matvv s complxity [6]. Not that c(m) is also dfind in [6] for M, but typically c(m, X) c(m). Axiomatic proprtis. W start with thr thorms which suggst to rstrict th study of c(m, X) to pairs (M, X) which ar irrducibl and P 2 - irrducibl. Rcall that M is calld P 2 -irrducibl if it dos not contain any

7 A NEW DECOMPOSITION THEOREM FOR 3-MANIFOLDS 761 two-sidd mbddd projctiv plan P 2 (s [1] for gnralitis about this notion, and in particular for th proof that a connctd sum is P 2 -irrducibl if and only if th individual summands ar). Whn M is closd, w call singular a triangulation of M with multipl and slf-adjacncis btwn ttrahdra. Th first and scond thorms, rspctivly, xtnd rsults of Matvv [6] from th closd to th markd-boundary cas, and from th orintabl to th possibly-non-orintabl cas. Th xtnsion is asy for th scond thorm, but lss so for th first thorm. Th third thorm shows that th nonorintabl thory is far richr than th orintabl on. Thorm 2.1 (Additivity undr #). hav For any (M, X) and (M, X ) w c((m, X)#(M, X )) = c(m, X) + c(m, X ). Morovr c(s 2 S 1 ) = c(s 2 S 1 ) = 0. Thorm 2.2 (Naturality). If M is closd, irrducibl, P 2 -irrducibl, and diffrnt from S 3, P 3, L 3,1, thn c(m) = c(m, ) is th minimal numbr of ttrahdra in a singular triangulation of M. Thorm 2.3 (Finitnss). For all n 0 th following holds: (1) Thr xist finitly many irrducibl and P 2 -irrducibl pairs (M, X) such that c(m, X) = n and (M, X) cannot b xprssd as an assmbling (N, Y ) B 2. (2) If (N, Y ) X is irrducibl and P 2 -irrducibl and c(n, Y ) = n thn (N, Y ) can b obtaind from on of th pairs (M, X) dscribd abov by rpatd assmbling of copis of B 2. Any such assmbling has complxity n. Th lattr rsult is of cours crucial for computational purposs. To bttr apprciat its finitnss contnt, not that whnvr w assmbl on copy of B 2 th numbr of boundary componnts incrass by on. Thrfor th thorm implis that for all n, k 0 th st M k n = {(M, X) X irrd. and P2 irrd., c(m, X) n, #X k} is finit. It should b mphasizd that not only w can prov that M k n is finit, but th proof itslf provids an xplicit algorithm to produc a finit list of pairs from which M k n is obtaind by rmoving duplicats. Th thorm also implis that dropping th rstriction #X k w gt infinitly many pairs, but only finitly many orintabl ons. This fact, which is ultimatly du to th xistnc of th Z k sris gnratd by B 2 undr assmbling, is on of th ky diffrncs btwn th orintabl and th gnral cas (anothr important diffrnc will aris in th proof of Thorm 2.1 s Proposition 5.2). Not

8 762 BRUNO MARTELLI AND CARLO PETRONIO also that an assmbling with B 2 gomtrically corrsponds to th drilling of a boundary-paralll orintation-rvrsing loop. Th following mor spcific vrsion of th prvious thorm for n = 0 is ndd blow. Proposition 2.4. Th only irrducibl and P 2 -irrducibl pairs having complxity 0 ar S 3, L 3,1, P 3 and all th pairs Bi and Z k dfind abov. W turn now to th bhaviour of complxity undr assmbling. Proposition 2.5 (Subadditivity). For any (M, X), (M, X ) X w hav c((m, X) (M, X )) c(m, X) + c(m, X ), c( (M, X)) c(m, X) + 6. W dfin now an assmbling (M, X) (M, X ) to b sharp if it is nontrivial and c((m, X) (M, X )) = c(m, X) + c(m, X ). Similarly, a slfassmbling (M, X) is sharp if c( (M, X)) = c(m, X) + 6. Proposition 2.5 radily implis th following facts. Rmark If a combination of sharp (slf-)assmblings is rarrangd in a diffrnt ordr thn it still consists of sharp (slf-)assmblings. 2. Evry assmbling with B 2 is sharp (unlss it is trivial, which only happns whn B 2 is assmbld to B 0 or to B 2). To s this, not again that (M, X) B 2 B 2 = (M, X) and c(b 2 ) = c(b 2) = 0. Thorm 2.7 (Sharp splitting). Lt (N, Y ) b irrducibl and P 2 -irrducibl. If (N, Y ) can b xprssd as a sharp assmbling (M, X) (M, X ) or as a slf-assmbling (M, X ) thn (M, X), (M, X ), and (M, X ) ar irrducibl and P 2 -irrducibl. Proof. In both cass w ar cutting N along a two-sidd torus or Klin bottl, so P 2 -irrducibility is obvious. If (N, Y ) = (M, X ), this torus or Klin bottl is incomprssibl in N, and irrducibility of M is a gnral fact [1]. W ar lft to show that if (N, Y ) = (M, X) (M, X ) sharply thn M and M ar irrducibl. Sinc ths manifolds hav boundary, it is nough to show that thy ar prim. Suppos thy ar not, and considr prim dcompositions of (M, X) and (M, X ) involving summands (M i, X i ) and (M j, X j ). So on summand (M i, X i ) is assmbld to on (M j, X j ), and th othr (M i, X i ) s and (M j, X j ) s surviv in (N, Y ). It follows that, up to prmutation, (M, X) is prim, (M, X ) = (M 1, X 1)#(M 2, X 2) with (M 1, X 1) and (M 2, X 2) prim, (M, X) (M 1, X 1) = S 3 and (M 2, X 2) = (N, Y ). Sharpnss of th original assmbling and additivity undr # now imply that c(m, X) = c(m 1, X 1) = 0. So Proposition 2.4 applis to (M, X) and

9 A NEW DECOMPOSITION THEOREM FOR 3-MANIFOLDS 763 (M 1, X 1). Knowing that (M, X) (M 1, X 1) = S 3 it is asy to dduc that (M, X) and (M 1, X 1) ar ithr B 1 or B 2, and that th original assmbling was a trivial on. This is a contradiction. Bricks and dcomposition. Taking th rsults statd abov for grantd, w dfin hr th lmntary building blocks and prov th dcomposition thorm. Latr w will commnt on th actual rlvanc of this thorm. A pair (M, X) X is calld a brick if it is irrducibl and P 2 -irrducibl and cannot b xprssd as a sharp assmbling or slf-assmbling. Thorm 2.3 and Rmark 2.6 asily imply that thr ar finitly many bricks of complxity n. From Proposition 2.4 it is asy to dduc that in complxity zro th only bricks ar prcisly th pairs Bi introducd abov, which xplains why w hav givn a spcial status to Z 3 = B 2, and that th othr irrducibl and P 2 -irrducibl pairs ar assmblings of bricks. Now, w show mor gnrally: Thorm 2.8 (Existnc of splitting). Evry irrducibl and P 2 -irrducibl pair (M, X) X can b xprssd as a sharp assmbling of bricks. Proof. Th rsult is tru for c(m, X) = 0, so w procd by induction on c(m, X) and suppos c(m, X) > 0. By Thorm 2.3 w can assum that (M, X) cannot b split as (N, Y ) B 2, bcaus vry assmbling with B 2 is sharp, and w hav sn that B 2 is a brick. Now if (M, X) is a brick w ar don. Othrwis (M, X) is ithr a sharp slf-assmbling (N, Y ), in which cas c(n, Y ) = c(m, X) 6 and w can conclud by induction using Thorm 2.7, or (M, X) is a sharp assmbling (N, Y ) (N, Y ). Thorm 2.7 stats that (N, Y ) and (N, Y ) ar irrducibl and P 2 -irrducibl. If both (N, Y ) and (N, Y ) hav positiv complxity w conclud by induction. Othrwis w can assum that c(n, Y ) = 0 and apply Proposition 2.4. Sinc th assmbling is non-trivial, (N, Y ) is not of typ B0. It is also not B 2 or Z k for k 3, by th proprty of (M, X) w ar assuming. So (N, Y ) is on of B 1, B 1, B 2, B 2. In particular, it is a brick. Now w claim that (N, Y ) cannot b split as (N, Y ) B 2. Assuming it can, w hav two cass. In th first cas th assmbling of (N, Y ) is prformd along a fr boundary componnt of B 2, but thn w must hav (N, Y ) = B 2, and th assmbling is trivial, which is absurd. In th scond cas (N, Y ) is assmbld to a fr boundary componnt of (N, Y ), and w hav (M, X) = ( (N, Y ) (N, Y ) ) B 2, which is again absurd. Our claim is provd. Now w know that (N, Y ) again blongs to th finit list of irrducibl and P 2 -irrducibl pairs which hav complxity n and cannot b split as an assmbling with B 2. Howvr (N, Y ) has on mor boundary componnt than (M, X), which implis that by rpatdly applying this argumnt w must vntually nd up with a brick.

10 764 BRUNO MARTELLI AND CARLO PETRONIO Exprimntal facts. Thorm 2.8 shows that listing irrducibl and P 2 - irrducibl manifolds up to complxity n is asy onc th bricks up to complxity n ar classifid. Th finitnss faturs of our thory imply that thr xists an algorithm which rducs such a classification to a rcognition problm. Morovr it turns out xprimntally that rcognition nds to b carrid out only on a comparativly short list of pairs. Th complt list of orintabl bricks up to complxity 9 was found in [4] (s also [11]), and it consists of 30 pairs, whras thr ar 1901 closd, irrducibl, and orintabl 3-manifolds of complxity up to 9. As a mattr of fact, only 7 bricks ar alrady sufficint to obtain 1882 closd manifolds (th othr 19 bing thmslvs bricks). In addition, all bricks found ar gomtrically atoroidal, which maks it asy to rcogniz thir assmblings; s also [5]. 3. Sklta W introduc hr th notion of sklton of a pair (M, X), w dfin th complxity of (M, X) as th minimal numbr of vrtics of a sklton, and w discuss th first proprtis of minimal sklta, dducing som of th rsults statd abov. Th othr rsults rquir a dpr analysis and nw tchniqus and will b provd latr. Simpl sklta and complxity. W rcall that a compact polyhdron P is calld simpl if th link of vry point of P mbds in th spac givn by a circl with thr radii. Th points having th whol of this spac as a link ar calld vrtics. Thy ar isolatd and thrfor finit in numbr. Givn a pair (M, X) X, a polyhdron P mbddd in M is calld a sklton of (M, X) if th following holds: P M is simpl; M \ (P M) is an opn ball; P M = X. Rmark 3.1. If P is a sklton of (M, X) thn P is simpl, and th vrtics of P cannot li on M. Whn #X = 1 thn P is a spin of M (i.., M collapss onto P ), and whn #X = 0 (i.., whn M is closd) thn P is a spin of M \ {point}. Whn #X 2 no such intrprtation is possibl. Th proof that vry (M, X) X has a sklton, alrady givn in [4, Rmark 2.1], xtnds vrbatim to th non-orintabl contxt. For a simpl polyhdron P w dnot by v(p ) th numbr of vrtics of P, and w dfin th complxity c(m, X) of a givn (M, X) X as th minimum of v(p ) ovr all sklta P of (M, X). So w hav a function c : X N. Som sklta without vrtics. If w rmov on point from th closd manifolds S 3, L 3,1, P 3, S 2 S 1, and S 2 S 1 w can collaps th rsult rspctivly to a point, to th tripl hat, to P 2, and to th join of S 2 and

11 A NEW DECOMPOSITION THEOREM FOR 3-MANIFOLDS 765 S 1 (for both th last two cass). Hr th tripl hat is th spac obtaind by attaching D 2 to S 1 so that D 2 runs thr tims around S 1. This shows that S 3, L 3,1, P 3, S 2 S 1, and S 2 S 1 all hav complxity zro. It is a wllknown fact, which w will prov again blow, that ths ar th only prim and P 2 -irrducibl manifolds having complxity zro. Turning to th pairs Bi and Z k dfind in th prvious sction, w now show that thy also hav complxity 0. This is rathr obvious for th product pairs B 0, B 0, and B 0, bcaus thy hav th product sklta P 0 = θ [0, 1] T [0, 1], P 0 = θ [0, 1] K [0, 1], and P 0 = σ [0, 1] K [0, 1]. For B 1 = (T, {θ}) w not that θ contains a mridian of th torus, so w can attach to X a mridional disc and gt th sklton P 1 shown in Fig. 3. Th sam construction applis to B 1 = (K, {θ}) and lads to th sklton P 1 also shown in th figur. Of cours P 1 and P 1 ar isomorphic as abstract polyhdra (just as P 0 and P 0 ar), but w us diffrnt nams to kp track also of thir mbddings. P P 1 1 Figur 3. Th sklta P 1 and P 1 of B 1 and B 1. Figur 4. Th sklta P 2 and P 2 of B 2 and B 2. Th sklta P 2 and P 2 of B 2 and B 2, rspctivly, ar shown in Fig. 4, both as abstract polyhdra, and as polyhdra mbddd in T and K. W conclud

12 766 BRUNO MARTELLI AND CARLO PETRONIO with th sris Z k for k 3, for which a sklton is shown in Fig. 5. Rcalling that B 2 was dfind as Z 3, w dnot this sklton by P 2 whn k = 3. Figur 5. Th sklton of Z k for k = 4. Nuclar and standard sklta. A sklton of (M, X) is calld nuclar if it dos not collaps to a propr subpolyhdron which is also a sklton of (M, X). A nuclar sklton P of (M, X) X having c(m, X) vrtics is calld minimal. Of cours vry (M, X) has minimal sklta. W will introduc now two mor rstrictd classs of simpl polyhdra. Latr w will show that, undr suitabl assumptions, minimal polyhdra must blong to ths classs. A simpl polyhdron Q is calld quasi-standard with boundary if vry point has a nighborhood of on of th typs (1)-(5) shown in Fig. 6. A point of typ (3) was alrady dfind abov to b a vrtx of Q. W dnot now by V (Q) th st of all vrtics, and w dfin th singular st S(Q) as th st of points of typ (2), (3), or (5), and th boundary Q as th st of points of typ (4) or (5). Morovr w call 1-componnts of Q th connctd componnts of S(Q) \ V (Q) and 2-componnts of Q th connctd componnts of Q \ (S(Q) Q). (1) (2) (3) (4) (5) Figur 6. Typical nighborhoods of points in a quasistandard polyhdron with boundary. If th 2-componnts of Q ar opn discs (and hnc ar calld just facs), and th 1-componnts ar opn sgmnts (and hnc calld just dgs), thn

13 A NEW DECOMPOSITION THEOREM FOR 3-MANIFOLDS 767 w call Q a standard polyhdron with boundary. For short w will oftn just call Q a standard polyhdron, and possibly spcify that Q should b mpty or non-mpty. W prov now th first proprtis of nuclar sklta. Lmma 3.2. If P is a nuclar sklton of a pair (M, X) X, thn P = Q s 1... s m G, whr: (1) Q is a quasi-standard polyhdron with boundary Q X. (2) For all componnts (C, τ) of ( M, X), ithr Q τ or Q appars nar C as in Fig. 7, so that Q τ is on or two circls, dpnding on th typ of (C, τ). (3) s 1,..., s m ar th dgs of th τ s in X which do not alrady blong to Q. (4) G is a graph with G (Q s 1... s m ) finit and G V (Q M) mpty. Figur 7. Local aspct of Q nar C if Q τ. Proof. Nuclarity is a proprty of local natur, and th rsult is trivial if M =. For M, dfining Q as th 2-dimnsional portion of P and G as P \ (Q X), th only non-obvious point to show is (2). Of cours Q C Q is ithr τ or a union of circls. To chck that th only possibilitis ar thos of Fig. 7 on rcalls that M \ (P M) is a ball, so C \ (Q G) is planar, and thn C \ Q is also planar. Rmark 3.3. Evry (M, X) X has a minimal sklton P = Q s 1... s m G as abov, whr in addition G M =. This is bcaus, without changing v(p ), w can tak th nds of G lying on M and mak thm slid ovr Q s 1... s m until thy rach int(m). Not that th rgular nighborhood of τ X in P is now ithr a product τ [0, 1] or as shown in Fig. 7.

14 768 BRUNO MARTELLI AND CARLO PETRONIO Subadditivity. Som proprtis of complxity radily follow from th dfinition and from th first facts shown about minimal sklta. To bgin with, if P and P ar sklta of (M, X) and (M, X ) and w add to P P a sgmnt which joins P \V (P ) to P \V (P ), w gt a sklton of (M, X)#(M, X ) with v(p )+v(p ) vrtics. Thrfor c((m, X)#(M, X )) c(m, X)+c(M, X ). Turning to assmbling, lt P and P b as in Rmark 3.3, and lt an assmbling (M, X) (M, X ) b prformd along a map ψ : C C with ψ(τ) = τ. Thn P ψ P is simpl, and it is a sklton of (M, X) (M, X ). W dduc that c((m, X) (M, X )) c(m, X) + c(m, X ). Now w considr a slf-assmbling (M, X). If P is a sklton of (M, X) as in Rmark 3.3 and th slf-assmbling is prformd along a crtain map ψ : C C such that τ ψ(τ) consists of two points, thn (P C C )/ ψ is a sklton of (M, X). It has th sam vrtics as (M, X) plus at most two from th vrtics of τ, two from th vrtics of τ, and two from τ ψ(τ). This shows that c( (M, X)) c(m, X) + 6. Surfacs dtrmind by graphs. W will nd vry soon th ida of splitting a sklton along a graph, so w spll out how th construction gos. M γ γ P M W P M γ M W P P γ γ γ P W W P P Figur 8. Surfac dtrmind by a trivalnt graph. P W Lmma 3.4. Lt P b a quasi-standard sklton of (M, X) and lt γ b a trivalnt graph containd in P M, locally mbddd as in Fig. 8-lft. Thn thr xists a surfac S proprly mbddd in M such that S (P M) = γ

15 A NEW DECOMPOSITION THEOREM FOR 3-MANIFOLDS 769 and S \ γ is a union of discs. Morovr S is sparating in M if and only if γ is sparating in P M. Proof. To construct S w first tak a surfac W with boundary as shown in Fig. 8-right, so that W (P M) = γ. Thn w attach disjoint discs to th componnts of W lying in th intrior of M. S [4, Rmark 4.1] for dtails. Rmark 3.5. With th sam notation as in th prvious lmma, assum furthr that γ {θ, σ} is containd in P, that S is sparating in M, and that S \ γ is only on disc. Thn cutting M along S and choosing γ as a spin for th two nw boundary componnts w gt a dcomposition (M, X) = (M 1, X 1 ) (M 2, X 2 ) which, at th lvl of sklta, corrsponds prcisly to th splitting of P along γ. Minimal sklta ar standard. W now prov a thorm on which most of our rsults ar basd. In particular, Proposition 2.4 radily follows from it, and Thorm 2.2 will b asily provd using it. W start with an asy rmark. Rmark 3.6. If P is a nuclar and standard sklton of (M, X) thn it is proprly mbddd, namly P = M P = X, and P M is standard without boundary. Morovr P M is a spin of a manifold boundd by on sphr and som tori and Klin bottls, so χ(p M) = 1. Knowing that S(P M) is 4-valnt, w thn s that P has #X + v(p ) + 1 facs. Thorm 3.7. Lt (M, X) X b an irrducibl and P 2 -irrducibl pair, and lt P b a minimal sklton of (M, X). Thn: (1) If c(m, X) > 0 thn P is standard. (2) If c(m, X) = 0 and X = thn M {S 3, L 3,1, P 3 } and P is not standard. (3) If c(m, X) = 0 and X thn (M, X) is on of th B i or Z k, and P is prcisly th sklton dscribd in Sction 3, so P is standard unlss (M, X) is B 1 or B 1. Proof. W first show that if P is not standard thn ithr X = and M {S 3, L 3,1, P 3 }, or (M, X) {B 1, B 1} and P {P 1, P 1}. Latr w will dscrib standard sklta without vrtics. If P rducs to on point, thn of cours M = S 3. Lt us first assum that P is not purly 2-dimnsional, so thr is sgmnt containd in th 1-dimnsional part of P. W distinguish two cass dpnding on whthr lis in int(m) or on M. If int(m), w tak a small disc which intrscts transvrsly in on point. As in th proof of Lmma 3.4 w attach to a disc containd in th ball M \ (P M), gtting a sphr S M intrscting P in on point of.

16 770 BRUNO MARTELLI AND CARLO PETRONIO By irrducibility S bounds a ball B, and P B is asily sn to b a spin of B. Nuclarity now implis that P B contains vrtics, so P \ B is a sklton of (M, X) with fwr vrtics than P. This is a contradiction. If M, lt C b th componnt of M on which lis. Sinc on C thr is a circl which mts τ transvrsly in on point of, looking at th ball M \ (P M) again w s that in M thr is a proprly mbddd disc D intrscting P in a point of. W hav now thr cass dpnding on th typ of th pair (C, τ). If (C, τ) = (T, θ) thn D is a comprssing disc for T, so by irrducibility M is th solid torus. Knowing that D mts P only in on point it is now asy to show also that (M, X) = B 1 and P = P 1. If (C, τ) = (K, θ) thn must b containd in th dg of θ by Lmma 3.2, and th sam rasoning shows that (M, X) = B 1 and P = P 1. If (C, τ) = (K, σ) thn must b containd in th dg of σ by Lmma 3.2. Th complmnt in K of D is now th union of two Möbius strips. If w choos any on of ths strips and tak its union with D, w gt an mbddd P 2 in M. Sinc M is irrducibl and P 2 -irrducibl, it would thn hav to b P 3, but M, so w hav obtaind a contradiction. W ar lft to dal with th cas whr P is purly two-dimnsional, so that P is quasi-standard, but not standard. Lt us first suppos that som 2-componnt F of P is not a disc. Thn ithr F is a sphr, in which cas P also rducs to only a sphr, which is clarly impossibl bcaus M would thn b S 2 [0, 1], or thr xists a loop γ in F such that on of th following holds: (1) γ is orintation-rvrsing on F. (2) γ sparats F in two componnts non of which is a disc. W considr now th closd surfac S dtrmind by γ as in Lmma 3.4, and not that S is ithr S 2 or P 2. If S = P 2 w dduc that (M, X) = P 3. If S = S 2 irrducibility implis that S bounds a ball B in M. This is clarly impossibl in cas (1), so w ar in cas (2). Now w not that P B must b a nuclar spin of B. Knowing that F B is not a disc it is asy to dduc that P B must contain vrtics. This contradicts th minimality bcaus w could rplac th whol of P B by only on disc, gtting anothr sklton of (M, X) with fwr vrtics. If P is quasi-standard and its 2-componnts ar discs thn ithr P is standard or S(P ) rducs to a singl circl. Thn it is asy to show that P must b th tripl hat and (M, X) = L 3,1. W ar lft to analyz th cas whr P is standard and c(m, X) = 0, so that X. Dnoting #X by n, Rmark 3.6 shows that P has n + 1 facs.

17 A NEW DECOMPOSITION THEOREM FOR 3-MANIFOLDS 771 W considr first th cas n = 1. Sinc P has on dg and two facs, it is asy to s that it must b homomorphic to ithr P 2 or P 2 (s Fig. 4) as an abstract polyhdron. This dos not quit imply that (M, X) is B 2 or B 2, bcaus in gnral a sklton P alon is not nough to dtrmin a pair (M, X). Howvr P M crtainly dos dtrmin (M, X), bcaus it is a standard spin of M minus a ball, and X = P M. W ar lft to analyz all th polyhdra of th form P 2 ψ T for ψ : P 2 θ T, of th form P 2 ψ K for ψ : P 2 θ K, and of th form P 2 ψ K for ψ : P 2 σ K. Among ths polyhdra w must slct thos which can b thicknd to manifolds with two boundary componnts (a sphr plus ithr a torus or a Klin bottl). Th symmtris of (T, θ), (K, θ), and (K, σ) dscribd in Propositions 1.3 and 1.2 imply that thr ar actually not many such polyhdra. Mor prcisly, thr is just on P 2 ψ T, which givs B 2. Thr ar two P 2 ψ T, on of which is not thicknabl (i.., not th spin of any manifold), and th othr can b thicknd to a manifold with thr boundary componnts (a sphr and two Klin bottls). Finally, thr ar two P 2 ψ K, on of which is not thicknabl, and th othr givs B 2. This concluds th proof for n = 1. Having workd out th cas n = 1, w turn to th cas n 2, so that P has n dgs and n + 1 facs. If a fac of P mts M in on arc only, thn it mts S(P ) in on dg only, and this dg joins a componnt of M to itslf, which asily implis that n = 1, contradicting our prsnt assumption n 2. If a fac of P is an mbddd rctangl, with two opposit dgs on M and two in S(P ), thn it radily follows that n = 2 and P is ithr θ [0, 1] or σ [0, 1]. As abov, to conclud that (M, X) {B 0, B 0, B 0 }, w must considr th various polyhdra obtaind by attaching (T, θ), (K, θ), and (K, σ) to th uppr and lowr bass of θ [0, 1] and σ [0, 1]. Using again Propositions 1.3 and 1.2 on ss that thr ar only six such polyhdra. Thr of thm ar not thicknabl, and th othr thr giv B 0, B 0, B 0. Rturning to th gnral cas with n 2, w not that thr ar a total of 3n dgs on M, so thr ar 3n grms of facs starting from M. Knowing that thr is a total of n + 1 facs and non of thm uss only on grm, w s that at last on fac uss only two grms, and so it is a rctangl R, possibly an immrsd on. If n = 2 w hav thr rctangls, on of which must b mbddd, and w ar ld back to a cas alrady discussd. If n 3 thn R must b immrsd, so in particular it joins a componnt (K 1, σ 1 ) of ( M, X) to anothr (K 2, σ 2 ) componnt. A rgular nighborhood in P of R σ 1 σ 2 is shown in Fig. 9. Th boundary of this nighborhood is again a graph σ which dtrmins a sparating Klin bottl according to Rmark 3.5. If w cut P along σ w gt a disjoint union P 2 P, which at th lvl of manifolds givs a splitting (M, X) = B 2 (M, X ). Morovr P is a nuclar sklton of (M, X ), so c(m, X ) = 0, P is minimal, and #X = n 1. Now ithr (M, X ) = B 0 and P = P 0 or w can procd, vntually gtting that (M, X) = B 2... B 2, so (M, X) = Z k for som

18 772 BRUNO MARTELLI AND CARLO PETRONIO k 3, and P is th corrsponding sklton constructd in Sction 3. Th proof is now complt. Figur 9. An immrsd rctangl joins two (K, σ) componnts. Proof of Thorm 2.2. By th prvious rsult, a minimal spin of M is standard with vrtics, and dual to it thr is a singular triangulation with c(m) ttrahdra (and on vrtx). A singular triangulation of M with n ttrahdra and k vrtics dually givs a standard polyhdron Q with n vrtics whos complmnt is a union of k balls. If w punctur k 1 suitably chosn facs of Q w gt a sklton of (M, ), whnc th conclusion at onc. 4. Finitnss Th proof of Thorm 2.3 will b basd on th following rsult. Proposition 4.1. Lt (M, X) b an irrducibl and P 2 -irrducibl pair which dos not split as (M, X) = (N, Y ) B 2. Assum that c(m, X) > 0 and lt P b a standard sklton of (M, X). Thn vry dg of P is incidnt to at last on vrtx of P. Proof. Assum by contradiction that an dg of P is not incidnt to any vrtx of P, i.., that both th nds of li on M. If th nds of li on th sam spin τ X thn τ is a connctd componnt of S(P ) M. Th standardnss of P implis that P has no vrtics, which contradicts th assumption that c(m, X) > 0. So th nds of li on distinct spins τ, τ X. Lt C and C b th componnts of M on which τ and τ li, and lt R b a rgular nighborhood in P of C C. By construction R is a quasi-standard polyhdron with boundary R = τ τ γ. Hr γ is a trivalnt graph with on componnt homomorphic to θ or to σ, and possibly anothr componnt homomorphic to th circl. Lt us first considr th cas whr γ has a circl componnt γ 0. This circl lis on P and is disjoint from S(P ). Th standardnss of P thn implis that γ 0 bounds a disc D containd in P and disjoint from S(P ). In this cas w st γ = γ \ γ 0 and R = R D. In cas γ is connctd w just st γ = γ and R = R. In both cass w hav found a graph γ homomorphic to θ or to σ

19 A NEW DECOMPOSITION THEOREM FOR 3-MANIFOLDS 773 which sparats P. Morovr on componnt R of P \ γ is standard without vrtics and is boundd by τ τ γ. According to Lmma 3.4, th graph γ dtrmins a sparating surfac S in M such that S P = γ. Sinc χ(γ ) = 1 and S \ γ consists of discs, w hav χ(s) 0. Of cours χ(s) 1, for othrwis S would b an mbddd P 2, but w ar assuming that M is irrducibl and P 2 -irrducibl and has non-mpty boundary. W will now show that if χ(s) = 2 thn c(m, X) = 0, and if χ(s) = 0 thn (M, X) splits as (M, X) = (N, Y ) B 2. This will imply th conclusion. Assum that χ(s) = 2, so S is a sphr. W dnot by B th opn 3- ball M \ (P M) and not that S B = S \ γ consists of thr disjoint opn 2-discs, which cut B into four opn 3-balls. By irrducibility, S bounds a closd 3-ball D, and B \ D is th union of som of th four opn 3-balls just dscribd. Viwing (D, γ ) abstractly w can now asily construct a nw simpl polyhdron Q D without vrtics such that Q S = γ and D \ Q consists of thr distinct 3-balls, ach incidnt to on of th thr opn 2-discs which constitut S \ γ. Lt us considr now th simpl polyhdron P = R γ Q viwd as a subst of M. By construction P M = τ τ = X. Morovr M \ (P M) is obtaind from B \ D (which consists of opn 3- balls) by attaching ach of th thr 3-balls of D \ Q along only on 2-disc (a componnt of S \ γ ). It follows that M \ (P M) still consists of opn 3-balls. By puncturing som of th 2-componnts of P w can thn construct a sklton of (M, X) without vrtics, so indd c(m, X) = 0. Assum now that χ(s) = 0, so S is a sparating torus or Klin bottl. Rmark 3.5 now shows that (M, X) is obtaind by assmbling som pair (N, Y ) with a pair (N, Y ) which has sklton R. By construction R is standard without vrtics and N has thr componnts, and it was shown in th proof of Thorm 3.7 that (N, Y ) must thn b B 2. This complts th proof. Corollary 4.2. Lt (M, X) b irrducibl and P 2 -irrducibl. Assum c(m, X) > 0 and thr is no splitting (M, X) = (N, Y ) B 2. Thn #X 2c(M, X). Proof. A minimal sklton P of (M, X) is standard by Thorm 3.7, and w hav just shown that ach dg of P joins ithr V (P ) to itslf or V (P ) to X. Sinc P has c(m, X) quadrivalnt vrtics, thr can b at most 4c(M, X) dgs raching X. Each componnt of X is rachd by prcisly two dgs, so thr ar at most 2c(M, X) componnts. Proof of Thorm 2.3. Th rsult is valid for n = 0 by th classification carrid out in Thorm 3.7, so w assum n > 0. Lt F n b th st of all irrducibl and P 2 -irrducibl pairs (M, X) which cannot b split as (M, X ) B 2. By Thorm 3.7, ach such (M, X) has a minimal standard spin P with

20 774 BRUNO MARTELLI AND CARLO PETRONIO n vrtics. By Corollary 4.2, w hav that S(P M) is a quadrivalnt graph with at most 5n vrtics. Sinc P M is a standard polyhdron, thr ar only finitly many possibilitis for P M and hnc for (M, X). Givn an irrducibl and P 2 -irrducibl pair (M, X) with c(m, X) = n, ithr (M, X) F n or (M, X) splits along a Klin bottl K as (M, X ) B 2. Th only cas whr K is comprssibl in M is whn (M, X ) = B 2, but B 2 B 2 = B 0 and c(b 0 ) = 0. So K is incomprssibl, whnc M is irrducibl and P 2 -irrducibl. Morovr c(m, X ) = n by Rmark 2.6 (which dpnds on th now provd Propositions 2.4 and 2.5). Sinc (M, X ) has on boundary componnt lss than (M, X), w can itrat th procss of splitting copis of B 2 only a finit numbr of tims, and thn w gt to an lmnt of F n. 5. Additivity In this sction w prov additivity undr connctd sum. This will rquir th thory of normal surfacs and mor tchnical rsults on sklta. W start with an asy gnral fact (s [4, Proposition 2.9] for a proof). Proposition 5.1. Givn a pair (M, X) X, lt Q M b a quasistandard polyhdron with Q M = Q X. Assum that M \ Q has two componnts N and N. Thn th 2-componnts of Q that sparat N from N form a closd surfac Σ(Q) Q int(m) which cuts M into two componnts. Normal surfacs. Givn a pair (M, X) X, lt P b a nuclar sklton of (M, X). Th simpl polyhdron P M is now a spin of M with a ball B M rmovd. Choos a triangulation of P M, and lt ξ P b th handl dcomposition of M \ B obtaind by thickning th triangulation of P M, as in [7]. In this subsction w will study normal sphrs in ξ P. Not that thr is an obvious xampl, namly th sphr paralll to B and slightly pushd insid ξ P. Th following rsult dals with th othr normal sphrs. Its proof displays anothr rmarkabl diffrnc btwn th orintabl and th gnral cas. Namly, it was shown in [4] that, whn M is orintabl, any normal surfac raching M actually contains a componnt of M. By contrast, whn ( M, X) contains som (K, σ) componnt, an arbitrary normal surfac can rach K without containing it. As our proof shows, howvr, this cannot happn whn th surfac is a sphr. Proposition 5.2. Lt P b a nuclar sklton of (M, X) X, and lt S b a normal sphr in ξ P. Thn thr xists a simpl polyhdron Q such that v(q) v(p ), Q M = X and M \ (Q M) is a rgular nighborhood of S. If in addition P is standard, c(m, X) > 0, and S is not th obvious sphr N(P M), thn thr xists Q as abov with v(q) < v(p ).

21 A NEW DECOMPOSITION THEOREM FOR 3-MANIFOLDS 775 Proof. Evry rgion R of P carris a color n N givn by th numbr of shts of th local projction of S to R. Now w cut P M opn along S as xplaind in [7], i.., w rplac ach R by its (n + 1)-shtd covr containd in th normal bundl of R in M. As a rsult w gt a polyhdron P M which contains M, such that M \ P is th disjoint union of an opn ball B and an opn rgular nighborhood N of S in M. By rmoving from ach boundary componnt C M th opn disc C \ τ w gt a polyhdron P intrscting M in X. Now w punctur a 2-componnt which sparats B from N and claim that th rsulting polyhdron Q is as dsird. Only th inqualitis btwn v(p ) and v(q) ar non-obvious. W first prov that all th vrtics of P M which li on M disappar ithr whn w cut P along S gtting P or latr whn w rmov M \ X from P to gt P. This of cours implis th first assrtion of th statmnt. W concntrat on on componnt (C, τ) of ( M, X). By Lmma 3.2 ithr both vrtics of τ ar vrtics of P M or non of thm is. In th lattr cas thr is nothing to show, so w assum that thr ar thr (possibly non-distinct) 2-componnts of P incidnt to τ. Lt v and v b th vrtics of τ. Looking first at v, w dnot by (n, n, n, p, q, r) th colors of th six grms at v of 2-componnt of P M. Hr n corrsponds to C \ τ, which is triply incidnt to v. Th compatibility quations of normal surfacs now radily imply that (up to prmutation) r is vn, p = q r, and that n p/2 whn p = q = r. Morovr: v disappars in P if p = q > r; v survivs in P and rmains on M, so it disappars in P, if p = q = r and n = p/2; v survivs in P and movs to int(m) if p = q = r and n > p/2. Now if τ = θ thn th sam cofficints appar at v. Th only cas whr v and v do not both disappar in P is whn p = q = r and n > p/2. But in this cas S would thn contain n p/2 paralll copis of C, which is impossibl. Th cas τ = σ is asir, bcaus if v survivs in P th situation is as in Fig. 10. This is absurd bcaus S would contain Möbius strips. p S p p n n-p/2 Figur 10. Möbius strips in a normal surfac.

22 776 BRUNO MARTELLI AND CARLO PETRONIO Now w turn to th scond assrtion. If v(p ) < v(p ) th conclusion is obvious, so w procd assuming v(p ) = v(p ). It is now sufficint to show that som fac of P which sparats B from N contains vrtics of P, bcaus w can thn punctur such a fac and collaps th rsulting polyhdron until it bcoms nuclar, gtting fwr vrtics. Assum by contradiction that thr is no such fac. W not that P is th union of a quasi-standard polyhdron P and som arcs in X. Th 2-componnts of P which sparat B from N ar th sam as thos of P, so thy giv a closd surfac Σ P by Proposition 5.1. From th fact that v(p ) = v(p ) w dduc that nar a vrtx of P th transformation of P into P can b dscribd as in Fig. 11, namly P can Figur 11. Transformation of P into P nar a vrtx of P. b idntifid nar th vrtx with P S. Of cours this dos not imply that globally P = P S, bcaus th componnts of P playing th rol of P nar vrtics may not match across facs. Th closd surfac Σ cannot b disjoint from S(P ), bcaus othrwis S would b th obvious sphr B. On th othr hand w ar supposing Σ V (P ) =, so Σ S(P ) must b a non-mpty union of loops. In particular, S(P ) contains a loop γ disjoint from V (P ). Figur 11 now shows that S(P ) coincids with S(P ) away from M. Using th analysis of th transition from P to P nar M alrady carrid out abov, w also s that nar a componnt (C, τ) of ( M, X) ithr S(P ) coincids with S(P ) or it is obtaind from S(P ) by adding on dg of τ, and thn slightly pushing th rsult insid M. Whn (C, τ) = (K, σ) th dg addd is ncssarily. This implis that th loop γ dscribd abov can b viwd as a loop in S(P M) such that γ V (P ) =. In addition, if γ contains a vrtx of P M on a crtain componnt of M thn it contains also th othr vrtx in that componnt. This radily implis that th union of γ with all th τ s in X touchd by γ is a connctd componnt of S(P M). But P M is standard, so S(P M) is connctd, and w dduc that P has no vrtics. This is a contradiction.

23 A NEW DECOMPOSITION THEOREM FOR 3-MANIFOLDS 777 Proof of Thorm 2.1. W hav alrady shown that c(s 2 S 1 ) = c(s 2 S 1 ) = 0 and that c is subadditiv. Lt us considr now a non-prim pair (M, X) and a minimal sklton P of (M, X). Sinc (M, X) is not prim, thr xists a normal sphr S in ξ P which is ssntial in M, namly it ithr is nonsparating or it sparats M into two manifolds both diffrnt from B 3. Thn w apply th first point of Proposition 5.2 to P and S, gtting a polyhdron Q. If S is sparating and splits (M, X) as (M 1, X 1 )#(M 2, X 2 ), w must hav that Q is th disjoint union of polyhdra Q 1 and Q 2, whr Q i is a sklton of (M i, X i ). Sinc v(q 1 ) + v(q 2 ) = v(q) v(p ) w dduc that c(m, X) c(m 1, X 1 ) + c(m 2, X 2 ), so quality actually holds. If S is not sparating w idntify a rgular nighborhood of S in M with S ( 1, 1) and not that thr must xist a fac of Q having S ( 1, 1 + ε) on on sid and S (1 ε, 1) on th othr sid. W punctur this fac gtting a polyhdron Q. Now Q is a sklton of a pair (M, X) such that (M, X) = (M, X)#E, whr E is S 2 S 1 or S 2 S 1. Morovr v(q ) = v(q) v(p ), and hnc c(m, X) c(m, X), so quality actually holds. W hav shown so far that an ssntial normal sphr in (M, X) lads to a non-trivial dcomposition (M, X) = (M 1, X 1 )#(M 2, X 2 ) on which complxity is additiv. If (M 1, X 1 ) and (M 2, X 2 ) ar prim w stop; othrwis w itrat th procdur until w find a dcomposition of (M, X) into prims on which complxity is additiv. Sinc any othr dcomposition into prims actually consists of th sam summands, w dduc that complxity is always additiv on dcompositions into prims. If w tak th connctd sum of two non-prim manifolds thn a prim dcomposition of th rsult is obtaind from prim dcompositions of th summands, so additivity holds also in gnral. Appndix: Som facts about th Klin bottl In this appndix, following Matvv [7], w classify all simpl closd loops on th Klin bottl K and w dduc Proposition 1.2 from this classification. W also mntion two mor rsults on K which asily follow from th classification. Ths rsults ar strictly spaking not ncssary for th prsnt papr, and thy ar probably wll-known to xprts, but w hav dcidd to includ thm bcaus thy show a striking diffrnc which xists btwn th orintabl and non-orintabl cass. Proposition A.1. Thr xist on th Klin bottl only four non-trivial loops up to isotopy, as shown in Fig. 12. Ths loops ar dtrmind by thir imag in H 1 (K; Z) = a, b a+b = b+a, 2a = 0, as also shown in th pictur. Morovr a and ±2b ar orintation-prsrving on K, whil ±b and a ± b ar orintation-rvrsing.

24 778 BRUNO MARTELLI AND CARLO PETRONIO b a a b a a+b +2b +b Figur 12. Non-trivial loops on th Klin bottl. Proof. A non-trivial loop is isotopic to on which is normal with rspct to a triangulation of K, i.., it appars as in Fig. 13. W must hav n+m = n +m, p m n m p n n p m n m p Figur 13. Normal loops in a triangulation of K. n + p = n + p, m + p = m + p, so n = n, m = m, p = p. If p > m, w furthr distinguish btwn th following cass: If n < p, sinc w look for a connctd curv, w gt n = m = 0 and p = 1, whnc th loop a; if n > p w do not gt any solution; if n = p w gt m = 0 and n = p {1, 2}, whnc th loops ±b and ±2b. If m > p w must hav p = n = 0 and m {1, 2}, whnc th loops ±b and ±2b again. If m = p, sinc th connctd curv w look for is also non-trivial, w must hav m = p = 0 and n {1, 2}, whnc th loops a ± b and ±2b. Proof of Proposition 1.2. W start by showing that σ mbds uniquly as a spin of K. Th closd dgs and of σ ar disjoint simpl loops in K, and thy must b orintation-rvrsing. It asily follows that {, } must b {±b, a ± b}. Now th nds of can b isotopically slid ovr and to rach th position of Fig. 1-cntr, and uniqunss is provd. Turning to th uniqunss of th mbdding of θ, not that two of th thr simpl closd loops containd in θ must b orintation-rvrsing on K. Lt b th dg containd in both of ths loops. If w prform th mov shown

25 A NEW DECOMPOSITION THEOREM FOR 3-MANIFOLDS 779 in Fig. 14 along w gt a spin σ of K, and th nwborn dg is th dg Figur 14. A mov changing a spin θ of K into a spin σ. of σ. So θ is obtaind from σ by th sam mov along σ. Sinc th mbdding of σ is uniqu, w obtain th sam conclusion for θ. Having provd uniqunss, w must undrstand symmtris. Our dscription obviously implis that, in both σ and θ, th dgs and play symmtric rols, whil th rol of is diffrnt, and th conclusion asily follows. Th sam conclusion could also b dducd from Proposition A.3 blow. Proposition A.2. If K is th solid Klin bottl and K = K thn vry automorphism of K xtnds to K. In particular, thr is only on possibl Dhn filling of a Klin bottl in th boundary of a givn manifold. Proof. Proposition A.1 shows that th mridian a of K can b charactrizd in K = K as th only orintation-prsrving loop having connctd complmnt. So vry automorphism of K maps th mridian to itslf and th conclusion follows. Proposition A.3. Th mapping class group of K is isomorphic to Z/ 2Z Z/ 2Z and vry automorphism of K is dtrmind up to isotopy by its action on H 1 (K; Z). Proof. It is quit asy to construct commuting ordr-2 automorphisms φ and ψ of K such that thir action on H 1 (K; Z) is givn by φ(a) = a, φ(b) = b, ψ(a) = a, ψ(b) = a + b. Givn any othr automorphism f, combining th gomtric charactrization of a with th obsrvation that a is isotopic (not only homologous) to itslf with opposit orintation, w dduc that (up to isotopy) f is th idntity on a. Up to composing f with φ w can assum that f is actually th idntity also nar a, so f rstricts to an automorphism of th annulus K \a which is th idntity on th boundary. Th mapping class group rlativ to th boundary of th annulus is now infinit cyclic gnratd by th rstriction of ψ (but ψ has ordr 2 whn viwd on K), and th conclusion follows.

Recall that by Theorems 10.3 and 10.4 together provide us the estimate o(n2 ), S(q) q 9, q=1

Recall that by Theorems 10.3 and 10.4 together provide us the estimate o(n2 ), S(q) q 9, q=1 Chaptr 11 Th singular sris Rcall that by Thorms 10 and 104 togthr provid us th stimat 9 4 n 2 111 Rn = SnΓ 2 + on2, whr th singular sris Sn was dfind in Chaptr 10 as Sn = q=1 Sq q 9, with Sq = 1 a q gcda,q=1

More information

Week 3: Connected Subgraphs

Week 3: Connected Subgraphs Wk 3: Connctd Subgraphs Sptmbr 19, 2016 1 Connctd Graphs Path, Distanc: A path from a vrtx x to a vrtx y in a graph G is rfrrd to an xy-path. Lt X, Y V (G). An (X, Y )-path is an xy-path with x X and y

More information

Introduction to Arithmetic Geometry Fall 2013 Lecture #20 11/14/2013

Introduction to Arithmetic Geometry Fall 2013 Lecture #20 11/14/2013 18.782 Introduction to Arithmtic Gomtry Fall 2013 Lctur #20 11/14/2013 20.1 Dgr thorm for morphisms of curvs Lt us rstat th thorm givn at th nd of th last lctur, which w will now prov. Thorm 20.1. Lt φ:

More information

Section 6.1. Question: 2. Let H be a subgroup of a group G. Then H operates on G by left multiplication. Describe the orbits for this operation.

Section 6.1. Question: 2. Let H be a subgroup of a group G. Then H operates on G by left multiplication. Describe the orbits for this operation. MAT 444 H Barclo Spring 004 Homwork 6 Solutions Sction 6 Lt H b a subgroup of a group G Thn H oprats on G by lft multiplication Dscrib th orbits for this opration Th orbits of G ar th right costs of H

More information

The Matrix Exponential

The Matrix Exponential Th Matrix Exponntial (with xrciss) by D. Klain Vrsion 207.0.05 Corrctions and commnts ar wlcom. Th Matrix Exponntial For ach n n complx matrix A, dfin th xponntial of A to b th matrix A A k I + A + k!

More information

CS 361 Meeting 12 10/3/18

CS 361 Meeting 12 10/3/18 CS 36 Mting 2 /3/8 Announcmnts. Homwork 4 is du Friday. If Friday is Mountain Day, homwork should b turnd in at my offic or th dpartmnt offic bfor 4. 2. Homwork 5 will b availabl ovr th wknd. 3. Our midtrm

More information

The Matrix Exponential

The Matrix Exponential Th Matrix Exponntial (with xrciss) by Dan Klain Vrsion 28928 Corrctions and commnts ar wlcom Th Matrix Exponntial For ach n n complx matrix A, dfin th xponntial of A to b th matrix () A A k I + A + k!

More information

Addition of angular momentum

Addition of angular momentum Addition of angular momntum April, 0 Oftn w nd to combin diffrnt sourcs of angular momntum to charactriz th total angular momntum of a systm, or to divid th total angular momntum into parts to valuat th

More information

cycle that does not cross any edges (including its own), then it has at least

cycle that does not cross any edges (including its own), then it has at least W prov th following thorm: Thorm If a K n is drawn in th plan in such a way that it has a hamiltonian cycl that dos not cross any dgs (including its own, thn it has at last n ( 4 48 π + O(n crossings Th

More information

Higher order derivatives

Higher order derivatives Robrto s Nots on Diffrntial Calculus Chaptr 4: Basic diffrntiation ruls Sction 7 Highr ordr drivativs What you nd to know alrady: Basic diffrntiation ruls. What you can larn hr: How to rpat th procss of

More information

On spanning trees and cycles of multicolored point sets with few intersections

On spanning trees and cycles of multicolored point sets with few intersections On spanning trs and cycls of multicolord point sts with fw intrsctions M. Kano, C. Mrino, and J. Urrutia April, 00 Abstract Lt P 1,..., P k b a collction of disjoint point sts in R in gnral position. W

More information

Construction of asymmetric orthogonal arrays of strength three via a replacement method

Construction of asymmetric orthogonal arrays of strength three via a replacement method isid/ms/26/2 Fbruary, 26 http://www.isid.ac.in/ statmath/indx.php?modul=prprint Construction of asymmtric orthogonal arrays of strngth thr via a rplacmnt mthod Tian-fang Zhang, Qiaoling Dng and Alok Dy

More information

The Equitable Dominating Graph

The Equitable Dominating Graph Intrnational Journal of Enginring Rsarch and Tchnology. ISSN 0974-3154 Volum 8, Numbr 1 (015), pp. 35-4 Intrnational Rsarch Publication Hous http://www.irphous.com Th Equitabl Dominating Graph P.N. Vinay

More information

SCHUR S THEOREM REU SUMMER 2005

SCHUR S THEOREM REU SUMMER 2005 SCHUR S THEOREM REU SUMMER 2005 1. Combinatorial aroach Prhas th first rsult in th subjct blongs to I. Schur and dats back to 1916. On of his motivation was to study th local vrsion of th famous quation

More information

Basic Polyhedral theory

Basic Polyhedral theory Basic Polyhdral thory Th st P = { A b} is calld a polyhdron. Lmma 1. Eithr th systm A = b, b 0, 0 has a solution or thr is a vctorπ such that π A 0, πb < 0 Thr cass, if solution in top row dos not ist

More information

Addition of angular momentum

Addition of angular momentum Addition of angular momntum April, 07 Oftn w nd to combin diffrnt sourcs of angular momntum to charactriz th total angular momntum of a systm, or to divid th total angular momntum into parts to valuat

More information

COUNTING TAMELY RAMIFIED EXTENSIONS OF LOCAL FIELDS UP TO ISOMORPHISM

COUNTING TAMELY RAMIFIED EXTENSIONS OF LOCAL FIELDS UP TO ISOMORPHISM COUNTING TAMELY RAMIFIED EXTENSIONS OF LOCAL FIELDS UP TO ISOMORPHISM Jim Brown Dpartmnt of Mathmatical Scincs, Clmson Univrsity, Clmson, SC 9634, USA jimlb@g.clmson.du Robrt Cass Dpartmnt of Mathmatics,

More information

3 Finite Element Parametric Geometry

3 Finite Element Parametric Geometry 3 Finit Elmnt Paramtric Gomtry 3. Introduction Th intgral of a matrix is th matrix containing th intgral of ach and vry on of its original componnts. Practical finit lmnt analysis rquirs intgrating matrics,

More information

Einstein Equations for Tetrad Fields

Einstein Equations for Tetrad Fields Apiron, Vol 13, No, Octobr 006 6 Einstin Equations for Ttrad Filds Ali Rıza ŞAHİN, R T L Istanbul (Turky) Evry mtric tnsor can b xprssd by th innr product of ttrad filds W prov that Einstin quations for

More information

A Propagating Wave Packet Group Velocity Dispersion

A Propagating Wave Packet Group Velocity Dispersion Lctur 8 Phys 375 A Propagating Wav Packt Group Vlocity Disprsion Ovrviw and Motivation: In th last lctur w lookd at a localizd solution t) to th 1D fr-particl Schrödingr quation (SE) that corrsponds to

More information

(Upside-Down o Direct Rotation) β - Numbers

(Upside-Down o Direct Rotation) β - Numbers Amrican Journal of Mathmatics and Statistics 014, 4(): 58-64 DOI: 10593/jajms0140400 (Upsid-Down o Dirct Rotation) β - Numbrs Ammar Sddiq Mahmood 1, Shukriyah Sabir Ali,* 1 Dpartmnt of Mathmatics, Collg

More information

u 3 = u 3 (x 1, x 2, x 3 )

u 3 = u 3 (x 1, x 2, x 3 ) Lctur 23: Curvilinar Coordinats (RHB 8.0 It is oftn convnint to work with variabls othr than th Cartsian coordinats x i ( = x, y, z. For xampl in Lctur 5 w mt sphrical polar and cylindrical polar coordinats.

More information

1 Minimum Cut Problem

1 Minimum Cut Problem CS 6 Lctur 6 Min Cut and argr s Algorithm Scribs: Png Hui How (05), Virginia Dat: May 4, 06 Minimum Cut Problm Today, w introduc th minimum cut problm. This problm has many motivations, on of which coms

More information

COMPUTER GENERATED HOLOGRAMS Optical Sciences 627 W.J. Dallas (Monday, April 04, 2005, 8:35 AM) PART I: CHAPTER TWO COMB MATH.

COMPUTER GENERATED HOLOGRAMS Optical Sciences 627 W.J. Dallas (Monday, April 04, 2005, 8:35 AM) PART I: CHAPTER TWO COMB MATH. C:\Dallas\0_Courss\03A_OpSci_67\0 Cgh_Book\0_athmaticalPrliminaris\0_0 Combath.doc of 8 COPUTER GENERATED HOLOGRAS Optical Scincs 67 W.J. Dallas (onday, April 04, 005, 8:35 A) PART I: CHAPTER TWO COB ATH

More information

International Journal of Scientific & Engineering Research, Volume 6, Issue 7, July ISSN

International Journal of Scientific & Engineering Research, Volume 6, Issue 7, July ISSN Intrnational Journal of Scintific & Enginring Rsarch, Volum 6, Issu 7, July-25 64 ISSN 2229-558 HARATERISTIS OF EDGE UTSET MATRIX OF PETERSON GRAPH WITH ALGEBRAI GRAPH THEORY Dr. G. Nirmala M. Murugan

More information

Brief Introduction to Statistical Mechanics

Brief Introduction to Statistical Mechanics Brif Introduction to Statistical Mchanics. Purpos: Ths nots ar intndd to provid a vry quick introduction to Statistical Mchanics. Th fild is of cours far mor vast than could b containd in ths fw pags.

More information

CPSC 665 : An Algorithmist s Toolkit Lecture 4 : 21 Jan Linear Programming

CPSC 665 : An Algorithmist s Toolkit Lecture 4 : 21 Jan Linear Programming CPSC 665 : An Algorithmist s Toolkit Lctur 4 : 21 Jan 2015 Lcturr: Sushant Sachdva Linar Programming Scrib: Rasmus Kyng 1. Introduction An optimization problm rquirs us to find th minimum or maximum) of

More information

Propositional Logic. Combinatorial Problem Solving (CPS) Albert Oliveras Enric Rodríguez-Carbonell. May 17, 2018

Propositional Logic. Combinatorial Problem Solving (CPS) Albert Oliveras Enric Rodríguez-Carbonell. May 17, 2018 Propositional Logic Combinatorial Problm Solving (CPS) Albrt Olivras Enric Rodríguz-Carbonll May 17, 2018 Ovrviw of th sssion Dfinition of Propositional Logic Gnral Concpts in Logic Rduction to SAT CNFs

More information

Lie Groups HW7. Wang Shuai. November 2015

Lie Groups HW7. Wang Shuai. November 2015 Li roups HW7 Wang Shuai Novmbr 015 1 Lt (π, V b a complx rprsntation of a compact group, show that V has an invariant non-dgnratd Hrmitian form. For any givn Hrmitian form on V, (for xampl (u, v = i u

More information

That is, we start with a general matrix: And end with a simpler matrix:

That is, we start with a general matrix: And end with a simpler matrix: DIAGON ALIZATION OF THE STR ESS TEN SOR INTRO DUCTIO N By th us of Cauchy s thorm w ar abl to rduc th numbr of strss componnts in th strss tnsor to only nin valus. An additional simplification of th strss

More information

Thus, because if either [G : H] or [H : K] is infinite, then [G : K] is infinite, then [G : K] = [G : H][H : K] for all infinite cases.

Thus, because if either [G : H] or [H : K] is infinite, then [G : K] is infinite, then [G : K] = [G : H][H : K] for all infinite cases. Homwork 5 M 373K Solutions Mark Lindbrg and Travis Schdlr 1. Prov that th ring Z/mZ (for m 0) is a fild if and only if m is prim. ( ) Proof by Contrapositiv: Hr, thr ar thr cass for m not prim. m 0: Whn

More information

Differential Equations

Differential Equations Prfac Hr ar m onlin nots for m diffrntial quations cours that I tach hr at Lamar Univrsit. Dspit th fact that ths ar m class nots, th should b accssibl to anon wanting to larn how to solv diffrntial quations

More information

On the irreducibility of some polynomials in two variables

On the irreducibility of some polynomials in two variables ACTA ARITHMETICA LXXXII.3 (1997) On th irrducibility of som polynomials in two variabls by B. Brindza and Á. Pintér (Dbrcn) To th mmory of Paul Erdős Lt f(x) and g(y ) b polynomials with intgral cofficints

More information

ON RIGHT(LEFT) DUO PO-SEMIGROUPS. S. K. Lee and K. Y. Park

ON RIGHT(LEFT) DUO PO-SEMIGROUPS. S. K. Lee and K. Y. Park Kangwon-Kyungki Math. Jour. 11 (2003), No. 2, pp. 147 153 ON RIGHT(LEFT) DUO PO-SEMIGROUPS S. K. L and K. Y. Park Abstract. W invstigat som proprtis on right(rsp. lft) duo po-smigroups. 1. Introduction

More information

Strongly Connected Components

Strongly Connected Components Strongly Connctd Componnts Lt G = (V, E) b a dirctd graph Writ if thr is a path from to in G Writ if and is an quivalnc rlation: implis and implis s quivalnc classs ar calld th strongly connctd componnts

More information

REPRESENTATIONS OF LIE GROUPS AND LIE ALGEBRAS

REPRESENTATIONS OF LIE GROUPS AND LIE ALGEBRAS REPRESENTATIONS OF LIE GROUPS AND LIE ALGEBRAS JIAQI JIANG Abstract. This papr studis th rlationship btwn rprsntations of a Li group and rprsntations of its Li algbra. W will mak th corrspondnc in two

More information

Finding low cost TSP and 2-matching solutions using certain half integer subtour vertices

Finding low cost TSP and 2-matching solutions using certain half integer subtour vertices Finding low cost TSP and 2-matching solutions using crtain half intgr subtour vrtics Sylvia Boyd and Robrt Carr Novmbr 996 Introduction Givn th complt graph K n = (V, E) on n nods with dg costs c R E,

More information

Principles of Humidity Dalton s law

Principles of Humidity Dalton s law Principls of Humidity Dalton s law Air is a mixtur of diffrnt gass. Th main gas componnts ar: Gas componnt volum [%] wight [%] Nitrogn N 2 78,03 75,47 Oxygn O 2 20,99 23,20 Argon Ar 0,93 1,28 Carbon dioxid

More information

BINOMIAL COEFFICIENTS INVOLVING INFINITE POWERS OF PRIMES

BINOMIAL COEFFICIENTS INVOLVING INFINITE POWERS OF PRIMES BINOMIAL COEFFICIENTS INVOLVING INFINITE POWERS OF PRIMES DONALD M. DAVIS Abstract. If p is a prim (implicit in notation and n a positiv intgr, lt ν(n dnot th xponnt of p in n, and U(n n/p ν(n, th unit

More information

Quasi-Classical States of the Simple Harmonic Oscillator

Quasi-Classical States of the Simple Harmonic Oscillator Quasi-Classical Stats of th Simpl Harmonic Oscillator (Draft Vrsion) Introduction: Why Look for Eignstats of th Annihilation Oprator? Excpt for th ground stat, th corrspondnc btwn th quantum nrgy ignstats

More information

Cramér-Rao Inequality: Let f(x; θ) be a probability density function with continuous parameter

Cramér-Rao Inequality: Let f(x; θ) be a probability density function with continuous parameter WHEN THE CRAMÉR-RAO INEQUALITY PROVIDES NO INFORMATION STEVEN J. MILLER Abstract. W invstigat a on-paramtr family of probability dnsitis (rlatd to th Parto distribution, which dscribs many natural phnomna)

More information

ECE602 Exam 1 April 5, You must show ALL of your work for full credit.

ECE602 Exam 1 April 5, You must show ALL of your work for full credit. ECE62 Exam April 5, 27 Nam: Solution Scor: / This xam is closd-book. You must show ALL of your work for full crdit. Plas rad th qustions carfully. Plas chck your answrs carfully. Calculators may NOT b

More information

What is a hereditary algebra?

What is a hereditary algebra? What is a hrditary algbra? (On Ext 2 and th vanishing of Ext 2 ) Claus Michal Ringl At th Münstr workshop 2011, thr short lcturs wr arrangd in th styl of th rgular column in th Notics of th AMS: What is?

More information

u x v x dx u x v x v x u x dx d u x v x u x v x dx u x v x dx Integration by Parts Formula

u x v x dx u x v x v x u x dx d u x v x u x v x dx u x v x dx Integration by Parts Formula 7. Intgration by Parts Each drivativ formula givs ris to a corrsponding intgral formula, as w v sn many tims. Th drivativ product rul yilds a vry usful intgration tchniqu calld intgration by parts. Starting

More information

Square of Hamilton cycle in a random graph

Square of Hamilton cycle in a random graph Squar of Hamilton cycl in a random graph Andrzj Dudk Alan Friz Jun 28, 2016 Abstract W show that p = n is a sharp thrshold for th random graph G n,p to contain th squar of a Hamilton cycl. This improvs

More information

Homework #3. 1 x. dx. It therefore follows that a sum of the

Homework #3. 1 x. dx. It therefore follows that a sum of the Danil Cannon CS 62 / Luan March 5, 2009 Homwork # 1. Th natural logarithm is dfind by ln n = n 1 dx. It thrfor follows that a sum of th 1 x sam addnd ovr th sam intrval should b both asymptotically uppr-

More information

Equidistribution and Weyl s criterion

Equidistribution and Weyl s criterion Euidistribution and Wyl s critrion by Brad Hannigan-Daly W introduc th ida of a sunc of numbrs bing uidistributd (mod ), and w stat and prov a thorm of Hrmann Wyl which charactrizs such suncs. W also discuss

More information

Mutually Independent Hamiltonian Cycles of Pancake Networks

Mutually Independent Hamiltonian Cycles of Pancake Networks Mutually Indpndnt Hamiltonian Cycls of Pancak Ntworks Chng-Kuan Lin Dpartmnt of Mathmatics National Cntral Univrsity, Chung-Li, Taiwan 00, R O C discipl@ms0urlcomtw Hua-Min Huang Dpartmnt of Mathmatics

More information

Fourier Transforms and the Wave Equation. Key Mathematics: More Fourier transform theory, especially as applied to solving the wave equation.

Fourier Transforms and the Wave Equation. Key Mathematics: More Fourier transform theory, especially as applied to solving the wave equation. Lur 7 Fourir Transforms and th Wav Euation Ovrviw and Motivation: W first discuss a fw faturs of th Fourir transform (FT), and thn w solv th initial-valu problm for th wav uation using th Fourir transform

More information

Search sequence databases 3 10/25/2016

Search sequence databases 3 10/25/2016 Sarch squnc databass 3 10/25/2016 Etrm valu distribution Ø Suppos X is a random variabl with probability dnsity function p(, w sampl a larg numbr S of indpndnt valus of X from this distribution for an

More information

SECTION where P (cos θ, sin θ) and Q(cos θ, sin θ) are polynomials in cos θ and sin θ, provided Q is never equal to zero.

SECTION where P (cos θ, sin θ) and Q(cos θ, sin θ) are polynomials in cos θ and sin θ, provided Q is never equal to zero. SETION 6. 57 6. Evaluation of Dfinit Intgrals Exampl 6.6 W hav usd dfinit intgrals to valuat contour intgrals. It may com as a surpris to larn that contour intgrals and rsidus can b usd to valuat crtain

More information

EEO 401 Digital Signal Processing Prof. Mark Fowler

EEO 401 Digital Signal Processing Prof. Mark Fowler EEO 401 Digital Signal Procssing Prof. Mark Fowlr Dtails of th ot St #19 Rading Assignmnt: Sct. 7.1.2, 7.1.3, & 7.2 of Proakis & Manolakis Dfinition of th So Givn signal data points x[n] for n = 0,, -1

More information

Limiting value of higher Mahler measure

Limiting value of higher Mahler measure Limiting valu of highr Mahlr masur Arunabha Biswas a, Chris Monico a, a Dpartmnt of Mathmatics & Statistics, Txas Tch Univrsity, Lubbock, TX 7949, USA Abstract W considr th k-highr Mahlr masur m k P )

More information

Derangements and Applications

Derangements and Applications 2 3 47 6 23 Journal of Intgr Squncs, Vol. 6 (2003), Articl 03..2 Drangmnts and Applications Mhdi Hassani Dpartmnt of Mathmatics Institut for Advancd Studis in Basic Scincs Zanjan, Iran mhassani@iasbs.ac.ir

More information

u r du = ur+1 r + 1 du = ln u + C u sin u du = cos u + C cos u du = sin u + C sec u tan u du = sec u + C e u du = e u + C

u r du = ur+1 r + 1 du = ln u + C u sin u du = cos u + C cos u du = sin u + C sec u tan u du = sec u + C e u du = e u + C Tchniqus of Intgration c Donald Kridr and Dwight Lahr In this sction w ar going to introduc th first approachs to valuating an indfinit intgral whos intgrand dos not hav an immdiat antidrivativ. W bgin

More information

LINEAR DELAY DIFFERENTIAL EQUATION WITH A POSITIVE AND A NEGATIVE TERM

LINEAR DELAY DIFFERENTIAL EQUATION WITH A POSITIVE AND A NEGATIVE TERM Elctronic Journal of Diffrntial Equations, Vol. 2003(2003), No. 92, pp. 1 6. ISSN: 1072-6691. URL: http://jd.math.swt.du or http://jd.math.unt.du ftp jd.math.swt.du (login: ftp) LINEAR DELAY DIFFERENTIAL

More information

BINOMIAL COEFFICIENTS INVOLVING INFINITE POWERS OF PRIMES. 1. Statement of results

BINOMIAL COEFFICIENTS INVOLVING INFINITE POWERS OF PRIMES. 1. Statement of results BINOMIAL COEFFICIENTS INVOLVING INFINITE POWERS OF PRIMES DONALD M. DAVIS Abstract. If p is a prim and n a positiv intgr, lt ν p (n dnot th xponnt of p in n, and u p (n n/p νp(n th unit part of n. If α

More information

GEOMETRICAL PHENOMENA IN THE PHYSICS OF SUBATOMIC PARTICLES. Eduard N. Klenov* Rostov-on-Don, Russia

GEOMETRICAL PHENOMENA IN THE PHYSICS OF SUBATOMIC PARTICLES. Eduard N. Klenov* Rostov-on-Don, Russia GEOMETRICAL PHENOMENA IN THE PHYSICS OF SUBATOMIC PARTICLES Eduard N. Klnov* Rostov-on-Don, Russia Th articl considrs phnomnal gomtry figurs bing th carrirs of valu spctra for th pairs of th rmaining additiv

More information

UNTYPED LAMBDA CALCULUS (II)

UNTYPED LAMBDA CALCULUS (II) 1 UNTYPED LAMBDA CALCULUS (II) RECALL: CALL-BY-VALUE O.S. Basic rul Sarch ruls: (\x.) v [v/x] 1 1 1 1 v v CALL-BY-VALUE EVALUATION EXAMPLE (\x. x x) (\y. y) x x [\y. y / x] = (\y. y) (\y. y) y [\y. y /

More information

Separating principles below Ramsey s Theorem for Pairs

Separating principles below Ramsey s Theorem for Pairs Sparating principls blow Ramsy s Thorm for Pairs Manul Lrman, Rd Solomon, Hnry Towsnr Fbruary 4, 2013 1 Introduction In rcnt yars, thr has bn a substantial amount of work in rvrs mathmatics concrning natural

More information

Ch. 24 Molecular Reaction Dynamics 1. Collision Theory

Ch. 24 Molecular Reaction Dynamics 1. Collision Theory Ch. 4 Molcular Raction Dynamics 1. Collision Thory Lctur 16. Diffusion-Controlld Raction 3. Th Matrial Balanc Equation 4. Transition Stat Thory: Th Eyring Equation 5. Transition Stat Thory: Thrmodynamic

More information

Deift/Zhou Steepest descent, Part I

Deift/Zhou Steepest descent, Part I Lctur 9 Dift/Zhou Stpst dscnt, Part I W now focus on th cas of orthogonal polynomials for th wight w(x) = NV (x), V (x) = t x2 2 + x4 4. Sinc th wight dpnds on th paramtr N N w will writ π n,n, a n,n,

More information

COHORT MBA. Exponential function. MATH review (part2) by Lucian Mitroiu. The LOG and EXP functions. Properties: e e. lim.

COHORT MBA. Exponential function. MATH review (part2) by Lucian Mitroiu. The LOG and EXP functions. Properties: e e. lim. MTH rviw part b Lucian Mitroiu Th LOG and EXP functions Th ponntial function p : R, dfind as Proprtis: lim > lim p Eponntial function Y 8 6 - -8-6 - - X Th natural logarithm function ln in US- log: function

More information

The van der Waals interaction 1 D. E. Soper 2 University of Oregon 20 April 2012

The van der Waals interaction 1 D. E. Soper 2 University of Oregon 20 April 2012 Th van dr Waals intraction D. E. Sopr 2 Univrsity of Orgon 20 pril 202 Th van dr Waals intraction is discussd in Chaptr 5 of J. J. Sakurai, Modrn Quantum Mchanics. Hr I tak a look at it in a littl mor

More information

NIL-BOHR SETS OF INTEGERS

NIL-BOHR SETS OF INTEGERS NIL-BOHR SETS OF INTEGERS BERNARD HOST AND BRYNA KRA Abstract. W study rlations btwn substs of intgrs that ar larg, whr larg can b intrprtd in trms of siz (such as a st of positiv uppr dnsity or a st with

More information

Function Spaces. a x 3. (Letting x = 1 =)) a(0) + b + c (1) = 0. Row reducing the matrix. b 1. e 4 3. e 9. >: (x = 1 =)) a(0) + b + c (1) = 0

Function Spaces. a x 3. (Letting x = 1 =)) a(0) + b + c (1) = 0. Row reducing the matrix. b 1. e 4 3. e 9. >: (x = 1 =)) a(0) + b + c (1) = 0 unction Spacs Prrquisit: Sction 4.7, Coordinatization n this sction, w apply th tchniqus of Chaptr 4 to vctor spacs whos lmnts ar functions. Th vctor spacs P n and P ar familiar xampls of such spacs. Othr

More information

Lecture 37 (Schrödinger Equation) Physics Spring 2018 Douglas Fields

Lecture 37 (Schrödinger Equation) Physics Spring 2018 Douglas Fields Lctur 37 (Schrödingr Equation) Physics 6-01 Spring 018 Douglas Filds Rducd Mass OK, so th Bohr modl of th atom givs nrgy lvls: E n 1 k m n 4 But, this has on problm it was dvlopd assuming th acclration

More information

CLONES IN 3-CONNECTED FRAME MATROIDS

CLONES IN 3-CONNECTED FRAME MATROIDS CLONES IN 3-CONNECTED FRAME MATROIDS JAKAYLA ROBBINS, DANIEL SLILATY, AND XIANGQIAN ZHOU Abstract. W dtrmin th structur o clonal classs o 3-connctd ram matroids in trms o th structur o biasd graphs. Robbins

More information

Figure 1: Closed surface, surface with boundary, or not a surface?

Figure 1: Closed surface, surface with boundary, or not a surface? QUESTION 1 (10 marks) Two o th topological spacs shown in Figur 1 ar closd suracs, two ar suracs with boundary, and two ar not suracs. Dtrmin which is which. You ar not rquird to justiy your answr, but,

More information

Supplementary Materials

Supplementary Materials 6 Supplmntary Matrials APPENDIX A PHYSICAL INTERPRETATION OF FUEL-RATE-SPEED FUNCTION A truck running on a road with grad/slop θ positiv if moving up and ngativ if moving down facs thr rsistancs: arodynamic

More information

There is an arbitrary overall complex phase that could be added to A, but since this makes no difference we set it to zero and choose A real.

There is an arbitrary overall complex phase that could be added to A, but since this makes no difference we set it to zero and choose A real. Midtrm #, Physics 37A, Spring 07. Writ your rsponss blow or on xtra pags. Show your work, and tak car to xplain what you ar doing; partial crdit will b givn for incomplt answrs that dmonstrat som concptual

More information

10. The Discrete-Time Fourier Transform (DTFT)

10. The Discrete-Time Fourier Transform (DTFT) Th Discrt-Tim Fourir Transform (DTFT Dfinition of th discrt-tim Fourir transform Th Fourir rprsntation of signals plays an important rol in both continuous and discrt signal procssing In this sction w

More information

Estimation of apparent fraction defective: A mathematical approach

Estimation of apparent fraction defective: A mathematical approach Availabl onlin at www.plagiarsarchlibrary.com Plagia Rsarch Library Advancs in Applid Scinc Rsarch, 011, (): 84-89 ISSN: 0976-8610 CODEN (USA): AASRFC Estimation of apparnt fraction dfctiv: A mathmatical

More information

2.3 Matrix Formulation

2.3 Matrix Formulation 23 Matrix Formulation 43 A mor complicatd xampl ariss for a nonlinar systm of diffrntial quations Considr th following xampl Exampl 23 x y + x( x 2 y 2 y x + y( x 2 y 2 (233 Transforming to polar coordinats,

More information

Types of Transfer Functions. Types of Transfer Functions. Types of Transfer Functions. Ideal Filters. Ideal Filters

Types of Transfer Functions. Types of Transfer Functions. Types of Transfer Functions. Ideal Filters. Ideal Filters Typs of Transfr Typs of Transfr x[n] X( LTI h[n] H( y[n] Y( y [ n] h[ k] x[ n k] k Y ( H ( X ( Th tim-domain classification of an LTI digital transfr function is basd on th lngth of its impuls rspons h[n]:

More information

Embeddings of graph braid and surface groups in right-angled Artin groups and braid groups

Embeddings of graph braid and surface groups in right-angled Artin groups and braid groups ISSN 1472-2739 (on-lin) 1472-2747 (printd) 439 Algbraic & Gomtric Topology Volum 4 (2004) 439 472 Publishd: 27 Jun 2004 ATG Embddings of graph braid and surfac groups in right-angld Artin groups and braid

More information

Homogeneous Constant Matrix Systems, Part I

Homogeneous Constant Matrix Systems, Part I 39 Homognous Constant Matrix Systms, Part I Finally, w can start discussing mthods for solving a vry important class of diffrntial quation systms of diffrntial quations: homognous constant matrix systms

More information

Platonic Orthonormal Wavelets 1

Platonic Orthonormal Wavelets 1 APPLIED AND COMPUTATIONAL HARMONIC ANALYSIS 4, 351 35 (1997) ARTICLE NO. HA9701 Platonic Orthonormal Wavlts 1 Murad Özaydin and Tomasz Przbinda Dpartmnt of Mathmatics, Univrsity of Oklahoma, Norman, Oklahoma

More information

On systems of complex numbers and their application to the theory of transformation groups.

On systems of complex numbers and their application to the theory of transformation groups. Übr Systm complxr Zahln und ihr Anwndung in dr Thori dr Transformationsgruppn Monatsth. f. Math. u. Physik (89), 8-54. On systms of complx numbrs and thir application to th thory of transformation groups.

More information

Homotopy perturbation technique

Homotopy perturbation technique Comput. Mthods Appl. Mch. Engrg. 178 (1999) 257±262 www.lsvir.com/locat/cma Homotopy prturbation tchniqu Ji-Huan H 1 Shanghai Univrsity, Shanghai Institut of Applid Mathmatics and Mchanics, Shanghai 272,

More information

Hydrogen Atom and One Electron Ions

Hydrogen Atom and One Electron Ions Hydrogn Atom and On Elctron Ions Th Schrödingr quation for this two-body problm starts out th sam as th gnral two-body Schrödingr quation. First w sparat out th motion of th cntr of mass. Th intrnal potntial

More information

Linear-Phase FIR Transfer Functions. Functions. Functions. Functions. Functions. Functions. Let

Linear-Phase FIR Transfer Functions. Functions. Functions. Functions. Functions. Functions. Let It is impossibl to dsign an IIR transfr function with an xact linar-phas It is always possibl to dsign an FIR transfr function with an xact linar-phas rspons W now dvlop th forms of th linarphas FIR transfr

More information

Chapter 10. The singular integral Introducing S(n) and J(n)

Chapter 10. The singular integral Introducing S(n) and J(n) Chaptr Th singular intgral Our aim in this chaptr is to rplac th functions S (n) and J (n) by mor convnint xprssions; ths will b calld th singular sris S(n) and th singular intgral J(n). This will b don

More information

EEO 401 Digital Signal Processing Prof. Mark Fowler

EEO 401 Digital Signal Processing Prof. Mark Fowler EEO 401 Digital Signal Procssing Prof. Mark Fowlr ot St #18 Introduction to DFT (via th DTFT) Rading Assignmnt: Sct. 7.1 of Proakis & Manolakis 1/24 Discrt Fourir Transform (DFT) W v sn that th DTFT is

More information

Abstract Interpretation: concrete and abstract semantics

Abstract Interpretation: concrete and abstract semantics Abstract Intrprtation: concrt and abstract smantics Concrt smantics W considr a vry tiny languag that manags arithmtic oprations on intgrs valus. Th (concrt) smantics of th languags cab b dfind by th funzcion

More information

First derivative analysis

First derivative analysis Robrto s Nots on Dirntial Calculus Chaptr 8: Graphical analysis Sction First drivativ analysis What you nd to know alrady: How to us drivativs to idntiy th critical valus o a unction and its trm points

More information

ANALYSIS IN THE FREQUENCY DOMAIN

ANALYSIS IN THE FREQUENCY DOMAIN ANALYSIS IN THE FREQUENCY DOMAIN SPECTRAL DENSITY Dfinition Th spctral dnsit of a S.S.P. t also calld th spctrum of t is dfind as: + { γ }. jτ γ τ F τ τ In othr words, of th covarianc function. is dfind

More information

Title: Vibrational structure of electronic transition

Title: Vibrational structure of electronic transition Titl: Vibrational structur of lctronic transition Pag- Th band spctrum sn in th Ultra-Violt (UV) and visibl (VIS) rgions of th lctromagntic spctrum can not intrprtd as vibrational and rotational spctrum

More information

SOME PARAMETERS ON EQUITABLE COLORING OF PRISM AND CIRCULANT GRAPH.

SOME PARAMETERS ON EQUITABLE COLORING OF PRISM AND CIRCULANT GRAPH. SOME PARAMETERS ON EQUITABLE COLORING OF PRISM AND CIRCULANT GRAPH. K VASUDEVAN, K. SWATHY AND K. MANIKANDAN 1 Dpartmnt of Mathmatics, Prsidncy Collg, Chnnai-05, India. E-Mail:vasu k dvan@yahoo.com. 2,

More information

5.80 Small-Molecule Spectroscopy and Dynamics

5.80 Small-Molecule Spectroscopy and Dynamics MIT OpnCoursWar http://ocw.mit.du 5.80 Small-Molcul Spctroscopy and Dynamics Fall 008 For information about citing ths matrials or our Trms of Us, visit: http://ocw.mit.du/trms. Lctur # 3 Supplmnt Contnts

More information

4. Money cannot be neutral in the short-run the neutrality of money is exclusively a medium run phenomenon.

4. Money cannot be neutral in the short-run the neutrality of money is exclusively a medium run phenomenon. PART I TRUE/FALSE/UNCERTAIN (5 points ach) 1. Lik xpansionary montary policy, xpansionary fiscal policy rturns output in th mdium run to its natural lvl, and incrass prics. Thrfor, fiscal policy is also

More information

arxiv: v2 [cs.dm] 17 May 2018

arxiv: v2 [cs.dm] 17 May 2018 Inhritanc of Convxity for th P min -Rstrictd Gam arxiv:708.0675v [cs.dm] 7 May 08 A. Skoda July 6, 08 Abstract W considr rstrictd gams on wightd graphs associatd with minimum partitions. W rplac in th

More information

Problem Set 6 Solutions

Problem Set 6 Solutions 6.04/18.06J Mathmatics for Computr Scinc March 15, 005 Srini Dvadas and Eric Lhman Problm St 6 Solutions Du: Monday, March 8 at 9 PM in Room 3-044 Problm 1. Sammy th Shark is a financial srvic providr

More information

The second condition says that a node α of the tree has exactly n children if the arity of its label is n.

The second condition says that a node α of the tree has exactly n children if the arity of its label is n. CS 6110 S14 Hanout 2 Proof of Conflunc 27 January 2014 In this supplmntary lctur w prov that th λ-calculus is conflunt. This is rsult is u to lonzo Church (1903 1995) an J. arkly Rossr (1907 1989) an is

More information

1.2 Faraday s law A changing magnetic field induces an electric field. Their relation is given by:

1.2 Faraday s law A changing magnetic field induces an electric field. Their relation is given by: Elctromagntic Induction. Lorntz forc on moving charg Point charg moving at vlocity v, F qv B () For a sction of lctric currnt I in a thin wir dl is Idl, th forc is df Idl B () Elctromotiv forc f s any

More information

INCOMPLETE KLOOSTERMAN SUMS AND MULTIPLICATIVE INVERSES IN SHORT INTERVALS. xy 1 (mod p), (x, y) I (j)

INCOMPLETE KLOOSTERMAN SUMS AND MULTIPLICATIVE INVERSES IN SHORT INTERVALS. xy 1 (mod p), (x, y) I (j) INCOMPLETE KLOOSTERMAN SUMS AND MULTIPLICATIVE INVERSES IN SHORT INTERVALS T D BROWNING AND A HAYNES Abstract W invstigat th solubility of th congrunc xy (mod ), whr is a rim and x, y ar rstrictd to li

More information

1 General boundary conditions in diffusion

1 General boundary conditions in diffusion Gnral boundary conditions in diffusion Πρόβλημα 4.8 : Δίνεται μονοδιάτατη πλάκα πάχους, που το ένα άκρο της κρατιέται ε θερμοκραία T t και το άλλο ε θερμοκραία T 2 t. Αν η αρχική θερμοκραία της πλάκας

More information

Calculus concepts derivatives

Calculus concepts derivatives All rasonabl fforts hav bn mad to mak sur th nots ar accurat. Th author cannot b hld rsponsibl for any damags arising from th us of ths nots in any fashion. Calculus concpts drivativs Concpts involving

More information

Complex Powers and Logs (5A) Young Won Lim 10/17/13

Complex Powers and Logs (5A) Young Won Lim 10/17/13 Complx Powrs and Logs (5A) Copyright (c) 202, 203 Young W. Lim. Prmission is grantd to copy, distribut and/or modify this documnt undr th trms of th GNU Fr Documntation Licns, Vrsion.2 or any latr vrsion

More information

10. Limits involving infinity

10. Limits involving infinity . Limits involving infinity It is known from th it ruls for fundamntal arithmtic oprations (+,-,, ) that if two functions hav finit its at a (finit or infinit) point, that is, thy ar convrgnt, th it of

More information