In the traditional foundations of probability theory, one selects a probability space , and makes a distinction between *deterministic* mathematical objects, which do not depend on the sampled state , and *stochastic* (or *random*) mathematical objects, which do depend (but in a measurable fashion) on the sampled state . For instance, a *deterministic real number* would just be an element , whereas a *stochastic real number* (or *real random variable*) would be a measurable function , where in this post will always be endowed with the Borel -algebra. (For readers familiar with nonstandard analysis, the adjectives “deterministic” and “stochastic” will be used here in a manner analogous to the uses of the adjectives “standard” and “nonstandard” in nonstandard analysis. The analogy is particularly close when comparing with the “cheap nonstandard analysis” discussed in this previous blog post. We will also use “relative to ” as a synonym for “stochastic”.)

Actually, for our purposes we will adopt the philosophy of identifying stochastic objects that agree almost surely, so if one was to be completely precise, we should define a stochastic real number to be an *equivalence class* of measurable functions , up to almost sure equivalence. However, we shall often abuse notation and write simply as .

More generally, given any measurable space , we can talk either about deterministic elements , or about stochastic elements of , that is to say equivalence classes of measurable maps up to almost sure equivalence. We will use to denote the set of all stochastic elements of . (For readers familiar with sheaves, it may helpful for the purposes of this post to think of as the space of measurable global sections of the trivial -bundle over .) Of course every deterministic element of can also be viewed as a stochastic element given by (the equivalence class of) the constant function , thus giving an embedding of into . We do not attempt here to give an interpretation of for sets that are not equipped with a -algebra .

Remark 1In my previous post on the foundations of probability theory, I emphasised the freedom to extend the sample space to a larger sample space whenever one wished to inject additional sources of randomness. This is of course an important freedom to possess (and in the current formalism, is the analogue of the important operation of base change in algebraic geometry), but in this post we will focus on a single fixed sample space , and not consider extensions of this space, so that one only has to consider two types of mathematical objects (deterministic and stochastic), as opposed to having many more such types, one for each potential choice of sample space (with the deterministic objects corresponding to the case when the sample space collapses to a point).

Any (measurable) -ary operation on deterministic mathematical objects then extends to their stochastic counterparts by applying the operation pointwise. For instance, the addition operation on deterministic real numbers extends to an addition operation , by defining the class for to be the equivalence class of the function ; this operation is easily seen to be well-defined. More generally, any measurable -ary deterministic operation between measurable spaces extends to an stochastic operation in the obvious manner.

There is a similar story for -ary relations , although here one has to make a distinction between a deterministic reading of the relation and a stochastic one. Namely, if we are given stochastic objects for , the relation does not necessarily take values in the deterministic Boolean algebra , but only in the stochastic Boolean algebra – thus may be true with some positive probability and also false with some positive probability (with the event that being stochastically true being determined up to null events). Of course, the deterministic Boolean algebra embeds in the stochastic one, so we can talk about a relation being determinstically true or deterministically false, which (due to our identification of stochastic objects that agree almost surely) means that is almost surely true or almost surely false respectively. For instance given two stochastic objects , one can view their equality relation as having a stochastic truth value. This is distinct from the way the equality symbol is used in mathematical logic, which we will now call “equality in the deterministic sense” to reduce confusion. Thus, in the deterministic sense if and only if the stochastic truth value of is equal to , that is to say that for almost all .

Any universal identity for deterministic operations (or universal implication between identities) extends to their stochastic counterparts: for instance, addition is commutative, associative, and cancellative on the space of deterministic reals , and is therefore commutative, associative, and cancellative on stochastic reals as well. However, one has to be more careful when working with mathematical laws that are not expressible as universal identities, or implications between identities. For instance, is an integral domain: if are deterministic reals such that , then one must have or . However, if are *stochastic* reals such that (in the deterministic sense), then it is no longer necessarily the case that (in the deterministic sense) or that (in the deterministic sense); however, it is still true that “ or ” is true in the deterministic sense if one interprets the boolean operator “or” stochastically, thus “ or ” is true for almost all . Another way to properly obtain a stochastic interpretation of the integral domain property of is to rewrite it as

and then make all sets stochastic to obtain the true statement

thus we have to allow the index for which vanishing occurs to also be stochastic, rather than deterministic. (A technical note: when one proves this statement, one has to select in a measurable fashion; for instance, one can choose to equal when , and otherwise (so that in the “tie-breaking” case when and both vanish, one always selects to equal ).)

Similarly, the law of the excluded middle fails when interpreted deterministically, but remains true when interpreted stochastically: if is a stochastic statement, then it is not necessarily the case that is either deterministically true or deterministically false; however the sentence “ or not-” is still deterministically true if the boolean operator “or” is interpreted stochastically rather than deterministically.

To avoid having to keep pointing out which operations are interpreted stochastically and which ones are interpreted deterministically, we will use the following convention: if we assert that a mathematical sentence involving stochastic objects is true, then (unless otherwise specified) we mean that is deterministically true, assuming that all relations used inside are interpreted stochastically. For instance, if are stochastic reals, when we assert that “Exactly one of , , or is true”, then by default it is understood that the relations , , and the boolean operator “exactly one of” are interpreted stochastically, and the assertion is that the sentence is deterministically true.

In the above discussion, the stochastic objects being considered were elements of a deterministic space , such as the reals . However, it can often be convenient to generalise this situation by allowing the ambient space to also be stochastic. For instance, one might wish to consider a stochastic vector inside a stochastic vector space , or a stochastic edge of a stochastic graph . In order to formally describe this situation within the classical framework of measure theory, one needs to place all the ambient spaces inside a measurable space. This can certainly be done in many contexts (e.g. when considering random graphs on a deterministic set of vertices, or if one is willing to work up to equivalence and place the ambient spaces inside a suitable moduli space), but is not completely natural in other contexts. For instance, if one wishes to consider stochastic vector spaces of potentially unbounded dimension (in particular, potentially larger than any given cardinal that one might specify in advance), then the class of all possible vector spaces is so large that it becomes a proper class rather than a set (even if one works up to equivalence), making it problematic to give this class the structure of a measurable space; furthermore, even once one does so, one needs to take additional care to pin down what it would mean for a random vector lying in a random vector space to depend “measurably” on .

