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.

Minimum-norm interpolation and double descent — Examples

1 · Prerequisites

2 · Logical flowchart

3 · Definitions, theorems and proofs

None yet.

4 · Examples, counterexamples and false statements

ExampleConstruction: Literature-sourcedVerification: AI-adaptedjudge pass (gpt-6-luna)Open item page →

Reported double-descent experiments for neural networks and tree ensembles

Example

Belkin, Hsu, Ma, and Mandal report empirical double-descent curves for random Fourier features on a 104-example, ten-class MNIST subset, with interpolation at 104 features; for a fully connected two-layer neural network on 4⋅103 examples of dimension 784 and ten classes, with the observed interpolation threshold near nK parameters; and for random forests on a 104-example MNIST subset, with model complexity indexed jointly by maximum tree leaves and number of trees. These are finite experimental observations; they do not assert a universal risk curve or a theorem about arbitrary neural networks, trees, or ensembles.

Facts & Assumptions

Given: The reported empirical plots and experiment descriptions in the source cited in Example references.

[F1]

Figure 2 describes the random-Fourier-feature MNIST experiment and its interpolation threshold; Figure 4 describes the two-layer neural-network experiment; Figure 5 describes the random-forest experiment. The paper labels these as empirical evidence, not a universal theorem.

Verification

1.1givenF1

The Figure 2 description gives n=104, ten classes, and the threshold N=n=104; these are the random-feature quantities stated in the Example.

1.2givenF1

The Figure 4 description gives n=4⋅103, input dimension 784, ten outputs, and threshold observed at nK parameters. The Figure 5 description gives n=104 and indexes forest complexity by maximum leaves and tree count.

2.1givenF1∎

The source reports experiments for those specified datasets and model families, so the Example is an empirical report with those qualifications; it does not claim a theorem for models beyond the experiments.

ExampleConstruction: Literature-sourcedVerification: AI-adaptedjudge pass (gpt-6-luna)Open item page →

Bias, variance, and signal-to-noise regimes of the isotropic risk curve

Example

For fixed signal norm r≥0, noise standard deviation σ≥0, and aspect ratio γ>0, γ≠1, the limiting risk has bias and variance components biasvariance0<γ<10σ2γ1−γγ>1r2(1−1γ)σ2γ−1. When σ>0, the underparameterized branch increases from limit 0 as γ↓0 to +∞ as γ↑1. On the overparameterized side its variance decreases to 0, and its bias increases to r2. When σ>0, the total overparameterized risk is strictly decreasing if r≤σ, and if r>σ it has a unique minimum at γ∗=r/(r−σ). If σ=0, the underparameterized risk is 0; the overparameterized risk is r2(1−1/γ) and is strictly increasing when r>0. The one-sided risk curves diverge at γ=1 only when σ>0; no risk limit at γ=1 is asserted. For σ>0 the global infimum over γ≠1 is 0, approached as γ↓0 and not attained; if r=0, it is also approached as γ→∞. For σ=0, the minimum 0 is attained throughout 0<γ<1.

Facts & Assumptions

Given: r≥0, σ≥0, and γ>0 with γ≠1.

[F1]

The limiting bias and variance components are the two displayed branches (Separate isotropic ridgeless risk into limiting bias and variance).

Verification

1.1givenF1algebra

Summing the two components in [F1] gives the total risk R(γ)=σ2γ/(1−γ) for 0<γ<1 and R(γ)=r2(1−1/γ)+σ2/(γ−1) for γ>1. Differentiating the first expression gives R′(γ)=σ2/(1−γ)2, so it is strictly increasing for σ>0 and is identically zero for σ=0.

1.2givenF1algebra

For γ>1, R′(γ)=r2γ2−σ2(γ−1)2. If σ>0 and r≤σ, then r/γ≤σ/γ<σ/(γ−1), so R′<0. If r>σ>0, the derivative vanishes exactly when r(γ−1)=σγ, namely at γ∗=r/(r−σ)>1; it is negative before this point and positive after it, giving the unique minimum. If σ=0, the derivative is r2/γ2, which is positive for r>0 and zero for r=0.

2.1givenF1step 1.1algebra∎

The limits at γ↓0, γ↑1, and γ→∞ follow directly from the formulas in [F1]. In particular, the singular terms at γ=1 vanish when σ=0 and diverge when σ>0. For σ>0 every finite-domain risk value is positive while the underparameterized branch tends to zero as γ↓0, proving that its global infimum is 0 and is not attained. When σ=0, the underparameterized branch equals 0 identically.

Sources