English

Linear Functions to the Extended Reals

Statistics Theory 2025-04-25 v2 Computer Science and Game Theory Statistics Theory

Abstract

This paper investigates functions from Rd\mathbb{R}^d to R{±}\mathbb{R} \cup \{\pm \infty\} that satisfy axioms of linearity wherever allowed by extended-value arithmetic. They have a nontrivial structure defined inductively on dd, and unlike finite linear functions, they require Ω(d2)\Omega(d^2) parameters to uniquely identify. In particular they can capture vertical tangent planes to epigraphs: a function (never -\infty) is convex if and only if it has an extended-valued subgradient at every point in its effective domain, if and only if it is the supremum of a family of "affine extended" functions. These results are applied to the well-known characterization of proper scoring rules, for the finite-dimensional case: it is carefully and rigorously extended here to a more constructive form. In particular it is investigated when proper scoring rules can be constructed from a given convex function.

Keywords

Cite

@article{arxiv.2102.09552,
  title  = {Linear Functions to the Extended Reals},
  author = {Bo Waggoner},
  journal= {arXiv preprint arXiv:2102.09552},
  year   = {2025}
}

Comments

23 pages

R2 v1 2026-06-23T23:18:06.454Z