LECTURE NOTES FOR , FALL 2004

Size: px
Start display at page:

Download "LECTURE NOTES FOR , FALL 2004"

Transcription

1 LECTURE NOTES FOR , FALL Cone support and wavefront set In disussing the singular support of a tempered distibution above, notie that singsupp(u) = only implies that u C (R n ), not as one might want, that u S(R n ). We an however refine the onept of singular support a little to get this. Let us think of the sphere S n 1 as the set of asymptoti diretions in n R. That is, we identify a point in S n 1 with a half-line {a x; a (0, )} for 0 = x R n. Sine two points give the same half-line if and only if they are positive multiples of eah other, this means we think of the sphere as the quotient (12.1) S n 1 = (R n \ {0})/R +. Of ourse if we have a metri on R n, for instane the usual Eulidean metri, then we an identify S n 1 with the unit sphere. However (12.1) does not require a hoie of metri. Now, suppose we onsider funtions on R n \{0} whih are (positively) homogeneous of degree 0. That is f (a x) = f ( x), for all a > 0, and they are just funtions on S n 1. Smooth funtions on S n 1 orrespond (if you like by definition) with smooth funtions on R n \ {0} whih are homogeneous of degree 0. Let us take suh a funtion υ C (R n \{0}), υ(ax) = υ(x) for all a > 0. Now, to make this smooth on R n we need to ut it off near 0. So hoose a utoff funtion α C (R n ), with α(x) = 1 in x < 1. Then (12.2) υ R (x) = υ(x)(1 α(x/r)) C (R n ), for any R > 0. This funtion is supported in x R. Now, if υ has support near some point φ S n 1 then for R large the orresponding funtion υ R will loalize near φ as a point at infinity of R n. Rather than try to understand this diretly, let us onsider a orresponding analyti onstrution. First of all, a funtion of the form υ R is a multiplier on S(R n ). That is, (12.3) υ R : S(R n ) S(R n ). To see this, the main problem is to estimate the derivatives at infinity, sine the produt of smooth funtions is smooth. This in turn amounts to estimating the deriviatives of υ in x 1. This we an do using the homogeneity.

2 84 RICHARD B. MELROSE Lemma If υ C (R n \ {0}) is homogeneous of degree 0 then (12.4) D α υ C α α x. Proof. I should not have even alled this a lemma. By the hain rule, the derivative of order α is a homogeneous funtion of degree α from whih (12.4) follows. For the smoothed versio, υ R, of υ this gives the estimates (12.5) D α υ R (x) C α x. γα α α This allows us to estimate the derivatives of the produt of a Shwartz funtion and υ R : (12.6) x β D (υ R f) = ( α D α γ υ R x β D γ f = sup x β D (υ R f) C sup f k π x 1 for some seminorm on S(R n ). Thus the map (12.3) is atually ontinuous. This ontinuity means that υ R is a multiplier on S (R n ), defined as usual by duality: (12.7) υ R u(f) = u(υ R f) f S(R n ). Definition The one-support and one-singular-support of a tempered distribution are the subsets Csp(u) R n S n 1 and Css(u) n R S n 1 defined by the onditions (12.8) Csp(u) R n = supp(u) (Csp(u)) S n 1 ={φ S n 1 ; (Css(u)) S n 1 ={φ S n 1 ; (S n 1 R > 0, υ C ), υ(φ) 0, υ R u = 0}, Css(u) R n = singsupp(u) (S n 1 R > 0, υ C ), υ(φ) 0, υ R u S(R n )}. That is, on the R n part these are the same sets as before but at infinity they are defined by oni loalization on S n 1. In onsidering Csp(u) and Css(u) it is onvenient to ombine R n and S n 1 into a ompatifiation of R n. To do so (topologially) let us identify R n with the interior of the unit ball with respet to the Eulidean metri using the map x (12.9) R n x {y R n ; y 1} = B n. x α

3 LECTURE NOTES FOR , FALL Clearly x < x and for 0 a < 1, x = a x has only the solution 1 x = a/(1 a 2 ) 2. Thus if we ombine (12.9) with the identifiation of n S with the unit sphere we get an identifiation (12.10) R n S n 1 B n. Using this identifiation we an, and will, regard Csp(u) and Css(u) as subsets of B n. 21 Lemma For any u S (R n ), Csp(u) and Css(u) are losed subsets of B n and if υ C (S n ) has supp( υ ) Css(u) = then for R suffiiently large υ Ru S(R n ). Proof. Diretly from the definition we know that Csp(u) R n is losed, as is Css(u) R n. Thus, in eah ase, we need to show that if φ S n 1 and φ / Csp(u) then Csp(u) is disjoint from some neighbourhood of φ in B n. However, by definition, U = {x R n ; υ R (x) = 0} {φ S n 1 ; υ(φ ) = 0} is suh a neighbourhood. Thus the fat that Csp(u) is losed follows diretly from the definition. The argument for Css(u) is essentially the same. The seond result follows by the use of a partition of unity on S n 1. Thus, for eah point in supp(υ) S n 1 there exists a oni loalizer for whih υ R u S(R n ). By ompatness we may hoose a finite number of these funtions υ j suh that the open sets {υ j (φ) > 0} over supp( υ ). By assumption (υ j ) Rj u S(R n ) for some R j > 0. However this will remain true if R j is inreased, so we may suppose that R j = R is independent of j. Then for funtion µ = υ j 2 C (S n 1 ) j we have µ R u S(R n ). Sine υ = υ µ for some µ C (S n 1 ) it follows that υ R+1u S(R n ) as laimed. Corollary If u S (R n ) then Css(u) = if and only if u S(R n ). Proof. Certainly Css(u) = if u S(R n ). If u S (R n ) and Css(u) = then from Lemma 12.3, υ R u S(R n ) where υ = 1. Thus v = (1 υ R )u C (R n ) has singsupp(v) = so v C (R n ) and hene u S(R n ). 21 In fat while the topology here is orret the smooth struture on B n is not the right one see Problem?? For our purposes here this issue is irrelevant.

4 86 RICHARD B. MELROSE Of ourse the analogous result for Csp(u), that Csp(u) = if and only if u = 0 follows from the fat that this is true if supp(u) =. I will treat a few other properties as self-evident. For instane (12.11) Csp(χu) Csp(u), Css(χu) Css(u) u S (R n ), χ S(R n ) and (12.12) Csp( 1 u u 2 ) Csp(u 1 ) Csp(u 2 ), Css( 1 u u 2 ) Css(u 1 ) Css(u 2 ) u 1, u 2 S (R n ), 1, 2 C. One useful onsequene of having the one support at our disposal is that we an disuss suffiient onditions to allow us to multiply distributions; we will get better onditions below using the same idea but applied to the wavefront set but this preliminary disussion is used there. In general the produt of two distributions is not defined, and indeed not definable, as a distribution. However, we an always multiply an element of S (R n ) and an element of S(R n ). To try to understand multipliation look at the question of pairing between two distributions. Lemma If K i B n, i = 1, 2, are two disjoint losed (hene ompat) subsets then we an define an unambiguous pairing (12.13) {u S (R n ); Css(u) K 1 } {u S (R n ); Css(u) K 2 } (u 1, u 2 ) u 1 (u 2 ) C. Proof. To define the pairing, hoose a funtion υ C (S n 1 ) whih is identially equal to 1 in a neighbourhood of K 1 S n 1 and with support disjoint from K 2 S n 1. Then extend it to be homogeneous, as above, and ut off to get υ R. If R is large enough Csp(υ R ) is disjoint from K 2. Then υ R + (1 υ) R = 1 + ν where ν C (R n ). We an find another funtion µ C (R n ) suh that υ 1 = υ R + µ = 1 in a neighbourhood of K 1 and with Csp(υ 1 ) disjoint from K 2. One we have this, for u 1 and u2 as in (12.13), (12.14) υ 1 u 2 S(R n ) and (1 υ 1 )u 1 S(R n ) sine in both ases Css is empty from the definition. Thus we an define the desired pairing between u 1 and u 2 by (12.15) u 1 (u 2 ) = u 1 (υ 1 u 2 ) + u 2 ((1 υ 1 )u 1 ).

5 LECTURE NOTES FOR , FALL Of ourse we should hek that this definition is independent of the ut-off funtion used in it. However, if we go through the definition and hoose a different funtion υ to start with, extend it homogeneoulsy and ut off (probably at a different R) and then find a orretion term µ then the 1-parameter linear homotopy between them (12.16) υ 1 (t) = tυ 1 + (1 t)υ 1, t [0, 1] satisfies all the onditions required of υ 1 in formula (12.14). Thus in fat we get a smooth family of pairings, whih we an write for the moment as (12.17) (u 1, u 2 ) t = u 1 (υ 1 (t)u 2 ) + u 2 ((1 υ 1 (t))u 1 ). By inspetion, this is an affine-linear funtion of t with derivative (12.18) u 1 ((υ 1 υ 1 )u 2 ) + u 2 ((υ υ 1 ))u 1 ). 1 Now, we just have to justify moving the smooth funtion in (12.18) to see that this gives zero. This should be possible sine Csp(υ1 υ 1 ) is disjoint from both K 1 and K 2. In fat, to be very areful for one, we should onstrut another funtion α in the same way as we onstruted υ 1 to be homogenous near infinity and smooth and suh that Csp(α) is also disjoint from both K1 and K 2 but α = 1 on Csp(υ1 υ 1 ). Then α(υ1 υ 1 ) = υ1 υ 1 so we an insert it in (12.18) and justify (12.19) u 1 ((υ 1 υ 1 )u 2 ) = u 1 (α 2 (υ 1 υ 1 )u 2 ) = (αu 1 )((υ 1 υ 1 )αu 2 ) = (αu 2 )(υ 1 υ 1 )αu 1 ) = u 2 (υ 1 υ 1 )αu 1 ). Here the seond equality is just the identity for α as a (multipliative) linear map on S(R n ) and hene S (R n ) and the operation to give the ruial, third, equality is permissible beause both elements are in S(R n ). One we have defined the pairing between tempered distibutions with disjoint oni singular supports, in the sense of (12.14), (12.15), we an define the produt under the same onditions. Namely to define the produt of say u 1 and u 2 we simply set (12.20) u 1 u 2 (χ) = u 1 (χu 2 ) = u 2 (χu 1 ) χ S(R n ), provided Css(u 1 ) Css(u 2 ) =. Indeed, this would be true if one of u 1 or u 2 was itself in S(R n ) and makes sense in general. I leave it to you to hek the ontinuity statement required to prove that the produt is atually a tempered distibution (Problem 78).

