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 — Examples

1 · Prerequisites

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

ExampleConstruction: AI-generatedVerification: AI-generatedjudge pass (gpt-6-luna)Open item page →

A quadratic Bernstein B-spline basis

Example

Take degree p=2 and clamped knot vector (0,0,0,1,1,1). On [0,1] its three B-splines are (1−x)2, 2x(1−x), and x2. They form a nonnegative partition of unity and hence a basis of P2.

Facts & Assumptions

Given: The degree-two clamped knot vector (0,0,0,1,1,1).

[F1]

Degree-zero B-splines are knot-interval indicators and higher degrees follow the stated recurrence (B-spline spaces and knot conventions).

[F2]

For a clamped knot vector, the degree-p B-splines form a basis and reproduce every polynomial of degree at most p (B-spline basis properties and polynomial reproduction).

[A1]

The degree is p=2, the domain is [0,1], and the knot vector is (0,0,0,1,1,1).

Verification

Given: p=2, knots (0,0,0,1,1,1), and x∈[0,1].

1.1A1F1algebra

The only nonzero degree-zero spline on (0,1) is B3,0=1. Applying the recurrence [F1] first at degree one gives B2,1=1−x and B3,1=x. Applying it again gives B1,2=(1−x)2, B2,2=x(1−x)+x(1−x)=2x(1−x), and B3,2=x2. Each is nonnegative on [0,1] and their sum is (1−x)2+2x(1−x)+x2=1.

2.1A1F2step 1.1algebra∎

For q(x)=a+bx+cx2, choose coefficients a, a+b/2, and a+b+c. Their B-spline combination is a(1−x)2+2(a+b/2)x(1−x)+(a+b+c)x2=a+bx+cx2. Thus every quadratic is reproduced; uniqueness of the coefficient vector follows from the basis assertion [F2].

ExampleConstruction: AI-generatedVerification: AI-generatedjudge pass (gpt-6-luna)Open item page →

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 0,1,2 and values 0,1,0, the middle second derivative is −3, and the interpolant is s(x)={32x−12x3,0≤x≤1,32(2−x)−12(2−x)3,1≤x≤2.

Facts & Assumptions

Given: The natural cubic convention and distinct-knot interpolation theorem.

[F1]

Natural cubic splines are C2, piecewise cubic, have zero second derivative at the extreme knots, and have linear tails (Natural cubic splines).

[F2]

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

[A1]

The first data set has two distinct knots; the second has knots 0,1,2 and values 0,1,0.

Verification

Given: The data sets (0,y1),(1,y2) and (0,0),(1,1),(2,0).

1.1A1F1F2algebra

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.

1.2A1F2algebra

For the three-knot data, h1=h2=1 and the secant slopes are d1=1, d2=−1. The one interior system equation is 4M2=6(d2−d1)=−12, so M2=−3 while M1=M3=0.

2.1A1F1F2step 1.2algebra∎

Substitution in the interval formula gives the displayed pieces. They interpolate 0,1,0; their first derivatives at 1 are both 0, their second derivatives at 1 are both −3, and the second derivatives at 0,2 are 0. Thus they join to a natural cubic spline, which is unique by [F2].

CounterexampleConstruction: AI-generatedVerification: AI-generatedOpen item page →

One observation does not determine a natural cubic smoothing fit

Statement refuted

The formula ∑i(yi−g(xi))2+λ∫ab∣D2g∣2 has a unique minimizing function for every nonempty data set whenever λ>0, 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.

[F1]

On data sets with at least two distinct inputs, the natural cubic smoothing criterion is ∑i(yi−g(xi))2+λ∫ab∣D2g∣2 (Natural cubic smoothing spline); the counterexample below evaluates this same formula on one input, outside that definition's domain.

[A1]

The extended criterion has one input x1=1/2, response y1=1, and λ>0.

Counterexample

Take the domain [0,1], one observation (x1,y1)=(1/2,1), and λ>0. Extend the displayed criterion formula to this data set. For every c∈R, set gc(x)=1+c(x−1/2). Then gc(1/2)=1 and D2gc=0.

Given: The one-point criterion J(g)=(1−g(1/2))2+λ∫01∣g′′(x)∣2dx.

1.1A1F1algebra

For every c, both terms in [F1] vanish at gc, so J(gc)=0. The criterion is a sum of nonnegative terms, hence zero is its minimum.

2.1A1step 1.1algebra∎

If c≠d, then gc(1)=1+c/2≠1+d/2=gd(1), so gc and gd are distinct minimizers. The one-observation extension is not unique, proving the lower bound of two distinct inputs is necessary.

ExampleConstruction: AI-generatedVerification: AI-generatedOpen item page →

Uniform-mesh linear spline approximation

Example

For each integer J≥1, let 0=t0<t1<⋯<tJ=1 be the uniform partition with mesh h=1/J. For real-valued f∈W2,∞(0,1;R), its continuous representative has a piecewise-linear interpolant Ihf in the degree-one spline space with simple interior knots.

Facts & Assumptions

Given: AC, a uniform partition of [0,1], and real-valued f∈W2,∞(0,1;R).

[A1]

Assume the Axiom of Choice The Axiom of Choice, as required by the supplied Sobolev representative theorem.

[F1]

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

[F2]

A local quasi-interpolant that reproduces affine functions and is bounded on each cell has L∞ 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).

