Alphabeta Math
Pipeline-generated
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

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

DefinitionDefinition: Literature-sourcedProof: Not applicablejudge pass (gpt-6-luna)Open item page →

B-spline spaces and knot conventions

Definition

Let p∈N0, n≥p+1, and a<b. A clamped knot vector is a nondecreasing finite sequence ξ1=⋯=ξp+1=a<ξp+2≤⋯≤ξn<ξn+1=⋯=ξn+p+1=b, with ξj<ξj+p+1 for every 1≤j≤n. Empty interior ranges are omitted. The multiplicity μ(η) of an interior knot η is its number of occurrences among ξp+2,…,ξn.

Write Pp for the real polynomials of degree at most p. The degree-p spline space Sp,ξ consists of functions that restrict to a member of Pp on each nonempty knot interval and whose derivatives through order p−μ(η) agree across each interior knot η. The convention C−1 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 b use the left limit. Thus the function value at a discontinuous knot is specified.

For each degree d∈{0,…,p}, the functions Bj,d,ξ are indexed by 1≤j≤n+p−d. Set Bj,0,ξ(x)=1[ξj,ξj+1)(x),1≤j≤n+p. For 1≤d≤p and 1≤j≤n+p−d, define recursively Bj,d,ξ(x)=x−ξjξj+d−ξjBj,d−1,ξ(x)+ξj+d+1−xξj+d+1−ξj+1Bj+1,d−1,ξ(x), where a term with zero denominator is defined to be zero. For every degree d and every allowed index j, set Bj,d,ξ(b) equal to its left limit. In particular, the degree-p family has indices 1≤j≤n. Its basis and regularity properties are proved in B-spline basis properties and polynomial reproduction ↗.

DefinitionDefinition: Literature-sourcedProof: Not applicablejudge pass (gpt-6-luna)Open item page →

Natural cubic splines

Definition

Let [a,b] be a bounded interval and let a≤t1<⋯<tr≤b with r≥2. A natural cubic spline with knots t1,…,tr is a C2 function on [a,b] that is a polynomial of degree at most three on every [tj,tj+1], has second derivative zero at t1 and tr, and is extended linearly on [a,t1] and [tr,b] when those intervals are nonempty. The knots tj are the distinct breakpoints; repeated observations at the same input do not create additional knots.

TheoremStatement: Literature-sourcedProof: AI-generatedOpen item page →

B-spline basis properties and polynomial reproduction

Statement

Let p∈N0 and let ξ be a clamped knot vector as in B-spline spaces and knot conventions. The recursively defined degree-p B-splines are nonnegative, are supported on [ξj,ξj+p+1], and are piecewise polynomials of degree at most p. At a knot of multiplicity μ≤p, each B-spline is Cp−μ; multiplicity p+1 imposes no continuity requirement. On every nonempty knot interval [ξm,ξm+1), the active functions Bm−p,p,ξ,…,Bm,p,ξ form a basis of Pp and sum to one. Globally, the n B-splines form a basis of Sp,ξ. In particular, every q∈Pp has a unique expansion q=∑j=1ncjBj,p,ξ on [a,b].

Facts & Assumptions

Given: A degree p∈N0, a clamped knot vector ξ, and its recursively defined B-splines.

[F1]

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 Sp,ξ is the piecewise-polynomial space with the stated knot-multiplicity matching conditions (B-spline spaces and knot conventions).

[A1]

The knot vector is clamped, p∈N0, and every interior knot has multiplicity at most p+1.

Proof

technique · direct
1.1A1F1algebra

For p=0, support, piecewise degree, and nonnegativity follow from the indicator definition in [F1]. Inductively, each degree-p 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 [ξj,ξj+p+1]. Thus support, degree at most p, and nonnegativity hold for every p.

1.2A1F1algebra

Let the distinct interior knots be η1<⋯<ηs with multiplicities μ1,…,μs. For k≥1 set ur,k(x)=(x−ηr)k1[ηr,∞)(x) and set ur,0(x)=1[ηr,∞)(x); the value at ηr follows the right-cell convention of [F1]. The functions 1,x,…,xp together with ur,k for p−μr+1≤k≤p span Sp,ξ: start with the polynomial on the first interval, then at each knot the difference of adjacent pieces has its derivatives through p−μr equal to zero, so it is a linear combination of the listed powers, including the right-continuous step when μr=p+1. They are independent because restriction to successive knot intervals first forces the initial polynomial coefficients, then each new knot's coefficients, to vanish. Thus dim⁡Sp,ξ=p+1+∑rμr=n.

