Automatic continuity: subadditivity, convexity, uniformity (Q621379): Difference between revisions

Certain results where continuity is shown to be implied by some weaker property under suitable side conditions are called automatic continuity results. For example, \textit{G. Darboux} [Darboux Bull. IX. 281--288 (1877; JFM 07.0550.01)] first proved that local boundedness implies continuity. \textit{A. Ostrowski} [Jahresber. Dtsch. Math.-Ver. 38, 54-62 (1929; JFM 55.0800.01)] showed that an additive function, bounded above on some set of positive measure is continuous. Jones further `thinned' out this result by showing that an additive function continuous on a set \(T\) which is analytic and contains a Hamel basis is continuous. In this line the authors examine various 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 authors consider generic properties of the domain sets in the side condition - properties that hold typically, or off a small exceptional set. For example, they establish two automatic continuity theorems, one for additive functions, and another for subadditive functions.