Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedjudge pass (gpt-6-luna)
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 d≥1, let Ω⊂Rd be a fixed closed cube with positive side length, let σ>0, and let kσ(x,z)=exp⁡(−∥x−z∥22/(2σ2)) with real RKHS Hσ. Fix h∗∈Hσ, and let x1,x2,… be an iid sequence uniform on Ω. For every n≥3, set yi=h∗(xi) for 1≤i≤n. There exist constants A,B>0 and n0, depending only on d,Ω,σ, such that for every n≥n0, with probability at least 1−1/n, every h∈Hσ that interpolates the same data, h(xi)=yi for 1≤i≤n, satisfies sup⁡x∈Ω∣h(x)−h∗(x)∣≤Aexp⁡ ⁣(−B(nlog⁡n)1/d)(∥h∗∥Hσ+∥h∥Hσ).

Facts & Assumptions

Given: Countable Choice, the Gaussian RKHS Hσ, target h∗, and iid uniform sample from the Statement.

[A1]

The Axiom of Countable Choice says every countable sequence of nonempty sets has a choice function (The Axiom of Countable Choice (ACω)).

[F1]

The Gaussian radial function is a real positive semidefinite kernel (The Gaussian radial kernel is positive semidefinite).

[F2]

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).

[F3]

A real RKHS has sections kx=k(⋅,x) and satisfies ⟨f,kx⟩=f(x) for every function f in that space (Positive semidefinite kernels and reproducing kernel Hilbert spaces).

[F4]

The Gaussian power function has the stated bound (Gaussian RKHS power function decays exponentially with inverse fill distance).

[F5]

An iid uniform sample on a fixed product cube has Euclidean fill distance at most CdL(log⁡n/n)1/d with probability at least 1−1/n (Uniform samples have logarithmic fill-distance rate on a cube).

[F6]

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).

[F7]

Under Countable Choice, an invertible linear map with matrix Q sends Lebesgue measurable sets to measurable sets and multiplies their measure by ∣det⁡Q∣>0; translations preserve measurability and measure (A linear map T of Rn sends Lebesgue measurable sets to Lebesgue measurable sets, with λn(T[E])=∣det⁡T∣ λ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).

Proof

1.1givenA1F1F2F3F4F6algebra

By [A1], [F1], and [F2], the Gaussian kernel has the real RKHS used in the Statement, with evaluation property [F3]. Let Xn={x1,…,xn} and Vn=span⁡{kσ(⋅,xi):1≤i≤n}. For any interpolant h, put g=h−h∗. Then g(xi)=0, so [F3] gives ⟨g,kσ(⋅,xi)⟩=0 for each i and hence g⊥Vn. By [F6] the projection ΠVn exists; therefore g(x)=⟨g,kσ(⋅,x)⟩=⟨g,kσ(⋅,x)−ΠVnkσ(⋅,x)⟩. The inner-product Cauchy--Schwarz inequality follows by expanding ∥u−tv∥2≥0 and minimizing over real t (with the zero-vector case immediate). Thus ∣g(x)∣≤∥g∥HσPXn(x).

2.1givenstep 1.1algebra

The triangle inequality gives ∥g∥Hσ≤∥h∥Hσ+∥h∗∥Hσ. Taking the supremum in step 1.1 yields sup⁡x∈Ω∣h(x)−h∗(x)∣≤(∥h∥Hσ+∥h∗∥Hσ)sup⁡x∈ΩPXn(x).

3.1givenA1F4F5F7step 2.1algebra∎

Write Ω=v+Q[0,L]d using its side length L>0 and an orthogonal matrix Q, and put ui=QT(xi−v). The affine map F(u)=v+Qu bijects the product cube C0=[0,L]d onto Ω. For every Borel E⊆C0, [F7] gives P(ui∈E)=λd(F(E))/λd(Ω)=∣det⁡Q∣λd(E)/(∣det⁡Q∣λd(C0))=λd(E)/λd(C0). The transformed samples remain independent: for finitely many Borel sets Ei⊆C0, their joint event is ⋂i{xi∈F(Ei)}, and independence of the xi makes its probability the product of the individual probabilities. These events are measurable since F is a homeomorphism. Also ∥F(u)−F(w)∥2=∥u−w∥2, so the fill distance of {u1,…,un} in C0 equals hXn in Ω. By [F5], on an event of probability at least 1−1/n, the fill distance hXn is at most hˉn=CdL(log⁡n/n)1/d. For all sufficiently large n, hˉn<min⁡(h0,e−1); the function u↦∣log⁡u∣/u is decreasing on (0,e−1], so [F4] applies and gives sup⁡xPXn(x)≤Cexp⁡ ⁣(−c∣log⁡hXn∣hXn)≤Cexp⁡ ⁣(−chˉn)=Cexp⁡ ⁣(−cCdL(nlog⁡n)1/d). Using this bound in step 2.1 proves the displayed estimate with A=C and B=c/(CdL), uniformly for every interpolant on that event.

Depends on

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