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.
Radial basis and kernel interpolation
1 · Prerequisites
- Absolute and Conditional Convergence; Rearrangement; Products
- Algebraic Closure, Embeddings, and Separability
- Algebraic Extensions, Extension Degree, and Finite Fields
- Areas of Elementary Plane Figures
- Binary Operations, Monoids, Groups and Subgroups
- Bounded Linear Operators and Quotient Spaces
- Compactness
- Compactness in Metric Spaces
- Completeness, Completion, and Uniform Continuity
- Complex Coordinate and Path Transport
- Complex Differentiability and the Cauchy–Riemann Equations
- Complex Lp Spaces and Test-Function Conventions
- Complex Norms and Realification
- Complexification, Realification and Real Structures
- Composition Series, the Jordan–Hölder Theorem and Solvable Groups
- Congruences, the Integers Modulo n and the Chinese Remainder Theorem
- Connectedness
- Construction of the Natural Numbers
- Construction of the Real Numbers via Cauchy Sequences
- Construction of the Real Numbers via Dedekind Cuts
- Continuity, IVT, EVT, and Uniform Continuity
- Cosets, Index and Lagrange's Theorem
- Countability and Uncountability
- Countability Axioms and Cardinal Functions
- Cyclic Groups and Direct Products
- Darboux, L'Hôpital, and Taylor's Theorem
- Density Separability and Convolution in Lᵖ
- Determinants of Matrices over a Commutative Ring
- Diagonalisation and the Minimal Polynomial
- Distributions Test Functions and Differentiation
- Divisibility, Euclidean Domains, Principal Ideal Domains and Unique Factorisation
- Divisibility, Greatest Common Divisors and Bézout's Identity
- Dual Spaces, Bilinear and Quadratic Forms, and Sylvester's Law of Inertia
- Eigenvalues, Eigenvectors and the Characteristic Polynomial
- Filters and Ultrafilters
- Finite Counting, Factorials and Binomial Coefficients
- Finite Probability and the Probabilistic Method
- Foundations of the Real Numbers for Analysis
- Fourier Transform Convolution and Approximate Identities
- Fredholm Elliptic Problems and the Elliptic Spectrum
- Fubini and Change of Variables
- Fundamental Trigonometric Identities
- Gaussian Elimination, Elementary Matrices and Reduced Row Echelon Form
- Group Actions, Orbits, Stabilisers and Cayley's Theorem
- Group Homomorphisms and the Isomorphism Theorems
- Harmonic Functions and Mean Values in Rn
- Hilbert Space Geometry and Riesz Representation
- Ideals, Quotient Rings and the Isomorphism Theorems for Rings
- Improper and Parameter-Dependent Multiple Integrals
- Improper Integrals
- Inner Product Spaces, Gram-Schmidt, Projections and Adjoints
- Lebesgue Measure on Euclidean Space
- Limits of Real Functions
- limsup, liminf, and Subsequential Limits
- Linear Independence, Bases and Dimension
- Linear Transformations, Rank-Nullity and Quotient Spaces
- Matrices, the Matrix of a Linear Map, and Change of Basis
- Matrix Norms, Condition Numbers and Numerical Stability
- Measurable Functions and Simple Approximation
- Measures and Their Basic Properties
- Metric Spaces
- Mixed Partials, Taylor Formulae, and Extrema
- Modes of Convergence Egorov and Lusin
- Monotone Functions, Discontinuities, and Continuity Sets
- Monotone Sequences, Bolzano-Weierstrass, and Cauchy Completeness
- Normal Subgroups and Quotient Groups
- Normed and Banach Spaces
- Norming and Separation under Hahn–Banach
- Order, Zorn's Lemma, and the Axiom of Choice
- Orthonormal Bases, Parseval and Fourier Series
- Outer Measure and the Caratheodory Extension Theorem
- Partitions of Unity and Paracompactness
- Pointwise Extended-Real Function Products
- Polynomial Rings, the Division Algorithm and Roots
- Power Series and Real-Analytic Functions
- Primes, Euclid's Lemma and the Fundamental Theorem of Arithmetic
- Product Measures and the Fubini Tonelli Theorems
- Properties of the Integral and the Working FTC
- Relations, Functions, and Quotients
- Rings, Subrings, Integral Domains and Fields
- Rⁿ as a Normed Space; Vector-Valued Functions
- Roots, Rational Powers, and Classical Inequalities
- Schwartz Space and the Plancherel Theorem
- Separation Axioms: the Hierarchy
- Sequences and Limits
- Sequences and Series of Functions; Uniform Convergence
- Series: Convergence and the Nonnegative Tests
- Sigma Algebras and Borel Sets
- Simple Field Extensions and the Construction of the Complex Numbers
- Sine, Cosine, and the Definition of Pi
- Smooth Approximation and Sobolev Extension
- Smooth Partitions of Unity and Exhaustions
- Sparse Estimation and Covariance
- Splitting Fields
- Subspaces, Products, and Quotients
- Suprema and Infima
- Sylow's Theorems, p-Groups and Nilpotent Groups
- Symmetric Groups, Cycle Decomposition and the Sign Homomorphism
- The Analytic Hahn Banach Theorem
- The Cantor Set, Baire Category, and Measure Zero in ℝ
- The Complex Exponential and Euler's Formula
- The Derivative and the Mean Value Theorems
- The Determinant of a Linear Operator, Cofactors and Cramer's Rule
- The Exponential Function
- The Fundamental Theorem of Algebra
- The Fundamental Theorem of Finite Abelian Groups
- The Galois Correspondence
- The Inverse and Implicit Function Theorems
- The Lebesgue and Riemann Integrals Compared
- The Lebesgue Integral and the Convergence Theorems
- The Logarithm and General Powers
- The Lᵖ Spaces Holder Minkowski and Riesz Fischer
- The Maximal Function and Lebesgue Differentiation
- The Real Gamma and Beta Functions
- The Riemann Integral in Rᵐ and Jordan Content
- The Riemann Integral: Definition and Integrability
- The Spectral Theorem, Positive Operators and Singular Value Decomposition
- The Topology of Euclidean Space
- The Total Derivative in ℝᵐ → ℝⁿ
- The ZFC Axioms and the Basic Set Constructions
- Topological Spaces and Continuity
- Topology of ℝ
- Triangularisation, Generalised Eigenspaces and Jordan Canonical Form
- Vector Spaces, Linear Subspaces, Span and Direct Sums
- Weak Derivatives and Sobolev Spaces
2 · Summary
This page defines strict positive-definite interpolation, strict conditional-positive-definite polynomial augmentation, site fill and separation, and an exact augmented RBF-FD procedure. For arbitrary fixed , , and , it derives the normalized Matérn spectral kernel and proves its weighted-Fourier native-space identity, the restriction-quotient equivalence with , and the projection and power-function formulas. On bounded Lipschitz domains with a stated uniform interior cone condition, stable polynomial norming stencils give a complete scattered-zeros estimate and the interpolation and power-function rate. The fill-distance rate needs no mesh-ratio condition. A separate compact-frequency-window argument proves the Gram eigenvalue lower bound for separated sites with and the exact-arithmetic conditioning consequence for under bounded mesh ratio. The RBF-FD item proves polynomial reproduction and a Taylor truncation estimate retaining the actual weight norm; unisolvence alone is not claimed to bound that norm. Choice assumptions inherited from the weighted- and Hilbert-projection suppliers are stated locally. No Gaussian flat-limit stability, RBF-QR algorithm, PDE stability, or floating-point guarantee for the augmented indefinite solve is asserted.
3 · Logical flowchart
4 · Definitions, theorems and proofs
Radial kernels, polynomial augmentation, and site geometry
Definition
Fix an integer . An admitted domain is a nonempty bounded Lipschitz domain (its boundary is locally the graph of a Lipschitz function, with on one side) with fixed and such that for every there is an orthogonal map for which An orthogonal map is a real linear map with , equivalently one preserving the Euclidean inner product. The map may depend on ; no simultaneous selection of the maps is part of this definition.
A real radial kernel on has the form for a function . For a finite ordered list of distinct sites , its Gram matrix is . The kernel is strictly positive definite if for every such and every nonzero ; the nonstrict positive-semidefinite condition replaces by . Only strict positivity is used for the ordinary interpolation solve below.
For an integer , let be the real polynomials of total degree at most , with an ordered basis , where . The evaluation matrix on is . The sites are -unisolvent for this polynomial space when has linearly independent columns. A kernel is strictly conditionally positive definite of order when, for every finite distinct and this evaluation matrix, for every nonzero satisfying . Thus strict conditional positivity is a strict inequality on the moment-null subspace; it is stronger than the corresponding nonstrict inequality.
For data , the strictly positive definite interpolation system is . For an order- strictly conditionally positive definite kernel and -unisolvent sites, the polynomially augmented interpolation system is Whenever the relevant system has a unique solution, its kernel-plus-polynomial function is called the interpolant. Invertibility for the stated strict hypotheses is supplied by Strict positive and conditionally positive augmented interpolation systems are invertible ↗.
For a finite nonempty site set , the fill distance is . If , the separation radius and mesh ratio are and , respectively. These are exact geometric quantities, independent of any floating-point solver.
Strict positive and conditionally positive augmented interpolation systems are invertible
Statement
Let be a finite ordered list of distinct sites in . If is strictly positive definite, then is invertible and has a unique solution for every . If is strictly conditionally positive definite of order and is -unisolvent for , then the augmented matrix in Radial kernels, polynomial augmentation, and site geometry is invertible and its system has a unique solution for every right-hand side.
Facts & Assumptions
Given: A finite distinct site list , a real radial kernel, and either strict positive definiteness or strict conditional positive definiteness of order together with -unisolvent sites.
Strict positive definiteness means for every nonzero on distinct sites. (Radial kernels, polynomial augmentation, and site geometry)
Strict conditional positive definiteness means for each nonzero with ; -unisolvence means has linearly independent columns. (Radial kernels, polynomial augmentation, and site geometry)
For a linear map with finite-dimensional domain, dimension equals nullity plus rank. (Rank-nullity: )
The real numbers form a field. (The reals form a field)
A real square matrix is invertible when it has a two-sided matrix inverse. (Invertible matrices and the general linear group )
Proof
Given: The hypotheses above, with and, in the augmented case, .
In the strictly positive definite case, if , then , so [F1] forces . Thus the linear map has zero kernel.
In the augmented case, put and suppose . The lower block gives , and multiplying the upper block by gives . Since , strict conditional positivity [F2] forces .
By [F3], the map has rank , so it is onto as well as one-to-one. For the standard basis , choose with and let have columns . Then ; for every , injectivity of applied to gives . Thus is a two-sided inverse by [F5], and every system has a unique solution.
With , the upper block reduces to . The columns of are linearly independent by [F2], so . The augmented square matrix therefore has zero kernel, and [F3] gives rank and surjectivity. For the standard basis of , choose the unique preimage of each basis vector and use those preimages as columns of a matrix . Then ; injectivity gives by applying to . Hence is invertible by [F5], and its system has a unique solution for every right-hand side.
The normalized Matérn kernel in the 2π Fourier convention
Definition
Fix the dimension of an admitted domain, a smoothness parameter , and an inverse length . Assume Countable Choice for the Lebesgue-integration suppliers used to justify this formula; this definition does not assume full Choice. Put and All integrals are Lebesgue integrals with respect to (Lebesgue measurable sets, the family , and the restricted set function ), and is the Euler integral of The real Gamma function by Euler's integral. With the negative-sign Fourier transform convention , define the normalized stationary kernel by The corresponding length parameter in the usual Matérn notation is . For , define the modified Bessel function in its integral normalization by The classical Bessel expression for when , its value , absolute convergence, continuity, and radial symmetry are established by The Matérn spectral integral, normalization, and radial formula ↗. This definition makes no finite-precision stability claim.
Fourier Bessel-potential and restriction-quotient Sobolev spaces
Definition
Assume the Axiom of Choice when using the well-definedness results below; it is inherited conservatively from the published completeness supplier. Let and . Write for the equivalence classes modulo Lebesgue-almost-everywhere equality of measurable complex functions satisfying For such , the inverse Fourier representative is the function The whole-space Bessel-potential space consists of these representatives, with norm . For the admitted domain of Radial kernels, polynomial augmentation, and site geometry, define to be the restrictions of whole-space members, with the quotient norm The whole-space inner product is , linear in the first variable as in Real and complex inner-product spaces and their induced length. The inverse Fourier map is injective, whole-space representatives are continuous, the whole-space model is Hilbert, and Schwartz functions are dense in that norm; these facts are supplied by The weighted Fourier model is an injective Hilbert representation ↗ and Schwartz functions are dense in the Fourier Bessel-potential norm ↗. The restriction quotient is a norm by bounded point evaluation; its Hilbert realization as the restricted native space is proved in The restricted Matérn native space is the Sobolev quotient space ↗. No extension operator or identification with an intrinsic fractional Sobolev norm on is part of this definition.
Uniform cone domains admit stable polynomial norming stencils
Statement
Let be an admitted domain of Radial kernels, polynomial augmentation, and site geometry, let be finite and nonempty, and put . Fix an integer and let . There are constants , depending only on , such that if , then for every there are distinct nodes and real weights with No lower bound on site separation is assumed.
Facts & Assumptions
Given: An admitted domain with uniform cone constants , a finite nonempty site set , fill distance , an integer , and a point .
The cone constants give, at each , an orthogonal map that sends the radius- cone into ; the fill distance is . (Radial kernels, polynomial augmentation, and site geometry)
A nonzero univariate polynomial over an integral domain has at most its degree many distinct roots. (A nonzero polynomial of degree over an integral domain has at most distinct roots)
For a linear map with finite-dimensional domain, dimension is nullity plus rank. (Rank-nullity: )
The real numbers form a totally ordered field. In an interval , the numbers , , are distinct and lie in . (The reals form a totally ordered field)
For one fixed , choose its cone orientation and finitely many nearest sites; these are finite choices, and the argument below never selects a family of stencils indexed by all .
Proof
Given: The data above and the finite-dimensional polynomial space with its monomial basis.
The evaluations at points of the open unit cone span the dual of . Indeed, if fewer than independent evaluations have been chosen, the map from to their finite value list has nonzero kernel by [F3]; choose a nonzero polynomial in that kernel. Suppose, for contradiction, that vanishes throughout . Since is nonempty and open (it contains ), it contains a box of nonempty open intervals. Write as a polynomial in its first coordinate, of degree at most . For every fixed tuple of the other coordinates in their intervals, this univariate polynomial vanishes at the distinct points , , where . These points lie in by [F4], so the root bound [F2] forces every coefficient to vanish at that tuple. Applying the same argument inductively to each coefficient polynomial on shows every coefficient is identically zero, contrary to the choice of . Thus is nonzero at some point of , and evaluation there increases the independent list. After the finite number of steps, choose with invertible evaluation matrix.
For the chosen nodes, the weights representing evaluation at zero are the row , where is their evaluation matrix and is the monomial vector. Choose ; if , also require it to be smaller than one third of the minimum distance between distinct reference nodes. On the bounded perturbation neighborhood, every monomial entry changes by at most a constant times by telescoping its finite product; the determinant, being a finite signed sum of products of entries, therefore changes by at most . Choose smaller if necessary so . Then for every perturbed matrix . Its cofactors are bounded there because the entries are bounded, so the adjugate formula gives a uniform bound on the sum of absolute evaluation-at-zero weights.
Choose and set . For the fixed , use [F1] to choose . Each target lies in when , so the fill-distance definition supplies a site within distance . The normalized points then satisfy ; hence they are distinct and their evaluation weights have sum at most .
For any , the affine pullback has degree at most . The weights from step 3.1 represent evaluation at zero for every such polynomial, so . Also . Taking proves the bounds with constants independent of ; no separation condition entered the construction.
The Matérn spectral integral, normalization, and radial formula
Statement
Assume Countable Choice, and fix , , , , and as in The normalized Matérn kernel in the 2π Fourier convention. Then , , and The integral defining is absolutely convergent for every ; is real, even, radial, and continuous, and . For every , For this is equivalently where has the integral normalization in The normalized Matérn kernel in the 2π Fourier convention. Under the stated Fourier convention, the -dimensional Gaussian identity is, for ,
Facts & Assumptions
Given: Countable Choice, the normalized Matérn parameters and density in The normalized Matérn kernel in the 2π Fourier convention, and the real Euler integral for .
For , ; it converges and is positive. (The real Gamma function by Euler's integral, Euler's Gamma integral converges exactly for positive real parameters)
Tonelli/Fubini holds for nonnegative or absolutely integrable functions on completed Euclidean product measures under Countable Choice, and agrees with on Borel sets. (Tonelli and Fubini for the completed product, with only almost-everywhere section measurability, On Borel subsets of R^{m+n}, the product lambda_m times lambda_n agrees with lambda_{m+n})
Polar coordinates express a nonnegative radial Lebesgue integral as its radial integral against and finite sphere measure. (Polar coordinates decompose Lebesgue measure into r^{n-1} dr d sigma)
The complex exponential has derivative itself, and a real differentiable function with zero derivative on an interval is constant by the mean value theorem. (The complex exponential is entire and its complex derivative is itself, The mean value theorem, as the case of Cauchy's: for continuous on with and differentiable on there is with )
Pointwise convergence under an integrable majorant permits passage of limits through Lebesgue integrals. (Dominated convergence)
Under Countable Choice, complex factors obey Lebesgue integration by parts on finite intervals; on the boundary-free identity holds if both derivative products are in and the product tends to zero at both ends. (Complex integration by parts on intervals and decaying lines)
Countable Choice is the precise choice principle used by [F3] and [F4]; no full Axiom of Choice is used in this spectral calculation. (The Axiom of Countable Choice ())
Proof
Given: The hypotheses of the statement. Write for Lebesgue measure and use the negative-sign Fourier convention from The normalized Matérn kernel in the 2π Fourier convention.
Since , polar coordinates [F4] and comparison with for show ; the integrand is bounded near . Since by [F1] and the positive parameters, and .
For one dimension let . Differentiation under the integral is justified by [F6], since is integrable. Apply [F8] with and : both are , and are integrable Gaussian multiples, and at both ends. Thus , which gives . The initial value from [F2] and scaling is . Set ; the differential equation gives . The real and imaginary parts of are constant by the mean value theorem [F5], so and .
For , [F1] and the substitution give . Apply this with and use Tonelli [F3]. The product Gaussian integral in [F2] is by scaling and the Borel product identity in [F3]. A second substitution gives
The integrand in dimensions is a product of the one-dimensional integrands in step 1.2. Absolute integrability and [F3] therefore give the stated -dimensional Gaussian Fourier identity.
Absolute Fubini is valid in the gamma representation of because its absolute double integral is the finite normalization integral in steps 1.1 and 2.1. Substitute that representation into and apply step 2.2; the result is The same absolute bound proves convergence for every .
From , dominated convergence [F6] makes continuous. The integral formula in step 3.1 is real and depends on only through , so is real, even, and radial. Step 2.1 gives .
In step 3.1 substitute . For , then substitute in the resulting integral; [F7] gives . Thus the displayed Bessel expression follows for .
Exact augmented RBF-FD weights for a local differential functional
Definition
The exact augmented RBF finite-difference weight procedure has the following inputs: a dimension ; an integer polynomial degree ; a finite ordered stencil of distinct sites that is -unisolvent for ; a real kernel strictly conditionally positive definite of order ; an ordered basis of ; a center ; a homogeneous constant-coefficient differential functional with ; and a neighborhood of on which every section has continuous derivatives through order . Here , , and is the corresponding partial derivative. All arithmetic in this procedure is exact real arithmetic.
The input is supplied with total, correct oracles for admissibility and exact evaluation. The admissibility oracle returns whether all the stated input conditions hold, including the polynomial-basis condition, global strict conditional positive definiteness, and continuous section differentiability on the supplied neighborhood. On an affirmative answer, the evaluation oracles return the exact real values , , , and for the finitely many requested indices. Oracle calls are primitive operations in this model; neither global kernel admissibility nor differentiation is claimed to be decidable by real arithmetic alone.
Query the admissibility oracle. If it returns false, return inadmissible-input. Otherwise use the evaluation oracles to form , , , and
Solve by exact Gaussian elimination with deterministic nonzero-pivot row selection: set , , and . For , choose the least with ; if none exists, return singular-system. Swap rows and in both and . For each in increasing order, set , replace row by row in and , and set . After all pivots, set ; then, for in decreasing order, set . Return success with the first coordinates of and the remaining polynomial multipliers. The stated strict hypotheses imply that singular-system is unreachable, as proved by Strict positive and conditionally positive augmented interpolation systems are invertible.
The returned is an exact mathematical weight vector. The nonsingularity lemma Strict positive and conditionally positive augmented interpolation systems are invertible makes singular-system unreachable for every input that passes the stated strict hypotheses. This definition makes no floating-point stability or solver-error claim.
The weighted Fourier model is an injective Hilbert representation
Statement
Assume the Axiom of Choice as a conservative cover of the published completeness dependency, which declares it in its transitive dependencies although its statement requires only Countable Choice. For every , each lies in , its inverse Fourier representative is bounded and continuous, the map is injective, and the whole-space Fourier Bessel-potential space of Fourier Bessel-potential and restriction-quotient Sobolev spaces is a complex Hilbert space. In particular, for a constant ,
Facts & Assumptions
Given: The Axiom of Choice, an integer , a real , and .
The weighted Fourier norm is , and . (Fourier Bessel-potential and restriction-quotient Sobolev spaces)
Cauchy--Schwarz holds in . (Cauchy-Schwarz inequality for )
The integral is finite when , by polar coordinates. (Polar coordinates decompose Lebesgue measure into r^{n-1} dr d sigma)
The Matérn calculation supplies the -dimensional Gaussian Fourier transform and its normalized Gaussian of integral one. (The Matérn spectral integral, normalization, and radial formula)
Fubini/Tonelli applies to the absolute integrals on completed product measure spaces. (Tonelli and Fubini for the completed product, with only almost-everywhere section measurability)
Translations are continuous in . ( in as , for )
Increasing nonnegative integrals converge to the integral of their pointwise limit, and dominated convergence applies under an integrable majorant. (Monotone convergence for the integral, Dominated convergence)
with the integral pairing is a Hilbert space under Countable Choice. Its declared transitive dependencies include the Axiom of Choice. ( with the integral pairing is a Hilbert space, The Axiom of Countable Choice (), The Axiom of Choice)
A nonnegative measurable function has integral zero exactly when it vanishes almost everywhere. (A nonnegative measurable function has integral exactly when it vanishes almost everywhere)
Full AC is carried conservatively to match the legacy transitive dependency of the published Hilbert-space item; the Fourier injectivity argument itself is choice-free. (The Axiom of Choice)
Proof technique: direct.
Proof
Given: The hypotheses in the Statement and the Fourier convention in [F1].
Write . By [F2] and [F3], Hence is bounded by and continuous by [F7] applied to the pointwise-continuous exponential integrand dominated by . The same estimate gives the displayed evaluation bound with .
The kernels are nonnegative and have integral one by [F4]. For each fixed , scaling and [F7] show
Suppose for every . For and , the double integral of is finite by step 1.1 and [F4]. Thus [F5] and [F4] give
Given , translation continuity [F6] supplies such that when . Tonelli and the triangle inequality then give Step 1.2 makes the last term tend to zero; as was arbitrary, in .
Step 2.1 says for every , whereas step 2.2 says these convolutions converge to in . Hence , so and [F9] gives almost everywhere. This proves injectivity.
Multiplication is a linear isometry of the weighted space onto ordinary complex , with inverse . By [F8] the latter is Hilbert under the declared choice assumption. Step 3.1 makes the inverse Fourier image isometric and one-to-one, so the whole-space is Hilbert; step 1.1 makes its restriction quotient norm positive on nonzero functions.
Separated Matérn sites have a positive Gram lower bound
Statement
Assume Countable Choice. Fix , , , , and the normalized Matérn kernel with spectral density from The normalized Matérn kernel in the 2π Fourier convention. For a list of distinct sites , put . There is such that if , then The eigenvalues and condition number are those of the exact real symmetric positive-definite matrix. For , and .
Facts & Assumptions
Given: Countable Choice, fixed Matérn parameters, distinct sites, and .
The spectral density is positive, , and . (The normalized Matérn kernel in the 2π Fourier convention, The Matérn spectral integral, normalization, and radial formula)
The Matérn kernel is real and even, with , so its Gram matrix is real symmetric and every diagonal entry is one. (The Matérn spectral integral, normalization, and radial formula)
Linear changes of variables scale Lebesgue measure by the absolute determinant; balls are measurable with positive finite measure, translations preserve measure, and Lebesgue measure is finitely additive on disjoint measurable sets. (A linear map of sends Lebesgue measurable sets to Lebesgue measurable sets, with when is invertible and Lebesgue null when it is not, Euclidean balls have positive finite Lebesgue measure, Lebesgue outer measure, Lebesgue measurability and Lebesgue measure are unchanged by translation, Assuming countable choice, is a sigma-algebra containing every elementary set and is a complete measure extending elementary volume)
For a real symmetric matrix, its smallest and largest eigenvalues are the minimum and maximum Rayleigh quotients. (The smallest and largest eigenvalues of a self-adjoint endomorphism are the minimum and maximum Rayleigh quotients, Real spectral theorem: a self-adjoint endomorphism of a finite-dimensional real inner product space has an orthonormal eigenbasis)
A smooth bump can be chosen equal to one on the half-radius ball and supported in the unit ball. (A smooth bump between concentric Euclidean balls, Euclidean balls have positive finite Lebesgue measure)
The induced matrix 2-norm of a symmetric matrix is its largest absolute eigenvalue. (A symmetric matrix operator norm is its largest absolute Rayleigh quotient, The matrix norm induced by a published vector p-norm)
The nonnegative integral is monotone and the modulus of an integral is bounded by the integral of the modulus. (Monotonicity and nonnegative homogeneity of the nonnegative integral, The modulus of an integral is bounded by the integral of the modulus)
Smooth compactly supported functions are Schwartz, and the negative-sign, -normalized Fourier transform maps Schwartz functions to Schwartz functions. (Schwartz space and its seminorms, Fourier transform acts continuously on Schwartz space)
Euler's formula gives for real and . (, , and )
For , is increasing on by its positive derivative and the mean value theorem, so implies ; positive-base power laws also give . (Continuity and derivatives of positive-base real powers, The mean value theorem, as the case of Cauchy's: for continuous on with and differentiable on there is with , The exponent, product, quotient, and iterated-power laws for positive real bases and real exponents)
The positive p-series converges for . (The p-series for a real exponent p converges exactly when p is greater than one)
Countable Choice is inherited from the spectral normalization, ball and Lebesgue measure, and Schwartz Fourier-transform suppliers; no choice of sites or window functions is made from an arbitrary family. (The Axiom of Countable Choice ())
Proof technique: localized spectral window, packing, and Rayleigh quotients.
Proof
Given: The hypotheses above.
By [F5] choose a smooth function equal to one on and supported in . Set . Then is smooth, even, nonnegative, at most one, still equals one on the half-radius ball, and is supported in the unit ball. Define . Reflection invariance of Lebesgue measure [F3] and Euler's formula [F9] make real and even, and monotonicity [F7] gives .
Since is smooth and compactly supported, it is Schwartz by [F8], so is Schwartz and is Schwartz as well. For , choose a coordinate with ; the Schwartz seminorm gives . For , [F7] and from [F9] give . Combining the two bounds yields .
Fix . The open balls are pairwise disjoint because center distances are at least . If , then . Translation invariance and dilation change of variables in [F3] give ; this unit-ball measure is finite and positive. Finite additivity on the disjoint balls therefore bounds the number of such by . Hence, for any integer and , [step 2.1] yields the uniform row-sum estimate For , , so this series is bounded by , which converges by [F11] because . Choose one fixed large enough that this upper bound is at most .
For any , the quadratic form of satisfies because each off-diagonal pair is bounded using . By the change of variables , The first inequality uses and support in the unit ball.
On and , set . Then . Monotonicity and the power laws [F10] give Using the Fourier quadratic-form identity from [F1] and step 4.1 gives for a constant independent of . Thus [F4] yields .
By [F4], choose an orthonormal eigenbasis and write . If , then since each column of has unit norm and [F2] gives diagonal entries . By step 5.1 all eigenvalues are positive, so . In this eigenbasis the induced 2-norms of and are and , respectively, by [F6]. The definition therefore gives . The case follows directly from and the same definition.
Augmented RBF-FD weights reproduce polynomials and obey a local Taylor bound
Statement
Let be an integer, let be distinct and -unisolvent for , and let be a real strictly conditionally positive-definite kernel of order . Fix a center , an ordered basis of , and a homogeneous constant-coefficient differential functional of order for which all section derivatives in Exact augmented RBF-FD weights for a local differential functional exist. Let be the exact output of that procedure and put . Then the procedure returns success, and for every , If on an open convex set containing the compact convex hull , then Consequently, when , a separately proved bound yields the order truncation bound. Unisolvence alone is not asserted to provide this weight-norm bound.
Facts & Assumptions
Given: The sites, kernel, polynomial basis, center, functional, and function hypotheses in the Statement.
The exact algorithm forms the augmented matrix with blocks , right side , and applies deterministic Gaussian elimination with row pivoting; the lower block of any solution is . (Exact augmented RBF-FD weights for a local differential functional)
Under strict conditional positive definiteness of order and -unisolvence, the augmented matrix is invertible for every right-hand side. (Strict positive and conditionally positive augmented interpolation systems are invertible, Radial kernels, polynomial augmentation, and site geometry)
Taylor's theorem gives a degree- polynomial at whose value remainder at is bounded by times the supremum of all order- partial derivatives on the segment. (Multivariable Taylor formula with a Lagrange remainder along a line segment)
Proof
Given: The hypotheses above. All linear algebra and arithmetic in the algorithm are exact.
Let be the augmented matrix and its right side in [F1]. It is square and invertible by [F2]. Initially the leading pivot block is invertible. Inductively suppose the first pivots have been nonzero. After their row swaps and elimination, the row-equivalent matrix has block form with invertible and the remaining Schur complement. The block matrix is invertible, so is invertible: if , then would be a nonzero vector in its kernel. If the first column of were zero, its first coordinate vector would be a nonzero kernel vector. Thus the finite set of remaining entries in column contains a nonzero entry, and the algorithm's least-index rule finds a nonzero pivot. Row swaps and adding multiples of pivot rows are invertible elementary row operations, so they preserve the solution set. After pivots the matrix is upper triangular with nonzero diagonal, and descending substitution returns the unique solution. Therefore the singular-system status is unreachable under the hypotheses.
Writing the returned vector as , its lower block equation is . For each basis polynomial , this says . Every is a linear combination , so multiplying these identities by and summing, using linearity of , gives .
Let be the Taylor polynomial of at of total degree at most . Since , its derivatives at through order agree with those of , so . Applying step 2.1 to gives .
Subtract the identity in step 3.1 from the sampled sum for . For every , [F3] bounds by times the derivative supremum on , since each segment lies in the convex hull . The triangle inequality and now give the stated truncation estimate. When , the additional weight bound yields the final conditional rate.
Schwartz functions are dense in the Fourier Bessel-potential norm
Statement
Assume the Axiom of Choice inherited from the declared dependency. For every , every Schwartz function belongs to , and the inverse Fourier transforms of are Schwartz functions and are dense in of Fourier Bessel-potential and restriction-quotient Sobolev spaces. The Fourier transform uses the negative-sign convention.
Facts & Assumptions
Given: The Axiom of Choice, , and .
is defined by the weighted Fourier norm and inverse Fourier representative. (Fourier Bessel-potential and restriction-quotient Sobolev spaces)
Smooth compactly supported functions are dense in for every open . (Smooth compactly supported functions of an open set are dense in )
Truncating an integrable nonnegative function to increasing balls makes the integrals increase to its full integral. (Monotone convergence for the integral)
The inverse Fourier map is injective and the weighted representation is a Hilbert space under the declared choice assumption. (The weighted Fourier model is an injective Hilbert representation)
A Schwartz function and all its derivatives decay faster than every polynomial, with seminorms finite. (Schwartz space and its seminorms)
The Matérn calculation gives the -dimensional Gaussian Fourier transform and the complex exponential derivative; Tonelli/Fubini, polar integration, monotone convergence and dominated convergence hold under their stated hypotheses. (The Matérn spectral integral, normalization, and radial formula, The complex exponential is entire and its complex derivative is itself, Tonelli and Fubini for the completed product, with only almost-everywhere section measurability, Polar coordinates decompose Lebesgue measure into r^{n-1} dr d sigma, Monotone convergence for the integral, Dominated convergence)
Under Countable Choice, complex factors obey Lebesgue integration by parts on finite intervals and on when the derivative products are integrable and the product tends to zero at both ends. (Complex integration by parts on intervals and decaying lines)
Full AC conservatively covers the inherited Hilbert-space dependency. It also supplies the Countable Choice required by the smooth-density supplier [F2], the spectral Gaussian and integration suppliers [F6], and integration by parts [F7]. (The Axiom of Choice, The Axiom of Countable Choice ())
Proof technique: direct.
Proof
Given: The hypotheses above and the Fourier convention in [F1].
Put . By [F3], Choose so this norm is less than a prescribed .
Let be any Schwartz function and define . Polynomial multiples of derivatives of have arbitrarily rapid decay by [F5], so they and their derivatives are integrable, including on each coordinate line with the other coordinates fixed. Differentiation in is justified by dominated convergence [F6] using these integrable moments. Apply [F7] on each coordinate line to such a function and its Fourier exponential: the derivative products are integrable and the boundary product tends to zero. Absolute Fubini [F6] then combines the coordinate identities and shows that every is a finite linear combination of Fourier transforms of derivatives of polynomial multiples of . Each such function is in by [F5], so its Fourier transform is bounded; hence is Schwartz and in . In particular , by polar integration [F6].
On the bounded ball , the weight is bounded above by a finite constant . The restriction of to lies in , so [F2] gives with . Extending by zero is still smooth and compactly supported on because its support is compactly contained in , and
For , absolute Fubini [F6] and the Gaussian transform [F6] give where . Since , dominated convergence sends the left side to . The right side tends to : given , continuity at gives such that for . Since has total mass one, the contribution from this ball is at most ; boundedness of and the Gaussian tail estimate from scaling make the contribution on tend to zero. Thus Fourier inversion holds and .
For any multi-indices , differentiation under the integral is justified by the compactly supported integrable moments. For each coordinate, apply [F7] with the smooth compactly supported factor (or a derivative of it) and the inverse Fourier exponential; both derivative products are integrable and the boundary product is zero outside a bounded interval. Repetition and absolute Fubini [F6] give The right side is uniformly bounded by the norm of a smooth compactly supported function. Hence every Schwartz seminorm of is finite, so is Schwartz.
Steps 1.1 and 2.1 show that frequency functions are dense in the weighted Fourier norm. Step 3.1 shows their inverse transforms are Schwartz. Steps 1.2 and 2.2 show every Schwartz function belongs to , and [F4] identifies the normed Fourier images injectively with the functions in . Thus Schwartz functions are dense in .
A Sobolev function vanishing on scattered sites has an h^ν bound
Statement
Assume full AC conservatively for the declared weighted- Hilbert dependency. Let be an admitted domain with its uniform cone constants, fix , , , and choose an integer . There exist , depending only on and the cone constants, such that for every finite nonempty of fill distance and every with , The estimate has no separation or mesh-ratio hypothesis.
Facts & Assumptions
Given: The hypotheses above, a site set , and vanishing on .
Every is the restriction of a whole-space inverse Fourier representative with weighted norm; point evaluations are well defined and continuous. (Fourier Bessel-potential and restriction-quotient Sobolev spaces, The weighted Fourier model is an injective Hilbert representation)
For every there are distinct nodes and weights with , , and for all polynomials of degree below , once . (Uniform cone domains admit stable polynomial norming stencils)
Polar coordinates evaluate nonnegative radial integrals; multivariable Taylor's theorem bounds the degree- remainder by a dimension- and-order-dependent constant times times the supremum of order- derivatives along the segment. (Polar coordinates decompose Lebesgue measure into r^{n-1} dr d sigma, Multivariable Taylor formula with a Lagrange remainder along a line segment)
Differentiation under the bounded-frequency inverse Fourier integral is justified by dominated convergence, using the derivative formula for the complex exponential. (Dominated convergence, The complex exponential is entire and its complex derivative is itself)
Cauchy--Schwarz holds for the integral pairing. (Cauchy-Schwarz inequality for )
The reals are an ordered field, so for every nonempty open ball in contains infinitely many points along a coordinate line. (The reals form a totally ordered field)
Full AC covers the conservative weighted- completeness/injectivity dependency used to define the Fourier representatives. The stencil proof makes only a finite choice for each fixed , with uniform constants before taking suprema. (The Axiom of Choice, The Axiom of Countable Choice ())
Proof technique: direct Fourier split and polynomial cancellation.
Proof
Given: The hypotheses above. Decrease if necessary so .
Since is a nonempty open domain, it contains a ball . For this ball contains the infinitely many distinct points , , by [F6]. The finite set omits one such point , so and therefore . In particular is defined. Fix any whole-space extension of , and split with . Let and . By Cauchy--Schwarz [F5], polar integration [F3], and , Indeed, for the radial tail is at most .
For each multi-index with , the bounded frequency support makes well defined and continuous by differentiation under an absolutely integrable Fourier integral. Cauchy--Schwarz [F5] and polar coordinates give For the last estimate, the radial integral on is finite and on is bounded by , using .
Fix and choose the stencil from [F2]. Taylor-expand the globally defined smooth at to degree . The segment from to each lies in , where is smooth, so [F3] bounds each remainder by . The polynomial part cancels under the stencil's reproduction identities. Therefore
Since , we have . Thus Use step 3.1, step 1.1 and to obtain . The constants do not depend on or the chosen extension. Taking the supremum over , then the infimum over all extensions , gives the claimed quotient-norm estimate.
Bounded mesh ratio gives an h^{-2s} exact condition-number bound
Statement
Assume Countable Choice. Fix Matérn parameters , , , , an admitted bounded domain , and a mesh-ratio bound . There is such that every finite nonempty distinct site set with , , , and satisfies The one-site case has condition number . This is an exact-arithmetic condition-number estimate for the Gram matrix; it does not bound the error of a floating-point solver.
Facts & Assumptions
Given: Countable Choice, fixed parameters, a bounded domain, a finite distinct site set with , and the stated mesh-ratio bound.
For and separation radius , ; for the condition number is . (Separated Matérn sites have a positive Gram lower bound)
The domain lies in a fixed ball and the disjoint balls of radius about the sites have volume proportional to ; finite additivity gives the corresponding packing bound. (Radial kernels, polynomial augmentation, and site geometry, Euclidean balls have positive finite Lebesgue measure, Lebesgue outer measure, Lebesgue measurability and Lebesgue measure are unchanged by translation, Assuming countable choice, is a sigma-algebra containing every elementary set and is a complete measure extending elementary volume, A linear map of sends Lebesgue measurable sets to Lebesgue measurable sets, with when is invertible and Lebesgue null when it is not)
The mesh ratio and separation radius satisfy , and the condition number is finite for each invertible Gram matrix. (Radial kernels, polynomial augmentation, and site geometry, The condition number kappa_p(A) = ||A||_p ||A^{-1}||_p of a nonsingular linear system)
Countable Choice is inherited from the Matérn separation estimate [F1] and the Lebesgue measure and ball-packing suppliers used in [F2]. (The Axiom of Countable Choice ())
Proof technique: packing followed by the separation estimate.
Proof
Given: The hypotheses above.
Suppose and write . Choose and with . The site balls are pairwise disjoint and lie in . Their measures are by [F2], so finite additivity and the positive finite unit-ball measure give and therefore .
Since , combine [F1] with step 1.1 to get .
The mesh-ratio bound implies , so . Step 2.1 gives the desired estimate.
The Matérn native space has its weighted Fourier norm and strict Gram positivity
Statement
Assume the Axiom of Choice conservatively for the declared Hilbert-space dependency. Fix , , , and , and let be the normalized Matérn kernel and positive spectral density of The normalized Matérn kernel in the 2π Fourier convention. Let consist of the inverse Fourier representatives with , with inner product Then this is a Hilbert space, each kernel section reproduces evaluation at , and its span is dense. There are constants , depending only on , such that For every finite list of distinct sites , the Matérn Gram matrix is strictly positive definite.
Facts & Assumptions
Given: The Axiom of Choice, fixed , the definitions of , and distinct sites .
is positive and integrable with integral one; the inverse Fourier representation of is injective. (The normalized Matérn kernel in the 2π Fourier convention, The Matérn spectral integral, normalization, and radial formula, The weighted Fourier model is an injective Hilbert representation)
The Fourier norm is , and the inverse Fourier representative is injective. (Fourier Bessel-potential and restriction-quotient Sobolev spaces, The weighted Fourier model is an injective Hilbert representation)
A closed subspace of a Hilbert space has an orthogonal complement, and a subspace whose orthogonal complement is zero is dense. (Orthogonal decomposition by a closed subspace)
A nonzero univariate polynomial has at most its degree many roots. The real numbers form an ordered field, hence are infinite. (A nonzero polynomial of degree over an integral domain has at most distinct roots, The reals form a totally ordered field, The reals form a field)
The complex exponential has derivative itself, the chain and product rules apply to its finite linear combinations, Cauchy–Schwarz holds in , and a box of positive side lengths has positive Lebesgue measure. (The complex exponential is entire and its complex derivative is itself, The chain rule, in one line from Carathéodory: if is differentiable at and is differentiable at , then is differentiable at with , Sums, scalar multiples, products and quotients: , , , and when , Cauchy-Schwarz inequality for , A box in with parameters is Lebesgue measurable of measure , whichever of its faces are included)
A nonnegative measurable function with integral zero vanishes almost everywhere. (A nonnegative measurable function has integral exactly when it vanishes almost everywhere)
For , the function is increasing on by its positive derivative and the mean value theorem. (Continuity and derivatives of positive-base real powers, The mean value theorem, as the case of Cauchy's: for continuous on with and differentiable on there is with )
Full AC is carried only to conservatively cover the legacy declared dependency of the published completeness result; the Fourier calculations and finite-site selection use no arbitrary-index choice. (The Axiom of Choice, The Axiom of Countable Choice ())
Proof technique: direct.
Proof
Given: The data above; all Fourier transforms use the negative-sign convention.
Since , the two positive functions and have ratio bounded above and below by positive constants: compare with separately using the minimum and maximum of and , and use monotonicity of the positive power [F7]. Multiplying by and taking square roots gives the displayed norm equivalence. Thus the weighted norms defining and are equivalent and have the same representatives by injectivity [F1,F2]; completeness of implies completeness of .
For a complex coefficient vector , the Hermitian quadratic form of the Gram matrix is If it is zero, [F6] says times the squared modulus of the continuous exponential sum vanishes almost everywhere. Since , the sum is zero almost everywhere. A continuous function zero almost everywhere is zero everywhere, because any point of nonzero value would have a neighborhood on which its modulus is bounded below, and such a neighborhood contains a positive-measure box [F5].
The spectral representative of is . Its norm squared is , and for , The integral exists because Cauchy--Schwarz bounds by . Hence point evaluation is continuous and the stated kernel sections reproduce it.
If is orthogonal to every section centered at , step 2.1 gives for every . Fourier injectivity [F1] then makes in . By [F3] the span of all sections is dense.
Choose so that the numbers are pairwise distinct. For each pair , the polynomial is nonzero because ; [F4] says its zero set is finite. The ordered field has , so the natural multiples are strictly increasing and is infinite. Thus a real exists outside the finite union of root sets. Restrict the vanishing exponential sum to and differentiate at for orders . This gives . For each , the Lagrange polynomial has degree at most and satisfies if and otherwise. Taking the same linear combination of the moment equations as the coefficients of yields . Thus all , and the real Gram matrix is strictly positive definite.
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 .
Native Matérn interpolation is an orthogonal projection with power function
Statement
Assume full AC conservatively for the declared Hilbert projection dependencies. Let be distinct and nonempty, and let be the restricted Matérn native RKHS. For every , the unique kernel interpolant is the orthogonal projection of onto . Define where is that projection. Then for every , where and .
Facts & Assumptions
Given: Full AC, a finite nonempty distinct site list , and .
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)
The Matérn Gram matrix on distinct sites is strictly positive definite, hence invertible; . (The Matérn native space has its weighted Fourier norm and strict Gram positivity, The Matérn spectral integral, normalization, and radial formula)
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)
Cauchy--Schwarz holds in every real or complex inner-product space. (Cauchy–Schwarz: , with equality exactly for dependent pairs)
Full AC is carried conservatively for the projection suppliers' declared choice branch. (The Axiom of Choice, The Axiom of Countable Choice ())
Proof technique: Hilbert projection and Cauchy--Schwarz.
Proof
Given: The hypotheses above.
The span has finite dimension and is therefore closed. Let be the orthogonal projection of onto . For each site , the residual is orthogonal to ; by reproduction [F1], . Thus interpolates the data. Its coefficients solve , which has a unique solution by [F2], so it is the unique kernel interpolant.
Put . Self-adjointness of and reproduction give Cauchy--Schwarz [F4] yields by contractivity of the orthogonal projection.
The projection of has the form . Reproduction and orthogonality at all sites give , so by [F2]. Expanding the squared residual norm and using this equation gives It is nonnegative because it is a squared norm.
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.
5 · Examples, counterexamples and false statements
None yet.
Sources
- Narcowich, Ward, and Wendland, Sobolev bounds on functions with scattered zeros, Math. Comp. 74 (2005), §§1 and 3.1
- Rasmussen and Williams, Gaussian Processes for Machine Learning, Chapter 4
- Narcowich, Ward, and Wendland, Sobolev bounds on functions with scattered zeros, Math. Comp. 74 (2005), §3.1
- Gregory E. Fasshauer, MATH 590: Meshfree Methods, Chapter 13, pp. 18–25
- Rasmussen and Williams, Gaussian Processes for Machine Learning, Chapter 4, equations (4.14)–(4.15)
- Gregory E. Fasshauer, MATH 590: Meshfree Methods, Chapter 13, pp. 34–36
- Gregory E. Fasshauer, MATH 590: Meshfree Methods, Chapter 13, pp. 23–36
- Rasmussen and Williams, Gaussian Processes for Machine Learning, Chapter 4, equations (4.5)–(4.6)
- Narcowich, Ward, and Wendland, Sobolev bounds on functions with scattered zeros, Math. Comp. 74 (2005), §§2.1–2.2
- Rasmussen and Williams, Gaussian Processes for Machine Learning, Chapter 4, equations (4.5)–(4.15)
- Gregory E. Fasshauer, MATH 590: Meshfree Methods, Chapter 13, pp. 24–36
- Accelerated Training of Physics-Informed Neural Networks (PINNs) using Meshless Discretizations
- Gregory E. Fasshauer, MATH 590: Meshfree Methods, Chapter 13, pp. 19–25
- Gregory E. Fasshauer, MATH 590: Meshfree Methods, Chapter 13, pp. 23–25
- Rasmussen and Williams, Gaussian Processes for Machine Learning, Chapter 4, equations (4.5)–(4.8)
- Gregory E. Fasshauer, MATH 590: Meshfree Methods, Chapter 13, pp. 18–25 and 34–36
- Narcowich, Ward, and Wendland, Sobolev bounds on functions with scattered zeros, Math. Comp. 74 (2005), Theorem 1.1 and §§2.1–2.2