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.

✓ 4 results · all verified · 4 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; all 4 also cleared it.

Prediction problems, risks, and empirical minimization — Examples

1 · Prerequisites

2 · Logical flowchart

3 · Definitions, theorems and proofs

None yet.

4 · Examples, counterexamples and false statements

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

Binary zero-one loss and risk

Example

Let X={u,v}, Y=A={0,1} with their discrete sigma-algebras, and let the joint law be P(u,0)=18,P(u,1)=38,P(v,0)=38,P(v,1)=18. Use zero-one loss ℓ(a,y)=1{a≠y}. The predictor f10 with f10(u)=1, f10(v)=0 has population risk 1/4; the predictor f01 with the opposite labels has risk 3/4. The two constant predictors each have risk 1/2. Thus f10 is the unique population-risk minimizer among the four predictors.

Facts & Assumptions

Given: The finite measurable spaces, probability law, loss and predictors stated in the example.

[F1]

A supervised problem specifies the measurable instance/label/action spaces, joint law, predictors and loss. Supervised prediction problems

[F2]

Population risk is the integral of the nonnegative loss under the joint law. Population and empirical risk

Verification

1.1givenF1F2algebra

The table entries sum to one, and each of u and v has marginal probability 1/2. The loss of f10 is one exactly at (u,0) and (v,1), so its risk is 1/8+1/8=1/4.

2.1givenF1F2step 1.1algebra∎

The loss of f01 is one at (u,1) and (v,0), so its risk is 3/8+3/8=3/4. The constant-one predictor errs on label-zero mass 1/2, and the constant-zero predictor errs on label-one mass 1/2. These are all four functions from X to Y, so f10 uniquely minimizes risk.

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

Squared loss and a conditional mean

Example

Let X={u,v} with its discrete sigma-algebra, let Y={0,2,4,6} with its discrete sigma-algebra, let the action space be A=R with its Borel sigma-algebra, and let F be all functions from X to R. Define X(x,y)=x and Y(x,y)=y on Ω=X×Y. Give the joint law by P(u,0)=18,P(u,2)=14,P(u,4)=18,P(v,2)=14,P(v,6)=14, with all other atoms having probability zero, and set PX(x):=∑yP(x,y). Use squared loss ℓ(a,y)=(a−y)2. For x∈{u,v} define the conditional mean m(x):=∑yyP(x,y)/PX(x). Then m(u)=2 and m(v)=4, and the predictor f∗(x)=m(x) uniquely minimizes population squared risk over F, with risk 3.

Facts & Assumptions

Given: The finite spaces, joint law, real-valued predictor class and squared loss stated in the example.

[F1]

Population risk is the expectation of the nonnegative loss under the joint law. Population and empirical risk

[F2]

On a positive-probability event in a finite probability space, conditional expectation is the normalized finite weighted sum. Conditional expectation on positive-probability events in finite spaces

[F3]

Expectation splits over a finite positive-probability partition as the probability-weighted sum of the conditional expectations. Conditional expectation on positive-probability events in finite spaces

Verification

1.1givenF2algebra

The displayed atom weights sum to one and PX(u)=PX(v)=1/2. Applying [F2] to the two events {X=u} and {X=v} gives conditional means m(u)=2, m(v)=4, and conditional second moments E[Y2∣X=u]=6, E[Y2∣X=v]=20.

2.1F1F3givenstep 1.1algebra∎

For any predictor g, expansion on each event gives E[(g(u)−Y)2∣X=u]=(g(u)−2)2+2 and E[(g(v)−Y)2∣X=v]=(g(v)−4)2+4. The partition identity in [F3] and [F1] therefore give RP(g)=12((g(u)−2)2+2)+12((g(v)−4)2+4)≥3, with equality exactly when g(u)=2 and g(v)=4.

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

Absolute loss and conditional medians

Example

