ON A CONJECTURE OF MILNOR ABOUT VOLUME OF SIMPLEXES. Ren Guo & Feng Luo. Abstract

Size: px
Start display at page:

Download "ON A CONJECTURE OF MILNOR ABOUT VOLUME OF SIMPLEXES. Ren Guo & Feng Luo. Abstract"

Transcription

1 ON A CONJECTURE OF MILNOR ABOUT VOLUME OF SIMPLEXES Ren Guo & Feng Luo Dedcated to the memory of Xao-Song Ln. Abstract We establsh the second part of Mlnor s conjecture on the volume of smplexes n hyperbolc and sphercal spaces. A characterzaton of the closure of the space of the angle Gram matrces of smplexes s also obtaned. 1. Introducton Mlnor s conjecture. In [5], John Mlnor conjectured that the volume of a hyperbolc or sphercal n smplex, consdered as a functon of the dhedral angles, can be extended contnuously to the degenerated smplexes. Furthermore, he conjectured that the extended volume functon s non-zero except n the closure of the space of Eucldean smplexes. The frst part of the conjecture on the contnuous extenson was establshed n [4] ([7] has a new proof of t whch generalzes to many polytopes). The purpose of the paper s to establsh the second part of Mlnor s conjecture. To state the result, let us begn wth some notatons and defntons. Gven an n smplex n a sphercal, hyperbolc or Eucldean space wth vertces u 1,..., u n+1, the -th codmenson-1 face s defned to be the (n 1)-smplex wth vertces u 1,..., u 1, u +1,..., u n+1. The dhedral angle between the -th and j-th codmenson-1 faces s denoted by θ j. As a conventon, we defne θ = π and call the symmetrc matrx A = [ cos(θ j )] (n+1) (n+1) the angle Gram matrx of the smplex. It s well known that the angle Gram matrx determnes a hyperbolc or sphercal n-smplex up to sometry and Eucldean n-smplex up to smlarty. Let X n+1, Y n+1, Z n+1 n R (n+1) (n+1) be the subsets of (n + 1) (n + 1) symmetrc matrces correspondng to the angle Gram matrces of sphercal, hyperbolc, or Eucldean n smplexes respectvely. The volume of an n-smplex can be expressed n terms of the angle Gram matrx by the work of Aomoto [1], Kneser [2] and Vnberg [8]. Namely, for a sphercal or hyperbolc n-smplex σ n wth angle Gram matrx A, the volume V s 1

2 2 REN GUO & FENG LUO (1.1) V (A) = µ 1 n det(ad(a)) e xtad(a)x dx. R n+1 0 where R n+1 0 = {(x 1,..., x n+1 ) x 0}, the constant µ k = 0 x k e x2 dx and ad(a) s the adjont matrx of A. In [4], t s proved that the volume functon V : X n+1 Y n+1 R can be extended contnuously to the closure X n+1 Y n+1 n R (n+1) (n+1). The man result of ths paper, whch verfes the second part of Mlnor s conjecture, s the followng theorem. Theorem 1. The extended volume functon V on the closure X n+1 Y n+1 n R (n+1) (n+1) vanshes at a pont A f and only f A s n the closure Z n+1. A characterzaton of angle Gram matrces. We wll use the followng conventons. Gven a real matrx A = [a j ], we use A 0 to denote a j 0 for all, j and A > 0 to denote a j > 0 for all, j. A t s the transpose of A. We use ad(a) to denote the adjont matrx of A. The dagonal k k matrx wth dagonal entres (x 1,...x k ) s denoted by dag(x 1,...x k ). A characterzaton of the angle Gram matrces n X n+1, Y n+1 or Z n+1 s known by the work of [3] and [5]. Proposton 2 ([3],[5]). Gven an (n+1) (n+1) symmetrc matrx A = [a j ] wth a = 1 for all, then (a) A Z n+1 f and only f det(a) = 0, ad(a) > 0 and all prncpal n n submatrces of A are postve defnte, (b) A X n+1 f and only f A s postve defnte, (c) A Y n+1 f and only f det(a) < 0, ad(a) > 0 and all prncpal n n submatrces of A are postve defnte. In partcular, all off-dagonal entres a j have absolute values less than 1,.e., a j < 1 for j. The followng gves a characterzaton of matrces n X n+1, Y n+1 and Z n+1 n R (n+1) (n+1). Theorem 3. Gven an (n + 1) (n + 1) symmetrc matrx A = [a j ] wth a = 1 for all, then (a) A Z n+1 f and only f det(a) = 0, A s postve sem-defnte, and there exsts a prncpal (k + 1) (k + 1) submatrx B of A so that det(b) = 0, ad(b) 0 and ad(b) 0, (b) A X n+1 f and only f ether A s n X n+1 or there exsts a dagonal matrx D = dag(ε 1,..., ε n+1 ) where ε = 1 or 1 for each = 1,..., n + 1, such that DAD Z n+1, (c) A Y n+1 f and only f ether A Z n+1 or det(a) < 0, ad(a) 0 and all prncpal n n submatrces of A are postve sem-defnte.

3 ON A CONJECTURE OF MILNOR ABOUT VOLUME OF SIMPLEXES 3 The paper s organzed as follows. In secton 2, we characterze normal vectors of degenerated Eucldean smplexes. In secton 3, we characterze angle Gram matrces of degenerated hyperbolc smplexes. Theorem 1 s proved n secton 4 and Theorem 3 s proved n secton 5. Acknowledgment. We would lke to thank the referee for a very careful readng of the manuscrpt and for hs/her nce suggestons on mprovng the exposton. 2. Normal vectors of Eucldean smplexes As a conventon, all vectors n R m are column vectors and the standard nner product n R m s denoted by u v. In the sequel, for a non-zero vector w R n, we call the set {x R n w x 0} a closed half space, and the set {x R n w x > 0} an open half space. Defne E n+1 = {(v 1,..., v n+1 ) (R n ) n+1 v 1,..., v n+1 form unt outward normal vectors to the codmenson-1 faces of a Eucldean n-smplex }. Followng Mlnor [5], a matrx s called undagonal f ts dagonal entres are 1. An (n + 1) (n + 1) symmetrc undagonal matrx A s n Z n+1 f and only f A = [v v j ] for some pont (v 1,..., v n+1 ) E n+1 (ths s proved n [3],[5]). We clam that an (n + 1) (n + 1) symmetrc undagonal matrx A s n Z n+1 f and only f A = [v v j ] for some pont (v 1,..., v n+1 ) n the closure E n+1 n (R n ) n+1. Indeed, f A = [v v j ] for some pont (v 1,..., v n+1 ) E n+1, then there s a sequence (v (m) 1,..., v (m) n+1 ) E n+1 convergng to (v 1,..., v n+1 ). We have a sequence of matrces A (m) = [v (m) v (m) j ] Z n+1 convergng to A. Conversely f A Z n+1, then there s a sequence of matrces A (m) Z n+1 convergng to A. Wrte A (m) = [v (m) v (m) j ], where (v (m) 1,..., v (m) n+1 ) E n+1. Snce has norm 1 for all, m, by takng subsequence, we may assume lm m (v (m) 1,..., v (m) n+1 ) = (v 1,..., v n+1 ) E n+1 so that A = [v v j ]. A geometrc characterzaton of elements n E n+1 was obtaned n [3]. For completeness, we nclude a proof here. v (m) Lemma 4. A collecton of unt vectors (v 1,..., v n+1 ) (R n ) n+1 s n E n+1 f and only f one of the followng condtons s satsfed. (4.1) The vectors v 1,..., v n+1 are not n any closed half-space. (4.2) Any n vectors of v 1,..., v n+1 are lnear ndependent and the lnear system n+1 =1 a v = 0 has a soluton (a 1,..., a n ) so that a > 0 for all = 1,..., n + 1. Proof. (4.2) (4.1). Suppose otherwse, v 1,..., v n+1 are n a closed half-space,.e., there s a non-zero vector w R n so that w v 0, = 1,..., n + 1. Let a 1,..., a n+1 be the postve numbers gven by (4.2) so

4 4 REN GUO & FENG LUO that n+1 =1 a v = 0. Then n+1 0 = w ( a v ) = =1 n+1 a (w v ). But by the assumpton a > 0, w v 0 for all. Thus w v = 0 for all. Ths means that v 1,..., v n+1 le n the (n 1)-dmensonal subspace perpendcular to w. It contradcts the assumpton n (4.2) that any n vectors of v 1,..., v n+1 are lnear ndependent. (4.1) (4.2). To see that any n vectors of v 1,..., v n+1 are lnear ndependent, suppose otherwse, some n vectors of v 1,..., v n+1 are lnear dependent. Therefore there s an (n 1)-dmensonal hyperplane contanng these n vectors. Then v 1,..., v n+1 are contaned n one of the two closed half spaces bounded by the hyperplane. It contradcts to the assumpton of (4.1). Snce v 1,..., v n+1 are lnear dependent, and any n of them are lnear ndependent, we can fnd real numbers a 0 for all such that n+1 =1 a v = 0. For any j, let H j be the (n 1)-dmensonal hyperplane spanned by the n 1 vectors {v 1,..., v n+1 } \ {v, v j } and u R n {0} be a vector perpendcular to H j. We have =1 n+1 0 = u ( a v ) = a (u v ) + a j (u v j ). =1 By the assumpton of (4.1), v and v j must le n the dfferent sdes of H j. Thus u v and u v j have dfferent sgn. Ths mples that a and a j have the same sgn. Hence we can make a > 0 for all. E n+1 (4.1). We wll show (v 1,..., v n+1 ) E n+1 f and only f the condton (4.1) holds. In fact, gven an n dmensonal Eucldean smplex σ, let S n 1 be the sphere nscrbed to σ. We may assume after a translaton and a scalng that S n 1 s the unt sphere centered at the orgn. Then the unt vectors v 1,..., v n+1 are the tangent ponts of S n 1 to the codmenson-1 faces of σ. The tangent planes to S n 1 at v s bound a compact regon (the Eucldean smplex σ) contanng the orgn f and only f the tangent ponts v 1,..., v n+1 are not n any closed hemsphere of S n 1. q.e.d. Lemma 5. A collecton of unt vectors (v 1,..., v n+1 ) (R n ) n+1 s n E n+1 f and only f one of the followng condtons s satsfed: (5.1) The vectors v 1,..., v n+1 are not n any open half-space. (5.2) The lnear system n+1 =1 a v = 0 has a nonzero soluton (a 1,..., a n+1 ) so that a 0 for all = 1,..., n + 1. Proof. E n+1 (5.1). To see that elements n E n+1 satsfy (5.1), f (v 1,..., v n+1 ) E n+1, there s a famly of (v (m) 1,..., v (m) n+1 ) E n+1 convergng to (v 1,..., v n+1 ). Snce vectors v (m) 1,..., v (m) n+1 are not n any closed

