Genericity of Critical Types

Size: px
Start display at page:

Download "Genericity of Critical Types"

Transcription

1 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 t has common-p belef on some closed, proper subset of the unversal type space. Thus, all types ever consdered n applcatons are crtcal. On the other hand, Ely and Pesk 2008 show that the crtcal types form a meager subset of the unversal type space under the product topology. We propose two ways to resolve ths puzzle by provng two genercty results for crtcal types. Frst, under the strategc topology due to Dekel, Fudenberg, and Morrs, 2006, Theoretcal Economcs , the set of crtcal types s open and dense n the unversal type space. Second, geometrcally, the set of crtcal types s prevalent.e. the complement of a fntely shy set. 1

2 1 Introducton Ely and Pesk 2008 offer a very clean characterzaton of crtcal types: a type s crtcal f and only f t has common-p belef on some proper closed subset of the unversal type space. Consequently, all type spaces ever consdered n applcatons conssts entrely of crtcal types. However, they also offer a puzzlng result that crtcal types are non-generc,.e., they form a meager set n the unversal type space under the product topology. We propose two ways to resolve ths puzzle by provng two genercty results for crtcal types. Frst, under the stronger strategc topology due to Dekel, Fudenberg, and Morrs, 2006, Theoretcal Economcs , crtcal types s open and dense n the unversal type space. Second, f we dentfy the set of types wth Ω U Ω under the standard Mertens-Zamr homeomorphsm, the set of regular types.e., the complement of crtcal types form a proper face n Ω U Ω and hence t s fntely shy. 2 Prelmnares Let d denote the product metrc on the unversal type space. For any set W U Ω, denote the ε-open ball contanng W under the product topology by W ε,.e., W ε := {t U Ω : d t, t < ε for some t W }. Defnton 1 Common belef convergence A sequence of types u n n=1 converges to a type u n common-p belef f for any p > 0 and any closed proper subset W U Ω wth u C p W and any ε 0, p, there exsts a postve nteger N such that u n C p ε W ε for any n N. 3 The Frst Genercty Result In ths secton, we prove crtcal types are generc n a topologcal sense. 2

3 Theorem 1 Under the strategc topology, crtcal types contan an open and dense subset of the unversal type space. By Theorem 4 of Dekel, Fudenberg, and Morrs 2006, fnte types are dense n the unversal type space under the strategc topology. Snce fnte types are crtcal by Theorem 3 of Ely and Pesk 2008, crtcal types are dense under the strategc topology. Therefore, Theorem 1 s a drect consequence of the followng Proposton. Proposton 1 The strategc closure of regular types contans no fnte types. To prove Proposton 1, we need the followng Proposton, whose proof s relegated to Appendx 1. Proposton 2 u n n=1 converges to u under the strategc topology only f u n n=1 converges to u n common-p belef. Proof of Proposton 1. Suppose nstead that a sequence of regular types u n n=1 converges to a fnte type u under the strategc topology. Snce u s a fnte type, u C p W for a fnte set W U Ω. Moreover, snce u n n=1 converges to u under the strategc topology, u n n=1 also converges to u n common-p belef by Proposton 2. Snce W s fnte, for suffcently small ε > 0, the product closure of W ε, denoted by W ε, s stll a proper closed subset of U Ω, and moreover, p ε > 0. Snce u n n=1 convergng to u n common-p belef, by Defnton 1, there exsts a postve nteger N such that u n C p ε W ε. Hence, u n s a crtcal type for all n N by Ely and Pesk 2008, whch contradcts to the assumpton that u n s regular for all n. Remark. Our proof s stll vald f we consder the soluton concept of IIR nstead of ICR. 4 The Second Genercty Result In the secton, we prove that the set of crtcal types, vewed as a subset of Ω U Ω under the standard Mertens-Zamr homeomorphsm, s generc n a geometrc sense,.e., t 3

4 s prevalent. Throughout ths secton, for any two types u, u U Ω and α 0, 1, defne αu + 1 α u π 1 απ u + 1 α π u ] where π s the Mertens-Zamr homeomorphsm between U Ω and Ω U Ω. Hence, αu + 1 α u U Ω. The followng proposton shows that crtcal types form a proper face n the unversal types space. Proposton 3 For any α 0, 1, u regular. = αu + 1 α u s regular ff both u and u are Proof. We prove frst the only f part. Suppose u s crtcal. By Theorem 3 of Ely and Pesk 2008, u C p W for some closed proper subset W U Ω. By Lemma 6 of Ely and Pesk 2008, C p W = W B p Cp W U Ω. Hence, u W {u } B p Cp W {u } U Ω where p = mn {p, α}. By Lemma 6 of Ely and Pesk 2008, u C p W {u }. Snce W {u } s a proper closed subset of U Ω, u s crtcal by Theorem 3 of Ely and Pesk We then turn to show the f part. Suppose that u s crtcal. Then, By Theorem 3 of Ely and Pesk 2008, u C p W for some closed proper subset W U Ω. By Lemma 6 of Ely and Pesk 2008, C p W = W B p Cp W U Ω. Snce u = αu + 1 α u, ether u B p Cp W U Ω or u B p Cp W U Ω. Hence, by Lemma 6 of Ely and Pesk 2008, ether u or u s crtcal. Theorem 2 The set of crtcal types s prevalent. Proof. Ths s a drect consequence of our Proposton 3 and Hefetz and Neeman 2006 s Lemma 1. 4

