Alphabeta Math
Pipeline-generated
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.

✓ 3 results · all verified · 1 also independently AI-judged
Every result on this page is machine-checked by a proof checker and read in full and owner-audited; the judge is an additional, independent cross-model AI review of the proofs. The 2 not AI-judged were verified by owner audit (typically over a confirmed judge false positive), not failures.

Decision-Theoretic Upper Bounds — Examples

1 · Prerequisites

2 · Summary

These examples separate fitted-value accuracy from coefficient recovery and training residual from fresh-response prediction error. A two-coordinate orthogonal sequence calculation shows how the constrained support search behaves in a small sparse model. Each example states its noise and design assumptions explicitly.

3 · Logical flowchart

4 · Definitions, theorems and proofs

None yet.

5 · Examples, counterexamples and false statements

CounterexampleConstruction: AI-generatedVerification: AI-generatedprecheck passOpen item page →

Collinear columns identify a fitted mean, not its coefficients

Statement refuted

For every fixed-design matrix X, the map θ↦Xθ is injective; therefore the coefficient vector is determined by its fitted mean.

Facts & Assumptions

Given: An integer n≥1, the design matrix with two identical columns Xn=[1n 1n]∈Rn×2, the coefficient vectors θ1=(1,0) and θ2=(0,1), and centered additive noise whose law is the same at both parameter values and whose covariance is σ2In with σ2>0.

[F1]

The least-squares fitted vector is the projection of the observation onto the design column space (Fixed-design least squares as orthogonal projection).

[F2]

For centered noise with covariance σ2In, projection onto a fixed rank-r subspace has expected squared error equal to squared approximation bias plus rσ2 (Exact squared-error risk of an isotropic projection fit).

[F3]

Expectation is linear and preserves inequalities between integrable real random variables (Linearity, monotonicity, and the modulus bound for expectation).

[F4]

The risk of a procedure is the expected loss under its parameter law (Loss functions and risk).

Counterexample

1.1givenalgebra

Both coefficient vectors are distinct, but Xnθ1=1n=Xnθ2. Thus the asserted injectivity fails, and the observation distributions under θ1 and θ2 are identical because the additive noise law is common.

1.2F3F4givenalgebra

Let T(Y)∈R2 be any measurable coefficient estimator. For every a∈R2, completing squares gives ∥a−θ1∥22+∥a−θ2∥22=2∥a−(12,12)∥22+1≥1. If either coefficient risk is infinite, their maximum is already at least 1/2. Otherwise both squared losses are integrable under the common observation law. Their sum is integrable by [F3], so linearity and monotonicity in [F3] show that the sum of the two risks is at least 1. Thus their maximum is at least 1/2 for every n.

2.1F1F2F4step 1.2∎

The common fitted mean μ=1n lies in col⁡(Xn), which has rank 1. By [F2], its projected least-squares fit has expected squared fitted-value risk σ2, or σ2/n per observation by [F4]. This vanishes as n grows while the coefficient-risk lower bound in step 1.2 stays at least 1/2.

ExampleConstruction: AI-generatedVerification: AI-generatedprecheck passOpen item page →

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.

ExampleConstruction: AI-generatedVerification: AI-generatedprecheck passjudge pass (gpt-6-luna)Open item page →

Zero training residual and positive test error

Example

Take one fixed-design observation with X=[1], true fitted mean μ=0, and training response Y=ε. Let ε′ be an independent fresh response error with the same mean-zero, variance-σ2 law, where σ2>0. Least squares fits the one-dimensional column space exactly: its training residual is zero, its expected error for estimating the mean is σ2, and its expected squared error for predicting the fresh response is 2σ2.

Facts & Assumptions

Given: A one-point fixed design X=[1], μ=0, integrable centered square-integrable errors ε,ε′ with variance σ2>0, and independence of the training and fresh errors.

[F1]

The fitted vector is the orthogonal projection of the observed response onto the design column space (Fixed-design least squares as orthogonal projection).

[F2]

For a rank-one projection and centered variance-σ2 noise, the expected squared fitted-value error is σ2 (Exact squared-error risk of an isotropic projection fit).

[F3]

Variance is the expected square of the centered variable (Moments, variance, and covariance on a probability space).

[F4]

Independent integrable random variables have factorized product expectations (Independent random elements, Expectations factor over finite products of independent random variables).

[F5]

For a real estimator of a real target, mean squared error is the expected squared difference; more generally risk is expected loss (Bias and mean squared error, Loss functions and risk).

Verification

1.1F1given

Since col⁡(X)=R, [F1] gives μ^=Y=ε. Therefore the training residual ∣Y−μ^∣2 is zero for every outcome.

1.2F2F5given

By [F2], the expected squared error for estimating the true mean is E∣μ^−μ∣2=σ2. This is the scalar MSE and squared-loss risk by [F5].

1.3F3F4givenalgebra

The test-response error is Y′−μ^=ε′−ε. Expanding its square and using [F3] and [F4], E∣ε′−ε∣2=E[(ε′)2]+E[ε2]−2E[ε′]E[ε]=2σ2.

2.1F5step 1.1step 1.2step 1.3∎

The training residual, mean-estimation error, and fresh-response test error are respectively 0, σ2, and 2σ2 in this model, so these quantities are distinct.

Sources