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.

Calibration, proper losses, and surrogate classification — Examples

1 · Prerequisites

2 · Logical flowchart

3 · Definitions, theorems and proofs

None yet.

4 · Examples, counterexamples and false statements

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

Three distinct calibration notions in three classes

Example

For each of three models let X and Y have their full power-set sigma-algebras, let X be uniform on {1,2,3}, set G(X=i)=gi, and specify the conditional law of Y at X=i by the row pi=P(Y=⋅∣X=i). In Model A take igipi1(0.4,0.3,0.3)(0.4,0.4,0.2)2(0.3,0.4,0.3)(0.2,0.4,0.4)3(0.3,0.3,0.4)(0.4,0.2,0.4) In Model B take igipi1(0.5,0.3,0.2)(0.7,0.2,0.1)2(0.2,0.5,0.3)(0.1,0.5,0.4)3(0.3,0.2,0.5)(0.4,0.3,0.3) In Model C take igipi1(0.5,0.5,0)(0.8,0.2,0)2(0.5,0,0.5)(0.2,0,0.8)3(0,0.5,0.5)(0,0.8,0.2) Use the smallest-index rule to break top-class ties. Model A is classwise and top-confidence calibrated but not fully reliable; Model B is top-confidence calibrated but neither classwise calibrated nor fully reliable; Model C is classwise calibrated but neither top-confidence calibrated nor fully reliable. Hence the three calibration notions are pairwise distinct.

Example references

Probability calibration and calibration error: defines full reliability, classwise calibration, top-confidence calibration, and smallest-index tie breaking.

Vaicenavicius et al., full paper PDF: Sections 2–3 discuss these distinct finite-label calibration conditions.

Facts & Assumptions

Given: The three finite models and forecasts displayed in the example.

[F1]

Full reliability requires the conditional label vector to equal the forecast at each atom when forecast values distinguish the atoms; classwise calibration groups atoms by each coordinate of the forecast; top-confidence calibration groups by maximum forecast coordinate and evaluates the tie-broken predicted label. Probability calibration and calibration error

Verification

1.1givenF1algebra

Each forecast row and each conditional-label row in Models A, B, and C has nonnegative coordinates summing to one, so all entries define simplex forecasts and conditional label distributions. In each model the three forecast vectors are distinct. Therefore full reliability would require pi=gi at every row by [F1], but Model A row 1, Model B row 1, and Model C row 1 each have pi≠gi. Full reliability fails in all three models.

1.2givenF1algebra

In Model A, for each label the groups with forecast coordinate 0.4 have conditional frequency 0.4, and the groups with coordinate 0.3 have average conditional frequency 0.3: for labels 1, 2, and 3 the latter averages are respectively (0.2+0.4)/2, (0.4+0.2)/2, and (0.2+0.4)/2. Thus Model A is classwise calibrated. Its top confidence is always 0.4, its predicted labels are 1,2,3 in the three rows, and each corresponding conditional correctness probability is 0.4, so it is top-confidence calibrated.

1.3givenF1algebra

In Model B the top confidence is always 0.5, the predicted labels are 1,2,3, and the average conditional correctness is (0.7+0.5+0.3)/3=0.5, so top-confidence calibration holds. Classwise calibration fails because forecast coordinate G1=0.5 occurs only in row 1, where P(Y=1∣X=1)=0.7≠0.5.

2.1givenF1step 1.1step 1.2step 1.3algebra∎

In Model C, for each label the forecast coordinate 0.5 group has average conditional frequency 0.5, and the coordinate 0 group has frequency 0: the three nonzero-group averages are (0.8+0.2)/2, (0.2+0.8)/2, and (0.8+0.2)/2. Thus classwise calibration holds. All top confidences equal 0.5; the tie-broken predicted labels are 1,1,2, with conditional correctness probabilities 0.8,0.2,0.8. Their average is 0.6≠0.5, so top-confidence calibration fails. Steps 1.1, 1.2, and 1.3 establish the other model claims; the Model C calculation completes the pairwise distinctions.

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

A calibrated constant prior forecast

Example

Give X∈{a,b} and Y∈{1,2,3} their full power-set sigma-algebras. Let X be uniform on {a,b} and independent of Y, whose probabilities are (0.7,0.2,0.1). The forecast G(X)=(0.7,0.2,0.1) is fully reliable and equals the conditional class distribution given either feature value, but it is constant and therefore cannot distinguish a from b.

Example references

Probability calibration and calibration error: full reliability is defined by event identities on the forecast simplex.

Conditioning on a feature induces a calibrated forecast: a conditional class-probability forecast given any measurable feature is fully reliable.

Facts & Assumptions

Given: The independent finite-valued feature and label, and the constant forecast stated in the example.

[F1]

A forecast is fully reliable when each label-event probability conditional on forecast events equals the forecast coordinate integral. Probability calibration and calibration error