2.1F1givenstep 1.1algebra

Define ψj,0(y)=1 and ψj,d(y)=∏r=1d(y−ξj+r). When ξj+d>ξj, factoring ψj,d−1 gives (y−x)ψj,d−1(y)=x−ξjξj+d−ξjψj,d(y)+ξj+d−xξj+d−ξjψj−1,d(y). Fix a nonempty cell [ξm,ξm+1). At degree zero its sole nonzero indicator is Bm,0,ξ, so the local identity holds. Inductively, the degree-(d−1) local sum has indices m−d+1≤j≤m. For every such index, ξj≤ξm<ξm+1≤ξj+d, so the displayed identity has a strictly positive denominator. Multiply that local sum by y−x, apply the identity, and regroup with [F1]. The two extra lower-degree functions Bm−d,d−1,ξ and Bm+1,d−1,ξ vanish on the cell by support, even when their supports are empty; their recurrence terms are zero under [F1]. Thus (y−x)d=∑i=m−dmψi,d(y)Bi,d,ξ(x) for 0≤d≤p, and in particular for d=p.

3.1A1step 2.1algebra

Differentiate the identity in step 2.1 exactly p−k times in y and set y=0, for each 0≤k≤p. Since dp−kdyp−k(y−x)p∣y=0=p!k!(−x)k, this yields xk=∑i=m−pm[(−1)kk!p!ψi,p(p−k)(0)]Bi,p,ξ(x). The coefficients do not depend on m, so this is a single expansion valid on every knot interval. Linear combination proves reproduction of every member of Pp; taking left limits extends the expansion to b.

3.2A1F1step 1.1step 2.1algebra

Fix an open nonempty knot interval (ξm,ξm+1) and p≥1. The p+1 dual polynomials ψi,p, m−p≤i≤m, form a basis of Pp in y: differentiating the identity of step 2.1 in x at an interior point x0 shows that their span contains (y−x0)k for every 0≤k≤p. For m−p+1≤i≤m, the span ξi+p−ξi is strictly positive and factoring gives ψi,p−ψi−1,p=−(ξi+p−ξi)ψi,p−1. Differentiate the degree-p local identity in x and use the degree-(p−1) identity and this difference formula to obtain ∑i=m−pmBi,p,ξ′ψi,p=p∑i=m−p+1mBi,p−1,ξξi+p−ξi(ψi,p−ψi−1,p). Comparison in the dual basis yields Bj,p,ξ′=p(Bj,p−1,ξξj+p−ξj−Bj+1,p−1,ξξj+p+1−ξj+1) 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.

4.1A1step 3.1algebra

Taking k=0 in step 3.1 gives ∑i=m−pmBi,p,ξ(x)=1. Step 3.1 also shows that these p+1 active functions span Pp on the interval. Because dim⁡Pp=p+1, they are linearly independent there and are a local basis.

4.2A1step 3.2F1algebra

Induct on p. If the knot multiplicity μ≤p−1, the lower-degree splines in the recurrence are continuous there by induction, so the recurrence makes Bj,p,ξ continuous; the derivative formula then makes its derivative Cp−1−μ, hence Bj,p,ξ∈Cp−μ. If μ=p, a B-spline whose support crosses the repeated knot has one nonzero piece on either side, namely (x−ξj)p/(ξj+p−ξj)p and (ξj+p+1−x)p/(ξj+p+1−ξj+1)p; both one-sided limits equal 1, while any B-spline not crossing it has zero endpoint value there. If μ=p+1, the required order is C−1 and no matching is asserted.

5.1A1step 3.1step 4.1step 1.2step 1.1step 4.2algebra∎

The smoothness and piecewise-degree properties from steps 1.1 and 4.2 put every B-spline in Sp,ξ. If a linear combination of all n 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 n independent members of the n-dimensional space in step 1.2, hence form its basis. The unique global expansion includes every polynomial from step 3.1.

TheoremStatement: Literature-sourcedProof: AI-generatedjudge pass (gpt-6-luna)Open item page →

Natural cubic interpolation at distinct knots

Statement

Let r≥2, a≤x1<⋯<xr≤b, and y1,…,yr∈R. There is exactly one natural cubic spline s on [a,b] with s(xi)=yi for each i. On each interval [xi,xi+1] it is the cubic with endpoint values yi,yi+1 and endpoint second derivatives Mi,Mi+1, where M1=Mr=0 and the interior values solve the positive-definite tridiagonal system hi−1Mi−1+2(hi−1+hi)Mi+hiMi+1=6(yi+1−yihi−yi−yi−1hi−1),2≤i≤r−1, with hi=xi+1−xi>0. The interpolant is linear outside [x1,xr].

