Some inverse problems involving conditional expectations
Let ([Omega], F, P) be a probability space, let H be a sub-[sigma]-algebra of F, and let Y be positive and H-measurable with E[Y] = 1. We discuss the structure of the convex set CE(Y; H) = {X [set membership, variant] pF: Y = E[XH]} of random variables whose conditional expectation given H is the prescribed Y. Several characterizations of extreme points of CE(Y; H) are obtained. A necessary and sufficient condition is given in order that CE(Y; H) be the closed, convex hull of its extreme points. For the case of finite F we explicitly calculate the extreme points of CE(Y; H), identify pairs of adjacent extreme points, and characterize extreme points of CE(Y; H) [down curve] CE(Z; G), where G is a second sub-[sigma]-algebra of F and Z [set membership, variant] pG. When H = [sigma](Y) and appropriate topological hypotheses hold, extreme points of CE(Y; H) are shown to be in explicit one-to-one correspondence with certain left inverses of Y. Finally, it is shown how the same approach can be applied to the problem of extremal random measures on + with a prescribed compensator, to deduce that the number of extreme points is zero or one.
Year of publication: |
1981
|
---|---|
Authors: | Karr, A. F. |
Published in: |
Journal of Multivariate Analysis. - Elsevier, ISSN 0047-259X. - Vol. 11.1981, 1, p. 17-39
|
Publisher: |
Elsevier |
Keywords: | Conditional expectation convex set extreme point left inverse measurable selection random measure compensator |
Saved in:
Saved in favorites
Similar items by person
-
The inverse balayage problem for Markov chains
Karr, A. F., (1978)
-
The inverse balayage problem for Markov chains, part II
Karr, A. F., (1979)
-
Karr, A. F., (1978)
- More ...