Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-generatedPipeline-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.

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.

Depends on

Used by

Dependency tree · two levels

60 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.

Sources