Of course, in any reasonable application one can avoid the set theoretic issues at least by various *ad hoc* means, for instance by restricting the dimension of all spaces involved to some fixed cardinal such as . However, the measure-theoretic issues can require some additional effort to resolve properly.

In this post I would like to describe a different way to formalise stochastic spaces, and stochastic elements of these spaces, by viewing the spaces as measure-theoretic analogue of a sheaf, but being over the probability space rather than over a topological space; stochastic objects are then *sections* of such sheaves. Actually, for minor technical reasons it is convenient to work in the slightly more general setting in which the base space is a finite measure space rather than a probability space, thus can take any value in rather than being normalised to equal . This will allow us to easily localise to subevents of without the need for normalisation, even when is a null event (though we caution that the map from deterministic objects ceases to be injective in this latter case). We will however still continue to use probabilistic terminology. despite the lack of normalisation; thus for instance, sets in will be referred to as *events*, the measure of such a set will be referred to as the *probability* (which is now permitted to exceed in some cases), and an event whose complement is a null event shall be said to hold *almost surely*. It is in fact likely that almost all of the theory below extends to base spaces which are -finite rather than finite (for instance, by damping the measure to become finite, without introducing any further null events), although we will not pursue this further generalisation here.

The approach taken in this post is “topos-theoretic” in nature (although we will not use the language of topoi explicitly here), and is well suited to a “pointless” or “point-free” approach to probability theory, in which the role of the stochastic state is suppressed as much as possible; instead, one strives to always adopt a “relative point of view”, with all objects under consideration being viewed as stochastic objects relative to the underlying base space . In this perspective, the stochastic version of a set is as follows.

Definition 1 (Stochastic set)Unless otherwise specified, we assume that we are given a fixed finite measure space (which we refer to as thebase space). Astochastic set(relative to ) is a tuple consisting of the following objects:

- A set assigned to each event ; and
- A
restriction mapfrom to to each pair of nested events . (Strictly speaking, one should indicate the dependence on in the notation for the restriction map, e.g. using instead of , but we will abuse notation by omitting the dependence.)We refer to elements of as

local stochastic elementsof the stochastic set , localised to the event , and elements of asglobal stochastic elements(or simplyelements) of the stochastic set. (In the language of sheaves, one would use “sections” instead of “elements” here, but I prefer to use the latter terminology here, for compatibility with conventional probabilistic notation, where for instance measurable maps from to are referred to as real random variables, rather than sections of the reals.)Furthermore, we impose the following axioms:

- (Category) The map from to is the identity map, and if are events in , then for all .
- (Null events trivial) If is a null event, then the set is a singleton set. (In particular, is always a singleton set; this is analogous to the convention that for any number .)
- (Countable gluing) Suppose that for each natural number , one has an event and an element such that for all . Then there exists a unique such that for all .
If is an event in , we define the

localisationof the stochastic set to to be the stochastic setrelative to . (Note that there is no need to renormalise the measure on , as we are not demanding that our base space have total measure .)

The following fact is useful for actually verifying that a given object indeed has the structure of a stochastic set:

Exercise 1Show that to verify the countable gluing axiom of a stochastic set, it suffices to do so under the additional hypothesis that the events are disjoint. (Note that this is quite different from the situation with sheaves over a topological space, in which the analogous gluing axiom is often trivial in the disjoint case but has non-trivial content in the overlapping case. This is ultimately because a -algebra is closed under all Boolean operations, whereas a topology is only closed under union and intersection.)

Let us illustrate the concept of a stochastic set with some examples.

Example 1 (Discrete case)A simple case arises when is a discrete space which is at most countable. If we assign a set to each , with a singleton if . One then sets , with the obvious restriction maps, giving rise to a stochastic set . (Thus, a local element of can be viewed as a map on that takes values in for each .) Conversely, it is not difficult to see that any stochastic set over an at most countable discrete probability space is of this form up to isomorphism. In this case, one can think of as a bundle of sets over each point (of positive probability) in the base space . One can extend this bundle interpretation of stochastic sets to reasonably nice sample spaces (such as standard Borel spaces) and similarly reasonable ; however, I would like to avoid this interpretation in the formalism below in order to be able to easily work in settings in which and are very “large” (e.g. not separable in any reasonable sense). Note that we permit some of the to be empty, thus it can be possible for to be empty whilst for some strict subevents of to be non-empty. (This is analogous to how it is possible for a sheaf to have local sections but no global sections.) As such, the space of global elements does not completely determine the stochastic set ; one sometimes needs to localise to an event in order to see the full structure of such a set. Thus it is important to distinguish between a stochastic set and its space of global elements. (As such, it is a slight abuse of the axiom of extensionality to refer to global elements of simply as “elements”, but hopefully this should not cause too much confusion.)

Example 2 (Measurable spaces as stochastic sets)Returning now to a general base space , any (deterministic) measurable space gives rise to a stochastic set , with being defined as in previous discussion as the measurable functions from to modulo almost everywhere equivalence (in particular, a singleton set when is null), with the usual restriction maps. The constraint of measurability on the maps , together with the quotienting by almost sure equivalence, means that is now more complicated than a plain Cartesian product of fibres, but this still serves as a useful first approximation to what is for the purposes of developing intuition. Indeed, the measurability constraint is so weak (as compared for instance to topological or smooth constraints in other contexts, such as sheaves of continuous or smooth sections of bundles) that the intuition of essentially independent fibres is quite an accurate one, at least if one avoids consideration of an uncountable number of objects simultaneously.

Example 3 (Extended Hilbert modules)This example is the one that motivated this post for me. Suppose that one has an extension of the base space , thus we have a measurable factor map such that the pushforward of the measure by is equal to . Then we have a conditional expectation operator , defined as the adjoint of the pullback map . As is well known, the conditional expectation operator also extends to a contraction ; by monotone convergence we may also extend to a map from measurable functions from to the extended non-negative reals , to measurable functions from to . We then define the “extended Hilbert module” to be the space of functions with finite almost everywhere. This is an extended version of the Hilbert module , which is defined similarly except that is required to lie in ; this is a Hilbert module over which is of particular importance in the Furstenberg-Zimmer structure theory of measure-preserving systems. We can then define the stochastic set by settingwith the obvious restriction maps. In the case that are standard Borel spaces, one can

