• 沒有找到結果。

Partial data inverse problems and simultaneous recovery of boundary and coefficients for

N/A
N/A
Protected

Academic year: 2022

Share "Partial data inverse problems and simultaneous recovery of boundary and coefficients for"

Copied!
29
0
0

加載中.... (立即查看全文)

全文

(1)

Partial data inverse problems and simultaneous recovery of boundary and coefficients for

semilinear elliptic equations

Matti Lassas, Tony Liimatainen, Yi-Hsuan Lin, and Mikko Salo

Abstract. We study various partial data inverse boundary value problems for the semilinear elliptic equation ∆u + a(x, u) = 0 in a domain in Rn by using the higher order linearization technique introduced in [LLLS19, FO20]. We show that the Dirichlet-to-Neumann map of the above equation determines the Taylor series of a(x, z) at z = 0 under general assumptions on a(x, z). The determination of the Taylor series can be done in parallel with the detection of an unknown cavity inside the domain or an unknown part of the boundary of the domain. The method relies on the solution of the linearized partial data Calder´on problem [FKSU09], and implies the solution of partial data problems for certain semilinear equations ∆u + a(x, u) = 0 also proved in [KU20].

The results that we prove are in contrast to the analogous inverse prob- lems for the linear Schr¨odinger equation. There recovering an unknown cavity (or part of the boundary) and the potential simultaneously are long- standing open problems, and the solution to the Calder´on problem with partial data is known only in special cases when n ≥ 3.

Keywords. Calder´on problem, inverse obstacle problem, Schiffer’s prob- lem, simultaneous recovery, partial data.

Contents

1 Introduction . . . 2

2 Proof of Theorem 1.1 . . . 8

3 Simultaneous recovery of cavity and coefficients . . . 18

4 Simultaneous recovery of boundary and coefficients . . . 21

A . . . 22

Mathematics Subject Classification (2010): . Keywords: .

(2)

1. Introduction

In this paper, we extend the recent studies [LLLS19, FO20] to various partial data inverse problems for the semilinear elliptic equation

∆u + a(x, u) = 0 in Ω ⊂ Rn,

for n ≥ 2. The proofs rely on higher order linearization. This method reduces in- verse problems for semilinear elliptic equations to related problems for the Laplace equation, with artificial source terms produced by the nonlinear interaction, and then employs the exponential solutions introduced in [Cal80] to solve these prob- lems. Hence, one can regard the nonlinearity as a tool to solve inverse problems for elliptic equations with certain nonlinearities.

As a matter of fact, many researchers have studied inverse problems for non- linear elliptic equations. A classical method, introduced in [Isa93] in the parabolic case, is to show that the first linearization of the nonlinear DN map is actu- ally the DN map of the corresponding linearized equation, and then to adapt the theory of inverse problems for linear equations. For the semilinear equation

∆u + a(x, u) = 0, the problem of recovering the potential a(x, u) was studied in [IS94, IN95, Sun10, IY13a]. Further results are available for inverse problems for quasilinear elliptic equations [Sun96, SU97, KN02, LW07, MU], for the degener- ate elliptic p-Laplace equation [SZ12, BHKS18], and for the fractional semilinear Schr¨odinger equation [LL19]. Certain inverse problems for quasilinear elliptic equa- tions on Riemannian manifolds were considered in [LLS19]. We refer to the surveys [Sun05, Uhl09] for more details on inverse problems for nonlinear elliptic equations.

Inverse problems for hyperbolic equations with various nonlinearities have also been studied. Many of the results mentioned above rely on a solution to a related inverse problem for a linear equation, which is in contrast to the study of inverse problems for nonlinear hyperbolic equations. In fact, it has been realized that the nonlinearity can be beneficial in solving inverse problems for nonlinear hyperbolic equations.

By regarding the nonlinearity as a tool, some unsolved inverse problems for hy- perbolic linear equations have been solved for their nonlinear analogues. Kurylev- Lassas-Uhlmann [KLU18] studied the scalar wave equation with a quadratic non- linearity. In [LUW18], the authors studied inverse problems for general semi- linear wave equations on Lorentzian manifolds, and in [LUW17] they studied similar problems for the Einstein-Maxwell equations. We also refer readers to [CLOP19, dHUW18, KLOU14, WZ19] and references therein for further results on inverse problems of nonlinear hyperbolic equations.

In this work we employ the method introduced independently in [LLLS19] and [FO20] which uses nonlinearity as a tool that helps in solving inverse problems for certain nonlinear elliptic equations. The method is based on higher order lineariza- tions of the DN map, and essentially amounts to using sources with several pa- rameters and obtaining new linearized equations after differentiating with respect to these parameters. The works [LLLS19, FO20] considered inverse problems with boundary measurements on the whole boundary, also on manifolds of certain type.

(3)

In this article we will consider similar problems in Euclidean domains with differ- ent types of assumptions. We consider situations where the data is given on the full boundary or just on a part of the boundary. We also consider cases when the domain includes an unknown cavity or an unknown part of the boundary. Espe- cially we will prove uniqueness in the partial data case. Moreover, just before this article was submitted to arXiv, the preprint [KU20] of Krupchyk and Uhlmann appeared on arXiv. The work [KU20] considers the partial data Calder´on problem for certain semilinear equations and proves Corollary 1.1 below.

In this work, we do not pursue optimal regularity assumptions for our inverse problems. Instead, we want to demonstrate how the nonlinearity helps us in un- derstanding related inverse problems.

Let us describe more precisely the semilinear equations studied in this article.

Let Ω ⊂ Rn be a bounded domain with Cboundary ∂Ω, where n ≥ 2. Consider the following second order boundary value problem