5 ON A CONJECTURE OF MILNOR ABOUT VOLUME OF SIMPLEXES 5 half-space for any m, by contnuty, vectors v 1,..., v n+1 are not n any open half-space. (5.1) (5.2). Consder the lnear map f : R n R n+1 w f(w) = [v 1, v 2,..., v n+1 ] t w = Statement (5.1) says that v 1 w v 2 w. v n+1 w = {w R n v w > 0, = 1,..., n + 1} = {w R n f(w) > 0} = f(r n ) R n+1 >0.. Snce f(r n ) and R n+1 >0 are convex and dsjont, by the separaton theorem for convex sets, there s a vector a = (a 1,..., a n+1 ) t satsfyng the condtons () and () below. () For all u R n+1 >0, a u > 0. and () For all w R n, 0 a f(w) = a 1 a 2. a n+1 v 1 w v 2 w. v n+1 w n+1 = ( a v ) w. Condton () mples that a 0, for = 1,..., n + 1 and a 0. Condton () mples n+1 =1 a v = 0. Thus (5.2) holds. (5.2) E n+1. To see that a pont (v 1,..., v n+1 ) satsfyng (5.2) s n E n+1, we show that n any ε-neghborhood of (v 1,..., v n+1 ) n (R n ) n+1, there s a pont (v1 ε,..., vε n+1 ) E n+1. Let N k be the set of (v 1,..., v k ) such that v R k 1, v = 1 for all and k =1 a v = 0 has a nonzero soluton (a 1,..., a k ) wth a 0 for all. The goal s to prove N n+1 E n+1. We acheve ths by nducton on n. It s obvous that N 2 E 2. Assume that N n E n holds. For a pont (v 1,..., v n+1 ) N n+1, f any n vectors of v 1,..., v n+1 are lnear ndependent, then each entry a of the non-zero soluton of the lnear system n+1 =1 a v = 0, a 0, = 1,..., n + 1 must be nonzero. Thus a > 0 for all and (v 1,..., v n+1 ) satsfes (4.2), therefore t s n E n+1. In the reman case, wthout loss of generalty, we assume that v 1,..., v n are lnear dependent. We may assume after a change of coordnates =1

6 6 REN GUO & FENG LUO that v R n 1 = R n 1 {0} R n, for = 1,..., n, and v n+1 = (u n+1 cos(θ), sn(θ)) t, where 0 θ π 2 and u n+1 = 1. We clam that there exsts some 1 n + 1 such that (v 1,..., v,..., v n+1 ) N n, where x means deletng the element x. Case 1. If θ > 0.e., v n+1 s not n R n 1, consder the nonzero soluton of the lnear system n+1 =1 a v = 0, a 0, = 1,..., n + 1. The last coordnate gves a a n 0 + a n+1 sn(θ) = 0, whch mples a n+1 = 0. Ths means (a 1,..., a n ) 0,.e., (v 1,..., v n ) N n. Case 2. If θ = 0.e., v n+1 R n 1, then the dmenson of the soluton space W = {(a 1,..., a n+1 ) t R n+1 n+1 =1 a v = 0} s at least 2. Snce (v 1,..., v n+1 ) N n+1, the ntersecton W R n+1 0 {(0,..., 0)} s nonempty. The vector space W must ntersect the boundary of the cone R n+1 0 {(0,..., 0)}. Let (a 1,..., a n+1 ) be a pont n both W and the boundary of the cone R n+1 0 {(0,..., 0)}. Then there s some a = 0. Then {v 1 (t),..., v (t),..., v n+1 (t)} N n. By the above dscusson, wthout lose of generalty, we may assume that (v 1,..., v n ) N n. By the nducton assumpton N n E n,.e., n any ɛ 2 -neghborhood of (v 1,..., v n ), we can fnd a pont (u 1,..., u n ) E n, where u R n 1 for all. Recall we wrte v n+1 = (u n+1 cos(θ), sn(θ)) t. Let us defne a contnuous famly of n + 1 unt vectors v 1 (t),..., v n+1 (t) by settng v (t) = (u cos(t 2 ), sn(t 2 )) t, 1 n, v n+1 (t) = (u n+1 cos(θ + t), sn(θ + t)) t. We clam that there s a pont (v 1 (t),..., v n+1 (t)) E n+1 for small t > 0 wthn ɛ 2 -neghborhood of ((u 1, 0) t,..., (u n, 0) t, v n+1 ). By trangle nequalty, ths pont s wthn ε-neghborhood of (v 1,..., v n+1 ). We only need to check that (v 1 (t),..., v n+1 (t)) E n+1 for suffcently small t > 0 by verfyng the condton (4.2). To show any n vectors of v 1 (t),..., v n+1 (t) are lnear ndependent, t s equvalent to show that det[v 1 (t),..., v (t),..., v n+1 (t)] 0 for each = 1,..., n + 1. Frst, [ u1 cos(t det[v 1 (t),..., v n (t)] = det 2 ) u 2 cos(t 2 )... u n cos(t 2 ] ) sn(t 2 ) sn(t 2 )... sn(t 2 ) [ ] = sn(t 2 ) cos(t 2 ) n 1 u1 u det 2... u n To see the determnant s nonzero, suppose there are real numbers a 1,..., a n such that n =1 a (u 1, 1) t = 0. Then we have n =1 a u = 0 and n =1 a = 0. By assumpton (u 1,..., u n ) E n, we know ether a = 0 for all or a 0 and have the same sgn for all. Hence n =1 a = 0 n n

7 ON A CONJECTURE OF MILNOR ABOUT VOLUME OF SIMPLEXES 7 mples a = 0 for all. Thus the vectors (u 1, 1) t,..., (u n, 1) t are lnear ndependent. Hence det[v 1 (t),..., v n (t)] 0 for t (0, π 2 ]. Second, we calculate the determnant of the matrx whose columns are v n+1 (t) and some n 1 vectors of v 1 (t),..., v n (t). Wthout loss of generalty, consder f(t) = det[v 2 (t),..., v n (t), v n+1 (t)] [ u2 cos(t = det 2 )... u n cos(t 2 ] ) u n+1 cos(θ + t) sn(t 2 )... sn(t 2 ) sn(θ + t) If θ > 0, by the assumpton (u 1,..., u n ) E n, then [ ] u2... u f(0) = det n u n+1 cos(θ) = sn(θ) det[u sn(θ) 2,..., u n ] 0. It mples f(t) 0 holds for suffcently small t > 0. If θ = 0, then f(0) = 0. By expandng the determnant, f(t) = sn(t 2 )g(t) + sn(t) det[u 2 cos(t 2 ),..., u n cos(t 2 )], for some functon g(t), therefore f (0) = det(u 2,..., u n ) 0. Hence f(t) 0 holds for suffcently small t > 0. Next, let a (t) = ( 1) 1 det[v 1 (t),..., v (t),..., v n+1 (t)], 1 n + 1, then n+1 =1 a (t)v (t) = 0. Snce det[v 1 (0),..., v n (0)] = 0, we have a n+1 (0) = 0. Ths shows that n =1 a (0)v (0) = 0, therefore n =1 a (0)u = 0. By the assumpton (u 1,..., u n ) E n, we obtan a (0) a j (0) > 0 for 0, j n. By the contnuty we obtan a (t) a j (t) > 0 for 0, j n, for suffcent small t > 0. Consder the last coordnate of n+1 =1 a (t)v (t) = 0 we obtan n sn(t 2 ) a (t) + sn(θ + t)a n+1 (t) = 0. =1 Thus a n+1 (t) has the same sgn as that of a (t). Thus (a 1 (t),..., a n+1 (t)) or ( a 1 (t),..., a n+1 (t)) s a soluton requred n condton (4.2). q.e.d. 3. Degenerate hyperbolc smplexes Let R n,1 be the Mnkowsk space whch s R n+1 wth an nner product, where (x 1,..., x n, x n+1 ) t, (y 1,..., y n, y n+1 ) t = x 1 y x n y n x n+1 y n+1. Let H n = {x = (x 1,..., x n+1 ) t R n,1 x, x = 1, x n+1 > 0} be the hyperbolod model of the hyperbolc space. The de Stter space s {x R n,1 x, x = 1}. For a hyperbolc smplex σ n H n, the center and the radus of the smplex σ are defned to be the center and radus of ts nscrbed ball.

