A Note on the Selection Expectation and Support Function

In this paper, we prove the relationship between selection expectation and support function by a new method.


Introduction
The studies of random geometrical objects can go back at least to the famous Buffon needle problem [1].Then the theory of random sets first study in the book by Matheron [2], who formulated the exact definition of a random closed set and developed the relevant techniques.The recently published book by Molchanov [1] is highly interdisciplinary and unites a number of mathematical theories and concepts for stochastic geometry, which has witnessed a rapid growth (see, e.g., [3]- [12]).
The relationship between random sets and convex geometry has been thoroughly explored within the stochastic geometry literature; see, e.g.Weil and Wieacker [13].The main techniques stem from convex and integral geometry; see Schneider [14], Gardner [15] and Schneider and Weil [8].The support function is one of the most important concepts in convex geometry.The goal of the present paper is to discuss a new approach for the relationship between selection expectation and support function, which has played an essential role in proving the strong law of large numbers for random compact sets [4].
The organization of this manuscript is as follows.In the next section, we set notations and give preliminaries.In the last section we will prove the relationship between selection expectation and support function by a new method.

Notations and Preliminaries
We consider the d-dimensional Euclidean space d  equipped with its usual inner product , , norm ⋅ , the unit sphere 1 d S − and the unit ball B. Let  denote the family of all nonempty, compact subsets of d  , c  denote the subfamily of  which are also convex.For , the support function [14] [15] of K is defined by Obviously, for K, Hence a convex body is uniquely determined by its support function.
In order to show that a sequence of the sets of nonempty, compact subsets converges to another set of nonempty, compact subsets.One must define the distance between two sets.It motivates the following definition.
For , K L∈  , Hausdorff metric (Hausdorff distance) [14] [15] between K and L is defined as Then  turns into a separable, locally compact metric space.The point The set of all convex combinations of any finitely many elements of A is called the convex hull of A and is denoted by coA.
The family of closed subsets of d  is denoted by  .Let us fix a complete probability space ( ) , ,P Ω F which will be used to define random elements ([1] [16]).
A map It is natural to define random open sets as complements to random closed sets, so that : Therefore we can regard a random set X as a measurable map defined on an abstract probability space ( ) , ,P Ω F and taking values in the collection  .A random set X is called simple, if there exists a finite measurable partition 1 2 , , , n A A A  of Ω and sets called approximable if X is an almost sure limit of a sequence of simple random sets.Similarly, a random set X with almost surely compact values is called a random compact set.The norm X of a random set X is the real random variable associating the distance from the origin to every ( ) A random vector : x A ∈ F is an atom in probability space ( ) , ,P Ω F , if ( ) 0 P A > and for any A′ ∈ F with A A ′ ⊆ , either ( ) ( ) or ( ) 0 P A′ = .The probability space is said to be non-atomic if no such A exists.
The space  of closed sets (and also the space  of compact sets) is non-linear, so that conventional concepts of expectations in linear spaces are not directly applicable for random closed (or compact) sets.
Following Artstein and Vitale [4] in adapting the Aumann [16] integral, the expectation of X is defined by Remark: 1) Selection expectation (also called the Aumann expectation), which is the best investigated con-cept of expectation for random sets.Since many results can be naturally formulated for random closed sets in Banach spaces.
2) We cite an example to illustrate the meaning of selection expectation.If X is a simple random compact set, i.e. .

Selection Expectation and Support Functions
Now we are ready to prove the main result in this section.Proof.One of two probability spaces contains the atoms which may lead to the fact that two independent and identically distributed random compact sets may have different selection expectations.Therefore if i X is non- constant, we can pick appropriate probability space such that the probability space is nonatomic.
Note that if X is a random compact set, then ( ) , h X u is random variable.For : X Ω →  , there exists a sequence of simple random compact sets n Y X → .Then we can infer that .
is the characteristic function of ( ) . From the definition of Hausdorff metric, the continuity and the linearity of the support function and (5), it follows that