Paper IINamed Obstructionmath.FA

Finite-Rank RKHS Detector Completeness

Abstract

We construct an explicit finite-rank reproducing-kernel detector for the model space KBP=H2/BPH2K_{B_P} = H^2/B_P H^2 associated with a finite Blaschke packet P={w1,,wn}DP = \{w_1,\dots,w_n\} \subset \mathbb{D}. The principal observation is that the Gram matrix Gij=kwi,kwjH2G_{ij} = \langle k_{w_i}, k_{w_j}\rangle_{H^2} of the reproducing kernels at distinct packet points is a Cauchy-type matrix and is therefore nonsingular: in fact detG\det G is, up to a positive multiplicative factor, the squared modulus of a generic Cauchy determinant i<jwiwj2/i,j(1wiwj)\prod_{i<j}|w_i - w_j|^2 / \prod_{i,j}(1 - w_i\overline{w_j}).

Nondegeneracy of GG yields a rank\operatorname{rank}-nn family of evaluation functionals that separates every nonzero vector of KBPK_{B_P}. We lift this finite-rank detector to a candidate inhabitant of the RKHSModelSpaceDetector\texttt{RKHSModelSpaceDetector} interface used by the Burnol/Blaschke no-phantom programme, and isolate the residual completion obstruction in a paired Vol6.Obstruction.FiniteRankDetectorObstruction\texttt{Vol6.Obstruction.FiniteRankDetectorObstruction} module. The argument is purely finite Hardy-space theory: it neither invokes Nyman density nor any equivalent of the Riemann hypothesis.

Artifacts

Lean 4 Module
Vol6.FiniteRankDetector
View on GitHub →
Haskell Numeric Artifact
haskell/paper-02-finite-rank-detector/Main.hs
View on GitHub →
Obstruction Module
Vol6.Obstruction.FiniteRankDetectorObstruction
View on GitHub →

Status & Obstructions

Named Obstruction Present
Named obstruction: FiniteRankDetectorObstruction

The principal theorem is conditional on inhabiting the named obstruction type. The obstruction module precisely characterizes the missing Vol5 introduction rule. No new sorry, admit, axiom, or opaque is introduced in Vol6.