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
- Absolute and Conditional Convergence; Rearrangement; Products
- Binary Operations, Monoids, Groups and Subgroups
- Calibration, proper losses, and surrogate classification
- Compactness in Metric Spaces
- Completeness, Completion, and Uniform Continuity
- Conditional Distributions and Regular Conditional Probability
- Conditional Expectation
- Construction of the Natural Numbers
- Construction of the Real Numbers via Cauchy Sequences
- Construction of the Real Numbers via Dedekind Cuts
- Continuity, IVT, EVT, and Uniform Continuity
- Cosets, Index and Lagrange's Theorem
- Countability and Uncountability
- Divisibility, Euclidean Domains, Principal Ideal Domains and Unique Factorisation
- Equivalent Forms of Completeness
- Estimators and Randomized Procedures
- Finite Counting, Factorials and Binomial Coefficients
- Finite Probability Spaces and Random Variables
- Foundations of the Real Numbers for Analysis
- Ideals, Quotient Rings and the Isomorphism Theorems for Rings
- Independence Borel Cantelli and Zero One Laws
- Limits of Real Functions
- limsup, liminf, and Subsequential Limits
- Loss, Risk and Decision Theory
- Measurable Functions and Simple Approximation
- Measures and Their Basic Properties
- Metric Spaces
- Modes of Convergence for Random Variables
- Monotone Functions, Discontinuities, and Continuity Sets
- Monotone Sequences, Bolzano-Weierstrass, and Cauchy Completeness
- Normal Subgroups and Quotient Groups
- Order, Zorn's Lemma, and the Axiom of Choice
- Pointwise Extended-Real Function Products
- Polynomial Rings, the Division Algorithm and Roots
- Power Series and Real-Analytic Functions
- Prediction problems, risks, and empirical minimization
- Probability Spaces Random Variables and Expectation
- Product Measures and the Fubini Tonelli Theorems
- Properties of the Integral and the Working FTC
- Relations, Functions, and Quotients
- Rings, Subrings, Integral Domains and Fields
- Roots, Rational Powers, and Classical Inequalities
- Sequences and Limits
- Sequences and Series of Functions; Uniform Convergence
- Series: Convergence and the Nonnegative Tests
- Sigma Algebras and Borel Sets
- Signed and Complex Measures Hahn and Jordan
- Simple Field Extensions and the Construction of the Complex Numbers
- Statistical Experiments, Models and Identifiability
- Strong Laws of Large Numbers
- Suprema and Infima
- The Derivative and the Mean Value Theorems
- The Exponential Function
- The Lebesgue Integral and the Convergence Theorems
- The Logarithm and General Powers
- The Lᵖ Spaces Holder Minkowski and Riesz Fischer
- The Radon Nikodym Theorem and Lebesgue Decomposition
- The Riemann Integral: Definition and Integrability
- The ZFC Axioms and the Basic Set Constructions
- Topological Spaces and Continuity
- Topology of ℝ
- Triangularisation, Generalised Eigenspaces and Jordan Canonical Form
- Vector Spaces, Linear Subspaces, Span and Direct Sums
- Weak Laws and Series of Independent Random Variables
2 · Logical flowchart
3 · Definitions, theorems and proofs
None yet.
4 · Examples, counterexamples and false statements
Three distinct calibration notions in three classes
Example
For each of three models let and have their full power-set sigma-algebras, let be uniform on , set , and specify the conditional law of at by the row . In Model A take In Model B take In Model C take 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.
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
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 at every row by [F1], but Model A row 1, Model B row 1, and Model C row 1 each have . Full reliability fails in all three models.
In Model A, for each label the groups with forecast coordinate have conditional frequency , and the groups with coordinate have average conditional frequency : for labels 1, 2, and 3 the latter averages are respectively , , and . Thus Model A is classwise calibrated. Its top confidence is always , its predicted labels are in the three rows, and each corresponding conditional correctness probability is , so it is top-confidence calibrated.
In Model B the top confidence is always , the predicted labels are , and the average conditional correctness is , so top-confidence calibration holds. Classwise calibration fails because forecast coordinate occurs only in row 1, where .
In Model C, for each label the forecast coordinate group has average conditional frequency , and the coordinate group has frequency : the three nonzero-group averages are , , and . Thus classwise calibration holds. All top confidences equal ; the tie-broken predicted labels are , with conditional correctness probabilities . Their average is , 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.
A calibrated constant prior forecast
Example
Give and their full power-set sigma-algebras. Let be uniform on and independent of , whose probabilities are . The forecast is fully reliable and equals the conditional class distribution given either feature value, but it is constant and therefore cannot distinguish from .
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.
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
Independence gives for every feature event and class . Thus the conditional label distribution given either or is , and is exactly that conditional forecast.
For any Borel set , if then ; if , both sides are zero. By [F1], is fully reliable; its constancy means it has the same output at both feature values and so does not distinguish them.
A fixed confidence bin hides calibration error
Example
Give and their full power-set sigma-algebras. Let be uniform on , let and , and forecast , . For an iid sample from this law and discrepancy , the full calibration error is . 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.
The calibration function on a finite forecast support equals the conditional class-probability vector at each forecast value. Probability calibration and calibration error
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
The sample averages of the bounded label and forecast coordinates converge almost surely to their means. Kolmogorov iid l1 strong law
is a continuous, jointly convex, nonnegative discrepancy with .
Verification
The forecast values identify the two feature values, so the calibration function is and . Therefore .
In the single bin , the mean forecast first coordinate is , and the mean label-indicator first coordinate is . Hence the population binned discrepancy is . By [F2] the empirical one-bin estimate converges almost surely to zero; equivalently, [F3] gives convergence of both sample averages to .
A calibrated coarsened risk score loses information
Example
Give and the binary label their full power-set sigma-algebras. Let be uniform on and let the conditional probabilities be , , and . Coarsen the feature by and , and forecast . Then and . This forecast is fully reliable, although it cannot distinguish from , 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.
Conditioning on any measurable feature gives a fully reliable forecast. Conditioning on a feature induces a calibrated forecast
The calibration condition uses the forecast itself as the conditional probability vector given the forecast. Probability calibration and calibration error
Verification
The probability of is , and the conditional probability of there is ; at it is . Thus the forecast is exactly the conditional label distribution given , and [F1] implies full reliability. Directly, each forecast value identifies , so the conditional distribution of given is and given is , which is [F2].
The original feature values and have different conditional label laws, with success probabilities and , 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 while remaining calibrated.
Sources
- Vaicenavicius et al., Evaluating Model Calibration in Classification, PMLR 89 (2019), Sections 2–3
- Vaicenavicius et al., Evaluating Model Calibration in Classification, PMLR 89 (2019), Proposition 1
- Vaicenavicius et al., Evaluating Model Calibration in Classification, PMLR 89 (2019), Theorems 1–2
- Rick Durrett, Probability: Theory and Examples, 5th ed., Section 2.4