Facts & Assumptions

Given: r≥2, strictly increasing knots x1<⋯<xr in [a,b], and arbitrary values yi∈R.

[F1]

A natural cubic spline is C2, 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).

[A1]

r≥2, x1<⋯<xr in [a,b], and y1,…,yr are arbitrary real values.

Proof

technique · direct
1.1A1algebra

Put hi=xi+1−xi and di=(yi+1−yi)/hi. For r=2 there are no interior second derivatives to solve. For r≥3, let A be the (r−2)×(r−2) symmetric tridiagonal matrix with diagonal entry 2(hi−1+hi) in row i and adjacent off-diagonal entries hi. For a nonzero vector v=(v2,…,vr−1), using 2vivi+1≥−vi2−vi+12 gives vTAv≥∑i=2r−1(hi−1+hi)vi2>0. Thus A is positive definite and invertible, so the displayed system has exactly one solution M2,…,Mr−1.

2.1A1F1step 1.1algebraconstruct

On [xi,xi+1], define si(x)=Mi(xi+1−x)3+Mi+1(x−xi)36hi+(yi−Mihi26)xi+1−xhi+(yi+1−Mi+1hi26)x−xihi. Direct substitution gives si(xi)=yi, si(xi+1)=yi+1, and si′′(xi)=Mi, si′′(xi+1)=Mi+1. Its left and right endpoint slopes are respectively si′(xi)=di−Mihi/3−Mi+1hi/6 and si′(xi+1)=di+Mihi/6+Mi+1hi/3. Equating the right slope from si−1 and the left slope from si gives the tridiagonal equation at xi. Hence the pieces join C1; their second derivatives are linear with the same nodal values, so they join C2. At the extreme knots M1=Mr=0, so adjoining the tangent line gives the required linear tails and preserves C2. For r=2, the formula is the straight line between the two values and the same endpoint argument applies.

3.1A1F1step 1.1step 2.1algebra∎

Any natural cubic interpolant has nodal second derivatives with M1=Mr=0. 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 si 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.

DefinitionDefinition: Literature-sourcedProof: Not applicableOpen item page →

Natural cubic smoothing spline

Definition

Assume AC. Let [a,b] be a bounded interval, let (xi,yi)i=1n∈([a,b]×R)n, assume at least two distinct input values, and let λ>0. For g∈W2,2(a,b) use its unique continuous representative on [a,b] 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 J(g)=∑i=1n(yi−g(xi))2+λ∫ab∣D2g(t)∣2 dt.

The requirement of two distinct inputs is essential. The penalty is the squared L2 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.

DefinitionDefinition: Literature-sourcedProof: Not applicablejudge pass (gpt-6-luna)Open item page →

Bounded local spline quasi-interpolants

Definition

Fix a bounded interval [a,b], a degree p∈N0, an exponent 1≤q≤∞, an integer 0≤l≤p, and a nonempty family T of clamped degree-p knot meshes on [a,b]. A mesh-uniform bounded local quasi-interpolant is a family of real-linear maps Qξ:C([a,b];R)→Sp,ξ, one for each ξ∈T, for which there are common constants M∈N and 0≤CQ<∞ such that the following hold for every ξ∈T and every nonempty cell Im of its mesh: there is a neighborhood Jξ,m⊆[a,b] containing Im and formed from at most M adjacent knot cells; each point of [a,b] belongs to at most M of the neighborhoods Jξ,m; (i) if f=g almost everywhere on Jξ,m, then Qξf=Qξg almost everywhere on Im; (ii) Qξv=v for every v∈Pl; and (iii) ∥Qξf∥Lq(Im)≤CQ∥f∥Lq(Jξ,m). The constants M and CQ 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 W1,p 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.

TheoremStatement: Literature-sourcedProof: AI-generatedOpen item page →

Existence, uniqueness, and spline reduction for cubic smoothing

Statement

Assume the Axiom of Choice. Let [a,b], λ>0, and data (xi,yi)i=1n satisfy the hypotheses of Natural cubic smoothing spline, with r≥2 distinct inputs t1<⋯<tr. Then J has a unique minimizer over W2,2(a,b). It is the natural cubic spline with knots at t1,…,tr, extended linearly to a and b where needed.

