Alphabeta Math
ExampleConstruction: AI-generatedVerification: AI-generatedPipeline-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.

Constrained least squares in a two-coordinate orthogonal sequence model

Example

Let n=d=2, X=I2, θ∗=0, and impose sparsity s=1. Observe Y=Xθ∗+ε=ε. Assume the centered noise vector is sub-Gaussian with proxy σ2>0 and has covariance σ2I2. The constrained support search retains the coordinate with the larger squared observation. Its expected fitted-value error per observation is between σ2/2 and σ2, and the general theorem gives the upper bound Cσ2log⁡(2e)/2.

Facts & Assumptions

Given: n=d=2, X=I2, θ∗=0, s=1, σ2>0, the observation Y=Xθ∗+ε=ε, and a centered noise vector ε=(ε1,ε2) with sub-Gaussian proxy σ2 and E[εiεj]=σ21i=j.

[F1]

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

[F2]

Its expected squared fitted-value error is at most Cσ2slog⁡(ed/s)/n when 1≤s≤d/2 (Sparse constrained least-squares risk bound).

[F3]

The centered vector proxy convention is the all-directions MGF bound (Sub-Gaussian variables and vectors, and sub-exponential variables).

[F4]

Coordinate second moments and covariance are defined by expectations of centered products (Moments, variance, and covariance on a probability space).

[F5]

Squared fitted-value error is a nonnegative loss and risk is its expected value (Loss functions and risk).

[F6]

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

1.1F1given

The three candidate supports are ∅,{1},{2}. Their fitted vectors are 0, (ε1,0), and (0,ε2), with residual squares ε12+ε22, ε22, and ε12, respectively. Hence the chosen fitted vector has squared norm max⁡(ε12,ε22), including a tie.

2.1F4F6step 1.1algebra

Pointwise, ε12≤max⁡(ε12,ε22)≤ε12+ε22. 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 σ2≤E∥μ^s∥22≤2σ2. Division by n=2 proves the stated interval for fitted-value error.

3.1F2F3F5givenstep 2.1∎

Here s=1, d=2, and n=2, and the noise satisfies [F3], so [F2] gives expected error at most Cσ2log⁡(2e)/2. 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

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