6 88 RICHARD B. MELROSE One an also give a similar disussion of the onvolution of two tempered distributions. One again we do not have a definition of u v as a tempered distribution for all u, v S (R n ). We do know how to define the onvolution if either u or v is ompatly supported, or if either is in S(R n ). This leads diretly to Lemma If Css(u) S n 1 = then u v is defined unambiguously by x (12.21) u v = u 1 v + u 2 v, u 1 = (1 α( ))u, u 2 = u u 1 r where α C (R n ) has α(x) = 1 in x 1 and R is suffiiently large; there is a similar definition if Css(v) S n 1 =. Proof. Sine Css(u) S n 1 =, we know that Css(u 1 ) = if R is large enough, so then both terms on the right in (12.21) are well-defined. To see that the result is independent of R just observe that the differene of the right-hand side for two values of R is of the form w v w v with w ompatly supported. Now, we an go even further using a slightly more sophistiated deomposition based on Lemma If u S (R n ) and Css(u) Γ = where Γ S n 1 is a losed set, then u = u 1 + u 2 where Csp(u 1 ) Γ = and u 2 S(R n ); in fat (12.22) u = u 1 + u 1 + u 2 where u 1 C (R n ) and 0 / supp(u 1 ), x R n \ {0}, x/ x Γ = x / supp(u 1 ). Proof. A overing argument whih you should provide. Let Γ i R n, i = 1, 2, be losed ones. That is they are losed sets suh that if x Γ i and a > 0 then ax Γ i. Suppose in addition that (12.23) Γ 1 ( Γ 2 ) = {0}. That is, if x Γ 1 and x Γ 2 then x = 0. Then it follows that for some > 0, (12.24) x Γ 1, y Γ 2 = x + y ( x + y ). To see this onsider x + y where x Γ 1, y Γ 2 and y x. We an assume that x 0, otherwise the estimate is trivially true with = 1, and then Y = y/ x Γ 1 and X = x/ x Γ 2 have Y 1 and X = 1. However X + Y 0, sine X = 1, so by the ontinuity of the sum, X + Y 2 > 0 for some > 0. Thus X + Y ( X + Y ) and the result follows by saling bak. The other ase, of x y

7 LECTURE NOTES FOR , FALL follows by the same argument with x and y interhanged, so (12.24) is a onsequene of (12.23). Lemma For any u S (R n ) and χ S(R n ), (12.25) Css(χ u) Css(u) S n 1. Proof. We already know that χ u is smooth, so Css(χ u) S n 1. Thus, we need to show that if φ S n 1 and φ / Css(u) then φ / Css(χ u). Fix suh a point φ S n 1 \ Css(u) and take a losed set Γ S n 1 whih is a neighbourhood of φ but whih is still disjoint from Css(u) and then apply Lemma The two terms χ u 2, where u 2 S(R n ) and χ u 1 where u 1 C (R n ) are both in S(R n ) so we an assume that u has the support properties of u 1. In partiular there is a smaller losed subset Γ 1 S n 1 whih is still a neighbourhood of φ but whih does not meet Γ 2, whih is the losure of the omplement of Γ. If we replae these Γ i by the losed ones of whih they are the ross-setions then we are in the situation of (12.23) and (12.23), exept for the signs. That is, there is a onstant > 0 suh that (12.26) x y ( x + y ). Now, we an assume that there is a utoff funtion υ R whih has support in Γ 2 and is suh that u = υ R u. For any oni utoff, υ R, with support in Γ 1 (12.27) υr (χ u) = υ Ru, χ(x ) = u(y), υ R (y)υr (x)χ(x y). The ontinuity of u means that this is estimated by some Shwartz seminorm (12.28) sup Dy α (υ R (y)υr(x)χ(x y)) (1 + y ) k y, α k C N χ sup(1 + x + y ) N (1 + y ) k C N χ (1 + x ) N+k y for some Shwartz seminorm on χ. Here we have used the estimate (12.24), in the form (12.26), using the properties of the supports of υr and υ R. Sine this is true for any N and similar estimates hold for the derivatives, it follows that υr (u χ) S(Rn ) and hene that φ / Css(u χ). Corollary Under the onditions of Lemma 12.6 (12.29) Css(u v) (singsupp(u) + singsupp(v)) (Css(v) S n 1 ). Proof. We an apply Lemma 12.8 to the first term in (12.21) to onlude that it has oni singular support ontained in the seond term in (12.29). Thus it is enough to show that (12.29) holds when u

