Almost monotonicity formulas for elliptic and parabolic operators - - PowerPoint PPT Presentation

almost monotonicity formulas for elliptic and parabolic
SMART_READER_LITE
LIVE PREVIEW

Almost monotonicity formulas for elliptic and parabolic operators - - PowerPoint PPT Presentation

Almost monotonicity formulas for elliptic and parabolic operators with variable coefficients Norayr Matevosyan Arshak Petrosyan Joint Meeting of KMS & AMS Seoul, Korea, December 1620, 2009 Matevosyan, Petrosyan (Cambridge, Purdue)


slide-1
SLIDE 1

Almost monotonicity formulas for elliptic and parabolic

  • perators with variable coefficients

Norayr Matevosyan Arshak Petrosyan

  • Joint Meeting of KMS & AMS

Seoul, Korea, December 16–20, 2009

Matevosyan, Petrosyan (Cambridge, Purdue) Almost monotonicity formulas Joint Meeting of KMS & AMS 1 / 25

slide-2
SLIDE 2

Original Elliptic Monotonicity Formula

Teorem (Alt-Caffarelli-Friedman 1984)

Let u± be two continuous functions in B in n such that u± ≥ , ∆u± ≥ , u+ ⋅ u− =  in B then the functional φ(r) = φ(r, u+, u−) =  r ∫Br ∣∇u+∣ ∣x∣n− dx ∫Br ∣∇u−∣ ∣x∣n− dx is monotone nondecreasing in r ∈ (, ].

u−> ∆u−≥ u+> ∆u+≥

Matevosyan, Petrosyan (Cambridge, Purdue) Almost monotonicity formulas Joint Meeting of KMS & AMS 2 / 25

slide-3
SLIDE 3

Original Elliptic Monotonicity Formula

Teorem (Alt-Caffarelli-Friedman 1984)

Let u± be two continuous functions in B in n such that u± ≥ , ∆u± ≥ , u+ ⋅ u− =  in B then the functional φ(r) = φ(r, u+, u−) =  r ∫Br ∣∇u+∣ ∣x∣n− dx ∫Br ∣∇u−∣ ∣x∣n− dx is monotone nondecreasing in r ∈ (, ].

u−> ∆u−≥ u+> ∆u+≥

Tis formula has been of fundamental importance in the regularity theory of free boundaries, especially in problems with two phases.

Matevosyan, Petrosyan (Cambridge, Purdue) Almost monotonicity formulas Joint Meeting of KMS & AMS 2 / 25

slide-4
SLIDE 4

Original Elliptic Monotonicity Formula

One of the applications of the monotonicity formula is the ability to produce estimates of the type cn∣∇u+()∣∣∇u−()∣ ≤ φ(+) ≤ φ(/) ≤ Cn∥u+∥

L(B)∥u−∥ L(B)

Matevosyan, Petrosyan (Cambridge, Purdue) Almost monotonicity formulas Joint Meeting of KMS & AMS 3 / 25

slide-5
SLIDE 5

Original Elliptic Monotonicity Formula

One of the applications of the monotonicity formula is the ability to produce estimates of the type cn∣∇u+()∣∣∇u−()∣ ≤ φ(+) ≤ φ(/) ≤ Cn∥u+∥

L(B)∥u−∥ L(B)

Te proof is based on the following eigenvalue inequality of Friedland-Hayman 1976.

Matevosyan, Petrosyan (Cambridge, Purdue) Almost monotonicity formulas Joint Meeting of KMS & AMS 3 / 25

slide-6
SLIDE 6

Original Elliptic Monotonicity Formula

One of the applications of the monotonicity formula is the ability to produce estimates of the type cn∣∇u+()∣∣∇u−()∣ ≤ φ(+) ≤ φ(/) ≤ Cn∥u+∥

L(B)∥u−∥ L(B)

Te proof is based on the following eigenvalue inequality of Friedland-Hayman 1976. For Σ ⊂ ∂B define λ(Σ) = inf ∫Σ ∣∇θ f ∣ ∫Σ f  , f ∣∂Σ =  Define also α(Σ) so that λ(Σ) = α(Σ)(n −  + α(Σ)).

Matevosyan, Petrosyan (Cambridge, Purdue) Almost monotonicity formulas Joint Meeting of KMS & AMS 3 / 25

slide-7
SLIDE 7

Original Elliptic Monotonicity Formula

One of the applications of the monotonicity formula is the ability to produce estimates of the type cn∣∇u+()∣∣∇u−()∣ ≤ φ(+) ≤ φ(/) ≤ Cn∥u+∥

L(B)∥u−∥ L(B)

Te proof is based on the following eigenvalue inequality of Friedland-Hayman 1976. For Σ ⊂ ∂B define λ(Σ) = inf ∫Σ ∣∇θ f ∣ ∫Σ f  , f ∣∂Σ =  Define also α(Σ) so that λ(Σ) = α(Σ)(n −  + α(Σ)).

Teorem (Friedland-Hayman 1976)

Let Σ± be disjoint open sets on ∂B. Ten α(Σ+) + α(Σ−) ≥ .

Matevosyan, Petrosyan (Cambridge, Purdue) Almost monotonicity formulas Joint Meeting of KMS & AMS 3 / 25

slide-8
SLIDE 8

Parabolic Monotonicity Formula

Teorem (Caffarelli 1993)

Let u±(x, s) be two continuous functions in S = n × (−, ] u± ≥ , (∆ − ∂s)u± ≥ , u+ ⋅ u− =  in S then Φ(r, u+, u−) =  r ∫

 −r∫n ∣∇u+∣G(x, −s)dxds ∫  −r∫n ∣∇u−∣G(x, −s)dxds

is monotone nondecreasing for r ∈ (, ].

Matevosyan, Petrosyan (Cambridge, Purdue) Almost monotonicity formulas Joint Meeting of KMS & AMS 4 / 25

slide-9
SLIDE 9

Parabolic Monotonicity Formula

Teorem (Caffarelli 1993)

Let u±(x, s) be two continuous functions in S = n × (−, ] u± ≥ , (∆ − ∂s)u± ≥ , u+ ⋅ u− =  in S then Φ(r, u+, u−) =  r ∫

 −r∫n ∣∇u+∣G(x, −s)dxds ∫  −r∫n ∣∇u−∣G(x, −s)dxds

