Remark:
Corollary 3.3 extends a respective result for bounded one-period positions ([16], Proposition 3).
Let us now consider some special situations where Theorem 3.1 might be used.
Remark 3.4 Let Ω = Ω × T with Ω denoting a set of scenarios, equipped with a metrizable topology tω as well as
the induced σ-algebra B(Ω), and T being a time set, endowed with a separably metrizable topology ττ as well as
the generated σ-algebra B(T). Furthermore let X consist of all bounded real-valued mappings on Ω × T which are
measurable w.r.t. the product σ-algebra B(Ω) ® B(T), and let L be the set of all bounded real-valued mappings on
Ω × T which are continuous w.r.t. the product topology tω × ττ. Finally S is defined to gather the closed subsets of
Ω × T w.r.t. the metrizable topology tω × ττ. Using the introduced notations, σ(X) = B(Ω) ®B(T) is generated by S,
L ⊆ X, and we may restate Theorem 3.1 with E being the space of all bounded nonnegative lower semicontinuous
mappings on Ω × T. This version generalizes an analogous result for the one-period positions (cf. [16], Theorem
2), and will be proved in section 7.
We may also utilize Theorem 3.1 for cadlag positions.
Remark 3.5 Let T = [0,T], C = R, let (Ft)t∈T be a filtration of σ-algebras on some nonvoid set Ω, and let X
be the set of cadlag positions. Then σ(X) is the so-called optional σ-algebra. We may associate for stopping
times S1 , S2 , S1 ≤ S2, the stochastic interval [S1 , S2 [, defined by [S1 , S2 [(ω, t) := 1 if S1 (ω) ≤ t < S2 (ω), and
[S1 , S2 [(ω, t) := 0 otherwise. I stands for the set of all such stochastic intervals. It can be shown that σ(X) is
generated by the stochastic intervals [S, ∞[ (cf. [5], IV, 64).
For L let us choose the vector space spanned by the stochastic intervals [S, ∞[, which is also spanned by the positions
max [Si , Sei [ (r ∈ N), where [Si , Sei [ ∈ I for i ∈ {1, ..., r}. Moreover, L is indeed a Stonean vector lattice, and
i∈{1,...,r}
r -1
{X-1 ([x, ∞[) | X ∈ L nonnegative, x > 0} is an algebra consisting of all the subsets S [Si , Sei[ ({1}) with r ∈ N
i=1
and [Si, Sei[ ∈ I for i ∈ {1, ..., r}.
Using the introduced notations, we may restate Theorem 3.1.
Theorem 3.1 may be used as a basis to derive conditions for a strong robust representation of ρ, i.e. a σ-additive
robust representation where solutions of the associated optimization problems exist. We shall succeed in finding a
full characterization in the next section.
10
More intriguing information
1. The name is absent2. The technological mediation of mathematics and its learning
3. Naïve Bayes vs. Decision Trees vs. Neural Networks in the Classification of Training Web Pages
4. Voting by Committees under Constraints
5. A MARKOVIAN APPROXIMATED SOLUTION TO A PORTFOLIO MANAGEMENT PROBLEM
6. Direct observations of the kinetics of migrating T-cells suggest active retention by endothelial cells with continual bidirectional migration
7. An Efficient Secure Multimodal Biometric Fusion Using Palmprint and Face Image
8. Nach der Einführung von Arbeitslosengeld II: deutlich mehr Verlierer als Gewinner unter den Hilfeempfängern
9. AGRICULTURAL PRODUCERS' WILLINGNESS TO PAY FOR REAL-TIME MESOSCALE WEATHER INFORMATION
10. NATIONAL PERSPECTIVE