Writes a predicative formula saying that a finite measure is the law of a random element, and combines it with the random-element and weak-convergence kits, quantifying over the sequence of laws and the limit law.
Throughout, formulas are written with abbreviations as in Formulas of the Language of Class Theory, Free Variables, Predicative Formulas and Abbreviations (vi), a formula being predicative when it is so with its abbreviations eliminated, and routine facts about maps and predicative formulas are used without comment (Routine Facts, Continued: Typed Arithmetic, Maps and Predicativity (iii), Routine Facts, Continued: Typed Arithmetic, Maps and Predicativity (v), Formulas of the Language of Class Theory, Free Variables, Predicative Formulas and Abbreviations (v)), and so is the agreement of the earlier version of sequences read by published results cited below with its current version (The Earlier and the New Versions of the Definitions of Sequences, Limits, Cauchy Sequences, Series and Iterated Operations Agree (i)). The given are the first of distinct set variables as in Renaming and Substituting Variables in Predicative Formulas, so that are distinct also when . The letters , , , , , , , , and denote , where , , and stand for , , and ; every other letter used below as a variable denotes one of , distinct letters denoting distinct variables, and a formula taken from another item is used at the variables named by Renaming and Substituting Variables in Predicative Formulas (i), its bound variables, like those of every formula taken from another result, renamed where necessary so that none is captured and none is a parameter. The value of the parameter is the set of Sums of Sequences in [0,β] as Typed Terms and as a Map (i), the set of natural numbers, from which sequences are maps (Sequences (i)).
Random elements. By Kit for def:probability-space-random-variable (iv), with its equal to , its indices equal to and its seventeen parameters those of the statement, which have the values and kinds that kit prescribes, and by renaming, there is a predicative formula that holds if and only if is a measurable space, is a measure on it, is a probability space, is a map, is a metric space and is a random element of on . The first two parts follow from the third (Probability Spaces, Events and Random Elements (i), Measure, Measure Space, and Probability Measure (ii)) and the fourth from the fifth (Metric Space (vi)); so holds if and only if is a probability space, is a metric space and is a random element of on .
Weak convergence. By Kit for def:weak-convergence-measures-metric (i), with its equal to and its equal to , and by renaming, there is a predicative formula , with parameters among those of the statement, that holds if and only if is a metric space, is a sequence of finite measures on , is a finite measure on and , where is the Borel -algebra of .
Laws. Let
It is predicative (Predicativity under Renaming of Set Variables by Variables, of Formulas with Ordered Pairs, and of Formulas for Relations, Functions, Maps, Injectivity, Surjectivity and Bijectivity (iii)). Claim: let be a probability space, a metric space, a random element of on with law , and a finite measure on . Then is a finite measure on , and holds if and only if . Indeed, is a probability measure on (The Law of a Random Element (i)), so , as is real (Small Facts about [0,β]: Zero, Finiteness and Sums of Zeros (ii)), and is finite (Measure, Measure Space, and Probability Measure (v), Measure, Measure Space, and Probability Measure (iii)). As is a map (Measure, Measure Space, and Probability Measure (i)), the sets and with are the with . Let . As is -measurable (Probability Spaces, Events and Random Elements (iii)), its preimage belongs to (Measurable Map, and the Set of Measurable Maps (i); in particular it is a set). For a set , holds if and only if and , that is, if and only if (Maps between Classes: Values, Pairs, Extensionality, Restrictions, Constant Maps and Preimages (ix)); so, by the axiom of extensionality, the only set satisfying the first conjunct after is , and as is a map, holds if and only if . Hence holds if and only if
the second equality being The Law of a Random Element (i). As and are maps , this holds if and only if (Maps between Classes: Values, Pairs, Extensionality, Restrictions, Constant Maps and Preimages (iii)). This proves the claim.
The formula for convergence in distribution. Let be the formula of Predicativity under Renaming of Set Variables by Variables, of Formulas with Ordered Pairs, and of Formulas for Relations, Functions, Maps, Injectivity, Surjectivity and Bijectivity (vi), and for a variable let
which holds if and only if is a function with domain (Relations, Domain, Range, Inverse and Composition (ii)). Let
These are predicative (Predicativity under Renaming of Set Variables by Variables, of Formulas with Ordered Pairs, and of Formulas for Relations, Functions, Maps, Injectivity, Surjectivity and Bijectivity (iii)), every quantifier added being over a set variable, and the free variables of are among and the parameters.
Let sets , , , , , , , , and be assigned to . The first four conjuncts of hold exactly when , , and are functions with domain ; then, for , the only sets , , and with , , and are the values , , and . So, by the paragraph on random elements, the first six conjuncts of together hold exactly when every part of the condition of (i) other than convergence in distribution holds. If they fail, then fails together with that condition. Let them hold, and write for the law of on and for that of on (The Law of a Random Element (i), with the notation of Probability Spaces: Notation (ii)).
As is a probability measure on (The Law of a Random Element (i)), is a measurable space, and by Kit for def:measure-measure-space (x) the finite measures on it form a set . By the claim, and each belong to , and Maps and Relations Given by Formulas (i), with and as its and (the expression there being , the law of the value , which lies in for every ), gives the sequence of laws , a map (a set, as an element of by The Elements of the Class of Functions from a Set to a Set, and This Class Is a Set (i)) and so a sequence of finite measures on . We show that holds if and only if
Suppose holds with sets and . By , is a sequence of finite measures on , is a finite measure on it, and . By the claim, applied to and , gives . For , the only set with is the term , and the only sets and with and are and ; so holds, and by the claim . The maps and from to ( maps into because each is a finite measure on , by ) thus have the same terms, so they are equal (Sequences: Enlarging the Codomain, Extensionality and the Range (ii)), and . Conversely, if , then and satisfy , and by the claim and for every ; with the description of the sets , and above, this is the bracket after , so holds. By Convergence in Distribution of Random Elements of a Metric Space (i), therefore holds if and only if converges to in distribution. In every case holds if and only if the condition of (i) holds with the sets assigned to . So is a predicative formula in , in the sense of Renaming and Substituting Variables in Predicative Formulas, expressing this condition.
Convergence in distribution. By Renaming and Substituting Variables in Predicative Formulas (i), with its equal to , its equal to , its equal to and for , the formula is a predicative formula in that holds, under every assignment of sets to , exactly when the condition of (i) holds for the sets assigned to . This proves (i).
Loadingβ¦