is monotone nondecreasing for r ∈ (, ]. Note that u± must be defined in an entire strip and we must have a moderate growth at infinity.

Matevosyan, Petrosyan (Cambridge, Purdue) Almost monotonicity formulas Joint Meeting of KMS & AMS 4 / 25

slide-10
SLIDE 10

Parabolic Monotonicity Formula

Te proof is now based on the eigenvalue inequality in Gaussian space.

Matevosyan, Petrosyan (Cambridge, Purdue) Almost monotonicity formulas Joint Meeting of KMS & AMS 5 / 25

slide-11
SLIDE 11

Parabolic Monotonicity Formula

Te proof is now based on the eigenvalue inequality in Gaussian space. For Ω ⊂ n define λ(Ω) = inf ∫Ω ∣∇f ∣ dν ∫Ω f  dν , dν = (π)−n/e−x/dx.

Matevosyan, Petrosyan (Cambridge, Purdue) Almost monotonicity formulas Joint Meeting of KMS & AMS 5 / 25

slide-12
SLIDE 12

Parabolic Monotonicity Formula

Te proof is now based on the eigenvalue inequality in Gaussian space. For Ω ⊂ n define λ(Ω) = inf ∫Ω ∣∇f ∣ dν ∫Ω f  dν , dν = (π)−n/e−x/dx.

Teorem (Beckner-Kenig-Pipher)

Let Ω± be two disjoint open sets in n. Ten λ(Ω+) + λ(Ω−) ≥  Te proof is reduced to the convexity result of Brascamp-Lieb 1976 for first eigenvalues of −∆ + V(x) with convex potential V as a function of the domain.

Matevosyan, Petrosyan (Cambridge, Purdue) Almost monotonicity formulas Joint Meeting of KMS & AMS 5 / 25

slide-13
SLIDE 13

Localized Parabolic Formula

Teorem (Caffarelli 1993)

Let u±(x, s) be two continuous functions in Q−

 = B × (−, ] such that

u± ≥ , (∆ − ∂s)u± ≥ , u+ ⋅ u− =  in Q−

 .

Let ψ ∈ C∞

 (B) be a cutoff function such that

 ≤ ψ ≤ , suppψ ⊂ B/, ψ∣B/ =  then Φ(r) = Φ(r, u+ψ, u−ψ) is almost monotone in a sense that Φ(+) − Φ(r) ≤ Ce−c/r∥u+∥

L(Q−

 )∥u−∥

L(Q−

 ). Matevosyan, Petrosyan (Cambridge, Purdue) Almost monotonicity formulas Joint Meeting of KMS & AMS 6 / 25

slide-14
SLIDE 14

Generalization: Caffarelli-Kenig Estimate

Instead of the heat operator ∆ − ∂s consider now uniformly parabolic

u = ,b,cu ∶= div((x, s)∇u) + b(x, s) ⋅ ∇u + c(x, s)u − ∂su

Matevosyan, Petrosyan (Cambridge, Purdue) Almost monotonicity formulas Joint Meeting of KMS & AMS 7 / 25

slide-15
SLIDE 15

Generalization: Caffarelli-Kenig Estimate

Instead of the heat operator ∆ − ∂s consider now uniformly parabolic

u = ,b,cu ∶= div((x, s)∇u) + b(x, s) ⋅ ∇u + c(x, s)u − ∂su

Assume to be Dini continuous, b, c uniformly bounded

Matevosyan, Petrosyan (Cambridge, Purdue) Almost monotonicity formulas Joint Meeting of KMS & AMS 7 / 25

slide-16
SLIDE 16

Generalization: Caffarelli-Kenig Estimate

Instead of the heat operator ∆ − ∂s consider now uniformly parabolic

u = ,b,cu ∶= div((x, s)∇u) + b(x, s) ⋅ ∇u + c(x, s)u − ∂su

Assume to be Dini continuous, b, c uniformly bounded

Teorem (Caffarelli-Kenig 1998)

Let u±(x, s) be two continuous functions in Q−

 such that

u± ≥ ,

u± ≥ ,

u+ ⋅ u− =  in Q−

 .

Let ψ ∈ C∞

 (B) be a cutoff function as before. Ten Φ(r) = Φ(r, u+ψ, u−ψ) is

almost monotone in a sense that we have an estimate Φ(r) ≤ C (∥u+∥

L(Q−

 ) + ∥u−∥

L(Q−

 ))

, r < r.

Matevosyan, Petrosyan (Cambridge, Purdue) Almost monotonicity formulas Joint Meeting of KMS & AMS 7 / 25

slide-17
SLIDE 17

Generalization: Caffarelli-Jerison-Kenig Estimate

Teorem (Caffarelli-Jerison-Kenig 2002)

Let u± be two continuous functions in B in n such that u± ≥ , ∆u± ≥ −, u+ ⋅ u− =  in B then the functional φ(r) = φ(r, u+, u−) satisfies φ(r) ≤ C ( + ∥u+∥

L(B) + ∥u−∥ L(B)) 

, r < r.

Matevosyan, Petrosyan (Cambridge, Purdue) Almost monotonicity formulas Joint Meeting of KMS & AMS 8 / 25

slide-18
SLIDE 18

Generalization: Caffarelli-Jerison-Kenig Estimate

Teorem (Caffarelli-Jerison-Kenig 2002)

Let u± be two continuous functions in B in n such that u± ≥ , ∆u± ≥ −, u+ ⋅ u− =  in B then the functional φ(r) = φ(r, u+, u−) satisfies φ(r) ≤ C ( + ∥u+∥

L(B) + ∥u−∥ L(B)) 

, r < r. Te proof is based on a sophisticated iteration scheme.

Matevosyan, Petrosyan (Cambridge, Purdue) Almost monotonicity formulas Joint Meeting of KMS & AMS 8 / 25

slide-19
SLIDE 19

Generalization: Caffarelli-Jerison-Kenig Estimate

Teorem (Caffarelli-Jerison-Kenig 2002)