Facts & Assumptions

Given: AC; λ>0; data on [a,b] with at least two distinct input values; and the variational criterion J.

[A1]

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.

[A2]

λ>0, the data lie in [a,b]×R, and there are at least two distinct input locations.

[F1]

W2,2(a,b) consists of L2 classes whose weak derivatives through order two are L2 classes (Integer-order Sobolev spaces and their norms).

[F2]

Under AC, a one-dimensional W1,2(a,b) class has a unique continuous representative on [a,b] that is absolutely continuous and whose increments are integrals of its weak derivative (One-dimensional W1,p functions have unique absolutely continuous representatives).

[F3]

For r≥2 distinct knots and arbitrary values, the unique natural cubic interpolant exists and has linear tails (Natural cubic interpolation at distinct knots).

[F4]

The criterion J is the squared empirical residual plus λ times the integrated squared second weak derivative (Natural cubic smoothing spline).

[F5]

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

technique · direct
1.1A1A2F1F2F3F5given

Let g∈W2,2(a,b) and use the continuous representative in [F2] for g and g′. The Countable Choice convention in [F1] and the choice hypotheses for [F2] are available by [F5] and [A1]. Interpolate the values g(tj) by the natural cubic s from [F3], and put h=g−s. Then h(tj)=0 for every j. On each interval between distinct knots, s′′′ is constant; on the two linear tails, s′′=s′′′=0.

1.2A2F3F4algebra

The natural spline with knots t1,…,tr is uniquely determined by its nodal vector z=(s(t1),…,s(tr))∈Rr 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 z↦sz′′ is linear into the finite-dimensional space of piecewise-linear functions. Therefore R(z)=∫∣sz′′∣2 is a finite nonnegative quadratic form. In these coordinates J(s)=∑j∑i:xi=tj(yi−zj)2+λR(z). The data term has positive-definite diagonal quadratic part because every tj occurs at least once. Adding the nonnegative quadratic form λR leaves a positive-definite quadratic objective, which has a unique minimizer by completing the square.

2.1F2F3step 1.1algebra

On each knot interval, the product s′′h′ is absolutely continuous, so the fundamental theorem of calculus gives ∫s′′h′′=[s′′h′]−∫s′′′h′. Summing over the intervals, the interior boundary terms cancel because s′′ and h′ are continuous. At each outer endpoint, s′′=0 either on a linear tail or by the natural condition when that endpoint is a knot. The remaining terms are −s′′′∣(tj,tj+1)(h(tj+1)−h(tj))=0. Thus ∫abs′′h′′=0.

3.1A2F4step 2.1algebrastep 1.1F3

Since g=s+h, expanding the square and applying step 2.1 yields ∫ab∣g′′∣2=∫ab∣s′′∣2+∫ab∣h′′∣2. Also s(xi)=g(xi) for every observed input, so their data residual terms agree. Therefore J(g)=J(s)+λ∫ab∣h′′∣2≥J(s), with equality only if h′′=0 almost everywhere.

4.1A2F2F3step 3.1step 1.2algebrastep 1.1∎

Let s∗ be this finite-dimensional minimizer. Step 3.1 shows J(g)≥J(s∗) for every g∈W2,2. If equality holds, then h′′=0 almost everywhere, so by [F2] h is affine; its zero values at the two distinct knots t1,tr force h=0. Thus s∗ is the unique minimizer over the full Sobolev class, and its natural cubic form and linear tails are those of [F3].

TheoremStatement: Literature-sourcedProof: AI-generatedjudge pass (gpt-6-luna)Open item page →

Sobolev approximation by local spline quasi-interpolants

Statement

Assume the Axiom of Choice. Let p∈N0, 0≤l≤p, and 1≤q≤∞. Let T be a nonempty family of clamped degree-p knot meshes on [a,b], and let (Qξ)ξ∈T be a mesh-uniform bounded local quasi-interpolant family as in Bounded local spline quasi-interpolants, with common constants M and CQ. Fix ξ∈T, write Q=Qξ, and let f∈Wl+1,q(a,b;R) with its continuous Sobolev representative. For each nonempty cell Im of ξ, let Jm be its corresponding neighborhood and let hm be the largest cell length in Jm. Then ∥f−Qf∥Lq(Im)≤(1+CQ)Ml+1l!hml+1∥Dl+1f∥Lq(Jm). Writing h=max⁡mhm, the global bound is ∥f−Qf∥Lq([a,b])≤(1+CQ)Ml+1+1/ql!hl+1∥Dl+1f∥Lq([a,b]), where 1/q=0 for q=∞. In particular, on a uniform mesh with interior knots of multiplicity p+1, the cellwise L2 projector onto Pp is a local quasi-interpolant and gives the order-hs approximation bound for every integer 1≤s≤p+1.