(∆u + a(x, u) = 0 in Ω,

u = f on ∂Ω.

(1.1)

We will assume that the boundary data satisfies f ∈ Cs(∂Ω) and kf kCs(∂Ω)≤ δ, where s > 2 is not an integer and δ > 0 is a sufficiently small number. Here Cs(∂Ω) is the standard H¨older space on ∂Ω (the precise definition is given in Appendix A).

For the function a = a(x, z), we assume that a is C in Ω × R and satisfies one of the following conditions: Either a = a(x, z) satisfies

a(x, 0) = 0, and 0 is not a Dirichlet eigenvalue of ∆ + ∂za(x, 0) in Ω, (1.2)

or a = a(x, z) satisfies

a(x, 0) = ∂za(x, 0) = 0.

(1.3)

Note that the condition (1.3) is stronger than (1.2). Nonlinearities satisfying (1.3) together with the condition ∂zka(x, 0) 6= 0 for some k ≥ 2 are called genuinely nonlinear in [LUW18] in the context of inverse problems of nonlinear hyperbolic equations. The benefit of assuming (1.3) is that the linearized equation will be just the Laplace equation.

For nonlinearities satisfying (1.2), it follows from [LLLS19, Proposition 2.1]

(restated in Appendix A) that there are C, δ > 0 such that the boundary value problem (1.1) is well-posed for small boundary data f ∈ Cs(∂Ω), kf kCs(∂Ω)< δ, and there is a unique solution u of (1.1) satisfying kukCs(Ω)< Cδ. The solution u is called the unique small solution. See Appendix A for a more detailed discussion.

We define the corresponding Dirichlet-to-Neumann map (DN map) Λa such that Λa : {f ∈ Cs(∂Ω) ; kf kCs(∂Ω)< δ} → Cs−1(∂Ω),

Λa(f ) = ∂νu|∂Ω, (1.4)

where ∂ν is the normal derivative on the boundary ∂Ω.

(4)

We have three main theorems. The first one considers a full data inverse prob- lem and the latter two theorems consider cases where measurements are made only on subsets of a boundary.

The first theorem is a full data uniqueness result that follows from the method of [LLLS19, FO20] for Euclidean domains (in fact the theorem is contained in [FO20]

when n ≥ 3 also for H¨older continuous a(x, z), and in the case a(x, z) = q(x)zm where q ∈ C(Ω), m ∈ N and m ≥ 2, it is contained in [LLLS19, Theorem 1.2]).

The result considers the Calder´on problem for semilinear elliptic equations for a large class of nonlinear coefficients a(x, z), and shows that the Taylor series of a(x, z) at z = 0 can be recovered from the DN map. This theorem is not covered by earlier results on inverse problems for semilinear equations [IS94, IN95, Sun10, IY13a], which often assume a sign condition such as ∂ua(x, u) ≤ 0.

Theorem 1.1 (Global uniqueness). Let Ω ⊂ Rn be a bounded domain with C boundary ∂Ω, where n ≥ 2. Let aj(x, z) be C functions in x, z satisfying (1.2) for j = 1, 2. Let Λaj : Cs(∂Ω) → Cs−1(∂Ω), s > 2, be the (full data) DN maps of

∆u + aj(x, u) = 0 in Ω, for j = 1, 2, and assume that

Λa1(f ) = Λa2(f )

for any f ∈ Cs(∂Ω) with kf kCs(∂Ω)< δ, where δ > 0 is a sufficiently small number.

Then we have

zka1(x, 0) = ∂zka2(x, 0) in Ω, for k ≥ 1.

(1.5)

Even though the above result is mostly contained in [LLLS19, FO20], it will be helpful for the partial data results to give a proof of Theorem 1.1 as well as a reconstruction algorithm to recover the coefficients ∂zka(x, 0) for all k ≥ 2 in Section 2.

Next, we introduce an inverse obstacle problem for semilinear elliptic equations.

Let Ω and D be a bounded open sets with C boundaries ∂Ω and ∂D such that D ⊂⊂ Ω. Assume that ∂Ω and Ω \ D are connected. Let a(x, z) ∈ C((Ω \ D) × R) be a function satisfying (1.3) for x ∈ Ω \ D. Consider the following semilinear elliptic equation





∆u + a(x, u) = 0 in Ω \ D,

u = 0 on ∂D,

u = f on ∂Ω.

(1.6)

For s > 2 and s /∈ N, let f ∈ Cs(∂Ω) with kf kCs(∂Ω) < δ, where δ > 0 is a sufficiently small number. The condition (1.3) yields the well-posedness of (1.6) for small solutions by the results in Appendix A, and one can define the corresponding DN map ΛDa, with Neumann values measured only on ∂Ω, by

ΛDa : {f ∈ Cs(∂Ω) ; kf kCs(∂Ω)< δ} → Cs−1(∂Ω), ΛDa : f 7→ ∂νu|∂Ω. The inverse obstacle problem is to determine the unknown cavity D and the coef- ficient a from the DN map ΛDa. Our second main result is as follows.

(5)

Theorem 1.2 (Simultaneous recovery: Unknown cavity and coefficients). Assume that Ω ⊂ Rn, n ≥ 2, is a bounded domain with connected C boundary ∂Ω. Let D1, D2⊂⊂ Ω be nonempty open subsets with C boundaries such that Ω \ Dj are connected. For j = 1, 2, let

aj(x, z) ∈ C((Ω \ Dj) × R)

satisfy (1.3) and denote by ΛDajj the DN maps of the following Dirichlet problems





∆uj+ aj(x, uj) = 0 in Ω \ Dj,

uj = 0 on ∂Dj,

uj = f on ∂Ω

defined for any f ∈ Cs(∂Ω) with kf kCs(∂Ω)< δ, where δ > 0 is a sufficiently small number. Assume that

ΛDa11(f ) = ΛDa22(f ), whenever kf kCs(∂Ω)< δ.

Then

D := D1= D2 and ∂zka1(x, 0) = ∂zka2(x, 0) in Ω \ D for k ≥ 2.

The proof is based on higher order linearizations, and relies on the solution of the linearized Calder´on problem with partial data given in [FKSU09]. We remark that the analogous simultaneously recovering problem stays open when the lower order coefficient a(x, u) = q(x)u. More specifically, when the elliptic equation

∆u + a(x, u) = 0 becomes the (linear) Schr¨odinger equation ∆u + q(x)u = 0, one does not know how to determine the obstacle D ⊂⊂ Ω and q(x) by using the knowledge of the corresponding DN map.

The inverse problem of determining the obstacle D from the DN map ΛD,a is usually regarded as the obstacle problem. The obstacle problem with a single mea- surement, i.e., determining the obstacle D by a single Cauchy data {u|∂Ω, ∂νu|∂Ω} is a long-standing problem in inverse scattering theory. This type problem is also known as Schiffer’s problem, and the problem has been widely studied when the surrounding coefficients are known a priori. We refer the readers to [CK12, Isa06, LZ08] for introduction and discussion.

Many researchers have made significant progress in recent years on Schiffer’s problem for the case with general polyhedral obstacles. For the uniqueness and stability results, see [AR05, CY03, LZ06, LZ07, Ron03, Ron08]. Under the as- sumption that ∂D is nowhere analytic, Schiffer’s problem was solved in [HNS13].

However, Schiffer’s problem still remains open for the case with general obstacles (i.e., when obstacles have no geometrical assumptions). Furthermore, a nonlo- cal type Schiffer’s problem was solved by [CLL19]. We also want to point out that the simultaneous recovery of an obstacle and an unknown surrounding po- tential is also a long-standing problem in the literature. This problem is closely related to the partial data Calder´on problem [KSU07, IUY10]. Unique recovery results in the literature are based on knowing the embedded obstacle to recover

(6)

the unknown potential [IUY10], knowing the surrounding potential to recover the unknown obstacle [KL13, KP98, LZZ15, LZ10, O’D06], or using multiple spectral data to recover both the obstacle and potential [LL17].

Based on the connection of simultaneous recovery problems and the partial data Calder´on problem, i.e., we do not know the DN map on the full boundary, we will next study a partial data problem for semilinear elliptic equations. In fact, we will consider the case where both the coefficients of the equation and a part of the boundary are unknown. In the study of partial data inverse problems for (linear) elliptic equations one usually assumes that the non-accessible part of the boundary is a priori known. This is not always a reasonable assumption in practical situations. For example, in medical imaging the body shape outside of the attached measurement device may not be precisely known.

Let Ω ⊂ Rn be a bounded connected domain with C boundary ∂Ω. Let Γ ⊂ ∂Ω be nonempty open set (the known part of the boundary), and assume that we do not know ∂Ω \ Γ a priori. We consider the following semilinear elliptic equation





∆u + a(x, u) = 0 in Ω,

u = 0 on ∂Ω \ Γ,

u = f on Γ,

(1.7)

where a(x, u) is a smooth function fulfilling (1.3). For s > 2 and s /∈ N, let f ∈ Ccs(Γ) with kf kCs(Γ)< δ, where δ > 0 is any sufficiently small number. Here

Ccs(Γ) := {f ∈ Cs(Γ) : supp(f ) ⊂ Γ} .

Then by the well-posedness of (1.7) for small solutions (see Appendix A again), one can define the corresponding DN map ΛΩ,Γa with

ΛΩ,Γa : {f ∈ Ccs(Γ) ; kf kCs(Γ)< δ} → Cs−1(Γ), f 7→ ∂νu|Γ.

The inverse problem is to determine unknown part of the boundary ∂Ω \ Γ and the coefficient a from the DN map ΛΩ,Γa .

Theorem 1.3 (Simultaneous recovery: Unknown boundary and coefficients). Let Ωj ⊂ Rn, n ≥ 2, be a bounded domain with C boundary ∂Ωj for j = 1, 2, and let Γ be a nonempty open subset of both ∂Ω1 and ∂Ω2. Let G be the connected component of Ω1∩ Ω2 whose boundary contains Γ and suppose that G 6= ∅. Let aj(x, z) be smooth functions satisfying (1.3). Let Λajj be the DN maps of the following problems





∆uj+ aj(x, uj) = 0 in Ωj,

uj= 0 on ∂Ωj\ Γ,

uj= f on Γ,

for j = 1, 2. Assume that

Λa1

1 (f ) = Λa2

2 (f )

(7)

for any f ∈ Ccs(Γ) with kf kCs(Γ)< δ, for a sufficiently small number δ > 0. Then we have

1= Ω2:= Ω and ∂zka1(x, 0) = ∂zka2(x, 0) in Ω for k ≥ 2.

The proof again relies on higher order linearizations and on the solution of the linearized Calder´on problem with partial data [FKSU09]. By using Theorem 1.3, we immediately have the following result, which was first proved in the preprint [KU20] that appeared on arXiv just before this preprint was submitted.

Corollary 1.1 (Partial data). Let Ω ⊂ Rn, n ≥ 2, be a bounded domain with C boundary ∂Ω, and let Γ ⊂ Ω be a nonempty open subset. Let aj(x, z) be smooth functions satisfying (1.3) and let ΛΩ,Γaj be the partial data DN map for the Dirichlet problem





∆uj+ aj(x, uj) = 0 in Ω,

uj= 0 on ∂Ω \ Γ,

uj= f on Γ,

for j = 1, 2. Assume that

ΛΩ,Γa1 (f ) = ΛΩ,Γa2 (f ),

for any f ∈ Ccs(Γ) with kf kCs(Γ)< δ, for a sufficiently small number δ > 0. Then

zka1(x, 0) = ∂zka2(x, 0) in Ω for k ≥ 2.

For the corresponding linear equation, i.e., a(x, u) = q(x)u, the partial data problem of determining q from the DN map ΛΩ,Γq (f )|Γ for any f supported in Γ, where Γ is an arbitrary nonempty open subset of ∂Ω, was solved in [IUY10] for n = 2 and qj ∈ C2,α. For n ≥ 3, the partial data problem stays open, but there are partial results [BU02, KSU07, Isa07, KS14a] when ∂Ω is assumed to be known.

We refer to the surveys [IY13b, KS14b] for further references.

Remark 1.2. If we assume that aj(x, z) are real analytic in z for j = 1, 2, then one can completely recover the nonlinearity and show that a1(x, z) = a2(x, z) in Theorems 1.1, 1.2 and 1.3. In particular this applies to equations of the type

∆u + q(x)um= 0, where m ≥ 2 is an integer.

The paper is structured as follows. In Section 2 we prove Theorem 1.1. We also provide reconstruction algorithms for ∂zka(x, z)|z=0 for all k ≥ 2. Theorem 1.2 and Theorem 1.3 will be proved in Section 3 and Section 4, respectively. Appendix A contains the proof of a topological lemma required in the arguments.

Acknowledgments. All authors were supported by the Finnish Centre of Ex- cellence in Inverse Modelling and Imaging (Academy of Finland grant 284715).

M.S. was also supported by the Academy of Finland (grant 309963) and by the European Research Council under Horizon 2020 (ERC CoG 770924). Y.-H. L. is supported by the Ministry of Science and Technology Taiwan, under the Columbus Program: MOST-109-2636-M-009-006.

(8)

2. Proof of Theorem 1.1

We use higher order linearizations to prove Theorem 1.1. Before the proof we recall Calder´on’s exponential solutions ([Cal80]) to the equation ∆v = 0 in Rn, and the complex geometrical optics solutions (CGOs) that solve ∆v + qv = 0 on a domain Ω in Rn. These solutions will be used in the proof of Theorem 1.1. The exponential solutions of Calder´on are of the form

v1(x) := exp((η + iξ) · x), v2(x) := exp((−η + iξ) · x), (2.1)

where η and ξ are any vectors in Rnthat satisfy η ⊥ ξ and |η| = |ξ|. The functions v1 and v2 solve the Laplace equation

∆v1= ∆v2= 0 in Rn.

The linear span of the products v1v2 = exp(2iξ · x), ξ ∈ Rn, of Calder´on’s expo- nential solutions forms a dense set in L1(Ω). In particular, if

Z

f v1v2dx = 0

holds for all Calder´on’s exponential solutions v1 and v2, then f = 0.

The complex geometrical optics solutions (CGOs) generalize Calder´on’s expo- nential solutions. For n ≥ 3, they are of the form (see e.g. [SU87])

(2.2) V1(x) = eρ1·x(1 + r1), V2(x) = eρ2·x(1 + r2),

where ρ1 = η + i (ξ + ζ) ∈ Cn and ρ2 = −η + i (ξ − ζ) ∈ Cn. Here η, ξ, ζ ∈ Rn satisfy

η · ξ = ξ · ζ = ζ · η = 0, and |η|2= |ξ|2+ |ζ|2.

The idea is that ξ is fixed but |η|, |ζ| → ∞. If q ∈ L, the CGO solutions V1 and V2 satisfy

(∆ + q)V1= (∆ + q)V2= 0 in Ω and krjkL2(Ω)C

j| for some constant C > 0 depending on qj, for j = 1, 2. Thus the product V1V2 converges to e2ix·ξ as |η|, |ζ| → ∞. For n = 2 one needs to use CGOs of the form eiτ θ(x)a(x), where τ > 0 is large and the phase function θ is quadratic in x, instead of CGOs with linear phase functions of the form ρ · x described above. See [Buk08] for more details.

The products of pairs of CGOs form a complete set in L1(Ω) by [SU87] for n ≥ 3 and in L2(Ω) by [Buk08, BTW19] for n = 2. Regarding this we record the following.

Proposition 2.1 (Density of products of CGO solutions). Let Ω ⊂ Rn, n ≥ 2, be a bounded domain with a Cboundary ∂Ω and let q1, q2∈ C(Ω). Let f ∈ L(Ω).

Suppose that

Z

f V1V2dx = 0, (2.3)

for all Vj solving (−∆ + qj)Vj= 0 in Ω. Then f ≡ 0 in Ω.

(9)

Proof. The result for n ≥ 3 follows from [SU87]. The argument for n = 2 is based on the stationary phase method and requires some care, but following closely the argument in [BTW19, Section 5] (where q1− q2is replaced by our function f which is in Lp(Ω) for 1 ≤ p ≤ ∞) gives the required result.

We refer to the survey [Uhl09] for more details and references on CGOs.

Before the proof, we need to discuss a minor issue: the equation ∆u+a(x, u) = 0 involves real valued solutions (a is defined on Ω×R), whereas exponential solutions and CGOs are complex valued. However, in the proof we can just use the real and imaginary parts of these solutions (which are solutions themselves, since the coefficients are real valued) by virtue of the following simple lemma.

Lemma 2.2. Let f ∈ L(Ω), v1, v2∈ L2(Ω), and v3, . . . , vm∈ L(Ω) be complex valued functions where m ≥ 2. Then

Z

f v1· · · vmdx =

2m

X

j=1

Z

cjf w1(j)· · · wm(j)dx

where cj ∈ {±1, ±i} and w(j)1 ∈ {Re(v1), Im(v1)}, · · · , w(j)m ∈ {Re(vm), Im(vm)}

for 1 ≤ j ≤ 2m.

Proof. The result follows by writing Z

f v1· · · vmdx = Z

f (Re(v1) + iIm(v1)) · · · (Re(vm) + iIm(vm)) dx and by multiplying out the right hand side.

Now, we can prove Theorem 1.1.

Proof of Theorem 1.1. We split the proof into two parts, where in the first part we assume that the linear terms of the operators ∆ + aj(x, z) vanish: ∂zaj(x, 0) ≡ 0, j = 1, 2. The proof in this case is based on Calder´on’s exponential solutions. In the second part we consider the case ∂zaj(x, 0) 6= 0 and use CGOs instead of Calder´on’s exponential solutions.

Case 1. ∂zaj(x, 0) ≡ 0.

The proof is by induction on the order of the order of differentiation k ∈ N. By assumption, we have that

za1(x, 0) = 0 = ∂za2(x, 0).

Let then N ∈ N and assume that

(2.4) ∂zka1(x, 0) = ∂zka2(x, 0) for all k = 1, 2, · · · , N.

The induction step is to show that (2.4) holds for k = N + 1.

(10)

For ` = 1, . . . , N + 1, let `be small positive real numbers, and let f`∈ Cs(∂Ω) be functions on the boundary. Let us denote  = (1, 2, . . . , N +1) and let the function

uj:= uj(x; ), j = 1, 2, be the unique small solution of the Dirichlet problem





∆uj+ aj(x, uj) = 0 in Ω, uj =

N +1

X

`=1

`f` on ∂Ω.

(2.5)

The existence of the unique small solution (by redefining ` to be smaller if nec- essary) is given in Appendix A together with an explanation what unique small solutions mean. To prove the induction step, we will differentiate the equation (2.5) with respect to the ` parameters several times. The differentiation is justified by Proposition A.2.

We begin with the first order linearization as follows. Let us differentiate (2.5) with respect to `, so that

(∆

∂`uj



+ ∂zaj(x, uj)

∂`uj



= 0 in Ω,

∂`uj = f` on ∂Ω.

(2.6)

Evaluating (2.6) at  = 0 shows that

∆vj(`)= 0 in Ω with v(`)j = f` on ∂Ω, where

vj(`)(x) = ∂

∂`

=0uj(x; ) .

Here we have used uj(x; )|=0≡ 0 so that ∂zaj(x, uj)|=0≡ 0 in Ω. The functions vj(`)are harmonic functions defined in Ω with boundary data f`|∂Ω. By uniqueness of the Dirichlet problem for the Laplace operator we have that

v(`):= v(`)1 = v(`)2 in Ω for ` = 1, 2, · · · , N + 1.

(2.7)

For illustrative purposes we show next how to prove that ∂z2a1(x, 0) = ∂z2a2(x, 0), which corresponds to the special case N = 1. The second order linearization is given by differentiating (2.6) with respect to k for arbitrary k 6= ` where k, ` ∈ {1, 2, · · · , N + 1}. Doing so yields

(∆

2

∂k∂`uj



+ ∂zaj(x, uj)

2

∂k∂`uj



+ ∂z2a(x, uj)∂u

j

∂k

 ∂u

j

∂`



= 0 in Ω,

2

∂k∂`uj = 0 on ∂Ω.

(2.8)

(11)

By evaluating (2.8) at  = 0 we have that

(∆w(k`)j + ∂z2aj(x, 0)v(k)v(`)= 0 in Ω,

w(k`)j = 0 on ∂Ω,

(2.9)

where we have denoted wj(k`)(x) = ∂2

k∂`uj(x; )

=0 and used uj(x; )|=0 ≡ 0 in Ω for j = 1, 2. By using the fact that Λa1

PN +1

`=1 `f`

= Λa2 PN +1

`=1 `f` , we have that

(2.10) ∂νu1|∂Ω= ∂νu2|∂Ω.

By applying ∂k`|=0 to the equation (2.10) above shows that

νw(k`)1

∂Ω= ∂νw2(k`)

∂Ω, for k, ` = 1, . . . , N + 1.

(We remind that this formal looking calculation is justified by [LLLS19, Proposi- tion 2.1].) Hence, by integrating the equation (2.9) over Ω and by using integration by parts we obtain the equation

0 = Z

∂Ω



νw1(k`)− ∂νw(k`)2  dS =

Z

∆

w1(k`)− w2(k`) dx

= Z

z2a2(x, 0) − ∂z2a1(x, 0) v(k)v(`)dx (2.11)

where v(k)and v(`)are defined in (2.7). (More generally, as in [LLLS19] we could as well have integrated against a third harmonic function v(m).) Therefore, by choos- ing fk and f` as the boundary values of the real or imaginary parts of Calder´on’s exponential solutions v1and v2in (2.1) (note that the real and imaginary parts of v1 and v2 are also harmonic), and by using Lemma 2.2, we obtain that

Z

2za2(x, 0) − ∂z2a1(x, 0) v1v2dx = 0.

It follows that the Fourier transform of the difference ∂z2a1(x, 0) − ∂z2a2(x, 0) is zero. Thus ∂z2a1(x, 0) = ∂z2a2(x, 0). We define

z2a(x, 0) := ∂z2a1(x, 0) = ∂z2a2(x, 0).

(2.12)

We also note that by using (2.12), the equation (2.9) shows that the function w1(k`)− w(k`)2 solves

∆

w(k`)1 − w(k`)2 

= 0, with w(k`)1 − w(k`)2 = 0 on ∂Ω.

Thus we have that

w(k`):= w1(k`)= w(k`)2 in Ω.

(2.13)

(12)

We have now shown how to prove the special case of how to go from N = 1 to N = 2. Let us return to the general case N ∈ N. To prove the general case, we first show by induction within induction, call it subinduction, that

(2.14) ∂ku1(x; 0)

∂`1· · · ∂`k

= ∂ku2(x; 0)

∂`1· · · ∂`k

in Ω,

for all k = 1, . . . , N . The claim holds for k = 1 by (2.7). Let us then assume that (2.14) holds for all k ≤ K < N . The linearization of order K + 1 evaluated at  = 0 reads

∆ ∂K+1uj(x, 0)

∂`1· · · ∂`K+1



+ RK(uj, aj, 0) + ∂zK+1aj(x, 0)

ΠK+1k=1v(`k)

= 0 in Ω, (2.15)

where RK(uj, aj, 0) is a polynomial of the functions ∂zkaj(x, 0) and ∂kuj(x;0)

`1···∂`k for all k ≤ K. By the induction assumptions (2.4) and (2.14) these functions agree for j = 1, 2. Thus it follows that

∆

K+1

`1···`K+1u1(x, 0) − ∂K+1

`1···`K+1u2(x, 0)

= 0 in Ω

K+1

`1···`K+1u1(x, 0) − ∂K+1

`1···`K+1u2(x, 0) = 0 on ∂Ω.

(Above we have used the abbreviation ∂K+1

`1···`K+1uj(x, 0) = ∂K+1uj(x,0)

`1···∂`K+1 for j = 1, 2 and for K ∈ N, which will also be used later in the proof). Thus by the uniqueness of solutions to the Laplace equation we have that (2.14) holds for k = 1, . . . , K + 1, which concludes the induction step of the subinduction. Thus (2.14) holds for all k = 1, . . . , N .

Let us then continue with the main induction argument of the proof. The linearization of order N + 1 at  = 0 yields the equation (2.15) with N in place of K. By the subinduction, we have that RN(u1, a1, 0) = RN(u2, a2, 0). By using this fact, it follows by subtracting the equations (2.15) with j = 1 and j = 2 from each other (with K = N ) that

Z

zN +1a1(x, 0) − ∂zN +1a2(x, 0)

ΠN +1k=1v(`k)

dx = 0.

Here we used integration by parts and the assumption Λa1 = Λa2. We choose two of the functions v(`k)to be the real or imaginary parts of the exponential solutions (2.1), and the remaining N − 1 of them to be the constant function 1. Using Lemma 2.2 again, it follows that ∂zN +1a1(x, 0) = ∂zN +1a2(x, 0) in Ω as desired.

This concludes the main induction step.

Case 2. ∂zaj(x, 0) 6≡ 0.

(13)

The proof is similar to the Case 1, and therefore we keep exposition short. As said before, the main difference is that we use CGOs (2.2) instead of Calder´on’s exponential solutions (2.1). We consider `to be small numbers, ` = 1, 2, · · · , N +1, and  = (1, · · · , N +1) and f` ∈ Cs(∂Ω), for all ` = 1, 2, · · · , N + 1. Let the function uj:= uj(x; ) be the unique small solution of

(∆uj+ aj(x, uj) = 0 in Ω, uj=PN +1

`=1 `f` on ∂Ω,

for j = 1, 2. We begin with the first order linearization as follows, which at  = 0 yields:

((∆ + ∂zaj(x, 0)) v(`)j = 0 in Ω,

v(`)j = f` on ∂Ω,

(2.16)

where

vj(`)(x) = ∂

∂`

=0uj(x; ) .

The functions vj` are the solutions of the Schr¨odinger equation with potential

zaj(x, 0) in Ω with boundary data f`|∂Ω.

We show that ∂za1(x, 0) = ∂za2(x, 0) for x ∈ Ω. Since the DN maps Λa1 and Λa2 agree, we have by [LLLS19, Proposition 2.1] that the DN maps corresponding to the equation (2.16) are the same. Let us consider the function

g(x) := ∂za1(x, 0) − ∂za2(x, 0) ∈ L(Ω),

then by Proposition 2.1, it is easy to see that g = 0 for n ≥ 3. On the other hand, by using the boundary determination (for example, see [GT11, Appendix]), then one has ∂za1(x, 0) = ∂za2(x, 0) for x ∈ ∂Ω for n = 2. Now, with this g = 0 on ∂Ω at hand, by using Proposition 2.1 again, it follows that g = 0 in Ω ⊂ R2, which implies that

(2.17) ∂za1(x, 0) = ∂za2(x, 0).

Moreover, by using (2.17) and the uniqueness of solutions to the Dirichlet problem (2.16), we have that

v(`):= v1(`)= v2(`) in Ω for ` = 1, 2, · · · , N + 1, (2.18)

and we simply denote

q(x) := ∂za1(x, 0) = ∂za2(x, 0), for x ∈ Ω.

Here we used the assumption (1.2), which says that operators ∆ + ∂zaj(x, 0) are injective on H01(Ω), , j = 1, 2.

Since ∂za1(x, 0) = ∂za2(x, 0), we have that the claim (1.5) of the theorem holds for k = 1. We proceed by induction on k. To do that, we assume that (1.5) holds

(14)

for all k = 1, . . . , N . Again, we do the N = 1 case separately to explain how the induction works. The second order linearization yields the equations for j = 1, 2:

(∆wj(k`)+ q(x)w(k`)j + ∂z2aj(x, 0)v(k)v(`) = 0 in Ω,

w(k`)j = 0 on ∂Ω,

(2.19)

where w(k`)j (x) = ∂2

k∂`uj(x; )

=0 and we used uj(x; )|=0 ≡ 0 in Ω. Since Λa1= Λa2, we have (as in Case 1) that

νw1(k`)

∂Ω= ∂νw2(k`)

∂Ω, for k, ` ∈ 1, . . . , N.

Fix x0 ∈ Ω. We claim that there exists a solution v(0) ∈ Hs(Ω), where s can be chosen arbitrarily large, of the Schr¨odinger equation

∆v(0)+ q(x)v(0)= 0 in Ω (2.20)

with

v(0)(x0) 6= 0.

By the Runge approximation property (see e.g. [LLS19, Proposition A.2]), it is enough to construct such a solution in some small neighborhood U of x0. Since q is smooth, by a perturbation argument it is enough to construct a nonvanishing solution of ∆w+q(x0)w = 0 near x0. Writing q(x0) = λ2for some complex number λ, it is enough to take w = eiλx1. This completes the construction of v(0).

Now, multiplying (2.19) by v(0) and integrating by parts yields that 0 =

Z

∂Ω

v(0)ν



w1(k`)− w(k`)2  dS

= Z

v(0)∆

w(k`)1 − w(k`)2  dx +

Z

∇v(0)· ∇

w(k`)1 − w(k`)2  dx

= Z

q(x)(w(k`)2 − w1(k`))v(0)dx + Z

z2a2− ∂z2a1 v(k)v(`)v(0)dx

− Z



w(k`)1 − w(k`)2 

∆v(0)dx

= Z

z2a2(x, 0) − ∂2za1(x, 0) v(k)v(`)v(0)dx.

(2.21)

Here v(k) and v(`) are harmonic functions defined (2.18), which we now choose specifically to be real or imaginary parts of the CGOs (since q is real valued, the real and imaginary parts of CGOs are also solutions of ∆v + qv = 0). Then, by using Lemma 2.2 we can reduce to the case where v(k) and v(`) are the actual complex valued CGOs, and by applying the completeness of products of pairs of CGOs [Buk08, SU87] we obtain that

z2a2(x, 0)v(0)(x) = ∂2za1(x, 0)v(0)(x) for x ∈ Ω.

(15)

In particular, when x = x0, we have ∂z2a2(x0, 0) = ∂z2a1(x0, 0) since v(0)(x0) 6= 0.

Since x0∈ Ω was arbitrary, we have that

z2a(x, 0) := ∂z2a1(x, 0) = ∂z2a2(x, 0) for x ∈ Ω.

(2.22)

This concludes the induction step in the special case of how to go from N = 1 to N = 2. We also have from (2.19) and (2.22) that w(k`)1 − w(k`)2 solves

(∆

w(k`)1 − w2(k`)

+ q(x)

w(k`)1 − w(k`)2 

= 0 in Ω,

w1(k`)− w2(k`)= 0 on ∂Ω,

then the uniqueness of the solution to the Schr¨odinger equation yields that w(k`):= w1(k`)= w(k`)2 in Ω.

Let us return to general case N ∈ N. As in the Case 1, we first prove by the subinduction that

k`1···`

ku1(x; 0) = ∂`k1···`

ku2(x; 0) in Ω,

for all k ≤ N . Then the linearization for j = 1, 2 of order N + 1 shows that

(∆ + q)

N +1

`1···`N+1uj(x, 0)

+ RN(uj, aj, 0) + ∂N +1z aj(x, 0)

ΠN +1k=1v(`k)

= 0, (2.23)

for x ∈ Ω, and where RN(uj, aj, 0) is a polynomial of the functions ∂zkaj(x, 0) and

k

`1···`kuj(x; 0) for k ≤ N . By the subinduction we have that RN(u1, a1, 0) = RN(u2, a2, 0).

Finally, by multiplying (2.23) by v(0) and repeating an integration by parts argument similar to that in (2.21) shows that we have the following integral identity

Z

zN +1a1(x, 0) − ∂zN +1a2(x, 0)

ΠN +1k=1v(`k)

v(0)dx = 0.

With the help of Lemma 2.2 we can choose v(`1)and v(`2)to be the CGOs as before, and we choose the remaining N − 1 solutions as v(`3)= · · · = v(`N +1)= v(0), where v(0) is the solution in (2.20). We conclude that ∂zN +1a1(x0, 0) = ∂zN +1a2(x0, 0).

Since x0 ∈ Ω was arbitrary, we obtain that ∂zN +1a1(x, 0) = ∂zN +1a2(x, 0) in Ω.

This concludes the proof.

Remark 2.3. In the proof of Theorem 1.1, we have used the Runge approximation property to construct solutions to the Schr¨odinger equation that are nonzero at a given point x0. An alternative method is to construct a nonvanishing solution of

∆v + q(x)v = 0. This can be done by considering a complex geometrical optics solution

v(x) = eρ·x(1 + r) in Ω, where ρ ∈ Cn. Then r solves

e−ρ·x(∆ + q)eρ·xr = −q in Ω,

(16)

with the estimate (see [SU87, Theorem 1.1], the argument applies also in our case when n ≥ 2)

krkHs(Ω)≤ C

|ρ|kqkHs(Ω),

for s > n/2 and |ρ| large enough. Then by the Sobolev embedding we have that krkL(Ω)≤ 1

2,

for |ρ| large enough. This implies that v(x) is nonvanishing in Ω, and the solution v(0) in the proof of Theorem 1.1 could be replaced by v here.

In the case q(x) ≤ 0 in Ω (with the sign convention ∆ =Pn k=1x2

k), another alternative is to apply the maximum principle to construct a positive solution to the Schr¨odinger equation in Ω.

Furthermore, when the coefficient a = a(x, z) of the operator ∆+a(x, ·) satisfies

za(x, 0) ≡ 0 one has the following reconstruction result.

Theorem 2.1 (Reconstruction). Let n ≥ 2, and let Ω ⊂ Rn be a bounded domain with C boundary ∂Ω. Let Λa be the DN map of the equation

∆u + a(x, u) = 0 in Ω,

and assume that a(x, z) ∈ C(Ω × R) satisfies (1.3). Then we can reconstruct

zka(x, 0) from the knowledge of Λa, for all k ≥ 2.

Proof. For k = 2, the reconstruction formula can be easily obtained by reviewing the argument between the equations (2.9) and (2.11). Formally we have

∂dz2a(·, 0)(−2ξ) = − Z

∂Ω

2

∂1∂2 

1=2=0

Λa(1f1+ 2f2) dS,

which reconstructs the coefficient ∂z2a(x, 0). Here d∂z2a denotes the Fourier trans- formation of a(x, z) in the x-variable, and f1 and f2 are the boundary values of the Calder´on’s exponential solutions (2.1). More precisely, we can take f1 and f2

to be the real or imaginary parts of the boundary values of the solutions (2.1), and we can then use a suitable combination as in Lemma 2.2 to recover d∂z2a(·, 0)(−2ξ).

Moreover, by using (2.9), one can solve the boundary value problem (2.9) uniquely to construct the function w(kl) given by (2.13).

The proof for general k is by recursion, but let us show separately how to reconstruct ∂z3a(x, z) corresponding to k = 3. To reconstruct ∂z3a(x, 0), we apply third order linearization for the equation





∆u + a(x, uj) = 0 in Ω, u =

N +1

X

`=1

`f` on ∂Ω,

(17)

at  = (1, . . . , N +1) = 0, where ` are small and f`∈ Cs(∂Ω). For k = 3, we can take N to be 2. This shows that

∆w(ik`)+ ∂2za(x, 0)

w(ik)v(`)+ w(i`)v(k)+ w(k`)v(i) + ∂z3a(x, 0)

v(i)v(k)v(`)

= 0 in Ω,

(2.24)

holds, where w(ik`)(x) = ∂ 3

i∂k∂`u(x; 0). An integration by parts formula now yields that

Z

∂Ω

3

∂i∂k∂`



i=k=`=0

Λa(ifi+ kfk+ `f`) dS +

Z

z2a(x, 0)

w(ik)v(`)+ w(i`)v(k)+ w(k`)v(i) dx

= − Z

z3a(x, 0)v(i)v(k)v(`)dx

Let v(i)and v(k)be real or imaginary parts of Calder´on’s exponential solutions (2.1) and let v(`) = 1. By using Lemma 2.2 and the fact that we have already recon- structed ∂z2a(x, 0) and w(k`), we see that we can reconstruct the Fourier transform of ∂z3a(x, 0). Consequently, we know the all the coefficients of the equation (2.24) for w(ik`), thus we may solve (2.24) to reconstruct also w(ik`). (The boundary value for w(ik`) is 0.)

To reconstruct ∂zkaj(x, 0) for any k ∈ N, one proceeds recursively. Let us assume that we have reconstructed ∂zka(x, 0) and w(`1···`k) for all k ≤ N . The linearization of order N + 1 then yields that (cf. (2.15))

(∆w(`1···`N +1)+ RN(u, a, 0) + ∂zN +1a(x, 0) ΠN +1k=1v(`k) = 0 in Ω,

w(`1···`N +1)= 0 on ∂Ω,

(2.25)

where w(`1···`N +1)(x) = ∂N +1

`1···`N+1u(x, 0) and where RN(u, a, 0) is a polynomial of the functions ∂zka(x, 0) and ∂k

`1···`ku(x, 0) for k ≤ N . By the recursion assumption we have thus already recovered RN(u, a, 0). Finally, integrating the equation (2.25) over Ω shows that

Z

∂Ω

N +1

∂`1· · · ∂`N +1

=0

Λa N +1

X

k=1

`kf`k

! dS +

Z

RN(u, a, 0) dx

= − Z

zLa(x, 0)

ΠL`=1v(i`) dx.

We choose v(`1), v(`2) to be real or imaginary parts of exponential solutions (2.1) and v(`3) = · · · = v(`N +1) = 1 in Ω. Using Lemma 2.2 again, this recovers

zN +1a(x, 0). To end the reconstruction argument, we insert the now reconstructed

zN +1a(x, 0) into (2.25) and solve the equation for w(`1···`N +1) with zero Dirichlet boundary value.

(18)

3. Simultaneous recovery of cavity and coefficients

We prove Theorem 1.2 by first recovering the cavity D from the first linearization of the equation

∆u(x) + a(x, u) = 0.

After that the function a = a(x, z) is recovered by higher order linearization.

Proof of Theorem 1.2. Let f =PN +1

`=1 `f`, where `are sufficiently small numbers and let f`∈ Cs(∂Ω) for all ` = 1, 2, · · · , N + 1. We denote  = (1, . . . , N +1) and let uj(x) = uj(x; ) be the solution of





∆uj+ aj(x, uj) = 0 in Ω \ Dj,

uj= 0 on ∂Dj,

uj= f on ∂Ω

(3.1)

with f =PN +1

`=1 `f`, j = 1, 2.

Step 1. Recovering the cavity.

Let us differentiate (3.1) with respect to `, for ` = 1, · · · , N + 1. We obtain





∆

∂`uj



+ ∂zaj(x, uj)

∂`uj



= 0 in Ω \ Dj,

∂`uj= 0 on ∂Dj,

∂`uj= f` on ∂Ω,

(3.2)

for all ` = 1, 2, · · · , N + 1 and j = 1, 2. Note that by (1.3), the function uj(x; 0) solves (3.1) with zero Dirichlet condition ∂Ω and ∂Dj. Thus we have uj(x; 0) ≡ 0 in Ω \ Dj, for j = 1, 2. By letting  = 0 and by denoting v(`)j (x) := ∂

`

=0uj, the equation (3.2) becomes





∆vj(`)= 0 in Ω \ Dj, v(`)j = 0 on ∂Dj, v(`)j = f` on ∂Ω.

(3.3)

We show that D1= D2. This follows by a standard argument (see for instance [BV99, ABRV00]), but we include a proof for completeness. Let G be the connected component of Ω \ (D1∪ D2) whose boundary contains ∂Ω and letev(`):= v1(`)−v2(`). Thenev(`) solves

(∆ev(`)= 0 in G, ev(`)= ∂νve(`)= 0 on ∂Ω since ΛDa1

1(f ) = ΛDa2

2(f ) on ∂Ω for small f . By the unique continuation principle for harmonic functions, one has thatev(`)= 0 in G. Thus

(3.4) v(`)1 = v(`)2 in G,

參考文獻

相關文件

• The solution to Schrödinger’s equation for the hydrogen atom yields a set of wave functions called orbitals..  Each orbital has a characteristic shape

Success in establishing, and then comprehending, Dal Ferro’s formula for the solution of the general cubic equation, and success in discovering a similar equation – the solution

For the assessment of Reading, Writing (Part 2: Correcting and Explaining Errors/Problems in a Student’s Composition) and Listening, which does not involve the use

In this talk, we introduce a general iterative scheme for finding a common element of the set of solutions of variational inequality problem for an inverse-strongly monotone mapping

Numerical experiments are done for a class of quasi-convex optimization problems where the function f (x) is a composition of a quadratic convex function from IR n to IR and

Chen, The semismooth-related properties of a merit function and a descent method for the nonlinear complementarity problem, Journal of Global Optimization, vol.. Soares, A new

For different types of optimization problems, there arise various complementarity problems, for example, linear complemen- tarity problem, nonlinear complementarity problem

A derivative free algorithm based on the new NCP- function and the new merit function for complementarity problems was discussed, and some preliminary numerical results for