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.
Strictly proper scoring rules on a finite label set
Definition
For an integer , let the label set be and let . A finite-label score loss is a function whose section is Borel measurable for every label . If the true label distribution is and the reported forecast is , its expected score loss is , where a term with contributes zero even when . The loss is proper if for every , and strictly proper if it is proper and equality implies . The logarithmic loss is , with , where is the natural logarithm; the Brier loss is .
Definition references
Loss functions and risk: a loss is nonnegative and measurable in its action for each fixed parameter; no measurability on the parameter space is required, and its risk is the corresponding extended nonnegative integral.
The natural logarithm as the inverse of the exponential function: is the inverse of the exponential function on positive reals.
The Borel sigma-algebra of a topological space: Borel subsets are the sets in the sigma-algebra generated by the open subsets of a topological space.
Wikipedia, Scoring rule: Definitions and Proper scoring rules specify forecasts, expected score, loss orientation, properness, and strictness; Categorical variables gives the finite-label logarithmic and Brier examples. The measurable extended nonnegative-loss conventions are stated explicitly here; the logarithmic reward example is negated.
Depends on
Used by
Dependency tree · two levels
12 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
- Wikipedia contributors, Scoring rule: Definitions; Proper scoring rules; Categorical variables (logarithmic and Brier examples) (standard reference, not scraped)