Priority Programme 1962

Size: px
Start display at page:

Download "Priority Programme 1962"

Transcription

1 Prorty Programme 1962 The Weak Sequental Closure of Decomposable Sets n Lebesgue Spaces and ts Applcaton to Varatonal Geometry Patrck Mehltz, Gerd Wachsmuth Non-smooth and Complementarty-based Dstrbuted Parameter Systems: Smulaton and Herarchcal Optmzaton Preprnt Number SPP receved on Aprl 20, 2017

2 Edted by SPP1962 at Weerstrass Insttute for Appled Analyss and Stochastcs (WIAS) Lebnz Insttute n the Forschungsverbund Berln e.v. Mohrenstraße 39, Berln, Germany E-Mal: spp1962@was-berln.de World Wde Web:

3 The weak sequental closure of decomposable sets n Lebesgue spaces and ts applcaton to varatonal geometry Patrck Mehltz Gerd Wachsmuth Aprl 20, 2017 We provde a precse characterzaton of the weak sequental closure of nonempty, closed, decomposable sets n Lebesgue spaces. Therefore, we have to dstngush between the purely atomc and the nonatomc regme. In the latter case, we get a convexfcaton effect whch s related to Lyapunov s convexty theorem, and n the former case, the weak sequental closure equals the strong closure. The characterzaton of the weak sequental closure s utlzed to compute the lmtng normal cone to nonempty, closed, decomposable sets n Lebesgue spaces. Fnally, we gve an example for the possble nonclosedness of the lmtng normal cone n ths settng. Keywords: decomposable set, Lebesgue spaces, lmtng normal cone, measurablty, weak sequental closure MSC: 49J53, 28B05, 90C30 1 Introducton Pontwse defned sets n functon spaces are standard n order to determne the feasble regons of optmal control problems. Typcally, control functons are supposed to le wthn sets of the form C := {v L p (m; R q ) v(ω) C(ω) f.a.a. ω, Technsche Unverstät Bergakademe Freberg, Faculty of Mathematcs and Computer Scence, Freberg, Germany, mehltz@math.tu-freberg.de, dma/mtarbeter/patrck-mehltz Technsche Unverstät Chemntz, Faculty of Mathematcs, Professorshp Numercal Mathematcs (Partal Dfferental Equatons), Chemntz, Germany, gerd.wachsmuth@mathematk.tu-chemntz.de, dgl/people/wachsmuth/ 1

4 where (, Σ, m) s a complete, σ-fnte measure space and C : R q s a set-valued mappng whch possesses nonempty, closed mages and certan measurablty propertes. Note that we do not assume the convexty of the mages of C. The generalty of ths settng s necessary n order to deal, e.g., wth optmal control problems comprsng mxed control-state complementarty constrants, see Guo and Ye [2016], Mehltz and Wachsmuth [2016]. It s easy to check that the above set C s decomposable n the sense (A, v 1, v 2 ) Σ C C: χ A v 1 + (1 χ A ) v 2 C, where χ A denotes the characterstc functon of the set A. Conversely, t s well known, that every nonempty, closed, and decomposable set C L p (m; R q ) can be wrtten n the above form, see [Papageorgou and Kyrts-Yallourou, 2009, Theorem 6.4.6]. If the set C appears n the constrants of an optmzaton problem, then correspondng necessary optmalty condtons derved va varatonal analyss are lkely to contan dfferent tangent or normal cones to the set C at some reference pont. Ths motvated our study of the varatonal geometry of pontwse defned sets C n Lebesgue spaces, see Mehltz and Wachsmuth [2016]. In the latter paper, we obtaned explct formulas for the Fréchet, strong lmtng, and Clarke normal cone to the set C under mld assumptons. Moreover, we presented reasonable upper and lower bounds (w.r.t. set ncluson) of the lmtng normal cone whch led to the observaton that n the nonatomc stuaton, the lmtng normal cone to C s always dense n the correspondng Clarke normal cone. However, we dd not derve an explct formula for the lmtng normal cone and the weak tangent cone. Here, we want to close ths gap. It wll be shown that the lmtng normal cone to C equals the so-called weak sequental closure,.e. the set of all weak accumulaton ponts of sequences, of the correspondng strong lmtng normal cone, see Proposton 5.4. In contrast to the weak closure, whch s the closure w.r.t. the weak topology, the weak sequental closure does not need to be weakly sequentally closed. In fact, t mght not even be closed. Thus, t s possble that the lmtng normal cone to pontwse defned sets s not closed, see Example 5.6. Ths strange behavor of the lmtng normal cone was already demonstrated by an example n l 2 n [Mordukhovch, 2006, Example 1.7]. Thus, n order to characterze the lmtng normal cone to pontwse defned sets, t wll be necessary to clarfy how the weak sequental closure to a pontwse defned set n a Lebesgue space looks lke. Ths s the am of Sectons 3 and 4 of ths paper where we dstngush between the stuatons of a nonatomc and a purely atomc measure space, respectvely. If nonatomc measure spaces are under consderaton, we observe a convexfcaton effect when computng weak sequental closures, see Theorem 3.8, whch seems to be related to Lyapunov s convexty theorem, see [Aubn and Frankowska, 2009, Theorem 8.7.3]. Especally, we obtan the supplementary result that pontwse defned sets n Lebesgue spaces are weakly closed f and only f they are weakly sequentally closed under mld assumptons, see Corollary Ths s a remarkable property whch does not hold for arbtrary sets n nfnte-dmensonal Banach spaces. In the settng of purely atomc measure spaces, t s shown n Corollary 4.3 that the weak sequental closure and weak closure concde wth the norm closure of the underlyng set. 2

5 We organzed the paper as follows: In Secton 2, we state the basc notaton whch s used throughout the manuscrpt. Secton 3 s dedcated to the characterzaton of the weak sequental closure to pontwse defned sets n nonatomc measure spaces. We present some necessary and suffcent crtera for the closedness of the weak sequental closure. Some examples are ncluded to vsualze the theory. In Secton 4, we deal wth the computaton of the weak sequental closure of pontwse defned sets n purely atomc measure spaces. Fnally, n Secton 5, the lmtng normal cone and the weak tangent cone to a pontwse defned set n a Lebesgue space are characterzed usng our results on the weak sequental closure. By means of two examples, we show that nether the lmtng normal cone nor the weak tangent cone to a pontwse defned set need to be closed. 2 Notaton Basc notaton Let N, Z, R, and R n denote the natural numbers, the ntegers, the real numbers, and the set of all real vectors wth n N components, respectvely. Furthermore, we use Z := Z {, R := R {+, R + := {r R r > 0, and R + 0 := {r R r 0. The standard smplex n R n s defned va { n n := λ R n λ = 1, λ 1,..., λ n 0. The Eucldean nner product of two vectors x, y R n s represented by x y whle x := x x s the Eucldean norm of x. We use B := {x R n x 1 for the closed unt ball n R n. The mappng dst: R n 2 Rn R defned by x R n A R n : dst(x, A) := nf x y y A s called dstance functon. Let A X be a subset of a real Banach space X. The sets cl A, cl seq w A, and cl w A denote the norm closure of A, the weak sequental closure of A (.e. the set of all weak accumulaton ponts of sequences comng from A), and the weak closure of A (.e. the closure w.r.t. the weak topology). Due to [Meggnson, 1998, Proposton ], cl w A equals the set of all weak accumulaton ponts of nets comng from A. Note that we have cl A cl seq w A cl w A and these nclusons are, n general, strct. We use span A, bd A, cone A, conv A, and conv A to represent the smallest subspace of X contanng A, the boundary of A, the smallest (not necessarly convex) cone n X contanng A, the smallest convex set n X contanng A, and the smallest closed, convex set n X contanng A, respectvely. Furthermore, we defne the polar cone of A as A := {x X x A: x, x 0. Theren, X s the topologcal dual of X whle, : X X R denotes the assocated dual parng. Recall that the Banach space X s called reflexve whenever the canoncal embeddng X x, x X s surjectve. 3

6 Tangent and normal cones Let A X be a nonempty, closed subset of the real reflexve Banach space X and fx some x A. The nner (or adjacent) tangent cone, the tangent (or Boulgand) cone, and the weak tangent cone to A at x are defned by { TA( x) {t n R + such that t n 0: := d X, {d n X : d n d, x + t n d n A n N T A ( x) := { d X {t n R + {d n X : t n 0, d n d, x + t n d n A n N, T w A ( x) := { d X {t n R + {d n X : t n 0, d n d, x + t n d n A n N, respectvely, see e.g. [Aubn and Frankowska, 2009, Secton 4.1]. Note that the nner tangent cone and the tangent cone are always closed whle ths property s not nherent for the weak tangent cone. Obvously, we always have the nclusons T A ( x) T A( x) T w A ( x) by defnton. If A s convex, then all these cones concde wth cl cone(a { x). We call A dervable at x f T A ( x) = T A( x) holds. Thus, any convex set s dervable everywhere. One may check [Mehltz and Wachsmuth, 2016, Secton 2.2] for more general crtera ensurng the dervablty of a set. Amongst others, the fnte unon of dervable sets s dervable agan, see [Mehltz and Wachsmuth, 2016, Lemma 2.1]. Next, we ntroduce the Fréchet (or regular) normal cone, the strong (or norm) lmtng normal cone, the lmtng (or basc, Mordukhovch) normal cone, and the Clarke (or convexfed) normal cone to A at x (see Mordukhovch [2006], Geremew et al. [2009]) va N A ( x) := TA w ( x), { NA( x) S := η X {xn A {η n X : x n x, η n η, η n N A (x n ) n N, { N A ( x) := η X {xn A {η n X : x n x, η n η, η n N A (x n ) n N, N C A ( x) := conv N A ( x), respectvely. By defnton the Fréchet as well as the Clarke normal cone are closed and convex. A dagonal sequence argument reveals that the strong lmtng normal cone s closed as well. On the other hand, the lmtng normal cone does not need to be closed f X s nfnte dmensonal, see [Mordukhovch, 2006, Example 1.7]. We have the nclusons N A ( x) NA S( x) N A( x) NA C ( x) and, n general, these nclusons are strct. If the set A s convex, then all these cones concde wth (A { x). Clearly, f X s fnte dmensonal, then the strong lmtng normal cone and the lmtng normal cone concde. Measurablty, Lebesgue spaces, and decomposable sets Let (, Σ) be a measurable space and let Y be a separable metrc space. A set-valued mappng C : Y s called measurable f for any open set O Y, the premage C 1 (O) := {ω C(ω) O s measurable. If C s assumed to be closed-valued, then there are equvalent useful characterzatons of measurablty, see [Papageorgou and Kyrts-Yallourou, 2009, Theorem ]. Partcularly, the closed-valued mappng 4

7 C s measurable f and only f there exsts a sequence {c n : Y n N of measurable functons such that C(ω) = cl{c n (ω) n N s vald for every ω. The map C s called graph measurable f ts graph gph C := {(ω, y) Y y C(ω) s measurable w.r.t. the σ-algebra Σ B(Y ). Theren, B(Y ) denotes the Borelean σ- algebra nduced by the metrc space Y and Σ B(Y ) represents the smallest σ-algebra contanng the Cartesan product Σ B(Y ). Note that whenever C s a measurable setvalued mappng wth closed mages, then t s graph measurable, see [Papageorgou and Kyrts-Yallourou, 2009, Proposton ]. Now, let X be a separable metrc space as well. A mappng ϕ: X Y s called a Carathéodory functon f ϕ(, x): Y s measurable for all x X whle ϕ(ω, ): X Y s contnuous for all ω. By means of [Papageorgou and Kyrts-Yallourou, 2009, Theorem 6.2.6], any Carathéodory functon ϕ: X Y s Σ B(X)-measurable. Now, assume that (, Σ, m) s a complete, σ-fnte measure space. Recall that (, Σ, m) s nonatomc whenever for every set M Σ wth m(m) > 0, there s some set N Σ such that m(m) > m(n) > 0 s vald. On the other hand, (, Σ, m) s referred to as purely atomc f every set of postve measure n Σ s an atom,.e. for every M Σ wth m(m) > 0 and every N Σ wth N M, we obtan m(n) = 0 or m(n) = m(m). For any p [1, ] and any q N, we denote by L p (m; R q ) the usual Lebesgue space of (equvalence classes) of measurable functons mappng from to R q equpped wth the usual norm. For brevty, we set L p (m) := L p (m; R). Recall that for p [1, ), the dual space L p (m; R q ) s sometrc to L p (m; R q ) where p (1, ] such that 1/p + 1/p = 1 holds denotes the conjugate coeffcent of p. The correspondng dual parng n L p (m; R q ) s gven by v L p (m; R q ) η L p (m; R q ): η, v := v(ω) η(ω) dω. Here, we use dω nstead of dm(ω) snce the measure m s fxed throughout each secton of the paper. The measurable space (, Σ, m) s called separable f for any s [1, ), the Banach space L s (m) s separable. Note that an arbtrary doman R d equpped wth the correspondng Borelean σ-algebra and Lebesgue s measure forms a σ-fnte, nonatomc, and separable measure space, see e.g. [Adams and Fourner, 2003, Theorem 2.21]. Thus, ts formal completon, see [Bogachev, 2007, Secton 1.5], s a complete, σ-fnte, nonatomc, and separable measure space. Now, let (, Σ, m) be a complete, σ-fnte measure space agan. A set C L p (m; R q ) s called decomposable f for any trplet (A, v 1, v 2 ) Σ C C, we have the relaton χ A v 1 + (1 χ A )v 2 C. Theren, χ A L (m) denotes the characterstc functon of A whch has value 1 for all ω A and vanshes everywhere on \ A. Clearly, decomposablty s some knd of generalzed convexty. It dates back to Rockafellar, see Rockafellar [1968]. It s well known that a nonempty and closed set s decomposable f and only f there exsts a measurable set-valued mappng C : R q wth nonempty and closed mages such that C possesses the representaton C = {v L p (m; R q ) v(ω) C(ω) f.a.a. ω, 5

8 see [Papageorgou and Kyrts-Yallourou, 2009, Theorem 6.4.6]. One may check Ha and Umegak [1977] and [Papageorgou and Kyrts-Yallourou, 2009, Secton ] for propertes and calculus rules for decomposable sets. 3 Weak sequental closure n nonatomc measure spaces In ths secton, we are gong to characterze the weak sequental closure of arbtrary closed, decomposable sets n Lebesgue spaces defned by a nonatomc measure. To ths end, we defne an auxlary functon on R q n Secton 3.1. Wth the help of ths functon, we are able to characterze the weak sequental closure n Secton 3.2. In Secton 3.3, we nvestgate under whch crcumstances the weak sequental closure s closed. Fnally, we gve a couple of counterexamples n Secton An auxlary functon Let C R q be a closed set and let p (1, ) be fxed. We defne the auxlary functon γ C : R q R by { γ C (x) := nf λ v p λ, v C, λ v = x (1) for x conv C and by γ C (x) = + otherwse. Carathéodory s theorem mples that γ C (x) < + holds f and only f x conv C s vald. By convexty of v v p, we have γ C (v) = v p v C. (2) The followng lemmas show that γ C s lower semcontnuous and convex. Lemma 3.1. Let {x n n N R q be a sequence wth x n x for some x R q and lm nf n γ C (x n ) < +. Then, there exst λ, v C such that λ v = x and λ v p lm nf γ C(x n ). (3) n In partcular, γ C s lower semcontnuous and the nfmum n (1) s attaned for all x conv C. Proof. Frst, we extract a subsequence (wthout relabelng), such that γ C (x n ) s fnte for all n N and converges towards ts least accumulaton pont as n. By defnton of γ C (x n ), there exst sequences {λ (n) n N, {v (n) n N C wth x n = λ(n) v (n) and λ(n) v (n) p γ C (x n ) + 1/n for all n N. Snce s compact, we can further extract a subsequence (wthout relabelng) such that λ (n) λ. W.l.o.g., there s j {0,..., q + 1 such that λ > 0 for all {1,..., q + 1 wth j and λ = 0 for all {1,..., q + 1 wth > j. Ths mples v (n) p 1 λ (n) λ (n) v (n) p 1 λ (n) ( γ C (x n ) + 1 ) β < + for all j, n 6

9 where β R s an upper bound of the convergent sequences { 1/λ (n) (γ C (x n ) + 1 n ) n N, = 1,..., j. Hence, we can extract a subsequence such that v (n) v C as n for j. On the other hand, λ (n) v (n) = ( λ (n) ) 1 1/p ( (n) λ v (n) p) 1/p ( λ (n) ( ) 1 1/p for all > j. Now, we defne v C arbtrarly for > j. Ths yelds λ v = Smlarly, we have λ v p = j j λ v p + 0 lm n j λ v + 0 = lm n λ (n) j λ (n) v (n) + lm n =j+1 1/p λ (n) v (n) p) 0 = lm λ (n) n v (n) = lm x n = x. n v (n) p + lm n =j+1 λ (n) λ (n) v (n) v (n) p = lm n λ (n) v (n) p. Ths shows the exstence of λ and v satsfyng (3). By defnton of γ C, we even have γ C (x) λ v p lm nf γ C(x n ) n and ths yelds the lower semcontnuty of γ C. Choosng x n = x for all n N, we obtan that the nfmum n (1) s attaned. We use the above lemma n order to come up wth the followng observaton. Corollary 3.2. If the condton s satsfed, then conv C s closed. c > 0 x conv C : γ C (x) c ( x p + 1) (4) Proof. Suppose on the contrary that conv C s not closed. Then we fnd a sequence {x n conv C convergng to x / conv C. Notng that {x n s bounded, we obtan From Lemma 3.1, we easly see lm nf n γ C(x n ) lm nf n c( x n p + 1) < +. γ C (x) lm nf n γ C(x n ) < +. On the other hand, we have γ C (x) = + by defnton. Ths s a contradcton. 7

10 We note that the converse result does not hold, cf. Examples 3.17, 3.18 and Lemma 3.3. The functon γ C : R q R s convex. Proof. Choose x, y R q and κ (0, 1) arbtrarly. In the case x / conv C or y / conv C, we have γ C (x) = + or γ C (y) = +. Thus, there s nothng to show. Let us consder x, y conv C. By Lemma 3.1, we fnd λ x, λ y and v x, v y C satsfyng x = λx vx, y = λy vy as well as γ C (x) = λx vx p and γ C (y) = λy vy p. Now, we consder the followng lnear program n standard form: Mnmze µ v x p + ν v y p w.r.t. (µ, ν) R R s.t. µ + ν = 1, µ v x + ν v y = κx + (1 κ)y, µ, ν 0. (5) Obvously, (κλ x, (1 κ)λ y ) s a feasble pont of ths program, and due to the fact that ts feasble set s bounded, t possesses at least one optmal basc soluton ( µ, ν). Observe that (5) possesses q + 1 equalty constrants whch means that ( µ, ν) has at most q + 1 postve components. Ths shows γ C (κx + (1 κ)y) µ v x p + ν v y p κλ x v x p + (1 κ)λ y vy p = κγ C (x) + (1 κ)γ C (y). Ths yelds the convexty of γ C. Let us provde an auxlary result, whch wll be helpful later. We defne the functon ψ : R q() R R R q R va ψ(v 1,..., v, λ, α) := ( ) λ v, λ v p + α for all v 1,..., v R q, λ R, and α R. Obvously, ψ s contnuous and Lemma 3.1 mples ψ(c R + 0 ) = ep γ C := {(v, β) R q R γ C (v) β, (6) 8

11 where ep γ C s the epgraph of the functon γ C. Due to the lower semcontnuty of γ C, ts epgraph s closed. In the last result of ths secton, we apply the functon γ C to a decomposable set n a pontwse fashon. Lemma 3.4. Let (, Σ, m) be a complete and σ-fnte measure space and let p (1, ) be gven as above. Suppose that C : R q s measurable and closed-valued. Then, the functon Γ C : L p (m; R q ) R defned va Γ C (v) := γ C(ω) (v(ω)) dω R for all v L p (m; R q ) satsfyng v(ω) conv C(ω) for a.a. ω and Γ C (v) = + otherwse s well defned, convex, and lower semcontnuous. In partcular, t s weakly lower semcontnuous. Proof. Fx v L p (m; R q ) wth v(ω) conv C(ω) for a.a. ω. Then, the set-valued mappng Υ: R R q() defned by { Υ(ω) := (λ, w) C(ω) λ w = v(ω) for all ω s closed-valued, and measurable, see [Aubn and Frankowska, 2009, Theorem 8.2.9]. Furthermore, Υ(ω) s nonempty for a.a. ω. Snce we have { γ C(ω) (v(ω)) = nf λ w p (λ, w) Υ(ω) for almost all ω, the functon ω γ C(ω) (v(ω)) s measurable by means of [Aubn and Frankowska, 2009, Theorem ]. Together wth γ C(ω) (v(ω)) 0, ths shows that Γ C s well defned. The convexty of the functon Γ C s a smple consequence of the convexty of γ C(ω) for all ω, whch was provded n Lemma 3.3. Let us prove the lower semcontnuty of Γ C. Choose a sequence {v n n N of functons n L p (m; R q ) convergng to v such that v n (ω) conv C(ω) holds true for almost all ω for suffcently large n N (otherwse, there s nothng to show). Wthout relabelng, we extract a subsequence such that {Γ C (v n ) converges towards ts least accumulaton pont. From v n v n L p (m; R q ) we fnd a subsequence of {v n (wthout relabelng) whch converges pontwse almost everywhere on to v. Thus, we can apply Fatou s lemma and Lemma 3.1 n order to obtan lm nf Γ C(v n ) = lm Γ C(v n ) = lm γ C(ω) (v n (ω))dω n n n lm nf γ C(ω)(v n (ω))dω γ C(ω) (v(ω))dω = Γ C (v). n Ths completes the proof. 9

12 3.2 Characterzaton of the weak sequental closure In ths secton, we gve a characterzaton of the weak sequental closure of closed, decomposable sets n nonatomc measure spaces. Throughout ths secton, we use the followng assumpton on the measure space. Assumpton 3.5. We assume that (, Σ, m) s a σ-fnte, complete, separable, and nonatomc measure space. Moreover, let p (1, ) be gven. Frst, we recall the followng result whch s taken from [Papageorgou and Kyrts- Yallourou, 2009, Proposton ] and [Mehltz and Wachsmuth, 2016, Lemma 3.4]. Lemma 3.6. Suppose that (, Σ, m) satsfes Assumpton 3.5. Let C L p (m; R q ) be nonempty, closed, and decomposable. We denote by C : R q the assocated set-valued map. Then, we have and cl w C = { v L p (m; R q ) v(ω) conv C(ω) f.a.a. ω (7) conv C cl seq w C. The next lemma of ths secton demonstrates that a partton of unty 1 = λ (ω) such that λ: s measurable can be approxmated n the weak- topology of L (m) by sequences of characterstc functons. For ths result, t s essental that the measure m does not contan atoms. Lemma 3.7. Suppose that (, Σ, m) satsfes Assumpton 3.5. Let λ L (m; R ) wth λ(ω) for a.a. ω be gven. Then, there exsts a sequence {A (n) n N Σ, such that {A (n) s a partton of for all n N and χ A (n) λ n L (m) as n holds for all = 1,..., q + 1. Moreover, t s possble to choose {A (n) n N such that [ ι {1,..., q + 1: λ ι L 1 (m) = n N: m ( A (n) ) ι 2 ] λ ι (ω) dω. Proof. Frst, assume m() < +. Let e 1,..., e R denote the q + 1 unt vectors n R, set E := {e 1,..., e, and consder the assocated closed, decomposable set E := {ξ L p (m, R ) ξ(ω) E f.a.a. ω. From m() < +, E s nonempty. Thus, we obtan cl w E = {ξ L p (m, R ) ξ(ω) conv E f.a.a. ω = {ξ L p (m, R ) ξ(ω) f.a.a. ω, 10

13 .e. λ cl w E, from Lemma 3.6. Snce L p (m) s separable and reflexve whle E s bounded, we obtan λ cl seq w E from [Meggnson, 1998, Corollary ]. Thus, there s a sequence {ξ n n N E whch converges weakly to λ. Notng that {ξ n n N s bounded n L (m; R ), we already have ξ n λ n L (m; R ),.e. ξ n, λ n L (m) for all = 1,..., q + 1. By defnton of E, there exsts a partton {A (n) Σ of wth whch shows χ A (n) ξ n = e χ (n) A λ for all = 1,..., q + 1 as n whenever the underlyng measure space s fnte. For the proof n the case m() = +, we choose a partton { j j N Σ of nto sets of postve but fnte measure and repeat the above arguments on every segment j, j N. It remans to verfy the last asserton. By {A (n) n N Σ, we denote the sequence whch s gven by the frst asserton. Let ι {1,..., q + 1 be gven such that λ ι L 1 (m) holds. We denote by { j j N Σ a dsjont partton of nto sets of fnte measure. Snce χ j L 1 (m) s vald, we can fnd a subsequence ndexed by {n(j, k) k N whch satsfes and χ (n(j,k)) A ι j χ (n(j,k)) A ι j For = 1,..., q + 1 and k N, we set à (k) := j N dω λ ι dω as k j dω 2 λ ι dω k N. j j A (n(j,k)). Then, à (k) = {A (k) s a dsjont partton of for all k N as well. Let us consder the sequence {Ã(k) k N. For arbtrary v L 1 (m) and fxed {1,..., q + 1, we obtan vχã(k) dω = (v χ j ) χ (n(j,k)) A dω (v χ j ) λ dω = vλ dω j N j N as k,.e., χã(k) λ n L (m) as k. Note that we have used the domnated convergence theorem wth the summable domnatng sequence v χ j L 1 (m). On the other hand, m ( à (k) ) ι = m = j N j N j A (n(j,k)) ι χ (n(j,k)) A ι j = j N m ( j A (n(j,k)) ι dω 2 λ ι dω = 2 j N j ) λ ι dω 11

14 s vald. Thus, by replacng {A (n) n N by {Ã(k) k N and by repeatng the argumentaton for other ndces ι {1,..., q + 1 wth λ ι L 1 (m) yelds the second clam. Now, we are n the poston to prove the man result of ths secton. Theorem 3.8. Suppose that (, Σ, m) satsfes Assumpton 3.5. Let C L p (m; R q ) be closed and decomposable. We denote by C : R q the assocated set-valued map. Then, cl seq w C = {v L p (m; R q ) Γ C (v) < +. Proof. : Let v cl seq w C be gven. Then, there s a sequence {v n C satsfyng v n v n L p (m; R q ). Snce v n (ω) C(ω) for a.a. ω, we can use (2) and obtan Γ C (v n ) = γ C(ω) (v n (ω)) dω = v n (ω) p dω = v n p L p (m;r q ). Snce Γ C s weakly lower semcontnuous by Lemma 3.4, we fnd Γ C (v) lm nf n Γ C(v n ) = lm nf n v n p L p (m;r q ) < +. : Let v L p (m; R q ) wth Γ C (v) < + be gven. Then we have γ C(ω) (v(ω)) < + for a.a. ω. Let us ntroduce a set-valued mappng Φ: R R q() by { Φ(ω) := (λ, w) C(ω) λ w p = γ C(ω) (v(ω)) and λ w = v(ω) for all ω. Owng to Lemma 3.1, we fnd that the mages of Φ are not empty and t s straghtforward to check that they are closed. It s easy to see from [Aubn and Frankowska, 2009, Theorem 8.2.9] that Φ s measurable. By applyng the measurable selecton theorem, see [Aubn and Frankowska, 2009, Theorem 8.1.3], we fnd measurable functons λ: and v : R q, = 1,..., q + 1, whch satsfy v (ω) C(ω) for all = 1,..., q + 1, v(ω) = λ (ω) v (ω) for a.a. ω, and λ (ω) v (ω) p dω = γ C(ω) (v(ω)) dω < +. For {1,..., q + 1 and j Z, we defne { {ω 2 j v (ω) p < 2 j+1 f j >, (, j) = {ω v (ω) = 0 f j =. Furthermore, for a multndex J Z, we ntroduce J := (, J ). 12

15 Ths mples that { J J Z s a dsjont partton of. Now, we apply Lemma 3.7 on each of these J, J Z. Ths yelds sequences {A (J,n) n N such that {A (J,n) s a dsjont partton of J and χ (J,n) A λ J n L (m J ) as n. Moreover, we observe that λ s ntegrable on J f J >. In ths case, we addtonally have m(a (J,n) ) 2 J λ dω. Now, we set v (n) := v. Ths mples v (n) p L p (m;r q ) J Z J Z J Z J Z J Z = 2 1+p A (J,n) χ A (J,n) v p dω { m(a (J,n) ) 2 (J +1)p f J > 0 f J = { 2 2 p λ J 2 Jp dω f J > 0 f J = { 2 1+p λ J v p dω f J > 0 f J = λ v p dω = 2 1+p Γ C (v). Ths yelds the boundedness of {v (n) n N n L p (m; R q ), and v (n) C follows by constructon. It remans to show v (n) v n L p (m; R q ). Let J Z and {1,..., be gven. Frst, we consder the case J >. In ths case, χ (J,n) A v s bounded n L (m; R q ) and by Lemma 3.7 t converges weakly- towards χ J λ v n L (m; R q ) as n. By densty of L 1 (m) L p (m) n L p (m) and the boundedness of χ (J,n) A v n L p (m; R q ), ths v χ J λ v n L p (m; R q ) as n. yelds χ (J,n) A Now, we consder the case J =. Ths yelds v J χ A (J,n) v χ J λ v n L p (m; R q ) as n. = 0. Hence, we obvously have Ths yelds v (n), g v, g for all g L p (m; R q ) whch are supported on the unon of a fnte subset of { J J Z. Such functons are dense n L p (m; R q ) and together wth the boundedness of v (n) n L p (m; R q ) ths shows the clam. Let C L p (m; R q ) be nonempty, closed, and decomposable, let C : R q be the assocated measurable set-valued mappng, and let Assumpton 3.5 be vald. We want 13

16 to compare the above result for the weak sequental closure of C wth the expresson (7) for ts weak closure. By defnton of Γ C and the representaton of cl w C presented n Lemma 3.6, we obtan the nclusons cl seq w C {v L p (m; R q ) v(ω) conv C(ω) f.a.a. ω cl w C. (8) By means of an example, we wll see later that these nclusons can be strct at the same tme. In the upcomng theorem, we wll demonstrate that the weak closure of C can be obtaned by takng the norm closure of ts weak sequental closure. Theorem 3.9. Suppose that (, Σ, m) satsfes Assumpton 3.5. Let C L p (m; R q ) be decomposable. Then we have cl cl seq w C = cl w C. Proof. If C s empty, there s nothng to prove. In the case that C s closed and not empty, we nvoke Lemma 3.6 to obtan conv C cl seq w C cl w C. Takng the closure yelds conv C cl cl seq w C cl cl w C = cl w C. Now, observe that the set on the left s a closed as well as convex superset of C. Ths yelds cl w C conv C cl cl seq w C cl w C whch completes the proof n case that C s closed. It remans to consder the case that C s not closed. By applyng the frst part of the proof to cl C, whch s decomposable, we obtan cl cl seq w cl C = cl w cl C. By a dagonal sequence argument, we can show cl seq w cl C = cl seq w C and cl w cl C = cl w C s mmedate. Ths shows the clam n the case that C s not closed. As a corollary, we obtan an nterestng property of decomposable sets. Corollary Suppose that (, Σ, m) satsfes Assumpton 3.5. Let C L p (m; R q ) be decomposable. Then, C s weakly closed f and only f t s weakly sequentally closed. The above property of decomposable sets s very remarkable, snce there are examples for sets whch are weakly sequentally closed, but not weakly closed. For example, t can be checked that the set { n e n n N H, where {e n n N s an orthonormal bass n the Hlbert space H, s weakly sequentally closed, but 0 belongs to ts weak closure. 3.3 Closedness of the weak sequental closure In ths secton, we study necessary and suffcent condtons for the closedness of the weak sequental closure. The man motvaton for ths nvestgaton s that Theorem 3.9 mples cl seq w C = cl w C n the case that cl seq w C s closed, and we can use the more convenent formula (7) for the computaton of cl seq w C. Lemma Suppose that (, Σ, m) satsfes Assumpton 3.5. Let C L p (m; R q ) be nonempty, closed, and decomposable such that cl seq w C s closed. Let C : R q be the assocated set-valued mappng. Then, conv C(ω) s closed for almost every ω. 14

17 Proof. The closedness of cl seq w C mples cl seq w C { v L p (m; R q ) v(ω) conv C(ω) f.a.a. ω { v L p (m; R q ) v(ω) conv C(ω) f.a.a. ω = cl w C = cl seq w C, see Lemma 3.6 as well as Theorems 3.8 and 3.9. Thus, all these sets have to be equal. If we would already know that the set-valued mappngs ω conv C(ω) and ω conv C(ω) are graph measurable, we could apply [Papageorgou and Kyrts-Yallourou, 2009, Corollary 6.4.4] to get conv C(ω) = conv C(ω) for a.a. ω. Hence, t remans to show these graph measurabltes. From [Aubn and Frankowska, 2009, Theorem 8.2.2], we get that ω conv C(ω) s measurable. Consequently, t s graph measurable by [Papageorgou and Kyrts- Yallourou, 2009, Theorem ]. To show the graph measurablty of ω conv C(ω), we are gong to explot (6) and v conv C(ω) f and only f γ C(ω) (v) < +. To ths end, we ntroduce the Carathéodory functon ϕ: R q() R R R q R, defned va ( ) ϕ(ω, v 1,..., v, λ, α) = λ v, λ v p + α for all ω, v 1,..., v R q, λ R, and α R. By (6), we fnd ϕ ( ω, C(ω) R + ) 0 = ep γc(ω). Now, the set-valued map ω C(ω) R + 0 Frankowska, 2009, Theorem 8.2.8] mples that s measurable. Hence, [Aubn and ω cl ϕ ( ω, C(ω) R + ) 0 = cl ep γc(ω) = ep γ C(ω) s measurable and possesses nonempty, closed mages. For fxed K N, we defne a closed set M K R q R by M K := R q [0, K]. Now, we can nvoke [Aubn and Frankowska, 2009, Theorem 8.2.4] to see that ω M K ep γ C(ω) s measurable and closed-valued. Thus, [Aubn and Frankowska, 2009, Theorem 8.2.8] and [Papageorgou and Kyrts-Yallourou, 2009, Proposton ] can be used to obtan the graph measurablty of ω cl Proj(M K ep γ C(ω) ), where Proj: R q R R q s the projecton onto the frst q arguments. Usng the lower semcontnuty of γ C(ω) and the characterzaton Proj(M K ep γ C(ω) ) = {v R q γ C(ω) (v) K, we observe that the set Proj(M K ep γ C(ω) ) s already closed for a.a. ω. Hence, ω Proj(M K ep γ C(ω) ). 15

18 s graph measurable. Fnally, we note gph(ω conv C(ω)) = {(ω, v) v conv C(ω) = { (ω, v) 0 γ C(ω) (v) < + = { (ω, v) 0 γc(ω) (v) K K N = K N gph(ω Proj(M K ep γ C(ω) )). Hence, ω conv C(ω) s graph measurable. As already sad, [Papageorgou and Kyrts-Yallourou, 2009, Corollary 6.4.4] now mples that conv C(ω) = conv C(ω) for a.a. ω. In the case where the set-valued mappng whch characterzes the pontwse defned set C of nterest s constant, the stuaton s more comfortable. We study C = {v L p (m; R q ) v(ω) C f.a.a. ω (9) for a nonempty, closed set C R q and p (1, ). In ths settng, we fnd a condton whch s necessary and suffcent for the closedness of cl seq w C. However, we have to dstngush the cases where the underlyng measure space s fnte or not. Lemma Suppose that (, Σ, m) satsfes Assumpton 3.5. Let C be nonempty and defned as n (9) wth C R q beng nonempty and closed. We further suppose m() < +. Then, the closedness of cl seq w C s equvalent to condton (4). Proof. Suppose that (4) does not hold. Then there s a sequence {x n n N conv C wth γ C (x n ) > n ( x n p + 1). Ths mples that the sequence {γ C (x n )/( x n p + 1) n N s nonnegatve and does not belong to l. Hence, there s a nonnegatve sequence {α n n N l 1 wth γ C (x n ) α n x n p + 1 = +. We defne n=1 α n β n := x n p + 1, B := β n n=1 α n < +. Snce m s nonatomc, there s a countable partton { n n N of such that m( n ) = β n B 1 m() holds. Now, we consder the functon v := n=1 χ n x n. We have v p L p (m;r q ) = Γ C (v) = n=1 n=1 m( n ) x n p = m() B m( n ) γ C (x n ) = m() B n=1 n=1 β n x n p m() B n=1 α n < +, n=1 β n γ C (x n ) = m() B n=1 α n γ C (x n ) x n p + 1 = + 16

19 whch shows v cl w C \ cl seq w C. Ths, however, mples that cl seq w C s not closed, see Theorem 3.9. Ths fnshes the frst part of the proof. For the converse drecton of the proof, we assume that (4) holds. Let v cl w C be gven. Snce conv C s closed, see Corollary 3.2, we have v(ω) conv C for a.a. ω. Then, (4) mples γ C (v(ω)) c ( v(ω) p + 1). Hence, Γ C (v) = γ C (v(ω)) dω c ( v(ω) p + 1) dω = c ( v p L p (m;r q ) + m()) < + holds and ths shows v cl seq w C. Ths mples the closedness of cl seq w C, see Theorem 3.9. Lemma Suppose that (, Σ, m) satsfes Assumpton 3.5. Let C be nonempty and defned as n (9) wth C R q beng nonempty and closed. Furthermore, we assume that m() = + s vald. Then, the closedness of cl seq w C s equvalent to c > 0 x conv C : γ C (x) c x p. (10) Proof. Frst, let us assume that (10) s volated. We wll show that cl seq w C s not closed. There s a sequence {x n n N conv C wth γ C (x n ) > n x n p. Snce m() = +, and snce m s nonatomc, there s a countable sequence { n n N of parwse dsjont subsets of wth m( n ) = n 2 x n p. We set v := n=1 χ n x n. Then, we obtan v p L p (m;r q ) = x n p dω = m( n ) x n p = n=1 n n=1 n=1 Γ C (v) = γ C (x n ) dω m( n ) n x n p = n n=1 n=1 1 n 2 = π2 6, n=1 1 n = +. Hence, v cl w C \ cl seq w C. Invokng Theorem 3.9 shows that cl seq w C s not closed. Next, we assume that condton (10) holds. Choose an arbtrary sequence {v n n N C whch converges n L p (m; R q ) to some v L p (m; R q ). Explotng the lower semcontnuty of Γ C, see Lemma 3.4, and condton (10), we obtan Γ C ( v) lm nf Γ C(v n ) c lm nf v n (ω) p dω = c lm nf v n p n n n L p (m;r q ) < + cl seq w whch yelds v cl seq w C, see Theorem 3.8. Ths shows the closedness of cl seq w C and completes the proof. In the next lemma, we consder the case that C s a cone. Recall that B R q denotes the closed unt ball. Lemma Suppose that (, Σ, m) satsfes Assumpton 3.5. Let C R q be a nonempty and closed cone and consder the decomposable set C defned n (9). Then, C s closed f and only f there exsts some r > 0 such that the condton cl seq w s vald. (conv C) B conv(c rb) (11) 17

20 Proof. Frst, let us assume that there s some r > 0 such that (conv C) B conv(c rb) s vald. Choose some x (conv C) \ {0 arbtrarly. Then x/ x (conv C) B s vald and, hence, we fnd λ and w 1,..., w C rb wth x/ x = λ w. Snce C s a cone, we obtan ( γ C (x) = γ C x x ) ( ) x = x p γ C x p λ w p r p x p. x x Notng that r p s a constant ndependent of x, we obtan the closedness of cl seq w C from Lemmas 3.12 and 3.13 snce condton (10) s vald whch mples (4). For the proof of the converse ncluson, we assume that cl seq w C s closed. Then, by means of Lemmas 3.12 and 3.13, condton (4) holds wth some c > 0. Now, let x conv C wth x 1 be gven. Snce γ C (x) 2 c, Lemma 3.1 mples the exstence of λ, v C wth x = λ v and γ C (x) = λ v p. Now, we defne K := λ v and α := K/ v 0, = 1,..., q + 1. Ths mples x = λ α (α v ), λ λ v = α K = 1, α v = K = 1,..., q + 1. Snce C s a cone, we have α v C for all = 1,..., q + 1. Thus, x conv(c K B) s vald. It remans to fnd an upper bound for K whch s ndependent of x. Usng Hölders nequalty, we fnd wth 1 = 1/p + 1/p : K = λ v = (λ 1/p v ) λ (p 1)/p ( Usng p = p/(p 1) and λ, ths mples K ( (λ 1/p ) 1/p ( v ) p ) 1/p λ v p γ C (x) 1/p = (2 c) 1/p. Hence, (11) s satsfed wth r = (2 c) 1/p. Usng the above lemma, we obtan the followng result. (λ (p 1)/p ) p ) 1/p Corollary Suppose that (, Σ, m) satsfes Assumpton 3.5. Let C R q be a nonempty, closed cone such that conv C s a closed cone and one of the followng condtons s satsfed: () conv C s ponted (.e. we have conv C ( conv C) = {0), () conv C s polyhedral (.e. t concdes wth the conc convex hull of fntely many vectors), () q

21 We consder the decomposable set C defned n (9). Then cl seq w C s closed. Proof. For the proof, we only need to show that condton (11) holds, cf. Lemma Case (): Due to the pontedness of conv C, the polar cone has an nteror pont,.e., there s a nt C. Ths mples Clearly, we have c conv C \ {0: a c > 0. (conv C) B {x R q a x a and the set C a := {c C a c a s bounded. Consequently, there s some scalar r > 0 whch satsfes C a C rb. Now, choose x (conv C) B dfferent from 0 arbtrarly. Then, we fnd λ and v 1,..., v C \ {0 such that x = λ v. For any = 1,..., q + 1, we set β := (a x)/(a v ) > 0. Then, we have x = λ β (β v ), λ λ (a v ) = β a x = a ( λ ) v = 1, a x and β v C for all = 1,..., q + 1. Furthermore, a (β v ) = β (a v ) = a x a,.e. β v C a holds for all = 1,..., q + 1. Ths shows x conv C a conv(c rb) by constructon and, thus, (11) holds. Case (): By assumpton, there are a number N N and a set {v 1,..., v N conv C wth conv C = cone conv{v 1,..., v N. We defne Further, we set I := { I {1,..., N the famly {v I s lnearly ndependent. t := mn I I mn λ I λ v. Theren, we used I := {λ N λ = 0 for all I. Due to the lnear ndependence of the famly {v I for I I, we have t > 0. Further, we choose s > 0 such that I v conv(c s B) = 1,..., N. Now, let x (conv C) B be arbtrary. By Carathéodory s theorem, there s an ndex set I I, λ I and α 0 wth x = α I λ v. Hence, 1 x = α λ v α t. Ths shows α t 1 and from x = I λ (α v ), we fnd I x conv(α conv(c s B)) = conv(c α s B) conv(c t 1 s B). Thus, (11) s verfed wth r = t 1 s. Case (): If conv C s ponted, we can apply case (). Otherwse, let L conv C be the largest subspace contaned n conv C and set K := L (conv C). Then we obtan conv C = L + K. Snce the cone K s at most two-dmensonal, t s polyhedral. Ths shows that conv C s polyhedral, and we can apply case (). 19

22 3.4 Counterexamples In ths secton, we provde some counterexamples n whch the weak sequental closure s not closed. We gve a bref overvew of the dfferent features of these counterexamples. Example 3.16: We use the smple, two-dmensonal set C := ( R + 0 {0) {(0, 1), whch possesses a non-closed convex hull, and = (0, 1) equpped wth Lebesgue s measure. The weak sequental closure of the assocated decomposable set s strctly smaller than the decomposable set assocated wth the pontwse convex hull. Hence, ths example shows that both nclusons n (8) may be strct at the same tme. Example 3.17: We use C := {(x 1, x 2 ) R 2 x 2 x 1. Here, the convex hull conv C = R 2 s closed. Nevertheless, condton (4) s volated. Example 3.18: We use C := { 2 2n n N. Agan, the convex hull conv C = R s closed, but (4) s volated. Hence, even n R, the closedness of conv C does not mply (4). Example 3.19: We consder C = {0, 1 R whch has a closed convex hull. However, (10) s not satsfed whle (4) holds. Example 3.20: We use C := cone ( {(1, 0, 0, 0), ( 1, 0, 0, 0) {( ) 1, 1, cos(t), sn(t) t [0, 2π)). 2π t It s shown that C s a closed cone and conv C s closed, too. However, condton (11) s volated. Hence, even for closed cones, the closedness of the convex hull does not mply (4). Due to Corollary 3.15 (), we cannot construct such a counterexample n less than four dmensons. Example In ths example, we demonstrate that the nclusons n (8) mght be strct at the same tme. We consder = (0, 1) equpped wth the Lebesgue measure, p (1, ), and C := ( R + 0 {0) {(0, 1) R 2. Obvously, the assocated set C L p (m; R 2 ) defned n (9) s nonempty, closed, and decomposable. It can be checked that conv C = ( {0 [0, 1] ) ( R + [0, 1) ) holds. Furthermore, we denote by D := {v L p (m; R 2 ) v(ω) conv C f.a.a. ω the pontwse convex hull assocated to C. 20

23 Observe that we have (x 1, x 2 ) R 2 : γ C (x 1, x 2 ) = { x p 1 (1 x 2) 1 p + x 2 f (x 1, x 2 ) conv C, + f (x 1, x 2 ) conv C. For some α > 0, we consder the functon v D defned by v(ω) = (1, 1 ω α ) for ω. We obtan Γ C ( v) = = 1 0 [ (ω α ) 1 p + 1 ω α] dω 1 α (1 p) α α (1 p) + 1 lm (1 p)+1 ωα ω 0 whch dverges for α > 1/(p 1). Thus, n ths case, we obtan v cl seq w C from Theorem 3.8. However, we have cl w C = {v L p (m; R 2 ) v(ω) conv C f.a.a. ω = {v L p (m; R 2 ) v(ω) R + 0 [0, 1] f.a.a. ω, see Lemma 3.6,.e. cl seq w C D cl w C. Example We gve an example smlar to Example 3.16, but n whch the pontwse convex hull s already closed. We set C := {(x 1, x 2 ) R 2 x 2 x 1. Obvously, we have conv C = R 2. For gven p (1, ), one can compute x 2 > 0: γ C (0, x 2 ) = (x x 4 2) p 2. In order to do so, one can proceed n three steps: Frst, we show that for (λ, v) 3 C 3 wth parwse dsjont v satsfyng (0, x 2 ) = 3 λ v and λ 1, λ 2, λ 3 > 0, we have γ C (0, x 2 ) < 3 λ v p. Clearly, f v 1 belongs to the left half space whle v 2, v 3 belong to the rght half space, then there s a pont ṽ on the lne segment between v 2 and v 3 such that (0, x 2 ) belongs to the convex hull of v 1 and ṽ. Obvously, the correspondng convex combnaton yelds a better functon value n (1), snce v v p s strctly convex. Thus, we can assume that ( λ, v) 2 C 2 s a mnmzer of (1). Next, we show v 1, v 2 bd C = {(x 1, x 2 ) R 2 x 2 = x 1. Assumng v 1 / bd C on the contrary, for suffcently small ε > 0, we have ṽ := v 1 +ε( v 2 v 1 ) C. From (0, x 2 ) = λ 1 v 1 +(1 λ 1 ) v 2, we obtan (0, x 2 ) = λ 1 1 εṽ + ( 1 λ 1 1 ε) v2. Usng the strct convexty of v v p, we obtan γ C (0, x 2 ) λ 1 1 ε ṽ p + ( 1 λ 1 1 ε whch contradcts the optmalty of ( λ, v). ) v 2 p < λ 1 v 1 p + (1 λ 1 ) v 2 p = λ 1 v 1 p + λ 2 v 2 p 21

24 Fnally, we show that ( λ, v), wth λ 1 = λ 2 = 1 2, v 1 = (x 2 2, x 2), and v 2 = ( x 2 2, x 2), s actually a mnmzer of (1). Therefore, assume that a mnmzer (ˆλ, ˆv) 2 bd C 2 of (1) satsfes ˆv 1 = ( x 2 2, x 2) and ˆv 2 = ( x 2 2, x 2) for x 2, x 2 0 and x 2 x 2. Set ˆv 3 := (x 2 2, x 2), ˆv 4 := ( x 2 2, x 2) as well as µ 1 = µ 4 := ˆλ 1 2 and µ 2 = µ 3 := ˆλ 2 2. Now, we apply the frst of our above arguments to the pars ˆv 1, ˆv 3 and ˆv 2, ˆv 4 n order to fnd a feasble pont of (1) wth a better objectve value than (ˆλ, ˆv). Ths s a contradcton. Thus, a mnmzer of (1) needs to satsfy x 2 = x 2. Ths shows that ( λ, v) as presented above s a mnmzer to (1). We fx an arbtrary bounded doman R d and equp t wth Lebesgue s measure. Next, we pck a functon w { v L p (m) \ L 2p (m) v(ω) > 0 f.a.a. ω and consder v := (0, w) L p (m; R 2 ). From conv C = R 2 we fnd cl w C = L p (m; R 2 ), where C denotes the nonempty, closed, decomposable set assocated to the set C, see (9). Hence, v cl w C. However, we easly see Γ C ( v) = γ C (0, w(ω)) dω = (w 2 (ω) + w 4 (ω)) p/2 dω w 2p L 2p (m) = +. Thus, v does not belong to cl seq w C. Example Let us consder the set C := { 2 2n n N, p (1, ), and the assocated pontwse defned set C L p (m) gven n (9). Here, R d s an arbtrary bounded doman whch s equpped wth Lebesgue s measure. For arbtrary n N, we defne α n := 2 (p+1) 2n 1 (0, 1) and Then, we can check w n := (1 α n ) 2 2n + α n 2 2n+1. γ C (w n ) = (1 α n ) 2 p 2n + α n 2 p 2n+1 α n 2 p 2n+1 = 2 (3 p 1) 2n 1 = 2 (p 1) 2n 1 2 p 2n as well as w n p 2 p 1 [ (1 α n ) p 2 p 2n + α p n 2 p 2n+1] 2 p 1 2 p 2n [ 1 + α p n 2 p 2n ] 2 p 2 p 2n, and takng the lmt n, we obtan 2n 1 γ C (w n ) 2(p 1) w n p 2 p = 2 (p 1) 2n 1 p +. 22

25 Together wth the trval estmate we even get w n (p 1)/8 2 (p 1) 2n 2, γ C (w n ) w n p+(p 1)/8 2(p 1) 2n 1 p (p 1) 2 n 2 = 2 (p 1) 2n 2 p 1, where the last nequalty holds for n N where N N s chosen large enough. Now, choose a functon { v v L p (m) \ L p+(p 1)/8 (m) v(ω) {w n n N, n N f.a.a. ω. Snce we have conv C = [2, ), v s an element of cl w C. On the other hand, Γ C ( v) = γ C ( v(ω)) dω v(ω) p+(p 1)/8 dω = v p+(p 1)/8 L p+(p 1)/8 (m) = + s obtaned. Thus, v does not belong to cl seq w Theorem 3.9. C whch, therefore, cannot be closed by Example Let us consder the unbounded doman = (1, ) equpped wth Lebesgue s measure, p (1, ), and the closed set C := {0, 1 R. Clearly, we have conv C = conv C = [0, 1] and γ C (x) = x for all x conv C. Consequently, the condton (4) s vald whle (10) s volated,.e. cl seq w C, where C L p (m) denotes the assocated decomposable set defned n (9), s not closed. Let us vsualze ths by means of an example. We have cl w C = {v L p (m) v(ω) [0, 1] f.a.a. ω from Lemma 3.6. Let us consder the functon v : R defned by v(ω) := ω 1 for any ω. Due to v p L p (m) = ω p dω = 1 ( ) 1 lm 1 p ω ω p 1 1 = 1 p 1, we have v cl w C. On the other hand, Γ C ( v) = 1 1 γ C ( v(ω)) dω = 1 ω 1 dω = lm ln ω = +. ω Followng Theorem 3.8, we have v / cl seq w C and, thus, cl seq w C s not closed by Theorem 3.9. Example We defne ( {( ) {(1, 1 C := cone 0, 0, 0), ( 1, 0, 0, 0), 1, cos(t), sn(t) t [0, 2 π)) R 4. 2π t 23

26 Let us check that C s closed. It s suffcent to consder convergent sequences {x n n N of the form ( ) 1 x n = α n, 1, cos(t n ), sn(t n ) 2π t n wth {α n n N (0, ) and {t n n N [0, 2 π). By consderng the second component of {x n, we obtan the boundedness of α n, thus, α n α holds along a subsequence. Snce {t n s bounded, we fnd t n t along a subsequence. If α = 0, we fnd lm x n = lm n n ( α n, 0, 0, 0 (2π t n ) On the other hand, α > 0 mples t 2 π. Ths yelds lm x n = α n ( 1, 1, cos(t), sn(t) 2π t Ths shows the closedness of C. Next, we compute the convex hull of C. We have ) C. ) C. conv C = conv cone ({ (1, 0, 0, 0), ( 1, 0, 0, 0) {(0, 1, cos(t), sn(t)) t [0, 2 π) ) = ( R {0 3) + ( {0 L ), where L := { (x 1, x 2, x 3 ) R 3 x1 x x2 3 s the Lorentz cone n R 3. Hence, conv C s closed. Fnally, we consder the ponts y n = (0, 1, cos(t n ), sn(t n )) wth t n = 2π 1/n. It s clear that y n conv(c) 2 B s vald. Now, we are wrtng y n as a convex combnaton of vectors from C,.e. M n y n = λ n c n, wth λ n > 0, c n C, and M n λn = 1 for all = 1,..., M n and n N. It s clear that none of the c n can be of the form ( ) 1 α, 1, cos(t), sn(t) 2π t wth t t n. Thus, we can wrte c n = α n (1, 0, 0, 0) for = 1,..., M 1 n, c n = α n ( 1, 0, 0, 0) for = M 1 n + 1,..., M 2 n, c n = α n (n, 1, cos(t n ), sn(t n )) for = M 2 n + 1,..., M n 24

27 for scalars α n 0, = 1,..., M n, and n N. We set α n := max{α n = 1,..., M n. By consderng the second component of y n, we get The frst component of y n yelds M 1 n 0 = λ n α n Thus, we obtan M 2 n =M 1 n+1 λ n α n + 1 = α n M n =M 2 n +1 λ n α n. M n =M 2 n+1 M 2 n =M 1 n+1 M 1 n λ n α n n = λ n α n λ n α n n. M 2 n =M 1 n+1 λ n α n + n. Hence, y n conv(c r B) s vald for r < n. Takng the lmt n shows that (11) s volated. By means of Lemma 3.14, the weak sequental closure of the assocated decomposable set C L p (m; R 4 ) defned n (9) cannot be closed. 4 Weak sequental closure n purely atomc measure spaces If (, Σ, m) s σ-addtve and purely atomc, there are at most countably many nonequvalent atoms (w.r.t. the equvalence relaton defned by A B m(a B) = 0). In the case that the measure space contans only fntely many non-equvalent atoms, the spaces L p (m) wll be fnte dmensonal and, thus, are sometrc to some R n wth a weghted p-norm. Hence, we wll assume that there are countably many atoms {A k k N Σ. Assumpton 4.1. We assume that (, Σ, m) s a σ-fnte, complete, and purely atomc measure space, and we fx p (1, ). Moreover, we assume that there are countably many non-equvalent atoms {A k k N Σ. Recall that a measurable functon u: R s constant a.e. on every atom A k. We denote by u Ak R the value of u on the atom A k. Ths mples that L p (m) s sometrc to the sequence space L p (n), where the measure n: 2 N R + 0 s gven by n(n) = k N m(a k) for all N N. The sometrc somorphsm I : L p (m) L p (n) s gven by (I(u))(k) = u Ak. Next, we wll demonstrate the well-known fact that weak convergence mples pontwse convergence on purely atomc spaces. Lemma 4.2. Assume that Assumpton 4.1 s satsfed. Let {u I L p (m) be a gven net over the drected set I such that u u L p (m). Then, u u a.e. on. 25

28 Proof. Due to m(a k ) < +, we have χ Ak L p (m). Hence, we obtan u Ak m(a k ) = u χ Ak dω u χ Ak dω = u Ak m(a k ) for all k N. Ths shows the desred pontwse convergence. As a corollary, we fnd that the weak closure s qute well-behaved for decomposable sets n Lebesgue spaces over a purely atomc measure. Corollary 4.3. Suppose that Assumpton 4.1 s satsfed and that C L p (m; R q ) s nonempty and decomposable. Then, C s closed f and only f C s weakly closed. Moreover, we obtan cl w C = cl seq w C = cl C. Proof. In order to verfy the frst asserton, we have to show that the closedness of C mples that C s weakly closed. Snce C s closed, we know that t possesses the representaton C = {u L p (m; R q ) u(ω) C(ω) f.a.a. ω, where the assocated measurable set-valued map C : R q has nonempty and closed mages. If the net {u I converges weakly to u n L p (m; R q ), we can nvoke Lemma 4.2 and obtan u(ω) = lm I u (ω) C(ω) by closedness of C(ω). Hence, u C holds true and, thus, C s weakly closed. Let us prove the second asserton. We obvously have cl C cl seq w C cl w C. By applyng the weak closure to C cl C, we fnd cl w C cl w cl C = cl C snce cl C s closed and decomposable, thus weakly closed by the frst asserton. Ths proves the equaltes cl C = cl seq w C = cl w C. Agan, we emphasze that ths result s qute surprsng snce the weak topology on nfnte-dmensonal Banach spaces does not cooperate well wth sequences. However, Corollary 4.3 demonstrates that ths does not happen for decomposable sets. Fnally, we note that Corollary 4.3 s also true f the measure space contans only fntely many atoms, snce L p (m) s fnte dmensonal n ths case. Hence, t s true for all σ-fnte, complete, and purely atomc measure spaces. 5 Varatonal objects assocated wth decomposable sets Throughout ths secton, we postulate the followng standng assumpton. Assumpton 5.1. We assume that (, Σ, m) s a σ-fnte, complete, and separable measure space. Furthermore, let K L p (m; R q ) be a nonempty, closed, and decomposable set wth p (1, ). By K : R q, we denote the assocated measurable and closed-valued multfuncton. We assume that the mages of K are dervable almost everywhere n. Let p (1, ) be the conjugate coeffcent assocated to p,.e. the scalar whch satsfes 1/p + 1/p = 1. Fnally, we fx some pont ū K. 26

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

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

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

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

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

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

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

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

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

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

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

ON THE EXTENDED HAAGERUP TENSOR PRODUCT IN OPERATOR SPACES. 1. Introduction

ON THE EXTENDED HAAGERUP TENSOR PRODUCT IN OPERATOR SPACES. 1. Introduction ON THE EXTENDED HAAGERUP TENSOR PRODUCT IN OPERATOR SPACES TAKASHI ITOH AND MASARU NAGISA Abstract We descrbe the Haagerup tensor product l h l and the extended Haagerup tensor product l eh l n terms of

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

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

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

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

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

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

Assortment Optimization under MNL

Assortment Optimization under MNL Assortment Optmzaton under MNL Haotan Song Aprl 30, 2017 1 Introducton The assortment optmzaton problem ams to fnd the revenue-maxmzng assortment of products to offer when the prces of products are fxed.

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

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

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

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

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

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

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

MMA and GCMMA two methods for nonlinear optimization

MMA and GCMMA two methods for nonlinear optimization MMA and GCMMA two methods for nonlnear optmzaton Krster Svanberg Optmzaton and Systems Theory, KTH, Stockholm, Sweden. krlle@math.kth.se Ths note descrbes the algorthms used n the author s 2007 mplementatons

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

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

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

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

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

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

Difference Equations

Difference Equations Dfference Equatons c Jan Vrbk 1 Bascs Suppose a sequence of numbers, say a 0,a 1,a,a 3,... s defned by a certan general relatonshp between, say, three consecutve values of the sequence, e.g. a + +3a +1

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

Geometry of Müntz Spaces

Geometry of Müntz Spaces WDS'12 Proceedngs of Contrbuted Papers, Part I, 31 35, 212. ISBN 978-8-7378-224-5 MATFYZPRESS Geometry of Müntz Spaces P. Petráček Charles Unversty, Faculty of Mathematcs and Physcs, Prague, Czech Republc.

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

The Second Eigenvalue of Planar Graphs

The Second Eigenvalue of Planar Graphs Spectral Graph Theory Lecture 20 The Second Egenvalue of Planar Graphs Danel A. Spelman November 11, 2015 Dsclamer These notes are not necessarly an accurate representaton of what happened n class. The

More information

SPECTRAL PROPERTIES OF IMAGE MEASURES UNDER THE INFINITE CONFLICT INTERACTION

SPECTRAL PROPERTIES OF IMAGE MEASURES UNDER THE INFINITE CONFLICT INTERACTION SPECTRAL PROPERTIES OF IMAGE MEASURES UNDER THE INFINITE CONFLICT INTERACTION SERGIO ALBEVERIO 1,2,3,4, VOLODYMYR KOSHMANENKO 5, MYKOLA PRATSIOVYTYI 6, GRYGORIY TORBIN 7 Abstract. We ntroduce the conflct

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

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

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

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

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

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

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

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

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

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

Affine and Riemannian Connections

Affine and Riemannian Connections Affne and Remannan Connectons Semnar Remannan Geometry Summer Term 2015 Prof Dr Anna Wenhard and Dr Gye-Seon Lee Jakob Ullmann Notaton: X(M) space of smooth vector felds on M D(M) space of smooth functons

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

Lecture 10 Support Vector Machines II

Lecture 10 Support Vector Machines II Lecture 10 Support Vector Machnes II 22 February 2016 Taylor B. Arnold Yale Statstcs STAT 365/665 1/28 Notes: Problem 3 s posted and due ths upcomng Frday There was an early bug n the fake-test data; fxed

More information

5 The Rational Canonical Form

5 The Rational Canonical Form 5 The Ratonal Canoncal Form Here p s a monc rreducble factor of the mnmum polynomal m T and s not necessarly of degree one Let F p denote the feld constructed earler n the course, consstng of all matrces

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

Math 702 Midterm Exam Solutions

Math 702 Midterm Exam Solutions Math 702 Mdterm xam Solutons The terms measurable, measure, ntegrable, and almost everywhere (a.e.) n a ucldean space always refer to Lebesgue measure m. Problem. [6 pts] In each case, prove the statement

More information

Deriving the X-Z Identity from Auxiliary Space Method

Deriving the X-Z Identity from Auxiliary Space Method Dervng the X-Z Identty from Auxlary Space Method Long Chen Department of Mathematcs, Unversty of Calforna at Irvne, Irvne, CA 92697 chenlong@math.uc.edu 1 Iteratve Methods In ths paper we dscuss teratve

More information

a b a In case b 0, a being divisible by b is the same as to say that

a b a In case b 0, a being divisible by b is the same as to say that Secton 6.2 Dvsblty among the ntegers An nteger a ε s dvsble by b ε f there s an nteger c ε such that a = bc. Note that s dvsble by any nteger b, snce = b. On the other hand, a s dvsble by only f a = :

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

Module 3 LOSSY IMAGE COMPRESSION SYSTEMS. Version 2 ECE IIT, Kharagpur

Module 3 LOSSY IMAGE COMPRESSION SYSTEMS. Version 2 ECE IIT, Kharagpur Module 3 LOSSY IMAGE COMPRESSION SYSTEMS Verson ECE IIT, Kharagpur Lesson 6 Theory of Quantzaton Verson ECE IIT, Kharagpur Instructonal Objectves At the end of ths lesson, the students should be able to:

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

Graph Reconstruction by Permutations

Graph Reconstruction by Permutations Graph Reconstructon by Permutatons Perre Ille and Wllam Kocay* Insttut de Mathémathques de Lumny CNRS UMR 6206 163 avenue de Lumny, Case 907 13288 Marselle Cedex 9, France e-mal: lle@ml.unv-mrs.fr Computer

More information

An Introduction to Morita Theory

An Introduction to Morita Theory An Introducton to Morta Theory Matt Booth October 2015 Nov. 2017: made a few revsons. Thanks to Nng Shan for catchng a typo. My man reference for these notes was Chapter II of Bass s book Algebrac K-Theory

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

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

Week 2. This week, we covered operations on sets and cardinality.

Week 2. This week, we covered operations on sets and cardinality. Week 2 Ths week, we covered operatons on sets and cardnalty. Defnton 0.1 (Correspondence). A correspondence between two sets A and B s a set S contaned n A B = {(a, b) a A, b B}. A correspondence from

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

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

12 MATH 101A: ALGEBRA I, PART C: MULTILINEAR ALGEBRA. 4. Tensor product

12 MATH 101A: ALGEBRA I, PART C: MULTILINEAR ALGEBRA. 4. Tensor product 12 MATH 101A: ALGEBRA I, PART C: MULTILINEAR ALGEBRA Here s an outlne of what I dd: (1) categorcal defnton (2) constructon (3) lst of basc propertes (4) dstrbutve property (5) rght exactness (6) localzaton

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

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

Another converse of Jensen s inequality

Another converse of Jensen s inequality Another converse of Jensen s nequalty Slavko Smc Abstract. We gve the best possble global bounds for a form of dscrete Jensen s nequalty. By some examples ts frutfulness s shown. 1. Introducton Throughout

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

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

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

Random Partitions of Samples

Random Partitions of Samples Random Parttons of Samples Klaus Th. Hess Insttut für Mathematsche Stochastk Technsche Unverstät Dresden Abstract In the present paper we construct a decomposton of a sample nto a fnte number of subsamples

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

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

ISSN: ISO 9001:2008 Certified International Journal of Engineering and Innovative Technology (IJEIT) Volume 3, Issue 1, July 2013

ISSN: ISO 9001:2008 Certified International Journal of Engineering and Innovative Technology (IJEIT) Volume 3, Issue 1, July 2013 ISSN: 2277-375 Constructon of Trend Free Run Orders for Orthogonal rrays Usng Codes bstract: Sometmes when the expermental runs are carred out n a tme order sequence, the response can depend on the run

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

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

= z 20 z n. (k 20) + 4 z k = 4

= z 20 z n. (k 20) + 4 z k = 4 Problem Set #7 solutons 7.2.. (a Fnd the coeffcent of z k n (z + z 5 + z 6 + z 7 + 5, k 20. We use the known seres expanson ( n+l ( z l l z n below: (z + z 5 + z 6 + z 7 + 5 (z 5 ( + z + z 2 + z + 5 5

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

A note on almost sure behavior of randomly weighted sums of φ-mixing random variables with φ-mixing weights

A note on almost sure behavior of randomly weighted sums of φ-mixing random variables with φ-mixing weights ACTA ET COMMENTATIONES UNIVERSITATIS TARTUENSIS DE MATHEMATICA Volume 7, Number 2, December 203 Avalable onlne at http://acutm.math.ut.ee A note on almost sure behavor of randomly weghted sums of φ-mxng

More information

Lecture 12: Discrete Laplacian

Lecture 12: Discrete Laplacian Lecture 12: Dscrete Laplacan Scrbe: Tanye Lu Our goal s to come up wth a dscrete verson of Laplacan operator for trangulated surfaces, so that we can use t n practce to solve related problems We are mostly

More information

6.854J / J Advanced Algorithms Fall 2008

6.854J / J Advanced Algorithms Fall 2008 MIT OpenCourseWare http://ocw.mt.edu 6.854J / 18.415J Advanced Algorthms Fall 2008 For nformaton about ctng these materals or our Terms of Use, vst: http://ocw.mt.edu/terms. 18.415/6.854 Advanced Algorthms

More information

NUMERICAL DIFFERENTIATION

NUMERICAL DIFFERENTIATION NUMERICAL DIFFERENTIATION 1 Introducton Dfferentaton s a method to compute the rate at whch a dependent output y changes wth respect to the change n the ndependent nput x. Ths rate of change s called the

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

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

Appendix for Causal Interaction in Factorial Experiments: Application to Conjoint Analysis

Appendix for Causal Interaction in Factorial Experiments: Application to Conjoint Analysis A Appendx for Causal Interacton n Factoral Experments: Applcaton to Conjont Analyss Mathematcal Appendx: Proofs of Theorems A. Lemmas Below, we descrbe all the lemmas, whch are used to prove the man theorems

More information

Polynomials. 1 More properties of polynomials

Polynomials. 1 More properties of polynomials Polynomals 1 More propertes of polynomals Recall that, for R a commutatve rng wth unty (as wth all rngs n ths course unless otherwse noted), we defne R[x] to be the set of expressons n =0 a x, where a

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

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

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

Errors for Linear Systems

Errors for Linear Systems Errors for Lnear Systems When we solve a lnear system Ax b we often do not know A and b exactly, but have only approxmatons  and ˆb avalable. Then the best thng we can do s to solve ˆx ˆb exactly whch

More information

The Second Anti-Mathima on Game Theory

The Second Anti-Mathima on Game Theory The Second Ant-Mathma on Game Theory Ath. Kehagas December 1 2006 1 Introducton In ths note we wll examne the noton of game equlbrum for three types of games 1. 2-player 2-acton zero-sum games 2. 2-player

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

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