disintegrateas an integral of probability measures (supported in the fibre ), in which case this stochastic set can be viewed as having fibres (though if is not discrete, there are still some measurability conditions in on the local and global elements that need to be imposed). However, I am interested in the case when are not standard Borel spaces (in fact, I will take them to be algebraic probability spaces, as defined in this previous post), in which case disintegrations are not available. However, it appears that the stochastic analysis developed in this blog post can serve as a substitute for the tool of disintegration in this context.

We make the remark that if is a stochastic set and are events that are equivalent up to null events, then one can identify with (through their common restriction to , with the restriction maps now being bijections). As such, the notion of a stochastic set does not require the full structure of a concrete probability space ; one could also have defined the notion using only the abstract -algebra consisting of modulo null events as the base space, or equivalently one could define stochastic sets over the algebraic probability spaces defined in this previous post. However, we will stick with the classical formalism of concrete probability spaces here so as to keep the notation reasonably familiar.

As a corollary of the above observation, we see that if the base space has total measure , then all stochastic sets are trivial (they are just points).

Exercise 2If is a stochastic set, show that there exists an event with the property that for any event , is non-empty if and only if is contained in modulo null events. (In particular, is unique up to null events.)Hint:consider the numbers for ranging over all events with non-empty, and form a maximising sequence for these numbers. Then use all three axioms of a stochastic set.

One can now start take many of the fundamental objects, operations, and results in set theory (and, hence, in most other categories of mathematics) and establish analogues relative to a finite measure space. Implicitly, what we will be doing in the next few paragraphs is endowing the category of stochastic sets with the structure of an elementary topos. However, to keep things reasonably concrete, we will not explicitly emphasise the topos-theoretic formalism here, although it is certainly lurking in the background.

Firstly, we define a *stochastic function* between two stochastic sets to be a collection of maps for each which form a natural transformation in the sense that for all and nested events . In the case when is discrete and at most countable (and after deleting all null points), a stochastic function is nothing more than a collection of functions for each , with the function then being a direct sum of the factor functions :

Thus (in the discrete, at most countable setting, at least) stochastic functions do not mix together information from different states in a sample space; the value of at depends only on the value of at . The situation is a bit more subtle for continuous probability spaces, due to the identification of stochastic objects that agree almost surely, nevertheness it is still good intuition to think of stochastic functions as essentially being “pointwise” or “local” in nature.

One can now form the stochastic set of functions from to , by setting for any event to be the set of local stochastic functions of the localisations of to ; this is a stochastic set if we use the obvious restriction maps. In the case when is discrete and at most countable, the fibre at a point of positive measure is simply the set of functions from to .

In a similar spirit, we say that one stochastic set is a (stochastic) subset of another , and write , if we have a stochastic inclusion map, thus for all events , with the restriction maps being compatible. We can then define the power set of a stochastic set by setting for any event to be the set of all stochastic subsets of relative to ; it is easy to see that is a stochastic set with the obvious restriction maps (one can also identify with in the obvious fashion). Again, when is discrete and at most countable, the fibre of at a point of positive measure is simply the deterministic power set .

Note that if is a stochastic function and is a stochastic subset of , then the inverse image , defined by setting for any event to be the set of those with , is a stochastic subset of . In particular, given a -ary relation , the inverse image is a stochastic subset of , which by abuse of notation we denote as

In a similar spirit, if is a stochastic subset of and is a stochastic function, we can define the image by setting to be the set of those with ; one easily verifies that this is a stochastic subset of .

Remark 2One should caution that in the definition of the subset relation , it is important that for all events , not just the global event ; in particular, just because a stochastic set has no global sections, does not mean that it is contained in the stochastic empty set .

Now we discuss Boolean operations on stochastic subsets of a given stochastic set . Given two stochastic subsets of , the stochastic intersection is defined by setting to be the set of that lie in both and :

This is easily verified to again be a stochastic subset of . More generally one may define stochastic countable intersections for any sequence of stochastic subsets of . One *could* extend this definition to uncountable families if one wished, but I would advise against it, because some of the usual laws of Boolean algebra (e.g. the de Morgan laws) may break down in this setting.

Stochastic unions are a bit more subtle. The set should not be defined to simply be the union of and , as this would not respect the gluing axiom. Instead, we define to be the set of all such that one can cover by measurable subevents such that for ; then may be verified to be a stochastic subset of . Thus for instance is the stochastic union of and . Similarly for countable unions of stochastic subsets of , although for uncountable unions are extremely problematic (they are disliked by both the measure theory and the countable gluing axiom) and will not be defined here. Finally, the stochastic difference set is defined as the set of all in such that for any subevent of of positive probability. One may verify that in the case when is discrete and at most countable, these Boolean operations correspond to the classical Boolean operations applied separately to each fibre of the relevant sets . We also leave as an exercise to the reader to verify the usual laws of Boolean arithmetic, e.g. the de Morgan laws, provided that one works with at most countable unions and intersections.

One can also consider a stochastic finite union in which the number of sets in the union is itself stochastic. More precisely, let be a stochastic set, let be a stochastic natural number, and let be a stochastic function from the stochastic set (defined by setting )) to the stochastic power set . Here we are considering to be a natural number, to allow for unions that are possibly empty, with used for the positive natural numbers. We also write for the stochastic function . Then we can define the stochastic union by setting for an event to be the set of local elements with the property that there exists a covering of by measurable subevents for , such that one has and . One can verify that is a stochastic set (with the obvious restriction maps). Again, in the model case when is discrete and at most countable, the fibre is what one would expect it to be, namely .

The Cartesian product of two stochastic sets may be defined by setting for all events , with the obvious restriction maps; this is easily seen to be another stochastic set. This lets one define the concept of a -ary operation from stochastic sets to another stochastic set , or a -ary relation . In particular, given for , the relation may be deterministically true, deterministically false, or have some other stochastic truth value.

