Alphabeta Math
CorollaryStatement: Literature-sourcedProof: AI-adaptedPipeline-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.

Conditioning on a feature induces a calibrated forecast

Statement

Assume AC. Let a finite-label supervised prediction problem have measurable instance space (X,ΣX) and finite labels Y={y1,…,yK} with the full power-set sigma-algebra, where K≥2. Identify label yj with its index j when applying numbered-label calibration, so forecast coordinate j always represents the event Y=yj. For every measurable feature T:X→(Z,ΣZ), there is a measurable ηT:Z→ΔK such that G=ηT(T(X)) is a conditional class-probability forecast given T(X) 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 X,Y, and a measurable feature T:X→(Z,ΣZ).

[A1]

Assume AC, as used in the finite-label conditional-probability lemma. The Axiom of Choice

[F1]

There is a measurable η:X→ΔK such that P(X∈A,Y=yj)=E[ηj(X)1{X∈A}] for every measurable A and label j. A finite label has a conditional probability function

[F2]

Full reliability means P(Y=yj,G∈B)=E[1{G∈B}Gj] for every Borel B⊆ΔK and each label j. Probability calibration and calibration error

[F3]

A measurable map has measurable preimages of measurable sets. A measurable function between measurable spaces

Proof

1.1A1F1F2F3given

Apply [F1] to the joint law of (T(X),Y) on Z×Y, which is a measurable joint probability law because T 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 ηT:Z→ΔK with P(T(X)∈A,Y=yj)=E[ηT,j(T(X))1{T(X)∈A}] for every A∈ΣZ. Set G=ηT(T(X)). For a Borel set B⊆ΔK, [F3] makes A=ηT−1(B) measurable; the event identity then gives P(Y=yj,G∈B)=E[Gj1{G∈B}]. This is precisely the reliability identity [F2].

2.1step 1.1∎

Since j and B were arbitrary, all label and Borel-event identities hold, so G 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