Optimal boundary gradient estimates for the insulated conductivity problem

TL;DR

This paper establishes that the boundary gradient of solutions to the insulated conductivity problem with Neumann boundary conditions blows up at a rate of ^{-1/2} as the insulating inclusion approaches the boundary in dimensions 3 or higher, revealing a sharp contrast with interior estimates.

Contribution

The paper proves the optimal blow-up rate of the boundary gradient is ^{-1/2} in dimensions 3 and higher, filling a gap in understanding the boundary behavior in the insulated conductivity problem.

Findings

Gradient blow-up rate is ^{-1/2} in dimensions 3 and above.

Gradient remains bounded for the Dirichlet boundary problem.

New techniques overcome difficulties related to boundary data influence.

Abstract

In this paper we study the boundary gradient estimate of the solution to the insulated conductivity problem with the Neumann boundary data when a convex insulating inclusion approaches the boundary of the matrix domain. The gradient of solutions may blow up as the distance between the inclusion and the boundary, denoted as $\varepsilon$, approaches to zero. The blow up rate was previously known to be sharp in dimension $n=2$ (see Ammari et al.\cite{AKLLL}). However, the sharp rates in dimensions $n\geq3$ are still unknown. In this paper, we solve this problem by establishing upper and lower bounds on the gradient and prove that the optimal blow up rates of the gradient are always of order $\epsilon^{-1/2}$ for general strictly convex inclusions in dimensions $n\geq3$. Several new difficulties are overcome and the impact of the boundary data on the gradient is specified. This result highlights a significant difference in blow-up rates compared to the interior estimates in recent works (\cites{LY,Weinkove,DLY,DLY2,LZ}), where the optimal rate is $\epsilon^{-1/2+\beta(n)}$, with $\beta(n)\in(0,1/2)$ varying with dimension $n$. Furthermore, we demonstrate that the gradient does not blow up for the corresponding Dirichlet boundary problem.