8 8 REN GUO & FENG LUO Lemma 6. For an n-dmensonal hyperbolc smplex σ H n wth center e n+1 = (0,..., 0, 1) t, ts unt outward normal vectors n the de Stter space are n a compact set ndependent of σ. Proof. Let v 1,..., v n+1 be the unt outward normal vectors of σ,.e., σ = {x H n x, v 0 and v, v = 1 for all }. Let v be the totally geodesc hyperplane n H n contanng the (n 1) dmensonal face of σ perpendcular to v for each = 1,..., n + 1. The radus of σ s the dstance from the center e n+1 to v for any = 1,..., n + 1 whch s equal to snh 1 ( e n+1, v ) (see for nstance [9] p26). It s well known that the volume of an n dmensonal hyperbolc smplex s bounded by the volume of the n dmensonal regular deal hyperbolc smplex whch s fnte (see for nstance [6] p539). It mples that the radus of a hyperbolc smplex σ s bounded from above by a constant ndependent of σ. Hence e n+1, v 2 s bounded from above by a constant c n ndependent of σ for any = 1,..., n + 1. It follows that v 1,..., v n+1 are n the compact set X n = {x = (x 1,..., x n+1 ) t x, x = 1, e n+1, x 2 c n } = {x = (x 1,..., x n+1 ) t x x 2 n = x 2 n+1 + 1, x 2 n+1 c n } ndependent of σ. q.e.d. Lemma 7. If A Y n+1 and det(a) = 0, then A Z n+1. Proof. Let A (m) be a sequence of angle Gram matrxes n Y n+1 convergng to A. By Proposton 2 (c), for any m, all prncpal n n submatrces of A (m) are postve defnte. Thus all prncpal n n submatrces of A are postve sem-defnte. Snce det(a) = 0, we see that A s postve sem-defnte. Let σ (m) be the n dmensonal hyperbolc smplex n the hyperbolod model H n whose angle Gram matrx s A (m) and whose center s e n+1 = (0,..., 0, 1) t. By Lemma 6, ts unt outward normal vector v (m) s n a compact set. Thus by takng a subsequence, we may assume (v (m) 1,..., v (m) A (m) = [ v (m) n+1 ) converges to (v 1,..., v n+1 ) wth v, v = 1. Snce, v (m) ] and A (m) converges to A, we obtan j A = [ v, v j ] = [v 1,..., v n+1 ] t S[v 1,..., v n+1 ], where S s the dagonal matrx dag(1,..., 1, 1). Snce det(a) = 0, the vectors v 1,..., v n+1 are lnear dependent. Assume that the vectors v 1,..., v n+1 span a k dmensonal subspace W of R n,1, where k n.

9 ON A CONJECTURE OF MILNOR ABOUT VOLUME OF SIMPLEXES 9 For any vector x W, wrte x = n+1 =1 x v. Then x, x = (x 1,..., x n+1 )[v 1,..., v n+1 ] t S[v 1,..., v n+1 ](x 1,..., x n+1 ) t = (x 1,..., x n+1 )A(x 1,..., x n+1 ) t 0 due to the fact that A s postve sem-defnte. Now for any x, y W, the nequalty x+ty, x+ty 0 for any t R mples the Schwartz nequalty x, y 2 x, x y, y. To prove that A Z n+1, we consder the followng two possbltes. Case 1. If x, x > 0 holds for any non-zero x W, then the Mnkowsk nner product restrcted on W s postve defnte. Snce the Mnkowsk nner product restrcted on R k = R k 0 R n,1 s postve defnte, by Wtt s theorem, there s an sometry γ of R n,1 sendng W to R k (see [9] p14-p15). By replacng v (m) by γ(v (m) ) for each and m, we may assume that v 1,..., v n+1 are contaned n R k. Thus v, v = v v j for all, j. Therefore A = [v 1,..., v n+1 ] t S[v 1,..., v n+1 ] = [v 1,..., v n+1 ] t [v 1,..., v n+1 ]. To show A Z n+1, by Lemma 5, we only need to show that v 1,..., v n+1 are not contaned n any open half space of R k. Ths s the same as that v 1,..., v n+1 are not contaned n any open half space of R n. Suppose otherwse, there exsts a vector w R k such that v w > 0 for all. Thus v, w = v w > 0. By takng m large enough, we obtan v (m), w > 0 for all. It s well known that for the unt normal vectors v (m) of a compact hyperbolc smplex n H n, the condtons v (m), w > 0 for all mples w, w < 0. But ths contradcts the assumpton that w R k whch mples w, w 0. Case 2. If there exsts some non-zero vector x 0 W such that x 0, x 0 = 0, then by the Schwartz nequalty we have x 0, y 2 x 0, x 0 y, y = 0 for any y W. Thus x 0, y = 0 for any y W. Ths mples that the subspace W s contaned n x 0, the orthogonal complement of x 0. Snce the vector u = (0,..., 0, 1, 1) t R n,1 satsfes u, u = 0, there s an sometry γ of R n,1 sendng x 0 to u. Thus γ sends x 0 to u. By replacng v (m) by γ(v (m) ) for each and m, we may assume that v 1,..., v n+1 are contaned n u. For any, snce v, u = v, (0,..., 0, 1, 1) t = 0, we can wrte v as v = w + a u

10 10 REN GUO & FENG LUO for some w R n 1 and a R. Snce w, u = 0, thus v, v j = w w j for all, j. Therefore A = [v 1,..., v n+1 ] t S[v 1,..., v n+1 ] = [w 1,..., w n+1 ] t [w 1,..., w n+1 ]. To show A Z n+1, by Lemma 5, we only need to show that w 1,..., w n+1 are not contaned n any open half space of R n 1 whch s equvalent to that w 1,..., w n+1 are not contaned n any open half space of R n. Suppose otherwse, there exsts a vector w R n 1 such that w w > 0 for all. Then v, w = w, w + (0,..., 0, a, a ) t, w = w w + 0 > 0 for all. By takng m large enough, we obtan v (m), w > 0 for all. By the same argument above, t s a contradcton. q.e.d. 4. Proof of Theorem 1 Sphercal case. We begn wth a bref revew of the relevant result n [4]. For any postve sem-defnte symmetrc matrx A, there exsts a unque postve sem-defnte symmetrc matrx A so that ( A) 2 = A. It s well know that the map A A s contnuous on the space of all postve sem-defnte symmetrc matrces. Suppose A X n+1 = {A = [a j ] R (n+1) (n+1) A t = A, all a = 1, A s postve defnte}, the space of the angle Gram matrces of sphercal smplexes (by the Proposton 2). By makng a change of varables, the Aomoto-Kneser-Vnberg formula (1.1) s equvalent to (4.1) V (A) = µ 1 n χ( Ax)e xtx dx, R n+1 where χ s the characterstc functon of the set R n+1 0 n R n+1. It s proved n [4] that volume formula (4.1) stll holds for any matrx n X n+1 ={A = [a j ] R (n+1) (n+1) A t = A, all a = 1, A s postve sem-defnte}. Suppose V (A) = 0, by formula (4.1), we see the functon χ h : R n+1 R s zero almost everywhere, where h : R n+1 R n+1 s the lnear map sendng x to Ax. Equvalently, the (n + 1)-dmensonal Lebesque measure of h 1 (R n+1 0 ) s zero. We clam h(rn+1 ) R n+1 >0 =. For otherwse, h 1 (R n+1 >0 ) s a nonempty open subset n Rn+1 wth postve (n + 1)-dmensonal Lebesque measure. Ths s a contradcton. Now let A = [v 1,..., v n+1 ] t (n+1) (n+1), where v R n+1 s a column vector for each. Frst h(r n+1 ) R n+1 >0 = mples that det A = 0. Therefore {v 1,..., v n+1 } are lnear dependent. We may assume, after a

11 ON A CONJECTURE OF MILNOR ABOUT VOLUME OF SIMPLEXES 11 rotaton r O(n + 1), the vectors v 1,..., v n+1 le n R n {0}. Now = h(r n+1 ) R n+1 >0 = { Aw w R n+1 } R n+1 >0 = {(v 1 w,..., v n+1 w) t w R n+1 } R n+1 >0 Ths shows that there s no w R n+1 such that v w > 0 for = 1,..., n + 1,.e., the vectors v 1,..., v n+1 are not n any open half space. By lemma 5, we have (v 1,..., v n+1 ) E n+1, therefore A = [v v j ] Z n+1. Hyperbolc case. Let A Y n+1. If det(a) 0, t s proved n [4] that the volume formula (1.1) stll holds for A. In formula (1.1), snce x t ad(a)x s fnte, the ntegrant e xtad(a)x > 0. Therefore the ntegral R n+1 0 e xt ad(a)x dx > 0. Hence V (A) > 0. It follows that f the extended volume functon vanshes at A, then det A = 0. By Lemma 7, we have A Z n Proof of Theorem 3 Proof of (a). If A Z n+1, then A = [v v j ] for some pont (v 1,..., v n+1 ) E n+1. By Lemma 5, the lnear system n+1 =1 a v = 0, a 0, = 1,..., n + 1 has a nonzero soluton. Let (a 1,..., a n+1 ) be a soluton wth the least number of nonzero entres among all solutons. By rearrange the ndex, we may assume a 1 > 0,..., a k+1 > 0, a k+2 =... = a n+1 = 0. We clam rank[v 1,..., v k+1 ] = k. Otherwse rank[v 1,..., v k+1 ] k 1, then the dmenson of the soluton space W = {(x 1,..., x k+1 ) t R k+1 k+1 =1 x v = 0} s at least 2. Thus Ω = W R k+1 >0 s a nonempty open convex set n W whose dmenson s at least 2. Hence Ω contans a boundary pont (b 1,..., b k+1 ) Ω {(0,..., 0)} wth some b j = 0, due to dmw 2. Now we obtan a soluton (b 1,...b j 1, 0, b j+1,..., b k+1, 0,..., 0) whch has lesser number of nonzero entres than (a 1,..., a n+1 ). Ths s a contradcton. Let B = [v v j ] (k+1) (k+1). Snce rank[v 1,..., v k+1 ] = k, we have det(b) = 0. We clam that ad(b) 0 and ad(b) 0. Ths wll verfy the condton (a) n Theorem 3 for A. Let ad(b) = [b j ] (k+1) (k+1). Evdently, due to rank(b) = k, ad(b) 0. It remans to prove that ad(b) 0. By the constructon of B, we see b jj 0, for all j. Snce rank[v 1,..., v k+1 ] = k, t follows the dmenson of the soluton space of k+1 =1 a v = 0 s 1. Snce k+1 =1 b jv j = 0, (b 1,..., b k+1 ) s proportonal to (a 1,..., a k+1 ), where a > 0 for 1 k + 1. Ths shows that f b jj > 0, then b j > 0 for all, f b jj = 0, then b j = 0 for all. Ths shows ad(b) 0. Conversely, f A s postve sem-defnte so that det(a) = 0 and there exsts a prncpal (k + 1) (k + 1) submatrx B so that det(b) = 0, ad(b) 0 and ad(b) 0, we wll show that A Z n+1. Snce

