Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedprecheck pass
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 n,p≥1, X∈Rn×p, and y∈Rn. The ordinary least-squares minimizers of ∥y−Xβ∥22 are exactly the solutions of XTXβ=XTy; if β0 is one such solution, the full minimizer set is β0+ker⁡X. It is a singleton if and only if the columns of X are linearly independent. For every λ>0, the ridge objective ∥y−Xβ∥22+λ∥β∥22 has the unique minimizer β^ridge=(XTX+λIp)−1XTy.

Facts & Assumptions

Given: A finite real design matrix X, a response vector y, and, for the ridge claim, a real λ>0.

[F2]

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

[F3]

The ridge objective is ∥Xβ−y∥22+λ∥β∥22 for λ>0 (The Tikhonov regularised least-squares objective ∥Ax−b∥22+λ∥x∥22 for λ>0).

[F4]

That objective is strictly convex and has unique minimizer (XTX+λIp)−1XTy (For every λ>0, the Tikhonov objective is strictly convex and has the unique minimiser (A∗A+λI)−1A∗b).

[F5]

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

1.1F1F5

Apply [F1] to the linear map β↦Xβ between finite-dimensional Euclidean spaces. It gives existence, the equation XT(Xβ−y)=0, and the full set β0+ker⁡X.

2.1step 1.1algebra

The translate β0+ker⁡X has exactly one element if and only if ker⁡X={0}. By definition this is equivalent to linear independence of the columns, proving the OLS uniqueness assertion.

3.1F2F3F4F5algebra∎

By [F2], there is an orthonormal basis of Rp in which XTX is diagonal with entries σ12,…,σr2,0,…,0. Thus XTX+λIp has positive diagonal entries σj2+λ 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

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