The condition that a sequence of random elements of a metric space converges almost surely to a random element, together with its standing hypotheses, is expressed by a predicative formula in the seven sets involved.
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; the element of is that of (Addition and Multiplication on [0,β] (ii)). Each parameter of Predicative Formulas for Convergence and Limits, and Maps Defined by Limits (i) other than its metric space is the first of these seventeen 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 seventeen variables as parameters.
Almost sure convergence. With , , , , , and , the condition " is a probability space, is a metric space, is a sequence of random elements of , is a random element of , and converges to almost surely" on is predicative.
Loadingβ¦
No relations recorded yet.