Facts & Assumptions

Given: AC; p∈N0, 0≤l≤p, 1≤q≤∞; a mesh-uniform family (Qξ)ξ∈T and a fixed mesh ξ∈T; and real-valued f∈Wl+1,q(a,b;R).

[A1]

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.

[A2]

0≤l≤p, 1≤q≤∞, real-valued f∈Wl+1,q(a,b;R), and Qξ belongs to the mesh-uniform family from Bounded local spline quasi-interpolants.

[F1]

The Wl+1,q class has weak derivatives through order l+1 in Lq (Integer-order Sobolev spaces and their norms).

[F2]

Under AC, each one-dimensional W1,q class has a unique absolutely continuous representative on the closed finite interval, with increments equal to integrals of its weak derivative (One-dimensional W1,p functions have unique absolutely continuous representatives).

[F3]

For conjugate exponents, ∫∣uv∣≤∥u∥q∥v∥q′; in particular the Lq norm bounds the integral on a finite interval, with the usual q=1,∞ endpoint conventions (Holder's inequality for integrals, including the endpoint cases).

[F4]
[F5]

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

technique · direct
1.1A1A2F1F2F3F5givenalgebra

On any neighborhood J=[c,d], use the continuous representatives of Djf, 0≤j≤l, 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 f(x)−Tc,lf(x)=1l!∫cx(x−t)lDl+1f(t) dt, where Tc,lf(x)=∑j=0lDjf(c)(x−c)j/j!. For completeness, the case l=0 is the increment formula in [F2]; passing from order l−1 to l integrates ∫cx(x−t)l−1Dlf(t)dt by parts with antiderivative −(x−t)l/l, producing the degree-l endpoint term and the displayed remainder. For finite q, Hölder [F3] bounds the pointwise remainder by ∣J∣l+1/q′/l! ∥Dl+1f∥Lq(J), where 1/q′=1−1/q and 1/q′=0 for q=1; multiplying by ∣J∣1/q gives ∥f−Tc,lf∥Lq(J)≤∣J∣l+1∥Dl+1f∥Lq(J)/l!. For q=∞, integrating the kernel in the remainder gives the same bound.

2.1A2F1step 1.1givenalgebra

Choose c as the left endpoint of Jm and write T=Tc,lf. Since Q reproduces Pl, QT=T. Because Im⊆Jm, the triangle inequality and local stability give ∥f−Qf∥Lq(Im)≤∥f−T∥Lq(Im)+∥Q(f−T)∥Lq(Im)≤(1+CQ)∥f−T∥Lq(Jm). The definition gives ∣Jm∣≤Mhm; applying step 1.1 proves the stated local estimate.

3.1A2step 2.1givenalgebra

Raise the local estimates to the qth power and sum over the disjoint mesh cells. Each point belongs to at most M neighborhoods, so ∑m∥Dl+1f∥Lq(Jm)q≤M∥Dl+1f∥Lq([a,b])q. Taking the qth root and using hm≤h gives the stated global bound for finite q. For q=∞, take the maximum of the local bounds; the factor M1/q is 1.

4.1A2F1F3F4step 1.1step 2.1step 3.1givenconstruct∎

For a uniform mesh with interior knots repeated p+1 times, Sp,ξ is the space of independent degree-p polynomials on the cells by the definition and basis theorem. On a cell I, use the real L2(I) pairing ⟨u,v⟩I=∫Iuv: it is finite by Hölder [F3], bilinear and symmetric by linearity of the integral, and positive definite since ∫Iu2=0 implies each set {∣u∣≥1/m} has measure zero, hence u=0 almost everywhere. Put ϕj(x)=xj, 0≤j≤p, and Gij=⟨ϕi,ϕj⟩I. For any nonzero coefficient vector c, cTGc=∫I(∑jcjxj)2>0, since a nonzero polynomial has only finitely many roots; hence G is invertible. For f∈L2(I), put bi=⟨f,ϕi⟩I and c=G−1b, and define Qhf=∑j=0pcjϕj on I. The defining equations give ⟨f−Qhf,ϕi⟩I=0 for every i. Thus Qh is linear, fixes Pp, and has residual orthogonal to its range; Pythagoras [F4] gives ∥Qhf∥L2(I)≤∥f∥L2(I). Assign knot values from the cell on their right and the value at b by the left limit. The cellwise polynomials then form a member of Sp,ξ. As J varies, these operators form a mesh-uniform local quasi-interpolant family with one-cell neighborhoods, M=1, and CQ=1. Applying steps 1.1–3.1 with l=s−1 gives ∥f−Qhf∥L2≤2hs∥Dsf∥L2/(s−1)! for 1≤s≤p+1.

DefinitionDefinition: Literature-sourcedProof: Not applicableOpen item page →

Series least squares with a spline basis

Definition

Let n,K≥1, let pK(x)=(s1(x),…,sK(x))T be a specified K-dimensional spline basis on the data domain, and let (Xi,Yi)i=1n be observed real-valued data with inputs in that domain. In particular, one may specify the degree-p B-spline basis pK(x)=(B1,p,ξ(x),…,BK,p,ξ(x))T. Form the design matrix P∈Rn×K with row pK(Xi)T. The series least-squares fitted training vector is g^K=Πcol⁡(P)Y, the orthogonal projection of Y=(Y1,…,Yn)T onto the column space of P. 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 Pβ^ for any minimizer β^ of ∥Y−Pβ∥22; all such minimizers have the same fitted training vector. The training prediction loss relative to a specified target vector g0=(g0(X1),…,g0(Xn))T is n−1∥g^K−g0∥22. This definition specifies training fitted values and makes no test-risk assertion.

TheoremStatement: Literature-sourcedProof: AI-generatedOpen item page →

Expected empirical training risk for spline series least squares

Statement

Let (Ω,F,P) be a probability space, let n,K≥1, and let Zi=(Xi,Yi), 1≤i≤n, be iid random elements of ([a,b]×R,B([a,b])⊗B(R)). Write PX for the law of X1 and suppose the one-observation law is PX(dx)κ(x,dy) for a supplied Borel probability kernel κ from ([a,b],B([a,b])) to (R,B(R)). Assume a Borel function g0:[a,b]→R is supplied such that, for PX-almost every x, ∫∣y∣ κ(x,dy)<∞, g0(x)=∫y κ(x,dy), and ∫(y−g0(x))2 κ(x,dy)≤Δ for a finite Δ≥0. Let pK:[a,b]→RK be a fixed Borel K-dimensional spline basis and assume a deterministic βˉK∈RK, a constant C≥0, and γ>0 satisfy ∫[a,b]{g0(x)−pK(x)TβˉK}2 PX(dx)≤C2K−2γ. Then, with the fitted training vector g^K from Series least squares with a spline basis and g0=(g0(X1),…,g0(Xn))T, E[1n∥g^K−g0∥22]≤ΔKn+C2K−2γ. This is expected empirical training-design loss.

Facts & Assumptions

Given: The iid pairs, conditional-law kernel and moment bound in the statement; a fixed K-dimensional spline basis; and the deterministic approximation vector βˉK.

[A1]

On the common probability space from the Statement, the pairs (Xi,Yi) are iid with one-observation law PX(dx)κ(x,dy), where κ is a supplied Borel probability kernel from the Borel space [a,b] to the Borel space R; no kernel is selected from a family.

[A2]

A Borel function g0 is supplied, and for PX-almost every x its conditional first absolute moment is finite, its conditional mean is g0(x), and its conditional squared residual moment is at most Δ.

[A3]

pK:[a,b]→RK is a fixed Borel K-dimensional spline basis, D is the matrix with rows pK(Xi)T, and ∫[a,b]{g0(x)−pK(x)TβˉK}2PX(dx)≤C2K−2γ for the stated deterministic coefficient vector.

[F1]

For the very spline basis pK specified in the Statement and [A3], the fitted training vector is the orthogonal projection of Y onto col⁡(D) and agrees with every least-squares fitted vector (Series least squares with a spline basis); no different basis or spline space is used.

[F2]

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).