5 A Appendx A.1 Proof of Proposton 2 Proof. Suppose that u n n=1 does not converge to u n common-p belef. Then, there exsts a W U Ω wth u C p such that u n W and some ε > 0 such that there s a subsequence, say tself, / C p ε W ε for all n. We wll show that u n n=1 does not converge to u under strategc topology. Snce W ε s open, U Ω \W ε s closed and obvously also nonempty. Snce W and U Ω \W ε are two dsjont nonempty closed subset of U Ω, by Lemma 3, there exst γ > 0 and a game G = A =1,2, g =1,2 such that propertes 1 3 n Lemma 3 are satsfed. Defne G n the same way as defned n the proof of Lemma 2 of Ely and Pesk Defne the followng set of herarches V = { u : A 0 A 1 u R u G, 0 } ; V γ = { u : A 0 A 1 u R u G, γ = }. By the property 3 of Lemma 3, W V V γ W ε. Let Z = A 0 A 1 {1}. By the proof of Lemma 2 of Ely and Pesk 2008, 1. If u C p V, then Z R u G, 0 ; 2. If u / C p 2γ1 p V γ, then Z R u G, γ =. Note that γ can be chosen to be small so that 2γ 1 p < ε wthout losng property 3 of Lemma 3. Snce u n / C p ε W ε for all n and V γ W ε, u n / C p 2γ1 p V γ. Therefore, u n n=1 does not converge to u under strategc topology. A.2 Proof of Lemma 3 Lemma 1 Suppose that v u. There are open neghborhoods V v and U u, game G = A j, g j, acton a A, ε > 0 and m such that a R m u G, 0 for all u U and a / R m v G, ε for all v V. 5

6 Proof. Snce v u, by Lemma 17 of Ely and Pesk 2008, there s a game G, an acton a, ε > 0, and some postve nteger m such that a R m u G, 0 and a / R m v G, ε. By Lemma 16 of Ely and Pesk 2008, there s some open neghborhoods V v and U u such that a R m u G, ε/3 for all u U and a / R m v G, 2ε/3 for all v V. Then, by Lemma 4 of?, there s a game G = A j, g j and an acton a A such that a R m u G, 0 for all u U and a / R m v G, ε/3 for all v V. Lemma 2 Suppose that v u. There are ε > 0, open neghborhoods V v and U u, a game G = A j, g j such that A = A 0 A 1 and 1. For any a A, any a 1 A 1 and any a 0, a 0 A 0, any ω, g a, a 0, a 1, ω = g a, a 0, a 1, ω. 2. There are correspondence A 0 : U Ω A 0, A 1 : U Ω A 1 such that for all u, R u G, 0 = A 0 u A 1 u. 3. There s an acton a 0 A 0 such that { } a 0 A 1 u R u G, 0 for all u U ; { } a 0 A 1 v R v G, 0 = for all v V. Proof. Ths follows from the proof of Lemma 19 of?. Lemma 3 Fx player. Let W and W be nonempty closed subsets of U Ω such that W W =, there are ε > 0 and a game G = A j, g j such that A = A 0 A 1 and 1. For any a A, any a 1 A 1 and any a 0, a 0 A 0, any ω, g a, a 0, a 1, ω = g a, a 0, a 1, ω. 2. There are correspondence A 0 : U Ω A 0, A 1 : U Ω A 1 such that for all u, R u G, 0 = A 0 u A 1 u. 6

7 3. There s a nonempty subset A 0 A 0 such that A 0 A 1 u R u G, 0 for all u W ; A 0 A 1 v R v G, ε = for all v W Proof. Frst, fx u W. Snce W s an closed set and W W =, by Lemma 2, for every v W, there are ε > 0, open neghborhoods V v v and U u u, a game G v = A v j, gv j such that A v = A v 0 A v 1 and an acton a v 0 propertes 1 3 n Lemma 2 are satsfed. Snce V v v W s an open cover of W, there s a fnte subcover V v1,...v vk of W. Let U 1,..., U K be the correspondng open neghborhoods of u, G v1,..., G v K be the correspondng games for u and v k, k = 1,..., K, respectvely, and a v1 0,..., a vk 0 be the correspondng actons n property 3 of Lemma 2. Let G u be the product game of G v1,..., G v K. Defne { } A u 0 = a v1 0,..., a vk 0. Let U u K k=1 U k. Then, propertes 1 and 2 are satsfed for G u and A 0 A 1 u R u G u, 0 for all u U u ; A u 0 A 1 v R v G, 0 = for all v W. Snce U u s an open cover of W, there s a fnte subcover U u W u1,..., U W. Let G be the product game of G u1 u,..., G K. Let A 0 { } a 0 A 0 : a 0k A uk 0, a 0 A 0 u for some u. u K of We can verfy that A 0 has the desred propertes. A.3 An Alternatve Proof of Proposton 2 We prove the contra-postve statement of Proposton 2: f t n n=1 does not converge to t n common-p belef, then t n n=1 does not converge to t under the strategc topology. Suppose t n n=1 does not converge to t n common-p belef,.e., there exsts a productclosed E T wth t C p E and some ε > 0, but there s a subsequence t nk k=1 such that t nk / C p E ε for all k. For notatonal ease, we use t k to denote t nk. 7

