Symmetry results for solutions of semilinear elliptic equations with convex nonlinearities
|
|
- Berenice Rodgers
- 7 years ago
- Views:
Transcription
1 Symmetry results for solutions of semilinear elliptic equations with convex nonlinearities Filomena Pacella Abstract In this paper we study the symmetry properties of the solutions of the semilinear elliptic problem { u = f(x, u) in Ω u = g(x) on Ω where Ω is a bounded symmetric domain in R N, N 2, and f : Ω R R is a continuous function of class C 1 in the second variable, g is continuous and f and g are somehow symmetric in x. Our main result is to show that all solutions of the above problem of index one are axially symmetric when Ω is an annulus or a ball, g 0 and f is strictly convex in the second variable. To do this we prove that the nonnegativity of the first eigenvalue of the linearized operator in the caps determined by the symmetry of Ω, is a sufficient condition for the symmetry of the solution, when f is a convex function. 1 Introduction In this paper we investigate the symmetry properties of classical C 2 (Ω) C(Ω) solutions of elliptic problems of the type { u = f(x, u) in Ω (1.1) u = g(x) on Ω Research supported by MURST, Project Metodi Variazionali ed Equazioni Differenziali non lineari. Dipartimento di Matematica, Università di Roma La Sapienza, P.le Aldo Moro, Roma, Italy. 1
2 where Ω is a bounded, somehow symmetric domain in R N, N 2, f : Ω R R is a continuous function of class C 1 with respect to the second variable, g is continuous and both f and g have some symmetry in x. It is well known that a classical tool to study this question is the moving planes method which goes back to Alexandrov and Serrin ([8]). Since it is essentially a monotonicity method it, usually, works very well when g 0, u > 0 in Ω and f has some monotonicity in x. In fact, under these hypotheses the moving planes method was successfully used by Gidas, Ni and Niremberg to prove, in the famous paper [6], the symmetry of the solutions of (1.1) when the domain Ω is symmetric with respect to a hyperplane T 0 and convex in the direction ν 0 orthogonal to T 0. However, when the domain is not convex in the direction ν 0 or some of the other hypotheses do not hold, in particular if f does not have the right monotonicity in x, the moving plane method cannot be applied to get the symmetry of the solutions. Indeed if some of these conditions fail there are examples of nonlinearities which give raise to nonsymmetric solutions of (1.1), such as in the case of an annulus and almost critical nonlinearities (see [2]) or when Ω is a ball and f(x) = x α u p, α > 0, p > 1 (see [9]). Nevertheless in some situations, or for a certain class of solutions, it is natural to expect that the solution inherits some or all symmetries of the domain, even if Ω is not convex in any direction, u changes sign and f may not have the right monotonicity in x. This is, for example, the case of ground states solutions in annuli or balls as we will show later. In this paper we use a new simple idea to study the symmetry of the solutions of (1.1) which works efficiently when f(x, s) is convex in the s variable. To be more precise we need some notations. Let us assume that Ω contains the origin and is symmetric with respect to the hyperplane T 0 = {x = (x 1,..., x N ) R N, x 1 = 0} and denote by Ω and Ω + the caps to the left and right of T 0, i.e. Ω = {x Ω, x 1 < 0}, Ω + = {x Ω, x 1 > 0}. Let u be a solution of (1.1) and let us consider the linearized operator at 2
3 u, that is L = f (x, u) where f denotes the derivative of f(x, s) with respect to s. We denote by λ 1 (L, D) the first eigenvalue of L in a subdomain D Ω with zero Dirichlet boundary conditions. Our symmetry results are based on the following proposition whose simple proof will be given in the next section. Proposition 1.1 If f(x, s) and g(x) are even in x 1, f is strictly convex in s and both λ 1 (L, Ω ) and λ 1 (L, Ω + ) are nonnegative then u is symmetric with respect to the x 1 variable, i.e. u(x 1,..., x N ) = u( x 1, x 2,..., x N ). The same result holds if f is only convex but λ 1 (L, Ω ) and λ 1 (L, Ω + ) are both positive. Remark 1.1 When f is convex but not strictly convex the previous result cannot be improved, i.e. the nonnegativity of the first eigenvalues in Ω and Ω + is not sufficient for the symmetry of the solution. This will be shown in section 2 with an easy example in the case when f(x, s) is linear with respect to s. Remark 1.2 A statement analogous to that of Proposition 1.1 holds also for semilinear problems with symmetric Neumann conditions on Ω. In this case the relevant eigenvalues to get the symmetry of the solutions are µ 1 (L, Ω ) and µ 1 (L, Ω + ) which denote the first eigenvalue of L in Ω (or Ω + ) with mixed boundary conditions, namely the normal derivative zero on Ω Ω (or Ω Ω + ) and a zero Dirichlet boundary condition on T 0 Ω (or T 0 Ω + ). This will be the subject of a further investigation. Having Proposition 1.1 in mind, now the question is how to prove the nonnegativity of the first eigenvalues of L in Ω and Ω + in order to get the symmetry result. A few easy cases will be considered in section 2, while in section 3 we apply Proposition 1.1 to get the main result of this paper which consists in proving the axial symmetry of solutions of index one. More precisely we will assume Ω to be either an annulus or a ball in R N, N 2 and u a solution of (1.1), with g(x) = 0, with index one, 3
4 i.e. such that the linearized operator L has only one negative eigenvalue in Ω (with homogeneous Dirichlet boundary conditions). This kind of solutions always exist for a large class of superlinear convex nonlinearities, as we can consider the so called least energy solutions or the ones of mountain pass type. In this case we can prove that if f(x, s) is strictly convex in s and radially symmetric in x then u is axially symmetric with respect to the axis passing through a maximum point. Moreover we are able to show that, if the solution u is not radial, all the critical points of u are located on the symmetry axis and we also describe some other qualitative properties of the solutions. For more general domains, symmetric with respect to the hyperplane T 0 = {x R N, x 1 = 0} we can prove the symmetry, with respect to x 1, of every solution of index one as soon as f(x, s) is even in x 1 and a maximum (or a minimum) point of u belongs to the hyperplane T 0. However let us remark immediately that this is not always the case as it can be shown with some counterexamples. All this will be described in detail in section 3. Finally let us note that even in nonsymmetric situations it is important to find out that λ 1 (L, D) is positive for some caps D Ω. In fact, if f is convex and D has the property that the reflected function v (with respect to some hyperplane) is well defined then, arguing as in the proof of Proposition 1.1 or Proposition 2 (see section 2), it is possible to show that u < v in D and this gives some information about the location of the maximum points of u. We feel that all this can help to understand the qualitative properties of the solutions of (1.1). 2 Proofs of Proposition 1.1 and applications We start with the proof of Proposition 1.1. Proof of Proposition 1.1. Let us denote by v and v + the reflected functions of u in the domains Ω and Ω + respectively: v (x) = u( x 1, x 2,..., x N ), x Ω 4
5 v + (x) = u( x 1, x 2,..., x N ), x Ω + We first assume f strictly convex. In this case we have f(x, v (x)) f(x, u(x)) f (x, u(x))(v (x) u(x)) in Ω f(x, v + (x)) f(x, u(x)) f (x, u(x))(v + (x) u(x)) in Ω + and the strict inequality holds whenever v (x) u(x) (resp. v + (x) u(x)). Hence by (1.1), using the symmetry of f and g in the x 1 variable and considering the functions w = v u and w + = v + u we have w f (x, u)w 0 in Ω (2.1) w + f (x, u)w + 0 in Ω + (2.2) with the strict inequality whenever w (x) 0 or w + (x) 0 and w = 0 (resp. w + = 0) on Ω (resp. Ω + ) (2.3) If w and w + are both nonnegative in the respective domains Ω and Ω + then w w + 0, by the very definition, and hence u is symmetric with respect to x 1. Therefore, arguing by contradiction, we can assume that one among the two functions, say w +, is negative somewhere in Ω +. Then, considering a connected component D in Ω + of the set where w + < 0, multiplying (2.2) by w +, integrating and using (2.3) and the strict convexity of f we get w + 2 f (x, u)(w + ) 2 < 0 (2.4) D D which implies that λ 1 (L, Ω + ) < 0 against the hypothesis. Hence u is symmetric. Now we assume that f is only convex but λ 1 (L, Ω ) > 0 and λ 1 (L, Ω + ) > 0. Then the maximum principle holds both in Ω and Ω +. Therefore by (2.1) (2.3) we get immediately w 0 and w + 0 which imply the symmetry of u. In particular if f is linear in u we get 5
6 Corollary 2.1 Let A be a linear operator of the type A = c(x), with c(x) C(Ω), Ω as in the previous theorem and c(x) even in the x 1 variable. Then if λ 1 (A, Ω ) 0, any eigenfunction of A in Ω with homogeneous Dirichlet boundary conditions, corresponding to a negative eigenvalue µ j of A is even in x 1. The same statement holds if we assume λ 1 (A, Ω ) > 0 and µ j 0. Proof. If we consider an eigenfunction ϕ relative to an eigenvalue µ j, it solves the equation and the linearized operator at ϕ is ϕ = f(x, ϕ) = c(x)ϕ + µ j ϕ L = c(x) µ j. In both hypotheses we have that λ 1 (L, Ω ) > 0 and, since c(x) is even in x 1, also λ 1 (L, Ω + ) > 0. Hence, by Proposition 1.1, we get the symmetry of ϕ. Next we show with an example that if f is only convex, but not strictly convex, and λ 1 (L, Ω), λ 1 (L, Ω + ) are both zero then the solution u of (1.1) may not be symmetric. Let Ω be as in Proposition 1.1 and denote by µ 1 the first eigenvalue of the Laplace operator in Ω with homogeneous Dirichlet boundary conditions and by ϕ 1 the corresponding eigenfunction. By reflecting ϕ 1 in an odd way with respect to T 0 we get that the extended function ϕ 1 solves ϕ 1 = µ 1 ϕ 1 in Ω, ϕ 1 = 0 on Ω. Obviously the first eigenvalue of the linearized operator at ϕ 1 is zero in Ω or Ω +, while ϕ 1 is not even in x 1. Now we describe some situations when it is easy to prove the nonnegativity of the eigenvalues λ 1 (L, Ω ) and λ 1 (L, Ω + ), so to get the symmetry of the solution. A first trivial case is when the solution u of (1.1) is semi stable, i.e. λ 1 (L, Ω) 0. Then, obviously λ 1 (L, Ω ) > 0 and λ 1 (L, Ω + ) > 0; 6
7 therefore if f is convex we have that u is symmetric, in particular it is radial if Ω is an annulus or a ball. However, when f is strictly convex, it can be shown that the semistable solution is unique and from this, the symmetry follows easily. Another easy application of Proposition 1.1 is obtained by considering domains Ω which are also convex in the x 1 direction and assuming g = 0, u positive and f increasing in the x 1 variable in Ω. Under these hypotheses and keeping the same notations as in Proposition 1.1 we have Proposition 2.1 If f(x, s) is convex in s and u is a positive solution of (1.1) then λ 1 (L, Ω ) and λ 1 (L, Ω + ) are both nonnegative. Proof. Let us prove that λ 1 (L, Ω ) is nonnegative. Arguing by contradiction, we assume that λ 1 (L, Ω ) < 0. Then, by the continuity of the eigenvalues with respect to the domain, we have that for some µ < 0 in the cap Ω µ = {x Ω, x 1 < µ} the first eigenvalue λ 1 (L, Ω µ ) must be zero, because we know that when the measure of any cap is sufficiently small the first eigenvalue becomes positive. Since Ω is convex in the x 1 direction we can consider the function We have w µ = u(x) u(2µ x 1, x 2,..., x N ) in Ω µ. w µ = 0 on Ω µ Ω, w µ > 0 on Ω µ Ω (2.5) because µ < 0, u > 0 in Ω and u = 0 on Ω. By the convexity of f with respect to u and the monotonicity of f in x 1, we get, (as in (2.1)) w µ f (x, u)w µ 0 in Ω µ. (2.6) Therefore if wµ 0 in Ω µ, by the strong maximum principle and (2.5) we deduce wµ > 0 in Ω µ and this, together with (2.5) and (2.6) implies that λ 1 (L, Ω µ ) > 0 (see [4]) which gives a contradiction. Hence the function wµ is negative somewhere in Ω µ. Thus, considering a connected component D in Ω µ where wµ < 0, multiplying (2.6) by wµ and integrating we get wµ 2 f (u)(w ) 2 0 (2.7) D D 7
8 which implies that λ 1 (L, D) 0. Since, by (2.5), D is a proper subset of Ω µ we get λ 1 (L, Ω µ ) < 0 against what we assumed. In the same way it can be proved that also λ 1 (L, Ω + ) is nonnegative. Remark 2.1 From Proposition 1.1 and Proposition 2.1 we deduce the symmetry of the solutions of (1.1) (under the hypotheses of Proposition 2.1) with an approach slightly different from that used by Gidas, Ni and Nirenberg and later simplified by Berestycki and Niremberg ([3]). This is because we focus our attention on the first eigenvalue of the linearized operator rather than on the equation satisfied by the difference between u and its reflection. Of course this is possible because f is convex, therefore the symmetry result deduced by Proposition 2.1 is much weaker than that of [6]. Remark 2.2 In the classical paper [6], using the moving plane method, it is proved that u x 1 > 0 in Ω. Moreover, if Ω is smooth and f(0) 0, u x 1 is also positive on Ω Ω, by the Hopf s lemma. Then, if f does not depend on x, since the function u x 1 is a solution of the linearized equation, i.e. ( ) u L = 0 in Ω x 1 it follows that λ 1 (L, Ω ) > 0 and the same holds for λ 1 (L, Ω + ). Therefore Proposition 1.1 can be seen as a generalization of this result when Ω is not smooth or f(0) is not positive. It is also interesting to note that the nonnegativity of the first eigenvalue in Ω or Ω + can be deduced without knowing a priori that the solution is strictly monotone in the x 1 direction. Finally we recall that, using the sign of the eigenvalues λ 1 (L, Ω ), λ 1 (L, Ω + ), in the paper [4] it is shown that every solution of the linearized equation in Ω is symmetric when f(0) 0 and Ω is smooth. Let us observe that this result is a particular case of Corollary 2.1 (see Theorem 2.1 and Remark 2.1 in [4]). 8
9 3 Axial symmetry of solutions of index one Let us consider the semilinear problem { u = f( x, u) in A u = 0 on A (3.1) where A is either an annulus or a ball centered in the origin O of R N, N 2 and f has the same regularity as in (1.1). Let u be a solution of (3.1) which can be either positive or change sign and let P be a maximum point of u which lies in the interior of Ω, because of the boundary condition. We denote by r P the axis OP passing through the origin and P, by T any (n 1) dimensional hyperplane passing through the origin and by ν T the normal to T, directed towards the half space containing P, in case T does not pass through the axis r P. Our main result is the following Theorem 3.1 Let f( x, s) be strictly convex in s and u a solution of (3.1) of index one. Then i) u is axially symmetric with respect to the axis r P ii) if A is a ball and P is the origin then u is radially symmetric iii) if u is not radially symmetric then it is never symmetric with respect to any hyperplane T not passing through r P iv) if u is not radially symmetric then all the critical points of u belong to the symmetry axis r P ; in particular all the maximum points lie on the semi axis to which P belongs and u ν T (x) > 0 x T A (3.2) for every hyperplane T not passing through r P. Proof. i) Let us denote by T P any hyperplane passing through r P. Obviously T divides A in two open regions A P and A + P, i.e. A P A + P (T P A) = A. To show the symmetry of u with respect to T P we use Proposition 9
10 1.1; so we need to prove that λ 1 (L, A P ) and λ 1 (L, A + P ) are both nonnegative, denoting, as in section 1, by λ 1 (L, A P ) and λ 1 (L, A + P ) the first eigenvalues of the linearized operator at u in A P and A + P, respectively, with homogeneous Dirichlet boundary conditions. Arguing by contradiction we can assume that one of these two numbers, say λ 1 (L, A P ), is negative. Since the solution is of index one, λ 2 (L, A) 0 and hence, by the variational characterization of the second eigenvalue, we have that λ 1 (L, A + P ) > 0. So in A + P the maximum principle holds for the operator L = f ( x, u). Then, considering in A + P the function w P + = v P + u, where v P + is the reflection of u with respect to T P and using the convexity of f, we have, as in (2.2) w + P f ( x, u)w + P 0 in A + P. (3.3) Since w P + 0 on A + P, from (3.3) we get, by the maximum principle, that w P + 0 in A + P. Thus, by the strong maximum principle either w P + 0 or w P + > 0 in A + P. The first case is not possible because it would imply that u is symmetric with respect to T P and hence the two eigenvalues λ 1 (L, A P ) and λ 1 (L, A + P ) should be equal while they have different sign. So, the only possibility is w P + > 0 in A + P. Then, by the Hopf s lemma we derive that w+ P < 0 on T ν P A, where ν is the outer normal to A + P and consequently u ν = 1 w P + 2 ν > 0 on T P A which is impossible because the maximum point P belongs to T P A. This contradiction shows that λ 1 (L, A P ) 0 and the same happens for λ 1 (L, A + P ). ii) It follows immediately from i) since the origin belongs to any symmetry hyperplane. iii) Arguing again by contradiction let us assume that u is symmetric with respect to a certain hyperplane T 1 not passing through r P. Since u is not radial, by ii) P is not the origin and hence P / T 1, so that, using the same notations as in i), P will belong to one of the two caps A 1, A + 1, created by T 1, say P A 1. Then, by symmetry, there exists P A + 1 such that u(p ) = u(p ) = max u. A 10
11 Now let us consider any hyperplane T close to T 1, i.e. denoting by ν 1 the unit normal to T 1, pointing towards the half space containing P, we consider, on the unit sphere, a neighborhood I(ν 1 ) of ν 1 and, for any ν I(ν 1 ) the hyperplane orthogonal to ν, passing through the origin. If the size of I(ν 1 ) is sufficiently small, we still have that P and P are on different caps, with respect to T : P Ã and P Ã+, for any ν I(ν 1 ). We claim that u is symmetric with respect to T. To prove this, we use again Proposition 1.1 so that we need to show that λ 1 (L, Ã ) and λ 1 (L, Ã+ ) are both nonnegative. If λ 1 (L, Ã ) < 0, then, since the solution u has index 1, we deduce that λ 1 (L, Ã+ ) > 0. Then, arguing exactly as in the proof of i) we have that the function w + = ṽ + u, where ṽ + is the reflected function of u in Ã+, is positive in Ã+. This means that u < ṽ + in Ã+, in particular u(p ) < ṽ + (P ) which is not possible since u(p ) is the maximum of u. This contradiction proves that λ 1 (L, Ã ) 0 and the same holds for λ 1 (L, Ã+ ). Hence u is symmetric with respect to the hyperplane T orthogonal to ν, for any direction ν in a suitable neighborhood of ν 1. Now we can think, without loss of generality, that all possible symmetry hyperplanes of A (i.e. all hyperplanes passing through the origin) correspond to unit vectors belonging to an hemisphere in R N (i.e. to half of thenunit sphere), having as boundary the vectors ν P orthogonal to the hyperplanes T P, passing through the axis r P. If we remove from this hemisphere all the vectors ν P we have an open connected set M of directions in R N. What we just proved is that the set S of directions ν which are orthogonal to hyperplanes of symmetry for the solution u is an open set in M. Since S is also, obviously, a closed subset of M we deduce that S = M and hence u is symmetric with respect to any hyperplane passing through the origin, i.e. u is a radial function. iv) Suppose that u is not radially symmetric and consider any hyperplane T not passing through r P. As usual we denote by A and A + the caps created by T and we assume that P belongs to A. Then, by iii) u is not symmetric with respect to T and hence, by Proposition 1.1, one among λ 1 (L, A ) and λ 1 (L, A + ) must be negative. Since P A it is 11
12 easy to see, arguing as in i) or iii) that λ 1 (L, A ) < 0 and λ 1 (L, A + ) > 0. Thus in Ω + the maximum principle holds for the operator L and this implies that the function w + = v + u (same notations as before) satisfying { w + f ( x, u)w + 0 in A + (3.4) w + = 0 on A is nonnegative in A + and, actually, w + > 0, by the strong maximum principle. This means that u < v + in A + and hence u cannot have any maximum point in A +. Letting T vary and, in particular, taking T as the hyperplane orthogonal to r P we deduce that all maximum points belong to the radius joining the origin with P. Moreover, applying, as before, the Hopf s lemma to the function w + in A + we get (3.2) which implies that all critical points of u belong to the symmetry axis r P. Remark 3.1 The previous theorem gives the precise location of all maximum points of the solution. However it is natural to expect that solutions of index one, in particular least energy solutions, have only one maximum point, at least for a large class of nonlinearities f independent of x. This can be proved for solutions of index one of some asymptotic nonlinear problems, using a blow up argument, in a more general context (see [7]). Theorem 3.1 applies to a very large class of nonlinear problems since we only require f(x, s) to be radial in x and strictly convex in s. Also the existence of solutions of (3.1) of index one is well known in many cases, at least for positive solutions. Though changing sign solutions of index one exist, they do not occur frequently since the nonlinearity f must satisfy some peculiar hypotheses (see [1]). Hence we do not think that Theorem 3.1 is easily applicable to solutions which change sign. On the contrary when u is positive there are many interesting applications of Theorem 3.1. We would like to single out two of them. I) Let f(x, u) = f(u) = u P + λu, 1 < p < if N = 2, 1 < p < N+2 N 2 if N 3, λ < λ 1 (A), where λ 1 (A) is the first eigenvalue of the Laplace operator in A with zero Dirichlet boundary conditions. If λ > 0 we can also take p = N+2 N 2. 12
13 In this case a positive solution of (3.1) of index one can be either found using the famous mountain pass lemma or by a constrained minimization procedure. If A is an annulus it can be proved that this positive solution is, in general, not radial (see [2]); in fact the Gidas Ni Nirenberg symmetry result does not apply since A is not convex in any direction. II) Let f(x, u) = f( x, u) = x α u P where α > 0, 1 < p < if N = 2, 1 < p < N+2 if N 3. N 2 The corresponding equation is called the Hénon equation. In this case the symmetry result of Theorem 3.1 is interesting both in the annulus and in the ball, since there are results which assert that ground states solutions of (3.1) are not always radially symmetric if A is a ball (see [9]). We recall that also for this nonlinearity the Gidas Ni Nirenberg theorem does not apply since f is not decreasing with respect to x. Finally consider a general domain Ω R N, N 2, containing the origin and symmetric with respect to the hyperplane T = {x R N, x 1 = 0}. In Ω we define the usual problem { u = f(x, u) in Ω (3.5) u = 0 on Ω where f has the usual regularity and f is even in x 1. We have the following result. Theorem 3.2 Let f be strictly convex in the second variable and u a solution of (3.5) with index one. If a maximum point P of u belongs to the symmetry hyperplane T, then u is even in x 1. Proof. It is the same as for i) of Theorem 3.1. In view of Theorem 3.2 a natural question is whether a maximum point of a solution (in particular of index one) belongs to the symmetry hyperplane T 0. The answer is that this is not, in general, true since it is possible to find some counterexamples. One of these could be constructed by taking Ω as a dumbbell and f(u) = u P. Then in the paper [5] of Dancer it is shown that there exists a positive solution of (3.5) which has only one maximum point near the center of one of the two kind of balls which form the dumbbell. 13
14 References [1] T. Bartsch, K.C. Chang, Z.Q. Wang, On the Morse indices of sign changing solutions of nonlinear elliptic problems, Math. Z., 233 (2000), [2] H. Brezis, L. Nirenberg, Positive solutions of nonlinear elliptic equations involving critical Sobolev exponents, Comm. Pure Appl. Math., 36 (1983), [3] H. Berestycki, L. Nirenberg, On the method of moving planes and the sliding method, Bol. Soc. Bras. Mat., 22 (1991), [4] L. Damascelli, M. Grossi, F. Pacella, Qualitative properties of positive solutions of semilinear elliptic equations in symmetric domains via the maximum principle, Ann. Inst. H. Poincaré, 16 (1999), [5] E.N. Dancer, The effect of domain shape on the number of positive solutions of certain nonlinear equations, Journ. Diff. Eq., 74 (1988), [6] B. Gidas, W.M. Ni, L. Nirenberg, Symmetry and related properties via the maximum principle, Comm. Math. Phis., 68 (1979), [7] K. El Mehdi, F. Pacella, Morse index and blow up points of solutions of some nonlinear problems, (to appear). [8] J. Serrin, A symmetry problem in potential theory, Arch. Rat. Mech. Anal., 43 (1971), [9] D. Smets, J. Su, M. Willem, Nonradial ground states for the Hénon equation, (to appear). 14
A PRIORI ESTIMATES FOR SEMISTABLE SOLUTIONS OF SEMILINEAR ELLIPTIC EQUATIONS. In memory of Rou-Huai Wang
A PRIORI ESTIMATES FOR SEMISTABLE SOLUTIONS OF SEMILINEAR ELLIPTIC EQUATIONS XAVIER CABRÉ, MANEL SANCHÓN, AND JOEL SPRUCK In memory of Rou-Huai Wang 1. Introduction In this note we consider semistable
More informationThe Mean Value Theorem
The Mean Value Theorem THEOREM (The Extreme Value Theorem): If f is continuous on a closed interval [a, b], then f attains an absolute maximum value f(c) and an absolute minimum value f(d) at some numbers
More information1 if 1 x 0 1 if 0 x 1
Chapter 3 Continuity In this chapter we begin by defining the fundamental notion of continuity for real valued functions of a single real variable. When trying to decide whether a given function is or
More informationCONSTANT-SIGN SOLUTIONS FOR A NONLINEAR NEUMANN PROBLEM INVOLVING THE DISCRETE p-laplacian. Pasquale Candito and Giuseppina D Aguí
Opuscula Math. 34 no. 4 2014 683 690 http://dx.doi.org/10.7494/opmath.2014.34.4.683 Opuscula Mathematica CONSTANT-SIGN SOLUTIONS FOR A NONLINEAR NEUMANN PROBLEM INVOLVING THE DISCRETE p-laplacian Pasquale
More informationDuality of linear conic problems
Duality of linear conic problems Alexander Shapiro and Arkadi Nemirovski Abstract It is well known that the optimal values of a linear programming problem and its dual are equal to each other if at least
More informationEXISTENCE OF SOLUTIONS TO NONLINEAR, SUBCRITICAL HIGHER-ORDER ELLIPTIC DIRICHLET PROBLEMS WOLFGANG REICHEL AND TOBIAS WETH
EXISTENCE OF SOLUTIONS TO NONLINEAR, SUBCRITICAL HIGHER-ORDER ELLIPTIC DIRICHLET PROBLEMS WOLFGANG REICHEL AND TOBIAS WETH Abstract. We consider the -th order elliptic boundary value problem Lu = f(x,
More informationSeparation Properties for Locally Convex Cones
Journal of Convex Analysis Volume 9 (2002), No. 1, 301 307 Separation Properties for Locally Convex Cones Walter Roth Department of Mathematics, Universiti Brunei Darussalam, Gadong BE1410, Brunei Darussalam
More informationEXISTENCE AND NON-EXISTENCE RESULTS FOR A NONLINEAR HEAT EQUATION
Sixth Mississippi State Conference on Differential Equations and Computational Simulations, Electronic Journal of Differential Equations, Conference 5 (7), pp. 5 65. ISSN: 7-669. UL: http://ejde.math.txstate.edu
More informationNo: 10 04. Bilkent University. Monotonic Extension. Farhad Husseinov. Discussion Papers. Department of Economics
No: 10 04 Bilkent University Monotonic Extension Farhad Husseinov Discussion Papers Department of Economics The Discussion Papers of the Department of Economics are intended to make the initial results
More informationExtremal equilibria for reaction diffusion equations in bounded domains and applications.
Extremal equilibria for reaction diffusion equations in bounded domains and applications. Aníbal Rodríguez-Bernal Alejandro Vidal-López Departamento de Matemática Aplicada Universidad Complutense de Madrid,
More informationWalrasian Demand. u(x) where B(p, w) = {x R n + : p x w}.
Walrasian Demand Econ 2100 Fall 2015 Lecture 5, September 16 Outline 1 Walrasian Demand 2 Properties of Walrasian Demand 3 An Optimization Recipe 4 First and Second Order Conditions Definition Walrasian
More information3. Mathematical Induction
3. MATHEMATICAL INDUCTION 83 3. Mathematical Induction 3.1. First Principle of Mathematical Induction. Let P (n) be a predicate with domain of discourse (over) the natural numbers N = {0, 1,,...}. If (1)
More informationShape Optimization Problems over Classes of Convex Domains
Shape Optimization Problems over Classes of Convex Domains Giuseppe BUTTAZZO Dipartimento di Matematica Via Buonarroti, 2 56127 PISA ITALY e-mail: buttazzo@sab.sns.it Paolo GUASONI Scuola Normale Superiore
More informationTiers, Preference Similarity, and the Limits on Stable Partners
Tiers, Preference Similarity, and the Limits on Stable Partners KANDORI, Michihiro, KOJIMA, Fuhito, and YASUDA, Yosuke February 7, 2010 Preliminary and incomplete. Do not circulate. Abstract We consider
More informationMetric Spaces. Chapter 7. 7.1. Metrics
Chapter 7 Metric Spaces A metric space is a set X that has a notion of the distance d(x, y) between every pair of points x, y X. The purpose of this chapter is to introduce metric spaces and give some
More informationON SEQUENTIAL CONTINUITY OF COMPOSITION MAPPING. 0. Introduction
ON SEQUENTIAL CONTINUITY OF COMPOSITION MAPPING Abstract. In [1] there was proved a theorem concerning the continuity of the composition mapping, and there was announced a theorem on sequential continuity
More informationMathematics Course 111: Algebra I Part IV: Vector Spaces
Mathematics Course 111: Algebra I Part IV: Vector Spaces D. R. Wilkins Academic Year 1996-7 9 Vector Spaces A vector space over some field K is an algebraic structure consisting of a set V on which are
More informationSome remarks on Phragmén-Lindelöf theorems for weak solutions of the stationary Schrödinger operator
Wan Boundary Value Problems (2015) 2015:239 DOI 10.1186/s13661-015-0508-0 R E S E A R C H Open Access Some remarks on Phragmén-Lindelöf theorems for weak solutions of the stationary Schrödinger operator
More informationContinued Fractions and the Euclidean Algorithm
Continued Fractions and the Euclidean Algorithm Lecture notes prepared for MATH 326, Spring 997 Department of Mathematics and Statistics University at Albany William F Hammond Table of Contents Introduction
More informationI. GROUPS: BASIC DEFINITIONS AND EXAMPLES
I GROUPS: BASIC DEFINITIONS AND EXAMPLES Definition 1: An operation on a set G is a function : G G G Definition 2: A group is a set G which is equipped with an operation and a special element e G, called
More informationOn the existence of multiple principal eigenvalues for some indefinite linear eigenvalue problems
RACSAM Rev. R. Acad. Cien. Serie A. Mat. VOL. 97 (3), 2003, pp. 461 466 Matemática Aplicada / Applied Mathematics Comunicación Preliminar / Preliminary Communication On the existence of multiple principal
More informationRESONANCES AND BALLS IN OBSTACLE SCATTERING WITH NEUMANN BOUNDARY CONDITIONS
RESONANCES AND BALLS IN OBSTACLE SCATTERING WITH NEUMANN BOUNDARY CONDITIONS T. J. CHRISTIANSEN Abstract. We consider scattering by an obstacle in R d, d 3 odd. We show that for the Neumann Laplacian if
More informationA SURGERY RESULT FOR THE SPECTRUM OF THE DIRICHLET LAPLACIAN. Keywords: shape optimization, eigenvalues, Dirichlet Laplacian
A SURGERY RESULT FOR THE SPECTRUM OF THE DIRICHLET LAPLACIA DORI BUCUR AD DARIO MAZZOLEI Abstract. In this paper we give a method to geometrically modify an open set such that the first k eigenvalues of
More informationLEARNING OBJECTIVES FOR THIS CHAPTER
CHAPTER 2 American mathematician Paul Halmos (1916 2006), who in 1942 published the first modern linear algebra book. The title of Halmos s book was the same as the title of this chapter. Finite-Dimensional
More informationMATH 425, PRACTICE FINAL EXAM SOLUTIONS.
MATH 45, PRACTICE FINAL EXAM SOLUTIONS. Exercise. a Is the operator L defined on smooth functions of x, y by L u := u xx + cosu linear? b Does the answer change if we replace the operator L by the operator
More informationConvex analysis and profit/cost/support functions
CALIFORNIA INSTITUTE OF TECHNOLOGY Division of the Humanities and Social Sciences Convex analysis and profit/cost/support functions KC Border October 2004 Revised January 2009 Let A be a subset of R m
More informationNumerical Analysis Lecture Notes
Numerical Analysis Lecture Notes Peter J. Olver 5. Inner Products and Norms The norm of a vector is a measure of its size. Besides the familiar Euclidean norm based on the dot product, there are a number
More informationPUTNAM TRAINING POLYNOMIALS. Exercises 1. Find a polynomial with integral coefficients whose zeros include 2 + 5.
PUTNAM TRAINING POLYNOMIALS (Last updated: November 17, 2015) Remark. This is a list of exercises on polynomials. Miguel A. Lerma Exercises 1. Find a polynomial with integral coefficients whose zeros include
More informationCONTRIBUTIONS TO ZERO SUM PROBLEMS
CONTRIBUTIONS TO ZERO SUM PROBLEMS S. D. ADHIKARI, Y. G. CHEN, J. B. FRIEDLANDER, S. V. KONYAGIN AND F. PAPPALARDI Abstract. A prototype of zero sum theorems, the well known theorem of Erdős, Ginzburg
More informationInner Product Spaces
Math 571 Inner Product Spaces 1. Preliminaries An inner product space is a vector space V along with a function, called an inner product which associates each pair of vectors u, v with a scalar u, v, and
More informationPractice with Proofs
Practice with Proofs October 6, 2014 Recall the following Definition 0.1. A function f is increasing if for every x, y in the domain of f, x < y = f(x) < f(y) 1. Prove that h(x) = x 3 is increasing, using
More informationHow To Prove The Dirichlet Unit Theorem
Chapter 6 The Dirichlet Unit Theorem As usual, we will be working in the ring B of algebraic integers of a number field L. Two factorizations of an element of B are regarded as essentially the same if
More information1. Prove that the empty set is a subset of every set.
1. Prove that the empty set is a subset of every set. Basic Topology Written by Men-Gen Tsai email: b89902089@ntu.edu.tw Proof: For any element x of the empty set, x is also an element of every set since
More informationTOPIC 4: DERIVATIVES
TOPIC 4: DERIVATIVES 1. The derivative of a function. Differentiation rules 1.1. The slope of a curve. The slope of a curve at a point P is a measure of the steepness of the curve. If Q is a point on the
More informationDIRICHLET S PROBLEM WITH ENTIRE DATA POSED ON AN ELLIPSOIDAL CYLINDER. 1. Introduction
DIRICHLET S PROBLEM WITH ENTIRE DATA POSED ON AN ELLIPSOIDAL CYLINDER DMITRY KHAVINSON, ERIK LUNDBERG, HERMANN RENDER. Introduction A function u is said to be harmonic if u := n j= 2 u = 0. Given a domain
More informationLet H and J be as in the above lemma. The result of the lemma shows that the integral
Let and be as in the above lemma. The result of the lemma shows that the integral ( f(x, y)dy) dx is well defined; we denote it by f(x, y)dydx. By symmetry, also the integral ( f(x, y)dx) dy is well defined;
More informationON FIBER DIAMETERS OF CONTINUOUS MAPS
ON FIBER DIAMETERS OF CONTINUOUS MAPS PETER S. LANDWEBER, EMANUEL A. LAZAR, AND NEEL PATEL Abstract. We present a surprisingly short proof that for any continuous map f : R n R m, if n > m, then there
More informationINCIDENCE-BETWEENNESS GEOMETRY
INCIDENCE-BETWEENNESS GEOMETRY MATH 410, CSUSM. SPRING 2008. PROFESSOR AITKEN This document covers the geometry that can be developed with just the axioms related to incidence and betweenness. The full
More informationSOLUTIONS TO ASSIGNMENT 1 MATH 576
SOLUTIONS TO ASSIGNMENT 1 MATH 576 SOLUTIONS BY OLIVIER MARTIN 13 #5. Let T be the topology generated by A on X. We want to show T = J B J where B is the set of all topologies J on X with A J. This amounts
More informationTHE FUNDAMENTAL THEOREM OF ARBITRAGE PRICING
THE FUNDAMENTAL THEOREM OF ARBITRAGE PRICING 1. Introduction The Black-Scholes theory, which is the main subject of this course and its sequel, is based on the Efficient Market Hypothesis, that arbitrages
More information1 Local Brouwer degree
1 Local Brouwer degree Let D R n be an open set and f : S R n be continuous, D S and c R n. Suppose that the set f 1 (c) D is compact. (1) Then the local Brouwer degree of f at c in the set D is defined.
More informationTHE FUNDAMENTAL THEOREM OF ALGEBRA VIA PROPER MAPS
THE FUNDAMENTAL THEOREM OF ALGEBRA VIA PROPER MAPS KEITH CONRAD 1. Introduction The Fundamental Theorem of Algebra says every nonconstant polynomial with complex coefficients can be factored into linear
More informationLectures notes on orthogonal matrices (with exercises) 92.222 - Linear Algebra II - Spring 2004 by D. Klain
Lectures notes on orthogonal matrices (with exercises) 92.222 - Linear Algebra II - Spring 2004 by D. Klain 1. Orthogonal matrices and orthonormal sets An n n real-valued matrix A is said to be an orthogonal
More informationAn example of a computable
An example of a computable absolutely normal number Verónica Becher Santiago Figueira Abstract The first example of an absolutely normal number was given by Sierpinski in 96, twenty years before the concept
More informationUndergraduate Notes in Mathematics. Arkansas Tech University Department of Mathematics
Undergraduate Notes in Mathematics Arkansas Tech University Department of Mathematics An Introductory Single Variable Real Analysis: A Learning Approach through Problem Solving Marcel B. Finan c All Rights
More information88 CHAPTER 2. VECTOR FUNCTIONS. . First, we need to compute T (s). a By definition, r (s) T (s) = 1 a sin s a. sin s a, cos s a
88 CHAPTER. VECTOR FUNCTIONS.4 Curvature.4.1 Definitions and Examples The notion of curvature measures how sharply a curve bends. We would expect the curvature to be 0 for a straight line, to be very small
More informationClass Meeting # 1: Introduction to PDEs
MATH 18.152 COURSE NOTES - CLASS MEETING # 1 18.152 Introduction to PDEs, Fall 2011 Professor: Jared Speck Class Meeting # 1: Introduction to PDEs 1. What is a PDE? We will be studying functions u = u(x
More informationQuasi Contraction and Fixed Points
Available online at www.ispacs.com/jnaa Volume 2012, Year 2012 Article ID jnaa-00168, 6 Pages doi:10.5899/2012/jnaa-00168 Research Article Quasi Contraction and Fixed Points Mehdi Roohi 1, Mohsen Alimohammady
More informationLecture 7: Finding Lyapunov Functions 1
Massachusetts Institute of Technology Department of Electrical Engineering and Computer Science 6.243j (Fall 2003): DYNAMICS OF NONLINEAR SYSTEMS by A. Megretski Lecture 7: Finding Lyapunov Functions 1
More informationT ( a i x i ) = a i T (x i ).
Chapter 2 Defn 1. (p. 65) Let V and W be vector spaces (over F ). We call a function T : V W a linear transformation form V to W if, for all x, y V and c F, we have (a) T (x + y) = T (x) + T (y) and (b)
More informationContinuity of the Perron Root
Linear and Multilinear Algebra http://dx.doi.org/10.1080/03081087.2014.934233 ArXiv: 1407.7564 (http://arxiv.org/abs/1407.7564) Continuity of the Perron Root Carl D. Meyer Department of Mathematics, North
More informationSolutions to Math 51 First Exam January 29, 2015
Solutions to Math 5 First Exam January 29, 25. ( points) (a) Complete the following sentence: A set of vectors {v,..., v k } is defined to be linearly dependent if (2 points) there exist c,... c k R, not
More information1. Introduction. O. MALI, A. MUZALEVSKIY, and D. PAULY
Russ. J. Numer. Anal. Math. Modelling, Vol. 28, No. 6, pp. 577 596 (2013) DOI 10.1515/ rnam-2013-0032 c de Gruyter 2013 Conforming and non-conforming functional a posteriori error estimates for elliptic
More informationNotes V General Equilibrium: Positive Theory. 1 Walrasian Equilibrium and Excess Demand
Notes V General Equilibrium: Positive Theory In this lecture we go on considering a general equilibrium model of a private ownership economy. In contrast to the Notes IV, we focus on positive issues such
More informationDIFFERENTIABILITY OF COMPLEX FUNCTIONS. Contents
DIFFERENTIABILITY OF COMPLEX FUNCTIONS Contents 1. Limit definition of a derivative 1 2. Holomorphic functions, the Cauchy-Riemann equations 3 3. Differentiability of real functions 5 4. A sufficient condition
More informationMATH10212 Linear Algebra. Systems of Linear Equations. Definition. An n-dimensional vector is a row or a column of n numbers (or letters): a 1.
MATH10212 Linear Algebra Textbook: D. Poole, Linear Algebra: A Modern Introduction. Thompson, 2006. ISBN 0-534-40596-7. Systems of Linear Equations Definition. An n-dimensional vector is a row or a column
More informationChapter 3. Cartesian Products and Relations. 3.1 Cartesian Products
Chapter 3 Cartesian Products and Relations The material in this chapter is the first real encounter with abstraction. Relations are very general thing they are a special type of subset. After introducing
More information5.1 Radical Notation and Rational Exponents
Section 5.1 Radical Notation and Rational Exponents 1 5.1 Radical Notation and Rational Exponents We now review how exponents can be used to describe not only powers (such as 5 2 and 2 3 ), but also roots
More informationThe last three chapters introduced three major proof techniques: direct,
CHAPTER 7 Proving Non-Conditional Statements The last three chapters introduced three major proof techniques: direct, contrapositive and contradiction. These three techniques are used to prove statements
More informationCartesian Products and Relations
Cartesian Products and Relations Definition (Cartesian product) If A and B are sets, the Cartesian product of A and B is the set A B = {(a, b) :(a A) and (b B)}. The following points are worth special
More information1. Introduction. PROPER HOLOMORPHIC MAPPINGS BETWEEN RIGID POLYNOMIAL DOMAINS IN C n+1
Publ. Mat. 45 (2001), 69 77 PROPER HOLOMORPHIC MAPPINGS BETWEEN RIGID POLYNOMIAL DOMAINS IN C n+1 Bernard Coupet and Nabil Ourimi Abstract We describe the branch locus of proper holomorphic mappings between
More informationAu = = = 3u. Aw = = = 2w. so the action of A on u and w is very easy to picture: it simply amounts to a stretching by 3 and 2, respectively.
Chapter 7 Eigenvalues and Eigenvectors In this last chapter of our exploration of Linear Algebra we will revisit eigenvalues and eigenvectors of matrices, concepts that were already introduced in Geometry
More informationFurther Study on Strong Lagrangian Duality Property for Invex Programs via Penalty Functions 1
Further Study on Strong Lagrangian Duality Property for Invex Programs via Penalty Functions 1 J. Zhang Institute of Applied Mathematics, Chongqing University of Posts and Telecommunications, Chongqing
More informationON LIMIT LAWS FOR CENTRAL ORDER STATISTICS UNDER POWER NORMALIZATION. E. I. Pancheva, A. Gacovska-Barandovska
Pliska Stud. Math. Bulgar. 22 (2015), STUDIA MATHEMATICA BULGARICA ON LIMIT LAWS FOR CENTRAL ORDER STATISTICS UNDER POWER NORMALIZATION E. I. Pancheva, A. Gacovska-Barandovska Smirnov (1949) derived four
More informationSimilarity and Diagonalization. Similar Matrices
MATH022 Linear Algebra Brief lecture notes 48 Similarity and Diagonalization Similar Matrices Let A and B be n n matrices. We say that A is similar to B if there is an invertible n n matrix P such that
More informationMATH10040 Chapter 2: Prime and relatively prime numbers
MATH10040 Chapter 2: Prime and relatively prime numbers Recall the basic definition: 1. Prime numbers Definition 1.1. Recall that a positive integer is said to be prime if it has precisely two positive
More informationNOTES ON LINEAR TRANSFORMATIONS
NOTES ON LINEAR TRANSFORMATIONS Definition 1. Let V and W be vector spaces. A function T : V W is a linear transformation from V to W if the following two properties hold. i T v + v = T v + T v for all
More informationLinear Algebra I. Ronald van Luijk, 2012
Linear Algebra I Ronald van Luijk, 2012 With many parts from Linear Algebra I by Michael Stoll, 2007 Contents 1. Vector spaces 3 1.1. Examples 3 1.2. Fields 4 1.3. The field of complex numbers. 6 1.4.
More informationMax-Min Representation of Piecewise Linear Functions
Beiträge zur Algebra und Geometrie Contributions to Algebra and Geometry Volume 43 (2002), No. 1, 297-302. Max-Min Representation of Piecewise Linear Functions Sergei Ovchinnikov Mathematics Department,
More informationCHAPTER SIX IRREDUCIBILITY AND FACTORIZATION 1. BASIC DIVISIBILITY THEORY
January 10, 2010 CHAPTER SIX IRREDUCIBILITY AND FACTORIZATION 1. BASIC DIVISIBILITY THEORY The set of polynomials over a field F is a ring, whose structure shares with the ring of integers many characteristics.
More information8 Divisibility and prime numbers
8 Divisibility and prime numbers 8.1 Divisibility In this short section we extend the concept of a multiple from the natural numbers to the integers. We also summarize several other terms that express
More informationCHAPTER 3. Methods of Proofs. 1. Logical Arguments and Formal Proofs
CHAPTER 3 Methods of Proofs 1. Logical Arguments and Formal Proofs 1.1. Basic Terminology. An axiom is a statement that is given to be true. A rule of inference is a logical rule that is used to deduce
More informationLinear Programming Notes V Problem Transformations
Linear Programming Notes V Problem Transformations 1 Introduction Any linear programming problem can be rewritten in either of two standard forms. In the first form, the objective is to maximize, the material
More informationSolutions to Homework 10
Solutions to Homework 1 Section 7., exercise # 1 (b,d): (b) Compute the value of R f dv, where f(x, y) = y/x and R = [1, 3] [, 4]. Solution: Since f is continuous over R, f is integrable over R. Let x
More informationConvex Programming Tools for Disjunctive Programs
Convex Programming Tools for Disjunctive Programs João Soares, Departamento de Matemática, Universidade de Coimbra, Portugal Abstract A Disjunctive Program (DP) is a mathematical program whose feasible
More information4 Lyapunov Stability Theory
4 Lyapunov Stability Theory In this section we review the tools of Lyapunov stability theory. These tools will be used in the next section to analyze the stability properties of a robot controller. We
More information(Basic definitions and properties; Separation theorems; Characterizations) 1.1 Definition, examples, inner description, algebraic properties
Lecture 1 Convex Sets (Basic definitions and properties; Separation theorems; Characterizations) 1.1 Definition, examples, inner description, algebraic properties 1.1.1 A convex set In the school geometry
More information3. INNER PRODUCT SPACES
. INNER PRODUCT SPACES.. Definition So far we have studied abstract vector spaces. These are a generalisation of the geometric spaces R and R. But these have more structure than just that of a vector space.
More informationFinite dimensional topological vector spaces
Chapter 3 Finite dimensional topological vector spaces 3.1 Finite dimensional Hausdorff t.v.s. Let X be a vector space over the field K of real or complex numbers. We know from linear algebra that the
More informationINVARIANT METRICS WITH NONNEGATIVE CURVATURE ON COMPACT LIE GROUPS
INVARIANT METRICS WITH NONNEGATIVE CURVATURE ON COMPACT LIE GROUPS NATHAN BROWN, RACHEL FINCK, MATTHEW SPENCER, KRISTOPHER TAPP, AND ZHONGTAO WU Abstract. We classify the left-invariant metrics with nonnegative
More informationDate: April 12, 2001. Contents
2 Lagrange Multipliers Date: April 12, 2001 Contents 2.1. Introduction to Lagrange Multipliers......... p. 2 2.2. Enhanced Fritz John Optimality Conditions...... p. 12 2.3. Informative Lagrange Multipliers...........
More information4: SINGLE-PERIOD MARKET MODELS
4: SINGLE-PERIOD MARKET MODELS Ben Goldys and Marek Rutkowski School of Mathematics and Statistics University of Sydney Semester 2, 2015 B. Goldys and M. Rutkowski (USydney) Slides 4: Single-Period Market
More informationLecture 5 Principal Minors and the Hessian
Lecture 5 Principal Minors and the Hessian Eivind Eriksen BI Norwegian School of Management Department of Economics October 01, 2010 Eivind Eriksen (BI Dept of Economics) Lecture 5 Principal Minors and
More informationIdeal Class Group and Units
Chapter 4 Ideal Class Group and Units We are now interested in understanding two aspects of ring of integers of number fields: how principal they are (that is, what is the proportion of principal ideals
More informationHOMEWORK 5 SOLUTIONS. n!f n (1) lim. ln x n! + xn x. 1 = G n 1 (x). (2) k + 1 n. (n 1)!
Math 7 Fall 205 HOMEWORK 5 SOLUTIONS Problem. 2008 B2 Let F 0 x = ln x. For n 0 and x > 0, let F n+ x = 0 F ntdt. Evaluate n!f n lim n ln n. By directly computing F n x for small n s, we obtain the following
More informationMINIMIZATION OF ENTROPY FUNCTIONALS UNDER MOMENT CONSTRAINTS. denote the family of probability density functions g on X satisfying
MINIMIZATION OF ENTROPY FUNCTIONALS UNDER MOMENT CONSTRAINTS I. Csiszár (Budapest) Given a σ-finite measure space (X, X, µ) and a d-tuple ϕ = (ϕ 1,..., ϕ d ) of measurable functions on X, for a = (a 1,...,
More informationHow To Know If A Domain Is Unique In An Octempo (Euclidean) Or Not (Ecl)
Subsets of Euclidean domains possessing a unique division algorithm Andrew D. Lewis 2009/03/16 Abstract Subsets of a Euclidean domain are characterised with the following objectives: (1) ensuring uniqueness
More informationON COMPLETELY CONTINUOUS INTEGRATION OPERATORS OF A VECTOR MEASURE. 1. Introduction
ON COMPLETELY CONTINUOUS INTEGRATION OPERATORS OF A VECTOR MEASURE J.M. CALABUIG, J. RODRÍGUEZ, AND E.A. SÁNCHEZ-PÉREZ Abstract. Let m be a vector measure taking values in a Banach space X. We prove that
More informationSmooth functions statistics
Smooth functions statistics V. I. rnold To describe the topological structure of a real smooth function one associates to it the graph, formed by the topological variety, whose points are the connected
More informationFIRST YEAR CALCULUS. Chapter 7 CONTINUITY. It is a parabola, and we can draw this parabola without lifting our pencil from the paper.
FIRST YEAR CALCULUS WWLCHENW L c WWWL W L Chen, 1982, 2008. 2006. This chapter originates from material used by the author at Imperial College, University of London, between 1981 and 1990. It It is is
More informationIntroduction to Algebraic Geometry. Bézout s Theorem and Inflection Points
Introduction to Algebraic Geometry Bézout s Theorem and Inflection Points 1. The resultant. Let K be a field. Then the polynomial ring K[x] is a unique factorisation domain (UFD). Another example of a
More informationDERIVATIVES AS MATRICES; CHAIN RULE
DERIVATIVES AS MATRICES; CHAIN RULE 1. Derivatives of Real-valued Functions Let s first consider functions f : R 2 R. Recall that if the partial derivatives of f exist at the point (x 0, y 0 ), then we
More informationF. ABTAHI and M. ZARRIN. (Communicated by J. Goldstein)
Journal of Algerian Mathematical Society Vol. 1, pp. 1 6 1 CONCERNING THE l p -CONJECTURE FOR DISCRETE SEMIGROUPS F. ABTAHI and M. ZARRIN (Communicated by J. Goldstein) Abstract. For 2 < p
More informationInner product. Definition of inner product
Math 20F Linear Algebra Lecture 25 1 Inner product Review: Definition of inner product. Slide 1 Norm and distance. Orthogonal vectors. Orthogonal complement. Orthogonal basis. Definition of inner product
More informationLecture Notes on Elasticity of Substitution
Lecture Notes on Elasticity of Substitution Ted Bergstrom, UCSB Economics 210A March 3, 2011 Today s featured guest is the elasticity of substitution. Elasticity of a function of a single variable Before
More informationCONTINUED FRACTIONS AND FACTORING. Niels Lauritzen
CONTINUED FRACTIONS AND FACTORING Niels Lauritzen ii NIELS LAURITZEN DEPARTMENT OF MATHEMATICAL SCIENCES UNIVERSITY OF AARHUS, DENMARK EMAIL: niels@imf.au.dk URL: http://home.imf.au.dk/niels/ Contents
More informationClassification of Cartan matrices
Chapter 7 Classification of Cartan matrices In this chapter we describe a classification of generalised Cartan matrices This classification can be compared as the rough classification of varieties in terms
More informationTHE DIMENSION OF A VECTOR SPACE
THE DIMENSION OF A VECTOR SPACE KEITH CONRAD This handout is a supplementary discussion leading up to the definition of dimension and some of its basic properties. Let V be a vector space over a field
More informationSome Polynomial Theorems. John Kennedy Mathematics Department Santa Monica College 1900 Pico Blvd. Santa Monica, CA 90405 rkennedy@ix.netcom.
Some Polynomial Theorems by John Kennedy Mathematics Department Santa Monica College 1900 Pico Blvd. Santa Monica, CA 90405 rkennedy@ix.netcom.com This paper contains a collection of 31 theorems, lemmas,
More informationFACTORING POLYNOMIALS IN THE RING OF FORMAL POWER SERIES OVER Z
FACTORING POLYNOMIALS IN THE RING OF FORMAL POWER SERIES OVER Z DANIEL BIRMAJER, JUAN B GIL, AND MICHAEL WEINER Abstract We consider polynomials with integer coefficients and discuss their factorization
More information