Verification

1.1givenalgebra

Independence gives P(Y=j,X∈A)=P(Y=j)P(X∈A)=pjP(X∈A) for every feature event A and class j. Thus the conditional label distribution given either X=a or X=b is p=(0.7,0.2,0.1), and G is exactly that conditional forecast.

2.1F1step 1.1given∎

For any Borel set B⊆Δ3, if p∈B then P(Y=j,G∈B)=pj=E[1{G∈B}Gj]; if p∉B, both sides are zero. By [F1], G is fully reliable; its constancy means it has the same output at both feature values and so does not distinguish them.

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

A fixed confidence bin hides calibration error

Example

Give X∈{a,b} and Y∈{1,2} their full power-set sigma-algebras. Let X be uniform on {a,b}, let P(Y=1∣X=a)=0.8 and P(Y=1∣X=b)=0.6, and forecast G(a)=(0.6,0.4), G(b)=(0.8,0.2). For an iid sample from this law and discrepancy d(p,q)=∣p1−q1∣, the full calibration error is 0.2. If the entire forecast simplex is treated as one bin, the empirical binned calibration estimate converges almost surely to zero.

Example references

Probability calibration and calibration error: defines the calibration function and expected calibration error.

Fixed-bin calibration limits underestimate for jointly convex discrepancies; refining bins can be consistent: fixed-bin estimates converge almost surely to their population bin value, which can be strictly below calibration error.

Facts & Assumptions

Given: The two-point feature-label law, forecast, discrepancy, and one-bin partition stated in the example.

[F1]

The calibration function on a finite forecast support equals the conditional class-probability vector at each forecast value. Probability calibration and calibration error

[F2]

For a fixed finite data-independent partition, the empirical estimator converges almost surely to the corresponding population binned value. Fixed-bin calibration limits underestimate for jointly convex discrepancies; refining bins can be consistent

[F3]

The sample averages of the bounded label and forecast coordinates converge almost surely to their means. Kolmogorov iid l1 strong law

[F4]

d(p,q)=∣p1−q1∣ is a continuous, jointly convex, nonnegative discrepancy with d(p,p)=0.

Verification

1.1givenF1algebra

The forecast values identify the two feature values, so the calibration function is r(0.6,0.4)=(0.8,0.2) and r(0.8,0.2)=(0.6,0.4). Therefore E[d(r(G),G)]=12∣0.8−0.6∣+12∣0.6−0.8∣=0.2.

2.1F2F3F4step 1.1givenalgebra∎

In the single bin B=Δ2, the mean forecast first coordinate is (0.6+0.8)/2=0.7, and the mean label-indicator first coordinate is (0.8+0.6)/2=0.7. Hence the population binned discrepancy is ∣0.7−0.7∣=0. By [F2] the empirical one-bin estimate converges almost surely to zero; equivalently, [F3] gives convergence of both sample averages to 0.7.

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

A calibrated coarsened risk score loses information

Example

Give X∈{a,b,c} and the binary label Y∈{1,2} their full power-set sigma-algebras. Let X be uniform on {a,b,c} and let the conditional probabilities be P(Y=1∣X=a)=0.1, P(Y=1∣X=b)=0.9, and P(Y=1∣X=c)=0.75. Coarsen the feature by T(a)=T(b)=u and T(c)=v, and forecast G=(P(Y=1∣T),P(Y=2∣T)). Then G(a)=G(b)=(0.5,0.5) and G(c)=(0.75,0.25). This forecast is fully reliable, although it cannot distinguish a from b, whose conditional label laws differ.

Example references

Probability calibration and calibration error: full reliability is the event-integral identity for every forecast-simplex event.

Conditioning on a feature induces a calibrated forecast: conditioning on a coarsened feature yields a fully reliable forecast.

Facts & Assumptions

Given: The finite feature-label law, coarsening map, and forecast stated in the example.

[F1]

Conditioning on any measurable feature gives a fully reliable forecast. Conditioning on a feature induces a calibrated forecast

[F2]

The calibration condition uses the forecast itself as the conditional probability vector given the forecast. Probability calibration and calibration error

Verification

1.1F1F2givenalgebra

The probability of T=u is 2/3, and the conditional probability of Y=1 there is (0.1+0.9)/2=0.5; at T=v it is 0.75. Thus the forecast is exactly the conditional label distribution given T, and [F1] implies full reliability. Directly, each forecast value identifies T, so the conditional distribution of Y given G=(0.5,0.5) is (0.5,0.5) and given G=(0.75,0.25) is (0.75,0.25), which is [F2].

2.1givenstep 1.1algebra∎

The original feature values a and b have different conditional label laws, with success probabilities 0.1 and 0.9, but both map to the same forecast. Hence observing the forecast does not determine which of those feature values occurred, so the forecast discards information about X while remaining calibrated.

Sources