[F3]

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).

[F4]

A probability kernel assigns a probability measure to each input and has measurable event-evaluation maps (Measure kernel and probability kernel).

[F5]

Finite product sigma-algebras are generated by measurable rectangles (The product sigma-algebra and its finite iterates).

[F6]

Orthogonal projection is the unique nearest point in the subspace (The orthogonal projection is the unique nearest point in the subspace).

[F7]

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).

[F8]

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).

[F9]

The orthogonal projection is the unique vector in the subspace whose residual is orthogonal to that subspace (The orthogonal projection PWv is the W-component in V=W⊕W⊥).

[F10]

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).

[F11]

A lambda-system containing a pi-system contains the sigma-algebra generated by that pi-system (Dynkin's pi-lambda theorem).

[F12]

If f is a nonnegative measurable function, then A↦∫Af dμ is a measure (The indefinite integral of a nonnegative measurable function is a measure).

[F13]

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).

[F14]

Increasing nonnegative measurable functions on a measure space have integrals increasing to the integral of their pointwise limit (Monotone convergence for the integral).

Proof

technique · direct
1.1A1A2F2F3F4F5F10F11F12F13F14givenalgebraconstruct

Write X=(X1,…,Xn) and ϵi=Yi−g0(Xi). For fixed x, set κ1=κ(x1,⋅) and, for 1≤m<n, apply [F10] to κm and κ(xm+1,⋅) to obtain κm+1; both factors are probability measures, so the rectangle formula gives total mass one at each stage. Induction gives the finite product probability measure κn(x,⋅) with rectangle values κn(x,∏iBi)=∏iκ(xi,Bi). 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 x by [F4] and [F10]. Because κn(x,⋅) is a probability measure, the class of sets with Borel evaluation contains the whole space, is closed under complements by subtraction from 1, and is closed under disjoint countable unions by limits of partial sums; [F11] therefore gives measurability for every response Borel set. For rectangles A=∏iAi and B=∏iBi, iid sampling gives P(X∈A,Y∈B)=∏i∫Aiκ(x,Bi)PX(dx), and repeated Tonelli [F13] gives ∫Aκn(x,B)PX⊗n(dx)=∏i∫Aiκ(x,Bi)PX(dx). For each fixed response rectangle B, the left side of the target identity is a finite measure in A; the right side is also a measure by [F12], applied to the nonnegative measurable function x↦κn(x,B). 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 A. For each such A, both sides are finite measures in B: countable additivity on the right follows from countable additivity of κn(x,⋅) and monotone convergence [F14], and their common total mass is PX⊗n(A) because the joint design marginal is PX⊗n and κn is a probability kernel. Thus the response sets B for which the identity holds for every A 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 κn is a conditional law of Y given X. Under this product law the residuals are conditionally independent, have conditional means zero by [A2], and conditional second moments at most Δ. Hence E[ϵiϵj∣X]=0 for i≠j and E[ϵi2∣X]≤Δ.