Remark 3In the degenerate case when is null, stochastic logic becomes a bit weird: all stochastic statements are deterministically true, as are their stochastic negations, since every event in (even the empty set) now holds with full probability. Among other pathologies, the empty set now has a global element over (this is analogous to the notorious convention ), and any two deterministic objects become equal over : .

The following simple observation is crucial to subsequent discussion. If is a sequence taking values in the global elements of a stochastic space , then we may also define global elements for *stochastic* indices as well, by appealing to the countable gluing axiom to glue together restricted to the set for each deterministic natural number to form . With this definition, the map is a stochastic function from to ; indeed, this creates a one-to-one correspondence between external sequences (maps from to ) and stochastic sequences (stochastic functions from to ). Similarly with replaced by any other at most countable set. This observation will be important in allowing many deterministic arguments involving sequences will be able to be carried over to the stochastic setting.

We now specialise from the extremely broad discipline of set theory to the more focused discipline of real analysis. There are two fundamental axioms that underlie real analysis (and in particular distinguishes it from real *algebra*). The first is the Archimedean property, which we phrase in the “no infinitesimal” formulation as follows:

Proposition 2 (Archimedean property)Let be such that for all positive natural numbers . Then .

The other is the least upper bound axiom:

Proposition 3 (Least upper bound axiom)Let be a non-empty subset of which has an upper bound , thus for all . Then there exists a unique real number with the following properties:

- for all .
- For any real , there exists such that .
- .
Furthermore, does not depend on the choice of .

The Archimedean property extends easily to the stochastic setting:

Proposition 4 (Stochastic Archimedean property)Let be such that for all deterministic natural numbers . Then .

Remark 4Here, incidentally, is one place in which this stochastic formalism deviates from the nonstandard analysis formalism, as the latter certainly permits the existence of infinitesimal elements. On the other hand, we caution that stochastic real numbers are permitted to be unbounded, so that formulation of Archimedean property is not valid in the stochastic setting.

The proof is easy and is left to the reader. The least upper bound axiom also extends nicely to the stochastic setting, but the proof requires more work (in particular, our argument uses the monotone convergence theorem):

Theorem 5 (Stochastic least upper bound axiom)Let be a stochastic subset of which has a global upper bound , thus for all , and is globally non-empty in the sense that there is at least one global element . Then there exists a unique stochastic real number with the following properties:

- for all .
- For any stochastic real , there exists such that .
- .
Furthermore, does not depend on the choice of .

For future reference, we note that the same result holds with replaced by throughout, since the latter may be embedded in the former, for instance by mapping to and to . In applications, the above theorem serves as a reasonable substitute for the countable axiom of choice, which does not appear to hold in unrestricted generality relative to a measure space; in particular, it can be used to generate various extremising sequences for stochastic functionals on various stochastic function spaces.

*Proof:* Uniqueness is clear (using the Archimedean property), as well as the independence on , so we turn to existence. By using an order-preserving map from to (e.g. ) we may assume that is a subset of , and that .

We observe that is a lattice: if , then and also lie in . Indeed, may be formed by appealing to the countable gluing axiom to glue (restricted the set ) with (restricted to the set ), and similarly for . (Here we use the fact that relations such as are Borel measurable on .)

Let denote the deterministic quantity

then (by Proposition 3!) is well-defined; here we use the hypothesis that is finite. Thus we may find a sequence of elements of such that

Using the lattice property, we may assume that the are non-decreasing: whenever . If we then define (after choosing measurable representatives of each equivalence class ), then is a stochastic real with .

If , then , and so

From this and (1) we conclude that

From monotone convergence, we conclude that

and so , as required.

Now let be a stochastic real. After choosing measurable representatives of each relevant equivalence class, we see that for almost every , we can find a natural number with . If we choose to be the first such positive natural number when it exists, and (say) otherwise, then is a stochastic positive natural number and . The claim follows.

Remark 5One can abstract away the role of the measure here, leaving only the ideal of null sets. The property that the measure is finite is then replaced by the more general property that given any non-empty family of measurable sets, there is an at most countable union of sets in that family that is an upper bound modulo null sets for all elements in that faily.

Using Proposition 4 and Theorem 5, one can then revisit many of the other foundational results of deterministic real analysis, and develop stochastic analogues; we give some examples of this below the fold (focusing on the Heine-Borel theorem and a case of the spectral theorem). As an application of this formalism, we revisit some of the Furstenberg-Zimmer structural theory of measure-preserving systems, particularly that of relatively compact and relatively weakly mixing systems, and interpret them in this framework, basically as stochastic versions of compact and weakly mixing systems (though with the caveat that the shift map is allowed to act non-trivially on the underlying probability space). As this formalism is “point-free”, in that it avoids explicit use of fibres and disintegrations, it will be well suited for generalising this structure theory to settings in which the underlying probability spaces are not standard Borel, and the underlying groups are uncountable; I hope to discuss such generalisations in future blog posts.

Remark 6Roughly speaking, stochastic real analysis can be viewed as a restricted subset of classical real analysis in which all operations have to be “measurable” with respect to the base space. In particular, indiscriminate application of the axiom of choice is not permitted, and one should largely restrict oneself to performing countable unions and intersections rather than arbitrary unions or intersections. Presumably one can formalise this intuition with a suitable “countable transfer principle”, but I was not able to formulate a clean and general principle of this sort, instead verifying various assertions about stochastic objects by hand rather than by direct transfer from the deterministic setting. However, it would be desirable to have such a principle, since otherwise one is faced with the tedious task of redoing all the foundations of real analysis (or whatever other base theory of mathematics one is going to be working in) in the stochastic setting by carefully repeating all the arguments.More generally, topos theory is a good formalism for capturing precisely the informal idea of performing mathematics with certain operations, such as the axiom of choice, the law of the excluded middle, or arbitrary unions and intersections, being somehow “prohibited” or otherwise “restricted”.

** — 1. Metric spaces relative to a finite measure space — **

The definition of a metric space carries over in the obvious fashion to the stochastic setting:

Definition 6 (Stochastic metric spaces)Astochastic metric spaceis defined to be a stochastic set , together with a stochastic function that obeys the following axioms for each event :

- (Non-degeneracy) If , then if and only if .
- (Symmetry) If , then .
- (Triangle inequality) If , then .