Let u± be two continuous functions in B in n such that u± ≥ , ∆u± ≥ −, u+ ⋅ u− =  in B then the functional φ(r) = φ(r, u+, u−) satisfies φ(r) ≤ C ( + ∥u+∥

L(B) + ∥u−∥ L(B)) 

, r < r. Te proof is based on a sophisticated iteration scheme. Te difficulties in CJK and CK estimates are of completely different nature

Matevosyan, Petrosyan (Cambridge, Purdue) Almost monotonicity formulas Joint Meeting of KMS & AMS 8 / 25

slide-20
SLIDE 20

Generalization: Caffarelli-Jerison-Kenig Estimate

Teorem (Caffarelli-Jerison-Kenig 2002)

Let u± be two continuous functions in B in n such that u± ≥ , ∆u± ≥ −, u+ ⋅ u− =  in B then the functional φ(r) = φ(r, u+, u−) satisfies φ(r) ≤ C ( + ∥u+∥

L(B) + ∥u−∥ L(B)) 

, r < r. Te proof is based on a sophisticated iteration scheme. Te difficulties in CJK and CK estimates are of completely different nature Te proof can be easily generalized to parabolic case (Edquist- 2008).

Matevosyan, Petrosyan (Cambridge, Purdue) Almost monotonicity formulas Joint Meeting of KMS & AMS 8 / 25

slide-21
SLIDE 21

Almost Monotonicity Formulas

In CJK and CK estimates there is essentially no monotonicity lef

Matevosyan, Petrosyan (Cambridge, Purdue) Almost monotonicity formulas Joint Meeting of KMS & AMS 9 / 25

slide-22
SLIDE 22

Almost Monotonicity Formulas

In CJK and CK estimates there is essentially no monotonicity lef However, we still have an estimate of the type φ(+) ≤ C (∥u+∥L(B), ∥u−∥L(B)) which is able to produce an estimate ∣∇u+()∣∣∇u−()∣ ≤ C (∥u+∥L(B), ∥u−∥L(B)) . Tis is crucial in proving the optimal regularity in certain two-phase problems (and not only!)

Matevosyan, Petrosyan (Cambridge, Purdue) Almost monotonicity formulas Joint Meeting of KMS & AMS 9 / 25

slide-23
SLIDE 23

Almost Monotonicity Formulas

In CJK and CK estimates there is essentially no monotonicity lef However, we still have an estimate of the type φ(+) ≤ C (∥u+∥L(B), ∥u−∥L(B)) which is able to produce an estimate ∣∇u+()∣∣∇u−()∣ ≤ C (∥u+∥L(B), ∥u−∥L(B)) . Tis is crucial in proving the optimal regularity in certain two-phase problems (and not only!) Under certain growth assumptions on u, such as ∣u(x)∣ ≤ C∣x∣є one can show the existence of φ(+). Tis is important in classification of blowup solutions.

Matevosyan, Petrosyan (Cambridge, Purdue) Almost monotonicity formulas Joint Meeting of KMS & AMS 9 / 25

slide-24
SLIDE 24

CJK+CK

Natural question to ask whether there is a combination of CJK and CK estimates.

Matevosyan, Petrosyan (Cambridge, Purdue) Almost monotonicity formulas Joint Meeting of KMS & AMS 10 / 25

slide-25
SLIDE 25

CJK+CK

Natural question to ask whether there is a combination of CJK and CK estimates. Namely, do we have an almost monotonicity estimate for u± satisfying u± ≥ ,

,b,cu± ≥ −,

u+ ⋅ u− =  in Q−

 .

Matevosyan, Petrosyan (Cambridge, Purdue) Almost monotonicity formulas Joint Meeting of KMS & AMS 10 / 25

slide-26
SLIDE 26

CJK+CK

Natural question to ask whether there is a combination of CJK and CK estimates. Namely, do we have an almost monotonicity estimate for u± satisfying u± ≥ ,

,b,cu± ≥ −,

u+ ⋅ u− =  in Q−

 .

We will see that the answer is positive when is double Dini and b, c are uniformly bounded.

Matevosyan, Petrosyan (Cambridge, Purdue) Almost monotonicity formulas Joint Meeting of KMS & AMS 10 / 25

slide-27
SLIDE 27

Main Results: Assumptions

We consider the uniformly parabolic operator

,b,cu ∶= div((x, s)∇u) + b(x, s) ⋅ ∇u + c(x, s)u − ∂su

such that

Matevosyan, Petrosyan (Cambridge, Purdue) Almost monotonicity formulas Joint Meeting of KMS & AMS 11 / 25

slide-28
SLIDE 28

Main Results: Assumptions

We consider the uniformly parabolic operator

,b,cu ∶= div((x, s)∇u) + b(x, s) ⋅ ∇u + c(x, s)u − ∂su

such that

1

λ∣ξ∣ ≤ (x, s)ξ ⋅ ξ ≤ 

λ∣ξ∣

Matevosyan, Petrosyan (Cambridge, Purdue) Almost monotonicity formulas Joint Meeting of KMS & AMS 11 / 25

slide-29
SLIDE 29

Main Results: Assumptions

We consider the uniformly parabolic operator

,b,cu ∶= div((x, s)∇u) + b(x, s) ⋅ ∇u + c(x, s)u − ∂su

such that

1

λ∣ξ∣ ≤ (x, s)ξ ⋅ ξ ≤ 

λ∣ξ∣

2

∥(x, s) − (, )∥ ≤ ω ((∣x∣ + s)/) with double Dini ω: ∫

 

 r ∫

r 

ω(ρ) ρ dρdr = ∫

 

ω(ρ)log 

ρ

ρ dρ < ∞

Matevosyan, Petrosyan (Cambridge, Purdue) Almost monotonicity formulas Joint Meeting of KMS & AMS 11 / 25

slide-30
SLIDE 30

Main Results: Assumptions

We consider the uniformly parabolic operator

,b,cu ∶= div((x, s)∇u) + b(x, s) ⋅ ∇u + c(x, s)u − ∂su

such that

1

λ∣ξ∣ ≤ (x, s)ξ ⋅ ξ ≤ 

λ∣ξ∣

2

