Summary.
We examine various related instances of automatic properties of functions – that is, cases where a weaker property necessarily implies a stronger one under suitable side-conditions, e.g. connecting geometric and combinatorial features of their domains. The side-conditions offer a common approach to (mid-point) convex, subadditive and regularly varying functions (the latter by way of the uniform convergence theorem). We consider generic properties of the domain sets in the side-conditions – properties that hold typically, or off a small exceptional set. The genericity aspects develop earlier work of Kestelman [Kes] and of Borwein and Ditor [BoDi]. The paper includes proofs of three new analytic automaticity theorems announced in [BOst7].
Similar content being viewed by others
Author information
Authors and Affiliations
Corresponding author
Additional information
In memoriam Marek Kuczma (1935–1991)
Manuscript received: November 7, 2007 and, in final form, January 31, 2009.
Rights and permissions
About this article
Cite this article
Bingham, N.H., Ostaszewski, A.J. Automatic continuity: subadditivity, convexity, uniformity. Aequat. Math. 78, 257 (2009). https://doi.org/10.1007/s00010-009-2982-x
DOI: https://doi.org/10.1007/s00010-009-2982-x