Measure theory based on lattices and transfinite recursion (Q1024169)

Using lattices instead of rings as the basic structure and transfinite construction instead of outer and inner measures, this paper systematically develops a theory of measures. Thus a content \(\mu\) on a lattice \(\mathcal{V}\) is a monotone, modular extended real-valued set function with value 0 at \(\emptyset\). To achieve uniqueness of an extension, various regularity properties are introduced. With regularity and upward or downward continuity, a measure on \(\mathcal{V}\) is extended uniquely to the ring \(\mathcal{V} = \{\sum_{i \leq n} A_i - B_i \) (disj union)\( | n \in N, A_i, B_i \in \mathcal{V} \}\), \(\mathcal{V}_{\sigma}\) (countable unions), or \(\mathcal{V}_{\delta}\) (countable intersections). A \(\sigma\) and a \(\delta\)-hierarchy of \(\mathcal{V}\) are defined by transfinite recursion. Extensions to \(\sigma\)-rings and \(\delta\)-rings generated by lattices are constructed by iterations of the basic extension, yielding generalizations of Carathéodory's theorem which are optimal with respect to inner and outer approximations. (For another construction by transfinite recursion of measures from a ring to the generated \(\sigma\)-ring, see [\textit{L. LeBlanc} and \textit{G. E. Fox}, Can. J. Math. 8, 516--523 (1956; Zbl 0073.27202)].) The author's goals are to 1. support the view that lattices are the appropriate structure for the theory of contents and measures; 2. treat abstract extensions and regularity at the same time in a general fashion; 3. advocate a constructive method using transfinite recursion.