8 We wll show that t k k=1 does not converge to t under strategc topology, whch proves that t n n=1 does not converge to t under the strategc topology. To prove Proposton 2, we need the followng proposton 1, whose proof s relegated to Appendx A.4. Proposton 4 For any two dsjont non-empty closed sets U, V T, there exst γ > 0 and a game  Ĝ =, ĝ =1,2 such that f an acton â  s 0 ratonalzable for =1,2 some t U, then â s not γ ratonalzable for t V. Snce E ε s open, ts complement denoted by E ε C s closed. Then E and E ε C are two dsjont non-empty closed sets. By Lemma??, there exst γ > 0 and a game Ĝ = Â, ĝ =1,2 such that f an acton â  s 0 ratonalzable for some =1,2 t E, then â s not γ ratonalzable for t E ε C. Defne E γ := Defne a new game G = a = â, z, â, z ], we have Λ = t E R t, Ĝ, 0 ; {t : R t, Ĝ, γ Λ }. A =1,2, g =1,2 such that A 1, f z = z = 1; g a p, θ = ĝ â, â, θ + 1 p, f z = 1 and z = 0; 0, f z = 0. =  {0, 1} and for 1, f z = z = 1 and â Λ; g a p, θ = ĝ â, â, θ + 1 p, f z = 1 and â / Λ or z = 0; 0, f z = 0. Just lke the proof n Ely and Pesk 2008, we can show that 1 Proposton 4 s a stronger verson of DFM s lemma 4, whch says that for any two dstnct types t and s, there exst γ > 0 and a game  Ĝ =, ĝ =1,2 such that f an acton â  s 0 ratonalzable =1,2 for some t, then â s not γ ratonalzable for s. 8

9 ] 1. If t C p E, then  {1} R t, G, 0 ; 2. If t / C p E γ, then ]  {1} R t, G, γ =. Note that E γ E ε, because for any â  beng 0 ratonalzable for some t E s not γ ratonalzable for t E ε C. Recall that t C p E and t k / C p E ε for all k. Hence, t k / C p E γ for all k. Thus, ]  {1} R t, G, 0 ; ]  {1} R t k, G, γ = for all k. Therefore, t k k=1 does not converge to t under strategc topology. A.4 The proof of Proposton 4 Proposton 4 s an mmedate consequence of the followng two lemmas. For the ease of exposton, we relegate the proofs of these lemmas to Appendx A.4 and A.4. For any E T, defne T k,e as T k,e := {t T : π k t = π k t for some t E}. Lemma 4 For any two dsjont closed sets U, V T, there exsts some postve nteger k such that U k and V k are two dsjont closed sets n T k. Lemma 5 For any postve nteger k and two dsjont non-empty closed sets W, Z T k, there exst γ > 0 and a game  Ĝ =, ĝ =1,2 such that f an acton â  s =1,2 0 ratonalzable for some t wth π k t W, then â s not γ ratonalzable for any t wth π k t Z. 9

10 The proof of Lemma 4 are close for any k. Frst, clearly, f U, V T are closed, the two sets U k, V k T k Second, for any E T, defne T k,e as T k,e := {t T : π k t = π k t for some t E}. We prove the followng clam. Clam 1 For any close E T, k=1 T k,e = E. Proof. Frst, we show that k=1 T k,{t} = {t}. Apparently, k=1 T k,{t} {t}. Also, k=1 T k,{t} {t}. Suppose not,.e. there s t k=1 T k,{t}, but t t. Snce t t, π k t π k t for some k, whch contradcts to t T k,{t}. Therefore, k=1 T k,{t} {t}. Second, by coherence, T 1,E T 2,E T 3,E... T k,e... E. Thus, k=1 T k,e E. Thrd, we show that k=1 T k,e E. Pck any t k=1 T k,e. Note, T k,{t} E s closed, compact and non-empty 2. Thus, k=1 Tk,{t} E ] k=1 T k,{t} = {t}. Therefore, k=1 Tk,{t} E ] = {t} and {t} = k=1 Tk,{t} E ] E. Second, we prove the followng clam. Clam 2 For any two dsjont closed sets U, V T, there exsts some postve nteger k such that T k,u and T k,v are dsjont. Proof. suppose otherwse,.e., T k,u Tk,V for all k. Hence, Then, ] T k,u Tk,V = k Z + k Z + T k,u k Z + T k,v T k,u Tk,V ]. k Z + = U V, 1 where the last equalty follows from Clam 1 and the fact that U and V are closed. 1 contradcts the the assumpton that U and V are dsjont. Thrd, note that T k,u ] k = U k and T k,v ] k = V k. Therefore, Lemma 4 s true. 2 Consder the product toplogy on T. The functon γ : T π k T such that γt = π k t s contnuous. Hence, T k,{t} s closed. Also, t s compact because T s compact. 10

