Alphabeta Math
ExampleConstruction: AI-generatedVerification: AI-generatedPipeline-generatedjudge 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.

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.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

5 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