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 — Examples
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
- Radial basis and kernel interpolation
- 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
The examples apply the Matérn fill-distance theorem to a smooth Gaussian graph on a cube, show that duplicate sites make the Gram matrix singular, and construct near-duplicate sites whose exact condition numbers diverge even as fill distance tends to zero. The last example isolates separation from fill distance; it makes no floating-point solver or stabilization claim.
3 · Logical flowchart
4 · Definitions, theorems and proofs
None yet.
5 · Examples, counterexamples and false statements
Duplicate sites make the kernel Gram matrix singular
Example
Let be any radial kernel, and let a site list contain .
Facts & Assumptions
Given: A radial kernel and a finite site list with .
A radial kernel has Gram entries , and ordinary RBF interpolation is defined on distinct sites. (Radial kernels, polynomial augmentation, and site geometry)
Verification
For every row index , the equal sites give . Thus the first two columns, and by symmetry the first two rows, coincide.
The nonzero vector is therefore in the nullspace of the Gram matrix, so the matrix is singular. This example violates the distinct-site hypothesis in [F1] and is not a counterexample to the interpolation theorem.
A small fill distance can coexist with poor separation and conditioning
Example
Assume Countable Choice. For fixed , , and , let be the midpoint grid in for each odd . There are such that the augmented sets , with , satisfy , , and for the normalized Matérn kernel.
Facts & Assumptions
Given: Countable Choice, odd integers , the midpoint grid its central site , and the normalized Matérn kernel .
An admitted domain is nonempty, bounded and Lipschitz and has the uniform cone condition; , , and . (Radial kernels, polynomial augmentation, and site geometry)
The normalized Matérn kernel is continuous and satisfies . (The Matérn spectral integral, normalization, and radial formula)
For distinct sites with , the exact Gram matrix is positive definite; its smallest eigenvalue is the minimum Rayleigh quotient, and a real symmetric matrix has an orthonormal eigenbasis. (Separated Matérn sites have a positive Gram lower bound, 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)
The condition number is , and the induced 2-norm is the supremum of over unit vectors. (The condition number kappa_p(A) = ||A||_p ||A^{-1}||_p of a nonsingular linear system, The matrix norm induced by a published vector p-norm)
Verification
Given: The data above.
The cube is bounded and Lipschitz. At a boundary point , let be the nonempty set of active coordinates ( or ), with inward signs at and at . Put for and otherwise. In the orthogonal coordinates with , a sufficiently small neighborhood has no constraints from inactive coordinates, and the active inequalities reduce to This is the epigraph of a finite maximum of linear functions, hence a local Lipschitz graph with the cube on one side. The cube also satisfies the uniform cone condition. For , choose signs if and otherwise, and put . If take ; otherwise put and , which is orthogonal and sends to . Choose with , and set . For any cone vector , and . Hence for each coordinate. Each coordinate moves toward the cube's interior by less than , so .
Distinct midpoint sites have fill distance at most . Since is odd, . By continuity in [F2], choose so that whenever , then choose . Strict positive definiteness for and makes , so . Put . The new site is inside the cube because . Every other grid site is at distance at least from , while , so the new site is distinct from all grid sites. At the boundary corner , the nearest grid point is , at distance ; the new site has squared distance , so . For , the triangle inequality gives . Since for and , ; the fill-distance supremum therefore satisfies . Adding a site cannot increase fill distance, so also . The separation radius satisfies ; consequently .
Let be the unit vector with entries and at the new site and , and zero elsewhere. The corresponding Rayleigh quotient is Hence [F3] gives . By [F3] choose an orthonormal eigenbasis and write . Since every diagonal entry is , so is at least the average eigenvalue, namely . For a unit vector , orthogonality gives , with equality at a top eigenvector; the same calculation for gives induced 2-norm . Thus [F4] gives . Together with step 1.2, this gives , , and condition number tending to infinity.
A smooth scattered surface inherits the Matérn fill-distance rate
Example
Assume the Axiom of Choice and Countable Choice as required by the Fourier-space and interpolation suppliers. Fix , , , and let . The smooth graph with is interpolated from midpoint-grid samples by the normalized Matérn kernel of smoothness .
Facts & Assumptions
Given: Full AC, Countable Choice, the fixed , the cube, the function , and midpoint grids
An admitted domain is nonempty, bounded and Lipschitz and has a single cone radius and aperture at every point of the closure; the fill distance is . (Radial kernels, polynomial augmentation, and site geometry)
Every Schwartz function is in the Fourier Bessel-potential space for every , and consists of restrictions of whole-space members. (Schwartz functions are dense in the Fourier Bessel-potential norm, Fourier Bessel-potential and restriction-quotient Sobolev spaces)
The real exponential is smooth with derivative itself; repeated coordinatewise chain and product rules show every partial derivative of is a finite sum of polynomial multiples of . (The exponential function is smooth and , 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 )
The Schwartz seminorms require polynomially weighted derivatives to be bounded. For any degree , take an integer with ; for , and exponential domination applied with gives . On , each polynomial is bounded by the sum of the absolute values of its finitely many coefficients. (Schwartz space and its seminorms, The exponential dominates every fixed nonnegative integer power at )
The Matérn interpolation error and power function are bounded by on an admitted cone domain for small fill distance. (Matérn interpolation and its power function converge at rate h^ν)
Proof technique: verify the domain, regularity, and grid radius, then apply the fill-distance theorem.
Verification
Given: The data above.
The cube is bounded and Lipschitz. At a boundary point , let be the nonempty set of active coordinates ( or ), with inward signs at and at . Put for and otherwise. In the orthogonal coordinates with , a sufficiently small neighborhood has no constraints from inactive coordinates, and the active inequalities reduce to This is the epigraph of a finite maximum of linear functions, hence a local Lipschitz graph with the cube on one side. The cube also satisfies the uniform cone condition: for , let if and otherwise, and put . If let ; otherwise put and , which is orthogonal and sends to . Choose with , and set . For any cone vector , and . Hence for every coordinate, . Each coordinate moves toward the cube's interior by less than , so .
The sites in are distinct. Each is at coordinatewise distance at most from a midpoint in each grid interval, so . By [F3], every partial derivative of is a finite sum of polynomial multiples of ; [F4] makes every polynomially weighted derivative bounded, so is Schwartz. Then [F2] gives for .
For all sufficiently large , step 2.1 gives from [F5]. The Matérn interpolation theorem therefore yields The graph samples are the scattered surface data, and the bound uses fill distance alone; no mesh-ratio condition is needed.
Sources
- Narcowich, Ward, and Wendland, Sobolev bounds on functions with scattered zeros, Math. Comp. 74 (2005), §1
- Narcowich, Ward, and Wendland, Sobolev bounds on functions with scattered zeros, Math. Comp. 74 (2005), §3.1
- Rasmussen and Williams, Gaussian Processes for Machine Learning, Chapter 4, equations (4.5)–(4.8)
- Narcowich, Ward, and Wendland, Sobolev bounds on functions with scattered zeros, Math. Comp. 74 (2005), Theorem 1.1
- Gregory E. Fasshauer, MATH 590: Meshfree Methods, Chapter 13, pp. 34–36