8 90 RICHARD B. MELROSE C (R n ). In that ase we know that the singular support of the on- volution is ontained in the first term in (12.29), so it is enough to onsider the oni singular support in the sphere at infinity. Thus, if φ / Css(v) we need to show that φ / Css(u v). Using Lemma 12.7 we an deompose v = v 1 + v 2 + v 3 as a sum of a Shwartz term, a ompat supported term and a term whih does not have φ in its oni support. Then u v 1 is Shwartz, u v 2 has ompat support and satisfies (12.29) and φ is not in the one support of u v 3. Thus (12.29) holds in general. Lemma If u, v S (R n ) and φ Css(u) S n 1 = φ / Css(v) then their onvolution is defined unambiguously, using the pairing in Lemma 12.5, by (12.30) u v(χ) = u(ˇv χ) χ S(R n ). Proof. Sine v(x) ˇ = v( x), Css(ˇ v) = Css(v) so applying Lemma 12.8 we know that (12.31) Css(ˇv χ) Css(v) S n 1. Thus, Css(v) Css(ˇv χ) = and the pairing on the right in (12.30) is well-defined by Lemma Continuity follows from your work in Problem 78. In Problem 79 I ask you to get a bound on Css(u v) S n 1 under the onditions in Lemma Let me do what is atually a fundamental omputation. Lemma For a oni utoff, υ R, where υ C (S n 1 ), (12.32) Css( υ R ) {0}. Proof. This is atually muh easier than it seems. Namely we already know that D α (υ R ) is smooth and homogeneous of degree α near infinity. From the same argument it follows that (12.33) D α (x β υ R ) L 2 (R n ) if α > β + n/2 sine this is a smooth funtion homogeneous of degree less than n/2 near infinity, hene square-integrable. Now, taking the Fourier transform gives (12.34) γ α D β ( υ R ) L 2 (R n ) α > β + n/2. If we loalize in a one near infinity, using a (ompletely unrelated) utoff υr (γ) then we must get a Shwartz funtion sine (12.35) γ α υr (γ)dβ ( υ R (γ) R ) L 2 (R n ) α > β + n/2 = υ υ R S(R n ).

9 LECTURE NOTES FOR , FALL Indeed this argument applies anywhere that γ = 0 and so shows that (12.32) holds. Now, we have obtained some reasonable looking onditions under whih the produt uv or the onvolution u v of two elements of S (R n ) is defined. However, reasonable as they might be there is learly a flaw, or at least a defiieny, in the disussion. We know that in the simplest of ases, (12.36) u v = u v. Thus, it is very natural to expet a relationship between the onditions under whih the produt of the Fourier transforms is defined and the onditions under whih the onvolution is defined. Is there? Well, not muh it would seem, sine on the one hand we are onsidering the relationship between Css(û) and Css( v) and on the other the relationship between Css(u) S n 1 and Css(v) S n 1. If these are to be related, we would have to find a relationship of some sort between Css(u) and Css(û). As we shall see, there is one but it is not very strong as an be guessed from Lemma This is not so muh a bad thing as a sign that we should look for another notion whih ombines aspets of both Css(u) and Css(û). This we will do through the notion of wavefront set. In fat we define two related objets. The first is the more onventional, the seond is more natural in our present disussion. Definition If u S (R n ) we define the wavefront set of u to be (12.37) WF(u) = {(x, φ) R n S n 1 ; χ C (R n ), χ(x) = 0, φ / Css( χu)} and more generally the sattering wavefront set by (12.38) WF s (u) = WF(u) {(φ, p) S n 1 B n ; υ C (S n ), υ(φ) = 0, R > 0 suh that p / Css( υ R u)}. So, the definition is really always the same. To show that (p, q) / WF s (u) we need to find a utoff Φ near p depending on whether p R n or p S n 1 this is either Φ = χ C (R n ) with F = χ(p) 0 or a υ R where υ C (S n 1 ) has υ(p) = 0 suh that q / Css( Φu). One ruial property is Lemma If (p, q) / WF s (u) then if p R n there exists a neighbourhood U R n of p and a neighbourhood U B n of q suh that for all χ C (R n ) with support in U, U Css( χu) = ; similarly

10 92 RICHARD B. MELROSE if p S n 1 then there exists a neigbourhood U B n of p suh that U Css( υ R u) = if Csp(φ R ) U. Proof. First suppose p R n. From the definition of oni singular sup- (S n 1 port, (12.37) means preisely that there exists υ C ), υ(φ) = 0 and R suh that (12.39) υ R ( χu) S(R n ). Sine we know that χu C (R n ), this is atually true for all R > 0 as soon as it is true for one value. Furthermore, if χ C (R n ) has supp(χ ) {χ = 0} then φ / Css( χ u) follows from φ / Css( χu). Indeed we an then write χ = µχ where µ C (R n ) so it suffies to show that if v C (R n ) has φ / Css(v ) then φ / Css( µv) if µ C (R n ). Sine µv = (2ν) n θ u where θˇ = µ S(R n ), applying Lemma 12.8 we see that Css(θ v) Css( v), so indeed φ / Css( χ u). The ase that p S n 1 is similar. Namely we have one ut-off υ R with υ(p) = 0 and q / Css( φ R u). We an take U = {υ R+10 = 0} sine if υr (S n 1 has oni support in U then υ R = υ R υ R for some υ C ). Thus (12.40) υ φ υr u, vˇ = R u = v R. From Lemma and Corollary12.9 we dedue that (12.41) Css( υr u) Css( φ R u) and hene the result follows with U a small neighourhood of q. Proposition For any u S (R n ), (12.42) WF s (u) ω(b n B n ) = (B n S n 1 ) (S n 1 B n ) = (R n S n 1 ) (S n 1 S n 1 ) (S n 1 R n ) and WF(u) R n are losed sets and under projetion onto the first variable (12.43) ν 1 (WF(u)) = singsupp(u) R n, ν 1 (WF s (u)) = Css(u) B n. Proof. To prove the first part of (12.43) we need to show that if ( x, φ) / WF(u) for all φ S n 1 with x R n fixed, then x / singsupp(u). The n 1 definition (12.37) means that for eah φ S there exists χ α C (R n ) with χ α ( x) = 0 suh that φ / Css( χ α u). Sine Css(χu) is losed and S n 1 is ompat, a finite number of these utoffs, χ j C (R n ), an be hosen so that χ j ( x) = 0 with the S n 1 \ Css( χ j u) overing S n 1. Now applying Lemma above, we an find one

11 LECTURE NOTES FOR , FALL χ C (R n ), with support in j {χ j (x) = 0} and χ( x) = 0, suh that Css( χu) Css( χ j u) for eah j and hene χu S(R n ) (sine it is already smooth). Thus indeed it follows that x / singsupp(u). The onverse, that x / singsupp(u) implies ( x, φ) / WF(u) for all φ S n 1 is immediate. The argument to prove the seond part of (12.43) is similar. Sine, by definition, WF s (u) (R n B n ) = WF(u) and Css(u) R n = singsupp(u) we only need onsider points in Css(u) S n 1. Now, we first hek that if β / Css(u) then {β} B n WF s (u) =. By definition of Css(u) there is a ut-off υ R, where υ C (S n 1 ) and υ(β) 0, suh that υ R u S(R n ). From (12.38) this implies that (β, p) / WF s (u) for all p B n. Now, Lemma allows us to apply the same argument as used above for WF. Namely we are given that (β, p) / WF s (u) for all p B n. Thus, for eah p we may find υ R, depending on p, suh that υ(β) = 0 and p / Css( υ R u). Sine B n is ompat, we may hoose a finite subset of these oni loalizers, υ (j) R j suh that the intersetion of the orresponding sets Css( υ (j) R j u), is empty, i.e. their omplements over B n. Now, using Lemma we may hoose one υ with support in the intersetion of the sets {υ (j) = 0} with υ(β) = 0 and one R suh that Css( υ R u) =, but this just means that υ R u S(R n ) and so β / Css(u) as desired. The fat that these sets are losed (in the appropriate sets) follows diretly from Lemma Corollary For u S (R n ), (12.44) WF s (u) = u S(R n ). Let me return to the definition of WF s (u) and rewrite it, using what we have learned so far, in terms of a deomposition of u. Proposition For any u S (R n ) and (p, q) ω(b n B n ), (12.45) (p, q) / WF s (u) u = u 1 + u 2, u 1, u 2 S (R n ), p / Css(u 1 ), q / Css( û 2 ). Proof. For given (p, q) / WF s (u), take Φ = χ C (R n ) with χ 1 near p, if p R n or Φ = υ R with υ C (S n 1 ) and υ 1 near p, if p S n 1. In either ase p / Css(u 1 ) if u 1 = (1 Φ)u diretly from the definition. So u 2 = u u 1 = Φu. If the support of Φ is small enough it follows as in the disussion in the proof of Proposition that (12.46) q / Css( û 2 ).

