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.
The restricted Matérn native space is the Sobolev quotient space
Statement
Assume full AC conservatively for the declared Hilbert projection dependency. Fix the Matérn kernel of The normalized Matérn kernel in the 2π Fourier convention on a nonempty domain of Radial kernels, polynomial augmentation, and site geometry. Let . The restricted native space is the quotient with infimal extension norm, and it is the reproducing-kernel Hilbert space of . Its norm is equivalent to the restriction-quotient norm of : for constants depending only on , No extension theorem or intrinsic fractional-domain norm is asserted.
Facts & Assumptions
Given: Full AC, fixed Matérn parameters, a nonempty domain , and the quotient definitions above.
The whole-space Matérn native space and have the same representatives and equivalent norms with constants . (The Matérn native space has its weighted Fourier norm and strict Gram positivity)
Point evaluations are continuous in the whole-space native norm; each section reproduces evaluation and the sections centered in span densely. (The Matérn native space has its weighted Fourier norm and strict Gram positivity)
A closed subspace of a Hilbert space has a closed orthogonal complement, each vector has a unique orthogonal projection, and the quotient by the subspace is isometric to that complement. (Orthogonal decomposition by a closed subspace, Hilbert projections are linear, self-adjoint and contractive)
Full AC is included to match the conservative dependency branch of [F3] and the published completeness supplier; no family of extensions is selected. (The Axiom of Choice, The Axiom of Countable Choice ())
Proof
Given: The hypotheses and notation of the Statement.
The set is a linear subspace. If converges to in native norm, then for each , [F2] gives ; hence and . Thus is closed.
By [F3], each equivalence class modulo has a unique representative in , namely its orthogonal projection onto that complement; its norm is the infimum of the norms of all extensions because adding an element of changes only the nullspace component. Therefore the restriction quotient is a Hilbert space isometric to .
For , the section lies in : for every , by reproduction [F2]. Its induced quotient element therefore represents the restricted kernel section, and it reproduces evaluation of each restricted function at .
If is orthogonal to every with , then [F2] gives for all , so . Thus . The restricted kernel sections span densely in , which proves that the quotient is exactly the RKHS of the restricted kernel.
Every extension of satisfies by [F1]. Taking the infimum over the same set of extensions on both sides gives .
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 Matérn native space has its weighted Fourier norm and strict Gram positivity
- Orthogonal decomposition by a closed subspace
- Hilbert projections are linear, self-adjoint and contractive
- The Axiom of Choice
- The Axiom of Countable Choice ($\mathrm{AC}_\omega$)
Used by
- Matérn interpolation and its power function converge at rate h^ν Theorem
- Native Matérn interpolation is an orthogonal projection with power function Theorem
Cited to discharge well-definedness by Fourier Bessel-potential and restriction-quotient Sobolev spaces.
Dependency tree · two levels
40 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
- Gregory E. Fasshauer, MATH 590: Meshfree Methods, Chapter 13, pp. 18–25 and 34–36 (standard reference, not scraped)
- Narcowich, Ward, and Wendland, Sobolev bounds on functions with scattered zeros, Math. Comp. 74 (2005), §§2.1–2.2 (standard reference, not scraped)