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.
Splines and Series Methods — Examples
1 · Prerequisites
- Absolute and Conditional Convergence; Rearrangement; Products
- Absolute Continuity and the Sharp Fundamental Theorem of Calculus
- Areas of Elementary Plane Figures
- Banach Valued Integration and the Radon Nikodym Property
- Binary Operations, Monoids, Groups and Subgroups
- Bounded Variation and the Riemann–Stieltjes Integral
- Compactness
- Compactness in Metric Spaces
- Completeness, Completion, and Uniform Continuity
- Complex Lp Spaces and Test-Function Conventions
- Conditional Distributions and Regular Conditional Probability
- 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
- Decision-Theoretic Upper Bounds
- Density Separability and Convolution in Lᵖ
- Determinants of Matrices over a Commutative Ring
- Differentiation of Monotone Functions and the Vitali Covering Theorem
- Distributions Test Functions and Differentiation
- Divisibility, Euclidean Domains, Principal Ideal Domains and Unique Factorisation
- Dual Spaces, Bilinear and Quadratic Forms, and Sylvester's Law of Inertia
- Filters and Ultrafilters
- Finite Counting, Factorials and Binomial Coefficients
- Foundations of the Real Numbers for Analysis
- Fubini and Change of Variables
- Gaussian Elimination, Elementary Matrices and Reduced Row Echelon Form
- Group Actions, Orbits, Stabilisers and Cayley's Theorem
- Ideals, Quotient Rings and the Isomorphism Theorems for Rings
- Independence Borel Cantelli and Zero One Laws
- 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
- 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
- Order, Zorn's Lemma, and the Axiom of Choice
- Outer Measure and the Caratheodory Extension Theorem
- Pointwise Extended-Real Function Products
- Polynomial Rings, the Division Algorithm and Roots
- Power Series and Real-Analytic Functions
- Probability Spaces Random Variables and Expectation
- 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
- Signed and Complex Measures Hahn and Jordan
- Simple Field Extensions and the Construction of the Complex Numbers
- Splines and Series Methods
- Subspaces, Products, and Quotients
- Suprema and Infima
- Symmetric Groups, Cycle Decomposition and the Sign Homomorphism
- The Cantor Set, Baire Category, and Measure Zero in ℝ
- The Complex Exponential and Euler's Formula
- The Derivative and the Mean Value Theorems
- The Exponential Function
- 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 Radon Nikodym Theorem and Lebesgue Decomposition
- The Riemann Integral in Rᵐ and Jordan Content
- The Riemann Integral: Definition and Integrability
- 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
These worked examples compute a small B-spline basis, natural cubic interpolants at two and three knots, the one-observation nonuniqueness boundary, a uniform-mesh approximation estimate, and a concrete difference between fitted training loss and independent test loss.
3 · Logical flowchart
4 · Definitions, theorems and proofs
None yet.
5 · Examples, counterexamples and false statements
A quadratic Bernstein B-spline basis
Example
Take degree and clamped knot vector . On its three B-splines are , , and . They form a nonnegative partition of unity and hence a basis of .
Facts & Assumptions
Given: The degree-two clamped knot vector .
Degree-zero B-splines are knot-interval indicators and higher degrees follow the stated recurrence (B-spline spaces and knot conventions).
For a clamped knot vector, the degree- B-splines form a basis and reproduce every polynomial of degree at most (B-spline basis properties and polynomial reproduction).
The degree is , the domain is , and the knot vector is .
Verification
Given: , knots , and .
The only nonzero degree-zero spline on is . Applying the recurrence [F1] first at degree one gives and . Applying it again gives , , and . Each is nonnegative on and their sum is .
For , choose coefficients , , and . Their B-spline combination is Thus every quadratic is reproduced; uniqueness of the coefficient vector follows from the basis assertion [F2].
Natural cubic interpolation with two and three knots
Example
With two knots, the natural cubic interpolant is the line joining the two values. With knots and values , the middle second derivative is , and the interpolant is
Facts & Assumptions
Given: The natural cubic convention and distinct-knot interpolation theorem.
Natural cubic splines are , piecewise cubic, have zero second derivative at the extreme knots, and have linear tails (Natural cubic splines).
At two or more distinct ordered knots, arbitrary interpolation values determine a unique natural cubic spline via the tridiagonal second-derivative system (Natural cubic interpolation at distinct knots).
The first data set has two distinct knots; the second has knots and values .
Verification
Given: The data sets and .
For two knots, there are no interior second derivatives in the system of [F2]. The endpoint second derivatives are both zero, so the cubic segment has affine second derivative vanishing at both ends, hence second derivative identically zero. The segment is the unique line through the two values, and its linear extension on any data-free tail is the same line.
For the three-knot data, and the secant slopes are , . The one interior system equation is , so while .
Substitution in the interval formula gives the displayed pieces. They interpolate ; their first derivatives at are both , their second derivatives at are both , and the second derivatives at are . Thus they join to a natural cubic spline, which is unique by [F2].
One observation does not determine a natural cubic smoothing fit
Statement refuted
The formula has a unique minimizing function for every nonempty data set whenever , including data with only one distinct input.
Facts & Assumptions
Given: The same squared-residual plus roughness criterion as the natural cubic smoothing spline, but with one distinct observed input.
On data sets with at least two distinct inputs, the natural cubic smoothing criterion is (Natural cubic smoothing spline); the counterexample below evaluates this same formula on one input, outside that definition's domain.
The extended criterion has one input , response , and .
Counterexample
Take the domain , one observation , and . Extend the displayed criterion formula to this data set. For every , set . Then and .
Given: The one-point criterion .
For every , both terms in [F1] vanish at , so . The criterion is a sum of nonnegative terms, hence zero is its minimum.
If , then , so and are distinct minimizers. The one-observation extension is not unique, proving the lower bound of two distinct inputs is necessary.
Uniform-mesh linear spline approximation
Example
For each integer , let be the uniform partition with mesh . For real-valued , its continuous representative has a piecewise-linear interpolant in the degree-one spline space with simple interior knots.
Facts & Assumptions
Given: AC, a uniform partition of , and real-valued .
Assume the Axiom of Choice The Axiom of Choice, as required by the supplied Sobolev representative theorem.
A B-spline space with simple interior knots consists of piecewise degree-one polynomials continuous across those knots, and its B-splines form a basis (B-spline basis properties and polynomial reproduction).
A local quasi-interpolant that reproduces affine functions and is bounded on each cell has error bounded by the local mesh-size square times the second weak-derivative norm (Bounded local spline quasi-interpolants, Sobolev approximation by local spline quasi-interpolants).
Every class has a unique absolutely continuous representative on whose increments are integrals of its weak derivative (One-dimensional functions have unique absolutely continuous representatives). Since , this applies to both and its first weak derivative .
The partition is uniform with mesh , and .
Verification
Given: The piecewise-linear interpolant at the uniform knots.
Use the disjoint cells , , with the final cell also containing , and put . For any continuous input and , . The nonnegative weights sum to one. Continuity makes the endpoint values limits from within and gives , so . Continuous inputs agreeing almost everywhere on agree on its closure and hence have the same interpolant on . The map is real-linear, reproduces every affine function, and is a continuous piecewise-linear spline by [F1]. Each neighborhood is one cell and each point belongs to exactly one neighborhood. Thus, as varies, the maps form a mesh-uniform family as in [F2] with , , , and .
Let . On a cell of length , put and . By [F3] applied to and , let and be their absolutely continuous representatives; almost everywhere and . The absolutely continuous function has derivative almost everywhere, so the fundamental theorem for absolutely continuous functions gives , and the same formula at . Since , subtraction and simplification yield . Hence , since and . This holds on every cell and at every point, so taking the supremum gives .
Training risk and independent test risk are different quantities
Example
Use the degree-one clamped B-spline basis on , with a single fixed training input and response . The coefficient vector is a least-squares minimizer and gives the fitted function . Let the target be and the independent test input be uniform on .
Facts & Assumptions
Given: The one-row design matrix , response , and test law .
The fitted training vector is the orthogonal projection onto the design column space; any least-squares coefficient representation has that same training fit (Series least squares with a spline basis).
The risk bound in this page concerns expected empirical training-design loss, not independent test loss (Expected empirical training risk for spline series least squares).
The clamped degree-one B-splines form a basis of the degree-one spline space, and the recurrence defines their values (B-spline spaces and knot conventions, B-spline basis properties and polynomial reproduction).
The training input and response are and , the chosen least-squares coefficient is , and the independent test input is uniform on .
Verification
Given: , , , , and independent .
On the clamped knot vector , the only nonzero degree-zero spline on is ; the recurrence in [F3] gives and , so . Therefore , the training residual and empirical training loss are zero, and the fitted vector equals the projection in [F1]. The chosen coefficient vector is one admissible representation of it.
The independent test squared error has expectation Thus zero training loss does not imply zero independent test loss, consistent with the scope of [F2].
Sources
- Tom Lyche, Carla Manni, and Hendrik Speleers, B-Splines and Spline Approximation, §1.1.1
- P. J. Green and B. W. Silverman, Nonparametric Regression and Generalized Linear Models: A Roughness Penalty Approach, §2.2.1, Theorem 2.2, printed p. 15
- Ryan Tibshirani, Nonparametric Regression: Splines and RKHS Methods, §2.3
- Tom Lyche, Carla Manni, and Hendrik Speleers, B-Splines and Spline Approximation, Example 33 and Theorem 32
- Whitney K. Newey, Nonparametric and Semiparametric Estimation, MIT OCW 14.385, Fall 2007, Proposition 3, PDF pp. 10–11