Alphabeta Math
DefinitionDefinition: Literature-sourcedProof: Not applicablePipeline-generated
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.

Top-label calibration

Definition

Let (Ω,F,P) be a probability space, let K≥2, let Y:Ω→{1,…,K} be a random variable, with the label set carrying the full power-set sigma-algebra, and let G=(G1,…,GK):Ω→ΔK be a measurable random forecast, where the probability simplex is ΔK={p∈[0,1]K:∑j=1Kpj=1}. Define the predicted label and top confidence by Y^=min⁡{j:Gj=max⁡ℓ∈{1,…,K}Gℓ},C=max⁡ℓ∈{1,…,K}Gℓ. The smallest-index rule resolves ties. The forecast is top-label calibrated if for every Borel set B⊆[0,1], P(Y=Y^, C∈B)=E[1{C∈B}C]. Thus, among predictions whose top confidence lies in any specified set of confidence values, the frequency of a correct top label equals the average reported top confidence.

Definition references

Probability calibration and calibration error: its top-confidence condition is the same event-integral identity, with the same smallest-index tie rule.

Probability measures and probability spaces: fixes the probability law and expectation used in the event-integral identity.

The Borel sigma-algebra of a topological space: specifies the Borel sets quantified over in the definition.

Guo et al., full paper, Section 2: defines confidence as the probability attached to the predicted label and motivates calibration by correctness frequency.

Depends on

Used by

Dependency tree · two levels

10 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