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
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
- Complete Metrizability, Čech-Completeness, and Baire Category
- Completeness, Completion, and Uniform Continuity
- Complex Lp Spaces and Test-Function Conventions
- Conditional Distributions and Regular Conditional Probability
- Conditional Expectation
- 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
- Infinite Product Measures and Kolmogorov Extension
- Inner Product Spaces, Gram-Schmidt, Projections and Adjoints
- Lebesgue Measure on Euclidean Space
- Lebesgue-Stieltjes Measures and Distribution Functions
- 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
- Regression Estimation
- 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
- Standard-Borel Real Codings and Determining Classes
- 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
This page develops B-spline spaces and polynomial reproduction, proves the distinct-knot natural cubic interpolation system, and reduces cubic smoothing to a finite-dimensional spline fit. It also gives local Sobolev approximation bounds and an empirical training-risk guarantee for series least squares. The spline rate uses an explicit uniform full-multiplicity knot convention; the risk claim is evaluated on the training design and does not assert independent test-risk control.
3 · Logical flowchart
4 · Definitions, theorems and proofs
B-spline spaces and knot conventions
Definition
Let , , and . A clamped knot vector is a nondecreasing finite sequence with for every . Empty interior ranges are omitted. The multiplicity of an interior knot is its number of occurrences among .
Write for the real polynomials of degree at most . The degree- spline space consists of functions that restrict to a member of on each nonempty knot interval and whose derivatives through order agree across each interior knot . The convention means that no matching condition is imposed. For this piecewise definition, take knot cells left-closed and right-open; at a knot with no matching condition, the value is the one from the cell on its right, and at use the left limit. Thus the function value at a discontinuous knot is specified.
For each degree , the functions are indexed by . Set For and , define recursively where a term with zero denominator is defined to be zero. For every degree and every allowed index , set equal to its left limit. In particular, the degree- family has indices . Its basis and regularity properties are proved in B-spline basis properties and polynomial reproduction ↗.
Natural cubic splines
Definition
Let be a bounded interval and let with . A natural cubic spline with knots is a function on that is a polynomial of degree at most three on every , has second derivative zero at and , and is extended linearly on and when those intervals are nonempty. The knots are the distinct breakpoints; repeated observations at the same input do not create additional knots.
B-spline basis properties and polynomial reproduction
Statement
Let and let be a clamped knot vector as in B-spline spaces and knot conventions. The recursively defined degree- B-splines are nonnegative, are supported on , and are piecewise polynomials of degree at most . At a knot of multiplicity , each B-spline is ; multiplicity imposes no continuity requirement. On every nonempty knot interval , the active functions form a basis of and sum to one. Globally, the B-splines form a basis of . In particular, every has a unique expansion on .
Facts & Assumptions
Given: A degree , a clamped knot vector , and its recursively defined B-splines.
The degree-zero functions are half-open knot-interval indicators; higher-degree functions satisfy the Cox–de Boor recurrence with zero-denominator terms set to zero, and is the piecewise-polynomial space with the stated knot-multiplicity matching conditions (B-spline spaces and knot conventions).
The knot vector is clamped, , and every interior knot has multiplicity at most .
Proof
For , support, piecewise degree, and nonnegativity follow from the indicator definition in [F1]. Inductively, each degree- term is a lower-degree spline multiplied by an affine factor; on the lower-degree spline's support that factor is nonnegative, and the two supports lie inside . Thus support, degree at most , and nonnegativity hold for every .
Let the distinct interior knots be with multiplicities . For set and set ; the value at follows the right-cell convention of [F1]. The functions together with for span : start with the polynomial on the first interval, then at each knot the difference of adjacent pieces has its derivatives through equal to zero, so it is a linear combination of the listed powers, including the right-continuous step when . They are independent because restriction to successive knot intervals first forces the initial polynomial coefficients, then each new knot's coefficients, to vanish. Thus .
Define and . When , factoring gives . Fix a nonempty cell . At degree zero its sole nonzero indicator is , so the local identity holds. Inductively, the degree- local sum has indices . For every such index, , so the displayed identity has a strictly positive denominator. Multiply that local sum by , apply the identity, and regroup with [F1]. The two extra lower-degree functions and vanish on the cell by support, even when their supports are empty; their recurrence terms are zero under [F1]. Thus for , and in particular for .
Differentiate the identity in step 2.1 exactly times in and set , for each . Since , this yields The coefficients do not depend on , so this is a single expansion valid on every knot interval. Linear combination proves reproduction of every member of ; taking left limits extends the expansion to .
Fix an open nonempty knot interval and . The dual polynomials , , form a basis of in : differentiating the identity of step 2.1 in at an interior point shows that their span contains for every . For , the span is strictly positive and factoring gives . Differentiate the degree- local identity in and use the degree- identity and this difference formula to obtain . Comparison in the dual basis yields on this interval. The boundary lower-degree terms vanish by support; any zero denominator corresponds to an identically zero lower-degree spline and its term is zero. For indices outside the active range both sides vanish by support.
Taking in step 3.1 gives . Step 3.1 also shows that these active functions span on the interval. Because , they are linearly independent there and are a local basis.
Induct on . If the knot multiplicity , the lower-degree splines in the recurrence are continuous there by induction, so the recurrence makes continuous; the derivative formula then makes its derivative , hence . If , a B-spline whose support crosses the repeated knot has one nonzero piece on either side, namely and ; both one-sided limits equal , while any B-spline not crossing it has zero endpoint value there. If , the required order is and no matching is asserted.
The smoothness and piecewise-degree properties from steps 1.1 and 4.2 put every B-spline in . If a linear combination of all B-splines is zero, then on every nonempty knot interval its active coefficients vanish by the local basis property in step 4.1. Each B-spline has a nonempty support interval by the clamped-knot hypothesis, so every coefficient occurs on at least one such interval and is zero. The B-splines are therefore independent members of the -dimensional space in step 1.2, hence form its basis. The unique global expansion includes every polynomial from step 3.1.
Natural cubic interpolation at distinct knots
Statement
Let , , and . There is exactly one natural cubic spline on with for each . On each interval it is the cubic with endpoint values and endpoint second derivatives , where and the interior values solve the positive-definite tridiagonal system with . The interpolant is linear outside .
Facts & Assumptions
Given: , strictly increasing knots in , and arbitrary values .
A natural cubic spline is , piecewise cubic between its distinct knots, has second derivative zero at the extreme knots, and is linear on data-free end intervals (Natural cubic splines).
, in , and are arbitrary real values.
Proof
Put and . For there are no interior second derivatives to solve. For , let be the symmetric tridiagonal matrix with diagonal entry in row and adjacent off-diagonal entries . For a nonzero vector , using gives Thus is positive definite and invertible, so the displayed system has exactly one solution .
On , define Direct substitution gives , , and , . Its left and right endpoint slopes are respectively and . Equating the right slope from and the left slope from gives the tridiagonal equation at . Hence the pieces join ; their second derivatives are linear with the same nodal values, so they join . At the extreme knots , so adjoining the tangent line gives the required linear tails and preserves . For , the formula is the straight line between the two values and the same endpoint argument applies.
Any natural cubic interpolant has nodal second derivatives with . Equality of its adjacent endpoint slopes forces the displayed tridiagonal equations, so by step 1.1 its nodal second derivatives equal the constructed ones. On each interval, the difference from is a cubic with zero second derivative at both endpoints; its second derivative is affine and therefore zero throughout, so the difference is affine and vanishes at both endpoint values. It is identically zero. Thus the interpolant is unique.
Natural cubic smoothing spline
Definition
Assume AC. Let be a bounded interval, let , assume at least two distinct input values, and let . For use its unique continuous representative on supplied by the one-dimensional Sobolev representative theorem. The natural cubic smoothing spline is the unique minimizer, whose existence and uniqueness are proved in Existence, uniqueness, and spline reduction for cubic smoothing ↗, of
The requirement of two distinct inputs is essential. The penalty is the squared norm of the second weak derivative. The data term includes every observation, including repeated inputs; only the spline knots are the distinct input values, as in Natural cubic splines.
Bounded local spline quasi-interpolants
Definition
Fix a bounded interval , a degree , an exponent , an integer , and a nonempty family of clamped degree- knot meshes on . A mesh-uniform bounded local quasi-interpolant is a family of real-linear maps , one for each , for which there are common constants and such that the following hold for every and every nonempty cell of its mesh: there is a neighborhood containing and formed from at most adjacent knot cells; each point of belongs to at most of the neighborhoods ; (i) if almost everywhere on , then almost everywhere on ; (ii) for every ; and (iii) . The constants and are independent of . The derivative and continuous-representative conventions for Sobolev inputs are those of Integer-order Sobolev spaces and their norms and One-dimensional functions have unique absolutely continuous representatives.
For a fixed mesh, the coefficient-functional formulation in Lyche–Manni–Speleers is one sufficient way to obtain these local stability and reproduction properties. Uniform constants in that construction give a family as defined here; this definition records the operator hypotheses used in the approximation proof.
Existence, uniqueness, and spline reduction for cubic smoothing
Statement
Assume the Axiom of Choice. Let , , and data satisfy the hypotheses of Natural cubic smoothing spline, with distinct inputs . Then has a unique minimizer over . It is the natural cubic spline with knots at , extended linearly to and where needed.
Facts & Assumptions
Given: AC; ; data on with at least two distinct input values; and the variational criterion .
Assume the Axiom of Choice The Axiom of Choice. It is used through the supplied one-dimensional Sobolev representative result below, not to choose an arbitrary family of splines.
, the data lie in , and there are at least two distinct input locations.
consists of classes whose weak derivatives through order two are classes (Integer-order Sobolev spaces and their norms).
Under AC, a one-dimensional class has a unique continuous representative on that is absolutely continuous and whose increments are integrals of its weak derivative (One-dimensional functions have unique absolutely continuous representatives).
For distinct knots and arbitrary values, the unique natural cubic interpolant exists and has linear tails (Natural cubic interpolation at distinct knots).
The criterion is the squared empirical residual plus times the integrated squared second weak derivative (Natural cubic smoothing spline).
In ZF, the Axiom of Choice implies Countable Choice and the prescribed-start form of Dependent Choice used by the Sobolev and representative interfaces (AC supplies the countable and dependent choices used in Banach integration).
Proof
Let and use the continuous representative in [F2] for and . The Countable Choice convention in [F1] and the choice hypotheses for [F2] are available by [F5] and [A1]. Interpolate the values by the natural cubic from [F3], and put . Then for every . On each interval between distinct knots, is constant; on the two linear tails, .
The natural spline with knots is uniquely determined by its nodal vector by [F3]. The tridiagonal system in the interpolation proof is linear in its data, and the interval formula is linear in the nodal values and second derivatives; hence is linear into the finite-dimensional space of piecewise-linear functions. Therefore is a finite nonnegative quadratic form. In these coordinates . The data term has positive-definite diagonal quadratic part because every occurs at least once. Adding the nonnegative quadratic form leaves a positive-definite quadratic objective, which has a unique minimizer by completing the square.
On each knot interval, the product is absolutely continuous, so the fundamental theorem of calculus gives . Summing over the intervals, the interior boundary terms cancel because and are continuous. At each outer endpoint, either on a linear tail or by the natural condition when that endpoint is a knot. The remaining terms are . Thus .
Since , expanding the square and applying step 2.1 yields Also for every observed input, so their data residual terms agree. Therefore , with equality only if almost everywhere.
Let be this finite-dimensional minimizer. Step 3.1 shows for every . If equality holds, then almost everywhere, so by [F2] is affine; its zero values at the two distinct knots force . Thus is the unique minimizer over the full Sobolev class, and its natural cubic form and linear tails are those of [F3].
Sobolev approximation by local spline quasi-interpolants
Statement
Assume the Axiom of Choice. Let , , and . Let be a nonempty family of clamped degree- knot meshes on , and let be a mesh-uniform bounded local quasi-interpolant family as in Bounded local spline quasi-interpolants, with common constants and . Fix , write , and let with its continuous Sobolev representative. For each nonempty cell of , let be its corresponding neighborhood and let be the largest cell length in . Then Writing , the global bound is where for . In particular, on a uniform mesh with interior knots of multiplicity , the cellwise projector onto is a local quasi-interpolant and gives the order- approximation bound for every integer .
Facts & Assumptions
Given: AC; , , ; a mesh-uniform family and a fixed mesh ; and real-valued .
Assume the Axiom of Choice The Axiom of Choice. It is used through the supplied one-dimensional Sobolev representative theorem for Taylor values and integral remainders.
, , real-valued , and belongs to the mesh-uniform family from Bounded local spline quasi-interpolants.
The class has weak derivatives through order in (Integer-order Sobolev spaces and their norms).
Under AC, each one-dimensional class has a unique absolutely continuous representative on the closed finite interval, with increments equal to integrals of its weak derivative (One-dimensional functions have unique absolutely continuous representatives).
For conjugate exponents, ; in particular the norm bounds the integral on a finite interval, with the usual endpoint conventions (Holder's inequality for integrals, including the endpoint cases).
Orthogonal vectors satisfy the Pythagorean identity (Pythagoras, the parallelogram identity, and the real and complex polarisation identities).
In ZF, the Axiom of Choice implies Countable Choice and the prescribed-start form of Dependent Choice used by the Sobolev and one-dimensional representative interfaces (AC supplies the countable and dependent choices used in Banach integration).
Proof
On any neighborhood , use the continuous representatives of , , supplied by [F2]. Their Sobolev-class convention [F1] and the choice hypotheses for [F2] are available under [A1] by [F5]. Repeated integration by parts for absolutely continuous functions gives the Taylor identity where . For completeness, the case is the increment formula in [F2]; passing from order to integrates by parts with antiderivative , producing the degree- endpoint term and the displayed remainder. For finite , Hölder [F3] bounds the pointwise remainder by , where and for ; multiplying by gives . For , integrating the kernel in the remainder gives the same bound.
Choose as the left endpoint of and write . Since reproduces , . Because , the triangle inequality and local stability give The definition gives ; applying step 1.1 proves the stated local estimate.
Raise the local estimates to the th power and sum over the disjoint mesh cells. Each point belongs to at most neighborhoods, so . Taking the th root and using gives the stated global bound for finite . For , take the maximum of the local bounds; the factor is .
For a uniform mesh with interior knots repeated times, is the space of independent degree- polynomials on the cells by the definition and basis theorem. On a cell , use the real pairing : it is finite by Hölder [F3], bilinear and symmetric by linearity of the integral, and positive definite since implies each set has measure zero, hence almost everywhere. Put , , and . For any nonzero coefficient vector , , since a nonzero polynomial has only finitely many roots; hence is invertible. For , put and , and define on . The defining equations give for every . Thus is linear, fixes , and has residual orthogonal to its range; Pythagoras [F4] gives . Assign knot values from the cell on their right and the value at by the left limit. The cellwise polynomials then form a member of . As varies, these operators form a mesh-uniform local quasi-interpolant family with one-cell neighborhoods, , and . Applying steps 1.1–3.1 with gives for .
Series least squares with a spline basis
Definition
Let , let be a specified -dimensional spline basis on the data domain, and let be observed real-valued data with inputs in that domain. In particular, one may specify the degree- B-spline basis . Form the design matrix with row . The series least-squares fitted training vector is the orthogonal projection of onto the column space of . Conditional on the realized design, this is the fixed-design least-squares fitted vector of Fixed-design least squares as orthogonal projection. Equivalently, it is for any minimizer of ; all such minimizers have the same fitted training vector. The training prediction loss relative to a specified target vector is . This definition specifies training fitted values and makes no test-risk assertion.
Expected empirical training risk for spline series least squares
Statement
Let be a probability space, let , and let , , be iid random elements of . Write for the law of and suppose the one-observation law is for a supplied Borel probability kernel from to . Assume a Borel function is supplied such that, for -almost every , , , and for a finite . Let be a fixed Borel -dimensional spline basis and assume a deterministic , a constant , and satisfy Then, with the fitted training vector from Series least squares with a spline basis and , This is expected empirical training-design loss.
Facts & Assumptions
Given: The iid pairs, conditional-law kernel and moment bound in the statement; a fixed -dimensional spline basis; and the deterministic approximation vector .
On the common probability space from the Statement, the pairs are iid with one-observation law , where is a supplied Borel probability kernel from the Borel space to the Borel space ; no kernel is selected from a family.
A Borel function is supplied, and for -almost every its conditional first absolute moment is finite, its conditional mean is , and its conditional squared residual moment is at most .
is a fixed Borel -dimensional spline basis, is the matrix with rows , and for the stated deterministic coefficient vector.
For the very spline basis specified in the Statement and [A3], the fitted training vector is the orthogonal projection of onto and agrees with every least-squares fitted vector (Series least squares with a spline basis); no different basis or spline space is used.
Real random variables are measurable maps, and their laws are pushforward probability measures (Random elements and real random variables, Law or distribution of a random element).
The observations are independent random elements; their joint law is the product of their marginal laws (Independent random elements, Independent random elements have product joint law).
A probability kernel assigns a probability measure to each input and has measurable event-evaluation maps (Measure kernel and probability kernel).
Finite product sigma-algebras are generated by measurable rectangles (The product sigma-algebra and its finite iterates).
Orthogonal projection is the unique nearest point in the subspace (The orthogonal projection is the unique nearest point in the subspace).
A finite independent list can be orthonormalized without changing its successive spans (Gram–Schmidt turns every finite independent list into an orthonormal list with the same successive spans).
For a fixed realized design matrix, its least-squares fitted vector is the orthogonal projection of the response onto the design column space, including when the design is rank deficient (Fixed-design least squares as orthogonal projection).
The orthogonal projection is the unique vector in the subspace whose residual is orthogonal to that subspace (The orthogonal projection is the -component in ).
For two sigma-finite factor measures, the product measure exists and has the rectangle formula; finite probability products are built by repeated application (For sigma-finite factors, the product measure exists, has the rectangle formula, is sigma-finite, and is unique).
A lambda-system containing a pi-system contains the sigma-algebra generated by that pi-system (Dynkin's pi-lambda theorem).
If is a nonnegative measurable function, then is a measure (The indefinite integral of a nonnegative measurable function is a measure).
For nonnegative product-measurable functions, integration over a finite product of sigma-finite spaces can be iterated in each coordinate (Tonelli's theorem for nonnegative measurable functions on a sigma-finite product).
Increasing nonnegative measurable functions on a measure space have integrals increasing to the integral of their pointwise limit (Monotone convergence for the integral).
Proof
Write and . For fixed , set and, for , apply [F10] to and to obtain ; both factors are probability measures, so the rectangle formula gives total mass one at each stage. Induction gives the finite product probability measure with rectangle values . The response rectangles form a pi-system because intersections of rectangles are rectangles, and [F5] says they generate the response product sigma-algebra. On response rectangles the evaluation is Borel in by [F4] and [F10]. Because is a probability measure, the class of sets with Borel evaluation contains the whole space, is closed under complements by subtraction from , and is closed under disjoint countable unions by limits of partial sums; [F11] therefore gives measurability for every response Borel set. For rectangles and , iid sampling gives , and repeated Tonelli [F13] gives For each fixed response rectangle , the left side of the target identity is a finite measure in ; the right side is also a measure by [F12], applied to the nonnegative measurable function . Design rectangles form a pi-system because intersections are rectangles and generate the design product sigma-algebra by [F5], so [F11] extends the equality to every design Borel . For each such , both sides are finite measures in : countable additivity on the right follows from countable additivity of and monotone convergence [F14], and their common total mass is because the joint design marginal is and is a probability kernel. Thus the response sets for which the identity holds for every form a Dynkin system (complements use the common total mass); they contain the response rectangles, so [F11] gives equality for every response Borel set. Hence is a conditional law of given . Under this product law the residuals are conditionally independent, have conditional means zero by [A2], and conditional second moments at most . Hence for and .
Let . The matrix is a Borel function of : partition the finite-dimensional matrix space by rank and, within each positive-rank stratum, by the lexicographically first nonzero maximal minor; on each resulting Borel piece, the corresponding independent columns form a matrix . The Gram matrix is positive definite, and is symmetric, idempotent, and has image , so it is the orthogonal projection; at rank zero put . These finitely many Borel formulas show that is measurable with respect to . Its rank is at most . Scanning the finitely many columns and retaining a column precisely when it is not in the span of those already retained gives a basis of ; applying Gram–Schmidt [F7] gives an matrix with orthonormal columns spanning that subspace. For any , belongs to and , so its residual is orthogonal to the columns of and hence to . By the uniqueness in [F9], ; therefore . Since , step 1.1 gives
Write . From [F1] and [F8], , and . In the orthogonal decomposition , the projection [F9] is identity on the first summand and zero on the second, so , because . For , ; the nearest-point property [F6] therefore gives .
Taking expectations in step 3.1, applying step 2.1 and then iid sampling with [A3] yields Divide by to obtain the claimed expected empirical training-risk bound.
Scope note
The generic inequality uses no choice axiom: the one-observation conditional kernel is an explicit model input, and the product-kernel identity is proved in step 1.1. The MSF-25 regression-target definition is used by the separate Sobolev-rate corollary, which states its AC, integrability, and selected-version assumptions. The MSF-03 loss/risk page is a required page prerequisite, but its current definition is parameter/action risk; the empirical training-prediction criterion is defined here separately and is not identified with independent test risk.
Sobolev rate for spline-series training risk
Statement
Assume AC. Let and let be real random variables on a common probability space with . Choose a regular conditional law of given , and let be the selected Borel regression-function version from Regression target and chosen version. Suppose is supported on and has a Lebesgue density bounded almost everywhere by a finite constant , for an integer , and for -almost every , where . Fix a degree with . For each integer , use the uniform partition into cells and the degree- B-spline space with each interior knot repeated times, so its dimension is . For iid observations from the joint law , let be the fitted training vector and . Then Choosing (equivalently for fixed ) gives expected empirical training risk . This is not an independent-test-risk bound.
Facts & Assumptions
Given: AC; integer orders and ; bounded design density on ; ; and the iid conditional-variance model of Expected empirical training risk for spline series least squares.
Assume AC The Axiom of Choice, as required by the one-dimensional Sobolev representative supplier used in the approximation theorem.
, is the selected regression-target version, , the design has a Lebesgue density bounded by , , , and with .
The generic empirical training-risk bound is plus the squared approximation error (Expected empirical training risk for spline series least squares).
For a bounded local quasi-interpolant reproducing , the approximation error is bounded by a constant times ; the cellwise projector on the full-multiplicity uniform spline mesh is an admissible choice (Sobolev approximation by local spline quasi-interpolants).
Under AC and , a supplied regular conditional law gives a Borel conditional-mean version on integrable fibers; smoothness of this chosen version is an additional hypothesis (Regression target and chosen version).
A clamped degree- knot vector with uniform cells, each of its interior knots repeated times, has knots and therefore B-splines; the B-splines form a basis of the piecewise-polynomial space (B-spline spaces and knot conventions, B-spline basis properties and polynomial reproduction).
Proof
By [F3], the conditional mean used here is the selected Borel version required by the data-model interface. Let be its continuous Sobolev representative on from [F2]; since has a Lebesgue density, -almost surely. On each cell of length , use the cellwise projector constructed in [F2] on . The resulting piecewise polynomial belongs to the spline space with full interior multiplicity . Its dimension is by [F4], so the global basis theorem gives a deterministic coefficient vector with . The projector family is local and reproduces , hence also ; [F2] gives . The density bound implies . Since and is fixed, , so the squared approximation error is at most . This supplies the approximation hypothesis of [F1] with and .
Insert this approximation bound into [F1]. The result is . For , both terms have order because and is fixed. The criterion is evaluated at the training inputs in [F1], so no independent test-risk statement follows.
5 · Examples, counterexamples and false statements
None yet.
Sources
- Tom Lyche, Carla Manni, and Hendrik Speleers, B-Splines and Spline Approximation, §§1.1–1.2
- Ryan Tibshirani, Nonparametric Regression: Splines and RKHS Methods, §§2.1–2.3
- 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.2–2.4
- Tom Lyche, Carla Manni, and Hendrik Speleers, B-Splines and Spline Approximation, §§2.1–2.2
- Ryan Tibshirani, Nonparametric Regression: Splines and RKHS Methods, §2.3
- Tom Lyche, Carla Manni, and Hendrik Speleers, B-Splines and Spline Approximation, §§2.1–2.2, Theorem 32 and Example 33
- Whitney K. Newey, Nonparametric and Semiparametric Estimation, MIT OCW 14.385, Fall 2007, §6, PDF pp. 9–11
- Whitney K. Newey, Nonparametric and Semiparametric Estimation, MIT OCW 14.385, Fall 2007, Proposition 3 and proof, PDF pp. 10–11
- Tom Lyche, Carla Manni, and Hendrik Speleers, B-Splines and Spline Approximation, Theorem 32, PDF pp. 28–29