<p>About seventeen years ago A. Cherny and P. Grigoriev obtained the following striking result: for any bounded random variables <i>X</i> and <i>Y</i> with the same distribution, there exists a sequence of sigma-algebras <InlineEquation ID="IEq1"> <EquationSource Format="TEX">\(\mathcal {F}_n\)</EquationSource> <EquationSource Format="MATHML"><math> <msub> <mi mathvariant="script">F</mi> <mi>n</mi> </msub> </math></EquationSource> </InlineEquation> such that <InlineEquation ID="IEq2"> <EquationSource Format="TEX">\(||X_n-Y||_\infty &lt;\varepsilon _n\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mrow> <mo stretchy="false">|</mo> <mo stretchy="false">|</mo> </mrow> <msub> <mi>X</mi> <mi>n</mi> </msub> <mo>-</mo> <mi>Y</mi> <msub> <mrow> <mo stretchy="false">|</mo> <mo stretchy="false">|</mo> </mrow> <mi>∞</mi> </msub> <mo>&lt;</mo> <msub> <mi>ε</mi> <mi>n</mi> </msub> </mrow> </math></EquationSource> </InlineEquation>, where <InlineEquation ID="IEq3"> <EquationSource Format="TEX">\(X_1=\mathbb {E}[X|\mathcal {F}_1], \dots , X_n=\mathbb {E}[X_{n-1}|\mathcal {F}_n]\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <msub> <mi>X</mi> <mn>1</mn> </msub> <mo>=</mo> <mi mathvariant="double-struck">E</mi> <mrow> <mo stretchy="false">[</mo> <mi>X</mi> <mo stretchy="false">|</mo> <msub> <mi mathvariant="script">F</mi> <mn>1</mn> </msub> <mo stretchy="false">]</mo> </mrow> <mo>,</mo> <mo>⋯</mo> <mo>,</mo> <msub> <mi>X</mi> <mi>n</mi> </msub> <mo>=</mo> <mi mathvariant="double-struck">E</mi> <mrow> <mo stretchy="false">[</mo> <msub> <mi>X</mi> <mrow> <mi>n</mi> <mo>-</mo> <mn>1</mn> </mrow> </msub> <mo stretchy="false">|</mo> <msub> <mi mathvariant="script">F</mi> <mi>n</mi> </msub> <mo stretchy="false">]</mo> </mrow> </mrow> </math></EquationSource> </InlineEquation> and <InlineEquation ID="IEq4"> <EquationSource Format="TEX">\(\varepsilon _n\)</EquationSource> <EquationSource Format="MATHML"><math> <msub> <mi>ε</mi> <mi>n</mi> </msub> </math></EquationSource> </InlineEquation> tends to zero as <InlineEquation ID="IEq5"> <EquationSource Format="TEX">\(n \rightarrow \infty \)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mi>n</mi> <mo stretchy="false">→</mo> <mi>∞</mi> </mrow> </math></EquationSource> </InlineEquation>. We provide a transparent and deterministic interpretation of this statement, using a problem with 2<i>n</i> cups, <i>n</i> filled with water and <i>n</i> empty, connected with pipes, with the goal of transferring as much water as possible from full cups to empty, using only these connections. As a result, this interpretation, as a separate problem, is accessible to high school students and allows us to present a relatively elementary probability proof of the above theorem about conditional expectations, which is accessible to undergraduate students in probability/operations research. Moreover, our approach shows the optimal selection of such a sequence of sigma-algebras and allows us to obtain the exact first term of the asymptotic behavior of <InlineEquation ID="IEq6"> <EquationSource Format="TEX">\(\varepsilon _n\)</EquationSource> <EquationSource Format="MATHML"><math> <msub> <mi>ε</mi> <mi>n</mi> </msub> </math></EquationSource> </InlineEquation>, when <i>n</i> tends to infinity, by using moment-generating functions. This term equals the amount of water left under the optimal transfer. Finally, we discuss two other mathematical problems where the "hydrostatic" interpretation also plays an important role.</p>

错误:搜索内容不能为空,请输入英文关键词
错误:关键词超出字数限制,请精简
高级检索

Conditional expectations and pouring water from full cups to empty

  • Georgy G. Gaitsgori,
  • Stanislav A. Molchanov,
  • Isaac M. Sonin

摘要

About seventeen years ago A. Cherny and P. Grigoriev obtained the following striking result: for any bounded random variables X and Y with the same distribution, there exists a sequence of sigma-algebras \(\mathcal {F}_n\) F n such that \(||X_n-Y||_\infty <\varepsilon _n\) | | X n - Y | | < ε n , where \(X_1=\mathbb {E}[X|\mathcal {F}_1], \dots , X_n=\mathbb {E}[X_{n-1}|\mathcal {F}_n]\) X 1 = E [ X | F 1 ] , , X n = E [ X n - 1 | F n ] and \(\varepsilon _n\) ε n tends to zero as \(n \rightarrow \infty \) n . We provide a transparent and deterministic interpretation of this statement, using a problem with 2n cups, n filled with water and n empty, connected with pipes, with the goal of transferring as much water as possible from full cups to empty, using only these connections. As a result, this interpretation, as a separate problem, is accessible to high school students and allows us to present a relatively elementary probability proof of the above theorem about conditional expectations, which is accessible to undergraduate students in probability/operations research. Moreover, our approach shows the optimal selection of such a sequence of sigma-algebras and allows us to obtain the exact first term of the asymptotic behavior of \(\varepsilon _n\) ε n , when n tends to infinity, by using moment-generating functions. This term equals the amount of water left under the optimal transfer. Finally, we discuss two other mathematical problems where the "hydrostatic" interpretation also plays an important role.