∥(x, s) − (, )∥ ≤ ω ((∣x∣ + s)/) with double Dini ω: ∫

 

 r ∫

r 

ω(ρ) ρ dρdr = ∫

 

ω(ρ)log 

ρ

ρ dρ < ∞

3

∣b(x, s)∣ + ∣c(x, s)∣ ≤ µ

Matevosyan, Petrosyan (Cambridge, Purdue) Almost monotonicity formulas Joint Meeting of KMS & AMS 11 / 25

slide-31
SLIDE 31

Main Results: Assumptions

We consider the uniformly parabolic operator

,b,cu ∶= div((x, s)∇u) + b(x, s) ⋅ ∇u + c(x, s)u − ∂su

such that

1

λ∣ξ∣ ≤ (x, s)ξ ⋅ ξ ≤ 

λ∣ξ∣

2

∥(x, s) − (, )∥ ≤ ω ((∣x∣ + s)/) with double Dini ω: ∫

 

 r ∫

r 

ω(ρ) ρ dρdr = ∫

 

ω(ρ)log 

ρ

ρ dρ < ∞

3

∣b(x, s)∣ + ∣c(x, s)∣ ≤ µ

We make similar assumption on the uniformly elliptic operator ℓ,b,cu ∶= div((x)∇u) + b(x) ⋅ ∇u + c(x)u

Matevosyan, Petrosyan (Cambridge, Purdue) Almost monotonicity formulas Joint Meeting of KMS & AMS 11 / 25

slide-32
SLIDE 32

Global Parabolic Formula

Teorem (Matevosyan- 2009)

Let u±(x, s) be two continuous functions in S such that u± ≥ ,

,b,cu± ≥ −,

u+ ⋅ u− =  in S Assume also that u± have moderate growth at infinity, so that M

± ∶= ∬S

u±(x, s)e−x/dxds < ∞. Ten the functional Φ(r) = Φ(r, u+, u−) satisfies Φ(r) ≤ Cω( + M

+ + M −),

for  < r ≤ rω.

Matevosyan, Petrosyan (Cambridge, Purdue) Almost monotonicity formulas Joint Meeting of KMS & AMS 12 / 25

slide-33
SLIDE 33

Localized Parabolic Formula

Teorem (Matevosyan- 2009)

Let u±(x, s) be two continuous functions in Q−

 such that

u± ≥ ,

,b,cu± ≥ −,

u+ ⋅ u− =  in Q−

Let also ψ be a cutoff function such that  ≤ ψ ≤ , suppψ ⊂ B/, ψ∣B/ = . Ten the functional Φ(r) = Φ(r, u+ψ, u−ψ) satisfies Φ(r) ≤ Cω,ψ ( + ∥u+∥

L(Q−

 ) + ∥u−∥

L(Q−

 ))

, for  < r ≤ rω.

Matevosyan, Petrosyan (Cambridge, Purdue) Almost monotonicity formulas Joint Meeting of KMS & AMS 13 / 25

slide-34
SLIDE 34

Elliptic Formula

Teorem (Matevosyan- 2009)

Let u±(x) be two continuous functions in B such that u± ≥ , ℓ,b,cu± ≥ −, u+ ⋅ u− =  in B. Ten the functional φ(r) = φ(r, u+, u−) satisfies φ(r) ≤ Cω ( + ∥u+∥

L(B) + ∥u−∥ L(B)) 

, for  < r ≤ rω.

Matevosyan, Petrosyan (Cambridge, Purdue) Almost monotonicity formulas Joint Meeting of KMS & AMS 14 / 25

slide-35
SLIDE 35

Proof: CJK Iteration Scheme for = ∆ − ∂s

Let A±(r) = ∬Sr ∣∇u∣G(x, −s)dxds, Sr = n × (−r, ]

Matevosyan, Petrosyan (Cambridge, Purdue) Almost monotonicity formulas Joint Meeting of KMS & AMS 15 / 25

slide-36
SLIDE 36

Proof: CJK Iteration Scheme for = ∆ − ∂s

Let A±(r) = ∬Sr ∣∇u∣G(x, −s)dxds, Sr = n × (−r, ] Define A±

k = A±(−k), b± k = kA±

  • k. Ten Φ(−k) = kA+

kA− k.

Matevosyan, Petrosyan (Cambridge, Purdue) Almost monotonicity formulas Joint Meeting of KMS & AMS 15 / 25

slide-37
SLIDE 37

Proof: CJK Iteration Scheme for = ∆ − ∂s

Let A±(r) = ∬Sr ∣∇u∣G(x, −s)dxds, Sr = n × (−r, ] Define A±

k = A±(−k), b± k = kA±

  • k. Ten Φ(−k) = kA+

kA− k.

Proposition

Tere exists C such that if b±

k ≥ C then

A+

k+A− k+ ≤ A+ kA− k( + δk)

with δk = C √ b+

k

+ C √ b−

k

.

Matevosyan, Petrosyan (Cambridge, Purdue) Almost monotonicity formulas Joint Meeting of KMS & AMS 15 / 25

slide-38
SLIDE 38

Proof: CJK Iteration Scheme for = ∆ − ∂s

Let A±(r) = ∬Sr ∣∇u∣G(x, −s)dxds, Sr = n × (−r, ] Define A±

k = A±(−k), b± k = kA±

  • k. Ten Φ(−k) = kA+

kA− k.

Proposition

Tere exists C such that if b±

k ≥ C then

A+

k+A− k+ ≤ A+ kA− k( + δk)

with δk = C √ b+

k

+ C √ b−

k

.

Proposition

Tere exists C such that if b±

k ≥ C and A+ k+ ≥ A+ k then

A−

k+ ≤ ( − є)A− k.

Matevosyan, Petrosyan (Cambridge, Purdue) Almost monotonicity formulas Joint Meeting of KMS & AMS 15 / 25

slide-39
SLIDE 39

Proof: CJK Iteration Scheme for ,b,c

Define θ(r) = Cr + ω(r/) + (∫

r 

ω(ρ/) ρ dρ)

/

Matevosyan, Petrosyan (Cambridge, Purdue) Almost monotonicity formulas Joint Meeting of KMS & AMS 16 / 25

