The condition that a sequence of random elements of a separable metric space converges in probability to a random element, standing hypotheses included, is expressed by a predicative formula.
In the setting of Routine Facts, Continued: Typed Arithmetic, Maps and Predicativity and of The Real Numbers, with the Natural Numbers, Integers and Rationals Identified with Subsets of the Reals, and Completeness, let be a metatheoretic number, let be distinct set variables, and let , not necessarily distinct. Let , , , , , , , , , , , , , , , and be the seventeen parameters of Kit for def:probability-space-random-variable (iv), other than , each with its kind and value there, and let and be further distinct class variables with values the multiplication of and the distance on ; the elements and of are those of (Addition and Multiplication on [0,β] (ii)). Each parameter of Kit for def:separable-metric (i), and of Predicative Formulas for Convergence and Limits, and Maps Defined by Limits (i) for the metric space , is the first of these nineteen variables with its value. A condition on is predicative if it is expressed by a predicative formula with as the set variables of Conditions Expressed by a Predicative Formula, and Guards (i), no displayed variables, and these nineteen variables as parameters.
Convergence in probability. With , , , , , and , the condition " is a probability space, is a separable metric space, is a sequence of random elements of , is a random element of , and converges to in probability" on is predicative.
Loadingβ¦
No relations recorded yet.