12 94 RICHARD B. MELROSE Thus we have (12.45) in the forward diretion. For reverse impliation it follows diretly that (p, q) / WF s (u 1 ) and that (p, q) / WF s (u 2 ). This restatement of the definition makes it lear that there a high degree of symmetry under the Fourier transform Corollary For any u S (R n ), (12.47) (p, q) WF s (u)) (q, p) WF s (û). Proof. I suppose a orollary should not need a proof, but still.... The statement (12.47) is equivalent to (12.48) (p, q) / WF s (u)) = (q, p) / WF s (ˆ u) sine the reverse is the same by Fourier inversion. By (12.45) the ondition on the left is equivalent to u = u 1 + u 2 with p / Css(u 1 ), q / Css( û 2 ). Hene equivalent to (12.49) u = v 1 + v 2, v 1 = u 2, v 2 = (2ν) n ǔ 1 so q / Css(v 1 ), p / Css( v 2) whih proves (12.47). Now, we an exploit these notions to refine our onditions under whih pairing, the produt and onvolution an be defined. Theorem For u, v S (R n ) (12.50) uv S (R n ) is unambiguously defined provided and (p, φ) WF s (u) (B n S n 1 ) = (p, φ) / WF s (v) (12.51) u v S (R n ) is unambiguously defined provided (β, q) WF s (u) (S n 1 B n ) = ( β, q) / WF s (v). Proof. Let us onsider onvolution first. The hypothesis, (12.51) means that for eah β S n 1 (12.52) {q B n 1 ; (β, q) WF s (u)} {q B n 1 ; ( β, q) WF s (v)} =. Now, the fat that WF s is always a losed set means that (12.52) remains true near β in the sense that if U S n 1 is a suffiiently small neighbourhood of β then (12.53) {q B n 1 ; β U, (β, q) WF s (u)} {q B n 1 ; β U, ( β, q) WF s (v)} =.

13 LECTURE NOTES FOR , FALL The ompatness of S n 1 means that there is a finite over of S n 1 by suh sets U j. Now selet a partition of unity υ i of S n 1 whih is not only subordinate to this open over, so eah υ i is supported in one of the U j but satisfies the additional ondition that (12.54) supp(υ i ) ( supp(υ i )) = = (12.56) u i v i = u i v î supp(υ i ) ( supp(υ i )) U j for some j. Now, if we set u i = (υ i ) R u, and v i = (υ i ) R v, we know that u u i i has ompat support and similarly for v. Sine onvolution is already known to be possible if (at least) one fator has ompat support, it suffies to define u i v i for every i, i. So, first suppose that supp(υ i ) ( supp(υ i )) =. In this ase we onlude from (12.54) that (12.55) Css( û i ) Css( v î ) =. Thus we may define using (12.20). On the other hand if supp υ i ( supp(υ i )) = then (12.57) Css(u i ) ( Css(v i )) S n 1 = and in this ase we an define u i v i using Lemma Thus with suh a deomposition of u and v all terms in the onvolution are well-defined. Of ourse we should hek that this definition is independent of hoies made in the deomposition. I leave this to you. That the produt is well-defined under ondition (12.50) now follows if we define it using onvolution, i.e. as (12.58) uv = f g, f = u, ǧ = v. Indeed, using (12.47), (12.50) for u and v beomes (12.51) for f and g.

A Characterization of Wavelet Convergence in Sobolev Spaces

A Characterization of Wavelet Convergence in Sobolev Spaces A Charaterization of Wavelet Convergene in Sobolev Spaes Mark A. Kon 1 oston University Louise Arakelian Raphael Howard University Dediated to Prof. Robert Carroll on the oasion of his 70th birthday. Abstrat

More information

Hankel Optimal Model Order Reduction 1

Hankel Optimal Model Order Reduction 1 Massahusetts Institute of Tehnology Department of Eletrial Engineering and Computer Siene 6.245: MULTIVARIABLE CONTROL SYSTEMS by A. Megretski Hankel Optimal Model Order Redution 1 This leture overs both

More information

The Hanging Chain. John McCuan. January 19, 2006