11 The proof of Lemma 5 Followng DFM, we use quadratc scorng rule to elct type s k-th order belef. In ths scorng rule game  Ĝ =, ĝ =1,2, the acton set s  = B 1... B k T 1... T k, where T k set of fnte dscrete grds n T k. Note that B k B k 1. =1,2 s the space of k-th order belef and B k s a For any type t, let b 1 t,..., b k t ] denote an arbtrary 0-ratonalzable strategy for t, where b 1 t,..., b k t correspond to the 1st,..., the k-th order belefs respectvely. Let t k denote t s true k-th belef. We say b k t s t s k-th reportng belef. We defne t s k-th nduced belef, I k t as follows. I k t E] = t {t : b k 1 t E} ] for E T k 1. Wth the quadratc scorng rule, the players 0-ratonalzable strategy s to truthfully report ther belefs subject measurement errors due to fnte grds,.e., they chooses b k t to be the grd whch s mostly closed to I k t. To defne Ĝ, we only need to defne the grds of Â. We wll show that the grds can be approxmately chosen so that Lemma 5 s true. We establsh ths by the followng three steps. Step 1 For any k and δ > 0, we can choose the grds so that ρ k t k, b k t ] < δ and ρ k t k, I k t ] < δ. Step 2 There exsts a game Ĝ =  =1,2, ĝ =1,2 such that f an acton â  s 0 ratonalzable for some t wth π k t W, then â s not 0 ratonalzable for any t wth π k t Z. Step 3 There exsts γ > 0 such that n Ĝ, f an acton â  s 0 ratonalzable for some t wth π k t W, then â s not 0 ratonalzable for any t wth π k t Z. Gven Step 1 and 2, the proof of Step 3: The Ĝ n Step 2 s a quadratc scorng rule on the frst k order belefs, where k s the one n Step 1. Hence, the ICR actons n ths game s determned only by the frst k order belefs,.e., R s, Ĝ, ε = R s, k Ĝ, ε and h k s â, Ĝ = h s â, Ĝ for any s T, 11

12 â Â and ε 0. By Ely-Pesk Lemma 16, h k s â, Ĝ s a contnuous functon n s. Hence h s â, Ĝ s a contnuous functon n s too. Consder L = {s T : π k s W} R s, Ĝ, 0 Â, whch s fnte. For any â L, h s â, Ĝ > 0 for any s wth π k s Z by Step 2. Snce Z s closed hence compact and h s â, Ĝ s contnuous, there exsts γ ba > 0 such that h s â, Ĝ > γ ba for any s wth π k s Z. Let γ = mn {γ ba : â L}. Snce L s fnte and γ ba > 0 for any â L and L s fnte, we have γ > 0. Further h s â, Ĝ > γ for any s wth π k s Z and any â L. Therefore, Step 3 holds. Gven Step 1, the proof of Step 2: Snce W and Z are closed, there s 3δ > 0 such that ρ k t k, t k] > 4δ for any two types t, t wth π k t W and π k t Z. We can choose the scorng rule wth the grd A = B 1... B k 1 such that ρ k s k, I k s ] < δ for any s T. Hence, any two types t, t wth π k t W and π k t Z, ρ k I k t, I k t ] ρ k t k, I k t ] ρ k t k, I k t ] ρ k t k, t k] ρ k I k t, t k] ρ k t k, I k t ] > 3δ δ δ > δ. Let B k {0, 1 q 1,...,, q q 1} Bk 1. Choose q such that 1 < δ. q 4 B k 1 Snce ρ k I k t, I k t ] > δ, there s some E T k 1, I k t E] > I k t I k t E] + δ. Hence, I k t E B k 1] > I k t E B k 1] + δ. E] δ] + δ Then, there s some b E B k 1] such that I k t b] > I k t δ b] + E B k 1 Ik t b] + δ. Snce 1 < δ, t and B k 1 q 4 B k 1 t must report dfferent grds. Therefore, any 0-ratonalzable grd for t can not be 0-ratonalzable for t. 12

13 The proof of Step 1: We prove ths by nducton. Frst, consder k = 1. Let B 1 {0, 1 n 1,...,, 1} {0, 1 n 1,...,, 1}. Choose n such n n n n that 1 < δ. Hence, for any two adjacent grds b, n b B 1, ρ 1 b, b < δ. Because of the quadratc scorng rule, a type t report b 1 t as the most closed grd to t 1. Clearly, ρ 1 t 1, b 1 t < δ. We show that ρ 2 t 2, I 2 t ] < δ. For any E T k 1, I 2 t E] = I 2 t E B 1] = t {t : b 1 t E B 1 } ] t {t : t E B 1] δ } ] ] t {t : t E] δ } < t E] δ] + δ, where the frst nequalty follows from ρ 1 t 1, b 1 t < δ, hence {t : b 1 t E B 1 } E B 1 ] δ. Therefore, ρ 2 t 2, I 2 t ] < δ. Suppose ρ k 1 t k 1, b k 1 t ] < δ for a general k. We show that ρ k t k, I k t ] < δ. For any E T k 1, I k t E] = I k t E B k 1] = t {t : b k 1 t E B k 1 } ] t {t : t E B k 1] ] δ } ] t {t : t E] δ } < t E] δ] + δ, where the frst nequalty follows from ρ k 1 t k 1, b k 1 t ] < δ, hence {t : b k 1 t E B k 1 } E B k 1] δ. Therefore, ρ k t k, I k t ] < δ. Suppose ρ k t k, I k t ] < δ for a general k. We show ρ k t k, b k t ] < δ. Let B k {0, 1 h 1,...,, h h 1} Bk 1. Choose h such that 1 < δ. Hence, for any two h B k 1 13