slide-40
SLIDE 40

Proof: CJK Iteration Scheme for ,b,c

Define θ(r) = Cr + ω(r/) + (∫

r 

ω(ρ/) ρ dρ)

/

(r) = ∫

r 

θ(ρ) ρ dρ

Matevosyan, Petrosyan (Cambridge, Purdue) Almost monotonicity formulas Joint Meeting of KMS & AMS 16 / 25

slide-41
SLIDE 41

Proof: CJK Iteration Scheme for ,b,c

Define θ(r) = Cr + ω(r/) + (∫

r 

ω(ρ/) ρ dρ)

/

(r) = ∫

r 

θ(ρ) ρ dρ ̃ A±(r) = ec(r)A±(r), ̃ Φ(r) = r− ̃ A+(r) ̃ A−(r)

Matevosyan, Petrosyan (Cambridge, Purdue) Almost monotonicity formulas Joint Meeting of KMS & AMS 16 / 25

slide-42
SLIDE 42

Proof: CJK Iteration Scheme for ,b,c

Define θ(r) = Cr + ω(r/) + (∫

r 

ω(ρ/) ρ dρ)

/

(r) = ∫

r 

θ(ρ) ρ dρ ̃ A±(r) = ec(r)A±(r), ̃ Φ(r) = r− ̃ A+(r) ̃ A−(r) ̃ A±

k = ̃

A±(−k), ̃ b± = k ̃ A±

k.

Matevosyan, Petrosyan (Cambridge, Purdue) Almost monotonicity formulas Joint Meeting of KMS & AMS 16 / 25

slide-43
SLIDE 43

Proof: CJK Iteration Scheme for ,b,c

Define θ(r) = Cr + ω(r/) + (∫

r 

ω(ρ/) ρ dρ)

/

(r) = ∫

r 

θ(ρ) ρ dρ ̃ A±(r) = ec(r)A±(r), ̃ Φ(r) = r− ̃ A+(r) ̃ A−(r) ̃ A±

k = ̃

A±(−k), ̃ b± = k ̃ A±

k.

Proposition

̃ A±

k satisfy the same iterative inequalities as A± k in the case of = ∆ − ∂s.

Matevosyan, Petrosyan (Cambridge, Purdue) Almost monotonicity formulas Joint Meeting of KMS & AMS 16 / 25

slide-44
SLIDE 44

Proof: Key Technical Estimate

Normalize (, ) = I, c = .

Matevosyan, Petrosyan (Cambridge, Purdue) Almost monotonicity formulas Joint Meeting of KMS & AMS 17 / 25

slide-45
SLIDE 45

Proof: Key Technical Estimate

Normalize (, ) = I, c = .

Proposition

Let u ≥  satisfy ,b,u ≥ − in S. Suppose also ∬S u(x, s)e−x/dxds ≤ . Ten ( − cn θ(r))∬Sr ∣∇u∣G(x, −s)dxds ≤ Cr + Cnr (∫n u(x, −r)G(x, r)dx)

/

+   ∫n u(x, −r)G(x, r)dx for any  < r ≤ rω, where θ(r) = Cr + ω(r/) + (∫

r 

ω(ρ/) ρ dρ)

/

.

Matevosyan, Petrosyan (Cambridge, Purdue) Almost monotonicity formulas Joint Meeting of KMS & AMS 17 / 25

slide-46
SLIDE 46

Proof: Parabolic ⇒ Elliptic

Add a “dummy” variable s ̃ u±(x, s) = u±(x), (x, s) ∈ Q−

Matevosyan, Petrosyan (Cambridge, Purdue) Almost monotonicity formulas Joint Meeting of KMS & AMS 18 / 25

slide-47
SLIDE 47

Proof: Parabolic ⇒ Elliptic

Add a “dummy” variable s ̃ u±(x, s) = u±(x), (x, s) ∈ Q−

̃ u± satisfy now conditions of localized parabolic case with

u = (ℓ − ∂s)u = div((x)∇u) + b(x)∇u + c(x)u − ∂su.

Matevosyan, Petrosyan (Cambridge, Purdue) Almost monotonicity formulas Joint Meeting of KMS & AMS 18 / 25

slide-48
SLIDE 48

Proof: Parabolic ⇒ Elliptic

Add a “dummy” variable s ̃ u±(x, s) = u±(x), (x, s) ∈ Q−

̃ u± satisfy now conditions of localized parabolic case with

u = (ℓ − ∂s)u = div((x)∇u) + b(x)∇u + c(x)u − ∂su.

Fix a cutoff function ψ ≥  such that ψ =  on B/. Note that ∫Br ∣∇u(x)∣ ∣x∣n− dx ≤ Cn ∬Sr ∣∇(ψ(x)u(x))∣G(x, −s)dxds.

Matevosyan, Petrosyan (Cambridge, Purdue) Almost monotonicity formulas Joint Meeting of KMS & AMS 18 / 25

slide-49
SLIDE 49

Proof: Parabolic ⇒ Elliptic

Add a “dummy” variable s ̃ u±(x, s) = u±(x), (x, s) ∈ Q−

̃ u± satisfy now conditions of localized parabolic case with

u = (ℓ − ∂s)u = div((x)∇u) + b(x)∇u + c(x)u − ∂su.

Fix a cutoff function ψ ≥  such that ψ =  on B/. Note that ∫Br ∣∇u(x)∣ ∣x∣n− dx ≤ Cn ∬Sr ∣∇(ψ(x)u(x))∣G(x, −s)dxds. Hence φ(r, u+, u−) ≤ CnΦ(r, ψ ˜ u+, ψ ˜ u−) ≤ Cω ( + ∥̃ u+∥

L(Q−

 ) + ∥̃

u−∥

L(Q−

 ))

= Cω ( + ∥u+∥

L(B) + ∥ u−∥ L(B)) 

for r < rω.

Matevosyan, Petrosyan (Cambridge, Purdue) Almost monotonicity formulas Joint Meeting of KMS & AMS 18 / 25

slide-50
SLIDE 50

Application: Quasilinear Obstacle-Type Problem