Remark 7One could potentially interpret the non-degeneracy axiom in two ways; either deterministically ( is deterministically true if and only if is deterministically true) or stochastically (“ if and only if ” is deterministically true). However, it is easy to see by a gluing argument that the two interpretations are logically equivalent. Also, if is globally non-empty, then one only needs to verify the metric space axioms for , as one can then obtain the cases by gluing with a global section on . However, when has no global elements, it becomes necessary to work locally.

Note that if is a deterministic measurable metric space (thus is a measurable space equipped with a measurable metric ), then its stochastic counterpart is a stochastic metric space. (As usual, we do not attempt to interpret when there is no measurable structure present for .) In the case of a discrete at most countable (and after deleting any points of measure zero), a stochastic metric space is essentially just a bundle of metric spaces, with no relations constraining these metric spaces with each other (for instance, the cardinality of may vary arbitrarily with ).

We extend the notion of convergence in stochastic metric spaces:

Definition 7 (Stochastic convergence)Let be a stochastic metric space, and let be a sequence in (which, as discussed earlier, may be viewed as a stochastic function from to ). Let be an element of .

- We say that
stochastically convergesto if, for every stochastic real , there exists a stochastic positive natural number such that for all stochastic positive natural numbers with .- We say that is
stochastically Cauchyif, for every stochastic real , there exists a stochastic natural number such that for all stochastic natural numbers with .- We say that is
stochastically completeif every stochastically Cauchy sequence is stochastically convergent, and furthermore for any event in , any stochastically Cauchy sequence relative to is stochastically convergent relative to .

As usual, the additional localisation in the definition of stochastic completeness to an event is needed to avoid a stochastic set being stochastically complete for the trivial reason that one of its fibres happens to be empty, so that there are no global elements of the stochastic set, only local elements. (This localisation is not needed for the notions of stochastic convergence or the stochastic Cauchy property, as these automatically are preserved by localisation.)

Exercise 3Show that to verify stochastic convergence, it suffices to restrict attention to errors of the form for deterministic positive natural numbers . Similarly for the stochastically Cauchy property.

Exercise 4Let be a measurable metric space. Show that is stochastically complete if and only if is complete. Thus for instance is stochastically complete.

In the case when is discrete and at most countable, or when is the stochastic version of a deterministic measurable space , stochastic convergence is just the familiar notion of almost sure convergence: converges stochastically to if and only if, for almost every , converges to in . There is no uniformity of convergence in the parameter; such a uniformity could be imposed by requiring the quantity in the above definition to be a deterministic natural number rather than a stochastic one, but we will not need this notion here. Similarly for the stochastic Cauchy property. Stochastic completeness in this context is then equivalent to completeness of for each that occurs with positive probability. (As noted previously, it is important here that we define stochastic completeness with localisation, in case some of the fibres are empty.)

In a stochastic metric space , we can form the balls for any and stochastic real , by setting to be the set of all such that locally on ; these are stochastic subsets of (indeed, is the inverse image of under the pinned distance map ).

By chasing the definitions, we see that if is a sequence of elements of a stochastic metric space , and is an element of , then stochastically converges to if and only if, for every stochastic , there exists a stochastic natural positive number such that for all stochastic positive natural numbers .

Given a sequence of elements of a stochastic metric space , we define a *stochastic subsequence* to be a sequence of the form , where is a sequence of stochastic natural numbers , which stochastically go to infinity in the following sense: for every stochastic positive natural number , there exists a stochastic positive natural number such that for all stochastic positive natural numbers . Note that when is discrete and at most countable, this operation corresponds to selecting a subsequence of for each occurring with positive probability, with the indices of the subsequence permitted to vary in .

Exercise 5Let be a sequence of elements of a stochastic metric space , and let .

- (i) Show that can converge stochastically to at most one element of .
- (ii) Show that if converges stochastically to , then every stochastic subsequence also converges stochastically to .
- (iii) Show that if is stochastically Cauchy, and some stochastic subsequence of converges stochastically to , then the entire sequence converges stochastically to .
- (iv) Show that there exists an event , unique up to null events, with the property that converges stochastically to , and that there exists a stochastic over the complement of , with the property that for any stochastic natural number on , there exists such that . (Informally, is the set of states for which converges to ; the key point is that this set is automatically measurable.)
- (v) (Urysohn subsequence principle) Show that converges stochastically to if and only if every stochastic subsequence of has a further stochastic subsequence that converges stochastically to .
(

Hint:All of these exercises can be established through consideration of the events for , defined up to null events as the event that holds stochastically.)

Next, we define the stochastic counterpart of total boundedness.

Definition 8 (Total boundedness)A stochastic metric space is said to bestochastically totally boundedif, for every stochastic real , there exists a stochastic natural number and a stochastic function from the stochastic set to , such that(Note that we allow to be zero locally or globally; thus for instance the empty set is considered to be totally bounded.) We will denote this stochastic function as .

Exercise 6If is discrete and at most countable, show that is stochastically totally bounded if and only if for each of positive probability, the fibre is totally bounded in the deterministic sense.

Exercise 7Show that to verify the stochastic total boundedness of a stochastic metric space, it suffices to do so for parameters of the form for some deterministic positive natural number .

We have a stochastic version of (a fragment of) the Heine-Borel theorem:

Theorem 9 (Stochastic Heine-Borel theorem)Let be a stochastic metric space. Then the following are equivalent:

- (i) is stochastically complete and stochastically totally bounded.
- (ii) Every sequence in has a stochastic subsequence that is stochastically convergent. Furthermore, for any event , every sequence in has a stochastic subsequence that is stochastically convergent relative to .

As with the definition of stochastic completeness, the second part of (ii) is necessary: if for instance is discrete and countable, and one of the fibres happens to be empty, then there are no global elements of and the first part of (ii) becomes trivially true, even if other fibres of fail to be complete or totally bounded.

Inspired by the above theorem, we will call a stochastic metric space *stochastically compact* if (i) or (ii) holds. Note that this only recovers a fragment of the deterministic Heine-Borel theorem, as the characterisation of compactness in terms of open covers is missing. I was not able to set up a characterisation of this form, since one was only allowed to use countable unions; but perhaps some version of this characterisation can be salvaged.

