Full text
Applied Mathematics & Optimization (2023) 88:4 https://doi.org/10.1007/s00245-023-09974-4 Multi-Peak Solutions for Coupled Nonlinear Schrödinger Systems in Low Dimensions Maoding Zhen1·Binlin Zhang2·Vicen¸tiu D. R˘adulescu3,4,5 Accepted: 1 February 2023 / Published online: 10 April 2023 © The Author(s) 2023 Abstract In this paper, we construct the solutions to the following nonlinear Schrödinger system −2u+P(x)u=μ1up+βup−1 2vp+1 2in RN, −2v +Q(x)v =μ2vp+βup+1 2vp−1 2in RN, where 3 <p<+∞,N∈{1,2},>0 is a small parameter, the potentials P,Q satisfy 0 <P0≤P(x)≤P1and Q(x)satisfies 0 <Q0≤Q(x)≤Q1. We construct the solution for attractive and repulsive cases. When x0is a local maximum point of the potentials Pand Qand P(x0)=Q(x0), we construct kspikes concentrating near the local maximum point x0. When x0is a local maximum point of Pand x0 is a local maximum point of Q, we construct kspikes of uconcentrating at the local maximum point x0and mspikes of vconcentrating at the local maximum point x0 when x0= x0.This paper extends the main results established by Peng and Wang BVicen¸tiu D. R˘adulescu [email protected].ro Maoding Zhen [email protected] Binlin Zhang [email protected] 1School of Mathematics, Hefei University of Technology, Hefei 230009, People’s Republic of China 2College of Mathematics and Systems Science, Shandong University of Science and Technology, Qingdao 266590, People’s Republic of China 3Faculty of Applied Mathematics, AGH University of Science and Technology, 30-059 Kraków, Poland 4Faculty of Electrical Engineering and Communication, Brno University of Technology, Technická 3058/10, 61600 Brno, Czech Republic 5Department of Mathematics, University of Craiova, Street A.I. Cuza No. 13, 200585 Craiova, Romania 123
4Page 2 of 56 Applied Mathematics & Optimization (2023) 88 :4 (Arch Ration Mech Anal 208:305–339, 2013) and Peng and Pi (Discrete Contin Dyn Syst 36:2205–2227, 2016), where the authors considered the case N=3, p=3. Keywords Nonlinear Schrödinger system ·Lyapunov–Schmidt reduction · Singularity ·Perturbation Mathematics Subject Classification 35B40 ·35B20 ·35J47 ·35Q40 1 Introduction and Main Results In this paper, we construct the solutions for the following nonlinear Schrödinger system −2u+P(x)u=μ1up+βup−1 2vp+1 2in RN, −2v +Q(x)v =μ2vp+βup+1 2vp−1 2in RN,(1.1) where >0 is a small parameter, 5 ≤p<+∞,N∈{1,2}, and the potentials P,Q satisfy 0 <P0≤P(x)≤P1,Q(x), respectively 0 <Q0≤Q(x)≤Q1. The use of the Lyapunov–Schmidt reduction method to construct solutions for the nonlinear Schrödinger equation attracted much attention in the last decade, starting from the pioneering contribution by Floer and Weinstein [11]. Noussair and Yan [21] considered multi-peak solutions for the following problem −2u+u=Q(x)|u|q−2u,x∈RN, u∈H1(RN), (1.2) when x0is a local maximum point of Q(x)and is sufficiently small, they proved that for each positive integer k, problem (1.2) has a positive solution with k-peaks concentrating near x0. Wei and Yan [32] studied the following nonlinear Schroödinger equation −u+V(|x|)u=up,u>0x∈RN, u∈H1(RN), (1.3) when 1 <p<(N+2)/(N−2)and V(|x|)is positive function with following expansion V(|x|)=V0+a rm+O1 rm+θas r→+∞. They proved that problem (1.3) has infinitely many non-radial positive solutions, whose energy can be made arbitrarily large. For more results about the nonlinear Schrödinger equation, we refer the reader to [1,6,8–10,12] and the references therein. 123
Applied Mathematics & Optimization (2023) 88 :4 Page 3 of 56 4 Inspired by the work of [21,32], when N=3,p=3,=1, Peng and Wang [23] considered system (1.1), where P(x)and Q(x)satisfy the following hypotheses: (P) There are constants a∈R,m>1,and θ>0 such that as r→+∞ P(|x|)=1+a |x|m+O1 |x|m+θ,as |x|→∞.(H1) (Q) There are constants b∈R,n>1,and >0 such that as r→+∞ Q(|x|)=1+b |x|n+O1 |x|n+,as |x|→∞.(H2) By using the number of the bumps of the solutions as a parameter, for the repulsive case, they constructed non-radial positive vector solutions of segregated type, for the attractive case, they constructed non-radial positive vector solutions of synchronized type. When N=3,p=3, Peng and Pi [22] constructed kinteracting spikes for unear the local maximum point x0of P(x)and minteracting spikes for vnear the local maximum point x0of Q(x), respectively, when x0= x0. Tang and Xie in [27] constructed synchronized positive vector solutions for small. Since it seems to be difficult to provide a complete list of references, we just refer the readers to [2–4,7, 13,14,17–20,22–26,28–30,33,34] and the references therein. In this paper, we have been inspired by the analysis developed in [21–23,31,32] for scalar nonlinear elliptic equations (systems), in particular, by the ideas introduced by Noussair and Yan [21] to deal with nonlinear elliptic equations. Compared with the single scalar equation, we encounter some new difficulties in estimates due to the nonlinear coupling. Firstly, we need to establish non-degenerate results for the solutions of the coupled system, which will be used to prove the invertibility of the operator for the repulsive case. The difficulty is that we need to give an exact integral estimate for the coupled term and the system is more complicated than single equations. We point out that the sign of βhas great influence on the structure of the solutions. Roughly speaking, for the repulsive case, the solutions are small perturbations of (U,V), where (U,V)are scaling and translation of the solution of −u+λu=up. For the attractive case, the solutions are small perturbations of (Uμ,Uν), where Uμ are scaling and translation of the solution of −u+λu=μupand Uνare scaling and translation of the solution of −u+λu=νup. In this paper, we examine how potentials and the interspecies scattering length β influence the structure of solutions to problem (1.1), which improves the results of [19,22] for least energy solutions. We study the existence of high energy solutions to problem (1.1) and provide not only the locations of spikes, but also much finer information on the interaction of spikes. Furthermore, we prove the attractive phenomenon for β<0 and the repulsive phenomenon for β>0. Define the function space H=(u,v)∈H1(RN)×H1(RN):RNP(x)u2dx <+∞,RNQ(x)v2dx <+∞ 123
4Page 4 of 56 Applied Mathematics & Optimization (2023) 88 :4 endowed with the following norm: (u,v)2=(u,v),(u,v)=u2 ,P+v2 ,Q,∀(u,v)∈H, where H1=H1(RN)is the usual Sobolev space, u,P=u,u,P=RN2|∇u|2+P(x)u2dx and v,P=v,v,Q=RN2|∇v|2+Q(x)v2dx. Define E=(ϕ, ψ) ∈H1(RN)×H1(RN), (ϕ, ψ), ∂U,x, j ∂yi ,∂V,x, j ∂yi=0 j=1,2···k;i=1,2···N, where (u,v),(g,h)=RN (2∇u∇g+P(x)ug +2∇v∇h+Q(x)vh)dx. Consider the following system −u+λu=μ1up+βup−1 2vp+1 2in RN, −v +λv =μ2vp+βup+1 2vp−1 2in RN.(1.4) Let Wbe the unique solution of −u+λu=up,in RN, u>0inRN,u(x)→0as|x|→+∞.(1.5) Then (U,V)=(k1W,τ 0k1W) in H1(RN)×H1(RN)is a solution of (1.4), where λ:= P(x0)=Q(x0)and τ0 satisfies μ1+βτ p+1 2 0−μ2τp−1 0−βτ p−3 2 0=0,kp−1 1=μ1+βτ p+1 2 0−1 .(1.6) 123
Applied Mathematics & Optimization (2023) 88 :4 Page 5 of 56 4 Let U,xj, (x), V,xj, (x)=Ux−xj, ,Vx−xj, . In the sequel, we will use U,xj, (x), V,xj, (x)to build up the solutions of (1.1). To show our main results, we first recall some known results from [15]. In the following, let 2∗=+∞,N=1,2, 2N N−2,N≥3. Proposition 1.1 Suppose that 1<p<2∗−1,μ 1>μ 2>0,β>0and one of the following conditions holds (A1)3<p<2∗−1,0<β≤(p−1 2)μ1; (A2)3<p<2∗−1,μ 1≥μ2 2(p+1 p−1)p−1 2,β>( p−1 2)μ1; (A3)3<p<2∗−1,μ 1<μ2 2(p+1 p−1)p−1 2,( p−1 2)μ1≤β≤β0or β≥ max{β1,(p−1 2)μ1}. Then problem (1.4)has s positive solution (U,V)=(k1W,τ 0k1W)in H1(RN)× H1(RN)which is non-degenerate, where τ0satisfies μ1+βτ p+1 2 0−μ2τp−1 0−βτ p−3 2 0=0,kp−1 1=μ1+βτ p+1 2 0−1 . Proposition 1.2 Suppose 1<p<2∗−1,μ1>μ 2>0,β<0.Then there exists a decreasing sequence {βk}⊂(−√μ1μ2,0)such that for β∈(−√μ1μ2,0)\{βk}, problem (1.4)has s positive solution (U,V)=(k1W,τ 0k1W)in H1(RN)×H1(RN) which is non-degenerate, where τ0satisfies μ1+βτ p+1 2 0−μ2τp−1 0−βτ p−3 2 0=0,kp−1 1=μ1+βτ p+1 2 0−1 . Remark 1.1 Although the authors in [15] dealt with the existence and the nondegeneracy of positive solutions for the fractional Schrödinger system, the main results are still true for the classical Schrödinger system with s=1. The main results in this paper are stated in what follows. Theorem 1.1 Assume the conditions in Propositions 1.1 or 1.2.Ifx 0is a local maximum point of P(x),Q(x)and P(x0)=Q(x0), then there exists 0>0such that for any ∈(0, 0], problem (1.1)has a solution of the form u= k j=1 U,xj, +ϕ,v = k j=1 V,xj, +ψ, 123
4Page 6 of 56 Applied Mathematics & Optimization (2023) 88 :4 for some x j, ∈Bδ(x0)and (ϕ,ψ )=O( N 2+1). Moreover, as →0,xj, → x0,|xi, −xj, | →+∞if i = j. Set λ=P(x0),λ=Q(x0), it is easy to see that Uλ,μ =λ 1 p−1μ−1 p−1W(√λx)is a solution of −u+λu=μup,in RN, u>0inRN,u(x)→0as|x|→+∞, and Uλ,ν =λ 1 p−1ν−1 p−1W(√λx)is a solution of −u+λu=νup,in RN, u>0inRN,u(x)→0as|x|→+∞. Let U,xj,μ(x), U,zj,ν(x)=Uλj,μ x−xj ,Uλj,ν x−zj , where xj∈Bδ(x0), zj∈Bδ(x0), E=(ϕ, ψ) ∈H1(RN)×H1(RN), ϕ, ∂U,xj,μ ∂xj,l=0, ψ, ∂U,zj,ν ∂zj,l=0,j=1,2...k;l=1,2...N. We will use U,xj,μ(x), U,zj,ν(x)to build up the solutions of problem (1.1). Theorem 1.2 Suppose that x0is a local maximum point of P(x)and x0is a local maximum point of Q(x), with x0= x0. Then there exists β∗>0depending on x0and x0such that for all β<β ∗, there exists 0>0such that for any ∈(0, 0], problem (1.1)has a solution of the form u= k j=1 U,xj, ,μ(x)+ϕ,v = m j=1 U,zj, ,ν(x)+ψ for some x j, ∈Bδ(x0),z j, ∈Bδ(x0),(ϕ, ψ)=O( N 2+1). Moreover, as →0,xj, →x0,|xi, −xj, | →+∞if i = j,i=1,2,...k,and z j, → x0,|zi, −zj, | →+∞i= j,i=1,2,...m. Remark 1.2 The conditions in Theorem 1.1 ensure the existence and the nondegeneracy of positive solutions (U,V)to the related limit problem (1.4), hence the reduction procedure can be carried out successfully. The condition β<β ∗in 123
Applied Mathematics & Optimization (2023) 88 :4 Page 7 of 56 4 Theorem 1.2 is necessary to prove that QB(see (2.5)) is invertible and the inverse operator is bounded. Remark 1.3 Compared with the well-studied case N=3,p=3, in order to get an accurate error estimate and use the Contraction Mapping Theorem to prove that problem (2.54) has a unique solution, our situation is much more complicated. In this sense, we complement the main results established by Peng and Wang (Arch Ration Mech Anal 2013) and Peng and Pi (Discrete Contin Dyn Syst 2016), where the authors considered the case N=3,p=3. The paper is organized as follows. In Sect. 2, we introduce some preliminaries that will be used to prove Theorems 1.1–1.2. In Sect. 3, we prove Theorem 1.1. In Sect. 4, we prove Theorem 1.2. Finally, we give some elementary computations in Appendix A. Throughout this paper, C,Ci,i=1,2,... will always denote various generic positive constants, while O(t)and o(t)denote C1≤|O(t)| |t|≤C2and |o(t)| |t|→0as t→0,respectively. 2 Preliminary Results We first give the definition of multi-peak solutions of system (1.1). Definition 2.1 Let k∈N,1 ≤j≤k.We say that (u,v )is k-peak solutions of system (1.1) concentrated at {x1,x2,...,xk,}if (u,v )satisfies the following properties. (i) (u,v )has k local maximum points xj, ∈RN,j=1,2,...,ksatisfying xj, →xjas →0 for each j. (ii) For any given τ>0, there exists R1, such that |u(x)|≤τ, |v(x)|≤τfor x∈RN\∪k jBR(xj,). (iii) There exists C>0 such that RN 2(|∇u|2+|∇v|2)+u2 +v2 ≤CN. Let x0be the local maximum points of P(x),Q(x)and P(x0)=Q(x0). We want to construct a solution (u,v )of the following form u= k j=1 U,xj, +ϕ,v = k j=1 V,xj, +ψ 123
4Page 8 of 56 Applied Mathematics & Optimization (2023) 88 :4 where xj, →x0and (ϕ,ψ )2=o(N)as →0. Then, (ϕ,ψ )satisfies the following equation B(ϕ,ψ )+l=R(ϕ,ψ ), x∈RN, (ϕ,ψ )∈H1(RN)×H1(RN), (2.1) where Bis a bounded linear operator in H1(RN)×H1(RN), defined by B(ϕ,ψ ), (g,h) =RN⎛ ⎜ ⎝2∇ϕ∇g+P(x)ϕg−pμ⎛ ⎝ k j=1 U,xj, ⎞ ⎠ p−1 ϕg⎞ ⎟ ⎠dx +RN⎛ ⎜ ⎝2∇ψ∇h+Q(x)ψh−pν⎛ ⎝ k j=1 V,xj, ⎞ ⎠ p−1 ψh⎞ ⎟ ⎠dx −βRN⎛ ⎜ ⎝p−1 2⎛ ⎝ k j=1 U,xj, ⎞ ⎠ p−3 2⎛ ⎝ k j=1 V,xj, ⎞ ⎠ p+1 2 ϕg +p−1 2⎛ ⎝ k j=1 U,xj, ⎞ ⎠ p+1 2⎛ ⎝ k j=1 V,xj, ⎞ ⎠ p−3 2 ψh⎞ ⎟ ⎠dx −βRN⎛ ⎜ ⎝p+1 2⎛ ⎝ k j=1 U,xj, ⎞ ⎠ p−1 2⎛ ⎝ k j=1 V,xj, ⎞ ⎠ p−1 2 ψg +p+1 2⎛ ⎝ k j=1 U,xj, ⎞ ⎠ p−1 2⎛ ⎝ k j=1 V,xj, ⎞ ⎠ p−1 2 ϕh⎞ ⎟ ⎠dx (2.2) for all (g,h)∈H1(RN)×H1(RN). l∈H1(RN)×H1(RN)satisfying l,(g,h) = k j=1RN (P(x)−λ)U,xj, gdx +μRN ( k j=1 Up ,xj, −⎛ ⎝ k j=1 U,xj, ⎞ ⎠ p gdx + k j=1RN (Q(x)−λ)V,xj, hdx +νRN ( k j=1 Vp ,xj, −⎛ ⎝ k j=1 V,xj, ⎞ ⎠ p hdx 123
Applied Mathematics & Optimization (2023) 88 :4 Page 9 of 56 4 +βRN⎛ ⎜ ⎝ k j=1 U p−1 2 ,xj, V p+1 2 ,xj, −⎛ ⎝ k j=1 U,xj, ⎞ ⎠ p−1 2⎛ ⎝ k j=1 V,xj, ⎞ ⎠ p+1 2⎞ ⎟ ⎠gdx +βRN⎛ ⎜ ⎝ k j=1 U p+1 2 ,xj, V p−1 2 ,xj, −⎛ ⎝ k j=1 U,xj, ⎞ ⎠ p+1 2⎛ ⎝ k j=1 V,xj, ⎞ ⎠ p−1 2⎞ ⎟ ⎠hdx, (2.3) for all (g,h)∈H1(RN)×H1(RN). R(ϕ,ψ ), (g,h) =RN⎛ ⎜ ⎝μ⎛ ⎝ k j=1 U,xj, +ϕ⎞ ⎠ p +β⎛ ⎝ k j=1 U,xj, +ϕ⎞ ⎠ p−1 2⎛ ⎝ k j=1 V,xj, +ψ⎞ ⎠ p+1 2⎞ ⎟ ⎠gdx +RN⎛ ⎜ ⎝ν⎛ ⎝ k j=1 V,xj, +ψ⎞ ⎠ p +β⎛ ⎝ k j=1 U,xj, +ϕ⎞ ⎠ p+1 2⎛ ⎝ k j=1 V,xj, +ψ⎞ ⎠ p−1 2⎞ ⎟ ⎠hdx −μRN⎛ ⎝ k j=1 U,xj, ⎞ ⎠ p gdx −βRN⎛ ⎝ k j=1 U,xj, ⎞ ⎠ p−1 2⎛ ⎝ k j=1 V,xj, ⎞ ⎠ p+1 2 gdx −νRN⎛ ⎝ k j=1 V,xj, ⎞ ⎠ p h−βRN⎛ ⎝ k j=1 U,xj, ⎞ ⎠ p+1 2⎛ ⎝ k j=1 V,xj, ⎞ ⎠ p−1 2 hdx −βRN p−1 2⎛ ⎝ k j=1 U,xj, ⎞ ⎠ p−3 2⎛ ⎝ k j=1 V,xj, ⎞ ⎠ p+1 2 ϕgdx −βRN p−1 2⎛ ⎝ k j=1 U,xj, ⎞ ⎠ p+1 2⎛ ⎝ k j=1 V,xj, ⎞ ⎠ p−3 2 ψhdx −βRN p+1 2⎛ ⎝ k j=1 U,xj, ⎞ ⎠ p−1 2⎛ ⎝ k j=1 V,xj, ⎞ ⎠ p−1 2 ψgdx −βRN p+1 2⎛ ⎝ k j=1 U,xj, ⎞ ⎠ p−1 2⎛ ⎝ k j=1 V,xj, ⎞ ⎠ p−1 2 ϕhdx,(2.4) for all (g,h)∈H1(RN)×H1(RN). From [8,9], we have following estimates. Lemma 2.1 For any α>0,β >0and l = j, there exists a constant τ>0such that 123
4Page 16 of 56 Applied Mathematics & Optimization (2023) 88 :4 ϕn,m(x)=ϕn(nx+xn,m), ψn,m(x)=ψn(nx+xn,m), then RN|∇ϕn,m(x)|2+P(nx+xn,m)| ψn,m(x)|2+|∇ϕn,m(x)|2 +Q(nx+xn,m)| ψn,m(x)|2dx =−N nRN (2 n|∇ϕn(x)|2+λ|ψn(x)|2+2 n|∇ϕn(x)|2 +λ|ψn(x)|2)dx =o(1)≤C.(2.21) Therefore, (ϕn,m, ψn,m)(ϕ, ψ) weakly in H1(RN)×H1(RN), (ϕn,m, ψn,m)→(ϕ, ψ) strongly in L2 loc(RN)×L2 loc(RN). Moreover, (ϕ, ψ) satisfies RN∇∂Un,xn,m ∂xl∇ϕ+λ∂Un,xn,m ∂xl ϕ +RN∇∂Vn,xn,m ∂xl∇ψ+λ∂Vn,xn,m ∂xl ψ=0,l=1,2,...N.(2.22) To prove (2.20), we only need to show that (ϕ, ψ) =(0,0). Remark that relation (2.13) holds just for (g,h)∈Ennot for all (g,h)∈H1(RN)×H1(RN).For (g,h)∈H1(RN)×H1(RN),wetake Qn(g,h)=(g,h)− k j=1 N i=1 bn,i,j∂Un,xn,j ∂xi ,∂Vn,xn,j ∂xi∈En.(2.23) Then bn,h,m= k j=1 N i=1 an,i,j(g,h), ∂Un,xn,j ∂xi ,∂Vn,xn,j ∂xi , 123
Applied Mathematics & Optimization (2023) 88 :4 Page 17 of 56 4 for some constant a,i,j.From(2.23), we have RN (2 n∇ϕn∇g+P(x)ϕng−pμ⎛ ⎝ k j=1 Un,xn,j⎞ ⎠ p−1 ϕng)dx +RN⎛ ⎜ ⎝2 n∇ψn∇h+Q(x)ψnh−pν⎛ ⎝ k j=1 Vn,xn,j⎞ ⎠ p−1 ψnh⎞ ⎟ ⎠dx −βRN p−1 2⎛ ⎝ k j=1 Un,xn,j⎞ ⎠ p−3 2⎛ ⎝ k j=1 Vn,xn,j⎞ ⎠ p+1 2 ϕngdx −βRN p−1 2⎛ ⎝ k j=1 Un,xn,j⎞ ⎠ p+1 2⎛ ⎝ k j=1 Vn,xn,j⎞ ⎠ p−3 2 ψnhdx −βRN p+1 2⎛ ⎝ k j=1 Un,xn,j⎞ ⎠ p−1 2⎛ ⎝ k j=1 Vn,xn,j⎞ ⎠ p−1 2 ψngdx −βRN p+1 2⎛ ⎝ k j=1 Un,xn,j⎞ ⎠ p−1 2⎛ ⎝ k j=1 Vn,xn,j⎞ ⎠ p−1 2 ϕnhdx =Bn(ϕn,ψ n), (g,h)n=Bn(ϕn,ψ n), Qn(g,h)n + k j=1 N i=1 bn,i,jBn(ϕn,ψ n), ∂Un,xn,j ∂xi ,∂Vn,xn,j ∂xin . (2.24) Since Bn(ϕn,ψ n), Qn(g,h)n=QnBn(ϕn,ψ n), Qn(g,h)n =o(1)(ϕn,ψ n)nQn(g,h)n=o N 2 n(g,h)n, (2.25) k j=1 N i=1 bn,i,jBn(ϕn,ψ n), ∂Un,xn,j ∂xi ,∂Vn,xn,j ∂xin = k j=1 N i=1 a,i,j(g,h), ∂Un,xn,j ∂xi ,∂Vn,xn,j ∂xin ×QnBn(ϕn,ψ n), ∂Un,xn,j ∂xi ,∂Vn,xn,j ∂xin 123
4Page 18 of 56 Applied Mathematics & Optimization (2023) 88 :4 + k j=1 N i=1 c,i,j(g,h), ∂Un,xn,j ∂xi ,∂Vn,xn,j ∂xin ×(∂Un,xn,j ∂xi ,∂Vn,xn,j ∂xi ), (∂Un,xn,j ∂xi ,∂Vn,xn,j ∂xi )n = k j=1 N i=1 γn,i,j(g,h), ∂Un,xn,j ∂xi ,∂Vn,xn,j ∂xin .(2.26) Substitute (2.25), (2.26)into(2.24), we obtain RN (2 n∇ϕn∇g+P(x)ϕng−pμ⎛ ⎝ k j=1 Un,xn,j⎞ ⎠ p−1 ϕng)dx +RN (2 n∇ψn∇h+Q(x)ψnh−pν⎛ ⎝ k j=1 Vn,xn,j⎞ ⎠ p−1 ψnh)dx −βRN p−1 2⎛ ⎝ k j=1 Un,xn,j⎞ ⎠ p−3 2⎛ ⎝ k j=1 Vn,xn,j⎞ ⎠ p+1 2 ϕngdx −βRN p−1 2⎛ ⎝ k j=1 Un,xn,j⎞ ⎠ p+1 2⎛ ⎝ k j=1 Vn,xn,j⎞ ⎠ p−3 2 ψnhdx −βRN p+1 2⎛ ⎝ k j=1 Un,xn,j⎞ ⎠ p−1 2⎛ ⎝ k j=1 Vn,xn,j⎞ ⎠ p−1 2 ψngdx −βRN p+1 2⎛ ⎝ k j=1 Un,xn,j⎞ ⎠ p−1 2⎛ ⎝ k j=1 Vn,xn,j⎞ ⎠ p−1 2 ϕnhdx =o( N 2 n)(g,h)n+ k j=1 N i=1 γn,i,j(g,h), ∂Un,xn,j ∂xi ,∂Vn,xn,j ∂xin .(2.27) By (2.27) and (ϕn,ψ n)∈En, we can estimate γn,i,jas following k j=1 N i=1 γn,i,j∂Un,xn,j ∂xi ,∂Vn,xn,j ∂xi,∂Un,xn,m ∂xl ,∂Vn,xn,m ∂xln+o(N−1 n) =−RN pμ⎛ ⎝ k j=1 Un,xn,j⎞ ⎠ p−1 ϕn ∂Un,xn,m ∂xl )dx 123
Applied Mathematics & Optimization (2023) 88 :4 Page 19 of 56 4 −RN pν⎛ ⎝ k j=1 Vn,xn,j⎞ ⎠ p−1 ψn ∂Vn,xn,m ∂xl )dx −βRN p−1 2( k j=1 Un,xn,j)p−3 2( k j=1 Vn,xn,j)p+1 2ϕn ∂Un,xn,m ∂xl dx −βRN p−1 2( k j=1 Un,xn,j)p+1 2( k j=1 Vn,xn,j)p−3 2ψn ∂Vn,xn,m ∂xl dx −βRN p+1 2( k j=1 Un,xn,j)p−1 2( k j=1 Vn,xn,j)p−1 2ψn ∂Un,xn,m ∂xl dx −βRN p+1 2( k j=1 Un,xn,j)p−1 2( k j=1 Vn,xn,j)p−1 2ϕn ∂Vn,xn,m ∂xl dx =: A1+A2+A3+A4+A5+A6.(2.28) On the other hand, from (2.8) and (ϕn,ψ n)∈En,wehave RN pμ(Un,xn,m)p−1ϕn ∂Un,xn,m ∂xl )dx +RN pν(Vn,xn,m)p−1ψn ∂Vn,xn,m ∂xl )dx +βRN p−1 2(Un,xn,m)p−3 2(Vn,xn,m)p+1 2ϕn ∂Un,xn,m ∂xl +βRN p−1 2(Un,xn,m)p+1 2(Vn,xn,m)p−3 2ψn ∂Vn,xn,m ∂xl +βRN p+1 2(Un,xn,m)p−1 2(Vn,xn,m)p−1 2ψn ∂Un,xn,m ∂xl +βRN p+1 2(Un,xn,m)p−1 2(Vn,xn,m)p−1 2ϕn ∂Vn,xn,m ∂xl =RN(λ −P(x))∂Un,xn,m ∂xl ϕn+(λ −Q(x))∂Vn,xn,m ∂xl ψn =O⎛ ⎝RN (λ −P(x))2∂Un,xn,m ∂xl21 2⎞ ⎠(ϕn,ψ n) +O⎛ ⎝RN (λ −Q(x))2∂Vn,xn,m ∂xl21 2⎞ ⎠(ϕn,ψ n) =εN 2O⎛ ⎝RN (λ −P(x+xn,m))2∂Un,xn,m(εx+xn,m) ∂xl21 2⎞ ⎠ (ϕn,ψ n) 123
4Page 20 of 56 Applied Mathematics & Optimization (2023) 88 :4 +εN 2O⎛ ⎝RN (λ −Q(x+xn,m))2∂Vn,xn,m(x+xn,m) ∂xl21 2⎞ ⎠ (ϕn,ψ n) =N nO(|P(xn,m)−λ|+|Q(xn,m)−λ|+n)=o(N−1 n). (2.29) There is a constant σ>0 such that ⎛ ⎝ k j=1 Un,xn,j⎞ ⎠ p−1 −Un,xn,mp−1=O⎛ ⎝ k j=m Uσ n,xn,j⎞ ⎠,(2.30) ⎛ ⎝ k j=1 Vn,xn,j⎞ ⎠ p−1 −Vn,xn,mp−1 =τp−1 0⎛ ⎜ ⎝⎛ ⎝ k j=1 Un,xn,j⎞ ⎠ p−1 −Un,xn,mp−1⎞ ⎟ ⎠=O⎛ ⎝ k j=m Uσ n,xn,j⎞ ⎠, (2.31) ⎛ ⎝ k j=1 Un,xn,j⎞ ⎠ p−3 2⎛ ⎝ k j=1 Vn,xn,j⎞ ⎠ p+1 2 −Un,xn,jp−3 2(Vn,xn,j)p+1 2 =τ p+1 2 0⎛ ⎜ ⎝⎛ ⎝ k j=1 Un,xn,j⎞ ⎠ p−1 −Un,xn,jp−1⎞ ⎟ ⎠=O⎛ ⎝ k j=m Uσ n,xn,j⎞ ⎠,(2.32) ⎛ ⎝ k j=1 Un,xn,j⎞ ⎠ p−1 2⎛ ⎝ k j=1 Vn,xn,j⎞ ⎠ p−1 2 −Un,xn,jp−1 2Vn,xn,jp−1 2 =τ p−1 2 0⎛ ⎜ ⎝⎛ ⎝ k j=1 Un,xn,j⎞ ⎠ p−1 −Un,xn,jp−1⎞ ⎟ ⎠=O⎛ ⎝ k j=m Uσ n,xn,j⎞ ⎠.(2.33) By (2.30)–(2.33) and (2.29), we obtain A1=−RN pμ⎛ ⎜ ⎝⎛ ⎝ k j=1 Un,xn,j⎞ ⎠ p−1 −Un,xn,mp−1⎞ ⎟ ⎠ϕn ∂Un,xn,m ∂xl )dx 123
Applied Mathematics & Optimization (2023) 88 :4 Page 21 of 56 4 −RN pμ(Un,xn,m)p−1ϕn ∂Un,xn,m ∂xl dx =O(e−τ n)(ϕn,0)n−RN pμ(Un,xn,m)p−1ϕn ∂Un,xn,m ∂xl dx, A2=−RN pν⎛ ⎜ ⎝⎛ ⎝ k j=1 Vn,xn,j⎞ ⎠ p−1 −Vn,xn,mp−1⎞ ⎟ ⎠ψn ∂Vn,xn,m ∂xl dx −RN pνVn,xn,mp−1ψn ∂Vn,xn,m ∂xl dx =Oe−τ n(0,ψ n)n−RN pν(Vn,xn,m)p−1ψn ∂Vn,xn,m ∂xl dx, A3=−p−1 2βRNk j=1 Un,xn,j)p−3 2( k j=1 Vn,xn,j)p+1 2 −(Un,xn,m)p−3 2(Vn,xn,m)p+1 2ϕn ∂Un,xn,m ∂xl dx −p−1 2βRN (Un,xn,m)p−3 2(Vn,xn,m)p+1 2ϕn ∂Un,xn,m ∂xl dx =O(e−τ n)(ϕn,0)n−p−1 2β ×RN (Un,xn,m)p−3 2(Vn,xn,m)p+1 2ϕn ∂Un,xn,m ∂xl dx, A4=−p−1 2βRN( k j=1 Un,xn,j)p+1 2( k j=1 Vn,xn,j)p−3 2 −(Un,xn,m)p+1 2(Vn,xn,m)p−3 2ψn ∂Vn,xn,m ∂xl dx −p−1 2βRN (Un,xn,m)p+1 2(Vn,xn,m)p−3 2ψn ∂Vn,xn,m ∂xl dx =O(e−τ n)(0,ψ n)n−p−1 2β ×RN (Un,xn,m)p+1 2(Vn,xn,m)p−3 2ψn ∂Vn,xn,m ∂xl dx, A5=−p+1 2βRN( k j=1 Un,xn,j)p−1 2( k j=1 Vn,xn,j)p−1 2 −(Un,xn,m)p−1 2(Vn,xn,m)p−1 2ψn ∂Un,xn,m ∂xl dx 123
4Page 22 of 56 Applied Mathematics & Optimization (2023) 88 :4 −p+1 2βRN (Un,xn,m)p−1 2(Vn,xn,m)p−1 2ψn ∂Un,xn,m ∂xl dx =O(e−τ n)(0,ψ n)n−p+1 2β RN (Un,xn,m)p−1 2(Vn,xn,m)p−1 2ψn ∂Un,xn,m ∂xl dx, A6=−p+1 2βRN( k j=1 Un,xn,j)p−1 2( k j=1 Vn,xn,j)p−1 2 −(Un,xn,m)p−1 2(Vn,xn,m)p−1 2ϕn ∂Vn,xn,m ∂xl dx −p+1 2βRN (Un,xn,m)p−1 2(Vn,xn,m)p−1 2ϕn ∂Vn,xn,m ∂xl dx =O(e−τ n)(ϕn,0)n−p+1 2β RN (Un,xn,m)p−1 2(Vn,xn,m)p−1 2ϕn ∂Vn,xn,m ∂xl dx. Combining (2.28), (2.29) with above A1to A6,wehave k j=1 N i=1 γn,i,j∂Un,xn,j ∂xi ,∂Vn,xn,j ∂xi,∂Un,xn,m ∂xl ,∂Vn,xn,m ∂xln=oN−1 n. (2.34) So, by (2.9) and (2.10), we have γn,i,j=o(n). (2.35) Thus, (2.27) becomes RN⎛ ⎜ ⎝2 n∇ϕn∇g+P(x)ϕng−pμ⎛ ⎝ k j=1 Un,xn,j⎞ ⎠ p−1 ϕng⎞ ⎟ ⎠dx +RN⎛ ⎜ ⎝2 n∇ψn∇h+Q(x)ψnh−pν⎛ ⎝ k j=1 Vn,xn,j⎞ ⎠ p−1 ψnh⎞ ⎟ ⎠dx −βRN p−1 2⎛ ⎝ k j=1 Un,xn,j⎞ ⎠ p−3 2⎛ ⎝ k j=1 Vn,xn,j⎞ ⎠ p+1 2 ϕngdx 123
Applied Mathematics & Optimization (2023) 88 :4 Page 23 of 56 4 −βRN p−1 2⎛ ⎝ k j=1 Un,xn,j⎞ ⎠ p+1 2⎛ ⎝ k j=1 Vn,xn,j⎞ ⎠ p−3 2 ψnhdx −βRN p+1 2⎛ ⎝ k j=1 Un,xn,j⎞ ⎠ p−1 2⎛ ⎝ k j=1 Vn,xn,j⎞ ⎠ p−1 2 ψngdx −βRN p+1 2⎛ ⎝ k j=1 Un,xn,j⎞ ⎠ p−1 2⎛ ⎝ k j=1 Vn,xn,j⎞ ⎠ p−1 2 ϕnhdx =(ϕn,ψ n)n(g,h)n,∀(g,h)∈H1(RN)×H1(RN). (2.36) For any (g,h)∈H1(RN)×H1(RN),weletgn(x)=g(x−xn,m n).Using(2.36), we have RN∇ϕn,m∇g+P(nx+xn,m)ϕn,mg −pμ⎛ ⎝ k j=1 Un,xn,j(nx+xn,m)⎞ ⎠ p−1 ϕn,mg⎞ ⎟ ⎠dx +RN∇ ψn,m∇h+Q(nx+xn,m) ψn,mh −pν⎛ ⎝ k j=1 Vn,xn,j(nx+xn,m)⎞ ⎠ p−1 ψn,mh⎞ ⎟ ⎠dx −βRN p−1 2⎛ ⎝( k j=1 Un,xn,j(nx+xn,m)⎞ ⎠ p−3 2 ⎛ ⎝ k j=1 Vn,xn,j(nx+xn,m)⎞ ⎠ p+1 2 ϕn,mgdxβRN p−1 2 ⎛ ⎝( k j=1 Un,xn,j(nx+xn,m)⎞ ⎠ p+1 2 ⎛ ⎝ k j=1 Vn,xn,j(nx+xn,m)⎞ ⎠ p−3 2 ψn,mhdx 123
4Page 24 of 56 Applied Mathematics & Optimization (2023) 88 :4 −βRN p+1 2⎛ ⎝( k j=1 Un,xn,j(nx+xn,m)⎞ ⎠ p−1 2 ⎛ ⎝ k j=1 Vn,xn,j(nx+xn,m)⎞ ⎠ p−1 2 ψn,mgdx −βRN p+1 2 ⎛ ⎝( k j=1 Un,xn,j(nx+xn,m)⎞ ⎠ p−1 2 ⎛ ⎝ k j=1 Vn,xn,j(nx+xn,m)⎞ ⎠ p−1 2 ϕn,mhdx =−N n(ϕn,ψ n)n(gn, hn)n=o(1), ∀(g,h)∈H1(RN)×H1(RN). (2.37) Therefore, (ϕ, ψ) satisfies ⎧ ⎪ ⎪ ⎪ ⎪ ⎨ ⎪ ⎪ ⎪ ⎪ ⎩ −ϕ +λϕ −pμUλ(x)p−1ϕ−βp−1 2Uλ(x)p−3 2Vλ(x)p+1 2ϕ −βp+1 2Uλ(x)p−1 2Vλ(x)p−1 2ψ=0inRN, −ψ +λψ −pνVλ(x)p−1ψ−βp−1 2Uλ(x)p+1 2Vλ(x)p−3 2ψ −βp+1 2Uλ(x)p−1 2Vλ(x)p−1 2ϕ=0inRN. (2.38) From proposition 2.1, the solution of (Uλ,Vλ)gives ϕ= N l=1 cl ∂Uλ ∂xl ,ψ= N l=1 dl ∂Vλ ∂xl .(2.39) On the other hand, from (ϕn,ψ n)∈Enand (2.29), we have RN pμ(Un,xn,m)p−1ϕn ∂Un,xn,m ∂xl dx +RN pν(Vn,xn,m)p−1ψn ∂Vn,xn,m ∂xl dx +βRN p−1 2(Un,xn,m)p−3 2(Vn,xn,m)p+1 2ϕn ∂Un,xn,m ∂xl dx +βRN p−1 2(Un,xn,m)p+1 2(Vn,xn,m)p−3 2ψn ∂Vn,xn,m ∂xl dx +βRN p+1 2(Un,xn,m)p−1 2(Vn,xn,m)p−1 2ψn ∂Un,xn,m ∂xl dx +βRN p+1 2(Un,xn,m)p−1 2(Vn,xn,m)p−1 2ϕn ∂Vn,xn,m ∂xl dx 123
Applied Mathematics & Optimization (2023) 88 :4 Page 25 of 56 4 =o(N−1 n). (2.40) Thus, RN pμUp−1 λϕ∂Uλ ∂xl dx +RN pνVp−1 λψn ∂Vλ ∂xl dx +βRN p−1 2U p−3 2 λV p+1 2 λϕ∂Uλ ∂xl dx +βRN p−1 2U p+1 2 λV p−3 2 λψ∂Vλ ∂xl dx +βRN p+1 2U p−1 2 λV p−1 2 λψ∂Uλ ∂xl dx +βRN p+1 2U p−1 2 λV p−1 2 λϕ∂Vλ ∂xl dx =0.(2.41) By (2.39), (2.41) and Uλ=1 τ0Vλ,we have cl=dl=0,l=1,2,...N. Thus, (ϕ, ψ) =(0,0). So, we have prove there exist 0,θ 0>0,ρ > 0,independent of xj,j=1,2,···k such that for any ∈(0, 0]and xj∈Bθ0(y0), QB(ϕ,ψ )is bijective in E. Moreover, it holds QB(ϕ, ψ)≥ρ(ϕ, ψ),∀(ϕ, ψ) ∈E. Thus the proof is complete. Next, we give the error estimate for land R(ϕ,ψ ). Lemma 2.3 There is a constant C >0independent of , such that l≤C⎛ ⎝N+2 2+N 2 k j=1 (|P(xj,)−λ|+|Q(xj,)−λ|)⎞ ⎠ +N 2 i=j e−√α|xi, −xj, | . Proof Observe that l,(g,h) = k j=1RN (P(x)−λ)U,xj, gdx +μRN ( k j=1 Up ,xj, −( k j=1 U,xj, )pgdx 123
4Page 32 of 56 Applied Mathematics & Optimization (2023) 88 :4 +C⎛ ⎝RN ( k j=1 U,xj, )p+1dx⎞ ⎠ p−2 p+1RN|ϕ|p+1dx2 p+1RN|h|p+1dx1 p+1 ≤CN×p−2 p+1N(1−p+1 2)3 p+1(ϕ, ψ)2 (g,h)≤C−N 2(ϕ, ψ)2 (g,h). Similarly, we have C2≤C−N 2(ϕ, ψ)2 (g,h), C4≤C−N 2(ϕ, ψ)2 (g,h). C3≤C⎛ ⎝RN ( k j=1 U,xj, )p+1dx⎞ ⎠ p−3 p+1 RN|ψ|p+1dx2 p+1RN|ϕ|p+1dx1 p+1RN|g|p+11 p+1 +C⎛ ⎝RN ( k j=1 U,xj, )p+1dx⎞ ⎠ p−3 p+1 RN|ϕ|p+1dx2 p+1RN|ψ|p+1dx1 p+1RN|h|p+1dx1 p+1 ≤C−N(ϕ, ψ)3 (g,h). By the similar argument as C3,wehave C5≤C−N(ϕ, ψ)3 (g,h). We also have C6≤C⎛ ⎝RN ( k j=1 U,xj, )p+1dx⎞ ⎠ p−4 p+1 RN|ψ|p+1dx2 p+1RN|ϕ|p+1dx2 p+1RN|g|p+1dx1 p+1 +C⎛ ⎝RN ( k j=1 U,xj, )p+1dx⎞ ⎠ p−4 p+1 RN|ϕ|p+1dx2 p+1RN|ψ|p+1dx2 p+1RN|h|p+1dx1 p+1 123
Applied Mathematics & Optimization (2023) 88 :4 Page 33 of 56 4 ≤C−3N 2(ϕ, ψ)4 (g,h). Combining (2.50)–(2.53), the estimates for C1–C6and (2.48), we obtain R(ϕ, ψ)≤C−N 2(ϕ, ψ)2 +−N(ϕ, ψ)3 +−3N 2(ϕ, ψ)4 . This finishes the proof. Now, we consider the following projection problem QB(ϕ, ψ) +Ql=QR(ϕ, ψ), (2.54) by using the contraction mapping theorem, we give the following lemma. Lemma 2.5 There exists 0>0, such that for any ∈(0, 0],xj∈Bθ(x0), then the problem (2.54)has a unique (ϕ,ψ )∈Eand (ϕ,ψ )≤Cl≤C⎛ ⎝N+2 2+N 2 k j=1 (|P(xj,)−λ|+|Q(xj,)−λ|)⎞ ⎠ +N 2 i=j e−√α|xi, −xj, | . Proof From Lemma 2.2, we can rewrite (2.54)asfollows: (ϕ, ψ) =B(ϕ, ψ) := (QB)−1Ql+(QB)−1QR(ϕ, ψ). By Lemmas 2.2 and 2.3,wehave (QB)−1Ql≤CQl≤Cl ≤C⎛ ⎝N+2 2+N 2 k j=1 (|P(xj,)−λ|+|Q(xj,)−λ|)⎞ ⎠+N 2 i=j e−√α|xi, −xj, | . (2.55) Next, we will use the contraction mapping theorem in a ball whose radius is slightly bigger than Cl.Sowetake S:= (ϕ, ψ) :(ϕ, ψ) ∈E, (ϕ, ψ)≤C⎛ ⎝N+2 2−τ+N 2 k j=1 (|P(xj,)−λ|1−τ+|Q(xj,)−λ|1−τ)⎞ ⎠ +N 2 i=j e−√α|xi, −xj, | , 123
4Page 34 of 56 Applied Mathematics & Optimization (2023) 88 :4 where τ>0 is a fixed small constant. Step 1 B is a map from Sto S. In fact, from Lemmas 2.2,2.3 and 2.4,wehave B(ϕ, ψ)≤Cl+CR(ϕ, ψ) ≤C⎛ ⎝N+2 2−τ+N 2 k j=1 (|P(xj,)−λ|1−τ+|Q(xj, )−λ|1−τ)⎞ ⎠+N 2 i=j e−√α|xi, −xj, | +C−N 2(ϕ, ψ)|2 +−N(ϕ, ψ)|3 +−3N 2(ϕ, ψ)|4 ≤C⎛ ⎝N+2 2−τ+N 2 k j=1 (|P(xj,)−λ|1−τ+|Q(xj, )−λ|1−τ)⎞ ⎠+N 2 i=j e−√α|xi, −xj, | +C⎛ ⎝N 2+2(1−τ) +N 2 k j=1 (|P(xj, )−λ|2(1−τ) +|Q(xj, )−λ|2(1−τ))⎞ ⎠ +N 2 i=j e−√α|xi, −xj, | +C⎛ ⎝N 2+3(1−τ) +N 2 k j=1 (|P(xj,)−λ|3(1−τ) +|Q(xj, )−λ|3(1−τ))⎞ ⎠ +N 2 i=j e−√α|xi, −xj, | +C⎛ ⎝N 2+4(1−τ) +N 2 k j=1 (|P(xj, )−λ|4(1−τ) +|Q(xj, )−λ|4(1−τ))⎞ ⎠ +N 2 i=j e−√α|xi, −xj, | ≤C⎛ ⎝N+2 2−τ+N 2 k j=1 (|P(xj,)−λ|1−τ+|Q(xj, )−λ|1−τ)⎞ ⎠ +N 2 i=j e−√α|xi, −xj, | . Thus, Bis a map from Sto S. Step 2 B is a contraction map. For any (ϕ1,ψ 1)∈S,wehave (ϕ1,ψ 1)≤C⎛ ⎝N+2 2−τ+N 2 k j=1 (|P(xj,)−λ|1−τ+|Q(xj,)−λ|1−τ)⎞ ⎠ +N 2 i=j e−√α|xi, −xj, | , 123
Applied Mathematics & Optimization (2023) 88 :4 Page 35 of 56 4 (ϕ2,ψ 2)≤C⎛ ⎝N+2 2−τ+N 2 k j=1 (|P(xj,)−λ|1−τ+|Q(xj,)−λ|1−τ)⎞ ⎠ +N 2 i=j e−√α|xi, −xj, | . Since RNR(ϕ1,ψ 1)−R(ϕ2,ψ 2), (g,h)dx =D1+D2+D3−D4+D5 −D6−D7−D8−D9−D10,(2.56) where D1=RN⎛ ⎝μ⎛ ⎝ k j=1 U,xj, +ϕ1⎞ ⎠ p −μ⎛ ⎝ k j=1 U,xj, +ϕ2⎞ ⎠ p⎞ ⎠gdx, D2=RN⎛ ⎝ν⎛ ⎝ k j=1 V,xj, +ψ1⎞ ⎠ p −ν⎛ ⎝ k j=1 V,xj, +ψ2⎞ ⎠ p⎞ ⎠hdx, D3=RN β⎛ ⎝ k j=1 U,xj, +ϕ1⎞ ⎠ p−1 2⎛ ⎝ k j=1 V,xj, +ψ1⎞ ⎠ p+1 2 gdx, D4=RN β⎛ ⎝ k j=1 U,xj, +ϕ2⎞ ⎠ p−1 2⎛ ⎝ k j=1 V,xj, +ψ2⎞ ⎠ p+1 2 gdx, D5=RN β⎛ ⎝ k j=1 U,xj, +ϕ1⎞ ⎠ p+1 2⎛ ⎝ k j=1 V,xj, +ψ1⎞ ⎠ p−1 2 hdx, D6=RN β⎛ ⎝ k j=1 U,xj, +ϕ2⎞ ⎠ p+1 2⎛ ⎝ k j=1 V,xj, +ψ2⎞ ⎠ p−1 2 hdx, 123
4Page 36 of 56 Applied Mathematics & Optimization (2023) 88 :4 D7=βRN p−1 2⎛ ⎝ k j=1 U,xj, ⎞ ⎠ p−3 2⎛ ⎝ k j=1 V,xj, ⎞ ⎠ p+1 2 (ϕ1−ϕ2)gdx, D8=βRN p−1 2⎛ ⎝ k j=1 U,xj, ⎞ ⎠ p+1 2⎛ ⎝ k j=1 V,xj, ⎞ ⎠ p−3 2 (ψ1−ψ2)hdx, D9=βRN p+1 2⎛ ⎝ k j=1 U,xj, ⎞ ⎠ p−1 2⎛ ⎝ k j=1 V,xj, ⎞ ⎠ p−1 2 (ψ1−ψ2)gdx, D10 =βRN p+1 2⎛ ⎝ k j=1 U,xj, ⎞ ⎠ p−1 2⎛ ⎝ k j=1 V,xj, ⎞ ⎠ p−1 2 (ϕ1−ϕ2)hdx. Since p≥3, we have D1=RN pμ⎛ ⎝ k j=1 U,xj, +ϕ1+t(ϕ1−ϕ2)⎞ ⎠ p−1 (ϕ1−ϕ2)gdx ≤CRN⎛ ⎝ k j=1 U,xj, ⎞ ⎠ p−2 (|ϕ1|+|ϕ2|)(|ϕ1−ϕ2|)gdx ≤C⎛ ⎝RN ( k j=1 U,xj, )p+1dx⎞ ⎠ p−2 p+1 (ϕ1Lp+1+ϕ2Lp+1)ϕ1−ϕ2Lp+1gLp+1 ≤CN×p−2 p+1N(1−p+1 2)×3 p+1(ϕ1Lp+1+ϕ2Lp+1)ϕ1−ϕ2Lp+1gLp+1 ≤−N 2(ϕ1+ϕ2)ϕ1−ϕ2g. Similarly, we have D2=RN⎛ ⎝ν( k j=1 V,xj, +ψ1)p−ν( k j=1 V,xj, +ψ2)p⎞ ⎠hdx ≤−N 2(ψ1+ψ2)ψ1−ψ2h. 123
Applied Mathematics & Optimization (2023) 88 :4 Page 37 of 56 4 Thus, D1+D2≤C−N 2((ϕ1,ψ 1)+(ϕ2,ψ 2))(ϕ1−ϕ2,ψ 1−ψ2(g,h). (2.57) We also have D3−D4=RN βp−1 2( k j=1 U,xj, +ϕ2)p−3 2( k j=1 V,xj, +ψ2)p+1 2(ϕ1−ϕ2)gdx +RN βp+1 2( k j=1 U,xj, +ϕ2)p−1 2( k j=1 V,xj, +ψ2)p−1 2(ψ1−ψ2)gdx +o(RN (|ϕ1−ϕ2|2)gdx)+o(RN o(|ψ1−ψ2|2)gdx) := E1+E2+o(RN (|ϕ1−ϕ2|2)gdx)+o(RN o(|ψ1−ψ2|2)gdx), (2.58) D5−D6=RN βp+1 2( k j=1 U,xj, +ϕ2)p−1 2( k j=1 V,xj, +ψ2)p−1 2(ϕ1−ϕ2)hdx +RN βp−1 2( k j=1 U,xj, +ϕ2)p+1 2( k j=1 V,xj, +ψ2)p−3 2(ψ1−ψ2)hdx +o(RN (|ϕ1−ϕ2|2)hdx)+o(RN o(|ψ1−ψ2|2)hdx) := E3+E4+o(RN (|ϕ1−ϕ2|2)hdx)+o(RN o(|ψ1−ψ2|2)hdx). (2.59) Thus, E1−D7=βp−1 2 p−3 2RN ( k j=1 U,xj, )p−5 2( k j=1 V,xj, )p+1 2ϕ2(ϕ1−ϕ2)gdx +βp−1 2 p+1 2RN ( k j=1 U,xj, )p−3 2( k j=1 V,xj, )p−1 2ψ2(ϕ1−ϕ2)gdx +o(RN|ϕ2|2(ϕ1−ϕ2)gdx)+o(RN|ψ2|2(ϕ1−ϕ2)gdx) ≤C⎛ ⎝RN ( k j=1 U,xj, )p+1⎞ ⎠ p−2 p+1 ×ϕ2Lp+1ϕ1−ϕ2Lp+1+ψ2Lp+1)ψ1−ψ2Lp+1gLp+1 123
4Page 38 of 56 Applied Mathematics & Optimization (2023) 88 :4 ≤C−N 2ϕ2,ψ 2)(ϕ1−ϕ2,ψ 1−ψ2(g,h).(2.60) Similarly, we have E2−D9≤C−N 2ϕ2,ψ 2)(ϕ1−ϕ2,ψ 1−ψ2(g,h),(2.61) E3−D10 ≤C−N 2ϕ2,ψ 2)(ϕ1−ϕ2,ψ 1−ψ2(g,h),(2.62) E4−D8≤C−N 2ϕ2,ψ 2)(ϕ1−ϕ2,ψ 1−ψ2(g,h).(2.63) Combining (2.57)–(2.63) with (2.56), we have RN R(ϕ1,ψ 1)−R(ϕ2,ψ 2), (g,h)dx ≤C−N 2ϕ2,ψ 2)(ϕ1−ϕ2,ψ 1−ψ2(g,h). (2.64) Thus, B(ϕ1,ψ 1)−B(ϕ2,ψ 2)≤1 2(ϕ1,ψ 1)−(ϕ2,ψ 2). So, Bis a contraction map. By the contraction mapping theorem, we conclude that for any ∈(0, 0],xj∈ Bθ(x0), there is a (ϕ,ψ )∈Edepending only on xjand such that (ϕ,ψ )=B(ϕ,ψ ). Moreover, from Lemma 2.3 and Lemma 2.4,wehave (ϕ,ψ ) =B(ϕ,ψ )≤Cl+CR(ϕ, ψ) ≤Cl+C−N 2(ϕ, ψ)|2 +−N(ϕ, ψ)|3 +−3N 2(ϕ, ψ)|4 ≤Cl+C−N 2(ϕ, ψ)|+−N(ϕ, ψ)|2 +−3N 2(ϕ, ψ)|3 (ϕ, ψ)| ≤C⎛ ⎝N+2 2+N 2 k j=1 (|P(xj,)−λ|+|Q(xj,)−λ|)⎞ ⎠+N 2 i=j e−√α|xi, −xj, | . As desired. 123
Applied Mathematics & Optimization (2023) 88 :4 Page 39 of 56 4 Next, we solve equation (2.1). Since QB(ϕ, ψ) +Ql−QR(ϕ, ψ) =B(ϕ, ψ) +l−R(ϕ, ψ) − k j=1 N i=1 b,i,j∂U,xj, ∂xi ,∂V,xj, ∂xi. From Lemma 2.5, we know the following equation QB(ϕ, ψ) +Ql=QR(ϕ, ψ) has a unique solution (ϕ,ψ ).So B(ϕ,ψ )+l−R(ϕ,ψ )= k j=1 N i=1 b,i,j∂U,xj, ∂xi ,∂V,xj, ∂xi(2.65) for some constant b,i,j.Next, we should to choose suitable xjsuch that b,i,j= 0,i=1,2...N.j=1,2,...k. Firstly, it is easy to see that the right hand of (2.65) belongs to E, if the left hand of of (2.65) belongs to E, then the right hand of (2.65) must be zero. Let u= k j=1 U,xj, +ϕ,v = k j=1 V,xj, +ψ, then B(ϕ,ψ )+l−R(ϕ,ψ ), (g,h) =RN (2∇u∇g+P(x)ug+2∇v∇v+Q(x)vh)dx −RNμup g+βu p−1 2 v p+1 2 g+νvp h+βu p+1 2 v p−1 2 hdx for any (g,h)∈H1(RN)×H1(RN). Lemma 2.6 Suppose that x j, satisfies RN (2∇u∇∂U,xj, ∂xi+P(x)u ∂U,xj, ∂xi+2∇v∇∂V,xj, ∂xi+Q(x)v ∂U,xj, ∂xi )dx −RNμup ∂U,xj, ∂xi+βu p−1 2 v p+1 2 ∂U,xj, ∂xi+νvp ∂V,xj, ∂xi+βu p+1 2 v p−1 2 ∂V,xj, ∂xi dx =0i=1,2,...N,j=1,2,...k.(2.66) 123
4Page 40 of 56 Applied Mathematics & Optimization (2023) 88 :4 then b,i,j=0,i=1,2,...N,j=1,2,···k. Proof If (2.66) holds, then k m=1 N h=1 b,h,m (∂U,xj, ∂xi ,∂V,xj, ∂xi ), (∂U,xm ∂yh ,∂V,xm ∂yh )=0,i=1,2,...N,j=1,2,...k. (2.67) By (2.9) and (2.10), we obtain b,i,j=0,i=1,2,...N,j=1,2,...k. 3 Proof of Theorem 1.1 In this section, we give the proof of Theorem 1.1. Proof In order to solve (2.65), we define a function as following K(x)=I⎛ ⎝ k j=1 U,xj, +ϕ, k j=1 V,xj, +ψ⎞ ⎠, where I(u,v)=1 2RN (2|∇u|2+P(x)u2+2|∇v|2+Q(x)v2)dx −1 p+1RN (μup+1+νup+1 +2βup+1 2vp+1 2)dx,∀(u,v)∈H1(RN)×H1(RN). (3.1) Then, from Lemmas 2.3,2.4 and Proposition 5.1, there exists a small constant σ>0 such that K(x)=I⎛ ⎝ k j=1 U,xj, , k j=1 V,xj, ⎞ ⎠+l,(ϕ ,ψ )+O(l(ϕ,ψ )+ϕ,ψ 2) =I⎛ ⎝ k j=1 U,xj, , k j=1 V,xj, ⎞ ⎠+ON(P(xj,)−λ)2+(Q(xj, )−λ)2+2 123
Applied Mathematics & Optimization (2023) 88 :4 Page 41 of 56 4 =(1 2−1 p+1)kNλ1−N 2A−CN(λ −P(xj,)) +(λ −Q(xj, )) + −CN k i=j e−√λ|xi, −xj, | +O⎛ ⎝N k i=j e−2(√λ−σ)|xi, −xj, | ⎞ ⎠ +ON(P(xj, )−λ)2+(Q(xj,)−λ)2+2.(3.2) We use the ideas introduced in [22] to consider the following maximizing problem max x∈DK(x), where D={x:xj∈Bθ(x0), j=1,2,...k,|xm−xj|≥θ|ln |1 2,m= j}. We prove that if maxx∈DK(x)is achieved by some xin D, then xis an interior point of D. Taking xi=x0+θ|ln |ej,(j=1,2,...k), then |xi−xj|=θ|ln |, which means that x=(x1,x2,...,xk)∈D, thus, we have 1 2−1 p+1kNλ1−N 2A−CN+1|ln |≤K(x)≤K(x) ≤1 2−1 p+1kNλ1−N 2A−CN ⎛ ⎝ k j=1 (λ −P(xj,)) + k j=1 (λ −Q(xj,)) +⎞ ⎠ −CN k i=j e−√α|x,i−xj, | . Thus, k j=1 (λ −P(xj,)) + k j=1 (λ −Q(xj,)) ++ k i=j e−√α|x,i−xj, | ≤C|ln |, so k j=1 (λ −P(xj,)) ≤C|ln |, k j=1 (λ −Q(xj,)) ≤C|ln |, √α|x,i−xj, | ≥C|ln |≥|ln |1 2. 123
4Page 48 of 56 Applied Mathematics & Optimization (2023) 88 :4 −CN m i=j e−min{√λi,√λj}−σ)|zi−zj| +O⎛ ⎝N m i=j e−(2min{√λi,√λj}−σ)|zi−zj| ⎞ ⎠ −CN k i=1 m j=1 e−min{√λi,√λj}|xi−zj| +O⎛ ⎝ k i=1 m j=1 e−(2min{√λi,√λj}−σ)|xi−zj| ⎞ ⎠ +O(N+1). Consider the following maximizing problem max (x,y)∈D1×D2 K(x,z), where D1={x:xj∈Bθ(x0), j=1,2,...k,|xi−xj|≥θ|ln |1 2,i= j}, D2={z:zj∈Bθ(x0), j=1,2,...m,|zi−zj|≥θ|ln |1 2,i= j}. We prove that if max(x,y)∈D1×D2K(x,z), is achieved by some (x,z)in D1×D2, then (x,z)is an interior point of D1×D2. Taking xi=x0+θ ln |ej,(j= 1,2,...k), zi=x0+θln |ej,(j=1,2,...m), then |xi−xj|=θ|ln |,|zi− zj|=θ|ln |, which means that (x=(x1,x2,...,xk), z=(z1,z2,...,zm)) ∈ D1×D2, thus, we have =1 2−1 p+1A⎛ ⎝ k j=1 Nλ p+1 p−1−N 2 jμ−2 p−1+ m j=1 Nλ p+1 p−1−N 2 jν−2 p−1⎞ ⎠−CN+1|ln | ≤K(x,z)=(1 2−1 p+1)A⎛ ⎝ k j=1 Nλ p+1 p−1−N 2 j, μ−2 p−1+ m j=1 Nλ p+1 p−1−N 2 j, ν−2 p−1⎞ ⎠ −CN k i=j e−min{√λi, ,√λj, }|xi, −xj, | +O⎛ ⎝N k i=j e−(2min{√λi, ,√λj, }−σ)|xi, −xj, | ⎞ ⎠ −CN m i=j e−min{√λi, ,√λj, }|zi, −zj, | +O⎛ ⎝N m i=j e−(2min{√λi, ,√λj, }−σ)|zi, −zj, | ⎞ ⎠. Thus, we can get 1 2−1 p+1AN⎛ ⎝ k j=1λ p+1 p−1−N 2 j−λ p+1 p−1−N 2 j, μ−2 p−1 + m j=1λ p+1 p−1−N 2 j−λ p+1 p−1−N 2 j, ν−2 p−1⎞ ⎠≤C|ln | 123
Applied Mathematics & Optimization (2023) 88 :4 Page 49 of 56 4 and m i=j e−min{√λi, ,√λj, }|zi, −zj, | ≤C|ln |, k i=j e− min{√λi, ,√λj, }|xi, −xj, | ≤C|ln |, which imply that m i=j |xi, −xj,| ≥C|ln |≥|ln |1 2, k i=j |zi, −zj,| ≥C|ln |≥|ln |1 2. Therefore, (x,z)is an interior point of D1×D2, which implies that (u,v )=⎛ ⎝ k j=1 U,xj, ,μ +ϕ, k j=1 U,zj, ,ν +ψ⎞ ⎠ is a critical point of K(x,z). So, (1.1) has a solution of the form u= k j=1 U,xj, ,μ +ϕ,v = k j=1 U,zj, ,ν +ψ for some xj, ∈Bθ(pj), z, j∈Bθ(pj)and (ϕ, ψ)=O( N 2+1). Author Contributions All authors contribute equally to this paper. All authors read and approved the final manuscript. Funding Maoding Zhen was supported by the NSFC (Grant No. 12201167) and the Fundamental Research Funds for the Central University of China (Grant No. JZ2021HGTA0177, JZ2022HGQA0155). Binlin Zhang was supported by the National Natural Science Foundation of China (Grant No. 11871199), the Heilongjiang Province Postdoctoral Startup Foundation, PR China (Grant No. LBH-Q18109), and the Cultivation Project of Young and Innovative Talents in Universities of Shandong Province. The research of Vicen¸tiu D. R˘adulescu was supported by a grant of the Romanian Ministry of Research, Innovation and Digitization, CNCS/CCCDI-UEFISCDI, project number PCE 137/2021, within PNCDI III. Data Availability This paper has no associated data and material. Declarations Conflict of interest The authors have no relevant financial or non-financial interests to disclose. 123
4Page 50 of 56 Applied Mathematics & Optimization (2023) 88 :4 Open Access This article is licensed under a Creative Commons Attribution 4.0 International License, which permits use, sharing, adaptation, distribution and reproduction in any medium or format, as long as you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons licence, and indicate if changes were made. The images or other third party material in this article are included in the article’s Creative Commons licence, unless indicated otherwise in a credit line to the material. If material is not included in the article’s Creative Commons licence and your intended use is not permitted by statutory regulation or exceeds the permitted use, you will need to obtain permission directly from the copyright holder. To view a copy of this licence, visit http://creativecommons.org/licenses/by/4.0/. 123
Applied Mathematics & Optimization (2023) 88 :4 Page 51 of 56 4 Appendix A: Error Estimate Proposition 5.1 There exist positive constants C1,C2,C3and C4, such that I⎛ ⎝ k j=1 U,xj, , k j=1 V,xj, ⎞ ⎠=1 2−1 p+1kNλ1−N 2A +CN⎛ ⎝ k j=1 (P(xj,)−λ) + k j=1 (Q(xj, )−λ) +2⎞ ⎠ −CN k i=j e−√λ|xi, −xj, | +O(N k i=j e−2(√λ−σ)|xi, −xj, | ), where A =(a2 λ+b2 λ)RNWp+1dx. Proof By the elementary computations, we have I⎛ ⎝ k j=1 U,xj, , k j=1 V,xj, ⎞ ⎠ =1 2−1 p+1k j=1RN(μUp+1 ,xj, +νVp+1 ,xj, +2βU p+1 2 ,xj, V p+1 2 ,xj, )dx +1 2RN k j=1(P(x)−P(x0))U2 ,xj, +(Q(x)−Q(x0))V2 ,xj, dx +1 2RN k j=i(P(x)−P(x0))U,xj, U,x,i+(Q(x)−Q(x0))V,xj, V,x,idx −μ p+1RN⎛ ⎝( k j=1 U,xj, )p+1− k j=1 Up+1 ,xj, −p+1 2 k j=i Up ,xj, U,x,i⎞ ⎠dx −ν p+1RN⎛ ⎝( k j=1 V,xj, )p+1− k j=1 Vp+1 ,xj, −p+1 2 k j=i Vp ,xj, V,x,i⎞ ⎠dx −2β p+1RN( k j=1 U,xj, )p+1 2( k j=1 V,xj, )p+1 2− k j=1 U p+1 2 ,xj, V p+1 2 ,xj, dx +2β p+1RN p+1 4k j=i U p−1 2 ,xj, V p+1 2 ,x,iU,x,i+ k j=i U p+1 2 ,xj, V p−1 2 ,x,iV,x,idx. 123
4Page 52 of 56 Applied Mathematics & Optimization (2023) 88 :4 By the definition of U,xj, and V,xj, , we get 1 2−1 p+1k j=1RN (μUp+1 ,xj, +νVp+1 ,xj, +2βU p+1 2 ,xj, V p+1 2 ,xj, )dx =1 2−1 p+1kNλ1−N 2(a2 λ+b2 λ)RN Wp+1dx. From (2.42), we know 1 2RN k j=1(P(x)−P(x0))U2 ,xj, +(Q(x)−Q(x0))V2 ,xj, dx +1 2RN k j=i(P(x)−P(x0))U,xj, U,x,i+(Q(x)−Q(x0))V,xj, V,x,idx =CN⎛ ⎝ k j=1 (P(xj,)−λ) + k j=1 (Q(xj, )−λ) +2⎞ ⎠. Since U,xj, (x)≤Ce−√α|x−xj, | ,V,xj, (x)≤Ce−√α|x−xj, | , by the similar argument as (2.43)–(2.45) we have there exists a σ>0 such that μ p+1RN⎛ ⎝( k j=1 U,xj, )p+1− k j=1 Up+1 ,xj, −p+1 2 k j=i Up ,xj, U,xi, ⎞ ⎠dx =CN k i=j e−√α|xi, −xj, | +O(N k i=j e−2(√α−σ)|xi, −xj, | ), μ p+1RN⎛ ⎝( k j=1 U,xj, )p+1− k j=1 Up+1 ,xj, −p+1 2 k j=i Up ,xj, U,xi, ⎞ ⎠dx =CN k i=j e−√α|xi, −xj, | +O(N k i=j e−2(√α−σ)|xi, −xj, | ), −2β p+1RN( k j=1 U,xj, )p+1 2( k j=1 V,xj, )p+1 2− k j=1 U p+1 2 ,xj, V p+1 2 ,xj, dx +2β p+1RN p+1 4k j=i U p−1 2 ,xj, V p+1 2 ,xi, U,x,i+ k j=i U p+1 2 ,xj, V p−1 2 ,xi, V,x,idx =CN k i=j e−√α|xi, −xj, | +O(N k i=j e−2(√α−σ)|xi, −xj, | ). 123
Applied Mathematics & Optimization (2023) 88 :4 Page 53 of 56 4 Thus, I⎛ ⎝ k j=1 U,xj, , k j=1 V,xj, ⎞ ⎠=(1 2−1 p+1)kNλ1−N 2A +CN⎛ ⎝ k j=1 (P(xj,)−λ) + k j=1 (Q(xj,)−λ) +⎞ ⎠ −CN k i=j e−√α|xi, −xj, | +O(N k i=j e−2(√α−σ)|xi, −xj, | ). Proposition 5.2 There exist positive constants C1,C2,C3and C4, such that I⎛ ⎝ k j=1 U,xj, , k j=1 V,xj, ⎞ ⎠ =1 2−1 p+1A⎛ ⎝ k j=1 Nλ p+1 p−1−N 2 jμ−2 p−1+ m j=1 Nλ p+1 p−1−N 2 jν−2 p−1⎞ ⎠ −CN k i=j e− min{√λi,√λj}|xi, −xj, | +O⎛ ⎝N k i=j e− (2min{√λi,√λj}−σ)|xi, −xj, | ⎞ ⎠ −CN m i=j e−min{√λi,√λj}|zi, −zj, | +O⎛ ⎝N m i=j e− (2min{√λi,√λj}−σ)|zi, −zj, | ⎞ ⎠ −CN k i=1 m j=1 e−min{√λi,√λj}|xi, −zj, | +O⎛ ⎝ k i=1 m j=1 e− (2min{√λi,√λj}−σ)|xi, −zj, | ⎞ ⎠ +O(N+1), where A =RNWp+1dx and σ>0is a small constant. Proof By direct computations, we have I⎛ ⎝ k j=1 U,xj,μ, k j=1 V,zj,ν⎞ ⎠ =1 2−1 p+1k j=1RNμUp+1 ,xj,μ +1 2−1 p+1m j=1RNνUp+1 ,zj,ν +1 2RN k j=1(P(x)−P(xj))U2 ,xj,μ+ m j=1(Q(x)−Q(zj))U2 ,zj,νdx 123
4Page 54 of 56 Applied Mathematics & Optimization (2023) 88 :4 +1 2RN k j=i(P(x)−P(xj))U,xj,μU,xi,μ+ m j=i (Q(x)−Q(zj))U,zj,νU,zi,νdx −μ p+1RN⎛ ⎝( k j=1 U,xj,μ)p+1− k j=1 Up+1 ,xj,μ −p+1 2 k j=i Up ,xj,μU,xi,μ⎞ ⎠dx −ν p+1RN⎛ ⎝( k j=1 U,zj,ν)p+1− k j=1 Up+1 ,zj,ν −p+1 2 k j=i Up ,zj,νU,zi,ν⎞ ⎠dx −2β p+1RN( k j=1 U,xj,μ)p+1 2( m j=1 U,zj,ν)p+1 2dx. By the definition of U,xj,μ and U,zj,ν, we get 1 2−1 p+1k j=1RN μUp+1 ,xj,μ +(1 2−1 p+1) m j=1RN νUp+1 ,zj,νdx =1 2−1 p+1k j=1 Nλ p+1 p−1−N 2 jμ−2 p−1RN Wp+1dx +1 2−1 p+1m j=1 Nλ p+1 p−1−N 2 jν−2 p−1RN Wp+1dx. By the similar arguments as (2.42), we can get 1 2RN k j=1(P(x)−P(xj))U2 ,xj,μ+ m j=1(Q(x)−Q(zj))U2 ,zj,νdx +1 2RN k j=i(P(x)−P(xj))U,xj,μU,xi,μ+ m j=i (Q(x)−Q(zj))U,zj,νU,zi,νdx =CN⎛ ⎝ k i=j (P(xi)−P(xj)) + m i=j (Q(xi)−Q(xj)) +⎞ ⎠=O(N+1). Since U,xj,μ ≤Ce−√λi|x−xj| ,U,zj,ν ≤Ce−√λi|x−zj| , where λi=P(xi), λi= Q(zi), by the similar arguments as (2.43)–(2.45), we have μ p+1RN⎛ ⎝( k j=1 U,xj,μ)p+1− k j=1 Up+1 ,xj,μ −p+1 2 k j=i Up ,xj,μU,xi,μ⎞ ⎠dx =CN k i=j e− min{√λi,√λj}|xi−xj| +O⎛ ⎝N k i=j e− (2min{√λi,√λj}−σ)|xi−xj| ⎞ ⎠, 123
Applied Mathematics & Optimization (2023) 88 :4 Page 55 of 56 4 ν p+1RN⎛ ⎝( k j=1 U,zj,ν)p+1− k j=1 Up+1 ,zj,ν −p+1 2 k j=i Up ,zj,νU,zi,ν⎞ ⎠dx =CN m i=j e−min{√λi,√λj}|zi−zj| +O⎛ ⎝N m i=j e− (2min{√λi,√λj}−σ)|zi−zj| ⎞ ⎠, 2β p+1RN( k j=1 U,xj,μ)p+1 2( m j=1 U,zj,ν)p+1 2dx =CN k i=1 m j=1 e−min{√λi,√λj}|xi−zj| +O⎛ ⎝ k i=1 m j=1 e− (2min{√λi,√λj}−σ)|xi−zj| ⎞ ⎠. Thus, by the above computations, we obtain the desired conclusions. References 1. Alotaibi, T., Jleli, M., Samet, B., Vetro, C.: First and second critical exponents for an inhomogeneous Schrödinger equation with combined nonlinearities. Z. Angew. Math. Phys. 73, 17 (2022). https://doi. org/10.1007/s00033-022-01784-y 2. Bartsch, T., Soave, N.: A natural constraint approach to normalized solutions of nonlinear Schrödinger equations and systems. J. Funct. Anal. 272, 4304–4333 (2017) 3. Bartsch, T., Soave, N.: Multiple normalized solutions for a competing system of Schrödinger equations. Calc. Var. Partial Differ. Equ. 58, 22–24 (2019) 4. Bartsch, T., Wang, Z., Wei, J.: Bound states for a coupled Schrödinger system. J. Fixed Point Theory Appl. 2, 353–367 (2007) 5. Bartsch, T., Dancer, N., Wang, Z.: A Liouville theorem, a-priori bounds, and bifurcating branches of positive solutions for a nonlinear elliptic system. Calc. Var. Partial Differ. Equ. 2, 345–361 (2010) 6. Benboubke, M.B., et al.: Entropy solutions for elliptic Schrödinger type equations under Fourier boundary conditions. Rend. Circ. Mat. Palermo II Ser. (2022). https://doi.org/10.1007/s12215-02200822-y 7. Berestycki, H., Terracini, S., Wang, K., Wei, J.: On entire solutions of an elliptic system modeling phase seperations. Adv. Math. 243, 102–126 (2013) 8. Cao, D., Noussair, E.S.: Multiplicity of positive and nodal solutions for nonlinear elliptic problems in RN. Ann. Inst. Henri Poincaré Analyse Non Linéaire 13, 567–588 (1996) 9. Cao, D., Noussair, E.S., Yan, S.: Existence and uniqueness results on single-peaked solutions of a semilinear problem. Ann. Inst. Henri Poincaré, Analyse Non Linéaire 15, 73–111 (1998) 10. Cao, D., Noussair, E.S., Yan, S.: Solutions with multiple “peaks” for nonlinear elliptic equations. Proc. R. Soc. Edinb. Sect. A 129, 235–264 (1999) 11. Floer, A., Weinstein, A.: Nonspreading wave packets for the cubic Schrödinger equation with a bounded potential. J. Funct. Anal. 69, 397–408 (1986) 12. Goubet, O., Manoubi, I.: Standing waves for semilinear Schrödinger equations with discontinuous dispersion. Rend. Circ. Mat. Palermo II Ser 71, 11591171 (2022). https://doi.org/10.1007/s12215022-00782-3 13. Guo, Y., Li, B., Wei, J.: Entire nonradial solutions for non-cooperative coupled elliptic system with critical exponent in R3.J.Differ.Equ.256, 3463–3495 (2014) 14. Guo, Y., Luo, S., Zou, W.: The existence, uniqueness and nonexistence of the ground state to the N-coupled Schrödinger systems in R4(n≤4). Nonlinearity 31, 314–339 (2018) 123
4Page 56 of 56 Applied Mathematics & Optimization (2023) 88 :4 15. He, Q., Peng, S., Peng, Y.: Existence, non-degeneracy of proportional positive solutions and least energy solutions for a fractional elliptic system. Adv. Differ. Equ. 22, 867–892 (2017) 16. Kwong, M.: Uniqueness of positive solutions of u−u+up=0inRn. Arch. Ration. Mech. Anal. 105, 243–266 (1989) 17. Lin, T., Wei, J.: Ground state of Ncoupled nonlinear Schrödinger equations in Rn,n≤3. Commun. Math. Phys. 255, 629–653 (2005) 18. Lin, T., Wei, J.: Spikes in two coupled nonlinear Schrödinger equations. Ann. Inst. H. Poincaré Analyse Non Linéaire 22, 403–439 (2005) 19. Lin, T., Wei, J.: Spikes in two-component systems of nonlinear Schrödinger equations with trapping potential. J. Differ. Equ. 229, 538–569 (2006) 20. Long, W., Tang, Z., Yang, S.: Many synchronized vector solutions for a Bose–Einstein system. Proc. R. Soc. Edinb. Sect. A 150, 3293–3320 (2020) 21. Noussair, E., Yan, S.: On positive multipeak solutions of nonlinear elliptic problem. J. Lond. Math. Soc. 62, 213–227 (2000) 22. Peng, S., Pi, H.: Spike vector solutions for some coupled nonlinear Schrödinger equations. Discrete Contin. Dyn. Syst. 36, 2205–2227 (2016) 23. Peng, S., Wang, Z.: Segregated and synchronized vector solutions for nonlinear Schrödinger systems. Arch. Rational. Mech. Anal. 208, 305–339 (2013) 24. Peng, S., Peng, Y., Wang, Z.: On critical systems with Sobolev critical growth. Calc. Var. Partial Differ. Equ. 55, 142 (2016) 25. Peng, S., Wang, Q., Wang, Z.: On coupled nonlinear Schrödinger systems with mixed couplings. Trans. Am. Math. Soc. 371, 7559–7583 (2019) 26. Sirakov, B.: Least energy solitary waves for a system of nonlinear Schrödinger equations in Rn. Commun. Math. Phys. 271, 199–221 (2007) 27. Tang, Z., Xie, H.: Multi-scale spike solutions for nonlinear coupled elliptic systems with critical frequency. Nonlinear Differ. Equ. Appl. 28, 25 (2021) 28. Wei, J., Weth, T.: Nonradial symmetric bound states for a system of two coupled Schrödinger equations. Rend. Lincei Mat. Appl. 18, 279–293 (2007) 29. Wei, J., Weth, T.: Radial solutions and phase separation in a system of two Schrödinger equations. Arch. Ration. Mech. Anal. 190, 83–106 (2008) 30. Wei, J., Wu, Y.: Ground state of nonlinear Schrödinger systems with mixed couplings. J. Math. Pures Appl. 141, 50–88 (2020) 31. Wei, J., Yan, S.: Infinitely many solutions for the prescribed scalar curvature problem on Sn.J.Funct. Anal. 258, 3048–3081 (2010) 32. Wei, J., Yan, S.: Infinitely many solutions for the nonlinear Schrödinger equations in RN. Calc. Var. Partial Differ. Equ. 37, 423–439 (2010) 33. Wei, J., Yao, W.: Uniqueness of positive solutions to some coupled nonlinear Schrödinger equations. Commun. Pure Appl. Anal. 11, 1003–1011 (2012) 34. Zhen, M., Zhang, B., R˘adulescu, V.: Normalized solutions for nonlinear coupled fractional systems: low and high perturbations in the attractive case. Discrete Contin. Dyn. Syst. 41, 2653–2676 (2021) Publisher’s Note Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations. 123