2.1A1A3F7F9step 1.1algebraconstruct

Let Q=Πcol⁡(D). The matrix Q is a Borel function of D: 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 C. The Gram matrix CTC is positive definite, and C(CTC)−1CT is symmetric, idempotent, and has image col⁡(C)=col⁡(D), so it is the orthogonal projection; at rank zero put Q=0. These finitely many Borel formulas show that Q is measurable with respect to X. Its rank r is at most K. 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 col⁡(D); applying Gram–Schmidt [F7] gives an n×r matrix U with orthonormal columns spanning that subspace. For any v, UUTv belongs to col⁡(D) and UT(v−UUTv)=0, so its residual is orthogonal to the columns of U and hence to col⁡(D). By the uniqueness in [F9], Q=UUT; therefore tr⁡(Q)=tr⁡(UTU)=r≤K. Since Qii=∥Qei∥22≥0, step 1.1 gives E[ϵTQϵ∣X]=∑iQiiE[ϵi2∣X]≤Δtr⁡(Q)≤ΔK.

3.1A3F1F6F8F9step 2.1algebra

Write g=(g0(X1),…,g0(Xn))T. From [F1] and [F8], g^K=QY, and Y=g+ϵ. In the orthogonal decomposition Rn=col⁡(D)⊕col⁡(D)⊥, the projection [F9] is identity on the first summand and zero on the second, so QT=Q=Q2, ∥g^K−g∥22=∥Qϵ−(I−Q)g∥22=ϵTQϵ+∥(I−Q)g∥22, because Q(I−Q)=0. For gˉ=DβˉK∈col⁡(D), (I−Q)gˉ=0; the nearest-point property [F6] therefore gives ∥(I−Q)g∥22≤∥g−gˉ∥22.

4.1A3step 2.1step 3.1algebra∎

Taking expectations in step 3.1, applying step 2.1 and then iid sampling with [A3] yields E∥g^K−g∥22≤ΔK+E∑i=1n{g0(Xi)−pK(Xi)TβˉK}2≤ΔK+nC2K−2γ. Divide by n 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.