*Proof:* The basic idea here is to mimic the classical proof of this fragment of the Heine-Borel theorem, taking care to avoid any internal appeal to the countable axiom of choice in order to keep everything measurable. (However, we can and will use the axiom of countable choice *externally* in the ambient set theory.)

Suppose first that fails to be stochastically complete. Then we can find an event and a stochastically Cauchy sequence for that fails to be stochastically convergent in . By Exercise 5, no stochastic subsequence of can be stochastically convergent in either, and so (ii) fails.

Now suppose that fails to be stochastically bounded. Then one can find a stochastic real number , such that it is not possible to find any stochastic natural number and a stochastic sequence (that is, a stochastic function from to ), such that

(By Exercise 7 one could take for a deterministic positive natural , but we will not need to do so here.)

Let be the set of those for which one can find a stochastic sequence which is *-separated* in the sense that for all distinct with , and more generally for any event , that relative to for all distinct with . (We need to relativise to here to properly manage the case that sometimes vanishes.) It is easy to see that can be given the structure of a stochastic subset of , and contains . By Theorem 5, there is thus a well-defined supremum . We claim that is stochastically infinite with positive probability. Suppose for contradiction that this were not the case, then . By definition of supremum (taking in Theorem 5), we conclude that , thus there exists a stochastic sequence which is -separated. We now claim that

which contradicts the hypothesis that is not stochastically totally bounded. Indeed, if (2) failed, then there must exist some local element of which does not lie in . In particular, there must exist an event of positive probability such that on for all with . If we then define on by , then we see that on is -separated on , and on gluing with the original on the complement of , we see that lies in , contradicting the maximal nature of . Thus is stochastically infinite with positive probability.

We may now pass to an event of positive probability on which . By definition of the supremum, we conclude that for every deterministic natural number , we may find a sequence which are -separated. Observe that if is a deterministic natural number and we have elements , then we can find a stochastic on such that for all , since each can stochastically lie within of at most one . (To see this rigorously, one can consider the Boolean geometry of the events on which stochastically hold for various .) By iterating this construction (and applying the axiom of countable choice *externally*), we may find an infinite sequence in which is -separated, but then this sequence cannot have a convergent subsequence, and so (ii) fails.

Now suppose that is stochastically complete and stochastically totally bounded, and let be a sequence of local elements of for some event , which we may assume without loss of generality to have positive probability. By stochastic completeness, it suffices to find a stochastic subsequence which is stochastically Cauchy on .

By stochastic total boundedness, one can find a stochastic natural number and a stochastic map from to , such that

For each deterministic positive natural numbers , we define to be the event in that the assertions and both hold stochastically; this event is determined up to null events. From (3), we see that

holds up to null events for all . In particular, we have

almost surely on for all , and so on summing in

almost surely on . By selecting stochastically to be the least for which is infinite, we have and

almost surely on . We can then stochastically choose a sequence in such that holds almost surely on for each , or equivalently that the stochastic subsequence lies in . Writing , we have thus localised this stochastic subsequence to a stochastic unit ball .

By repeating this argument, we may find a further stochastic subsequence of that lies in for some , a yet further subsequence that lies in for some , and so forth. It is then easy to see that the diagonal sequence is stochastically Cauchy, and the claim follows.

For future reference, we remark that the above arguments also show that if is a stochastically totally bounded subset of a stochastically complete metric space , then every sequence in has a stochastic susbequence which converges in .

** — 2. Hilbert-Schmidt operators relative to a finite measure space — **

One could continue developing stochastic versions of other fundamental results in real analysis (for instance, working out the basic theory of stochastic continuous functions between metric spaces); roughly speaking, it appears that most of these results will go through as long as one does not require the concept of an uncountable union or intersection or the axiom of choice (in particular, I do not see how to develop a stochastic theory of arbitrary topological spaces, although the first countable case may be doable; also, any result reliant on the Hahn-Banach theorem or the non-sequential version of Tychonoff’s theorem will likely not have a good stochastic analogue). I will however focus on the results leading up to the stochastic version of the spectral theorem for Hilbert-Schmidt operators, as this is the application that motivated my post.

Let us first define the concept of a stochastic (real) Hilbert space, in more or less complete analogy with the deterministic counterpart:

Definition 10 (Stochastic Hilbert spaces)Astochastic vector spaceis a stochastic set equipped with an element , an addition map , and a scalar multiplication map which obeys the usual vector space axioms. In other words, when localising to any event , the addition map is commutative and associative with identity , and the scalar multiplication map is bilinear over . In other words, is a module over the commutative ring . As is usual, we define the subtraction map by the formula .A

stochastic inner product spaceis a stochastic vector space equipped with an inner product map which obeys the following axioms for any event :

- (Symmetry) The map is symmetric.
- (Bilinearity) The map is bilinear over .
- (Positive semi-definiteness) For any , we have , with equality if and only if .
By repeating the usual deterministic arguments, it is easy to see that any stochastic inner product space becomes a stochastic metric space with , where .

A

stochastic Hilbert spaceis a stochastic inner product space which is also stochastically complete. We denote the inner product on such spaces by and the norm by .

As usual, in the model case when is discrete and at most countable, a stochastic Hilbert space is just a bundle of deterministic Hilbert spaces for each occurring with positive probability, with no relationships between the different fibres (in particular, their dimensions may vary arbitrarily in ). In the continuous case, the notion of a stochastic Hilbert space is very closely related to that of (an extended version of) a Hilbert module over the commutative Banach algebra ; indeed, it is easy to see that the space of global elements of a stochastic Hilbert space which are *bounded* in the sense that for some deterministic real forms a Hilbert module over . (Without the boundedness restriction, one obtains instead a module over .)

Note that we do not impose any separability hypothesis on our Hilbert spaces. Despite this, much of the theory of Hilbert spaces turns out to still be of “countable complexity” in some sense, so that it can be extended to the stochastic setting without too much difficulty.

We now extend the familiar notion of an orthonormal system in a Hilbert space to the stochastic setting. A key point is that we allow the number of elements in this system to also be stochastic.

