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.
The full ordinary least-squares solution set and the unique ridge solution
Statement
Let , , and . The ordinary least-squares minimizers of are exactly the solutions of ; if is one such solution, the full minimizer set is . It is a singleton if and only if the columns of are linearly independent. For every , the ridge objective has the unique minimizer
Statement references
Facts & Assumptions
Given: A finite real design matrix , a response vector , and, for the ridge claim, a real .
Finite-dimensional least-squares minimizers exist, satisfy the normal equations, and form (For a linear map between finite-dimensional inner-product spaces, minimises if and only if , equivalently ; minimisers exist and any two differ by an element of ).
A finite real matrix has a singular value decomposition with orthonormal left and right bases (Every linear map between finite-dimensional real or complex inner product spaces admits a singular value decomposition).
The ridge objective is for (The Tikhonov regularised least-squares objective for ).
That objective is strictly convex and has unique minimizer (For every , the Tikhonov objective is strictly convex and has the unique minimiser ).
The empirical squared-loss convention for OLS and the ridge objective is fixed in Fixed-design least-squares, ridge, lasso, group, and fused objectives.
Proof
Apply [F1] to the linear map between finite-dimensional Euclidean spaces. It gives existence, the equation , and the full set .
The translate has exactly one element if and only if . By definition this is equivalent to linear independence of the columns, proving the OLS uniqueness assertion.
By [F2], there is an orthonormal basis of in which is diagonal with entries . Thus has positive diagonal entries and , so the inverse exists. The objective in [F3] is exactly the ridge objective in [F5], and [F4] gives its unique minimizer in the displayed formula.
Depends on
- Fixed-design least-squares, ridge, lasso, group, and fused objectives
- For a linear map $T:V\to W$ between finite-dimensional inner-product spaces, $x$ minimises $\lVert Tx-b\rVert$ if and only if $T^*(Tx-b)=0$, equivalently $T^*Tx=T^*b$; minimisers exist and any two differ by an element of $\ker T$
- The Tikhonov regularised least-squares objective $\|Ax-b\|_2^2+\lambda\|x\|_2^2$ for $\lambda>0$
- For every $\lambda>0$, the Tikhonov objective is strictly convex and has the unique minimiser $(A^*A+\lambda I)^{-1}A^*b$
- Every linear map between finite-dimensional real or complex inner product spaces admits a singular value decomposition
Used by
Dependency tree · two levels
15 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
- Hastie, Tibshirani, and Friedman, The Elements of Statistical Learning, 2nd ed., corrected 12th printing (January 2017) (standard reference, not scraped)
- Philippe Rigollet and Jan-Christian Hütter, High-Dimensional Statistics: Lecture Notes, §2.2 (standard reference, not scraped)