14 adjacent grds b, b B k, ρ k b, b < δ. We show ρ k t k, b k t ] < δ. For any E T k 1, b k t E] = b k t E B k 1] t {t : b k 1 t E B k 1 } ] + δ E B k 1 B k 1 t {t : t E B k 1] ] δ } + δ t E] δ] + δ, where the frst nequalty follows because b k t s chosen as the closed grd to t k. Therefore, ρ k t k, b k t ] < δ. References Dekel, E., D. Fudenberg, and S. Morrs 2006: Topologes on Types, Theoretcal Economcs, 1, Ely, J. C., and M. Pesk 2008: Crtcal Types, mmeo., Northwestern Unversty. 14

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

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

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

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

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

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

Topologies on Types: Connections

Topologies on Types: Connections Topologes on Types: Connectons Y-Chun Chen y Syang Xong z May 28, 2008 Abstract For d erent purposes, economsts may use d erent topologes on types. We characterze the relatonshp among these varous topologes.

More information

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

Hierarchies of Beliefs and the Belief-invariant. Bayesian Solution

Hierarchies of Beliefs and the Belief-invariant. Bayesian Solution Herarches of Belefs and the Belef-nvarant Bayesan Soluton Qanfeng Tang March 26, 2015 Abstract The belef-nvarant Bayesan soluton s a noton of correlated equlbrum n games wth ncomplete nformaton proposed

More information

EXPANSIVE MAPPINGS. by W. R. Utz

EXPANSIVE MAPPINGS. by W. R. Utz Volume 3, 978 Pages 6 http://topology.auburn.edu/tp/ EXPANSIVE MAPPINGS by W. R. Utz Topology Proceedngs Web: http://topology.auburn.edu/tp/ Mal: Topology Proceedngs Department of Mathematcs & Statstcs

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

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

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

HIERARCHIES OF BELIEF AND INTERIM RATIONALIZABILITY

HIERARCHIES OF BELIEF AND INTERIM RATIONALIZABILITY HIERARCHIES OF BELIEF AND INTERIM RATIONALIZABILITY JEFFREY C. ELY AND MARCIN PESKI Abstract. In games wth ncomplete nformaton, conventonal herarches of belef are ncomplete as descrptons of the players

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

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

Critical Types. September 24, Abstract

Critical Types. September 24, Abstract Crtcal Types Jeffrey C. Ely Marcn Pesk September 24, 2010 Abstract How can we know n advance whether smplfyng assumptons about belefs wll make a dfference n the conclusons of game-theoretc models? We defne

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

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

where a is any ideal of R. Lemma 5.4. Let R be a ring. Then X = Spec R is a topological space Moreover the open sets

where a is any ideal of R. Lemma 5.4. Let R be a ring. Then X = Spec R is a topological space Moreover the open sets 5. Schemes To defne schemes, just as wth algebrac varetes, the dea s to frst defne what an affne scheme s, and then realse an arbtrary scheme, as somethng whch s locally an affne scheme. The defnton of

More information

Hierarchies of belief and interim rationalizability

Hierarchies of belief and interim rationalizability Theoretcal Economcs 1 (2006), 19 65 1555-7561/20060019 Herarches of belef and nterm ratonalzablty JEFFREY C. ELY Department of Economcs, Northwestern Unversty MARCIN PESKI Department of Economcs, Unversty

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

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

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

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

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

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

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

Introductory Cardinality Theory Alan Kaylor Cline

Introductory Cardinality Theory Alan Kaylor Cline Introductory Cardnalty Theory lan Kaylor Clne lthough by name the theory of set cardnalty may seem to be an offshoot of combnatorcs, the central nterest s actually nfnte sets. Combnatorcs deals wth fnte

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

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

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

Edge Isoperimetric Inequalities

Edge Isoperimetric Inequalities November 7, 2005 Ross M. Rchardson Edge Isopermetrc Inequaltes 1 Four Questons Recall that n the last lecture we looked at the problem of sopermetrc nequaltes n the hypercube, Q n. Our noton of boundary

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

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

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

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

ALGEBRA HW 7 CLAY SHONKWILER

ALGEBRA HW 7 CLAY SHONKWILER ALGEBRA HW 7 CLAY SHONKWILER 1 Whch of the followng rngs R are dscrete valuaton rngs? For those that are, fnd the fracton feld K = frac R, the resdue feld k = R/m (where m) s the maxmal deal), and a unformzer

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

ON SEPARATING SETS OF WORDS IV

ON SEPARATING SETS OF WORDS IV ON SEPARATING SETS OF WORDS IV V. FLAŠKA, T. KEPKA AND J. KORTELAINEN Abstract. Further propertes of transtve closures of specal replacement relatons n free monods are studed. 1. Introducton Ths artcle