Let u be a solution of the system in B div(a(∣∇u∣)∇u) = f (x, u, ∇u)χΩ, ∣∇u∣ = 

  • n Ωc,

where Ω is an apriori unknown open set.

c c

Matevosyan, Petrosyan (Cambridge, Purdue) Almost monotonicity formulas Joint Meeting of KMS & AMS 19 / 25

slide-51
SLIDE 51

Application: Quasilinear Obstacle-Type Problem

Let u be a solution of the system in B div(a(∣∇u∣)∇u) = f (x, u, ∇u)χΩ, ∣∇u∣ = 

  • n Ωc,

where Ω is an apriori unknown open set. Problem appears in the description of type II superconductors (Berestycki-Bonnet-Chapman 1994)

c c

Matevosyan, Petrosyan (Cambridge, Purdue) Almost monotonicity formulas Joint Meeting of KMS & AMS 19 / 25

slide-52
SLIDE 52

Application: Quasilinear Obstacle-Type Problem

Let u be a solution of the system in B div(a(∣∇u∣)∇u) = f (x, u, ∇u)χΩ, ∣∇u∣ = 

  • n Ωc,

where Ω is an apriori unknown open set. Problem appears in the description of type II superconductors (Berestycki-Bonnet-Chapman 1994) One-phase problem, however, no assumption is made on the sign of u in Ω

c c

Matevosyan, Petrosyan (Cambridge, Purdue) Almost monotonicity formulas Joint Meeting of KMS & AMS 19 / 25

slide-53
SLIDE 53

Application: Quasilinear Obstacle-Type Problem

Let u be a solution of the system in B div(a(∣∇u∣)∇u) = f (x, u, ∇u)χΩ, ∣∇u∣ = 

  • n Ωc,

where Ω is an apriori unknown open set. Problem appears in the description of type II superconductors (Berestycki-Bonnet-Chapman 1994) One-phase problem, however, no assumption is made on the sign of u in Ω Λ = Ωc may break out into different patches Λi so that u = ci on Λi

c c

Matevosyan, Petrosyan (Cambridge, Purdue) Almost monotonicity formulas Joint Meeting of KMS & AMS 19 / 25

slide-54
SLIDE 54

Application: Quasilinear Obstacle-Type Problem

Let u be a solution of the system in B div(a(∣∇u∣)∇u) = f (x, u, ∇u)χΩ, ∣∇u∣ = 

  • n Ωc,

where Ω is an apriori unknown open set. Problem appears in the description of type II superconductors (Berestycki-Bonnet-Chapman 1994) One-phase problem, however, no assumption is made on the sign of u in Ω Λ = Ωc may break out into different patches Λi so that u = ci on Λi

c c

Similar problem has been studied by Caffarelli-Salazar-Shahgholian 2004

Matevosyan, Petrosyan (Cambridge, Purdue) Almost monotonicity formulas Joint Meeting of KMS & AMS 19 / 25

slide-55
SLIDE 55

Application: Quasilinear Obstacle-Type Problem

Assumptions

1

a ∈ C,α

loc([, ∞))

Matevosyan, Petrosyan (Cambridge, Purdue) Almost monotonicity formulas Joint Meeting of KMS & AMS 20 / 25

slide-56
SLIDE 56

Application: Quasilinear Obstacle-Type Problem

Assumptions

1

a ∈ C,α

loc([, ∞))

2

a(q), a(q) + a′(q)q ∈ [λ, /λ] for any q ≥ 

Matevosyan, Petrosyan (Cambridge, Purdue) Almost monotonicity formulas Joint Meeting of KMS & AMS 20 / 25

slide-57
SLIDE 57

Application: Quasilinear Obstacle-Type Problem

Assumptions

1

a ∈ C,α

loc([, ∞))

2

a(q), a(q) + a′(q)q ∈ [λ, /λ] for any q ≥ 

3

∣f ∣ + ∣∇x f ∣ + ∣∂z f ∣ + ∣∇p f ∣ ≤ M for (x, z, p) ∈ D × × n.

Matevosyan, Petrosyan (Cambridge, Purdue) Almost monotonicity formulas Joint Meeting of KMS & AMS 20 / 25

slide-58
SLIDE 58

Application: Quasilinear Obstacle-Type Problem

Assumptions

1

a ∈ C,α

loc([, ∞))

2

a(q), a(q) + a′(q)q ∈ [λ, /λ] for any q ≥ 

3

∣f ∣ + ∣∇x f ∣ + ∣∂z f ∣ + ∣∇p f ∣ ≤ M for (x, z, p) ∈ D × × n.

Teorem (Matevosyan- 2009)

Under conditions above, u ∈ C,

loc(B) and

∥u∥C,(B/) ≤ C (Ca, α, n, λ, M, ∥u∥L∞(B)) with Ca = ∥a∥C,α([,R(n,λ,M,∥u∥L∞(B))]).

Matevosyan, Petrosyan (Cambridge, Purdue) Almost monotonicity formulas Joint Meeting of KMS & AMS 20 / 25

slide-59
SLIDE 59

Application: Quasilinear Obstacle-Type Problem

Assumptions

1

a ∈ C,α

loc([, ∞))

2

a(q), a(q) + a′(q)q ∈ [λ, /λ] for any q ≥ 

3

∣f ∣ + ∣∇x f ∣ + ∣∂z f ∣ + ∣∇p f ∣ ≤ M for (x, z, p) ∈ D × × n.

Teorem (Matevosyan- 2009)

Under conditions above, u ∈ C,

loc(B) and

∥u∥C,(B/) ≤ C (Ca, α, n, λ, M, ∥u∥L∞(B)) with Ca = ∥a∥C,α([,R(n,λ,M,∥u∥L∞(B))]). Generalizes a theorem of Shahgholian 2003 for ∆u = f (x, u)χΩ, ∣∇u∣ =  on Ωc.

Matevosyan, Petrosyan (Cambridge, Purdue) Almost monotonicity formulas Joint Meeting of KMS & AMS 20 / 25

slide-60
SLIDE 60

Application: Quasilinear Obstacle-Type Problem

Connection with the almost monotonicity formulas:

