Alphabeta Math
ExampleConstruction: AI-generatedVerification: AI-generatedPipeline-generatedprecheck passjudge pass (gpt-6-luna)
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.

A holdout estimate targets a smaller training sample

Example

Take n=4 IID observations Zi∼Bernoulli⁡(1/2), squared loss L(a,z)=(a−z)2, and the learning rule Ak(z1,…,zk)=k−1∑q=1kzq. Hold out Z4 and train on Z1,Z2,Z3. The expected holdout score estimates R3, while training on all four observations has risk R4.

Facts & Assumptions

Given: The four IID Bernoulli observations, the sample-mean rule, squared loss, and holdout split above. Compute the training-size risks and their difference.

[F1]

Cross-validation estimates risk at its training sizes: the expected holdout score with k training observations is Rk.

[F2]

Cross-validation splits and training-size risk targets: Rk=E[L(Ak(Z1,…,Zk),Zk+1)] for an independent test observation.

[F3]

Identical distribution and IID families: the observations are mutually independent and have one common law.

[F4]

Moments, variance, and covariance on a probability space: variance is E[(X−EX)2] for square-integrable X.

[F5]

Expectations factor over finite products of independent random variables: expectations of products of integrable functions of independent variables factor.

[F6]

Holdout, leave-out, V-fold, and repeated cross-validation: a holdout score averages losses on the validation indices after training on their complement.

[F7]

Bernoulli random variables and binomial random variables as sums of independent Bernoulli trials: For p∈[0,1], a Bernoulli(p) random variable takes the value 1 with probability p and 0 with probability 1−p.

Verification

1.1givenF3F4F5F7algebra

For Z∼Bernoulli⁡(p), [F7] gives EZ=p and the two-point expectation gives Var⁡(Z)=p(1−p). Expanding the variance of Zˉk=k−1∑q=1kZq, the diagonal terms sum to kp(1−p) and each cross covariance vanishes by [F3] and [F5]; hence Var⁡(Zˉk)=p(1−p)/k.

2.1F2F3F4F5step 1.1algebra

The independent test variable Zk+1 has mean p and variance p(1−p). Expanding E[(Zˉk−Zk+1)2] around the common mean p, the centered cross term is zero by independence, so [F2] gives Rk=Var⁡(Zˉk)+Var⁡(Zk+1)=p(1−p)(1+1/k).

3.1F1F2F6step 2.1algebra∎

At p=1/2, R3=14(1+13)=13 and R4=14(1+14)=516. The split in [F6] holds out one observation, so [F1] gives expected holdout score R3; its bias for full-sample risk is R3−R4=148>0.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

24 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