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.
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.
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
- Vaicenavicius et al., Evaluating Model Calibration in Classification, PMLR 89 (2019), Proposition 1 (standard reference, not scraped)