Matevosyan, Petrosyan (Cambridge, Purdue) Almost monotonicity formulas Joint Meeting of KMS & AMS 21 / 25

slide-61
SLIDE 61

Application: Quasilinear Obstacle-Type Problem

Connection with the almost monotonicity formulas:

Lemma

For any direction e the functions w± = (∂eu)± = max{±∂eu, } satisfy w± ≥ , div((x)∇w±) + b(x)∇w± + c(x)w± ≥ −M, w+ ⋅ w− = , where

(x) = a(∣∇u(x)∣)I + a′(∣∇u(x)∣)∇u(x) ⊗ ∇u(x),

b(x) = −(∇p f )(x, u(x), ∇u(x)), c(x) = −(∂z f )(x, u(x), ∇u(x)).

Matevosyan, Petrosyan (Cambridge, Purdue) Almost monotonicity formulas Joint Meeting of KMS & AMS 21 / 25

slide-62
SLIDE 62

Application: Quasilinear Obstacle-Type Problem

Idea of the proof (Shahgholian 2003) u ∈ W,p, p > n, hence twice differentiable a.e.

Matevosyan, Petrosyan (Cambridge, Purdue) Almost monotonicity formulas Joint Meeting of KMS & AMS 22 / 25

slide-63
SLIDE 63

Application: Quasilinear Obstacle-Type Problem

Idea of the proof (Shahgholian 2003) u ∈ W,p, p > n, hence twice differentiable a.e. take e ⊥ ∇u(x) and apply almost monotonicity formula to w± = (∂eu)±: ∣∇w(x)∣ ≤ Cnφ(+, w+, w−) ≤ ( + ∥w∥

L(B/)) 

,

Matevosyan, Petrosyan (Cambridge, Purdue) Almost monotonicity formulas Joint Meeting of KMS & AMS 22 / 25

slide-64
SLIDE 64

Application: Quasilinear Obstacle-Type Problem

Idea of the proof (Shahgholian 2003) u ∈ W,p, p > n, hence twice differentiable a.e. take e ⊥ ∇u(x) and apply almost monotonicity formula to w± = (∂eu)±: ∣∇w(x)∣ ≤ Cnφ(+, w+, w−) ≤ ( + ∥w∥

L(B/)) 

, this implies that ∣∂eeu(x)∣ ≤ C, for e ⊥ ∇u(x)

Matevosyan, Petrosyan (Cambridge, Purdue) Almost monotonicity formulas Joint Meeting of KMS & AMS 22 / 25

slide-65
SLIDE 65

Application: Quasilinear Obstacle-Type Problem

Idea of the proof (Shahgholian 2003) u ∈ W,p, p > n, hence twice differentiable a.e. take e ⊥ ∇u(x) and apply almost monotonicity formula to w± = (∂eu)±: ∣∇w(x)∣ ≤ Cnφ(+, w+, w−) ≤ ( + ∥w∥

L(B/)) 

, this implies that ∣∂eeu(x)∣ ≤ C, for e ⊥ ∇u(x) to obtain the estimate in the missing direction e ∥ ∇u(x), we use the equation.

Matevosyan, Petrosyan (Cambridge, Purdue) Almost monotonicity formulas Joint Meeting of KMS & AMS 22 / 25

slide-66
SLIDE 66

A Variant of the Almost Monotonicity Formula

Teorem (Matevosyan- 2009)

Let u± satisfy u± ≥ , ,b,cu± ≥ −, u+ ⋅ u− =  in S, and u±(x, s) ≤ σ((∣x∣ + ∣s∣)/) for (x, s) ∈ Q−

for a Dini modulus of continuity σ(r). Ten Φ(r) = Φ(r, u+ψ, u−ψ) satisfies Φ(r) ≤ [ + α(ρ)]Φ(ρ) + CM,ψ,σ,ωα(ρ),  < r ≤ ρ ≤ rω, where α(r) = C [r + σ(r/) + ∫

r  σ(ρ/) ρ

dρ + ∫

r  θ(ρ) ρ dρ] and

M = ∥u+∥L(Q−

 ) + ∥u−∥L(Q−  ). Matevosyan, Petrosyan (Cambridge, Purdue) Almost monotonicity formulas Joint Meeting of KMS & AMS 23 / 25

slide-67
SLIDE 67

A Variant of the Almost Monotonicity Formula

Teorem (Matevosyan- 2009)

Let u± satisfy u± ≥ , ,b,cu± ≥ −, u+ ⋅ u− =  in S, and u±(x, s) ≤ σ((∣x∣ + ∣s∣)/) for (x, s) ∈ Q−

for a Dini modulus of continuity σ(r). Ten Φ(r) = Φ(r, u+ψ, u−ψ) satisfies Φ(r) ≤ [ + α(ρ)]Φ(ρ) + CM,ψ,σ,ωα(ρ),  < r ≤ ρ ≤ rω, where α(r) = C [r + σ(r/) + ∫

r  σ(ρ/) ρ

dρ + ∫

r  θ(ρ) ρ dρ] and

M = ∥u+∥L(Q−

 ) + ∥u−∥L(Q−  ).

Tis guaranties the existence of Φ(+) = limr→+ Φ(r).

Matevosyan, Petrosyan (Cambridge, Purdue) Almost monotonicity formulas Joint Meeting of KMS & AMS 23 / 25

slide-68
SLIDE 68

Application: Classification of Blowups

Let u solve div(a(∣∇u∣)∇u) = f (x, u, ∇u)χΩ, ∣∇u∣ =  on Ωc.

Matevosyan, Petrosyan (Cambridge, Purdue) Almost monotonicity formulas Joint Meeting of KMS & AMS 24 / 25

slide-69
SLIDE 69

Application: Classification of Blowups

Let u solve div(a(∣∇u∣)∇u) = f (x, u, ∇u)χΩ, ∣∇u∣ =  on Ωc. For x ∈ ∂Ω (free boundary) consider rescalings ur(x) = ux,r(x) = u(x + rx) − u(x) r .

Matevosyan, Petrosyan (Cambridge, Purdue) Almost monotonicity formulas Joint Meeting of KMS & AMS 24 / 25

slide-70
SLIDE 70

Application: Classification of Blowups