Definition 11 (Orthonormal system)Let be a stochastic Hilbert space. Astochastic orthonormal systemin consists of a stochastic extended natural number , together with a stochastic map from to , such that one has on for any event and any with . (Note that we allow to vanish with positive probability, so that the orthonormal system can be stochastically empty.)

Now we can define the notion of a stochastic Hilbert-Schmidt operator.

Definition 12 (Stochastic Hilbert-Schmidt operator)Let and be stochastic Hilbert spaces. Astochastic linear operatoris a stochastic function such that for each event , the localised maps are linear over . Such an operator is said to bestochastically boundedif there exists a non-negative stochastic real such that one hasfor all events and local elements . By (the negation of) Theorem 5, there is a least such , which we denote as .

Similarly, we say that a stochastic linear operator is

stochastically Hilbert-Schmidtif there exists a non-negative stochastic real such that one hasfor all events and all stochastic orthonormal systems on and respectively. Again, there is a least such , which we denote as .

A stochastic linear operator is said to be

compactif the image of the unit ball is stochastically totally bounded in .

Exercise 8Show that any stochastic Hilbert-Schmidt operator obeys the boundfor all events and all stochastic orthonormal systems on . Conclude in particular that is stochastically bounded with .

We have the following basic fact:

Proposition 13Any stochastic Hilbert-Schmidt operator is stochastically compact.

*Proof:* Suppose for contradiction that we could find a stochastic Hilbert-Schmidt operator which is not stochastically compact, thus is not stochastically totally bounded. By repeating the arguments used in the proof of Theorem 9, this means that there exists an event of positive probability, a stochastic real on , and an infinite sequence for such that the are -separated on .

We will need a stronger separation property. Let us say that a sequence is *linearly -separated* if one has

on for any deterministic and any stochastic reals . We claim that contains an infinite sequence that is linearly -separated. Indeed, suppose that we have already found a finite sequence in that is linearly -separated for some , and wish to add on a further element while preserving the linear -separation property, that is to say we wish to have (4) for all . By Exercise 8, such a would already lie in the closed ball . Now, by elementary geometry (applying a Gram-Schmidt process to the ) one can cover the stochastic set

by a finite union of balls

for some stochastic and some stochastic finite sequence of points in . Stochastically, each of these balls may contain at most one of the ; if we then define the stochastic positive natural number to be the least that stochastically lies outside all of the , then is well-defined, and if we set , we obtain the desired property (4).

As each lies in , we have for some with . From the Gram-Schmidt process, one may find an orthonormal system in for some such that each is a linear combination (over ) of those with . We may similarly find an orthonormal system in for some such that each is a linear combination of those with . From (4) we conclude that and that for each deterministic , the coefficient of has magnitude at least , thus

and thus by the Pythagoras theorem

on ; summing in , we contradict the Hilbert-Schmidt nature of .

Next, we establish the existence of adjoints:

Theorem 14 (Adjoint operator)Let be a stochastically bounded linear operator. Then there exists a unique stochastically bounded linear operator such thaton any event and any , . In particular we have .

*Proof:* Uniqueness is an easy exercise that we leave to the reader, so we focus on existence. The point here is that the Riesz representation theorem for Hilbert spaces is sufficiently “constructive” that it can be translated to the stochastic setting.

Let be an event and be a local element of . We let be the stochastic set on defined by setting for to be the set of all stochastic real numbers of the form , where with . By Theorem 5, we may then find a sequence for such that converges stochastically to on . For any two , we have from the parallelogram law that

and hence by homogeneity

on combining this with the stochastic convergence of , we conclude that is stochastically Cauchy on the event in that is non-zero. Setting to be the stochastic limit of the on this event (and set to on the complementary event), we see that and

On the event that is non-zero, is thus non-zero, and consideration of the vectors for stochastic real and stochastic vectors soon reveals that

whenever , which by elementary linear algebra gives a representation of the form

for some (a scalar multiple of ); when vanishes, we simply take . It is then a routine matter to verify that is a stochastically bounded linear operator, and the claim follows.

We use this to relativise the spectral theorem (or more precisely, the singular value decomposition) for compact operators:

Theorem 15 (Spectral theorem for stochastically compact operators)Let be a stochastically compact linear operator, with also stochastically compact. Then there exists , orthonormal systems and of and respectively, and a stochastic sequence in such that on an event whenever are stochastic natural numbers on , and such that the go to zero in the sense that for any stochastic real on an event , there exist a stochastic natural number on such that on whenever is a stochastic natural number on . Furthermore, for any event and , one hason . (Note that a Bessel inequality argument shows that the series is convergent; indeed it is even unconditionally convergent.)

It is likely that the hypothesis that be stochastically compact is redundant, in that it is implied by the stochastically compact nature of , but I did not attempt to prove this rigorously as it was not needed for my application (which is focused on the Hilbert-Schmidt case).

To prove this theorem, we first establish a fragment of it for the top singular value :

Theorem 16 (Largest singular value)Let be a stochastically compact linear operator, and let be the event where (this event is well-defined up to a null event). Then there exist , with on , such thatand dually that

on .

*Proof:* Note that are necessarily non-trivial on . Let denote the set of all expressions of the form on , where , with on , then is a globally non-empty stochastic subset of which has as an upper bound. Indeed, from Theorem 5 and the definition of , it is not hard to see that . From this, we may construct a sequence in that converges stochastically to on , and hence we may find sequences , for with on with stochastically convergent to . By the Cauchy-Schwarz inequality, this implies that is stochastically convergent to ; from the parallelogram law applied to and , we conclude that converges stochastically to zero. On the other hand, as is compact, we can pass to a stochastic subsequence and ensure that is stochastically convergent, thus is also stochastically convergent to some limit . Similar considerations using the adjoint operator allow us to assume that is stochastically convergent to some limit . It is then routine to verify that , , and , giving the claim.

Now we prove Theorem 15.

*Proof:* (Proof of Theorem 15.) Define a *partial singular value decomposition* to consist of the following data:

- A stochastic extended natural number ;
- A stochastic orthonormal system of ;
- A stochastic orthonormal system of ; and
- A non-increasing stochastic sequence in

such that, for any event , and any with ,

