𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On Probabilities of Linear Sets

✍ Scribed by W. Bryc; W. Smolenski


Publisher
Elsevier Science
Year
1993
Tongue
English
Weight
237 KB
Volume
45
Category
Article
ISSN
0047-259X

No coin nor oath required. For personal study only.

✦ Synopsis


If (\left(X_{k}\right){k=1}^{x}) is a sequence of independent random variables with probabilities of atoms bounded away from one and (E) is a Borel linear subspace of (\mathbb{R}^{x}), then the event (\left{\left(X{k}\right){k=1}^{X} \in E\right}) is a.s. equivalent to the event (\left{\left(X{k}\right)_{k=1}^{n} \in F\right}), where (F) is an affine subspace of (\mathbb{R}^{n}) for some (n \geqslant 1). 1993 Academic Press. Inc.


πŸ“œ SIMILAR VOLUMES


Bounds for linear functionals on convex
✍ Walter Roth πŸ“‚ Article πŸ“… 2011 πŸ› John Wiley and Sons 🌐 English βš– 187 KB

## Abstract We consider continuous monotone linear functionals on a locally convex ordered topological vector space that are sandwiched between a given \documentclass{article}\usepackage{amssymb}\begin{document}\pagestyle{empty}$(\mathbb R\cup \lbrace +\infty \rbrace )$\end{document}‐valued subline

Best Approximation on Convex Sets in Met
✍ G. C. Ahuja; T. D. Narang; Swaran Trehan πŸ“‚ Article πŸ“… 1977 πŸ› John Wiley and Sons 🌐 English βš– 256 KB

## Abstract In this paper the concepts of strictly convex and uniformly convex normed linear spaces are extended to metric linear spaces. A relationship between strict convexity and uniform convexity is established. Some existence and uniqueness theorems on best approximation in metric linear space

On Setting Response Criteria for Calibra
✍ Hongbin Gu; Thomas S. Wallsten πŸ“‚ Article πŸ“… 2001 πŸ› Elsevier Science 🌐 English βš– 145 KB

Framing the issue of subjective probability calibration in signal-detectiontheory terms, this paper first proves a theorem regarding the placement of well-calibrated response criteria and then develops an algorithm guaranteed to find such criteria, should they exist. Application of this algorithm to

Nonadditive Set Functions on a Finite Se
✍ Kenji Kashiwabara πŸ“‚ Article πŸ“… 1997 πŸ› Elsevier Science 🌐 English βš– 256 KB

A set function is a function whose domain is the power set of a set, which is assumed to be finite in this paper. We treat a possibly nonadditive set function, i.e., Ε½ . Ε½ . a set function which does not satisfy necessarily additivity, A q B s Ε½ . AjB for A l B s Π», as an element of the linear space