More information

2 More examples with details

2 More examples with details Physcs 129b Lecture 3 Caltech, 01/15/19 2 More examples wth detals 2.3 The permutaton group n = 4 S 4 contans 4! = 24 elements. One s the dentty e. Sx of them are exchange of two objects (, j) ( to j and

More information

On the Operation A in Analysis Situs. by Kazimierz Kuratowski

On the Operation A in Analysis Situs. by Kazimierz Kuratowski v1.3 10/17 On the Operaton A n Analyss Stus by Kazmerz Kuratowsk Author s note. Ths paper s the frst part slghtly modfed of my thess presented May 12, 1920 at the Unversty of Warsaw for the degree of Doctor

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

(1 ) (1 ) 0 (1 ) (1 ) 0

(1 ) (1 ) 0 (1 ) (1 ) 0 Appendx A Appendx A contans proofs for resubmsson "Contractng Informaton Securty n the Presence of Double oral Hazard" Proof of Lemma 1: Assume that, to the contrary, BS efforts are achevable under a blateral

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

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

A FIXED POINT THEOREM FOR THE PSEUDO-CIRCLE

A FIXED POINT THEOREM FOR THE PSEUDO-CIRCLE A FIXED POINT THEOREM FOR THE PSEUDO-CIRCLE J. P. BOROŃSKI Abstract. Let f : C C be a self-map of the pseudo-crcle C. Suppose that C s embedded nto an annulus A, so that t separates the two components

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

COMPLEX NUMBERS AND QUADRATIC EQUATIONS

COMPLEX NUMBERS AND QUADRATIC EQUATIONS COMPLEX NUMBERS AND QUADRATIC EQUATIONS INTRODUCTION We know that x 0 for all x R e the square of a real number (whether postve, negatve or ero) s non-negatve Hence the equatons x, x, x + 7 0 etc are not

More information

2 MADALINA ROXANA BUNECI subset G (2) G G (called the set of composable pars), and two maps: h (x y)! xy : G (2)! G (product map) x! x ;1 [: G! G] (nv

2 MADALINA ROXANA BUNECI subset G (2) G G (called the set of composable pars), and two maps: h (x y)! xy : G (2)! G (product map) x! x ;1 [: G! G] (nv An applcaton of Mackey's selecton lemma Madalna Roxana Bunec Abstract. Let G be a locally compact second countable groupod. Let F be a subset of G (0) meetng each orbt exactly once. Let us denote by df

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

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

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

اولت ارص من نوع -c. الخلاصة رنا بهجت اسماعیل مجلة ابن الهیثم للعلوم الصرفة والتطبیقیة المجلد 22 (3) 2009

اولت ارص من نوع -c. الخلاصة رنا بهجت اسماعیل مجلة ابن الهیثم للعلوم الصرفة والتطبیقیة المجلد 22 (3) 2009 مجلة ابن الهیثم للعلوم الصرفة والتطبیقیة المجلد 22 (3) 2009 الت ارص من نوع -C- - جامعة بغداد رنا بهجت اسماعیل قسم الریاضیات - كلیة التربیة- ابن الهیثم الخلاصة قمنا في هذا البحث بتعریف نوع جدید من الت ارص

More information

and problem sheet 2

and problem sheet 2 -8 and 5-5 problem sheet Solutons to the followng seven exercses and optonal bonus problem are to be submtted through gradescope by :0PM on Wednesday th September 08. There are also some practce problems,

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

Fixed points of IA-endomorphisms of a free metabelian Lie algebra

Fixed points of IA-endomorphisms of a free metabelian Lie algebra Proc. Indan Acad. Sc. (Math. Sc.) Vol. 121, No. 4, November 2011, pp. 405 416. c Indan Academy of Scences Fxed ponts of IA-endomorphsms of a free metabelan Le algebra NAIME EKICI 1 and DEMET PARLAK SÖNMEZ

More information

THE CHVÁTAL-ERDŐS CONDITION AND 2-FACTORS WITH A SPECIFIED NUMBER OF COMPONENTS

THE CHVÁTAL-ERDŐS CONDITION AND 2-FACTORS WITH A SPECIFIED NUMBER OF COMPONENTS Dscussones Mathematcae Graph Theory 27 (2007) 401 407 THE CHVÁTAL-ERDŐS CONDITION AND 2-FACTORS WITH A SPECIFIED NUMBER OF COMPONENTS Guantao Chen Department of Mathematcs and Statstcs Georga State Unversty,

More information

The Multiple Classical Linear Regression Model (CLRM): Specification and Assumptions. 1. Introduction

The Multiple Classical Linear Regression Model (CLRM): Specification and Assumptions. 1. Introduction ECONOMICS 5* -- NOTE (Summary) ECON 5* -- NOTE The Multple Classcal Lnear Regresson Model (CLRM): Specfcaton and Assumptons. Introducton CLRM stands for the Classcal Lnear Regresson Model. The CLRM s also

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

n ). This is tight for all admissible values of t, k and n. k t + + n t

n ). This is tight for all admissible values of t, k and n. k t + + n t MAXIMIZING THE NUMBER OF NONNEGATIVE SUBSETS NOGA ALON, HAROUT AYDINIAN, AND HAO HUANG Abstract. Gven a set of n real numbers, f the sum of elements of every subset of sze larger than k s negatve, what

More information

Errata to Invariant Theory with Applications January 28, 2017

Errata to Invariant Theory with Applications January 28, 2017 Invarant Theory wth Applcatons Jan Drasma and Don Gjswjt http: //www.wn.tue.nl/~jdrasma/teachng/nvtheory0910/lecturenotes12.pdf verson of 7 December 2009 Errata and addenda by Darj Grnberg The followng

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

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

where a is any ideal of R. Lemma Let R be a ring. Then X = Spec R is a topological space. Moreover the open sets

where a is any ideal of R. Lemma Let R be a ring. Then X = Spec R is a topological space. Moreover the open sets 11. Schemes To defne schemes, just as wth algebrac varetes, the dea s to frst defne what an affne scheme s, and then realse an arbtrary scheme, as somethng whch s locally an affne scheme. The defnton of

More information

On the smoothness and the totally strong properties for nearness frames

On the smoothness and the totally strong properties for nearness frames Int. Sc. Technol. J. Namba Vol 1, Issue 1, 2013 On the smoothness and the totally strong propertes for nearness frames Martn. M. Mugoch Department of Mathematcs, Unversty of Namba 340 Mandume Ndemufayo

More information

Subjective Uncertainty Over Behavior Strategies: A Correction

Subjective Uncertainty Over Behavior Strategies: A Correction Subjectve Uncertanty Over Behavor Strateges: A Correcton The Harvard communty has made ths artcle openly avalable. Please share how ths access benefts you. Your story matters. Ctaton Publshed Verson Accessed

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

CMS-EMS Center for Mathematical Studies in Economics And Management Science. Discussion Paper #1586

CMS-EMS Center for Mathematical Studies in Economics And Management Science. Discussion Paper #1586 CMS-EMS Center for Mathematcal Studes n Economcs And Management Scence Dscusson Paper #1586 "When Do Types Induce the Same Belef Herarchy?" Andres Perea and Wllemen Kets Northwestern Unversty December

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

Case Study of Markov Chains Ray-Knight Compactification

Case Study of Markov Chains Ray-Knight Compactification Internatonal Journal of Contemporary Mathematcal Scences Vol. 9, 24, no. 6, 753-76 HIKAI Ltd, www.m-har.com http://dx.do.org/.2988/cms.24.46 Case Study of Marov Chans ay-knght Compactfcaton HaXa Du and

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

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

A Simple Research of Divisor Graphs

A Simple Research of Divisor Graphs The 29th Workshop on Combnatoral Mathematcs and Computaton Theory A Smple Research o Dvsor Graphs Yu-png Tsao General Educaton Center Chna Unversty o Technology Tape Tawan yp-tsao@cuteedutw Tape Tawan

More information

THE ORNSTEIN-WEISS LEMMA FOR DISCRETE AMENABLE GROUPS.

THE ORNSTEIN-WEISS LEMMA FOR DISCRETE AMENABLE GROUPS. THE ORNSTEIN-WEISS LEMMA FOR DISCRETE AMENABLE GROUPS FABRICE KRIEGER Abstract In ths note we prove a convergence theorem for nvarant subaddtve functons defned on the fnte subsets of a dscrete amenable

More information

On the set of natural numbers

On the set of natural numbers On the set of natural numbers by Jalton C. Ferrera Copyrght 2001 Jalton da Costa Ferrera Introducton The natural numbers have been understood as fnte numbers, ths wor tres to show that the natural numbers

More information

CONVERGENCE OF A GENERALIZED MIDPOINT ITERATION

CONVERGENCE OF A GENERALIZED MIDPOINT ITERATION CONVERGENCE OF A GENERALIZED MIDPOINT ITERATION JARED ABLE, DANIEL BRADLEY, ALVIN MOON, AND XINGPING SUN Abstract. We gve an analytc proof for the Hausdorff convergence of the mdpont or derved polygon

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

ALGEBRA MID-TERM. 1 Suppose I is a principal ideal of the integral domain R. Prove that the R-module I R I has no non-zero torsion elements.

ALGEBRA MID-TERM. 1 Suppose I is a principal ideal of the integral domain R. Prove that the R-module I R I has no non-zero torsion elements. ALGEBRA MID-TERM CLAY SHONKWILER 1 Suppose I s a prncpal deal of the ntegral doman R. Prove that the R-module I R I has no non-zero torson elements. Proof. Note, frst, that f I R I has no non-zero torson

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

THE CHINESE REMAINDER THEOREM. We should thank the Chinese for their wonderful remainder theorem. Glenn Stevens

THE CHINESE REMAINDER THEOREM. We should thank the Chinese for their wonderful remainder theorem. Glenn Stevens THE CHINESE REMAINDER THEOREM KEITH CONRAD We should thank the Chnese for ther wonderful remander theorem. Glenn Stevens 1. Introducton The Chnese remander theorem says we can unquely solve any par of

More information

Expected Value and Variance

Expected Value and Variance MATH 38 Expected Value and Varance Dr. Neal, WKU We now shall dscuss how to fnd the average and standard devaton of a random varable X. Expected Value Defnton. The expected value (or average value, or

More information

Counterexamples to the Connectivity Conjecture of the Mixed Cells

Counterexamples to the Connectivity Conjecture of the Mixed Cells Dscrete Comput Geom 2:55 52 998 Dscrete & Computatonal Geometry 998 Sprnger-Verlag New York Inc. Counterexamples to the Connectvty Conjecture of the Mxed Cells T. Y. L and X. Wang 2 Department of Mathematcs

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

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

ON THE JACOBIAN CONJECTURE

ON THE JACOBIAN CONJECTURE v v v Far East Journal of Mathematcal Scences (FJMS) 17 Pushpa Publshng House, Allahabad, Inda http://www.pphm.com http://dx.do.org/1.17654/ms1111565 Volume 11, Number 11, 17, Pages 565-574 ISSN: 97-871

More information

q-entropy FOR SYMBOLIC DYNAMICAL SYSTEMS 1. Introduction.

q-entropy FOR SYMBOLIC DYNAMICAL SYSTEMS 1. Introduction. q-entropy FOR SYMBOLIC DYNAMICAL SYSTEMS YUN ZHAO AND YAKOV PESIN Abstract. For symbolc dynamcal systems we use the Carathéodory constructon as descrbed n [4] to ntroduce the notons of q-topologcal 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

A note on the one-deviation property in extensive form games

A note on the one-deviation property in extensive form games Games and Economc Behavor 40 (2002) 322 338 www.academcpress.com Note A note on the one-devaton property n extensve form games Andrés Perea Departamento de Economía, Unversdad Carlos III de Madrd, Calle

More information

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

ON A CONJECTURE OF MILNOR ABOUT VOLUME OF SIMPLEXES. Ren Guo & Feng Luo. Abstract 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

More information

Interim Correlated Rationalizability 1

Interim Correlated Rationalizability 1 Interm Correlated Ratonalzablty Edde Dekel Northwestern Unversty and Tel Avv Unversty Drew Fudenberg Harvard Unversty Stephen Morrs Prnceton Unversty Frst Draft: May 2003. Ths Draft: November 2006 Ths

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

Games of Threats. Elon Kohlberg Abraham Neyman. Working Paper

Games of Threats. Elon Kohlberg Abraham Neyman. Working Paper Games of Threats Elon Kohlberg Abraham Neyman Workng Paper 18-023 Games of Threats Elon Kohlberg Harvard Busness School Abraham Neyman The Hebrew Unversty of Jerusalem Workng Paper 18-023 Copyrght 2017

More information

The L(2, 1)-Labeling on -Product of Graphs

The L(2, 1)-Labeling on -Product of Graphs Annals of Pure and Appled Mathematcs Vol 0, No, 05, 9-39 ISSN: 79-087X (P, 79-0888(onlne Publshed on 7 Aprl 05 wwwresearchmathscorg Annals of The L(, -Labelng on -Product of Graphs P Pradhan and Kamesh

More information

On the Generic (Im)possibility of Full Surplus Extraction in Mechanism Design

On the Generic (Im)possibility of Full Surplus Extraction in Mechanism Design On the Generc (Im)possblty of Full Surplus Extracton n Mechansm Desgn Avad Hefetz vka Neeman Prelmnary Verson: February 27, 2004 Abstract A number of studes, most notably Crémer and McLean (985, 988),

More information

Statistical Inference. 2.3 Summary Statistics Measures of Center and Spread. parameters ( population characteristics )

Statistical Inference. 2.3 Summary Statistics Measures of Center and Spread. parameters ( population characteristics ) Ismor Fscher, 8//008 Stat 54 / -8.3 Summary Statstcs Measures of Center and Spread Dstrbuton of dscrete contnuous POPULATION Random Varable, numercal True center =??? True spread =???? parameters ( populaton

More information

Research Article Relative Smooth Topological Spaces

Research Article Relative Smooth Topological Spaces Advances n Fuzzy Systems Volume 2009, Artcle ID 172917, 5 pages do:10.1155/2009/172917 Research Artcle Relatve Smooth Topologcal Spaces B. Ghazanfar Department of Mathematcs, Faculty of Scence, Lorestan

More information

Lecture 4: Constant Time SVD Approximation

Lecture 4: Constant Time SVD Approximation Spectral Algorthms and Representatons eb. 17, Mar. 3 and 8, 005 Lecture 4: Constant Tme SVD Approxmaton Lecturer: Santosh Vempala Scrbe: Jangzhuo Chen Ths topc conssts of three lectures 0/17, 03/03, 03/08),

More information

THE RING AND ALGEBRA OF INTUITIONISTIC SETS

THE RING AND ALGEBRA OF INTUITIONISTIC SETS Hacettepe Journal of Mathematcs and Statstcs Volume 401 2011, 21 26 THE RING AND ALGEBRA OF INTUITIONISTIC SETS Alattn Ural Receved 01:08 :2009 : Accepted 19 :03 :2010 Abstract The am of ths study s to

More information