For a densely defined closed operator , define its lower normThe closed-range theorem givesThereforeand
We next show that is accessible through the matrix-entry evaluations. Put and defineBecause the canonical span is a core for both operators,
For fixed and grid point , formIts entries belong to . The smallest singular value of increases as to . Applying the same construction to the conjugate-transposed entries gives . Thus two nested finite-matrix limits determine .
The assumed gap continuity of and the identitymake the corresponding lower-norm tests stable under movement of . The rational grids become dense on every bounded disk. Hence an arithmetic algorithm can, on , use the two finite-section levels above and a vanishing rational tolerance to output all grid cells certified byTaking their closures and letting the mesh and tolerance vanish converges in the Attouch--Wets topology toThe strict existential inequality requires two nested limits, with approximants entering from the prescribed side. In the notation of the arithmetic hierarchy this proves
For the spectrum, equality to zero is the countable intersectionUse the preceding two-level pseudospectral procedure with threshold , and add an outer limit . Outer approximants remove every point with positive lower norm, while gap continuity and density of the grids retain every zero. Truncating to expanding disks and using vanishing mesh again gives Attouch–Wets convergence. The universal outer intersection reverses the one-sided classification and adds one level, proving
Articles by others on the same topic
There are currently no matching articles.