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.
Conditioning on a feature induces a calibrated forecast
Statement
Assume AC. Let a finite-label supervised prediction problem have measurable instance space and finite labels with the full power-set sigma-algebra, where . Identify label with its index when applying numbered-label calibration, so forecast coordinate always represents the event . For every measurable feature , there is a measurable such that is a conditional class-probability forecast given and is fully reliable. This includes the identity feature and a constant feature.
Statement references
A finite label has a conditional probability function: supplies the measurable simplex-valued conditional probability function and its event identities under AC.
Probability calibration and calibration error: full reliability is the event-integral identity for every Borel subset of the forecast simplex.
Facts & Assumptions
Given: AC, a finite-label supervised prediction problem with coordinate random variables , and a measurable feature .
Assume AC, as used in the finite-label conditional-probability lemma. The Axiom of Choice
There is a measurable such that for every measurable and label . A finite label has a conditional probability function
Full reliability means for every Borel and each label . Probability calibration and calibration error
A measurable map has measurable preimages of measurable sets. A measurable function between measurable spaces
Proof
Apply [F1] to the joint law of on , which is a measurable joint probability law because is measurable. Equip this law with simplex-valued constant predictors and the zero loss to obtain a supervised prediction problem; [F1] only uses its joint law. It supplies a measurable with for every . Set . For a Borel set , [F3] makes measurable; the event identity then gives . This is precisely the reliability identity [F2].
Since and were arbitrary, all label and Borel-event identities hold, so is fully reliable.
Source notes
Vaicenavicius et al. Proposition 1 states the reliability of a conditional class-probability forecast. The event-integral proof above makes the version and measurable-event hypotheses explicit.
Depends on
Used by
Dependency tree · two levels
15 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
- Vaicenavicius et al., Evaluating Model Calibration in Classification, PMLR 89 (2019), Proposition 1 (standard reference, not scraped)
- Rick Durrett, Probability: Theory and Examples, 5th ed., Section 4.1 (standard reference, not scraped)