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.
Positive semidefinite kernels and reproducing kernel Hilbert spaces
Definition
A real kernel on a set is a function . It is positive semidefinite if it is symmetric and, for every integer , every , and every ,
A real reproducing kernel Hilbert space with kernel is a real Hilbert space of functions such that, for each , the section lies in and for every . Consequently .
For the canonical construction, let be the real vector space of finitely supported functions , write for the function supported at with value , and put
Let . Under the Axiom of Countable Choice, the canonical space is formed by giving its induced inner product and taking a norm completion; the image of is denoted . For an element of that completion, its associated function is . The quotient, completed inner product, and function identification are justified by the local construction theorem.
Depends on
Used by
- Hard- and soft-margin support-vector machines with an unpenalized bias Definition
- Regularized kernel prediction system Definition
- A training Gram matrix does not determine a test prediction Example
- Linear and polynomial kernels as finite feature inner products Example
- The Gaussian radial kernel is positive semidefinite Example
- A finite positive semidefinite kernel Gram matrix has a Euclidean feature factorization Lemma
- Gaussian RKHS power function decays exponentially with inverse fill distance Lemma
- Statistical and numerical limits of finite kernel solve guarantees Remark
- A finite positive-definite kernel flow converges for an attained convex cost Theorem
- A positive semidefinite kernel has a canonical reproducing kernel Hilbert space under countable choice Theorem
- Finite-sample representer theorem when a minimizer exists Theorem
- Noiseless Gaussian RKHS interpolation error under uniform sampling Theorem
- The kernel ridge system uniquely minimizes the mean-square RKHS objective Theorem
Dependency tree · two levels
18 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
- Hastie, Tibshirani, and Friedman, The Elements of Statistical Learning, 2nd ed., corrected 12th printing (standard reference, not scraped)
- Rasmussen and Williams, Gaussian Processes for Machine Learning (standard reference, not scraped)