- on .
- on .
- Whenever is orthogonal to for all , one has on .
- Whenever with and is orthogonal to for all , one has on .

We let be the set of all that can arise from a partial singular value decomposition; then is a stochastic subset of that contains , and by Theorem 5 we can form the supremum .

Let us first localise to the event that is stochastically finite. As in the proof of the Heine-Borel theorem, we can use the discrete nature of the natural numbers to conclude that on . Thus there exists a partial singular value decomposition on with .

Define on by setting for to be the set of all that are orthogonal to all the with ; this can easily be seen to be a stochastic Hilbert space (a stochastically finite codimension subspace of ). Similarly define on by setting to be the set of all that are orthogonal to all the with . As and , we see that maps to , and maps to ; from the remaining axioms of a partial singular value decomposition we see that on . If vanishes, then vanishes on , and one easily obtains the required singular value decomposition in . Now suppose for contradiction that does not (deterministically) vanish, so there is a subevent of of positive probability on which is positive. By Theorem 16, we can then find unit vectors and such that

and

If we then set , we can obtain a partial singular value decomposition on with now set to ; gluing this with the original partial singular value of decomposition on the complement of , we contradict the maximality of . This concludes the proof of the spectral theorem on the event that .

Now we localise to the complementary event that is infinite. Now we need to run a compactness argument before we can ensure that actually lies in . Namely, for any deterministic natural number , we can find a partial singular value decomposition with data on such that . We now claim that the decay in uniformly in in the following sense: for any deterministic real , there exists a stochastic such that whenever and are such that . Indeed, from the total boundedness of , one can cover this space by a union of balls of radius for some . If is such that on some event of positive probability, then the vectors for are -separated on by Pythagoras’s theorem, leading to a contradiction since each ball can capture at most one of these vectors. This gives the claim.

By repeatedly passing to stochastic subsequences and diagonalising, we may assume that converges stochastically to a limit as for each which is non-increasing. By compactness of , we may also assume that the are stochastically convergent in for each fixed , which implies that the converge stochastically to a limit whenever . A similar argument using the compactness of allows us to assume that converges stochastically to a limit whenever . One then easily verifies that the and are orthonormal systems when restricted to those for which . Furthermore, a limiting argument shows that whenever is a deterministic real, is an event, and is a unit vector orthogonal to for those with , then . From this and a decomposition into orthonormal bases and a limiting argument we see that

on for any , and the claim follows.

Finally, we specialise to the example of Hilbert modules from Example 3.

Corollary 17 (Singular value decomposition on Hilbert modules)Let be extensions of a finite measure space , with factor maps and . Let be a bounded linear map (in the sense) which is also linear over (which embeds via pullback into and ); note that may be extended to a linear map from to . Assume the following Hilbert-Schmidt property: there exists a measurable such thatfor all measurable and all that are orthonormal systems over in the sense that

whenever , and similarly

whenever . Then one can find a measurable , orthonormal systems , and defined for that are non-increasing and decay to zero as (in the case ), such that

for all .

In the case that and are standard Borel, one can obtain this result from the classical spectral theorem via a disintegration argument. However, without such a standard Borel assumption, the most natural way to proceed appears to be through the above topos-theoretic machinery. This result can be used to establish some of the basic facts of the Furstenberg-Zimmer structure theory of measure-preserving systems, and specifically that weakly mixing functions relative to a given factor form the orthogonal complement to compact extensions of that factor, and that such compact extensions are the inverse limit of finite rank extensions. With the above formalism, this can be done even for measure spaces that are not standard Borel, and actions of groups that are not countable; I hope to discuss this in a subsequent post.

## 10 comments

Comments feed for this article

15 July, 2014 at 5:42 am

kawhi wOh, my. You get up so early if you are now in LA!

15 July, 2014 at 10:19 am

BabujiWhat a brilliant synthesis. Mozart at work.

15 July, 2014 at 12:01 pm

Roger PurvesA trifling comment, but In the third paragraph, I would have expected you to start with a measure space, since a measure (or some sort of sigma-ideal appended to a measurable space) is required to get to the almost sure equalities.

(Thank you for the wonderful and generous blog.)

Roger Purves

15 July, 2014 at 12:08 pm

Terence TaoTo describe almost sure equivalence of two maps , the base needs to be a measure space, but the range only needs to be a measurable space.

16 July, 2014 at 3:38 am

Roger PurvesOops! I am feeling a little sheepish about reading so carelessly. Thank you for taking the time to spell it out.

RP

16 July, 2014 at 2:27 pm

Miguel LacruzThe display before Theorem 15 reads and it should read

[Corrected, thanks – T.]17 July, 2014 at 6:01 am

MrCactu5 (@MonsieurCactus)I am thrown off. You are doing analysis with respect to “finite” measure spaces. How should I think of ? Should I think of or ? What is finite here?

In any case, I think the space of exogenous “stuff” we can’t account for.

17 July, 2014 at 9:56 pm

Terence TaoA finite measure space is a measure space whose total measure is finite; for instance, the unit interval with Lebesgue measure is a finite measure space, and more generally all probability spaces are finite measure spaces.

27 July, 2014 at 4:44 am

Hongseok YangWould you spell out the definitions of the stochastic sets and ? Thanks.

[See Example 2. -T]28 July, 2014 at 6:07 am

Dan LackerReally lovely post! And since I’m new here, I must thank you for maintaining a fantastic blog.

I want to point out a striking resemblance between much of this post and the theory of “conditional sets,” developed recently in this paper. (See also this PhD thesis for a more thorough account.)

To summarize: A conditional set is like a stochastic set, except that may be indexed by elements of a fixed complete Boolean algebra (satisfying an important additional assumption). A notable special case is when is the family of measurable subsets of some finite measure space, modulo null sets. In your definition of stochastic set, it seems natural to index by -modulo-null-sets, rather than by itself, in which case a stochastic set would be a special case of conditional set. The above papers also work through some natural notions of analysis relative to conditional sets, parallel to the first part of this post (up to section 2), as well as general topological spaces. If you work modulo null sets, the measure algebra satisfies the countable chain condition, which appears to be essentially what allows the authors to make sense of uncountable unions of (and thus general topological spaces built on) conditional sets.