12 12 REN GUO & FENG LUO A s postve sem-defnte and undagonal, there exst unt vectors v 1,..., v n+1 n R n such that A = [v v j ]. We may assume B = [v v j ] (k+1) (k+1), 1, j k + 1 and ad(b) = [b j ]. Due to det(b) = 0, ad(b) 0, we have rank(v 1,..., v k+1 ) = k. We may assume v 2,..., v k+1 are ndependent. Thus the cofactor b 11 > 0. By the assumpton ad(b) 0, we have b 1s 0 for s = 1,...k + 1. Snce k+1 s=1 b 1s(v s v j ) = 0 for all j = 2,..., k + 1 and v 2,..., v k+1 are ndependent, we get k+1 s=1 b 1sv s = 0. Thus we get a nonzero soluton for the lnear system n+1 =1 a v = 0, a 0, = 1,..., n + 1. Proof of (b). If A X n+1 X n+1, then A = [v v j ] where v 1,..., v n+1 are lnear dependent. We can assume v 1,..., v n+1 le n R n {0}. By change subndex, we may assume n+1 =1 a v = 0 has a non-zero soluton wth a 0 f = 1,..., k whle a < 0 f = k + 1,..., n + 1. Thus vectors v 1,..., v k, v k+1,..., v n+1 satsfy the condton (5.2) n Lemma 5. Let D be the dagonal matrx dag(1,..., 1, 1,..., 1) wth k dagonal entres beng 1 and n k + 1 dagonal entres beng 1. Thus by Lemma 5, DAD Z n+1. On the other hand, f for some dagonal matrx D n Theorem 3 (b), we have DAD Z n+1, then by Theorem 3 (a), DAD s postve sem-defnte. Therefore A s postve sem-defnte. Take B X n+1 and consder the famly A(t) = (1 t)a+tb for t [0, 1]. Then lm t 0 A(t) = A and A(t) X n+1 for t > 0. Thus A X n+1. Proof of (c). Frst we show that the condtons are suffcent. Suppose A = [a j ] (n+1) (n+1) s a symmetrc undagonal matrx wth all prncpal n n submatrces postve sem-defnte so that ether A Z n+1 or det(a) < 0 and ad(a) 0. We wll show A Y n+1. If A Z n+1, t s suffcent to show that Z n+1 Y n+1,.e., we may assume A Z n+1. In ths case, let J = [c j ] (n+1) (n+1) so that c = 1 and c j = 1 for j. Consder the famly A(t) = (1 t)a + tj, for 0 t 1. Evdently lm t 0 A(t) = A. We clam that A(t) Y n+1 for small t > 0. Snce all prncpal n n submatrces of A are postve defnte, by contnuty, all prncpal n n submatrces of A(t) are postve defnte for small t > 0. It remans to check det(a(t)) < 0 for small t > 0. To ths end, let us consder d dt t=0 det(a(t)). We have d dt t=0 det(a(t)) = ( a j 1)cof(A) j < 0, j due to ad(a) = [cof(a) j ] > 0 and a j 1 < 0 for all j. Snce det(a) = 0 t follows that det(a(t)) < 0 for small t > 0. In the second case that det(a) < 0 and ad(a) 0 and all prncpal n n submatrces of A are postve sem-defnte. Then A has a unque negatve egenvalue λ, where λ > 0. Consder the famly A(t) = A +

13 ON A CONJECTURE OF MILNOR ABOUT VOLUME OF SIMPLEXES 13 tλi, for 0 t 1, where I s the dentty matrx, so that 1 lm A(t) = A. t λt We clam there s a dagonal matrx D whose dagonal entres are ±1 so that (1) DAD = A, 1 (2) 1+λt DA(t)D Y n+1 for 0 < t < 1. As a consequence, t follows A = DAD 1 = lm t λt DA(t)D Y n+1. To fnd ths dagonal matrx D, by the contnuty, det(a(t)) < 0 for 0 < t < 1 and det(a(1)) = 0. Furthermore, all prncpal n n submatrces of A are postve defnte for t > 0 due to postve defnteness of tλi. Let us recall the Lemma 3.4 n [4] whch says that f B s a symmetrc (n + 1) (n + 1) matrx so that all n n prncpal submatrces n B are postve defnte and det(b) 0, then no entry n the adjacent matrx ad(b) s zero. It follows that every entry of ad(a(t)) s nonzero for 0 < t 1. Let ad(a(1)) = [b j ] (n+1) (n+1) and D to be the dagonal matrx wth dagonal entres beng b 1 b 1 = ±1 for = 1,..., n + 1. Then the entres of the frst row and the frst column of Dad(A(1))D are postve. Snce det(a(1)) = 0 and ad(a(1)) 0, we see the rank of ad(a(1)) s 1. Thus any other column s propostonal to the frst column. But b > 0 for all, hence ad(a(1)) > 0. Now snce every entry of Dad(A(t))D s nonzero for t > 0, by contnuty Dad(A(t))D > 0 for t > 0 and Dad(A)D = Dad(A(0))D 0. By the assumpton ad(a) 0, t follows Dad(A)D = ad(a). On the other hand Dad(A)D = ad(d 1 AD 1 ), and det(a) 0. Thus D 1 AD 1 = A or the same A = DAD. Ths shows A = DAD = lm t 0 DA(t)D 1 = lm t λt DA(t)D. By the constructon above 1 1+λt DA(t)D Y n+1 for 0 < t < 1, ths shows A Y n+1. Fnally, we show the condton n (c) s necessary. Suppose A = lm m A (m) where A (m) Y n+1. By Proposton 2, det(a (m) ) < 0, ad(a (m) ) > 0 and all prncpal n n submatrces of A (m) are postve

14 14 REN GUO & FENG LUO defnte. We want to show that A satsfes the condtons stated n (c). Evdently, all prncpal n n submatrces of A are postve semdefnte, ad(a) 0 and det(a) 0. If det(a) < 0, then we are done. If det(a) = 0, by Lemma 7, we see that A Z n+1. References 1. K. Aomoto, Analytc structure of Schläfl functon. Nagoya Math J. 68 (1977), 1 16, MR , Zbl H. Kneser, Der Smplexnhalt n der nchteukldschen Geometre. Deutsche Math. 1(1936), , Zbl F. Luo, On a problem of Fenchel. Geom. Dedcata 64 (1997), no. 3, , MR , Zbl F. Luo, Contnuty of the Volume of Smplces n Classcal Geometry. Commun. Contemp. Math. 8 (2006), no. 3, , MR , Zbl J. Mlnor, The Schläfl dfferental equalty. Collected papers, vol. 1. Publsh or Persh, Inc., Houston, TX, 1994, MR , Zbl J. G. Ratclffe, Foundatons of Hyperbolc Manfolds. Second Edton. GTM 149, Sprnger, 2006, MR , Zbl I. Rvn, Contnuty of volumes on a generalzaton of a conjecture of J. W. Mlnor. Geom. Dedcata 131 (2008), 73 85, MR , Zbl E. B. Vnberg, Volumes of non-eucldean polyhedra. (Russan) Uspekh Mat. Nauk 48 (1993), no. 2(290), 17 46; translaton n Russan Math. Surveys 48 (1993), no. 2, 15 45, MR , Zbl E. B. Vnberg (Ed.), Geometry II, Spaces of Constant Curvature. Encyclopaeda of Mathematcal Scences, Vol. 29, Sprnger-Verlag Berln Hedelberg 1993, MR , Zbl Department of Mathematcs, Rutgers Unversty, Pscataway, NJ, Current address: School of Mathematcs, Unversty of Mnnesota, Mnneapols, MN, E-mal address: guoxx170@math.umn.edu The Center of Mathematcal Scence, Zhejang Unversty, Hangzhou, Chna, Department of Mathematcs, Rutgers Unversty, Pscataway, NJ, E-mal address: fluo@math.rutgers.edu

APPENDIX A Some Linear Algebra

APPENDIX A Some Linear Algebra APPENDIX A Some Lnear Algebra The collecton of m, n matrces A.1 Matrces a 1,1,..., a 1,n A = a m,1,..., a m,n wth real elements a,j s denoted by R m,n. If n = 1 then A s called a column vector. Smlarly,

More information

Linear, affine, and convex sets and hulls In the sequel, unless otherwise specified, X will denote a real vector space.

