Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedprecheck passjudge 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.

Native Matérn interpolation is an orthogonal projection with power function

Statement

Assume full AC conservatively for the declared Hilbert projection dependencies. Let X=(x1,…,xN)⊂Ω be distinct and nonempty, and let Hk(Ω) be the restricted Matérn native RKHS. For every f∈Hk(Ω), the unique kernel interpolant sXf=∑jcjk(⋅−xj) is the orthogonal projection of f onto VX=span⁡{k(⋅−xj):1≤j≤N}. Define PX(x)=∥(I−ΠX)k(⋅−x)∥Hk(Ω), where ΠX is that projection. Then for every x∈Ω, ∣f(x)−sXf(x)∣≤PX(x)∥f∥Hk(Ω),PX(x)2=k(0)−kX(x)∗KX−1kX(x)≥0. where KX=(k(xi−xj)) and kX(x)=(k(xi−x))i=1N.

Facts & Assumptions

Given: Full AC, a finite nonempty distinct site list X⊂Ω, and f∈Hk(Ω).

[F1]

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)

[F2]

The Matérn Gram matrix on distinct sites is strictly positive definite, hence invertible; k(0)=1. (The Matérn native space has its weighted Fourier norm and strict Gram positivity, The Matérn spectral integral, normalization, and radial formula)

[F3]

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)

[A1]

Full AC is carried conservatively for the projection suppliers' declared choice branch. (The Axiom of Choice, The Axiom of Countable Choice (ACω))

Proof technique: Hilbert projection and Cauchy--Schwarz.

Proof

technique · Hilbert projection and Cauchy--Schwarz

Given: The hypotheses above.

1.1F1F2F3A1

The span VX has finite dimension and is therefore closed. Let ΠXf be the orthogonal projection of f onto VX. For each site xi, the residual is orthogonal to k(⋅−xi); by reproduction [F1], (f−ΠXf)(xi)=0. Thus ΠXf interpolates the data. Its coefficients solve KXc=(f(xi))i, which has a unique solution by [F2], so it is the unique kernel interpolant.

2.1F1F3F4step 1.1algebra

Put e=f−sXf=(I−ΠX)f. Self-adjointness of I−ΠX and reproduction give e(x)=⟨e,k(⋅−x)⟩=⟨e,(I−ΠX)k(⋅−x)⟩. Cauchy--Schwarz [F4] yields ∣e(x)∣≤∥e∥PX(x)≤∥f∥PX(x) by contractivity of the orthogonal projection.

3.1F1F2F3step 1.1algebra∎

The projection of k(⋅−x) has the form ∑jvjk(⋅−xj). Reproduction and orthogonality at all sites give KXv=kX(x), so v=KX−1kX(x) by [F2]. Expanding the squared residual norm and using this equation gives PX(x)2=∥k(⋅−x)∥2−∥ΠXk(⋅−x)∥2=k(0)−kX(x)∗KX−1kX(x). It is nonnegative because it is a squared norm.

Depends on

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