CorollaryStatement: Literature-sourcedProof: AI-generatedjudge pass (gpt-6-luna)Open item page →

Sobolev rate for spline-series training risk

Statement

Assume AC. Let a<b and let X,Y be real random variables on a common probability space with E∣Y∣<∞. Choose a regular conditional law Q(x,dy) of Y given X=x, and let g0 be the selected Borel regression-function version from Regression target and chosen version. Suppose PX is supported on [a,b] and has a Lebesgue density bounded almost everywhere by a finite constant MX, g0∣(a,b)∈Ws,2(a,b) for an integer s≥1, and ∫(y−g0(x))2Q(x,dy)≤Δ for PX-almost every x, where 0≤Δ<∞. Fix a degree p∈N0 with p≥s−1. For each integer J≥1, use the uniform partition into J cells and the degree-p B-spline space with each interior knot repeated p+1 times, so its dimension is K=(p+1)J. For n≥1 iid observations from the joint law PX(dx)Q(x,dy), let g^K be the fitted training vector and g0=(g0(X1),…,g0(Xn))T. Then E[1n∥g^K−g0∥22]≤ΔKn+Cs,p,MX,a,b K−2s∥Dsg0∥L2(a,b)2. Choosing J≍n1/(2s+1) (equivalently K≍n1/(2s+1) for fixed p) gives expected empirical training risk O(n−2s/(2s+1)). This is not an independent-test-risk bound.

Facts & Assumptions

Given: AC; integer orders s≥1 and p≥s−1; bounded design density on [a,b]; g0∈Ws,2(a,b); and the iid conditional-variance model of Expected empirical training risk for spline series least squares.

[A1]

Assume AC The Axiom of Choice, as required by the one-dimensional Sobolev representative supplier used in the approximation theorem.

[A2]

E∣Y∣<∞, g0 is the selected regression-target version, g0∣(a,b)∈Ws,2(a,b), the design has a Lebesgue density bounded by MX, 0≤Δ<∞, s∈N, and p∈N0 with p≥s−1.

[F1]

The generic empirical training-risk bound is ΔK/n plus the squared L2(PX) approximation error (Expected empirical training risk for spline series least squares).

[F2]

For a bounded local quasi-interpolant reproducing Ps−1, the L2 approximation error is bounded by a constant times hs∥Dsg0∥2; the cellwise L2 projector on the full-multiplicity uniform spline mesh is an admissible choice (Sobolev approximation by local spline quasi-interpolants).

[F3]

Under AC and E∣Y∣<∞, a supplied regular conditional law gives a Borel conditional-mean version g0(x)=∫y Q(x,dy) on integrable fibers; smoothness of this chosen version is an additional hypothesis (Regression target and chosen version).

[F4]

A clamped degree-p knot vector with J uniform cells, each of its J−1 interior knots repeated p+1 times, has N=(J+1)(p+1) knots and therefore K=N−p−1=(p+1)J 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

technique · direct
1.1A1A2F2F3F4givenalgebraconstruct

By [F3], the conditional mean used here is the selected Borel version required by the data-model interface. Let f be its continuous Sobolev representative on [a,b] from [F2]; since PX has a Lebesgue density, f=g0 PX-almost surely. On each cell of length h=(b−a)/J, use the cellwise L2 projector Qh constructed in [F2] on f. The resulting piecewise polynomial belongs to the spline space with full interior multiplicity p+1. Its dimension is K=(p+1)J by [F4], so the global basis theorem gives a deterministic coefficient vector βˉK with Qhf=pKTβˉK. The projector family is local and reproduces Pp, hence also Ps−1; [F2] gives ∥f−Qhf∥L2(a,b)≤Cs,phs∥Dsf∥L2(a,b). The density bound implies ∫∣g0−pKTβˉK∣2dPX=∥f−Qhf∥L2(PX)2≤MX∥f−Qhf∥L2(a,b)2. Since K=(p+1)J and p is fixed, h≍K−1, so the squared approximation error is at most Cs,p,MX,a,bK−2s∥Dsf∥22. This supplies the approximation hypothesis of [F1] with γ=s and C=Cs,p,MX,a,b1/2∥Dsf∥2≥0.

2.1A1A2F1step 1.1algebra∎

Insert this approximation bound into [F1]. The result is ΔK/n+Cs,p,MX,a,bK−2s∥Dsg0∥22. For J≍n1/(2s+1), both terms have order n−2s/(2s+1) because K=(p+1)J and p 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