Linear, affine, and convex sets and hulls In the sequel, unless otherwise specified, X will denote a real vector space. Lnear, affne, and convex sets and hulls In the sequel, unless otherwse specfed, X wll denote a real vector space. Lnes and segments. Gven two ponts x, y X, we defne xy = {x + t(y x) : t R} = {(1 t)x +

More information

More metrics on cartesian products

More metrics on cartesian products More metrcs on cartesan products If (X, d ) are metrc spaces for 1 n, then n Secton II4 of the lecture notes we defned three metrcs on X whose underlyng topologes are the product topology The purpose of

More information

STEINHAUS PROPERTY IN BANACH LATTICES

STEINHAUS PROPERTY IN BANACH LATTICES DEPARTMENT OF MATHEMATICS TECHNICAL REPORT STEINHAUS PROPERTY IN BANACH LATTICES DAMIAN KUBIAK AND DAVID TIDWELL SPRING 2015 No. 2015-1 TENNESSEE TECHNOLOGICAL UNIVERSITY Cookevlle, TN 38505 STEINHAUS

More information

Lectures - Week 4 Matrix norms, Conditioning, Vector Spaces, Linear Independence, Spanning sets and Basis, Null space and Range of a Matrix

Lectures - Week 4 Matrix norms, Conditioning, Vector Spaces, Linear Independence, Spanning sets and Basis, Null space and Range of a Matrix Lectures - Week 4 Matrx norms, Condtonng, Vector Spaces, Lnear Independence, Spannng sets and Bass, Null space and Range of a Matrx Matrx Norms Now we turn to assocatng a number to each matrx. We could

More information

U.C. Berkeley CS294: Beyond Worst-Case Analysis Luca Trevisan September 5, 2017

U.C. Berkeley CS294: Beyond Worst-Case Analysis Luca Trevisan September 5, 2017 U.C. Berkeley CS94: Beyond Worst-Case Analyss Handout 4s Luca Trevsan September 5, 07 Summary of Lecture 4 In whch we ntroduce semdefnte programmng and apply t to Max Cut. Semdefnte Programmng Recall that

More information

n α j x j = 0 j=1 has a nontrivial solution. Here A is the n k matrix whose jth column is the vector for all t j=0

n α j x j = 0 j=1 has a nontrivial solution. Here A is the n k matrix whose jth column is the vector for all t j=0 MODULE 2 Topcs: Lnear ndependence, bass and dmenson We have seen that f n a set of vectors one vector s a lnear combnaton of the remanng vectors n the set then the span of the set s unchanged f that vector

More information

Math 217 Fall 2013 Homework 2 Solutions

Math 217 Fall 2013 Homework 2 Solutions Math 17 Fall 013 Homework Solutons Due Thursday Sept. 6, 013 5pm Ths homework conssts of 6 problems of 5 ponts each. The total s 30. You need to fully justfy your answer prove that your functon ndeed has

More information

Genericity of Critical Types

Genericity of Critical Types Genercty of Crtcal Types Y-Chun Chen Alfredo D Tllo Eduardo Fangold Syang Xong September 2008 Abstract Ely and Pesk 2008 offers an nsghtful characterzaton of crtcal types: a type s crtcal f and only f

More information

MAT 578 Functional Analysis

MAT 578 Functional Analysis MAT 578 Functonal Analyss John Qugg Fall 2008 Locally convex spaces revsed September 6, 2008 Ths secton establshes the fundamental propertes of locally convex spaces. Acknowledgment: although I wrote these

More information

8.4 COMPLEX VECTOR SPACES AND INNER PRODUCTS

8.4 COMPLEX VECTOR SPACES AND INNER PRODUCTS SECTION 8.4 COMPLEX VECTOR SPACES AND INNER PRODUCTS 493 8.4 COMPLEX VECTOR SPACES AND INNER PRODUCTS All the vector spaces you have studed thus far n the text are real vector spaces because the scalars

More information

10-801: Advanced Optimization and Randomized Methods Lecture 2: Convex functions (Jan 15, 2014)

10-801: Advanced Optimization and Randomized Methods Lecture 2: Convex functions (Jan 15, 2014) 0-80: Advanced Optmzaton and Randomzed Methods Lecture : Convex functons (Jan 5, 04) Lecturer: Suvrt Sra Addr: Carnege Mellon Unversty, Sprng 04 Scrbes: Avnava Dubey, Ahmed Hefny Dsclamer: These notes

More information

= = = (a) Use the MATLAB command rref to solve the system. (b) Let A be the coefficient matrix and B be the right-hand side of the system.

= = = (a) Use the MATLAB command rref to solve the system. (b) Let A be the coefficient matrix and B be the right-hand side of the system. Chapter Matlab Exercses Chapter Matlab Exercses. Consder the lnear system of Example n Secton.. x x x y z y y z (a) Use the MATLAB command rref to solve the system. (b) Let A be the coeffcent matrx and

More information

Perron Vectors of an Irreducible Nonnegative Interval Matrix

Perron Vectors of an Irreducible Nonnegative Interval Matrix Perron Vectors of an Irreducble Nonnegatve Interval Matrx Jr Rohn August 4 2005 Abstract As s well known an rreducble nonnegatve matrx possesses a unquely determned Perron vector. As the man result of

More information

Inner Product. Euclidean Space. Orthonormal Basis. Orthogonal

Inner Product. Euclidean Space. Orthonormal Basis. Orthogonal Inner Product Defnton 1 () A Eucldean space s a fnte-dmensonal vector space over the reals R, wth an nner product,. Defnton 2 (Inner Product) An nner product, on a real vector space X s a symmetrc, blnear,

More information

Affine transformations and convexity

Affine transformations and convexity Affne transformatons and convexty The purpose of ths document s to prove some basc propertes of affne transformatons nvolvng convex sets. Here are a few onlne references for background nformaton: http://math.ucr.edu/

More information

BOUNDEDNESS OF THE RIESZ TRANSFORM WITH MATRIX A 2 WEIGHTS

BOUNDEDNESS OF THE RIESZ TRANSFORM WITH MATRIX A 2 WEIGHTS BOUNDEDNESS OF THE IESZ TANSFOM WITH MATIX A WEIGHTS Introducton Let L = L ( n, be the functon space wth norm (ˆ f L = f(x C dx d < For a d d matrx valued functon W : wth W (x postve sem-defnte for all

More information

Exercise Solutions to Real Analysis

Exercise Solutions to Real Analysis xercse Solutons to Real Analyss Note: References refer to H. L. Royden, Real Analyss xersze 1. Gven any set A any ɛ > 0, there s an open set O such that A O m O m A + ɛ. Soluton 1. If m A =, then there

More information

Salmon: Lectures on partial differential equations. Consider the general linear, second-order PDE in the form. ,x 2

Salmon: Lectures on partial differential equations. Consider the general linear, second-order PDE in the form. ,x 2 Salmon: Lectures on partal dfferental equatons 5. Classfcaton of second-order equatons There are general methods for classfyng hgher-order partal dfferental equatons. One s very general (applyng even to

More information

FINITELY-GENERATED MODULES OVER A PRINCIPAL IDEAL DOMAIN

FINITELY-GENERATED MODULES OVER A PRINCIPAL IDEAL DOMAIN FINITELY-GENERTED MODULES OVER PRINCIPL IDEL DOMIN EMMNUEL KOWLSKI Throughout ths note, s a prncpal deal doman. We recall the classfcaton theorem: Theorem 1. Let M be a fntely-generated -module. (1) There

More information

First day August 1, Problems and Solutions

First day August 1, Problems and Solutions FOURTH INTERNATIONAL COMPETITION FOR UNIVERSITY STUDENTS IN MATHEMATICS July 30 August 4, 997, Plovdv, BULGARIA Frst day August, 997 Problems and Solutons Problem. Let {ε n } n= be a sequence of postve

More information

2.3 Nilpotent endomorphisms

2.3 Nilpotent endomorphisms s a block dagonal matrx, wth A Mat dm U (C) In fact, we can assume that B = B 1 B k, wth B an ordered bass of U, and that A = [f U ] B, where f U : U U s the restrcton of f to U 40 23 Nlpotent endomorphsms

More information

MATH 241B FUNCTIONAL ANALYSIS - NOTES EXAMPLES OF C ALGEBRAS

MATH 241B FUNCTIONAL ANALYSIS - NOTES EXAMPLES OF C ALGEBRAS MATH 241B FUNCTIONAL ANALYSIS - NOTES EXAMPLES OF C ALGEBRAS These are nformal notes whch cover some of the materal whch s not n the course book. The man purpose s to gve a number of nontrval examples

More information

DECOUPLING THEORY HW2

DECOUPLING THEORY HW2 8.8 DECOUPLIG THEORY HW2 DOGHAO WAG DATE:OCT. 3 207 Problem We shall start by reformulatng the problem. Denote by δ S n the delta functon that s evenly dstrbuted at the n ) dmensonal unt sphere. As a temporal

More information

Yong Joon Ryang. 1. Introduction Consider the multicommodity transportation problem with convex quadratic cost function. 1 2 (x x0 ) T Q(x x 0 )

Yong Joon Ryang. 1. Introduction Consider the multicommodity transportation problem with convex quadratic cost function. 1 2 (x x0 ) T Q(x x 0 ) Kangweon-Kyungk Math. Jour. 4 1996), No. 1, pp. 7 16 AN ITERATIVE ROW-ACTION METHOD FOR MULTICOMMODITY TRANSPORTATION PROBLEMS Yong Joon Ryang Abstract. The optmzaton problems wth quadratc constrants often

More information

REAL ANALYSIS I HOMEWORK 1

REAL ANALYSIS I HOMEWORK 1 REAL ANALYSIS I HOMEWORK CİHAN BAHRAN The questons are from Tao s text. Exercse 0.0.. If (x α ) α A s a collecton of numbers x α [0, + ] such that x α

More information

ON A DETERMINATION OF THE INITIAL FUNCTIONS FROM THE OBSERVED VALUES OF THE BOUNDARY FUNCTIONS FOR THE SECOND-ORDER HYPERBOLIC EQUATION

ON A DETERMINATION OF THE INITIAL FUNCTIONS FROM THE OBSERVED VALUES OF THE BOUNDARY FUNCTIONS FOR THE SECOND-ORDER HYPERBOLIC EQUATION Advanced Mathematcal Models & Applcatons Vol.3, No.3, 2018, pp.215-222 ON A DETERMINATION OF THE INITIAL FUNCTIONS FROM THE OBSERVED VALUES OF THE BOUNDARY FUNCTIONS FOR THE SECOND-ORDER HYPERBOLIC EUATION

More information

Eigenvalues of Random Graphs

Eigenvalues of Random Graphs Spectral Graph Theory Lecture 2 Egenvalues of Random Graphs Danel A. Spelman November 4, 202 2. Introducton In ths lecture, we consder a random graph on n vertces n whch each edge s chosen to be n the

More information

Linear Algebra and its Applications

Linear Algebra and its Applications Lnear Algebra and ts Applcatons 4 (00) 5 56 Contents lsts avalable at ScenceDrect Lnear Algebra and ts Applcatons journal homepage: wwwelsevercom/locate/laa Notes on Hlbert and Cauchy matrces Mroslav Fedler

More information

Spectral Graph Theory and its Applications September 16, Lecture 5

Spectral Graph Theory and its Applications September 16, Lecture 5 Spectral Graph Theory and ts Applcatons September 16, 2004 Lecturer: Danel A. Spelman Lecture 5 5.1 Introducton In ths lecture, we wll prove the followng theorem: Theorem 5.1.1. Let G be a planar graph

More information

Perfect Competition and the Nash Bargaining Solution

Perfect Competition and the Nash Bargaining Solution Perfect Competton and the Nash Barganng Soluton Renhard John Department of Economcs Unversty of Bonn Adenauerallee 24-42 53113 Bonn, Germany emal: rohn@un-bonn.de May 2005 Abstract For a lnear exchange

More information

U.C. Berkeley CS294: Spectral Methods and Expanders Handout 8 Luca Trevisan February 17, 2016

U.C. Berkeley CS294: Spectral Methods and Expanders Handout 8 Luca Trevisan February 17, 2016 U.C. Berkeley CS94: Spectral Methods and Expanders Handout 8 Luca Trevsan February 7, 06 Lecture 8: Spectral Algorthms Wrap-up In whch we talk about even more generalzatons of Cheeger s nequaltes, and

More information

Chapter 5. Solution of System of Linear Equations. Module No. 6. Solution of Inconsistent and Ill Conditioned Systems

Chapter 5. Solution of System of Linear Equations. Module No. 6. Solution of Inconsistent and Ill Conditioned Systems Numercal Analyss by Dr. Anta Pal Assstant Professor Department of Mathematcs Natonal Insttute of Technology Durgapur Durgapur-713209 emal: anta.bue@gmal.com 1 . Chapter 5 Soluton of System of Lnear Equatons

More information

Formulas for the Determinant

Formulas for the Determinant page 224 224 CHAPTER 3 Determnants e t te t e 2t 38 A = e t 2te t e 2t e t te t 2e 2t 39 If 123 A = 345, 456 compute the matrx product A adj(a) What can you conclude about det(a)? For Problems 40 43, use

More information

Appendix B. Criterion of Riemann-Stieltjes Integrability

Appendix B. Criterion of Riemann-Stieltjes Integrability Appendx B. Crteron of Remann-Steltes Integrablty Ths note s complementary to [R, Ch. 6] and [T, Sec. 3.5]. The man result of ths note s Theorem B.3, whch provdes the necessary and suffcent condtons for

More information

FACTORIZATION IN KRULL MONOIDS WITH INFINITE CLASS GROUP

FACTORIZATION IN KRULL MONOIDS WITH INFINITE CLASS GROUP C O L L O Q U I U M M A T H E M A T I C U M VOL. 80 1999 NO. 1 FACTORIZATION IN KRULL MONOIDS WITH INFINITE CLASS GROUP BY FLORIAN K A I N R A T H (GRAZ) Abstract. Let H be a Krull monod wth nfnte class

More information

arxiv: v1 [math.co] 1 Mar 2014

arxiv: v1 [math.co] 1 Mar 2014 Unon-ntersectng set systems Gyula O.H. Katona and Dánel T. Nagy March 4, 014 arxv:1403.0088v1 [math.co] 1 Mar 014 Abstract Three ntersecton theorems are proved. Frst, we determne the sze of the largest

More information

The Order Relation and Trace Inequalities for. Hermitian Operators

The Order Relation and Trace Inequalities for. Hermitian Operators Internatonal Mathematcal Forum, Vol 3, 08, no, 507-57 HIKARI Ltd, wwwm-hkarcom https://doorg/0988/mf088055 The Order Relaton and Trace Inequaltes for Hermtan Operators Y Huang School of Informaton Scence

More information

1 Matrix representations of canonical matrices

1 Matrix representations of canonical matrices 1 Matrx representatons of canoncal matrces 2-d rotaton around the orgn: ( ) cos θ sn θ R 0 = sn θ cos θ 3-d rotaton around the x-axs: R x = 1 0 0 0 cos θ sn θ 0 sn θ cos θ 3-d rotaton around the y-axs:

More information

The lower and upper bounds on Perron root of nonnegative irreducible matrices

The lower and upper bounds on Perron root of nonnegative irreducible matrices Journal of Computatonal Appled Mathematcs 217 (2008) 259 267 wwwelsevercom/locate/cam The lower upper bounds on Perron root of nonnegatve rreducble matrces Guang-Xn Huang a,, Feng Yn b,keguo a a College

More information

DIFFERENTIAL FORMS BRIAN OSSERMAN

DIFFERENTIAL FORMS BRIAN OSSERMAN DIFFERENTIAL FORMS BRIAN OSSERMAN Dfferentals are an mportant topc n algebrac geometry, allowng the use of some classcal geometrc arguments n the context of varetes over any feld. We wll use them to defne

More information

SELECTED SOLUTIONS, SECTION (Weak duality) Prove that the primal and dual values p and d defined by equations (4.3.2) and (4.3.3) satisfy p d.

SELECTED SOLUTIONS, SECTION (Weak duality) Prove that the primal and dual values p and d defined by equations (4.3.2) and (4.3.3) satisfy p d. SELECTED SOLUTIONS, SECTION 4.3 1. Weak dualty Prove that the prmal and dual values p and d defned by equatons 4.3. and 4.3.3 satsfy p d. We consder an optmzaton problem of the form The Lagrangan for ths

More information

Solutions to exam in SF1811 Optimization, Jan 14, 2015

Solutions to exam in SF1811 Optimization, Jan 14, 2015 Solutons to exam n SF8 Optmzaton, Jan 4, 25 3 3 O------O -4 \ / \ / The network: \/ where all lnks go from left to rght. /\ / \ / \ 6 O------O -5 2 4.(a) Let x = ( x 3, x 4, x 23, x 24 ) T, where the varable

More information

Lecture 20: Lift and Project, SDP Duality. Today we will study the Lift and Project method. Then we will prove the SDP duality theorem.

Lecture 20: Lift and Project, SDP Duality. Today we will study the Lift and Project method. Then we will prove the SDP duality theorem. prnceton u. sp 02 cos 598B: algorthms and complexty Lecture 20: Lft and Project, SDP Dualty Lecturer: Sanjeev Arora Scrbe:Yury Makarychev Today we wll study the Lft and Project method. Then we wll prove

More information

Volume 18 Figure 1. Notation 1. Notation 2. Observation 1. Remark 1. Remark 2. Remark 3. Remark 4. Remark 5. Remark 6. Theorem A [2]. Theorem B [2].

Volume 18 Figure 1. Notation 1. Notation 2. Observation 1. Remark 1. Remark 2. Remark 3. Remark 4. Remark 5. Remark 6. Theorem A [2]. Theorem B [2]. Bulletn of Mathematcal Scences and Applcatons Submtted: 016-04-07 ISSN: 78-9634, Vol. 18, pp 1-10 Revsed: 016-09-08 do:10.1805/www.scpress.com/bmsa.18.1 Accepted: 016-10-13 017 ScPress Ltd., Swtzerland

More information

Problem Set 9 Solutions

Problem Set 9 Solutions Desgn and Analyss of Algorthms May 4, 2015 Massachusetts Insttute of Technology 6.046J/18.410J Profs. Erk Demane, Srn Devadas, and Nancy Lynch Problem Set 9 Solutons Problem Set 9 Solutons Ths problem

More information

Problem Do any of the following determine homomorphisms from GL n (C) to GL n (C)?

Problem Do any of the following determine homomorphisms from GL n (C) to GL n (C)? Homework 8 solutons. Problem 16.1. Whch of the followng defne homomomorphsms from C\{0} to C\{0}? Answer. a) f 1 : z z Yes, f 1 s a homomorphsm. We have that z s the complex conjugate of z. If z 1,z 2

More information

Maximizing the number of nonnegative subsets

Maximizing the number of nonnegative subsets Maxmzng the number of nonnegatve subsets Noga Alon Hao Huang December 1, 213 Abstract Gven a set of n real numbers, f the sum of elements of every subset of sze larger than k s negatve, what s the maxmum

More information

Discrete Mathematics. Laplacian spectral characterization of some graphs obtained by product operation

Discrete Mathematics. Laplacian spectral characterization of some graphs obtained by product operation Dscrete Mathematcs 31 (01) 1591 1595 Contents lsts avalable at ScVerse ScenceDrect Dscrete Mathematcs journal homepage: www.elsever.com/locate/dsc Laplacan spectral characterzaton of some graphs obtaned

More information

Complete subgraphs in multipartite graphs

Complete subgraphs in multipartite graphs Complete subgraphs n multpartte graphs FLORIAN PFENDER Unverstät Rostock, Insttut für Mathematk D-18057 Rostock, Germany Floran.Pfender@un-rostock.de Abstract Turán s Theorem states that every graph G

More information

Lecture 3. Ax x i a i. i i

Lecture 3. Ax x i a i. i i 18.409 The Behavor of Algorthms n Practce 2/14/2 Lecturer: Dan Spelman Lecture 3 Scrbe: Arvnd Sankar 1 Largest sngular value In order to bound the condton number, we need an upper bound on the largest

More information

Randić Energy and Randić Estrada Index of a Graph

Randić Energy and Randić Estrada Index of a Graph EUROPEAN JOURNAL OF PURE AND APPLIED MATHEMATICS Vol. 5, No., 202, 88-96 ISSN 307-5543 www.ejpam.com SPECIAL ISSUE FOR THE INTERNATIONAL CONFERENCE ON APPLIED ANALYSIS AND ALGEBRA 29 JUNE -02JULY 20, ISTANBUL

More information

On Finite Rank Perturbation of Diagonalizable Operators

On Finite Rank Perturbation of Diagonalizable Operators Functonal Analyss, Approxmaton and Computaton 6 (1) (2014), 49 53 Publshed by Faculty of Scences and Mathematcs, Unversty of Nš, Serba Avalable at: http://wwwpmfnacrs/faac On Fnte Rank Perturbaton of Dagonalzable

More information

Math 205A Homework #2 Edward Burkard. Assume each composition with a projection is continuous. Let U Y Y be an open set.

Math 205A Homework #2 Edward Burkard. Assume each composition with a projection is continuous. Let U Y Y be an open set. Math 205A Homework #2 Edward Burkard Problem - Determne whether the topology T = fx;?; fcg ; fa; bg ; fa; b; cg ; fa; b; c; dgg s Hausdor. Choose the two ponts a; b 2 X. Snce there s no two dsjont open

More information

princeton univ. F 17 cos 521: Advanced Algorithm Design Lecture 7: LP Duality Lecturer: Matt Weinberg

princeton univ. F 17 cos 521: Advanced Algorithm Design Lecture 7: LP Duality Lecturer: Matt Weinberg prnceton unv. F 17 cos 521: Advanced Algorthm Desgn Lecture 7: LP Dualty Lecturer: Matt Wenberg Scrbe: LP Dualty s an extremely useful tool for analyzng structural propertes of lnear programs. Whle there

More information

GELFAND-TSETLIN BASIS FOR THE REPRESENTATIONS OF gl n

GELFAND-TSETLIN BASIS FOR THE REPRESENTATIONS OF gl n GELFAND-TSETLIN BASIS FOR THE REPRESENTATIONS OF gl n KANG LU FINITE DIMENSIONAL REPRESENTATIONS OF gl n Let e j,, j =,, n denote the standard bass of the general lnear Le algebra gl n over the feld of

More information

PROCEEDINGS OF THE AMERICAN MATHEMATICAL SOCIETY Volume 125, Number 7, July 1997, Pages 2119{2125 S (97) THE STRONG OPEN SET CONDITION

PROCEEDINGS OF THE AMERICAN MATHEMATICAL SOCIETY Volume 125, Number 7, July 1997, Pages 2119{2125 S (97) THE STRONG OPEN SET CONDITION PROCDINGS OF TH AMRICAN MATHMATICAL SOCITY Volume 125, Number 7, July 1997, Pages 2119{2125 S 0002-9939(97)03816-1 TH STRONG OPN ST CONDITION IN TH RANDOM CAS NORBRT PATZSCHK (Communcated by Palle. T.

More information

SUCCESSIVE MINIMA AND LATTICE POINTS (AFTER HENK, GILLET AND SOULÉ) M(B) := # ( B Z N)

SUCCESSIVE MINIMA AND LATTICE POINTS (AFTER HENK, GILLET AND SOULÉ) M(B) := # ( B Z N) SUCCESSIVE MINIMA AND LATTICE POINTS (AFTER HENK, GILLET AND SOULÉ) S.BOUCKSOM Abstract. The goal of ths note s to present a remarably smple proof, due to Hen, of a result prevously obtaned by Gllet-Soulé,

More information

Representation theory and quantum mechanics tutorial Representation theory and quantum conservation laws

Representation theory and quantum mechanics tutorial Representation theory and quantum conservation laws Representaton theory and quantum mechancs tutoral Representaton theory and quantum conservaton laws Justn Campbell August 1, 2017 1 Generaltes on representaton theory 1.1 Let G GL m (R) be a real algebrac

More information

CSCE 790S Background Results

CSCE 790S Background Results CSCE 790S Background Results Stephen A. Fenner September 8, 011 Abstract These results are background to the course CSCE 790S/CSCE 790B, Quantum Computaton and Informaton (Sprng 007 and Fall 011). Each

More information

SL n (F ) Equals its Own Derived Group

SL n (F ) Equals its Own Derived Group Internatonal Journal of Algebra, Vol. 2, 2008, no. 12, 585-594 SL n (F ) Equals ts Own Derved Group Jorge Macel BMCC-The Cty Unversty of New York, CUNY 199 Chambers street, New York, NY 10007, USA macel@cms.nyu.edu

More information

THE WEIGHTED WEAK TYPE INEQUALITY FOR THE STRONG MAXIMAL FUNCTION

THE WEIGHTED WEAK TYPE INEQUALITY FOR THE STRONG MAXIMAL FUNCTION THE WEIGHTED WEAK TYPE INEQUALITY FO THE STONG MAXIMAL FUNCTION THEMIS MITSIS Abstract. We prove the natural Fefferman-Sten weak type nequalty for the strong maxmal functon n the plane, under the assumpton

More information

DOUBLE POINTS AND THE PROPER TRANSFORM IN SYMPLECTIC GEOMETRY

DOUBLE POINTS AND THE PROPER TRANSFORM IN SYMPLECTIC GEOMETRY DOUBLE POINTS AND THE PROPER TRANSFORM IN SYMPLECTIC GEOMETRY JOHN D. MCCARTHY AND JON G. WOLFSON 0. Introducton In hs book, Partal Dfferental Relatons, Gromov ntroduced the symplectc analogue of the complex

More information

Random Walks on Digraphs

Random Walks on Digraphs Random Walks on Dgraphs J. J. P. Veerman October 23, 27 Introducton Let V = {, n} be a vertex set and S a non-negatve row-stochastc matrx (.e. rows sum to ). V and S defne a dgraph G = G(V, S) and a drected

More information

Chat eld, C. and A.J.Collins, Introduction to multivariate analysis. Chapman & Hall, 1980

Chat eld, C. and A.J.Collins, Introduction to multivariate analysis. Chapman & Hall, 1980 MT07: Multvarate Statstcal Methods Mke Tso: emal mke.tso@manchester.ac.uk Webpage for notes: http://www.maths.manchester.ac.uk/~mkt/new_teachng.htm. Introducton to multvarate data. Books Chat eld, C. and

More information

9 Characteristic classes

9 Characteristic classes THEODORE VORONOV DIFFERENTIAL GEOMETRY. Sprng 2009 [under constructon] 9 Characterstc classes 9.1 The frst Chern class of a lne bundle Consder a complex vector bundle E B of rank p. We shall construct

More information

MEM 255 Introduction to Control Systems Review: Basics of Linear Algebra

MEM 255 Introduction to Control Systems Review: Basics of Linear Algebra MEM 255 Introducton to Control Systems Revew: Bascs of Lnear Algebra Harry G. Kwatny Department of Mechancal Engneerng & Mechancs Drexel Unversty Outlne Vectors Matrces MATLAB Advanced Topcs Vectors A

More information

42. Mon, Dec. 8 Last time, we were discussing CW complexes, and we considered two di erent CW structures on S n. We continue with more examples.

42. Mon, Dec. 8 Last time, we were discussing CW complexes, and we considered two di erent CW structures on S n. We continue with more examples. 42. Mon, Dec. 8 Last tme, we were dscussng CW complexes, and we consdered two d erent CW structures on S n. We contnue wth more examples. (2) RP n. Let s start wth RP 2. Recall that one model for ths space

More information

The Geometry of Logit and Probit

The Geometry of Logit and Probit The Geometry of Logt and Probt Ths short note s meant as a supplement to Chapters and 3 of Spatal Models of Parlamentary Votng and the notaton and reference to fgures n the text below s to those two chapters.

More information

e - c o m p a n i o n

e - c o m p a n i o n OPERATIONS RESEARCH http://dxdoorg/0287/opre007ec e - c o m p a n o n ONLY AVAILABLE IN ELECTRONIC FORM 202 INFORMS Electronc Companon Generalzed Quantty Competton for Multple Products and Loss of Effcency

More information

Convexity preserving interpolation by splines of arbitrary degree

Convexity preserving interpolation by splines of arbitrary degree Computer Scence Journal of Moldova, vol.18, no.1(52), 2010 Convexty preservng nterpolaton by splnes of arbtrary degree Igor Verlan Abstract In the present paper an algorthm of C 2 nterpolaton of dscrete

More information

A CHARACTERIZATION OF ADDITIVE DERIVATIONS ON VON NEUMANN ALGEBRAS

A CHARACTERIZATION OF ADDITIVE DERIVATIONS ON VON NEUMANN ALGEBRAS Journal of Mathematcal Scences: Advances and Applcatons Volume 25, 2014, Pages 1-12 A CHARACTERIZATION OF ADDITIVE DERIVATIONS ON VON NEUMANN ALGEBRAS JIA JI, WEN ZHANG and XIAOFEI QI Department of Mathematcs

More information

MATH 5707 HOMEWORK 4 SOLUTIONS 2. 2 i 2p i E(X i ) + E(Xi 2 ) ä i=1. i=1

MATH 5707 HOMEWORK 4 SOLUTIONS 2. 2 i 2p i E(X i ) + E(Xi 2 ) ä i=1. i=1 MATH 5707 HOMEWORK 4 SOLUTIONS CİHAN BAHRAN 1. Let v 1,..., v n R m, all lengths v are not larger than 1. Let p 1,..., p n [0, 1] be arbtrary and set w = p 1 v 1 + + p n v n. Then there exst ε 1,..., ε

More information

3.1 Expectation of Functions of Several Random Variables. )' be a k-dimensional discrete or continuous random vector, with joint PMF p (, E X E X1 E X

3.1 Expectation of Functions of Several Random Variables. )' be a k-dimensional discrete or continuous random vector, with joint PMF p (, E X E X1 E X Statstcs 1: Probablty Theory II 37 3 EPECTATION OF SEVERAL RANDOM VARIABLES As n Probablty Theory I, the nterest n most stuatons les not on the actual dstrbuton of a random vector, but rather on a number

More information

INVARIANT STABLY COMPLEX STRUCTURES ON TOPOLOGICAL TORIC MANIFOLDS

INVARIANT STABLY COMPLEX STRUCTURES ON TOPOLOGICAL TORIC MANIFOLDS INVARIANT STABLY COMPLEX STRUCTURES ON TOPOLOGICAL TORIC MANIFOLDS HIROAKI ISHIDA Abstract We show that any (C ) n -nvarant stably complex structure on a topologcal torc manfold of dmenson 2n s ntegrable

More information

20. Mon, Oct. 13 What we have done so far corresponds roughly to Chapters 2 & 3 of Lee. Now we turn to Chapter 4. The first idea is connectedness.

20. Mon, Oct. 13 What we have done so far corresponds roughly to Chapters 2 & 3 of Lee. Now we turn to Chapter 4. The first idea is connectedness. 20. Mon, Oct. 13 What we have done so far corresponds roughly to Chapters 2 & 3 of Lee. Now we turn to Chapter 4. The frst dea s connectedness. Essentally, we want to say that a space cannot be decomposed

More information

Screen transversal conformal half-lightlike submanifolds

Screen transversal conformal half-lightlike submanifolds Annals of the Unversty of Craova, Mathematcs and Computer Scence Seres Volume 40(2), 2013, Pages 140 147 ISSN: 1223-6934 Screen transversal conformal half-lghtlke submanfolds Wenje Wang, Yanng Wang, and

More information

Some basic inequalities. Definition. Let V be a vector space over the complex numbers. An inner product is given by a function, V V C

Some basic inequalities. Definition. Let V be a vector space over the complex numbers. An inner product is given by a function, V V C Some basc nequaltes Defnton. Let V be a vector space over the complex numbers. An nner product s gven by a functon, V V C (x, y) x, y satsfyng the followng propertes (for all x V, y V and c C) (1) x +

More information

General viscosity iterative method for a sequence of quasi-nonexpansive mappings

General viscosity iterative method for a sequence of quasi-nonexpansive mappings Avalable onlne at www.tjnsa.com J. Nonlnear Sc. Appl. 9 (2016), 5672 5682 Research Artcle General vscosty teratve method for a sequence of quas-nonexpansve mappngs Cuje Zhang, Ynan Wang College of Scence,

More information

Supplement: Proofs and Technical Details for The Solution Path of the Generalized Lasso

Supplement: Proofs and Technical Details for The Solution Path of the Generalized Lasso Supplement: Proofs and Techncal Detals for The Soluton Path of the Generalzed Lasso Ryan J. Tbshran Jonathan Taylor In ths document we gve supplementary detals to the paper The Soluton Path of the Generalzed

More information

Solutions HW #2. minimize. Ax = b. Give the dual problem, and make the implicit equality constraints explicit. Solution.

Solutions HW #2. minimize. Ax = b. Give the dual problem, and make the implicit equality constraints explicit. Solution. Solutons HW #2 Dual of general LP. Fnd the dual functon of the LP mnmze subject to c T x Gx h Ax = b. Gve the dual problem, and make the mplct equalty constrants explct. Soluton. 1. The Lagrangan s L(x,

More information

Homework Notes Week 7

Homework Notes Week 7 Homework Notes Week 7 Math 4 Sprng 4 #4 (a Complete the proof n example 5 that s an nner product (the Frobenus nner product on M n n (F In the example propertes (a and (d have already been verfed so we

More information

PHYS 705: Classical Mechanics. Calculus of Variations II

PHYS 705: Classical Mechanics. Calculus of Variations II 1 PHYS 705: Classcal Mechancs Calculus of Varatons II 2 Calculus of Varatons: Generalzaton (no constrant yet) Suppose now that F depends on several dependent varables : We need to fnd such that has a statonary

More information

Foundations of Arithmetic

Foundations of Arithmetic Foundatons of Arthmetc Notaton We shall denote the sum and product of numbers n the usual notaton as a 2 + a 2 + a 3 + + a = a, a 1 a 2 a 3 a = a The notaton a b means a dvdes b,.e. ac = b where c s an

More information

NP-Completeness : Proofs

NP-Completeness : Proofs NP-Completeness : Proofs Proof Methods A method to show a decson problem Π NP-complete s as follows. (1) Show Π NP. (2) Choose an NP-complete problem Π. (3) Show Π Π. A method to show an optmzaton problem

More information

Matrix Approximation via Sampling, Subspace Embedding. 1 Solving Linear Systems Using SVD

Matrix Approximation via Sampling, Subspace Embedding. 1 Solving Linear Systems Using SVD Matrx Approxmaton va Samplng, Subspace Embeddng Lecturer: Anup Rao Scrbe: Rashth Sharma, Peng Zhang 0/01/016 1 Solvng Lnear Systems Usng SVD Two applcatons of SVD have been covered so far. Today we loo

More information

Causal Diamonds. M. Aghili, L. Bombelli, B. Pilgrim

Causal Diamonds. M. Aghili, L. Bombelli, B. Pilgrim Causal Damonds M. Aghl, L. Bombell, B. Plgrm Introducton The correcton to volume of a causal nterval due to curvature of spacetme has been done by Myrhem [] and recently by Gbbons & Solodukhn [] and later

More information

STAT 309: MATHEMATICAL COMPUTATIONS I FALL 2018 LECTURE 16

STAT 309: MATHEMATICAL COMPUTATIONS I FALL 2018 LECTURE 16 STAT 39: MATHEMATICAL COMPUTATIONS I FALL 218 LECTURE 16 1 why teratve methods f we have a lnear system Ax = b where A s very, very large but s ether sparse or structured (eg, banded, Toepltz, banded plus

More information

A Local Variational Problem of Second Order for a Class of Optimal Control Problems with Nonsmooth Objective Function

A Local Variational Problem of Second Order for a Class of Optimal Control Problems with Nonsmooth Objective Function A Local Varatonal Problem of Second Order for a Class of Optmal Control Problems wth Nonsmooth Objectve Functon Alexander P. Afanasev Insttute for Informaton Transmsson Problems, Russan Academy of Scences,

More information

Anti-van der Waerden numbers of 3-term arithmetic progressions.

Anti-van der Waerden numbers of 3-term arithmetic progressions. Ant-van der Waerden numbers of 3-term arthmetc progressons. Zhanar Berkkyzy, Alex Schulte, and Mchael Young Aprl 24, 2016 Abstract The ant-van der Waerden number, denoted by aw([n], k), s the smallest

More information

Google PageRank with Stochastic Matrix

Google PageRank with Stochastic Matrix Google PageRank wth Stochastc Matrx Md. Sharq, Puranjt Sanyal, Samk Mtra (M.Sc. Applcatons of Mathematcs) Dscrete Tme Markov Chan Let S be a countable set (usually S s a subset of Z or Z d or R or R d

More information

Uniqueness of Weak Solutions to the 3D Ginzburg- Landau Model for Superconductivity

Uniqueness of Weak Solutions to the 3D Ginzburg- Landau Model for Superconductivity Int. Journal of Math. Analyss, Vol. 6, 212, no. 22, 195-114 Unqueness of Weak Solutons to the 3D Gnzburg- Landau Model for Superconductvty Jshan Fan Department of Appled Mathematcs Nanjng Forestry Unversty

More information

The Degrees of Nilpotency of Nilpotent Derivations on the Ring of Matrices

The Degrees of Nilpotency of Nilpotent Derivations on the Ring of Matrices Internatonal Mathematcal Forum, Vol. 6, 2011, no. 15, 713-721 The Degrees of Nlpotency of Nlpotent Dervatons on the Rng of Matrces Homera Pajoohesh Department of of Mathematcs Medgar Evers College of CUNY

More information

Self-complementing permutations of k-uniform hypergraphs

Self-complementing permutations of k-uniform hypergraphs Dscrete Mathematcs Theoretcal Computer Scence DMTCS vol. 11:1, 2009, 117 124 Self-complementng permutatons of k-unform hypergraphs Artur Szymańsk A. Paweł Wojda Faculty of Appled Mathematcs, AGH Unversty

More information

NOTES FOR QUANTUM GROUPS, CRYSTAL BASES AND REALIZATION OF ŝl(n)-modules

NOTES FOR QUANTUM GROUPS, CRYSTAL BASES AND REALIZATION OF ŝl(n)-modules NOTES FOR QUANTUM GROUPS, CRYSTAL BASES AND REALIZATION OF ŝl(n)-modules EVAN WILSON Quantum groups Consder the Le algebra sl(n), whch s the Le algebra over C of n n trace matrces together wth the commutator

More information

DISCRIMINANTS AND RAMIFIED PRIMES. 1. Introduction A prime number p is said to be ramified in a number field K if the prime ideal factorization

DISCRIMINANTS AND RAMIFIED PRIMES. 1. Introduction A prime number p is said to be ramified in a number field K if the prime ideal factorization DISCRIMINANTS AND RAMIFIED PRIMES KEITH CONRAD 1. Introducton A prme number p s sad to be ramfed n a number feld K f the prme deal factorzaton (1.1) (p) = po K = p e 1 1 peg g has some e greater than 1.

More information

C/CS/Phy191 Problem Set 3 Solutions Out: Oct 1, 2008., where ( 00. ), so the overall state of the system is ) ( ( ( ( 00 ± 11 ), Φ ± = 1

C/CS/Phy191 Problem Set 3 Solutions Out: Oct 1, 2008., where ( 00. ), so the overall state of the system is ) ( ( ( ( 00 ± 11 ), Φ ± = 1 C/CS/Phy9 Problem Set 3 Solutons Out: Oct, 8 Suppose you have two qubts n some arbtrary entangled state ψ You apply the teleportaton protocol to each of the qubts separately What s the resultng state obtaned

More information

Solutions to the 71st William Lowell Putnam Mathematical Competition Saturday, December 4, 2010

Solutions to the 71st William Lowell Putnam Mathematical Competition Saturday, December 4, 2010 Solutons to the 7st Wllam Lowell Putnam Mathematcal Competton Saturday, December 4, 2 Kran Kedlaya and Lenny Ng A The largest such k s n+ 2 n 2. For n even, ths value s acheved by the partton {,n},{2,n

More information

Projective change between two Special (α, β)- Finsler Metrics

Projective change between two Special (α, β)- Finsler Metrics Internatonal Journal of Trend n Research and Development, Volume 2(6), ISSN 2394-9333 www.jtrd.com Projectve change between two Specal (, β)- Fnsler Metrcs Gayathr.K 1 and Narasmhamurthy.S.K 2 1 Assstant

More information

Mathematical Preparations

Mathematical Preparations 1 Introducton Mathematcal Preparatons The theory of relatvty was developed to explan experments whch studed the propagaton of electromagnetc radaton n movng coordnate systems. Wthn expermental error the

More information