Finite-Rank RKHS Detector Completeness
Abstract
We construct an explicit finite-rank reproducing-kernel detector for the model space associated with a finite Blaschke packet . The principal observation is that the Gram matrix of the reproducing kernels at distinct packet points is a Cauchy-type matrix and is therefore nonsingular: in fact is, up to a positive multiplicative factor, the squared modulus of a generic Cauchy determinant .
Nondegeneracy of yields a - family of evaluation functionals that separates every nonzero vector of . We lift this finite-rank detector to a candidate inhabitant of the interface used by the Burnol/Blaschke no-phantom programme, and isolate the residual completion obstruction in a paired module. The argument is purely finite Hardy-space theory: it neither invokes Nyman density nor any equivalent of the Riemann hypothesis.
Artifacts
Vol6.FiniteRankDetectorhaskell/paper-02-finite-rank-detector/Main.hsVol6.Obstruction.FiniteRankDetectorObstructionStatus & Obstructions
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.