Skip to main content

Write a PREreview

Degeneracy of the Operator-Valued Poisson Kernel Near the Numerical Range Boundary

Posted
Server
Preprints.org
DOI
10.20944/preprints202602.0563.v1

Let $A\in\C^{d\times d}$ and let W(A)W(A) denote its numerical range. For a bounded convex domain $\Omega\subset\C$ with C1C^1 boundary containing $\spec(A)$, consider the operator-valued boundary kernel \[ P_{\Omega}(\sigma,A)\;:=\;\Real\!\Bigl(n_{\Omega}(\sigma)\,(\sigma\Id-A)^{-1}\Bigr), \qquad \sigma\in\partial\Omega, \] where nΩ(σ)n_{\Omega}(\sigma) is the outward unit normal at σ\sigma. For convex Ω\Omega with W(A)ΩW(A)\subset\Omega this kernel is strictly positive definite on Ω\partial\Omega and underlies boundary-integral functional calculi on convex domains. We analyze the opposite limiting regime ΩW(A)\Omega\downarrow W(A). Along any C1C^1 convex exhaustion ΩεW(A)\Omega_\varepsilon\downarrow W(A), if σεΩε\sigma_\varepsilon\in\partial\Omega_\varepsilon approaches σ0W(A)\sigma_0\in\partial W(A) with convergent outward normals and $\sigma_0\notin\spec(A)$, then λmin(PΩε(σε,A))0\lambda_{\min}(P_{\Omega_\varepsilon}(\sigma_\varepsilon,A))\to 0 and the corresponding min-eigenvectors converge (up to subsequences and phases) to the canonical subspace $(\sigma_0\Id-A)\mathcal M(n)$ determined by the maximal eigenspace of $H(n)=\Real(\overline{n}A)$. Quantitatively, we obtain two-sided bounds in terms of an explicit support-gap scalar, yielding a linear degeneracy rate under bounded-resolvent hypotheses and an explicit rate for outer offsets W(A)+εDW(A)+\varepsilon\mathbb{D}. For normal matrices we compute the eigenvalues of PΩ(σ,A)P_{\Omega}(\sigma,A) explicitly, showing that degeneracy may fail at spectral support points unless the supporting face contains multiple eigenvalues.

You can write a PREreview of Degeneracy of the Operator-Valued Poisson Kernel Near the Numerical Range Boundary. A PREreview is a review of a preprint and can vary from a few sentences to a lengthy report, similar to a journal-organized peer-review report.

Before you start

We will ask you to log in with your ORCID iD. If you don’t have an iD, you can create one.

What is an ORCID iD?

An ORCID iD is a unique identifier that distinguishes you from everyone with the same or similar name.

Start now