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.
Constrained least squares in a two-coordinate orthogonal sequence model
Example
Let , , , and impose sparsity . Observe . Assume the centered noise vector is sub-Gaussian with proxy and has covariance . The constrained support search retains the coordinate with the larger squared observation. Its expected fitted-value error per observation is between and , and the general theorem gives the upper bound .
Facts & Assumptions
Given: , , , , , the observation , and a centered noise vector with sub-Gaussian proxy and .
The support-search estimator projects onto each support and chooses the least-residual candidate, with its stated deterministic tie rule (Constrained support-search least squares).
Its expected squared fitted-value error is at most when (Sparse constrained least-squares risk bound).
The centered vector proxy convention is the all-directions MGF bound (Sub-Gaussian variables and vectors, and sub-exponential variables).
Coordinate second moments and covariance are defined by expectations of centered products (Moments, variance, and covariance on a probability space).
Squared fitted-value error is a nonnegative loss and risk is its expected value (Loss functions and risk).
The nonnegative integral is monotone (Monotonicity and nonnegative homogeneity of the nonnegative integral), and expectation is linear and monotone for integrable real random variables (Linearity, monotonicity, and the modulus bound for expectation).
Verification
The three candidate supports are . Their fitted vectors are , , and , with residual squares , , and , respectively. Hence the chosen fitted vector has squared norm , including a tie.
Pointwise, . The coordinate squares are integrable by the covariance assumption [F4], so their sum is integrable by [F6]. The nonnegative maximum is dominated by this sum, hence is integrable by nonnegative-integral monotonicity in [F6]. Taking expectations with [F6] and using [F4] gives . Division by proves the stated interval for fitted-value error.
Here , , and , and the noise satisfies [F3], so [F2] gives expected error at most . This is consistent with the direct calculation; the example makes no separate minimax lower-bound claim. By [F5], this expectation is the squared fitted-value risk.
Depends on
- Constrained support-search least squares
- Sparse constrained least-squares risk bound
- Exact squared-error risk of an isotropic projection fit
- Sub-Gaussian variables and vectors, and sub-exponential variables
- Moments, variance, and covariance on a probability space
- Loss functions and risk
- Linearity, monotonicity, and the modulus bound for expectation
- Monotonicity and nonnegative homogeneity of the nonnegative integral
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
47 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
- Philippe Rigollet and Jan-Christian Hütter, High-Dimensional Statistics: Lecture Notes, §2.2, Theorem 2.6 and Corollary 2.9 (standard reference, not scraped)
- Sylvain Arlot, Model/estimator selection, Lecture on model selection, §2 (standard reference, not scraped)