How statement and proof provenance work
The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.
- Literature-sourced: the exact statement appears in a cited source; only wording and notation differ.
- AI-adapted: a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
- AI-generated: a genuinely novel statement formulated by AI, with no source for the claim itself.
These labels describe origin, not correctness: citations and verification chips remain separate evidence.
Native Matérn interpolation is an orthogonal projection with power function
Statement
Assume full AC conservatively for the declared Hilbert projection dependencies. Let be distinct and nonempty, and let be the restricted Matérn native RKHS. For every , the unique kernel interpolant is the orthogonal projection of onto . Define where is that projection. Then for every , where and .
Facts & Assumptions
Given: Full AC, a finite nonempty distinct site list , and .
The restricted native space is a Hilbert RKHS; its kernel sections reproduce evaluation and its norm is the quotient native norm. (The restricted Matérn native space is the Sobolev quotient space)
The Matérn Gram matrix on distinct sites is strictly positive definite, hence invertible; . (The Matérn native space has its weighted Fourier norm and strict Gram positivity, The Matérn spectral integral, normalization, and radial formula)
Finite-dimensional subspaces of a Hilbert space are closed, orthogonal projection is self-adjoint and contractive, and orthogonal residuals satisfy Pythagoras. (Orthogonal decomposition by a closed subspace, Hilbert projections are linear, self-adjoint and contractive)
Cauchy--Schwarz holds in every real or complex inner-product space. (Cauchy–Schwarz: , with equality exactly for dependent pairs)
Full AC is carried conservatively for the projection suppliers' declared choice branch. (The Axiom of Choice, The Axiom of Countable Choice ())
Proof technique: Hilbert projection and Cauchy--Schwarz.
Proof
Given: The hypotheses above.
The span has finite dimension and is therefore closed. Let be the orthogonal projection of onto . For each site , the residual is orthogonal to ; by reproduction [F1], . Thus interpolates the data. Its coefficients solve , which has a unique solution by [F2], so it is the unique kernel interpolant.
Put . Self-adjointness of and reproduction give Cauchy--Schwarz [F4] yields by contractivity of the orthogonal projection.
The projection of has the form . Reproduction and orthogonality at all sites give , so by [F2]. Expanding the squared residual norm and using this equation gives It is nonnegative because it is a squared norm.
Depends on
- Radial kernels, polynomial augmentation, and site geometry
- The normalized Matérn kernel in the 2π Fourier convention
- Fourier Bessel-potential and restriction-quotient Sobolev spaces
- Strict positive and conditionally positive augmented interpolation systems are invertible
- The Matérn spectral integral, normalization, and radial formula
- The Matérn native space has its weighted Fourier norm and strict Gram positivity
- The restricted Matérn native space is the Sobolev quotient space
- Orthogonal decomposition by a closed subspace
- Hilbert projections are linear, self-adjoint and contractive
- Cauchy–Schwarz: $|\langle x,y\rangle|\le\|x\|\,\|y\|$, with equality exactly for dependent pairs
- The Axiom of Choice
- The Axiom of Countable Choice ($\mathrm{AC}_\omega$)
Used by
Dependency tree · two levels
58 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.
Sources
- Rasmussen and Williams, Gaussian Processes for Machine Learning, Chapter 4, equations (4.5)–(4.8) (standard reference, not scraped)
- Gregory E. Fasshauer, MATH 590: Meshfree Methods, Chapter 13, pp. 18–25 (standard reference, not scraped)