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.
Noiseless Gaussian RKHS interpolation error under uniform sampling
Statement
Assume the Axiom of Countable Choice. Let , let be a fixed closed cube with positive side length, let , and let with real RKHS . Fix , and let be an iid sequence uniform on . For every , set for . There exist constants and , depending only on , such that for every , with probability at least , every that interpolates the same data, for , satisfies
Statement references
Facts & Assumptions
Given: Countable Choice, the Gaussian RKHS , target , and iid uniform sample from the Statement.
The Axiom of Countable Choice says every countable sequence of nonempty sets has a choice function (The Axiom of Countable Choice ()).
The Gaussian radial function is a real positive semidefinite kernel (The Gaussian radial kernel is positive semidefinite).
Under Countable Choice, a real positive semidefinite kernel has a canonical RKHS with the stated reproducing property (A positive semidefinite kernel has a canonical reproducing kernel Hilbert space under countable choice).
A real RKHS has sections and satisfies for every function in that space (Positive semidefinite kernels and reproducing kernel Hilbert spaces).
The Gaussian power function has the stated bound (Gaussian RKHS power function decays exponentially with inverse fill distance).
An iid uniform sample on a fixed product cube has Euclidean fill distance at most with probability at least (Uniform samples have logarithmic fill-distance rate on a cube).
Every finite-dimensional subspace of a real inner-product space admits an orthogonal projection (Projection onto a finite-dimensional subspace of an arbitrary real inner-product space).
Under Countable Choice, an invertible linear map with matrix sends Lebesgue measurable sets to measurable sets and multiplies their measure by ; translations preserve measurability and measure (A linear map of sends Lebesgue measurable sets to Lebesgue measurable sets, with when is invertible and Lebesgue null when it is not, Lebesgue outer measure, Lebesgue measurability and Lebesgue measure are unchanged by translation).
Proof
By [A1], [F1], and [F2], the Gaussian kernel has the real RKHS used in the Statement, with evaluation property [F3]. Let and . For any interpolant , put . Then , so [F3] gives for each and hence . By [F6] the projection exists; therefore The inner-product Cauchy--Schwarz inequality follows by expanding and minimizing over real (with the zero-vector case immediate). Thus .
The triangle inequality gives . Taking the supremum in step 1.1 yields
Write using its side length and an orthogonal matrix , and put . The affine map bijects the product cube onto . For every Borel , [F7] gives . The transformed samples remain independent: for finitely many Borel sets , their joint event is , and independence of the makes its probability the product of the individual probabilities. These events are measurable since is a homeomorphism. Also , so the fill distance of in equals in . By [F5], on an event of probability at least , the fill distance is at most . For all sufficiently large , ; the function is decreasing on , so [F4] applies and gives Using this bound in step 2.1 proves the displayed estimate with and , uniformly for every interpolant on that event.
Depends on
- Positive semidefinite kernels and reproducing kernel Hilbert spaces
- The Gaussian radial kernel is positive semidefinite
- The Axiom of Countable Choice ($\mathrm{AC}_\omega$)
- A positive semidefinite kernel has a canonical reproducing kernel Hilbert space under countable choice
- Projection onto a finite-dimensional subspace of an arbitrary real inner-product space
- Uniform samples have logarithmic fill-distance rate on a cube
- A linear map $T$ of $\mathbb{R}^n$ sends Lebesgue measurable sets to Lebesgue measurable sets, with $\lambda_n(T[E])=|\det T|\,\lambda_n(E)$ when $T$ is invertible and $T[E]$ Lebesgue null when it is not
- Lebesgue outer measure, Lebesgue measurability and Lebesgue measure are unchanged by translation
- Gaussian RKHS power function decays exponentially with inverse fill distance
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
67 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
- Belkin, Hsu, Ma, and Mandal, Reconciling modern machine learning practice and the bias-variance trade-off (standard reference, not scraped)
- Rieger and Zwicknagl, Sampling inequalities for infinitely smooth functions, with applications to interpolation and machine learning (standard reference, not scraped)