The Hanging Chain. John McCuan. January 19, 2006 The Hanging Chain John MCuan January 19, 2006 1 Introdution We onsider a hain of length L attahed to two points (a, u a and (b, u b in the plane. It is assumed that the hain hangs in the plane under a

More information

Maximum Entropy and Exponential Families

Maximum Entropy and Exponential Families Maximum Entropy and Exponential Families April 9, 209 Abstrat The goal of this note is to derive the exponential form of probability distribution from more basi onsiderations, in partiular Entropy. It

More information

HOW TO FACTOR. Next you reason that if it factors, then the factorization will look something like,

HOW TO FACTOR. Next you reason that if it factors, then the factorization will look something like, HOW TO FACTOR ax bx I now want to talk a bit about how to fator ax bx where all the oeffiients a, b, and are integers. The method that most people are taught these days in high shool (assuming you go to

More information

Advanced Computational Fluid Dynamics AA215A Lecture 4

Advanced Computational Fluid Dynamics AA215A Lecture 4 Advaned Computational Fluid Dynamis AA5A Leture 4 Antony Jameson Winter Quarter,, Stanford, CA Abstrat Leture 4 overs analysis of the equations of gas dynamis Contents Analysis of the equations of gas

More information

LECTURE 22: MAPPING DEGREE, POINCARE DUALITY

LECTURE 22: MAPPING DEGREE, POINCARE DUALITY LECTURE 22: APPING DEGREE, POINCARE DUALITY 1. The mapping degree and its appliations Let, N be n-dimensional onneted oriented manifolds, and f : N a proper map. (If is ompat, then any smooth map f : N

More information

Packing Plane Spanning Trees into a Point Set

Packing Plane Spanning Trees into a Point Set Paking Plane Spanning Trees into a Point Set Ahmad Biniaz Alfredo Garía Abstrat Let P be a set of n points in the plane in general position. We show that at least n/3 plane spanning trees an be paked into

More information

MAC Calculus II Summer All you need to know on partial fractions and more

MAC Calculus II Summer All you need to know on partial fractions and more MC -75-Calulus II Summer 00 ll you need to know on partial frations and more What are partial frations? following forms:.... where, α are onstants. Partial frations are frations of one of the + α, ( +

More information

Modal Horn Logics Have Interpolation

Modal Horn Logics Have Interpolation Modal Horn Logis Have Interpolation Marus Kraht Department of Linguistis, UCLA PO Box 951543 405 Hilgard Avenue Los Angeles, CA 90095-1543 USA kraht@humnet.ula.de Abstrat We shall show that the polymodal

More information

The Laws of Acceleration

The Laws of Acceleration The Laws of Aeleration The Relationships between Time, Veloity, and Rate of Aeleration Copyright 2001 Joseph A. Rybzyk Abstrat Presented is a theory in fundamental theoretial physis that establishes the

More information

Millennium Relativity Acceleration Composition. The Relativistic Relationship between Acceleration and Uniform Motion

Millennium Relativity Acceleration Composition. The Relativistic Relationship between Acceleration and Uniform Motion Millennium Relativity Aeleration Composition he Relativisti Relationship between Aeleration and niform Motion Copyright 003 Joseph A. Rybzyk Abstrat he relativisti priniples developed throughout the six

More information

Word of Mass: The Relationship between Mass Media and Word-of-Mouth

Word of Mass: The Relationship between Mass Media and Word-of-Mouth Word of Mass: The Relationship between Mass Media and Word-of-Mouth Roman Chuhay Preliminary version Marh 6, 015 Abstrat This paper studies the optimal priing and advertising strategies of a firm in the

More information

Lecture 7: Sampling/Projections for Least-squares Approximation, Cont. 7 Sampling/Projections for Least-squares Approximation, Cont.

Lecture 7: Sampling/Projections for Least-squares Approximation, Cont. 7 Sampling/Projections for Least-squares Approximation, Cont. Stat60/CS94: Randomized Algorithms for Matries and Data Leture 7-09/5/013 Leture 7: Sampling/Projetions for Least-squares Approximation, Cont. Leturer: Mihael Mahoney Sribe: Mihael Mahoney Warning: these

More information

Product Policy in Markets with Word-of-Mouth Communication. Technical Appendix

Product Policy in Markets with Word-of-Mouth Communication. Technical Appendix rodut oliy in Markets with Word-of-Mouth Communiation Tehnial Appendix August 05 Miro-Model for Inreasing Awareness In the paper, we make the assumption that awareness is inreasing in ustomer type. I.e.,

More information

Some facts you should know that would be convenient when evaluating a limit:

Some facts you should know that would be convenient when evaluating a limit: Some fats you should know that would be onvenient when evaluating a it: When evaluating a it of fration of two funtions, f(x) x a g(x) If f and g are both ontinuous inside an open interval that ontains

More information

Chapter 8 Hypothesis Testing

Chapter 8 Hypothesis Testing Leture 5 for BST 63: Statistial Theory II Kui Zhang, Spring Chapter 8 Hypothesis Testing Setion 8 Introdution Definition 8 A hypothesis is a statement about a population parameter Definition 8 The two

More information

The perverse t-structure

The perverse t-structure The perverse t-struture Milan Lopuhaä Marh 15, 2017 1 The perverse t-struture The goal of today is to define the perverse t-struture and perverse sheaves, and to show some properties of both. In his talk

More information

Remark 4.1 Unlike Lyapunov theorems, LaSalle s theorem does not require the function V ( x ) to be positive definite.

Remark 4.1 Unlike Lyapunov theorems, LaSalle s theorem does not require the function V ( x ) to be positive definite. Leture Remark 4.1 Unlike Lyapunov theorems, LaSalle s theorem does not require the funtion V ( x ) to be positive definite. ost often, our interest will be to show that x( t) as t. For that we will need

More information

Ordered fields and the ultrafilter theorem

Ordered fields and the ultrafilter theorem F U N D A M E N T A MATHEMATICAE 59 (999) Ordered fields and the ultrafilter theorem by R. B e r r (Dortmund), F. D e l o n (Paris) and J. S h m i d (Dortmund) Abstrat. We prove that on the basis of ZF

More information

Moments and Wavelets in Signal Estimation

Moments and Wavelets in Signal Estimation Moments and Wavelets in Signal Estimation Edward J. Wegman 1 Center for Computational Statistis George Mason University Hung T. Le 2 International usiness Mahines Abstrat: The problem of generalized nonparametri

More information

max min z i i=1 x j k s.t. j=1 x j j:i T j

max min z i i=1 x j k s.t. j=1 x j j:i T j AM 221: Advaned Optimization Spring 2016 Prof. Yaron Singer Leture 22 April 18th 1 Overview In this leture, we will study the pipage rounding tehnique whih is a deterministi rounding proedure that an be

More information

Complexity of Regularization RBF Networks

Complexity of Regularization RBF Networks Complexity of Regularization RBF Networks Mark A Kon Department of Mathematis and Statistis Boston University Boston, MA 02215 mkon@buedu Leszek Plaskota Institute of Applied Mathematis University of Warsaw

More information

SQUARE ROOTS AND AND DIRECTIONS

SQUARE ROOTS AND AND DIRECTIONS SQUARE ROOS AND AND DIRECIONS We onstrut a lattie-like point set in the Eulidean plane that eluidates the relationship between the loal statistis of the frational parts of n and diretions in a shifted

More information

Estimating the probability law of the codelength as a function of the approximation error in image compression

Estimating the probability law of the codelength as a function of the approximation error in image compression Estimating the probability law of the odelength as a funtion of the approximation error in image ompression François Malgouyres Marh 7, 2007 Abstrat After some reolletions on ompression of images using

More information

Most results in this section are stated without proof.

Most results in this section are stated without proof. Leture 8 Level 4 v2 he Expliit formula. Most results in this setion are stated without proof. Reall that we have shown that ζ (s has only one pole, a simple one at s =. It has trivial zeros at the negative

More information

Computer Science 786S - Statistical Methods in Natural Language Processing and Data Analysis Page 1

Computer Science 786S - Statistical Methods in Natural Language Processing and Data Analysis Page 1 Computer Siene 786S - Statistial Methods in Natural Language Proessing and Data Analysis Page 1 Hypothesis Testing A statistial hypothesis is a statement about the nature of the distribution of a random

More information

A Functional Representation of Fuzzy Preferences

A Functional Representation of Fuzzy Preferences Theoretial Eonomis Letters, 017, 7, 13- http://wwwsirporg/journal/tel ISSN Online: 16-086 ISSN Print: 16-078 A Funtional Representation of Fuzzy Preferenes Susheng Wang Department of Eonomis, Hong Kong

More information

General Equilibrium. What happens to cause a reaction to come to equilibrium?

General Equilibrium. What happens to cause a reaction to come to equilibrium? General Equilibrium Chemial Equilibrium Most hemial reations that are enountered are reversible. In other words, they go fairly easily in either the forward or reverse diretions. The thing to remember

More information

Some GIS Topological Concepts via Neutrosophic Crisp Set Theory

Some GIS Topological Concepts via Neutrosophic Crisp Set Theory New Trends in Neutrosophi Theory and Appliations A.A.SALAMA, I.M.HANAFY, HEWAYDA ELGHAWALBY 3, M.S.DABASH 4,2,4 Department of Mathematis and Computer Siene, Faulty of Sienes, Port Said University, Egypt.

More information

Quantum Mechanics: Wheeler: Physics 6210

Quantum Mechanics: Wheeler: Physics 6210 Quantum Mehanis: Wheeler: Physis 60 Problems some modified from Sakurai, hapter. W. S..: The Pauli matries, σ i, are a triple of matries, σ, σ i = σ, σ, σ 3 given by σ = σ = σ 3 = i i Let stand for the

More information

EDGE-DISJOINT CLIQUES IN GRAPHS WITH HIGH MINIMUM DEGREE

EDGE-DISJOINT CLIQUES IN GRAPHS WITH HIGH MINIMUM DEGREE EDGE-DISJOINT CLIQUES IN GRAPHS WITH HIGH MINIMUM DEGREE RAPHAEL YUSTER Abstrat For a graph G and a fixed integer k 3, let ν k G) denote the maximum number of pairwise edge-disjoint opies of K k in G For

More information

22.54 Neutron Interactions and Applications (Spring 2004) Chapter 6 (2/24/04) Energy Transfer Kernel F(E E')

22.54 Neutron Interactions and Applications (Spring 2004) Chapter 6 (2/24/04) Energy Transfer Kernel F(E E') 22.54 Neutron Interations and Appliations (Spring 2004) Chapter 6 (2/24/04) Energy Transfer Kernel F(E E') Referenes -- J. R. Lamarsh, Introdution to Nulear Reator Theory (Addison-Wesley, Reading, 1966),

More information

Indian Institute of Technology Bombay. Department of Electrical Engineering. EE 325 Probability and Random Processes Lecture Notes 3 July 28, 2014

Indian Institute of Technology Bombay. Department of Electrical Engineering. EE 325 Probability and Random Processes Lecture Notes 3 July 28, 2014 Indian Institute of Tehnology Bombay Department of Eletrial Engineering Handout 5 EE 325 Probability and Random Proesses Leture Notes 3 July 28, 2014 1 Axiomati Probability We have learned some paradoxes

More information

the following action R of T on T n+1 : for each θ T, R θ : T n+1 T n+1 is defined by stated, we assume that all the curves in this paper are defined

the following action R of T on T n+1 : for each θ T, R θ : T n+1 T n+1 is defined by stated, we assume that all the curves in this paper are defined How should a snake turn on ie: A ase study of the asymptoti isoholonomi problem Jianghai Hu, Slobodan N. Simić, and Shankar Sastry Department of Eletrial Engineering and Computer Sienes University of California

More information

Strauss PDEs 2e: Section Exercise 3 Page 1 of 13. u tt c 2 u xx = cos x. ( 2 t c 2 2 x)u = cos x. v = ( t c x )u

Strauss PDEs 2e: Section Exercise 3 Page 1 of 13. u tt c 2 u xx = cos x. ( 2 t c 2 2 x)u = cos x. v = ( t c x )u Strauss PDEs e: Setion 3.4 - Exerise 3 Page 1 of 13 Exerise 3 Solve u tt = u xx + os x, u(x, ) = sin x, u t (x, ) = 1 + x. Solution Solution by Operator Fatorization Bring u xx to the other side. Write

More information

Counting Idempotent Relations

Counting Idempotent Relations Counting Idempotent Relations Beriht-Nr. 2008-15 Florian Kammüller ISSN 1436-9915 2 Abstrat This artile introdues and motivates idempotent relations. It summarizes haraterizations of idempotents and their

More information

Measuring & Inducing Neural Activity Using Extracellular Fields I: Inverse systems approach

Measuring & Inducing Neural Activity Using Extracellular Fields I: Inverse systems approach Measuring & Induing Neural Ativity Using Extraellular Fields I: Inverse systems approah Keith Dillon Department of Eletrial and Computer Engineering University of California San Diego 9500 Gilman Dr. La

More information

V. Interacting Particles

V. Interacting Particles V. Interating Partiles V.A The Cumulant Expansion The examples studied in the previous setion involve non-interating partiles. It is preisely the lak of interations that renders these problems exatly solvable.

More information

23.1 Tuning controllers, in the large view Quoting from Section 16.7:

23.1 Tuning controllers, in the large view Quoting from Section 16.7: Lesson 23. Tuning a real ontroller - modeling, proess identifiation, fine tuning 23.0 Context We have learned to view proesses as dynami systems, taking are to identify their input, intermediate, and output

More information

Probabilistic Graphical Models

Probabilistic Graphical Models Probabilisti Graphial Models David Sontag New York University Leture 12, April 19, 2012 Aknowledgement: Partially based on slides by Eri Xing at CMU and Andrew MCallum at UMass Amherst David Sontag (NYU)

More information

Wave equation II: Qualitative Properties of solutions

Wave equation II: Qualitative Properties of solutions Chapter 5 Wave equation II: Qualitative Properties of solutions In this hapter, we disuss some of the important qualitative properties of solutions to wave equation. Solutions of wave equation in one spae

More information

A NETWORK SIMPLEX ALGORITHM FOR THE MINIMUM COST-BENEFIT NETWORK FLOW PROBLEM

A NETWORK SIMPLEX ALGORITHM FOR THE MINIMUM COST-BENEFIT NETWORK FLOW PROBLEM NETWORK SIMPLEX LGORITHM FOR THE MINIMUM COST-BENEFIT NETWORK FLOW PROBLEM Cen Çalışan, Utah Valley University, 800 W. University Parway, Orem, UT 84058, 801-863-6487, en.alisan@uvu.edu BSTRCT The minimum

More information

Chapter 26 Lecture Notes

Chapter 26 Lecture Notes Chapter 26 Leture Notes Physis 2424 - Strauss Formulas: t = t0 1 v L = L0 1 v m = m0 1 v E = m 0 2 + KE = m 2 KE = m 2 -m 0 2 mv 0 p= mv = 1 v E 2 = p 2 2 + m 2 0 4 v + u u = 2 1 + vu There were two revolutions

More information

ON THE LEAST PRIMITIVE ROOT EXPRESSIBLE AS A SUM OF TWO SQUARES

ON THE LEAST PRIMITIVE ROOT EXPRESSIBLE AS A SUM OF TWO SQUARES #A55 INTEGERS 3 (203) ON THE LEAST PRIMITIVE ROOT EPRESSIBLE AS A SUM OF TWO SQUARES Christopher Ambrose Mathematishes Institut, Georg-August Universität Göttingen, Göttingen, Deutshland ambrose@uni-math.gwdg.de

More information

A Queueing Model for Call Blending in Call Centers

A Queueing Model for Call Blending in Call Centers A Queueing Model for Call Blending in Call Centers Sandjai Bhulai and Ger Koole Vrije Universiteit Amsterdam Faulty of Sienes De Boelelaan 1081a 1081 HV Amsterdam The Netherlands E-mail: {sbhulai, koole}@s.vu.nl

More information

Lecture 3 - Lorentz Transformations

Lecture 3 - Lorentz Transformations Leture - Lorentz Transformations A Puzzle... Example A ruler is positioned perpendiular to a wall. A stik of length L flies by at speed v. It travels in front of the ruler, so that it obsures part of the

More information

Appendix A Market-Power Model of Business Groups. Robert C. Feenstra Deng-Shing Huang Gary G. Hamilton Revised, November 2001

Appendix A Market-Power Model of Business Groups. Robert C. Feenstra Deng-Shing Huang Gary G. Hamilton Revised, November 2001 Appendix A Market-Power Model of Business Groups Roert C. Feenstra Deng-Shing Huang Gary G. Hamilton Revised, Novemer 200 Journal of Eonomi Behavior and Organization, 5, 2003, 459-485. To solve for the

More information

Modes are solutions, of Maxwell s equation applied to a specific device.

Modes are solutions, of Maxwell s equation applied to a specific device. Mirowave Integrated Ciruits Prof. Jayanta Mukherjee Department of Eletrial Engineering Indian Institute of Tehnology, Bombay Mod 01, Le 06 Mirowave omponents Welome to another module of this NPTEL mok

More information

On the Licensing of Innovations under Strategic Delegation

On the Licensing of Innovations under Strategic Delegation On the Liensing of Innovations under Strategi Delegation Judy Hsu Institute of Finanial Management Nanhua University Taiwan and X. Henry Wang Department of Eonomis University of Missouri USA Abstrat This

More information

THE BORELL-EHRHARD GAME

THE BORELL-EHRHARD GAME THE BORELL-EHRHARD GAME RAMON VAN HANDEL Abstrat. A preise desription of the onvexity of Gaussian measures is provided by sharp Brunn-Minkowski type inequalities due to Ehrhard and Borell. We show that

More information

HILLE-KNESER TYPE CRITERIA FOR SECOND-ORDER DYNAMIC EQUATIONS ON TIME SCALES

HILLE-KNESER TYPE CRITERIA FOR SECOND-ORDER DYNAMIC EQUATIONS ON TIME SCALES HILLE-KNESER TYPE CRITERIA FOR SECOND-ORDER DYNAMIC EQUATIONS ON TIME SCALES L ERBE, A PETERSON AND S H SAKER Abstrat In this paper, we onsider the pair of seond-order dynami equations rt)x ) ) + pt)x

More information

Methods of evaluating tests

Methods of evaluating tests Methods of evaluating tests Let X,, 1 Xn be i.i.d. Bernoulli( p ). Then 5 j= 1 j ( 5, ) T = X Binomial p. We test 1 H : p vs. 1 1 H : p>. We saw that a LRT is 1 if t k* φ ( x ) =. otherwise (t is the observed

More information

Average Rate Speed Scaling

Average Rate Speed Scaling Average Rate Speed Saling Nikhil Bansal David P. Bunde Ho-Leung Chan Kirk Pruhs May 2, 2008 Abstrat Speed saling is a power management tehnique that involves dynamially hanging the speed of a proessor.

More information

Where as discussed previously we interpret solutions to this partial differential equation in the weak sense: b

Where as discussed previously we interpret solutions to this partial differential equation in the weak sense: b Consider the pure initial value problem for a homogeneous system of onservation laws with no soure terms in one spae dimension: Where as disussed previously we interpret solutions to this partial differential

More information

On Component Order Edge Reliability and the Existence of Uniformly Most Reliable Unicycles

On Component Order Edge Reliability and the Existence of Uniformly Most Reliable Unicycles Daniel Gross, Lakshmi Iswara, L. William Kazmierzak, Kristi Luttrell, John T. Saoman, Charles Suffel On Component Order Edge Reliability and the Existene of Uniformly Most Reliable Uniyles DANIEL GROSS

More information

Relativity fundamentals explained well (I hope) Walter F. Smith, Haverford College

Relativity fundamentals explained well (I hope) Walter F. Smith, Haverford College Relativity fundamentals explained well (I hope) Walter F. Smith, Haverford College 3-14-06 1 Propagation of waves through a medium As you ll reall from last semester, when the speed of sound is measured

More information

Control Theory association of mathematics and engineering

Control Theory association of mathematics and engineering Control Theory assoiation of mathematis and engineering Wojieh Mitkowski Krzysztof Oprzedkiewiz Department of Automatis AGH Univ. of Siene & Tehnology, Craow, Poland, Abstrat In this paper a methodology

More information

A Variational Definition for Limit and Derivative

A Variational Definition for Limit and Derivative Amerian Journal of Applied Mathematis 2016; 4(3): 137-141 http://www.sienepublishinggroup.om/j/ajam doi: 10.11648/j.ajam.20160403.14 ISSN: 2330-0043 (Print); ISSN: 2330-006X (Online) A Variational Definition

More information

Physics 523, General Relativity Homework 4 Due Wednesday, 25 th October 2006

Physics 523, General Relativity Homework 4 Due Wednesday, 25 th October 2006 Physis 523, General Relativity Homework 4 Due Wednesday, 25 th Otober 2006 Jaob Lewis Bourjaily Problem Reall that the worldline of a ontinuously aelerated observer in flat spae relative to some inertial

More information

A note on the Brownian loop measure

A note on the Brownian loop measure A note on the Brownian loop measure Gregory F. Lawler Department of Mathematis University of Chiago Marh 23, 2009 Abstrat The Brownian loop measure is a onformally invariant measure on loops that also

More information

Velocity Addition in Space/Time David Barwacz 4/23/

Velocity Addition in Space/Time David Barwacz 4/23/ Veloity Addition in Spae/Time 003 David arwaz 4/3/003 daveb@triton.net http://members.triton.net/daveb Abstrat Using the spae/time geometry developed in the previous paper ( Non-orthogonal Spae- Time geometry,

More information

Sensitivity Analysis in Markov Networks

Sensitivity Analysis in Markov Networks Sensitivity Analysis in Markov Networks Hei Chan and Adnan Darwihe Computer Siene Department University of California, Los Angeles Los Angeles, CA 90095 {hei,darwihe}@s.ula.edu Abstrat This paper explores

More information

MOLECULAR ORBITAL THEORY- PART I

MOLECULAR ORBITAL THEORY- PART I 5.6 Physial Chemistry Leture #24-25 MOLECULAR ORBITAL THEORY- PART I At this point, we have nearly ompleted our rash-ourse introdution to quantum mehanis and we re finally ready to deal with moleules.

More information

Sensitivity analysis for linear optimization problem with fuzzy data in the objective function

Sensitivity analysis for linear optimization problem with fuzzy data in the objective function Sensitivity analysis for linear optimization problem with fuzzy data in the objetive funtion Stephan Dempe, Tatiana Starostina May 5, 2004 Abstrat Linear programming problems with fuzzy oeffiients in the

More information

1 sin 2 r = 1 n 2 sin 2 i

1 sin 2 r = 1 n 2 sin 2 i Physis 505 Fall 005 Homework Assignment #11 Solutions Textbook problems: Ch. 7: 7.3, 7.5, 7.8, 7.16 7.3 Two plane semi-infinite slabs of the same uniform, isotropi, nonpermeable, lossless dieletri with

More information

Math 225B: Differential Geometry, Homework 6

Math 225B: Differential Geometry, Homework 6 ath 225B: Differential Geometry, Homework 6 Ian Coley February 13, 214 Problem 8.7. Let ω be a 1-form on a manifol. Suppose that ω = for every lose urve in. Show that ω is exat. We laim that this onition

More information

arxiv: v1 [math.gt] 22 Nov 2018

arxiv: v1 [math.gt] 22 Nov 2018 SOME REMARKS ON THE CHORD INDEX ZHIYUN CHENG, HONGZHU GAO, AND MENGJIAN XU arxiv:1811.09061v1 [math.gt] 22 Nov 2018 ABSTRACT. In this paper we disuss how to define a hord index via smoothing a real rossing

More information

The Effectiveness of the Linear Hull Effect

The Effectiveness of the Linear Hull Effect The Effetiveness of the Linear Hull Effet S. Murphy Tehnial Report RHUL MA 009 9 6 Otober 009 Department of Mathematis Royal Holloway, University of London Egham, Surrey TW0 0EX, England http://www.rhul.a.uk/mathematis/tehreports

More information

Tight bounds for selfish and greedy load balancing

Tight bounds for selfish and greedy load balancing Tight bounds for selfish and greedy load balaning Ioannis Caragiannis Mihele Flammini Christos Kaklamanis Panagiotis Kanellopoulos Lua Mosardelli Deember, 009 Abstrat We study the load balaning problem

More information

Panos Kouvelis Olin School of Business Washington University

Panos Kouvelis Olin School of Business Washington University Quality-Based Cometition, Profitability, and Variable Costs Chester Chambers Co Shool of Business Dallas, TX 7575 hamber@mailosmuedu -768-35 Panos Kouvelis Olin Shool of Business Washington University

More information

FINITE WORD LENGTH EFFECTS IN DSP

FINITE WORD LENGTH EFFECTS IN DSP FINITE WORD LENGTH EFFECTS IN DSP PREPARED BY GUIDED BY Snehal Gor Dr. Srianth T. ABSTRACT We now that omputers store numbers not with infinite preision but rather in some approximation that an be paed

More information

Bäcklund Transformations: Some Old and New Perspectives

Bäcklund Transformations: Some Old and New Perspectives Bäklund Transformations: Some Old and New Perspetives C. J. Papahristou *, A. N. Magoulas ** * Department of Physial Sienes, Helleni Naval Aademy, Piraeus 18539, Greee E-mail: papahristou@snd.edu.gr **

More information

REFINED UPPER BOUNDS FOR THE LINEAR DIOPHANTINE PROBLEM OF FROBENIUS. 1. Introduction

REFINED UPPER BOUNDS FOR THE LINEAR DIOPHANTINE PROBLEM OF FROBENIUS. 1. Introduction Version of 5/2/2003 To appear in Advanes in Applied Mathematis REFINED UPPER BOUNDS FOR THE LINEAR DIOPHANTINE PROBLEM OF FROBENIUS MATTHIAS BECK AND SHELEMYAHU ZACKS Abstrat We study the Frobenius problem:

More information

After the completion of this section the student should recall

After the completion of this section the student should recall Chapter I MTH FUNDMENTLS I. Sets, Numbers, Coordinates, Funtions ugust 30, 08 3 I. SETS, NUMERS, COORDINTES, FUNCTIONS Objetives: fter the ompletion of this setion the student should reall - the definition

More information

9 Geophysics and Radio-Astronomy: VLBI VeryLongBaseInterferometry

9 Geophysics and Radio-Astronomy: VLBI VeryLongBaseInterferometry 9 Geophysis and Radio-Astronomy: VLBI VeryLongBaseInterferometry VLBI is an interferometry tehnique used in radio astronomy, in whih two or more signals, oming from the same astronomial objet, are reeived

More information

Green s function for the wave equation

Green s function for the wave equation Green s funtion for the wave equation Non-relativisti ase January 2019 1 The wave equations In the Lorentz Gauge, the wave equations for the potentials are (Notes 1 eqns 43 and 44): 1 2 A 2 2 2 A = µ 0

More information

CMSC 451: Lecture 9 Greedy Approximation: Set Cover Thursday, Sep 28, 2017

CMSC 451: Lecture 9 Greedy Approximation: Set Cover Thursday, Sep 28, 2017 CMSC 451: Leture 9 Greedy Approximation: Set Cover Thursday, Sep 28, 2017 Reading: Chapt 11 of KT and Set 54 of DPV Set Cover: An important lass of optimization problems involves overing a ertain domain,

More information

Geometry of Transformations of Random Variables

Geometry of Transformations of Random Variables Geometry of Transformations of Random Variables Univariate distributions We are interested in the problem of finding the distribution of Y = h(x) when the transformation h is one-to-one so that there is

More information

SOA/CAS MAY 2003 COURSE 1 EXAM SOLUTIONS

SOA/CAS MAY 2003 COURSE 1 EXAM SOLUTIONS SOA/CAS MAY 2003 COURSE 1 EXAM SOLUTIONS Prepared by S. Broverman e-mail 2brove@rogers.om website http://members.rogers.om/2brove 1. We identify the following events:. - wathed gymnastis, ) - wathed baseball,

More information

Chapter 2: Solution of First order ODE

Chapter 2: Solution of First order ODE 0 Chapter : Solution of irst order ODE Se. Separable Equations The differential equation of the form that is is alled separable if f = h g; In order to solve it perform the following steps: Rewrite the

More information

arxiv:gr-qc/ v2 6 Feb 2004

arxiv:gr-qc/ v2 6 Feb 2004 Hubble Red Shift and the Anomalous Aeleration of Pioneer 0 and arxiv:gr-q/0402024v2 6 Feb 2004 Kostadin Trenčevski Faulty of Natural Sienes and Mathematis, P.O.Box 62, 000 Skopje, Maedonia Abstrat It this

More information

ricci flows with bursts of unbounded curvature

ricci flows with bursts of unbounded curvature rii flows with bursts of unbounded urvature Gregor Giesen and Peter M. Topping st Otober 04 Abstrat Given a ompletely arbitrary surfae, whether or not it has bounded urvature, or even whether or not it

More information

arxiv:math/ v1 [math.ca] 27 Nov 2003

arxiv:math/ v1 [math.ca] 27 Nov 2003 arxiv:math/011510v1 [math.ca] 27 Nov 200 Counting Integral Lamé Equations by Means of Dessins d Enfants Sander Dahmen November 27, 200 Abstrat We obtain an expliit formula for the number of Lamé equations

More information

Relativistic Dynamics

Relativistic Dynamics Chapter 7 Relativisti Dynamis 7.1 General Priniples of Dynamis 7.2 Relativisti Ation As stated in Setion A.2, all of dynamis is derived from the priniple of least ation. Thus it is our hore to find a suitable

More information

Relative Maxima and Minima sections 4.3

Relative Maxima and Minima sections 4.3 Relative Maxima and Minima setions 4.3 Definition. By a ritial point of a funtion f we mean a point x 0 in the domain at whih either the derivative is zero or it does not exists. So, geometrially, one

More information

Determining both sound speed and internal source in thermo- and photo-acoustic tomography

Determining both sound speed and internal source in thermo- and photo-acoustic tomography Inverse Problems Inverse Problems (05) 05005 (0pp) doi:0.088/06656//0/05005 Determining both sound speed and internal soure in thermo and photoaousti tomography Hongyu Liu,,5 and Gunther Uhlmann,4 Department

More information

Lecture 15 (Nov. 1, 2017)

Lecture 15 (Nov. 1, 2017) Leture 5 8.3 Quantum Theor I, Fall 07 74 Leture 5 (Nov., 07 5. Charged Partile in a Uniform Magneti Field Last time, we disussed the quantum mehanis of a harged partile moving in a uniform magneti field

More information

RIEMANN S FIRST PROOF OF THE ANALYTIC CONTINUATION OF ζ(s) AND L(s, χ)

RIEMANN S FIRST PROOF OF THE ANALYTIC CONTINUATION OF ζ(s) AND L(s, χ) RIEMANN S FIRST PROOF OF THE ANALYTIC CONTINUATION OF ζ(s AND L(s, χ FELIX RUBIN SEMINAR ON MODULAR FORMS, WINTER TERM 6 Abstrat. In this hapter, we will see a proof of the analyti ontinuation of the Riemann

More information

Generalized Dimensional Analysis

Generalized Dimensional Analysis #HUTP-92/A036 7/92 Generalized Dimensional Analysis arxiv:hep-ph/9207278v1 31 Jul 1992 Howard Georgi Lyman Laboratory of Physis Harvard University Cambridge, MA 02138 Abstrat I desribe a version of so-alled

More information

John Vanderkooy Audio Research Group, Department of Physics, University of Waterloo, Waterloo, Ontario N2L 3G1, Canada

John Vanderkooy Audio Research Group, Department of Physics, University of Waterloo, Waterloo, Ontario N2L 3G1, Canada An analyti seondary soure model of edge diffration impulse responses U. Peter Svensson a) and Roger I. Fred b) Department of Applied Aoustis, Chalmers University of Tehnology, SE-42 96 Göteborg, Sweden

More information

Robust Recovery of Signals From a Structured Union of Subspaces

Robust Recovery of Signals From a Structured Union of Subspaces Robust Reovery of Signals From a Strutured Union of Subspaes 1 Yonina C. Eldar, Senior Member, IEEE and Moshe Mishali, Student Member, IEEE arxiv:87.4581v2 [nlin.cg] 3 Mar 29 Abstrat Traditional sampling

More information

Some Properties on Nano Topology Induced by Graphs

Some Properties on Nano Topology Induced by Graphs AASCIT Journal of anosiene 2017; 3(4): 19-23 http://wwwaasitorg/journal/nanosiene ISS: 2381-1234 (Print); ISS: 2381-1242 (Online) Some Properties on ano Topology Indued by Graphs Arafa asef 1 Abd El Fattah

More information

Modeling of discrete/continuous optimization problems: characterization and formulation of disjunctions and their relaxations

Modeling of discrete/continuous optimization problems: characterization and formulation of disjunctions and their relaxations Computers and Chemial Engineering (00) 4/448 www.elsevier.om/loate/omphemeng Modeling of disrete/ontinuous optimization problems: haraterization and formulation of disjuntions and their relaxations Aldo

More information

7 Max-Flow Problems. Business Computing and Operations Research 608

7 Max-Flow Problems. Business Computing and Operations Research 608 7 Max-Flow Problems Business Computing and Operations Researh 68 7. Max-Flow Problems In what follows, we onsider a somewhat modified problem onstellation Instead of osts of transmission, vetor now indiates

More information

We will show that: that sends the element in π 1 (P {z 1, z 2, z 3, z 4 }) represented by l j to g j G.

We will show that: that sends the element in π 1 (P {z 1, z 2, z 3, z 4 }) represented by l j to g j G. 1. Introdution Square-tiled translation surfaes are lattie surfaes beause they are branhed overs of the flat torus with a single branhed point. Many non-square-tiled examples of lattie surfaes arise from

More information

Frequency hopping does not increase anti-jamming resilience of wireless channels

Frequency hopping does not increase anti-jamming resilience of wireless channels Frequeny hopping does not inrease anti-jamming resiliene of wireless hannels Moritz Wiese and Panos Papadimitratos Networed Systems Seurity Group KTH Royal Institute of Tehnology, Stoholm, Sweden {moritzw,

More information

Journal of Inequalities in Pure and Applied Mathematics

Journal of Inequalities in Pure and Applied Mathematics Journal of Inequalities in Pure and Applied Mathematis A NEW ARRANGEMENT INEQUALITY MOHAMMAD JAVAHERI University of Oregon Department of Mathematis Fenton Hall, Eugene, OR 97403. EMail: javaheri@uoregon.edu

More information

arxiv:math/ v4 [math.ca] 29 Jul 2006

arxiv:math/ v4 [math.ca] 29 Jul 2006 arxiv:math/0109v4 [math.ca] 9 Jul 006 Contiguous relations of hypergeometri series Raimundas Vidūnas University of Amsterdam Abstrat The 15 Gauss ontiguous relations for F 1 hypergeometri series imply

More information

(q) -convergence. Comenius University, Bratislava, Slovakia

(q) -convergence.   Comenius University, Bratislava, Slovakia Annales Mathematiae et Informatiae 38 (2011) pp. 27 36 http://ami.ektf.hu On I (q) -onvergene J. Gogola a, M. Mačaj b, T. Visnyai b a University of Eonomis, Bratislava, Slovakia e-mail: gogola@euba.sk

More information