[F3]

Every W1,∞(0,1) class has a unique absolutely continuous representative on [0,1] whose increments are integrals of its weak derivative (One-dimensional W1,p functions have unique absolutely continuous representatives). Since f∈W2,∞(0,1), this applies to both f and its first weak derivative Df.

[A2]

The partition is uniform with mesh h=1/J, and f∈W2,∞(0,1;R).

Verification

Given: The piecewise-linear interpolant Ihf at the uniform knots.

1.1A1A2F1F2F3algebra

Use the disjoint cells Ij=[tj,tj+1), 0≤j<J, with the final cell also containing 1, and put Jj=Ij. For any continuous input g and x∈[tj,tj+1], Ihg(x)=tj+1−xhg(tj)+x−tjhg(tj+1). The nonnegative weights sum to one. Continuity makes the endpoint values limits from within Ij and gives ∥g∥L∞(Ij)=max⁡[tj,tj+1]∣g∣, so ∥Ihg∥L∞(Ij)≤∥g∥L∞(Jj). Continuous inputs agreeing almost everywhere on Jj agree on its closure and hence have the same interpolant on Ij. 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 J varies, the maps Ih form a mesh-uniform family as in [F2] with p=l=1, q=∞, M=1, and CQ=1.

2.1A2F3step 1.1algebra∎

Let M2=∥D2f∥L∞(0,1). On a cell [u,v] of length h, put ax=x−u and bx=v−x. By [F3] applied to f and Df, let f∗ and g∗ be their absolutely continuous representatives; (g∗)′=D2f almost everywhere and f∗(x)−f∗(u)=∫uxg∗(s) ds. The absolutely continuous function t↦(x−t)g∗(t) has derivative −g∗(t)+(x−t)D2f(t) almost everywhere, so the fundamental theorem for absolutely continuous functions gives f∗(x)=f∗(u)+axg∗(u)+∫ux(x−t)D2f(t) dt, and the same formula at v. Since Ihf(x)=f∗(u)+(ax/h)(f∗(v)−f∗(u)), subtraction and simplification yield f∗(x)−Ihf(x)=−∫uxbx(t−u)hD2f(t) dt−∫xvax(v−t)hD2f(t) dt. Hence ∣f∗(x)−Ihf(x)∣≤M2{bxax2/(2h)+axbx2/(2h)}=M2axbx/2≤M2h2/8, since ax+bx=h and axbx≤h2/4. This holds on every cell and at every point, so taking the supremum gives ∥f−Ihf∥L∞(0,1)≤h2∥D2f∥L∞(0,1)/8.

ExampleConstruction: AI-generatedVerification: AI-generatedOpen item page →

Training risk and independent test risk are different quantities

Example

Use the degree-one clamped B-spline basis p(x)=(1−x,x) on [0,1], with a single fixed training input x1=1/2 and response y1=1. The coefficient vector β^=(0,2)T is a least-squares minimizer and gives the fitted function g^(x)=2x. Let the target be g0(x)=1 and the independent test input be uniform on [0,1].

Facts & Assumptions

Given: The one-row design matrix P=(1/2,1/2), response Y=(1), and test law X′∼Unif⁡[0,1].

[F1]

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

[F2]

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

[F3]

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

[A1]

The training input and response are 1/2 and 1, the chosen least-squares coefficient is (0,2)T, and the independent test input is uniform on [0,1].

Verification

Given: x1=1/2, y1=1, β^=(0,2)T, g0≡1, and independent X′∼Unif⁡[0,1].

1.1A1F1F3givenalgebra

On the clamped knot vector (0,0,1,1), the only nonzero degree-zero spline on (0,1) is B2,0=1; the recurrence in [F3] gives B1,1=1−x and B2,1=x, so p(1/2)=(1/2,1/2). Therefore p(1/2)Tβ^=(1/2,1/2)(0,2)T=1, 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.

2.1A1F2step 1.1algebra∎

The independent test squared error has expectation E{g^(X′)−g0(X′)}2=∫01(2x−1)2dx=43−2+1=13>0. Thus zero training loss does not imply zero independent test loss, consistent with the scope of [F2].

Sources