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.
Matérn interpolation and its power function converge at rate h^ν
Statement
Assume full AC conservatively for the Hilbert projection and weighted- suppliers. Fix arbitrary , , , , the normalized Matérn kernel of The normalized Matérn kernel in the 2π Fourier convention, and an admitted uniform-cone domain . There are constants , depending only on and the domain's cone constants, such that for every finite nonempty distinct site set with fill distance and every , Here and are the native interpolant and power function of Native Matérn interpolation is an orthogonal projection with power function. The rate requires no mesh-ratio bound. The constants are uniform over site sets satisfying the fill-distance condition.
Facts & Assumptions
Given: Full AC, the fixed kernel and domain, a finite distinct set , its fill distance , and .
The restricted native norm and restriction-quotient Sobolev norm satisfy . (The restricted Matérn native space is the Sobolev quotient space)
A Sobolev function vanishing on obeys on the uniform-cone domain, without a separation assumption. (A Sobolev function vanishing on scattered sites has an h^ν bound)
Native interpolation is an orthogonal projection, its residual vanishes on , and its pointwise error is bounded by times the native norm. (Native Matérn interpolation is an orthogonal projection with power function)
The Cauchy-sequence reals have the least-upper-bound property and are a complete ordered field; hence the Archimedean theorem supplies an integer for the fixed real . (The Cauchy-sequence reals have the least-upper-bound property, Every complete ordered field is Archimedean)
Full AC is carried conservatively for the inherited Hilbert-space suppliers; the estimate makes no additional choice from an indexed family. (The Axiom of Choice, The Axiom of Countable Choice ())
Proof technique: apply the zeros estimate to the native projection residual.
Proof
Given: The hypotheses above.
By [F4] choose an integer and apply the zeros estimate [F2] with this fixed . Regard as an element of the same set of continuous restrictions using [F1], and let . By [F3], and . Therefore [F1] and [F2] give This is the first estimate.
Fix and set , so . Self-adjointness and reproduction in [F3] give . The bound in [F3] shows that this residual evaluation functional has norm at most . If , it is the zero functional and its norm is . If , the unit vector satisfies , so the functional norm is exactly . Applying step 1.1 to every of native norm at most one therefore gives , uniformly in ; taking the supremum proves the second estimate. The constant does not depend on except through the upper bound on , and no mesh ratio entered either [F2] or this argument.
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
- The restricted Matérn native space is the Sobolev quotient space
- A Sobolev function vanishing on scattered sites has an h^ν bound
- Native Matérn interpolation is an orthogonal projection with power function
- The Cauchy-sequence reals have the least-upper-bound property
- Every complete ordered field is Archimedean
- The Axiom of Choice
- The Axiom of Countable Choice ($\mathrm{AC}_\omega$)
Used by
Dependency tree · two levels
43 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
- Narcowich, Ward, and Wendland, Sobolev bounds on functions with scattered zeros, Math. Comp. 74 (2005), Theorem 1.1 and §§2.1–2.2 (standard reference, not scraped)
- Gregory E. Fasshauer, MATH 590: Meshfree Methods, Chapter 13, pp. 34–36 (standard reference, not scraped)