|
|
- Meredith Snow
- 5 years ago
- Views:
Transcription
1 Max-Planck-Institut fur Mathematik in den Naturwissenschaften Leipzig Conditions for equality of hulls in the calculus of variations by Georg Dolzmann, Bernd Kirchheim and Jan Kristensen Preprint no.: 1 000
2
3 CONDITIONS FOR EQUALITY OF HULLS IN THE CALCULUS OF VARIATIONS GEORG DOLZMANN BERND KIRCHHEIM JAN KRISTENSEN Abstract. We simplify and sharpen several results by K. Zhang concerning properties of quasiconvex hulls of sets and quasiconvex envelopes of their distance functions. The approach emphasizes the underlying geometry and in particular we show thatk pc = K c implies K rc = K c if and only if minfm ng thus answering a question raised in [Z]. This paper addresses a surprising relation between semiconvex hulls of compact sets K M mn rst noted by Zhang [Z], namely that K qc = K c implies K rc = K c and thus K rc = K qc. Our approach simplies the original proof given by Zhang and emphasizes more the underlying geometry. As pointed out to us by D. Preiss [P], this implication constitutes a nonlinear version of the result that subspaces without rank-one directions do not support any nontrivial gradient Young measure (see [BFJK], Theorem 4.1). In particular, based on results by [T, Se, B], this equivalence allows us to show that Zhang's statement holds for the polyconvex hull if and only if minfm ng, see Theorem 3 and the following remark. Thus the rank-one convex and the quasiconvex hulls agree for special sets K with K qc = K c, despite of the fact that rank-one convexity and quasiconvexity are known to be dierent concepts for m 3 ([Sv1]). In general the quasiconvex hull of a compact set is equal to the zero set of the quasiconvexication of the distance function d K p (x) = inffjx ; yj p : y Kg, p [1 1) (see [Z3]), and this motivates to study general properties of distance functions and their semiconvex envelopes. We show in Example 5 that one cannot expect a uniform growth of d qc K p () close to Kqc. Moreover, Example 6 demonstrates that smooth sets need not have smooth quasiconvex hulls. Both results indicate that numerical schemes are likely to produce unreliable results, unless the boundary of the set is well resolved. Our last result, Theorem 9, proves the surprising fact that the distance function itself cannot be used as an indicator of whether a given set is quasiconvex or not. In fact, d K p () is separately convex (i.e. convex in each argument, a property implied by quasiconvexity) on M mn n B(0 R), R arbitrarily large, if and only if K is convex. This was rst proven in [Z3] for p under stronger assumptions on the set K. Our selfcontained proof relies entirely on the well-known fact that the metric projection onto K is unique if and only if K is convex. Notation. Let M mn be the space of all real (m n){matrices. We use jj for the Euclidean norm on M mn, i.e. jxj = tr(x T x). By dim(k) we understand the ane dimension of the set K M mn. We write B(K ") =fx M mn : d K 1 (x) "g U(K ") =fx M mn : d K 1 (x) <"g: A function f : M mn! R is called polyconvex if there exists a convex function g of x and the vector M(x) of all minors of x (i.e. all subdeterminants of x) such that f(x) =g(x M(x)). It is Date: December 31, Mathematics Subject Classication. 6B15, 74N15. Key words and phrases. Gradient Young measures, quasiconvex hull, distance function. GD, BK and JK were supported by the EU TMR project on `Phase Transitions in Crystalline Solids' FMRX-CT98-09 (DG 1-BDCN). JK gratefully acknowledges partial support from the Max Planck Institute for Mathematics in the Sciences, Leipzig, and from EPSRC through grant GR/L906. 1
4 GEORG DOLZMANN BERND KIRCHHEIM JAN KRISTENSEN said to be quasiconvex if for all x M mn and all smooth functions ' : Q =[0 1] n! R m with ' = 0on@Q the inequality Z Z f(x + D'(z))dz f(x)dz Q holds. Finally, f is rank-one convex if f is convex on rank-one lines, i.e., the functions t 7! g(t) = f(x + tr) are convex in t for all x r M mn, rank(r) = 1. A fundamental result in the calculus of variations states that a variational integral I(u) = R f(du)dz is weakly sequentially lower semicontinuous in suitable function spaces if and only if f is quasiconvex. Polyconvexity is a sucient condition for quasiconvexity while rank-one convexity is a necessary one. For any function f : M mn! R we call f qc (x) = supfg(x) : g : M mn! R quasiconvex and g fg the quasiconvex envelope of f the rank-one convex and the polyconvex envelope are dened analogously. In analogy to one possible formula for the (closed) convex hull of a compact set K, denoted by K c,we dene its (closed) quasiconvex hull by K qc = fx : f(x) sup f(y) for all f : M mn! R quasiconvexg: yk A corresponding denition holds for the rank-one convex hull K rc and the polyconvex hull K pc. It is a useful fact that K qc can also be dened as the set of barycenters of gradient Young measures supported on K. In addition to these hulls related to classes of semiconvex functions we dene the closed lamination convex hull L c (K) ofk as the closure of the set L(K) = S 1 i=0 L i(k) where L 0 (K) =K and L i+1 (K) = x = a +(1; )b : [0 1] a b L i (K) rank(a ; b) 1 : These denitions imply immediately that L c (K) K rc K qc K pc K c and it is an open question whether K rc = K qc in M. See [Mu] for a discussion of these notions and their relations. Lemma 1. Let K M mn becompact, contained in the ane subspace X and let H be a hyperplane in X supporting K c. Then (K \ H) qc = K qc \ H and (K \ H) c = K c \ H. Proof. By denition our assumption means that there exists a linear f : X! R such that H = fx X : f(x) =maxf(k c )g. Given any x K qc \ H, we nd a gradient Young measure such that spt() K and x = R zd(z). Since Z Z f(x) = f(y) d(y) max f(k c ) d(y) =f(x) we conclude spt() H \ K. Consequently, x (K \ H) qc. The reverse inclusion is obvious and the same argument with probability measures instead of gradient Young measures proves the result for the convex hull. The following result was rst proven in [Z]. We include a short proof for the convenience of the reader. Theorem. Let K M mn becompact. If K qc = K c then L dim(k) (K) =K c. Proof. Otherwise we nd among all compact sets for which the conclusion fails a set K 0 of minimal ane dimension d 0 1. Let X be the d 0 -dimensional ane subspace containing K 0. We choose x 0 K0 c n L d 0 (K 0 ): If X does not contain any rank-one line then K 0 = K qc 0 by [BFJK, Theorem 4.1] and hence K0 c = Kqc 0 = L 0(K 0 ), acontradiction. Therefore we nd in X a rank-one line ` through x 0 and a point x 1 (` X K0) c n L d0 ;1(K 0 ) Q
5 CONDITIONS FOR EQUALITY OF HULLS IN THE CALCULUS OF VARIATIONS 3 (if x X K c 0 then we maychoose x 1 = x 0 ). Let H X be a supporting hyperplane of K c 0 through x 1. We have by Lemma 1 for K 1 = H \ K 0 that but K qc 1 = H \ (K 0) qc = H \ K c 0 = K c 1 x 1 K c 1 n L d 0 ;1(K 0 ) K c 1 n L d 0 ;1(K 1 ): This contradicts the minimality ofd 0 and proves the proposition. Motivated by a remark by D. Preiss we notice the following. Theorem was proved using the result from [BFJK] that in subspaces without rank-one directions all sets are quasiconvex. It turns out that this result is also implied by Theorem. Theorem 3. Assume that X is a linear subspace of M mn not containing any rank-one line. Suppose that for every K X compact K pc = K c (K qc = K c ) implies L c (K) =K c. Then every compact subset of X is polyconvex (quasiconvex). Proof. We consider the case of polyconvexity only, the argument in the quasiconvex situation is similar. Assume that the conclusion fails. Then we can x K X compact and x K pc nb(k 3") for some " > 0. Let K ~ = (B(K ") \ X) c n U(x ") then K ~ is compact, and obviously K ~ B(K ") \ X. Since taking the polyconvex hull commutes with translations we obtain ~K c (B(K ") \ X) c ~ K [ (B(x ") \ X) ~ K [ (B(K ") \ X) pc ~ K pc : The opposite inclusion is true in general, hence ~ K c = ~ K pc. On the other hand, x ~ K c n ~ K shows that ~ K c 6= ~ K but by our assumption on X we have ~ K = Lc ( ~ K)= ~ K c, a contradiction. Remark. This equivalence allows us to answer a question raised in [Z] whether the polyconvex version of Theorem holds: if K pc = K c, then L dim(k) (K) =K c. The paper [B] contains an example of a subspace of M 33 without rank-one matrices but with a subset that is not polyconvex. On the other hand, as pointed out in [B] the results from [T] (see also [Se]) imply the following: Whenever a linear subspace X of M m or M m does not contain any rank-one line then all compact subsets of X are polyconvex. This shows that the polyconvex variant of Theorem is true if and only if min(m n). As in [Z] we obtain easily a comparision principle for distance functions. By denition, d qc, but there holds also a reversed verion of this inequality. d qc K\H Proposition 4. Let p [1 1), K M mn be compact and let H be a supporting hyperplane of K. Then there is a non-decreasing, continuous function W H :[0 1)! [0 1) such that W H (0) = 0 and d qc K\H p (x) W H(d qc K p (x)) for all x H: Proof. Assume otherwise. Then there exists a positive " and a sequence fx k g 1 k=1 H such that d qc K\H p (x k) >"but d qc K p (x k) < 1=k for all k 1. Since d qc K p () majorises the convex function x! (maxf0 jxj ;maxfjyj y Kgg) p, we can suppose that x k! x 0 H. Then obviously d qc K p (x 0)=0 but d qc K\H p (x 0) ", which implies (see [Z1]) that x 0 K qc \ H n (K \ H) qc. This contradiction to Lemma 1 nishes our proof. The argument just used also proves that for all quasiconvex, compact sets K and all p [1 1) there exist non-decreasing, continuous functions W K p :[0 1)! [0 1) such that W K p (0) = 0 and d K p (x) W K p (d qc K p (x)) for all x M mn : Our next example shows that the quantiers cannot be interchanged. K
6 4 GEORG DOLZMANN BERND KIRCHHEIM JAN KRISTENSEN Example 5. For all p [1 1) and all non-decreasing, continuous functions W :[0 1)! [0 1) with W (0) = 0 there exist a compact quasiconvex set K and a sequence fx k g in M such that d K p (x k )=W (d qc K p (x k))!1and d K p (x k )! 0: Proof. In the construction we use the isometric embedding of R into M which identies x with diag(x 1 x ). Choose a sequence fb k g 1 k=1 strictly decreasing to zero such that W (bp k ) < ;p(k+) =k. Now wedene K = f( ;k b k ) : k 1g[f(0 0)g and x k =(3 ;k; b k+1 ): Obviously, d K p (x k ) dist(3 ;k; proj 1 (K)) p ;(k+)p, where proj 1 denotes the projection x 7! x 11. Since (1 0) is a rank-one direction, we can estimate d rc K p(x k ) 1 d K p ( ;k;1 b k+1 )+d K p ( ;k b k+1 ) (b k ; b k+1 ) p b p k and hence d K p (x k )=W (d rc K p (x k)) ;(k+)p =W (b p k ) k. On the other hand K is quasiconvex (even polyconvex) since det(x ; y) > 0 for any x y K, x 6= y, see [Sv]. Example 6. There exists a smooth set U M such that U qc is not smooth, in the sense that Tan(U qc x) (see e.g. [F, Denition 4.3]), is not a linear subspace for a suitable x U qc. This contrasts with the situation for convex hulls, where it is easily seen that the convex hull of a smooth compact set is again smooth. To keep the calculations simple, we use conformal and anticonformal coordinates, i.e., we make the identication x R 4 x1 + x = 3 ;x + x 4 M x + x 4 x 1 ; x : 3 Then det(x) =x 1 + x ; x 3 ; x 4 and jxj =(x 1 + x + x 3 + x 4 ). We dene on R4 the function q f(x) = x 1 + x ; + x 3 + x 4 ; and dene U = fx : f(x) < 0g. Note that even on the larger set of all x with f(x) < 1 the gradient p x rf(x) = 1 + x p ; (x x 1 + x 1 e 1 + x e )+(x 3 e 3 + x 4 e 4 ) is a non-vanishing C 1 function. is a smooth set containing all points x with j(x 1 x )j = j(x 3 x 4 )j =1. This implies of course that 0 ( U) rc and therefore x ( U) rc whenever det(x) =0 and jxj. On the other hand, we have forv =(1 1) R and all x U hv (j(x 1 x )j j(x 3 x 4 )j)i hv ( 0)i ;jvj (j(x 1 x )j j(x 3 x 4 )j) ; ( 0) > ; =0 consequently det(x) > 0 whenever x U. This shows that ( U) pc fx : det(x) 0g and in particular none of the sets ( U) rc ( U) qc and ( U) pc is smooth at the origin. An easy, but slightly longer calculation also shows that the same holds true for the (boundary of) the hulls U rc U qc and U pc of the open set U itself. In the last part of this note we extend results from [Z3] concerning the square of the distance function to the case of arbitrary powers. We apply a more elementary and selfcontained reasoning which does not rely on the precise knowledge of the quasiconvex envelope of the squared distance to a double-well (see [K]). Instead we use the following estimate the proof of which weleave to the reader.
7 CONDITIONS FOR EQUALITY OF HULLS IN THE CALCULUS OF VARIATIONS 5 Lemma 7. Let K M mn be a compact set and p [1 1). Suppose x M mn and y K are such that jx ; yj = d K 1 (x) > 0. Then we have for all v M mn that lim sup t&0 d K p (x + tv) ; d K p (x) t jx + tv ; yj;jx ; yj x ; y p d K p;1 (x) lim = p d K p;1 (x)hv t&0 t jy ; xj i: As in [Z3], the crucial point in our proof is the nonuniqueness of the metric projection onto nonconvex sets. For the convenience of the reader we give a short proof of this fact following [F]. Theorem 8. Let K M mn be compact and suppose that for every x M mn there exists a unique point (x) K such that j(x) ; xj = d K 1 (x). Then K is convex. Proof. Throughout the proof we write d(x) =d K 1 (x). As d(y) d(x)+jx;yj, d is 1-Lipschitz. Hence, if x k! x and (x k )! y then (x) =y which together with the compactness of K proves that is continuous. We rst assert that for all x = K, and all t nonnegative ; (x)+t(x ; (x)) = (x). Otherwise there exists an x 6 K for which the assertion fails. Using uniqueness of the nearest point it is easy to check that the set of t for which the required equality holds is a closed interval [0 T], T 1. Let ~x = (x)+t (x ; (x)). The continuity of and Peano's existence theorem ([W], x7) allow us to choose a positive " <d(~x) and a curve ' :(;" ")! M mn such that '(0) = ~x and ' 0 (t) = (('(t)) ; '(t))=j('(t)) ; '(t)j. Now consider the real-valued function t 7! (d ')(t). From Lemma 7 we infer that its derivative from the right, (d ') 0 +(t), is bounded from above by ;1 for all t (;" ") and hence j'(p) ; '(q)j d('(p)) ; d('(q)) q ; p if ; "<p<q<". On the other hand, as j' 0 (t)j 1 on (;" "), we also obtain j'(p) ; '(q)j jp ; qj for all p q. Both estimates together imply d('(p)) ; d('(q)) = j'(p) ; '(q)j = q ; p whenever ; "<p<q<": The strict convexity of the Euclidean norm implies that '((;" ")) is a segment, which is due to the direction of ' 0 (0) contained in the ray f(x) +t(x ; (x)) : t > 0g. This shows that d('(p)) = d('(0)) ; p = j'(p) ; (x)j for all p (;" ") andby uniqueness of the metric projection ('(p)) = (x). This contradicts the maximality of T, and the claim is established. We conclude that for any x = K and t arbitrarily large K \ U((x)+t(x ; (x)) tjx ; (x)j) =. In the limit t!1we obtain hx x ; (x)i > h(x) x; (x)i = maxfhy x ; (x)i : y Kg which represents K as the intersection of halfspaces and nishes our proof. We are now in a position to generalize the results in [Z3] for the squared distance function to arbitrary powers under weaker assumptions on K. Theorem 9. Let K M mn be compact, let p [1 1), and assume that d K p is a separately convex function outside of some compact set. If M mn n K is connected, then K is convex. Proof. By assumption we may choose a nite R such that d K p is separately convex whenever restricted to a ball disjoint with K ~ = B(K R). We rst show that the metric projection onto K is unique in each point x = K. ~ Otherwise we nd x 6 K ~ and y1 y K, y 1 6= y, such that jy i ; xj = d K 1 (x), and we may assume that hy ; y 1 e j i < 0 for some canonical basis vector e j. We estimate using Lemma 7 that d K p (x + te j )+d K p (x ; te j ) ; d K p (x) lim sup t&0 t x ; y 1 p d K p;1 (x) he j jx ; y 1 j i + h;e x ; y j jx ; y j i = p d K p;1 (x)he j y ; y 1 jy 1 ; xj i < 0: This implies that d K p is not separately convex near x, acontradiction. Next, note that the metric projection onto the enlarged set K ~ is unique on the whole space mn M. Uniqueness is trivial for points in K, ~ so we may suppose that x = K. ~ Consider z1 z K ~ with
8 6 GEORG DOLZMANN BERND KIRCHHEIM JAN KRISTENSEN jz i ; xj = d ~K 1 (x) d K 1 (x) ; R, and y i K with jz i ; y i j = R. This implies jx ; y i jd K 1 (x), and thus y 1 = y = K (x) by the claim already established. Moreover, as jx ; K (x)j = jx ; z i j + jz i ; K (x)j we see that both z 1 z are in the segment [ K (x) x] and because furthermore jz 1 ; K (x)j = R = jz ; K (x)j, z 1 = z, so ~K (x) is unique. In particular, due to the foregoing theorem, ~ K is a convex set. Now, we show that@k c K. In fact, given any c there is a unit vector v M mn such that hx vi =maxfhy vi : y Kg. The convexity of ~ K implies that x + Rv ~ K as well, but it is easy to check that B(x + Rv R) \ K B(x + Rv R) \fy : hy vi hx vig = fxg: By denition of ~ K this shows that x K as required. We nish our proof by showing c K and M mn nk connected imply that K is convex. This statement is similar to Lemma.1 in [Z3], but slightly more general. To verify our assertion, choose any y = K and connect it by an arc ' inside M mn n K to a point x suciently far away from the origin to ensure that x = K c. By assumption, ' does not c, and we thus infer that y = K c. This concludes the proof of the theorem. References [B] J.M. Ball, Remarks on the paper: \Basic calculus of variations", Pacic J. Math. 116 (1) (1985), [BFJK] K. Bhattacharya, N.B. Firoozye, R.D. James, R.V. Kohn, Restrictions on Microstructures, Proc. Royal Soc. Edinburgh A 14 (1994), [F] H. Federer, Curvature measures, Trans. Amer. Math. Soc. 93 (1959), [K] R.V. Kohn, The relaxation of a double-well energy, Cont. Mech. Therm. 3 (1991), [Mu] S. Muller, Variational methods for microstructure and phase transitions, to appear in: Proc. C.I.M.E. summer school `Calculus of variations and geometric evolution problems', Cetraro, 1996, (S. Hildebrandt and M. Struwe, eds.), [P] D. Preiss, personal communication, 1997 [Se] D. Serre, Formes quadratiques et calcul des variations, J. Math. Pures Appl. 6 () (1983), [Sv1] V. Sverak, Rank-one convexity does not imply quasiconvexity, Proc. Royal Soc. Edinburgh Sect. A 10 (199), [Sv] V. Sverak, On Tartar's Conjecture, Ann. Inst. Henri Poincare 10 (4) (1993), [T] F.J. Terpsta, Die Darstellung biquadratischer Formen als Summe von Quadraten mit Anwendung auf die Variationsrechnung, Math. Annalen 116 (1938), [W] W. Walter, Ordinary Dierential Equations, Springer [Z1] K.W. Zhang, Quasiconvex functions, SO(n) and two elastic wells, Ann. Inst. H. Poincare 14 (1997), [Z] K.W. Zhang, On various semiconvex hulls in the calculus of variations, Calc. Var. PDE 6 (1998), [Z3] K.W. Zhang, On various semiconvex relaxations of the squared distance function, to appear in Proc. Royal Soc. Edinburgh. Georg Dolzmann, Max Planck Institute for Mathematics in the Sciences, Inselstr. -6, D Leipzig, Germany address: georg@mis.mpg.de Bernd Kirchheim, Max Planck Institute for Mathematics in the Sciences, Inselstr. -6, D Leipzig, Germany address: bk@mis.mpg.de Jan Kristensen, Mathematical Institute, University of Oxford, 4-9 St Giles, Oxford OX1 3LB, England address: kristens@maths.ox.ac.uk
2 BAISHENG YAN When L =,it is easily seen that the set K = coincides with the set of conformal matrices, that is, K = = fr j 0 R 2 SO(n)g: Weakly L-qu
RELAXATION AND ATTAINMENT RESULTS FOR AN INTEGRAL FUNCTIONAL WITH UNBOUNDED ENERGY-WELL BAISHENG YAN Abstract. Consider functional I(u) = R jjdujn ; L det Duj dx whose energy-well consists of matrices
More informationON TRIVIAL GRADIENT YOUNG MEASURES BAISHENG YAN Abstract. We give a condition on a closed set K of real nm matrices which ensures that any W 1 p -grad
ON TRIVIAL GRAIENT YOUNG MEASURES BAISHENG YAN Abstract. We give a condition on a closed set K of real nm matrices which ensures that any W 1 p -gradient Young measure supported on K must be trivial the
More informationRegularity of Minimizers in Nonlinear Elasticity the Case of a One-Well Problem in Nonlinear Elasticity
TECHNISCHE MECHANIK, 32, 2-5, (2012), 189 194 submitted: November 1, 2011 Regularity of Minimizers in Nonlinear Elasticity the Case of a One-Well Problem in Nonlinear Elasticity G. Dolzmann In this note
More informationEstimates of Quasiconvex Polytopes in the Calculus of Variations
Journal of Convex Analysis Volume 13 26), No. 1, 37 5 Estimates of Quasiconvex Polytopes in the Calculus of Variations Kewei Zhang epartment of Mathematics, University of Sussex, Falmer, Brighton, BN1
More informationMax-Planck-Institut fur Mathematik in den Naturwissenschaften Leipzig Uniformly distributed measures in Euclidean spaces by Bernd Kirchheim and David Preiss Preprint-Nr.: 37 1998 Uniformly Distributed
More informationAn O(n) invariant rank 1 convex function that is not polyconvex
THEORETICAL AND APPLIED MECHANICS vol. 28-29, pp. 325-336, Belgrade 2002 Issues dedicated to memory of the Professor Rastko Stojanović An O(n) invariant rank 1 convex function that is not polyconvex M.
More informationA NUMERICAL ITERATIVE SCHEME FOR COMPUTING FINITE ORDER RANK-ONE CONVEX ENVELOPES
A NUMERICAL ITERATIVE SCHEME FOR COMPUTING FINITE ORDER RANK-ONE CONVEX ENVELOPES XIN WANG, ZHIPING LI LMAM & SCHOOL OF MATHEMATICAL SCIENCES, PEKING UNIVERSITY, BEIJING 87, P.R.CHINA Abstract. It is known
More informationNear convexity, metric convexity, and convexity
Near convexity, metric convexity, and convexity Fred Richman Florida Atlantic University Boca Raton, FL 33431 28 February 2005 Abstract It is shown that a subset of a uniformly convex normed space is nearly
More informationExtreme points of compact convex sets
Extreme points of compact convex sets In this chapter, we are going to show that compact convex sets are determined by a proper subset, the set of its extreme points. Let us start with the main definition.
More informationTartar s conjecture and localization of the quasiconvex hull in R 2 2
Tartar s conjecture and localization of the quasiconvex hull in R 2 2 Daniel Faraco and László Székelyhidi Jr. Abstract We give a concrete and surprisingly simple characterization of compact sets K R 2
More informationA projection-type method for generalized variational inequalities with dual solutions
Available online at www.isr-publications.com/jnsa J. Nonlinear Sci. Appl., 10 (2017), 4812 4821 Research Article Journal Homepage: www.tjnsa.com - www.isr-publications.com/jnsa A projection-type method
More informationUSING FUNCTIONAL ANALYSIS AND SOBOLEV SPACES TO SOLVE POISSON S EQUATION
USING FUNCTIONAL ANALYSIS AND SOBOLEV SPACES TO SOLVE POISSON S EQUATION YI WANG Abstract. We study Banach and Hilbert spaces with an eye towards defining weak solutions to elliptic PDE. Using Lax-Milgram
More informationANNALES DE L I. H. P., SECTION C
ANNALES DE L I. H. P., SECTION C JAN KRISTENSEN On the non-locality of quasiconvexity Annales de l I. H. P., section C, tome 16, n o 1 (1999), p. 1-13
More informationMath 341: Convex Geometry. Xi Chen
Math 341: Convex Geometry Xi Chen 479 Central Academic Building, University of Alberta, Edmonton, Alberta T6G 2G1, CANADA E-mail address: xichen@math.ualberta.ca CHAPTER 1 Basics 1. Euclidean Geometry
More information290 J.M. Carnicer, J.M. Pe~na basis (u 1 ; : : : ; u n ) consisting of minimally supported elements, yet also has a basis (v 1 ; : : : ; v n ) which f
Numer. Math. 67: 289{301 (1994) Numerische Mathematik c Springer-Verlag 1994 Electronic Edition Least supported bases and local linear independence J.M. Carnicer, J.M. Pe~na? Departamento de Matematica
More informationRearrangements and polar factorisation of countably degenerate functions G.R. Burton, School of Mathematical Sciences, University of Bath, Claverton D
Rearrangements and polar factorisation of countably degenerate functions G.R. Burton, School of Mathematical Sciences, University of Bath, Claverton Down, Bath BA2 7AY, U.K. R.J. Douglas, Isaac Newton
More informationFrom Isometric Embeddings to Turbulence
From Isometric Embeddings to Turbulence László Székelyhidi Jr. (Bonn) Programme for the Cours Poupaud 15-17 March 2010, Nice Monday Morning Lecture 1. The Nash-Kuiper Theorem In 1954 J.Nash shocked the
More informationConvex Geometry. Carsten Schütt
Convex Geometry Carsten Schütt November 25, 2006 2 Contents 0.1 Convex sets... 4 0.2 Separation.... 9 0.3 Extreme points..... 15 0.4 Blaschke selection principle... 18 0.5 Polytopes and polyhedra.... 23
More informationSemi-strongly asymptotically non-expansive mappings and their applications on xed point theory
Hacettepe Journal of Mathematics and Statistics Volume 46 (4) (2017), 613 620 Semi-strongly asymptotically non-expansive mappings and their applications on xed point theory Chris Lennard and Veysel Nezir
More informationIntroduction to Real Analysis Alternative Chapter 1
Christopher Heil Introduction to Real Analysis Alternative Chapter 1 A Primer on Norms and Banach Spaces Last Updated: March 10, 2018 c 2018 by Christopher Heil Chapter 1 A Primer on Norms and Banach Spaces
More informationIntroduction and Preliminaries
Chapter 1 Introduction and Preliminaries This chapter serves two purposes. The first purpose is to prepare the readers for the more systematic development in later chapters of methods of real analysis
More informationLusin type theorem with quasiconvex hulls
Lusin type theorem with quasiconvex hulls Agnieszka Ka lamajska Institute of Mathematics, Warsaw University, ul. Banacha 2, 02 097 Warszawa, Poland We obtain Lusin type theorem showing that after extracting
More informationOptimality Conditions for Nonsmooth Convex Optimization
Optimality Conditions for Nonsmooth Convex Optimization Sangkyun Lee Oct 22, 2014 Let us consider a convex function f : R n R, where R is the extended real field, R := R {, + }, which is proper (f never
More information1 Directional Derivatives and Differentiability
Wednesday, January 18, 2012 1 Directional Derivatives and Differentiability Let E R N, let f : E R and let x 0 E. Given a direction v R N, let L be the line through x 0 in the direction v, that is, L :=
More informationChapter 2 Convex Analysis
Chapter 2 Convex Analysis The theory of nonsmooth analysis is based on convex analysis. Thus, we start this chapter by giving basic concepts and results of convexity (for further readings see also [202,
More informationHelly's Theorem and its Equivalences via Convex Analysis
Portland State University PDXScholar University Honors Theses University Honors College 2014 Helly's Theorem and its Equivalences via Convex Analysis Adam Robinson Portland State University Let us know
More informationExistence and Uniqueness
Chapter 3 Existence and Uniqueness An intellect which at a certain moment would know all forces that set nature in motion, and all positions of all items of which nature is composed, if this intellect
More informationUNIFORMLY DISTRIBUTED MEASURES IN EUCLIDEAN SPACES
MATH. SCAND. 90 (2002), 152 160 UNIFORMLY DISTRIBUTED MEASURES IN EUCLIDEAN SPACES BERND KIRCHHEIM and DAVID PREISS For every complete metric space X there is, up to a constant multiple, at most one Borel
More informationCourse 212: Academic Year Section 1: Metric Spaces
Course 212: Academic Year 1991-2 Section 1: Metric Spaces D. R. Wilkins Contents 1 Metric Spaces 3 1.1 Distance Functions and Metric Spaces............. 3 1.2 Convergence and Continuity in Metric Spaces.........
More informationGEOMETRIC APPROACH TO CONVEX SUBDIFFERENTIAL CALCULUS October 10, Dedicated to Franco Giannessi and Diethard Pallaschke with great respect
GEOMETRIC APPROACH TO CONVEX SUBDIFFERENTIAL CALCULUS October 10, 2018 BORIS S. MORDUKHOVICH 1 and NGUYEN MAU NAM 2 Dedicated to Franco Giannessi and Diethard Pallaschke with great respect Abstract. In
More informationCHAPTER 1. Metric Spaces. 1. Definition and examples
CHAPTER Metric Spaces. Definition and examples Metric spaces generalize and clarify the notion of distance in the real line. The definitions will provide us with a useful tool for more general applications
More informationTwo-dimensional examples of rank-one convex functions that are not quasiconvex
ANNALES POLONICI MATHEMATICI LXXIII.3(2) Two-dimensional examples of rank-one convex functions that are not quasiconvex bym.k.benaouda (Lille) andj.j.telega (Warszawa) Abstract. The aim of this note is
More information460 HOLGER DETTE AND WILLIAM J STUDDEN order to examine how a given design behaves in the model g` with respect to the D-optimality criterion one uses
Statistica Sinica 5(1995), 459-473 OPTIMAL DESIGNS FOR POLYNOMIAL REGRESSION WHEN THE DEGREE IS NOT KNOWN Holger Dette and William J Studden Technische Universitat Dresden and Purdue University Abstract:
More informationMath 5210, Definitions and Theorems on Metric Spaces
Math 5210, Definitions and Theorems on Metric Spaces Let (X, d) be a metric space. We will use the following definitions (see Rudin, chap 2, particularly 2.18) 1. Let p X and r R, r > 0, The ball of radius
More informationTOPOLOGICAL GROUPS MATH 519
TOPOLOGICAL GROUPS MATH 519 The purpose of these notes is to give a mostly self-contained topological background for the study of the representations of locally compact totally disconnected groups, as
More informationYuqing Chen, Yeol Je Cho, and Li Yang
Bull. Korean Math. Soc. 39 (2002), No. 4, pp. 535 541 NOTE ON THE RESULTS WITH LOWER SEMI-CONTINUITY Yuqing Chen, Yeol Je Cho, and Li Yang Abstract. In this paper, we introduce the concept of lower semicontinuous
More informationB. Appendix B. Topological vector spaces
B.1 B. Appendix B. Topological vector spaces B.1. Fréchet spaces. In this appendix we go through the definition of Fréchet spaces and their inductive limits, such as they are used for definitions of function
More informationTopological properties
CHAPTER 4 Topological properties 1. Connectedness Definitions and examples Basic properties Connected components Connected versus path connected, again 2. Compactness Definition and first examples Topological
More informationGENERALIZED CONVEXITY AND OPTIMALITY CONDITIONS IN SCALAR AND VECTOR OPTIMIZATION
Chapter 4 GENERALIZED CONVEXITY AND OPTIMALITY CONDITIONS IN SCALAR AND VECTOR OPTIMIZATION Alberto Cambini Department of Statistics and Applied Mathematics University of Pisa, Via Cosmo Ridolfi 10 56124
More informationOptimization and Optimal Control in Banach Spaces
Optimization and Optimal Control in Banach Spaces Bernhard Schmitzer October 19, 2017 1 Convex non-smooth optimization with proximal operators Remark 1.1 (Motivation). Convex optimization: easier to solve,
More informationVector Space Basics. 1 Abstract Vector Spaces. 1. (commutativity of vector addition) u + v = v + u. 2. (associativity of vector addition)
Vector Space Basics (Remark: these notes are highly formal and may be a useful reference to some students however I am also posting Ray Heitmann's notes to Canvas for students interested in a direct computational
More information1182 L. B. Beasley, S. Z. Song, ands. G. Lee matrix all of whose entries are 1 and =fe ij j1 i m 1 j ng denote the set of cells. The zero-term rank [5
J. Korean Math. Soc. 36 (1999), No. 6, pp. 1181{1190 LINEAR OPERATORS THAT PRESERVE ZERO-TERM RANK OF BOOLEAN MATRICES LeRoy. B. Beasley, Seok-Zun Song, and Sang-Gu Lee Abstract. Zero-term rank of a matrix
More informationMath 426 Homework 4 Due 3 November 2017
Math 46 Homework 4 Due 3 November 017 1. Given a metric space X,d) and two subsets A,B, we define the distance between them, dista,b), as the infimum inf a A, b B da,b). a) Prove that if A is compact and
More information1 Topology Definition of a topology Basis (Base) of a topology The subspace topology & the product topology on X Y 3
Index Page 1 Topology 2 1.1 Definition of a topology 2 1.2 Basis (Base) of a topology 2 1.3 The subspace topology & the product topology on X Y 3 1.4 Basic topology concepts: limit points, closed sets,
More informationReal Analysis Math 131AH Rudin, Chapter #1. Dominique Abdi
Real Analysis Math 3AH Rudin, Chapter # Dominique Abdi.. If r is rational (r 0) and x is irrational, prove that r + x and rx are irrational. Solution. Assume the contrary, that r+x and rx are rational.
More informationNOWHERE LOCALLY UNIFORMLY CONTINUOUS FUNCTIONS
NOWHERE LOCALLY UNIFORMLY CONTINUOUS FUNCTIONS K. Jarosz Southern Illinois University at Edwardsville, IL 606, and Bowling Green State University, OH 43403 kjarosz@siue.edu September, 995 Abstract. Suppose
More informationPROPERTIES OF C 1 -SMOOTH FUNCTIONS WITH CONSTRAINTS ON THE GRADIENT RANGE Mikhail V. Korobkov Russia, Novosibirsk, Sobolev Institute of Mathematics
PROPERTIES OF C 1 -SMOOTH FUNCTIONS WITH CONSTRAINTS ON THE GRADIENT RANGE Mikhail V. Korobkov Russia, Novosibirsk, Sobolev Institute of Mathematics e-mail: korob@math.nsc.ru Using Gromov method of convex
More informationSubdifferential representation of convex functions: refinements and applications
Subdifferential representation of convex functions: refinements and applications Joël Benoist & Aris Daniilidis Abstract Every lower semicontinuous convex function can be represented through its subdifferential
More informationAuerbach bases and minimal volume sufficient enlargements
Auerbach bases and minimal volume sufficient enlargements M. I. Ostrovskii January, 2009 Abstract. Let B Y denote the unit ball of a normed linear space Y. A symmetric, bounded, closed, convex set A in
More informationThe small ball property in Banach spaces (quantitative results)
The small ball property in Banach spaces (quantitative results) Ehrhard Behrends Abstract A metric space (M, d) is said to have the small ball property (sbp) if for every ε 0 > 0 there exists a sequence
More informationMA651 Topology. Lecture 10. Metric Spaces.
MA65 Topology. Lecture 0. Metric Spaces. This text is based on the following books: Topology by James Dugundgji Fundamental concepts of topology by Peter O Neil Linear Algebra and Analysis by Marc Zamansky
More informationg 2 (x) (1/3)M 1 = (1/3)(2/3)M.
COMPACTNESS If C R n is closed and bounded, then by B-W it is sequentially compact: any sequence of points in C has a subsequence converging to a point in C Conversely, any sequentially compact C R n is
More informationCONVERGENCE OF APPROXIMATING FIXED POINTS FOR MULTIVALUED NONSELF-MAPPINGS IN BANACH SPACES. Jong Soo Jung. 1. Introduction
Korean J. Math. 16 (2008), No. 2, pp. 215 231 CONVERGENCE OF APPROXIMATING FIXED POINTS FOR MULTIVALUED NONSELF-MAPPINGS IN BANACH SPACES Jong Soo Jung Abstract. Let E be a uniformly convex Banach space
More informationMathematics 530. Practice Problems. n + 1 }
Department of Mathematical Sciences University of Delaware Prof. T. Angell October 19, 2015 Mathematics 530 Practice Problems 1. Recall that an indifference relation on a partially ordered set is defined
More informationSHARP BOUNDARY TRACE INEQUALITIES. 1. Introduction
SHARP BOUNDARY TRACE INEQUALITIES GILES AUCHMUTY Abstract. This paper describes sharp inequalities for the trace of Sobolev functions on the boundary of a bounded region R N. The inequalities bound (semi-)norms
More informationMATH 51H Section 4. October 16, Recall what it means for a function between metric spaces to be continuous:
MATH 51H Section 4 October 16, 2015 1 Continuity Recall what it means for a function between metric spaces to be continuous: Definition. Let (X, d X ), (Y, d Y ) be metric spaces. A function f : X Y is
More information1/12/05: sec 3.1 and my article: How good is the Lebesgue measure?, Math. Intelligencer 11(2) (1989),
Real Analysis 2, Math 651, Spring 2005 April 26, 2005 1 Real Analysis 2, Math 651, Spring 2005 Krzysztof Chris Ciesielski 1/12/05: sec 3.1 and my article: How good is the Lebesgue measure?, Math. Intelligencer
More informationNets Hawk Katz Theorem. There existsaconstant C>so that for any number >, whenever E [ ] [ ] is a set which does not contain the vertices of any axis
New York Journal of Mathematics New York J. Math. 5 999) {3. On the Self Crossing Six Sided Figure Problem Nets Hawk Katz Abstract. It was shown by Carbery, Christ, and Wright that any measurable set E
More information2 BAISHENG YAN The gradient matrix Du(x) is a well-dened n m-matrix for almost every x in : Therefore, in the sequel, the pointwise relations like (1.
RELAXATION OF CERTAIN PARTIAL DIFFERENTIAL RELATIONS IN SOBOLEV SPACES BAISHENG YAN Abstract. Many mappings in geometry, mechanics and control theory satisfy certain relations among their derivatives.
More informationWeak solutions to the stationary incompressible Euler equations
Weak solutions to the stationary incompressible Euler equations Antoine Choffrut September 29, 2014 University of Sussex Analysis & PDEs Seminar Euler s equations (1757) Motivation Conservation of energy
More information(1.) For any subset P S we denote by L(P ) the abelian group of integral relations between elements of P, i.e. L(P ) := ker Z P! span Z P S S : For ea
Torsion of dierentials on toric varieties Klaus Altmann Institut fur reine Mathematik, Humboldt-Universitat zu Berlin Ziegelstr. 13a, D-10099 Berlin, Germany. E-mail: altmann@mathematik.hu-berlin.de Abstract
More informationMultivariable Calculus
2 Multivariable Calculus 2.1 Limits and Continuity Problem 2.1.1 (Fa94) Let the function f : R n R n satisfy the following two conditions: (i) f (K ) is compact whenever K is a compact subset of R n. (ii)
More informationFIXED POINT METHODS IN NONLINEAR ANALYSIS
FIXED POINT METHODS IN NONLINEAR ANALYSIS ZACHARY SMITH Abstract. In this paper we present a selection of fixed point theorems with applications in nonlinear analysis. We begin with the Banach fixed point
More informationNOTES ON VECTOR-VALUED INTEGRATION MATH 581, SPRING 2017
NOTES ON VECTOR-VALUED INTEGRATION MATH 58, SPRING 207 Throughout, X will denote a Banach space. Definition 0.. Let ϕ(s) : X be a continuous function from a compact Jordan region R n to a Banach space
More informationChapter 2 Metric Spaces
Chapter 2 Metric Spaces The purpose of this chapter is to present a summary of some basic properties of metric and topological spaces that play an important role in the main body of the book. 2.1 Metrics
More informationON THE ARITHMETIC-GEOMETRIC MEAN INEQUALITY AND ITS RELATIONSHIP TO LINEAR PROGRAMMING, BAHMAN KALANTARI
ON THE ARITHMETIC-GEOMETRIC MEAN INEQUALITY AND ITS RELATIONSHIP TO LINEAR PROGRAMMING, MATRIX SCALING, AND GORDAN'S THEOREM BAHMAN KALANTARI Abstract. It is a classical inequality that the minimum of
More informationWinter Lecture 10. Convexity and Concavity
Andrew McLennan February 9, 1999 Economics 5113 Introduction to Mathematical Economics Winter 1999 Lecture 10 Convexity and Concavity I. Introduction A. We now consider convexity, concavity, and the general
More informationExamples of Dual Spaces from Measure Theory
Chapter 9 Examples of Dual Spaces from Measure Theory We have seen that L (, A, µ) is a Banach space for any measure space (, A, µ). We will extend that concept in the following section to identify an
More informationWeek 5 Lectures 13-15
Week 5 Lectures 13-15 Lecture 13 Definition 29 Let Y be a subset X. A subset A Y is open in Y if there exists an open set U in X such that A = U Y. It is not difficult to show that the collection of all
More informationQUASI-UNIFORMLY POSITIVE OPERATORS IN KREIN SPACE. Denitizable operators in Krein spaces have spectral properties similar to those
QUASI-UNIFORMLY POSITIVE OPERATORS IN KREIN SPACE BRANKO CURGUS and BRANKO NAJMAN Denitizable operators in Krein spaces have spectral properties similar to those of selfadjoint operators in Hilbert spaces.
More informationNECESSARY CONDITIONS FOR WEIGHTED POINTWISE HARDY INEQUALITIES
NECESSARY CONDITIONS FOR WEIGHTED POINTWISE HARDY INEQUALITIES JUHA LEHRBÄCK Abstract. We establish necessary conditions for domains Ω R n which admit the pointwise (p, β)-hardy inequality u(x) Cd Ω(x)
More informationFilters in Analysis and Topology
Filters in Analysis and Topology David MacIver July 1, 2004 Abstract The study of filters is a very natural way to talk about convergence in an arbitrary topological space, and carries over nicely into
More informationAppendix B Convex analysis
This version: 28/02/2014 Appendix B Convex analysis In this appendix we review a few basic notions of convexity and related notions that will be important for us at various times. B.1 The Hausdorff distance
More informationCourse Summary Math 211
Course Summary Math 211 table of contents I. Functions of several variables. II. R n. III. Derivatives. IV. Taylor s Theorem. V. Differential Geometry. VI. Applications. 1. Best affine approximations.
More informationTHE GEOMETRY OF CONVEX TRANSITIVE BANACH SPACES
THE GEOMETRY OF CONVEX TRANSITIVE BANACH SPACES JULIO BECERRA GUERRERO AND ANGEL RODRIGUEZ PALACIOS 1. Introduction Throughout this paper, X will denote a Banach space, S S(X) and B B(X) will be the unit
More informationMAT 570 REAL ANALYSIS LECTURE NOTES. Contents. 1. Sets Functions Countability Axiom of choice Equivalence relations 9
MAT 570 REAL ANALYSIS LECTURE NOTES PROFESSOR: JOHN QUIGG SEMESTER: FALL 204 Contents. Sets 2 2. Functions 5 3. Countability 7 4. Axiom of choice 8 5. Equivalence relations 9 6. Real numbers 9 7. Extended
More informationImmerse Metric Space Homework
Immerse Metric Space Homework (Exercises -2). In R n, define d(x, y) = x y +... + x n y n. Show that d is a metric that induces the usual topology. Sketch the basis elements when n = 2. Solution: Steps
More informationMA651 Topology. Lecture 9. Compactness 2.
MA651 Topology. Lecture 9. Compactness 2. This text is based on the following books: Topology by James Dugundgji Fundamental concepts of topology by Peter O Neil Elements of Mathematics: General Topology
More informationON THE PRODUCT OF SEPARABLE METRIC SPACES
Georgian Mathematical Journal Volume 8 (2001), Number 4, 785 790 ON THE PRODUCT OF SEPARABLE METRIC SPACES D. KIGHURADZE Abstract. Some properties of the dimension function dim on the class of separable
More informationr( = f 2 L 2 (1.2) iku)! 0 as r!1: (1.3) It was shown in book [7] that if f is assumed to be the restriction of a function in C
Inverse Obstacle Problem: Local Uniqueness for Rougher Obstacles and the Identication of A Ball Changmei Liu Department of Mathematics University of North Carolina Chapel Hill, NC 27599 December, 1995
More information1 Solutions to selected problems
1 Solutions to selected problems 1. Let A B R n. Show that int A int B but in general bd A bd B. Solution. Let x int A. Then there is ɛ > 0 such that B ɛ (x) A B. This shows x int B. If A = [0, 1] and
More informationON SELECTION OF SOLUTIONS TO VECTORIAL HAMILTON-JACOBI SYSTEM
ON SELECTION OF SOLUTIONS TO VECTORIAL HAMILTON-JACOBI SYSTEM BAISHENG YAN Abstract. In this paper, we discuss some principles on the selection of the solutions of a special vectorial Hamilton-Jacobi system
More informationarxiv:math.fa/ v1 2 Oct 1996
ON WIDE-(s) SEQUENCES AND THEIR APPLICATIONS TO CERTAIN CLASSES OF OPERATORS arxiv:math.fa/9610209 v1 2 Oct 1996 H. Rosenthal Department of Mathematics The University of Texas at Austin Austin, TX 78712-1082
More informationSOME MEASURABILITY AND CONTINUITY PROPERTIES OF ARBITRARY REAL FUNCTIONS
LE MATEMATICHE Vol. LVII (2002) Fasc. I, pp. 6382 SOME MEASURABILITY AND CONTINUITY PROPERTIES OF ARBITRARY REAL FUNCTIONS VITTORINO PATA - ALFONSO VILLANI Given an arbitrary real function f, the set D
More informationHOMEOMORPHISMS OF BOUNDED VARIATION
HOMEOMORPHISMS OF BOUNDED VARIATION STANISLAV HENCL, PEKKA KOSKELA AND JANI ONNINEN Abstract. We show that the inverse of a planar homeomorphism of bounded variation is also of bounded variation. In higher
More informationPROJECTIONS ONTO CONES IN BANACH SPACES
Fixed Point Theory, 19(2018), No. 1,...-... DOI: http://www.math.ubbcluj.ro/ nodeacj/sfptcj.html PROJECTIONS ONTO CONES IN BANACH SPACES A. DOMOKOS AND M.M. MARSH Department of Mathematics and Statistics
More informationMARIA GIRARDI Fact 1.1. For a bounded linear operator T from L 1 into X, the following statements are equivalent. (1) T is Dunford-Pettis. () T maps w
DENTABILITY, TREES, AND DUNFORD-PETTIS OPERATORS ON L 1 Maria Girardi University of Illinois at Urbana-Champaign Pacic J. Math. 148 (1991) 59{79 Abstract. If all bounded linear operators from L1 into a
More informationNear-Potential Games: Geometry and Dynamics
Near-Potential Games: Geometry and Dynamics Ozan Candogan, Asuman Ozdaglar and Pablo A. Parrilo September 6, 2011 Abstract Potential games are a special class of games for which many adaptive user dynamics
More informationConvex Analysis and Optimization Chapter 2 Solutions
Convex Analysis and Optimization Chapter 2 Solutions Dimitri P. Bertsekas with Angelia Nedić and Asuman E. Ozdaglar Massachusetts Institute of Technology Athena Scientific, Belmont, Massachusetts http://www.athenasc.com
More informationContents: 1. Minimization. 2. The theorem of Lions-Stampacchia for variational inequalities. 3. Γ -Convergence. 4. Duality mapping.
Minimization Contents: 1. Minimization. 2. The theorem of Lions-Stampacchia for variational inequalities. 3. Γ -Convergence. 4. Duality mapping. 1 Minimization A Topological Result. Let S be a topological
More informationBest approximations in normed vector spaces
Best approximations in normed vector spaces Mike de Vries 5699703 a thesis submitted to the Department of Mathematics at Utrecht University in partial fulfillment of the requirements for the degree of
More informationStanford Mathematics Department Math 205A Lecture Supplement #4 Borel Regular & Radon Measures
2 1 Borel Regular Measures We now state and prove an important regularity property of Borel regular outer measures: Stanford Mathematics Department Math 205A Lecture Supplement #4 Borel Regular & Radon
More informationLecture 7: Semidefinite programming
CS 766/QIC 820 Theory of Quantum Information (Fall 2011) Lecture 7: Semidefinite programming This lecture is on semidefinite programming, which is a powerful technique from both an analytic and computational
More information1. Bounded linear maps. A linear map T : E F of real Banach
DIFFERENTIABLE MAPS 1. Bounded linear maps. A linear map T : E F of real Banach spaces E, F is bounded if M > 0 so that for all v E: T v M v. If v r T v C for some positive constants r, C, then T is bounded:
More informationEconomics Bulletin, 2012, Vol. 32 No. 1 pp Introduction. 2. The preliminaries
1. Introduction In this paper we reconsider the problem of axiomatizing scoring rules. Early results on this problem are due to Smith (1973) and Young (1975). They characterized social welfare and social
More informationTheorem 1. Suppose that is a Fuchsian group of the second kind. Then S( ) n J 6= and J( ) n T 6= : Corollary. When is of the second kind, the Bers con
ON THE BERS CONJECTURE FOR FUCHSIAN GROUPS OF THE SECOND KIND DEDICATED TO PROFESSOR TATSUO FUJI'I'E ON HIS SIXTIETH BIRTHDAY Toshiyuki Sugawa x1. Introduction. Supposebthat D is a simply connected domain
More informationHomogenization in an optimal design problem with quadratic weakly discontinuous objective functional
Homogenization in an optimal design problem with quadratic weakly discontinuous objective functional Yury Grabovsky Department of Mathematics Temple University Philadelphia, PA 19122 Int. J. Diff. Eq.
More informationarxiv: v1 [math.oc] 21 Mar 2015
Convex KKM maps, monotone operators and Minty variational inequalities arxiv:1503.06363v1 [math.oc] 21 Mar 2015 Marc Lassonde Université des Antilles, 97159 Pointe à Pitre, France E-mail: marc.lassonde@univ-ag.fr
More informationLocally convex spaces, the hyperplane separation theorem, and the Krein-Milman theorem
56 Chapter 7 Locally convex spaces, the hyperplane separation theorem, and the Krein-Milman theorem Recall that C(X) is not a normed linear space when X is not compact. On the other hand we could use semi
More information1. Introduction The nonlinear complementarity problem (NCP) is to nd a point x 2 IR n such that hx; F (x)i = ; x 2 IR n + ; F (x) 2 IRn + ; where F is
New NCP-Functions and Their Properties 3 by Christian Kanzow y, Nobuo Yamashita z and Masao Fukushima z y University of Hamburg, Institute of Applied Mathematics, Bundesstrasse 55, D-2146 Hamburg, Germany,
More information