A LOCALIZATION PROPERTY AT THE BOUNDARY FOR MONGE-AMPERE EQUATION
|
|
- Vivian Payne
- 5 years ago
- Views:
Transcription
1 A LOCALIZATION PROPERTY AT THE BOUNDARY FOR MONGE-AMPERE EQUATION O. SAVIN. Introduction In this paper we study the geometry of the sections for solutions to the Monge- Ampere equation det D 2 u = f, u : Ω R convex, which are centered at a boundary point x 0 Ω. We show that under natural local assumptions on the boundary data the domain, the sections S h (x 0 ) = {x Ω u(x) < u(x 0 ) + u(x 0 ) (x x 0 ) + h} are equivalent to ellipsoids centered at x 0, that is, for each h > 0 there exists an ellipsoid E h such that ce h Ω S h (x 0 ) x 0 CE h Ω, with c, C constants independent of h. The situation in the interior is well understood. Caffarelli showed in [C] that if for some x Ω, 0 < λ f Λ in Ω, S h (x) Ω, then S h (x) is equivalent to an ellipsoid centered at x i.e. ke S h (x) x k E for some ellipsoid E of volume h n/2 for a constant k > 0 which depends only on λ, Λ, n. This property provides compactness of sections modulo affine transformations. This is particularly useful when dealing with interior C 2,α W 2,p estimates of strictly convex solutions of det D 2 u = f when f > 0 is continuous (see [C2]). Sections at the boundary were also considered by Trudinger Wang in [TW] for solutions of det D 2 u = f but under stronger assumptions on the boundary behavior of u Ω, with f C α (Ω). They proved C 2,α estimates up to the boundary by bounding the mixed derivatives obtained that the sections are equivalent to balls. The author was partially supported by NSF grant
2 2 O. SAVIN 2. Statement of the main Theorem. Let Ω be a bounded convex set in R n. We assume throughout this note that (2.) B ρ (ρe n ) Ω {x n 0} B ρ, for some small ρ > 0, that is Ω (R n ) + Ω contains an interior ball tangent to Ω at 0. Let u : Ω R be convex, continuous, satisfying (2.2) det D 2 u = f, λ f Λ in Ω. We extend u to be outside Ω. By subtracting a linear function we may assume that (2.3) x n+ = 0 is the tangent plane to u at 0, in the sense that u 0, u(0) = 0, any hyperplane x n+ = ɛx n, ɛ > 0 is not a supporting hyperplane for u. In this paper we investigate the geometry of the sections of u at 0 that we denote for simplicity of notation S h := {x Ω : u(x) < h}. We show that if the boundary data has quadratic growth near {x n = 0} then, as h 0, S h is equivalent to a half-ellipsoid centered at 0. Precisely, our main theorem reads as follows. Theorem 2.. Assume that Ω, u satisfy (2.)-(2.3) above for some µ > 0, (2.4) µ x 2 u(x) µ x 2 on Ω {x n ρ}. Then, for each h < c(ρ) there exists an ellipsoid E h of volume h n/2 such that ke h Ω S h k E h. Moreover, the ellipsoid E h is obtained from the ball of radius h /2 by a linear transformation A h (sliding along the x n = 0 plane) A h E h = h /2 B A h (x) = x νx n, ν = (ν, ν 2,..., ν n, 0), with ν k log h. The constant k above depends on µ, λ, Λ, n c(ρ) depends also on ρ. Theorem 2. is new even in the case when f =. The ellipsoid E h, or equivalently the linear map A h, provides information about the behavior of the second derivatives near the origin. Heuristically, the theorem states that in S h the tangential second derivatives are bounded from above below the mixed second derivatives are bounded by log h. This is interesting given that f is only bounded the boundary data Ω are only C, at the origin. Remark. Given only the boundary data ϕ of u on Ω, it is not always easy to check condition (2.4). Here we provide some examples when (2.4) is satisfied: ) If ϕ is constant the domain Ω is included in a ball included in {x n 0}.
3 A LOCALIZATION PROPERTY 3 2) If the domain Ω is tangent of order 2 to {x n = 0} the boundary data ϕ has quadratic behavior in a neighborhood of 0. 3) ϕ, Ω C 3 at the origin, Ω is uniformly convex at the origin. We obtain compactness of sections modulo affine transformations. Corollary 2.2. Under the assumptions of Theorem 2., assume that lim f(x) = f(0) x 0 u(x) = P (x) + o( x 2 ) on Ω with P a quadratic polynomial. Then we can find a sequence of rescalings ũ h (x) := h u(h/2 A h x) which converges to a limiting continuous solution ū 0 : Ω 0 R with such that kb + Ω 0 k B + det D 2 ū 0 = f(0) ū 0 = P on Ω 0 {x n = 0}, ū 0 = on Ω 0 {x n > 0}. In a future work we intend to use the results above obtain C 2,α W 2,p boundary estimates under appropriate conditions on the domain boundary data. 3. Preliminaries Next proposition was proved by Trudinger Wang in [TW]. Since our setting is slightly different we provide its proof. Proposition 3.. Under the assumptions of Theorem 2., for all h c(ρ), there exists a linear transformation (sliding along x n = 0) A h (x) = x νx n, with ν n = 0, ν C(ρ)h n 2(n+) such that the rescaled function ũ(a h x) = u(x), satisfies in S h := A h S h = {ũ < h} the following: (i) the center of mass of S h lies on the x n -axis; (ii) k 0 h n/2 S h = S h k0 hn/2 ;
4 4 O. SAVIN (iii) the part of S h where {ũ < h} is a graph, denoted by G h = S h {ũ < h} = {(x, g h (x ))} that satisfies g h C(ρ) x 2 µ 2 x 2 ũ 2µ x 2 on G h. The constant k 0 above depends on µ, λ, Λ, n the constants C(ρ), c(ρ) depend also on ρ. In this section we denote by c, C positive constants that depend on n, µ, λ, Λ. For simplicity of notation, their values may change from line to line whenever there is no possibility of confusion. Constants that depend also on ρ are denote by c(ρ), C(ρ). Proof. The function v := µ x 2 + Λ µ n x2 n C(ρ)x n is a lower barrier for u in Ω {x n ρ} if C(ρ) is chosen large. Indeed, then v u on Ω {x n ρ}, In conclusion, hence v 0 u v u on Ω {x n = ρ}, det D 2 v > Λ. in Ω {x n ρ}, (3.) S h {x n ρ} {v < h} {x n > c(ρ)(µ x 2 h)}. Let x h be the center of mass of S h. We claim that (3.2) x h e n c 0 (ρ)h α, α = n n +, for some small c 0 (ρ) > 0. Otherwise, from (3.) John s lemma we obtain S h {x n C(n)c 0 h α h α } { x C h α/2 }, for some large C = C (ρ). Then the function w = ɛx n + h ( x 2 C h α/2 ) 2 + ΛC 2(n ) h is a lower barrier for u in S h if c 0 is sufficiently small. Indeed, for all small h, ( xn h α ) 2 w h 4 + h 2 + ΛC2(n ) (C(n)c 0 ) 2 h < h in S h, w ɛx n + h α C 2 x 2 x n + C(ρ)hc 0 h α µ x 2 u on Ω,
5 A LOCALIZATION PROPERTY 5 Hence det D 2 w = 2Λ. w u in S h, we contradict that 0 is the tangent plane at 0. Thus claim (3.2) is proved. Now, define The center of mass of S h = A h S h is A h x = x νx n, ν = x h x h e, n ũ(a h x) = u(x). x h = A h x h lies on the x n -axis from the definition of A h. Moreover, since x h S h, we see from (3.)-(3.2) that ν C(ρ) (x h e n) /2 (x h e n) C(ρ)h α/2, this proves (i). If we restrict the map A h on the set on Ω where {u < h}, i.e. on we have S h Ω {x n x 2 ρ } { x < Ch /2 } A h x x = ν x n C(ρ)h α/2 x 2 C(ρ)h α 2 x, part (iii) easily follows. Next we prove (ii). From John s lemma, we know that after relabeling the x coordinates if necessary, (3.3) D h B S h x h C(n)D h B where Since d d 2 0 D h = d n ũ 2µ x 2 on G h = {(x, g h (x ))}, we see that the domain of definition of g h contains a ball of radius (µh/2) /2. This implies that d i c h /2, i =,, n, for some c depending only on n µ. Also from (3.2) we see that which gives x h e n = x h e n c 0 (ρ)h α d n c(n) x h e n c(ρ)h α.
6 6 O. SAVIN We claim that for all small h, n d i k 0 h n/2, i= with k 0 small depending only on µ, n, Λ, which gives the left inequality in (ii). To this aim we consider the barrier, n ( ) 2 xi w = ɛx n + ch. We choose c sufficiently small depending on µ, n, Λ so that for all h < c(ρ), i= d i w h on S h, on the part of the boundary G h, we have w ũ since w ɛx n + c c 2 x 2 + ch µ 4 x 2 + chc(n) x n d n ( ) 2 xn d n µ 4 x 2 + ch α C(ρ) x 2 µ 2 x 2. Moreover, if our claim does not hold, then det D 2 w = (2ch) n ( d i ) 2n > Λ, thus w ũ in S h. By definition, ũ is obtained from u by a sliding along x n = 0, hence 0 is still the tangent plane of ũ at 0. We reach again a contradiction since ũ w ɛx n the claim is proved. Finally we show that S h Ch n/2 for some C depending only on λ, n. Indeed, if then Since we obtain the desired conclusion. v = h on S h, det D 2 v = λ v u 0 in S h. h h min S h v c(n, λ) S h 2/n In the proof above we showed that for all h c(ρ), the entries of the diagonal matrix D h from (3.3) satisfy d i ch /2, i =,... n
7 A LOCALIZATION PROPERTY 7 d n c(ρ)h α, α = n n + ch n/2 d i Ch n/2. The main step in the proof of Theorem 2. is the following lemma that will be proved in the remaining sections. Lemma 3.2. There exist constants c, c(ρ) such that (3.4) d n ch /2, for all h c(ρ). Using Lemma 3.2 we can easily finish the proof of our theorem. Proof of Theorem 2.. Since all d i are bounded below by ch /2 their product is bounded above by Ch n/2 we see that Ch /2 d i ch /2 for all h c(ρ). Using (3.3) we obtain Moreover, since S h Ch /2 B. i =,, n x h e n d n ch /2, ( x h) = 0, the part G h of the boundary S h contains the graph of g h above x ch /2, we find that ch /2 B Ω S h, with Ω = A h Ω, S h = A h S h. In conclusion We define the ellipsoid E h as ch /2 B Ω A h S h Ch /2 B. E h := A h (h/2 B ), hence ce h Ω S h CE h. Comparing the sections at levels h h/2 we find we easily obtain the inclusion ce h/2 Ω CE h A h A h/2 B CB. If we denote A h x = x ν h x n then the inclusion above implies which gives the desired bound for all small h. ν h ν h/2 C, ν h C log h
8 8 O. SAVIN We introduce a new quantity b(h) which is proportional to d n h /2 which is appropriate when dealing with affine transformations. Notation. Given a convex function u we define b u (h) = h /2 sup S h x n. Whenever there is no possibility of confusion we drop the subindex u use the notation b(h). Below we list some basic properties of b(h). ) If h h 2 then 2) A rescaling ( h h 2 ) 2 b(h ) b(h 2 ) ũ(ax) = u(x) ( h2 h ) 2. given by a linear transformation A which leaves the x n coordinate invariant does not change the value of b, i.e bũ(h) = b u (h). 3) If A is a linear transformation which leaves the plane {x n = 0} invariant the values of b get multiplied by a constant. However the quotients b(h )/b(h 2 ) do not change values i.e bũ(h ) bũ(h 2 ) = b u(h ) b u (h 2 ). then 4) If we multiply u by a constant, i.e. From (3.3) property 2 above, ũ(x) = βu(x) bũ(βh) = β /2 b u (h), bũ(βh ) bũ(βh 2 ) = b u(h ) b u (h 2 ). c(n)d n b(h)h /2 C(n)d n, hence Lemma 3.2 will follow if we show that b(h) is bounded below. We achieve this by proving the following lemma. Lemma 3.3. There exist c 0, c(ρ) such that if h c(ρ) b(h) c 0 then (3.5) for some t [c 0, ]. b(th) b(h) > 2,
9 A LOCALIZATION PROPERTY 9 This lemma states that if the value of b(h) on a certain section is less than a critical value c 0, then we can find a lower section at height still comparable to h where the value of b doubled. Clearly Lemma 3.3 property above imply that b(h) remains bounded for all h small enough. The quotient in (3.5) is the same for ũ which is defined in Proposition 3.. We normalize the domain S h ũ by considering the rescaling v(x) = hũ(h/2 Ax) where A is a multiple of D h (see (3.3)), A = γd h such that det A =. Then ch /2 γ Ch /2, the diagonal entries of A satisfy The function v satisfies a i c, i =, 2,, n, cb u (h) a n Cb u (h). λ det D 2 v Λ, v 0, v(0) = 0, is continuous it is defined in Ω v with Then for some x, Ω v := {v < } = h /2 A Sh. x + cb Ω v CB +, ct n/2 S t (v) Ct n/2, t, where S t (v) denotes the section of v. Since ũ = h in S h {x n C(ρ)h}, then v = on Ω v {x n σ}, σ := C(ρ)h α. Also, from Proposition 3. on the part G of the boundary of Ω v where {v < } we have n (3.6) 2 µ n a 2 i x 2 i v 2µ a 2 i x 2 i. i= In order to prove Lemma 3.3 we need to show that if σ, a n are sufficiently small depending on n, µ, λ, Λ then the function v above satisfies (3.7) b v (t) 2b v () for some > t c 0. Since α <, the smallness condition on σ is satisfied by taking h < c(ρ) sufficiently small. Also a n being small is equivalent to one of the a i, i n being large since their product is a i are bounded below. i=
10 0 O. SAVIN In the next sections we prove property (3.7) above by compactness, by letting σ 0, a i for some i. First we consider the 2D case in the last section the general case. 4. The 2 dimensional case. In order to fix ideas, we consider first the 2 dimensional case. We study the following class of solutions to the Monge-Ampere equation. Fix µ > 0 small, λ, Λ. We denote by D σ the set of convex, continuous functions such that (4.) (4.2) (4.3) λ det D 2 u Λ; u : Ω R 0 Ω, B µ (x 0 ) Ω B + /µ for some x 0 ; µh n/2 S h µ h n/2 ; (4.4) u = on Ω \ G, 0 u on G, u(0) = 0, with G a closed subset of Ω included in B σ, G Ω B σ. Proposition 4.. Assume n = 2. For any M > 0 there exists c 0 small depending on M, µ, λ, Λ, such that if u D σ σ c 0, then for some h c 0. b(h) := (sup x)h /2 > M S h Property (3.7) easily follows from the proposition above. Indeed, by choosing M = 2µ > 2b() we prove the existence of a section h c 0 such that b(h) 2b(). Also, the function v of the previous section satisfies v D c0 (after renaming the constant µ) provided that σ is sufficiently small a sufficiently large. We prove Proposition 4. by compactness. First we discuss briefly the compactness of bounded solutions to Monge-Ampere equation. For this we need to introduce solutions with possibly discontinuous boundary data. Let u : Ω R be a convex function with Ω R n bounded convex. We denote by Γ u := {(x, x n+ ) Ω R x n+ u(x)} the upper graph of u. Definition 4.2. We define the values of u on Ω to be equal to ϕ i.e if the upper graph of ϕ : Ω R { } u Ω = ϕ, Φ := {(x, x n+ ) Ω R x n+ ϕ(x)}
11 A LOCALIZATION PROPERTY is given by the closure of Γ u restricted to Ω R, Φ := Γ u ( Ω R). From the definition we see that ϕ is always lower semicontinuous. The following comparison principle holds: if w : Ω R is continuous det D 2 w Λ det D 2 u, w Ω u Ω, then w u in Ω. Indeed, from the continuity of w we see that for any ε > 0, there exists a small neighborhood of Ω where w ε < u. This inequality holds in the interior from the stard comparison principle, hence w u in Ω. Since the convex functions are defined on different domains we use the following notion of convergence. Definition 4.3. We say that the convex functions u m : Ω m R converge to u : Ω R if the upper graphs converge Γ um Γ u in the Hausdorff distance. Similarly, we say that the lower semicontinuous functions ϕ m : Ω m R converge to ϕ : Ω R if the upper graphs converge Φ m Φ in the Hausdorff distance. Clearly if u m converges to u, then u m converges uniformly to u in any compact set of Ω, Ω m Ω in the Hausdorff distance. Remark: When we restrict the Hausdorff distance to the nonempty closed sets of a compact set we obtain a compact metric space. Thus, if Ω m, u m are uniformly bounded then we can always extract a subsequence m k such that u mk u u mk Ωmk ϕ. Next lemma gives the relation between the boundary data of the limit u ϕ. Lemma 4.4. Let u m : Ω m R be convex functions, uniformly bounded, such that λ det D 2 u m Λ u m u, u m Ωm ϕ. Then λ det D 2 u Λ, the boundary data of u is given by ϕ the convex envelope of ϕ on Ω. Proof. Clearly Φ Γ u, hence Φ Γ u. It remains to show that the convex set K generated by Φ contains Γ u ( Ω R). Indeed consider a hyperplane x n+ = l(x) which lies strictly below K. Then, for all large m {u m l 0} Ω m, by Alexrov estimate we have that u m l Cd /n m
12 2 O. SAVIN where d m (x) represents the distance from x to Ω m. By taking m we see that u l Cd /n thus no point on Ω below l belongs to Γ u. In view of the lemma above we introduce the following notation. Definition 4.5. Let ϕ : Ω R be a lower semicontinuous function. When we write that a convex function u satisfies u = ϕ on Ω we underst u Ω = ϕ where ϕ is the convex envelope of ϕ on Ω. Whenever ϕ ϕ do not coincide we can think of the graph of u as having a vertical part on Ω between ϕ ϕ. It follows easily from the definition above that the boundary values of u when we restrict to the domain Ω h := {u < h} are given by ϕ h = ϕ on Ω {ϕ h} Ω h ϕ h = h on the remaining part of Ω h. The comparison principle still holds. Precisely, if w : Ω R is continuous det D 2 w Λ det D 2 u, w Ω ϕ, then w u in Ω. The advantage of introducing the notation of Definition 4.5 is that the boundary data is preserved under limits. Proposition 4.6 (Compactness). Assume λ det D 2 u m Λ, u m = ϕ m on Ω m, Ω m, ϕ m uniformly bounded. Then there exists a subsequence m k such that with u mk u, ϕ mk ϕ λ det D 2 u Λ, u = ϕ on Ω. Indeed, we see that we can also choose m k such that ϕ m k ψ. Since ϕ mk ϕ we obtain ϕ ψ ϕ, the conclusion follows from Lemma 4.4. Now we are ready to prove Proposition 4.. Proof of Proposition 4.. If c 0 does not exist we can find a sequence of functions u m D /m such that b um (h) M, h m.
13 A LOCALIZATION PROPERTY 3 By Proposition 4.6 there is a subsequence which converges to a limiting function u satisfying (4.)-(4.2)-(4.3) (see Definition 4.5) u = ϕ on Ω with (4.5) ϕ = on Ω \ {0}, ϕ(0) = 0, moreover u has an obstacle by below in Ω (4.6) u M 2 x2 2. We consider the barrier w := δ( x + 2 x2 ) + Λ δ x2 2 Nx 2 with δ small depending on µ, N large so that Then Hence which gives Λ δ x2 2 Nx 2 0 in B + /µ. w ϕ on Ω, det D 2 w > Λ. w u in Ω u δ x Nx 2. Next we construct another explicit subsolution v such that whenever v is above the two obstacles δ x Nx 2, M 2 x2 2, we have det D 2 v > Λ v. Then we can conclude that u v, we show that this contradicts the lower bound on S h. We look for a function of the form v := rf(θ) + 2M 2 x2 2, where r, θ represent the polar coordinates in the x, x 2 plane. The domain of definition of v is the angle K := {θ 0 θ π θ 0 } with θ 0 small so that 2M 2 x2 2 2 (δ x Nx 2 ) on K B µ. In the set {v M 2 x2 2} i.e. where r sin2 θ 2M 2 f
14 4 O. SAVIN we have (4.7) det D 2 v = r (f + f) sin2 θ M 2 f (f + f) sin4 θ 0 2M 4. We let f(θ) = σe C0 π 2 θ, where C 0 is large depending on θ 0, M, Λ so that (see (4.7)) det D 2 v > Λ in the set where {v M 2 x2 2}. On the other h we can choose σ small so that v δ x Nx 2 on K B µ v on the set {v M 2 x2 2}. In conclusion u v ɛx 2, hence u max{ɛx 2, δ x Nx 2 }. This implies S h Ch 2 for all small h we contradict that S h µh, h [0, ]. 5. The higher dimensional case In higher dimensions it is more difficult to construct an explicit barrier as in Proposition 4. in the case when in (3.6) only one a i is large the others are bounded. We prove our result by induction depending on the number of large eigenvalues a i. Fix µ small λ, Λ. For each increasing sequence with we consider the family of solutions α α 2... α n α µ, D µ σ(α, α 2,..., α n ) of convex, continuous functions u : Ω R that satisfy (5.) λ det D 2 u Λ in Ω, u 0 in Ω; (5.2) 0 Ω, B µ (x 0 ) Ω B + /µ for some x 0 ; (5.3) µh n/2 S h µ h n/2 ; (5.4) u = on Ω \ G;
15 A LOCALIZATION PROPERTY 5 (5.5) n n µ αi 2 x 2 i u µ αi 2 x 2 i on G, where G is a closed subset of Ω which is a graph in the e n direction is included in boundary in {x n σ}. For convenience we would like to add the limiting solutions when α k+ σ 0. We denote by D µ 0 (α,..., α k,,,..., ) the class of functions u : Ω R that satisfy properties (5.)-(5.2)-(5.3) (see Definition 4.5) u = ϕ on Ω with (5.6) ϕ = on Ω \ G; (5.7) µ where G is a closed set k αi 2 x 2 i ϕ min{,, µ G Ω {x i = 0, k αi 2 x 2 i } on G, i > k}, if we restrict to the space generated by the first k coordinates then k k { µ αi 2 x 2 i } G { µ αi 2 x 2 i }. We extend the definition of D µ σ(α, α 2,..., α n ) to include also the pairs with µ α... α k <, α k+ = = α n = for which σ = 0 i.e. D µ 0 (α, α 2,..., α k,,..., ). Proposition 4.6 implies that if u m D µ σ m (a m,..., a m n ) is a sequence with σ m 0 a m k+ for some fixed 0 k n 2, then we can extract a convergent subsequence to a function u with u D µ 0 (a,.., a l,,.., ), for some l k a... a l. Proposition 5.. For any M > 0 k n there exists C k depending on M, µ, λ, Λ, n, k such that if u D µ σ(α, α 2,..., α n ) with α k C k, σ C k then b(h) = (sup x n )h /2 M S h for some h with C k h. As we remarked in the previous section, property (3.7) therefore Lemma 3.3 follow from Proposition 5. by taking k = n M = 2µ. We prove the proposition by induction on k.
16 6 O. SAVIN Lemma 5.2. Proposition 5. holds for k =. Proof. By compactness we need to show that there does not exist u D µ 0 (,..., ) with b(h) M for all h. The proof is almost identical to the 2 dimensional case. One can see as before that u max{δ x Nx n, M 2 x2 n} then construct a barrier of the form v = rf(θ) + 2M 2 x2 n, θ 0 θ π 2 where r = x θ represents the angle in [0, π/2] between the ray passing through x the {x n = 0} plane. Now, det D 2 v = f ( + f f cos θ f sin θ r r cos θ We have f r > sin2 θ 2M 2 on the set {v > M 2 x2 n} we choose a function of the form which is decreasing in θ. Then det D 2 v > f + f f if C 0 is chosen large. We obtain as before that which gives we reach a contradiction. f(θ) := νe C0( π 2 θ) ) n 2 sin 2 θ M 2. ( sin 2 ) n θ 0 2M 2 > Λ u max{δ x Nx n, ɛx n } S h Ch n Now we prove Proposition 5. by induction on k. Proof of Proposition 5.. In this proof we denote by c, C positive constants that depend on M, µ, λ, Λ, n k. We assume that the statement holds for k we prove it for k +. It suffices to show the existence of C k+ only in the case when α k < C k, otherwise we use the induction hypothesis. If no C k+ exists then we can find a limiting solution with u D µ 0 (,,...,,,..., ) (5.8) b(h) < Mh /2, h > 0 where µ depends on µ C k. We show that such a function u does not exist.
17 A LOCALIZATION PROPERTY 7 Denote x = (y, z, x n ), y = (x,..., x k ) R k, z = (x k+,..., x n ) R n k. On the Ω plane we have ϕ w := δ x 2 + δ z + Λ δ n x2 n Nx n for some small δ depending on µ, N large so that Since we obtain u w on Ω hence Λ δ n x2 n Nx n 0 on B + / µ. det D 2 w > Λ, (5.9) u(x) δ z Nx n. We look at the section S h of u. From (5.8)-(5.9) we see that (5.0) S h {x n > N (δ z h)} {x n Mh /2 }. with We notice that an affine transformation x T x, T x := x + ν z + ν 2 z ν n k z n k + ν n k x n ν, ν 2,..., ν n k span{e,..., e k } i.e a sliding along the y direction, leaves the z, x n coordinate invariant together with the subspace (y, 0, 0). The section S h := T S h of the rescaling satisfies (5.0) ũ = ϕ on S h with ũ(t x) = u(x) ϕ = ϕ on G := {ϕ h} G, ϕ = h on S h \ G. From John s lemma we know that S h is equivalent to an ellipsoid E h. We choose T an appropriate sliding along the y direction, so that T E h becomes symmetric with respect to the y (z, x n ) subspaces, thus x h + c(n) S h /n AB S h C(n) S h /n AB, det A = the matrix A leaves the y the (z, x n ) subspaces invariant. By choosing an appropriate system of coordinates in the y z variables we may assume A(y, z, x n ) = (A y, A 2 (z, x n )) with with 0 < β β k, β β 2 0 A = β k
18 8 O. SAVIN γ k+ 0 0 θ k+ 0 γ k+2 0 θ k+2 A 2 = γ n θ n θ n with γ j, θ n > 0. Next we use the induction hypothesis show that S h is equivalent to a ball. Lemma 5.3. There exists C 0 such that S h C 0 h n/2 B +. Proof. Using that we obtain We need to show that Since S h satisfies (5.0) we see that S h h n/2 x h + ch /2 AB S h Ch /2 AB. A C. S h { (z, x n ) Ch /2 }, which together with the inclusion above gives A 2 C hence Also S h contains the set which implies We define the rescaling {(y, 0, 0) γ j, θ n C, θ j C. y µ /2 h /2 } G, β i c > 0, i =,, k. w(x) = hũ(h/2 Ax) which is defined in a domain Ω w := h /2 A Sh such that w = ϕ w on Ω w with B c (x 0 ) Ω w B + C, 0 Ω w, ϕ w = on Ω w \ G w, µ β 2 i x 2 i ϕ w min{, µ β 2 i x 2 i } on G w, where G w := h /2 A G. This implies that w D µ 0 (β, β 2,..., β k,,..., ) for some value µ depending on µ, M, λ, Λ, n, k. We claim that b u (h) c. First we notice that b u (h) = bũ(h) θ n.
19 A LOCALIZATION PROPERTY 9 Since θ n βi γj = det A = γ j C, we see that if b u (h) ( therefore θ n ) becomes smaller than a critical value c then β k C k ( µ, M, λ, Λ, n), with M := 2 µ, by the induction hypothesis b w ( h) M 2b w () for some h > C k. This gives b u (h h) b u (h) = b w( h) b w () 2, which implies b u (h h) 2b u (h) our claim follows. Next we claim that γ j are bounded below by the same argument. Indeed, from the claim above θ n is bounded below if some γ j is smaller than a small value c then β k C k ( µ, M, λ, Λ, n) with M := 2M µc. By the induction hypothesis b w ( h) M 2M c b w (), hence b u (h h) b u (h) 2M c which gives b u (h h) 2M, contradiction. In conclusion θ n, γ j are bounded below which implies that β i are bounded above. This shows that A is bounded the lemma is proved. Next we use the lemma above show that the function u has the following property. Lemma 5.4. If for some p, q > 0, u p( z qx n ), q q 0 then u p ( z (q η)x n ) for some p p, with η > 0 depending on q 0 µ, M, λ, Λ, n, k. Proof. From Lemma 5.3 we see that after performing a linear transformation T (siding along the y direction) we may assume that Let S h C 0 h /2 B. w(x) := h u(h/2 x)
20 20 O. SAVIN for some small h p. Then our hypothesis becomes S (w) := Ω w = h /2 S h B + C 0 (5.) w p h /2 ( z qx n), Moreover the boundary values ϕ w of w on Ω w satisfy ϕ w = on Ω w \ G w µ y 2 ϕ w min{, µ y 2 } on G w, where G w := h /2 {ϕ h}. Next we show that ϕ w v on Ω w where v is defined as v := δ x 2 + Λ δ n (z qx n ) 2 + N(z qx n ) + δx n, δ is small depending on µ C 0, N is chosen large such that Λ δ n t2 + Nt is increasing in the interval t ( + q 0 )C 0. From the definition of v we see that det D 2 v > Λ. On the part of the boundary Ω w where z qx n we use that Ω w B C0 obtain v δ( x 2 + x n ) ϕ w. On the part of the boundary Ω w where z > qx n we use (5.) obtain = ϕ w C( z qx n ) C(z qx n ) with C arbitrarily large provided that h is small enough. We choose C such that the inequality above implies Then Λ δ n (z qx n ) 2 + N(z qx n ) < 2. ϕ w = > 2 + δ( x 2 + x n ) v. In conclusion ϕ w v on Ω w hence the function v is a lower barrier for w in Ω w. Then w N(z qx n ) + δx n, since this inequality holds for all directions in the z-plane, we obtain Scaling back we get w N( z (q η)x n ), η := δ N. u p ( z (q η)x n ) in S h. Since u is convex u(0) = 0, this inequality holds globally, the lemma is proved.
21 A LOCALIZATION PROPERTY 2 We remark that Lemma 5.4 can be used directly to prove Proposition 4. Lemma 5.2. End of the proof of Proposition 5.. From (5.9) we obtain an initial pair (p, q 0 ) which satisfies the hypothesis of Lemma 5.4. We apply this lemma a finite number of times obtain that u ɛ( z + x n ), we contradict that S h is equivalent to a ball of radius h /2. References [C] [C2] [TW] Caffarelli L., A localization property of viscosity solutions to the Monge-Ampere equation their strict convexity, Ann. of Math. 3 (990), Caffarelli L., Interior W 2,p estimates for solutions of Monge-Ampere equation, Ann. of Math. 3 (990), Trudinger N., Wang X.J, Boundary regularity for Monge-Ampere affine maximal surface equations, Ann. of Math. 67 (2008), Department of Mathematics, Columbia University, New York, NY address: savin@math.columbia.edu
1. Introduction Boundary estimates for the second derivatives of the solution to the Dirichlet problem for the Monge-Ampere equation
POINTWISE C 2,α ESTIMATES AT THE BOUNDARY FOR THE MONGE-AMPERE EQUATION O. SAVIN Abstract. We prove a localization property of boundary sections for solutions to the Monge-Ampere equation. As a consequence
More informationESTIMATES FOR THE MONGE-AMPERE EQUATION
GLOBAL W 2,p ESTIMATES FOR THE MONGE-AMPERE EQUATION O. SAVIN Abstract. We use a localization property of boundary sections for solutions to the Monge-Ampere equation obtain global W 2,p estimates under
More informationVISCOSITY SOLUTIONS. We follow Han and Lin, Elliptic Partial Differential Equations, 5.
VISCOSITY SOLUTIONS PETER HINTZ We follow Han and Lin, Elliptic Partial Differential Equations, 5. 1. Motivation Throughout, we will assume that Ω R n is a bounded and connected domain and that a ij C(Ω)
More informationREGULARITY RESULTS FOR THE EQUATION u 11 u 22 = Introduction
REGULARITY RESULTS FOR THE EQUATION u 11 u 22 = 1 CONNOR MOONEY AND OVIDIU SAVIN Abstract. We study the equation u 11 u 22 = 1 in R 2. Our results include an interior C 2 estimate, classical solvability
More informationDegenerate Monge-Ampère equations and the smoothness of the eigenfunction
Degenerate Monge-Ampère equations and the smoothness of the eigenfunction Ovidiu Savin Columbia University November 2nd, 2015 Ovidiu Savin (Columbia University) Degenerate Monge-Ampère equations November
More informationCalculus of Variations
Calc. Var. (2004) DOI: 10.1007/s00526-004-0275-8 Calculus of Variations Ovidiu Savin The obstacle problem for Monge Ampere equation Received: 4 February 2003 / Accepted: 3 March 2004 Published online:
More informationThe Monge-Ampère Equation. Connor Mooney
The Monge-Ampère Equation Connor Mooney 1 Contents 1 Introduction 3 2 Basics 4 3 Solving the Dirichlet Problem 7 3.1 Boundary Harnack Inequality.......................... 8 4 Pogorelov s Estimate 10 5
More informationPARTIAL REGULARITY OF BRENIER SOLUTIONS OF THE MONGE-AMPÈRE EQUATION
PARTIAL REGULARITY OF BRENIER SOLUTIONS OF THE MONGE-AMPÈRE EQUATION ALESSIO FIGALLI AND YOUNG-HEON KIM Abstract. Given Ω, Λ R n two bounded open sets, and f and g two probability densities concentrated
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 informationMINIMAL SURFACES AND MINIMIZERS OF THE GINZBURG-LANDAU ENERGY
MINIMAL SURFACES AND MINIMIZERS OF THE GINZBURG-LANDAU ENERGY O. SAVIN 1. Introduction In this expository article we describe various properties in parallel for minimal surfaces and minimizers of the Ginzburg-Landau
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 informationOn John type ellipsoids
On John type ellipsoids B. Klartag Tel Aviv University Abstract Given an arbitrary convex symmetric body K R n, we construct a natural and non-trivial continuous map u K which associates ellipsoids to
More informationFUNCTIONAL ANALYSIS LECTURE NOTES: COMPACT SETS AND FINITE-DIMENSIONAL SPACES. 1. Compact Sets
FUNCTIONAL ANALYSIS LECTURE NOTES: COMPACT SETS AND FINITE-DIMENSIONAL SPACES CHRISTOPHER HEIL 1. Compact Sets Definition 1.1 (Compact and Totally Bounded Sets). Let X be a metric space, and let E X be
More informationC 1 regularity of solutions of the Monge-Ampère equation for optimal transport in dimension two
C 1 regularity of solutions of the Monge-Ampère equation for optimal transport in dimension two Alessio Figalli, Grégoire Loeper Abstract We prove C 1 regularity of c-convex weak Alexandrov solutions of
More informationRegularity of flat level sets in phase transitions
Annals of Mathematics, 69 (2009), 4 78 Regularity of flat level sets in phase transitions By Ovidiu Savin Abstract We consider local minimizers of the Ginzburg-Landau energy functional 2 u 2 + 4 ( u2 )
More informationTHE INVERSE FUNCTION THEOREM
THE INVERSE FUNCTION THEOREM W. PATRICK HOOPER The implicit function theorem is the following result: Theorem 1. Let f be a C 1 function from a neighborhood of a point a R n into R n. Suppose A = Df(a)
More informationFunctional Analysis I
Functional Analysis I Course Notes by Stefan Richter Transcribed and Annotated by Gregory Zitelli Polar Decomposition Definition. An operator W B(H) is called a partial isometry if W x = X for all x (ker
More informationCentre for Mathematics and Its Applications The Australian National University Canberra, ACT 0200 Australia. 1. Introduction
ON LOCALLY CONVEX HYPERSURFACES WITH BOUNDARY Neil S. Trudinger Xu-Jia Wang Centre for Mathematics and Its Applications The Australian National University Canberra, ACT 0200 Australia Abstract. In this
More informationSingular Solutions to the Monge-Ampère Equation. Connor Mooney
Singular Solutions to the Monge-Ampère Equation Connor Mooney Submitted in partial fulfillment of the requirements for the degree of Doctor of Philosophy in the Graduate School of Arts and Sciences COLUMBIA
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 informationREGULARITY OF POTENTIAL FUNCTIONS IN OPTIMAL TRANSPORTATION. Centre for Mathematics and Its Applications The Australian National University
ON STRICT CONVEXITY AND C 1 REGULARITY OF POTENTIAL FUNCTIONS IN OPTIMAL TRANSPORTATION Neil Trudinger Xu-Jia Wang Centre for Mathematics and Its Applications The Australian National University Abstract.
More informationThe optimal partial transport problem
The optimal partial transport problem Alessio Figalli Abstract Given two densities f and g, we consider the problem of transporting a fraction m [0, min{ f L 1, g L 1}] of the mass of f onto g minimizing
More informationPHASE TRANSITIONS: REGULARITY OF FLAT LEVEL SETS
PHASE TRANSITIONS: REGULARITY OF FLAT LEVEL SETS OVIDIU SAVIN Abstract. We consider local minimizers of the Ginzburg-Landau energy functional 2 u 2 + 4 ( u2 ) 2 dx and prove that, if the level set is included
More informationREGULARITY OF MONOTONE TRANSPORT MAPS BETWEEN UNBOUNDED DOMAINS
REGULARITY OF MONOTONE TRANSPORT MAPS BETWEEN UNBOUNDED DOMAINS DARIO CORDERO-ERAUSQUIN AND ALESSIO FIGALLI A Luis A. Caffarelli en su 70 años, con amistad y admiración Abstract. The regularity of monotone
More informationTopological vectorspaces
(July 25, 2011) Topological vectorspaces Paul Garrett garrett@math.umn.edu http://www.math.umn.edu/ garrett/ Natural non-fréchet spaces Topological vector spaces Quotients and linear maps More topological
More informationFrom now on, we will represent a metric space with (X, d). Here are some examples: i=1 (x i y i ) p ) 1 p, p 1.
Chapter 1 Metric spaces 1.1 Metric and convergence We will begin with some basic concepts. Definition 1.1. (Metric space) Metric space is a set X, with a metric satisfying: 1. d(x, y) 0, d(x, y) = 0 x
More informationVISCOSITY SOLUTIONS OF ELLIPTIC EQUATIONS
VISCOSITY SOLUTIONS OF ELLIPTIC EQUATIONS LUIS SILVESTRE These are the notes from the summer course given in the Second Chicago Summer School In Analysis, in June 2015. We introduce the notion of viscosity
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 informationconverges as well if x < 1. 1 x n x n 1 1 = 2 a nx n
Solve the following 6 problems. 1. Prove that if series n=1 a nx n converges for all x such that x < 1, then the series n=1 a n xn 1 x converges as well if x < 1. n For x < 1, x n 0 as n, so there exists
More informationAn introduction to Mathematical Theory of Control
An introduction to Mathematical Theory of Control Vasile Staicu University of Aveiro UNICA, May 2018 Vasile Staicu (University of Aveiro) An introduction to Mathematical Theory of Control UNICA, May 2018
More informationDeforming conformal metrics with negative Bakry-Émery Ricci Tensor on manifolds with boundary
Deforming conformal metrics with negative Bakry-Émery Ricci Tensor on manifolds with boundary Weimin Sheng (Joint with Li-Xia Yuan) Zhejiang University IMS, NUS, 8-12 Dec 2014 1 / 50 Outline 1 Prescribing
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 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 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 informationarxiv: v2 [math.ag] 24 Jun 2015
TRIANGULATIONS OF MONOTONE FAMILIES I: TWO-DIMENSIONAL FAMILIES arxiv:1402.0460v2 [math.ag] 24 Jun 2015 SAUGATA BASU, ANDREI GABRIELOV, AND NICOLAI VOROBJOV Abstract. Let K R n be a compact definable set
More informationAFFINE MAXIMAL HYPERSURFACES. Xu-Jia Wang. Centre for Mathematics and Its Applications The Australian National University
AFFINE MAXIMAL HYPERSURFACES Xu-Jia Wang Centre for Mathematics and Its Applications The Australian National University Abstract. This is a brief survey of recent works by Neil Trudinger and myself on
More informationarxiv: v1 [math.ap] 10 Apr 2013
QUASI-STATIC EVOLUTION AND CONGESTED CROWD TRANSPORT DAMON ALEXANDER, INWON KIM, AND YAO YAO arxiv:1304.3072v1 [math.ap] 10 Apr 2013 Abstract. We consider the relationship between Hele-Shaw evolution with
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 informationExample 1. Hamilton-Jacobi equation. In particular, the eikonal equation. for some n( x) > 0 in Ω. Here 1 / 2
Oct. 1 0 Viscosity S olutions In this lecture we take a glimpse of the viscosity solution theory for linear and nonlinear PDEs. From our experience we know that even for linear equations, the existence
More informationIntegral Jensen inequality
Integral Jensen inequality Let us consider a convex set R d, and a convex function f : (, + ]. For any x,..., x n and λ,..., λ n with n λ i =, we have () f( n λ ix i ) n λ if(x i ). For a R d, let δ a
More informationConvex Sets. Prof. Dan A. Simovici UMB
Convex Sets Prof. Dan A. Simovici UMB 1 / 57 Outline 1 Closures, Interiors, Borders of Sets in R n 2 Segments and Convex Sets 3 Properties of the Class of Convex Sets 4 Closure and Interior Points of Convex
More informationTechnical Results on Regular Preferences and Demand
Division of the Humanities and Social Sciences Technical Results on Regular Preferences and Demand KC Border Revised Fall 2011; Winter 2017 Preferences For the purposes of this note, a preference relation
More information1 Definition of the Riemann integral
MAT337H1, Introduction to Real Analysis: notes on Riemann integration 1 Definition of the Riemann integral Definition 1.1. Let [a, b] R be a closed interval. A partition P of [a, b] is a finite set of
More informationALEKSANDROV-TYPE ESTIMATES FOR A PARABOLIC MONGE-AMPÈRE EQUATION
Electronic Journal of Differential Equations, Vol. 2005(2005), No. 11, pp. 1 8. ISSN: 1072-6691. URL: http://ejde.math.txstate.edu or http://ejde.math.unt.edu ftp ejde.math.txstate.edu (login: ftp) ALEKSANDROV-TYPE
More informationConvex solutions to the mean curvature flow
Annals of Mathematics 173 (2011), 1185 1239 doi: 10.4007/annals.2011.173.3.1 Convex solutions to the mean curvature flow By Xu-Jia Wang Abstract In this paper we study the classification of ancient convex
More informationIn particular, if A is a square matrix and λ is one of its eigenvalues, then we can find a non-zero column vector X with
Appendix: Matrix Estimates and the Perron-Frobenius Theorem. This Appendix will first present some well known estimates. For any m n matrix A = [a ij ] over the real or complex numbers, it will be convenient
More informationBanach Spaces V: A Closer Look at the w- and the w -Topologies
BS V c Gabriel Nagy Banach Spaces V: A Closer Look at the w- and the w -Topologies Notes from the Functional Analysis Course (Fall 07 - Spring 08) In this section we discuss two important, but highly non-trivial,
More informationIntroduction to Topology
Introduction to Topology Randall R. Holmes Auburn University Typeset by AMS-TEX Chapter 1. Metric Spaces 1. Definition and Examples. As the course progresses we will need to review some basic notions about
More informationOptimality Conditions for Constrained Optimization
72 CHAPTER 7 Optimality Conditions for Constrained Optimization 1. First Order Conditions In this section we consider first order optimality conditions for the constrained problem P : minimize f 0 (x)
More informationCommutative Banach algebras 79
8. Commutative Banach algebras In this chapter, we analyze commutative Banach algebras in greater detail. So we always assume that xy = yx for all x, y A here. Definition 8.1. Let A be a (commutative)
More informationOptimal Transportation. Nonlinear Partial Differential Equations
Optimal Transportation and Nonlinear Partial Differential Equations Neil S. Trudinger Centre of Mathematics and its Applications Australian National University 26th Brazilian Mathematical Colloquium 2007
More informationRecall that any inner product space V has an associated norm defined by
Hilbert Spaces Recall that any inner product space V has an associated norm defined by v = v v. Thus an inner product space can be viewed as a special kind of normed vector space. In particular every inner
More informationMetric Spaces and Topology
Chapter 2 Metric Spaces and Topology From an engineering perspective, the most important way to construct a topology on a set is to define the topology in terms of a metric on the set. This approach underlies
More informationContinuous Functions on Metric Spaces
Continuous Functions on Metric Spaces Math 201A, Fall 2016 1 Continuous functions Definition 1. Let (X, d X ) and (Y, d Y ) be metric spaces. A function f : X Y is continuous at a X if for every ɛ > 0
More informationPart III. 10 Topological Space Basics. Topological Spaces
Part III 10 Topological Space Basics Topological Spaces Using the metric space results above as motivation we will axiomatize the notion of being an open set to more general settings. Definition 10.1.
More informationNear-Potential Games: Geometry and Dynamics
Near-Potential Games: Geometry and Dynamics Ozan Candogan, Asuman Ozdaglar and Pablo A. Parrilo January 29, 2012 Abstract Potential games are a special class of games for which many adaptive user dynamics
More informationTopology, Math 581, Fall 2017 last updated: November 24, Topology 1, Math 581, Fall 2017: Notes and homework Krzysztof Chris Ciesielski
Topology, Math 581, Fall 2017 last updated: November 24, 2017 1 Topology 1, Math 581, Fall 2017: Notes and homework Krzysztof Chris Ciesielski Class of August 17: Course and syllabus overview. Topology
More informationarxiv: v1 [math.ap] 25 Jul 2012
THE DIRICHLET PROBLEM FOR THE FRACTIONAL LAPLACIAN: REGULARITY UP TO THE BOUNDARY XAVIER ROS-OTON AND JOAQUIM SERRA arxiv:1207.5985v1 [math.ap] 25 Jul 2012 Abstract. We study the regularity up to the boundary
More informationHomogenization and error estimates of free boundary velocities in periodic media
Homogenization and error estimates of free boundary velocities in periodic media Inwon C. Kim October 7, 2011 Abstract In this note I describe a recent result ([14]-[15]) on homogenization and error estimates
More informationLaplace s Equation. Chapter Mean Value Formulas
Chapter 1 Laplace s Equation Let be an open set in R n. A function u C 2 () is called harmonic in if it satisfies Laplace s equation n (1.1) u := D ii u = 0 in. i=1 A function u C 2 () is called subharmonic
More informationAustin Mohr Math 730 Homework. f(x) = y for some x λ Λ
Austin Mohr Math 730 Homework In the following problems, let Λ be an indexing set and let A and B λ for λ Λ be arbitrary sets. Problem 1B1 ( ) Show A B λ = (A B λ ). λ Λ λ Λ Proof. ( ) x A B λ λ Λ x A
More informationP-adic Functions - Part 1
P-adic Functions - Part 1 Nicolae Ciocan 22.11.2011 1 Locally constant functions Motivation: Another big difference between p-adic analysis and real analysis is the existence of nontrivial locally constant
More informationASYMPTOTICALLY NONEXPANSIVE MAPPINGS IN MODULAR FUNCTION SPACES ABSTRACT
ASYMPTOTICALLY NONEXPANSIVE MAPPINGS IN MODULAR FUNCTION SPACES T. DOMINGUEZ-BENAVIDES, M.A. KHAMSI AND S. SAMADI ABSTRACT In this paper, we prove that if ρ is a convex, σ-finite modular function satisfying
More informationChapter 2: Linear Independence and Bases
MATH20300: Linear Algebra 2 (2016 Chapter 2: Linear Independence and Bases 1 Linear Combinations and Spans Example 11 Consider the vector v (1, 1 R 2 What is the smallest subspace of (the real vector space
More informationMaths 212: Homework Solutions
Maths 212: Homework Solutions 1. The definition of A ensures that x π for all x A, so π is an upper bound of A. To show it is the least upper bound, suppose x < π and consider two cases. If x < 1, then
More informationA VARIATIONAL METHOD FOR THE ANALYSIS OF A MONOTONE SCHEME FOR THE MONGE-AMPÈRE EQUATION 1. INTRODUCTION
A VARIATIONAL METHOD FOR THE ANALYSIS OF A MONOTONE SCHEME FOR THE MONGE-AMPÈRE EQUATION GERARD AWANOU AND LEOPOLD MATAMBA MESSI ABSTRACT. We give a proof of existence of a solution to the discrete problem
More informationLax Solution Part 4. October 27, 2016
Lax Solution Part 4 www.mathtuition88.com October 27, 2016 Textbook: Functional Analysis by Peter D. Lax Exercises: Ch 16: Q2 4. Ch 21: Q1, 2, 9, 10. Ch 28: 1, 5, 9, 10. 1 Chapter 16 Exercise 2 Let h =
More informationA strongly polynomial algorithm for linear systems having a binary solution
A strongly polynomial algorithm for linear systems having a binary solution Sergei Chubanov Institute of Information Systems at the University of Siegen, Germany e-mail: sergei.chubanov@uni-siegen.de 7th
More informationNotes for Functional Analysis
Notes for Functional Analysis Wang Zuoqin (typed by Xiyu Zhai) September 29, 2015 1 Lecture 09 1.1 Equicontinuity First let s recall the conception of equicontinuity for family of functions that we learned
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 informationChapter 8. P-adic numbers. 8.1 Absolute values
Chapter 8 P-adic numbers Literature: N. Koblitz, p-adic Numbers, p-adic Analysis, and Zeta-Functions, 2nd edition, Graduate Texts in Mathematics 58, Springer Verlag 1984, corrected 2nd printing 1996, Chap.
More information1 Lyapunov theory of stability
M.Kawski, APM 581 Diff Equns Intro to Lyapunov theory. November 15, 29 1 1 Lyapunov theory of stability Introduction. Lyapunov s second (or direct) method provides tools for studying (asymptotic) stability
More informationPERTURBATION THEORY FOR NONLINEAR DIRICHLET PROBLEMS
Annales Academiæ Scientiarum Fennicæ Mathematica Volumen 28, 2003, 207 222 PERTURBATION THEORY FOR NONLINEAR DIRICHLET PROBLEMS Fumi-Yuki Maeda and Takayori Ono Hiroshima Institute of Technology, Miyake,
More informationMath The Laplacian. 1 Green s Identities, Fundamental Solution
Math. 209 The Laplacian Green s Identities, Fundamental Solution Let be a bounded open set in R n, n 2, with smooth boundary. The fact that the boundary is smooth means that at each point x the external
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 informationfor all subintervals I J. If the same is true for the dyadic subintervals I D J only, we will write ϕ BMO d (J). In fact, the following is true
3 ohn Nirenberg inequality, Part I A function ϕ L () belongs to the space BMO() if sup ϕ(s) ϕ I I I < for all subintervals I If the same is true for the dyadic subintervals I D only, we will write ϕ BMO
More informationNotes on Distributions
Notes on Distributions Functional Analysis 1 Locally Convex Spaces Definition 1. A vector space (over R or C) is said to be a topological vector space (TVS) if it is a Hausdorff topological space and the
More informationREAL AND COMPLEX ANALYSIS
REAL AND COMPLE ANALYSIS Third Edition Walter Rudin Professor of Mathematics University of Wisconsin, Madison Version 1.1 No rights reserved. Any part of this work can be reproduced or transmitted in any
More informationExtension Properties of Pluricomplex Green Functions
Syracuse University SURFACE Mathematics - Dissertations Mathematics 2013 Extension Properties of Pluricomplex Green Functions Sidika Zeynep Ozal Follow this and additional works at: http://surface.syr.edu/mat_etd
More informationProblem: A class of dynamical systems characterized by a fast divergence of the orbits. A paradigmatic example: the Arnold cat.
À È Ê ÇÄÁ Ë ËÌ ÅË Problem: A class of dynamical systems characterized by a fast divergence of the orbits A paradigmatic example: the Arnold cat. The closure of a homoclinic orbit. The shadowing lemma.
More informationMINIMAL GRAPHS PART I: EXISTENCE OF LIPSCHITZ WEAK SOLUTIONS TO THE DIRICHLET PROBLEM WITH C 2 BOUNDARY DATA
MINIMAL GRAPHS PART I: EXISTENCE OF LIPSCHITZ WEAK SOLUTIONS TO THE DIRICHLET PROBLEM WITH C 2 BOUNDARY DATA SPENCER HUGHES In these notes we prove that for any given smooth function on the boundary of
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 information2. The Concept of Convergence: Ultrafilters and Nets
2. The Concept of Convergence: Ultrafilters and Nets NOTE: AS OF 2008, SOME OF THIS STUFF IS A BIT OUT- DATED AND HAS A FEW TYPOS. I WILL REVISE THIS MATE- RIAL SOMETIME. In this lecture we discuss two
More informationREGULARITY FOR INFINITY HARMONIC FUNCTIONS IN TWO DIMENSIONS
C,α REGULARITY FOR INFINITY HARMONIC FUNCTIONS IN TWO DIMENSIONS LAWRENCE C. EVANS AND OVIDIU SAVIN Abstract. We propose a new method for showing C,α regularity for solutions of the infinity Laplacian
More informationChapter 2. Metric Spaces. 2.1 Metric Spaces
Chapter 2 Metric Spaces ddddddddddddddddddddddddd ddddddd dd ddd A metric space is a mathematical object in which the distance between two points is meaningful. Metric spaces constitute an important class
More information(x k ) sequence in F, lim x k = x x F. If F : R n R is a function, level sets and sublevel sets of F are any sets of the form (respectively);
STABILITY OF EQUILIBRIA AND LIAPUNOV FUNCTIONS. By topological properties in general we mean qualitative geometric properties (of subsets of R n or of functions in R n ), that is, those that don t depend
More informationTopology. Xiaolong Han. Department of Mathematics, California State University, Northridge, CA 91330, USA address:
Topology Xiaolong Han Department of Mathematics, California State University, Northridge, CA 91330, USA E-mail address: Xiaolong.Han@csun.edu Remark. You are entitled to a reward of 1 point toward a homework
More informationOn the Intrinsic Differentiability Theorem of Gromov-Schoen
On the Intrinsic Differentiability Theorem of Gromov-Schoen Georgios Daskalopoulos Brown University daskal@math.brown.edu Chikako Mese 2 Johns Hopkins University cmese@math.jhu.edu Abstract In this note,
More informationLocal strong convexity and local Lipschitz continuity of the gradient of convex functions
Local strong convexity and local Lipschitz continuity of the gradient of convex functions R. Goebel and R.T. Rockafellar May 23, 2007 Abstract. Given a pair of convex conjugate functions f and f, we investigate
More informationObstacle Problems Involving The Fractional Laplacian
Obstacle Problems Involving The Fractional Laplacian Donatella Danielli and Sandro Salsa January 27, 2017 1 Introduction Obstacle problems involving a fractional power of the Laplace operator appear in
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 informationMath 118B Solutions. Charles Martin. March 6, d i (x i, y i ) + d i (y i, z i ) = d(x, y) + d(y, z). i=1
Math 8B Solutions Charles Martin March 6, Homework Problems. Let (X i, d i ), i n, be finitely many metric spaces. Construct a metric on the product space X = X X n. Proof. Denote points in X as x = (x,
More informationSome lecture notes for Math 6050E: PDEs, Fall 2016
Some lecture notes for Math 65E: PDEs, Fall 216 Tianling Jin December 1, 216 1 Variational methods We discuss an example of the use of variational methods in obtaining existence of solutions. Theorem 1.1.
More informationERRATUM TO AFFINE MANIFOLDS, SYZ GEOMETRY AND THE Y VERTEX
ERRATUM TO AFFINE MANIFOLDS, SYZ GEOMETRY AND THE Y VERTEX JOHN LOFTIN, SHING-TUNG YAU, AND ERIC ZASLOW 1. Main result The purpose of this erratum is to correct an error in the proof of the main result
More informationA Sharpened Hausdorff-Young Inequality
A Sharpened Hausdorff-Young Inequality Michael Christ University of California, Berkeley IPAM Workshop Kakeya Problem, Restriction Problem, Sum-Product Theory and perhaps more May 5, 2014 Hausdorff-Young
More information5 Compact linear operators
5 Compact linear operators One of the most important results of Linear Algebra is that for every selfadjoint linear map A on a finite-dimensional space, there exists a basis consisting of eigenvectors.
More informationApplied Analysis (APPM 5440): Final exam 1:30pm 4:00pm, Dec. 14, Closed books.
Applied Analysis APPM 44: Final exam 1:3pm 4:pm, Dec. 14, 29. Closed books. Problem 1: 2p Set I = [, 1]. Prove that there is a continuous function u on I such that 1 ux 1 x sin ut 2 dt = cosx, x I. Define
More information2 Sequences, Continuity, and Limits
2 Sequences, Continuity, and Limits In this chapter, we introduce the fundamental notions of continuity and limit of a real-valued function of two variables. As in ACICARA, the definitions as well as proofs
More informationSpectral theory for compact operators on Banach spaces
68 Chapter 9 Spectral theory for compact operators on Banach spaces Recall that a subset S of a metric space X is precompact if its closure is compact, or equivalently every sequence contains a Cauchy
More information(convex combination!). Use convexity of f and multiply by the common denominator to get. Interchanging the role of x and y, we obtain that f is ( 2M ε
1. Continuity of convex functions in normed spaces In this chapter, we consider continuity properties of real-valued convex functions defined on open convex sets in normed spaces. Recall that every infinitedimensional
More information