Let X={u}, Y={0,4} with discrete sigma-algebras, A=R with its Borel sigma-algebra, and F the set of all predictors from X to R. Give the joint law by P(u,0)=P(u,4)=1/2 and define the label coordinate Y(u,y)=y. Use absolute loss ℓ(a,y)=∣a−y∣. A median of a probability law on R is a value m satisfying both P(Y≤m)≥1/2 and P(Y≥m)≥1/2. The conditional law of Y at the only instance assigns probability 1/2 to each of 0 and 4, so every m∈[0,4] is a median. The predictors fm(u)=m for m∈[0,4] all minimize population risk, with risk 2; every predictor with value outside [0,4] has risk greater than 2.

Facts & Assumptions

Given: The finite measurable spaces, joint law, absolute loss and predictor class stated in the example.

[F1]

A supervised problem specifies the measurable spaces, joint law, predictor class and loss. Supervised prediction problems

[F2]

Population risk is the integral of the nonnegative loss under the joint law. Population and empirical risk

Verification

1.1givenF1F2algebra

The only instance has probability one, so for a predictor with value t∈R the population risk is RP(ft)=12∣t∣+12∣t−4∣.

2.1givenstep 1.1algebra∎

If t≤0, this risk is 2−t; if 0≤t≤4, it is 2; and if t≥4, it is t−2. Thus its minimizers are exactly [0,4]. For each such m, both median inequalities hold with probability at least 1/2; outside this interval one of the inequalities fails.

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

A nonattained risk infimum

Example

Let X={x0} and Y={0} with discrete sigma-algebras, let A=R with its Borel sigma-algebra, and let P put mass one on (x0,0). For each positive integer n, let fn(x0)=1/n and set F={fn:n≥1}. Use squared loss ℓ(a,y)=(a−y)2. For every sample size m≥1, the only sample has R^S(fn)=RP(fn)=1/n2. The empirical and population infima over F are both 0 and are not attained. For tolerance η=1/4, the constant selector A1/4(S,x)=1/2 supplies the approximate-ERM procedure with output f2; for tolerance 0, no exact ERM exists.

Facts & Assumptions

Given: The singleton instance and label spaces, point-mass law, predictor class and squared loss stated in the example.

[F1]

Population and empirical risks are the joint-law integral and finite sample average of the loss. Population and empirical risk

[F2]

An exact ERM attains the empirical infimum; if a finite infimum is not attained, no exact minimizer exists. Empirical risk minimizers

[F3]

The approximate-ERM procedure takes a supplied jointly measurable selector satisfying the samplewise risk condition. Approximate empirical risk minimization with a supplied selector

[F4]

The real line is a complete ordered field, with the usual embedded positive integers. Dedekind-complete ordered real field

[F5]

For every ε>0 in a complete ordered field, some positive integer n satisfies 1/n<ε. For every ε>0 in a complete ordered field there is a natural n≥1 with 1/n<ε

[F6]

The inverse of a positive field element is positive. Inverses of positives are positive, and reciprocation reverses order

[F7]

Every canonical positive integer is positive in the ordered real field. Canonical naturals are positive and strictly increasing

Verification

1.1givenF1F4F6F7algebra

For every sample S and every n≥1, the only observed pair is (x0,0), so [F1] gives R^S(fn)=RP(fn)=(1/n)2=1/n2. By [F4] and [F7], n>0, so [F6] gives 1/n>0 and each listed risk is positive.

2.1givenF4F5F6F7step 1.1algebra

Let ε>0 and set δ=min⁡{ε,1/2}>0. By [F5] choose n≥1 with 0<1/n<δ≤1/2. Then 1/n2<1/n<ε. Thus 0 is a lower bound and no positive number is a lower bound; the infimum is 0. Step 1.1 shows it is never attained, so no exact ERM exists.

3.1F1F2F3givenstep 1.1step 2.1algebra∎

For each fixed m, the sample space contains only the all-(x0,0) sample. The constant evaluation map A1/4(S,x)=1/2 is jointly measurable and its slice is f2, whose risk is 1/4=0+1/4 by steps 1.1 and 2.1. It is therefore an admissible supplied selector for [F3], which returns f2; tolerance 0 has no output satisfying exact minimization by step 2.1.

Sources