Let u solve div(a(∣∇u∣)∇u) = f (x, u, ∇u)χΩ, ∣∇u∣ =  on Ωc. For x ∈ ∂Ω (free boundary) consider rescalings ur(x) = ux,r(x) = u(x + rx) − u(x) r . Limits of ur over r = rj → + are called blowups of u at x

Matevosyan, Petrosyan (Cambridge, Purdue) Almost monotonicity formulas Joint Meeting of KMS & AMS 24 / 25

slide-71
SLIDE 71

Application: Classification of Blowups

Let u solve div(a(∣∇u∣)∇u) = f (x, u, ∇u)χΩ, ∣∇u∣ =  on Ωc. For x ∈ ∂Ω (free boundary) consider rescalings ur(x) = ux,r(x) = u(x + rx) − u(x) r . Limits of ur over r = rj → + are called blowups of u at x Key question: what are the possible blowups?

Matevosyan, Petrosyan (Cambridge, Purdue) Almost monotonicity formulas Joint Meeting of KMS & AMS 24 / 25

slide-72
SLIDE 72

Application: Classification of Blowups

Let u solve div(a(∣∇u∣)∇u) = f (x, u, ∇u)χΩ, ∣∇u∣ =  on Ωc. For x ∈ ∂Ω (free boundary) consider rescalings ur(x) = ux,r(x) = u(x + rx) − u(x) r . Limits of ur over r = rj → + are called blowups of u at x Key question: what are the possible blowups?

Teorem (Matevosyan- 2009)

Te blowups are either one-dimensional or quadratic polynomial.

Matevosyan, Petrosyan (Cambridge, Purdue) Almost monotonicity formulas Joint Meeting of KMS & AMS 24 / 25

slide-73
SLIDE 73

Application: Classification of Blowups

Let u solve div(a(∣∇u∣)∇u) = f (x, u, ∇u)χΩ, ∣∇u∣ =  on Ωc. For x ∈ ∂Ω (free boundary) consider rescalings ur(x) = ux,r(x) = u(x + rx) − u(x) r . Limits of ur over r = rj → + are called blowups of u at x Key question: what are the possible blowups?

Teorem (Matevosyan- 2009)

Te blowups are either one-dimensional or quadratic polynomial. One dimensional means u(x) = υ(x ⋅ e) for some direction e

Matevosyan, Petrosyan (Cambridge, Purdue) Almost monotonicity formulas Joint Meeting of KMS & AMS 24 / 25

slide-74
SLIDE 74

Application: Classification of Blowups

Let u solve div(a(∣∇u∣)∇u) = f (x, u, ∇u)χΩ, ∣∇u∣ =  on Ωc. For x ∈ ∂Ω (free boundary) consider rescalings ur(x) = ux,r(x) = u(x + rx) − u(x) r . Limits of ur over r = rj → + are called blowups of u at x Key question: what are the possible blowups?

Teorem (Matevosyan- 2009)

Te blowups are either one-dimensional or quadratic polynomial. One dimensional means u(x) = υ(x ⋅ e) for some direction e Equivalently, ∂eu has a sign in n for any direction e.

Matevosyan, Petrosyan (Cambridge, Purdue) Almost monotonicity formulas Joint Meeting of KMS & AMS 24 / 25

slide-75
SLIDE 75

Application: Classification of Blowups

Idea of the proof (assuming x = ) Recall that ,b,c(∂eu)± ≥ −M for any direction e

Matevosyan, Petrosyan (Cambridge, Purdue) Almost monotonicity formulas Joint Meeting of KMS & AMS 25 / 25

slide-76
SLIDE 76

Application: Classification of Blowups

Idea of the proof (assuming x = ) Recall that ,b,c(∂eu)± ≥ −M for any direction e We also have that ∣(∂eu)±(x)∣ ≤ C∣x∣α

Matevosyan, Petrosyan (Cambridge, Purdue) Almost monotonicity formulas Joint Meeting of KMS & AMS 25 / 25

slide-77
SLIDE 77

Application: Classification of Blowups

Idea of the proof (assuming x = ) Recall that ,b,c(∂eu)± ≥ −M for any direction e We also have that ∣(∂eu)±(x)∣ ≤ C∣x∣α Tus, φ(+, (∂eu)+, (∂eu)−) = c exists.

Matevosyan, Petrosyan (Cambridge, Purdue) Almost monotonicity formulas Joint Meeting of KMS & AMS 25 / 25

slide-78
SLIDE 78

Application: Classification of Blowups

Idea of the proof (assuming x = ) Recall that ,b,c(∂eu)± ≥ −M for any direction e We also have that ∣(∂eu)±(x)∣ ≤ C∣x∣α Tus, φ(+, (∂eu)+, (∂eu)−) = c exists. If ur j → u in W,p, then we have φ(r, (∂eu)+, (∂eu)−) = lim

j→∞ φ(r, (∂eur j)+, (∂eur j)−)

= lim

j→∞ φ(rrj, (∂eu)+, (∂eu)−)

= c i.e. φ(r, (∂eu)+, (∂eu)−) ≡ const

Matevosyan, Petrosyan (Cambridge, Purdue) Almost monotonicity formulas Joint Meeting of KMS & AMS 25 / 25

slide-79
SLIDE 79

Application: Classification of Blowups

Idea of the proof (assuming x = ) Recall that ,b,c(∂eu)± ≥ −M for any direction e We also have that ∣(∂eu)±(x)∣ ≤ C∣x∣α Tus, φ(+, (∂eu)+, (∂eu)−) = c exists. If ur j → u in W,p, then we have φ(r, (∂eu)+, (∂eu)−) = lim

j→∞ φ(r, (∂eur j)+, (∂eur j)−)

= lim

j→∞ φ(rrj, (∂eu)+, (∂eu)−)

= c i.e. φ(r, (∂eu)+, (∂eu)−) ≡ const Problem is reduced to analyzing the case of equality for the original Alt-Caffarelli-Friedman montonicity formula (Caffarelli-Karp-Shahgholian 2000)

Matevosyan, Petrosyan (Cambridge, Purdue) Almost monotonicity formulas Joint Meeting of KMS & AMS 25 / 25