The defining condition of a finite signed measure is written as a formula tree whose values are always used properly, the convergence and sum of a real series entering through a predicative condition built from the formulas for iterated sums and for convergence; so the condition is predicative, and the finite signed measures form a subclass of the set of functions from the σ-algebra to ℝ, hence a set.
The argument is that of The Measures, the Finite Measures and the Probability Measures on a Measurable Space Form Sets, with real values in place of values in .
Throughout, and are sets whose elements are exactly the functions and the sequences in , respectively, and every sequence in is an element of the set (The Elements of the Class of Functions from a Set to a Set, and This Class Is a Set (i), The Elements of the Class of Functions from a Set to a Set, and This Class Is a Set (ii)); in particular sequences in and in are sets, so quantifiers over sets reach all of them. Further, by Closure Properties of σ-Algebras, Intersections and Traces of σ-Algebras, and the Generated σ-Algebra (vi), and unions of sequences in and pairwise disjointness are as in Measure, Measure Space, and Probability Measure, as Finite Signed Measures takes them.
Sums of real series. Let be the condition ", the series converges, and ". It is expressed by the predicative formula
where is the formula of Iterated Operations Are Given by a Predicative Formula (i) for the addition of , placed at the variables , and by a renaming of variables (Predicativity under Renaming of Set Variables by Variables, of Formulas with Ordered Pairs, and of Formulas for Relations, Functions, Maps, Injectivity, Surjectivity and Bijectivity (i)), and is the formula of Predicative Formulas for Convergence and Limits, and Maps Defined by Limits (i) for the metric space of Predicative Formulas for Convergence and Limits, and Maps Defined by Limits (iv), with and for and . Indeed, let . By Predicative Formulas for Convergence and Limits, and Maps Defined by Limits (iv), already says that is a sequence in , so only need be considered. For , is a function from to , so the conjunct with holds if and only if for every , that is (the sum over the interval of Sums and Products over a Finite Set and over an Interval (iv), defined as the addition of is associative and commutative by The Real Numbers Form an Ordered Field in Which Every Nonempty Set Bounded Above Has a Supremum (i), agreeing there with the iterated sum), if and only if is the sequence of partial sums of , which exists by Sequences of Real Numbers Built from Given Ones: Partial Sums, Index Shifts, Predecessor Reindexing, Absolute Values and Termwise Operations (i). By Predicative Formulas for Convergence and Limits, and Maps Defined by Limits (iv), holds if and only if converges to . So the formula holds if and only if is a sequence in whose sequence of partial sums converges to , that is, by Series of Real Numbers: Partial Sums, Convergence, the Sum and Absolute Convergence (ii) and The Limit of a Convergent Sequence (i), if and only if . In particular, if and its series converges, then exactly one set satisfies , the sum, a real number by Sums of Series: a Convergent Series Has a Real Sum, and a Bound on All Partial Sums Bounds the Sum in [0,∞] (i); and the condition , " and the series converges", is expressed by the predicative formula .
The formula tree. Consider the following formula tree in the set variable . Every further letter, bound by a quantifier or naming a value, is the next unused variable at its place; conjunctions and implications are grouped to the right. The parts
say that for no lies in both and , and that for every , with , , and as named values. With the value-free tree
where abbreviates , let
with the zero of and an atom of its own.
The tree is well scoped and satisfies its side conditions. The only parameter standing as an argument or inside a pair, , is a set. The condition is itself a well-scoped tree without values or atoms of its own, so it is the reading of a predicative formula by The Graph Reading of a Formula Tree Is Predicative and Agrees with Its Reading, So the Reading Is Predicative (i), its graph reading being itself; and and are expressed by predicative formulas, as shown above.
The tree also uses its values properly under every assignment of sets. Its values are read only where holds and, inside the quantifiers, only where is a sequence in , a sequence in and . There , and exist, and so do and , as . The union of the family is a set by The Union and Product of a Family of Sets Indexed by a Set, and the Intersection of a Family with an Inhabited Index Class, Are Sets (i), it is the only set satisfying by Indexed Families of Sets and Their Union, Intersection and Product (ii) and Axiom of Extensionality for Classes, and it lies in by σ-Algebra and Measurable Space (i), so exists. Finally, the value is read only where holds, and there is a set and the only set satisfying .
The reading. By The Graph Reading of a Formula Tree Is Predicative and Agrees with Its Reading, So the Reading Is Predicative (iii), the reading of is therefore the reading of a predicative formula whose free variables are and class variables for the parameters. In the reading, quantifiers range over sets and every named variable takes its value. No set lies in both and if and only if (The Boolean Operations on Classes, Disjointness, and the Universal Class (i), The Empty Set, the Unordered Pair and the Singleton (i), Axiom of Extensionality for Classes), and sequences are sets. Hence holds if and only if , , and for every pairwise disjoint sequence in and every sequence in with for all , the series converges and
(the sequence , which exists by Maps and Relations Given by Formulas (i), is the only such ); that is, by Finite Signed Measures (i), if and only if is a finite signed measure on .
The set. Let
as in Class Abstraction: the Class of All Sets Satisfying a Predicative Formula (ii). It is a subclass of the set , hence a set by Subclasses of Sets Are Sets, the Union and Power Set of a Set Exist Uniquely, Binary Unions of Sets Are Sets, and the Universal Class Is Proper (i). For a set , if and only if and is a finite signed measure on ; since a finite signed measure is a function , it lies in , so if and only if is a finite signed measure on . This proves (i).
Loading…