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 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.
Depends on
- Series least squares with a spline basis
- Fixed-design least squares as orthogonal projection
- Measure kernel and probability kernel
- Random elements and real random variables
- Law or distribution of a random element
- Independent random elements
- Independent random elements have product joint law
- The product sigma-algebra and its finite iterates
- For sigma-finite factors, the product measure exists, has the rectangle formula, is sigma-finite, and is unique
- Dynkin's pi-lambda theorem
- The indefinite integral of a nonnegative measurable function is a measure
- Tonelli's theorem for nonnegative measurable functions on a sigma-finite product
- Monotone convergence for the integral
- The orthogonal projection $P_Wv$ is the $W$-component in $V=W\oplus W^\perp$
- The orthogonal projection is the unique nearest point in the subspace
- Gram–Schmidt turns every finite independent list into an orthonormal list with the same successive spans
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
- Whitney K. Newey, Nonparametric and Semiparametric Estimation, MIT OCW 14.385, Fall 2007, Proposition 3 and proof, PDF pp. 10–11 (standard reference, not scraped)