Talk:Doob–Dynkin lemma

	Mathematics portal This article is within the scope of WikiProject Mathematics, a collaborative effort to improve the coverage of mathematics on Wikipedia. If you would like to participate, please visit the project page, where you can join the discussion and see a list of open tasks.MathematicsWikipedia:WikiProject MathematicsTemplate:WikiProject Mathematicsmathematics articles
Low	This article has been rated as Low-priority on the project's priority scale.

Statistics Low‑importance

	This article is within the scope of WikiProject Statistics, a collaborative effort to improve the coverage of statistics on Wikipedia. If you would like to participate, please visit the project page, where you can join the discussion and see a list of open tasks.StatisticsWikipedia:WikiProject StatisticsTemplate:WikiProject StatisticsStatistics articles
Low	This article has been rated as Low-importance on the importance scale.

Merging with "Factorization lemma" article edit

Latest comment: 4 years ago2 comments1 person in discussion

I am going to merge this article with this one, as they cover the same subject. (I've requested the deletion of the Factorization lemma article already). The way the D.D. lemma is stated in the current revision is that neither $X$ nor $Y$ can assume infinite values which is crucial for conditional expectation. StrokeOfMidnight (talk) 16:36, 29 April 2020 (UTC)Reply

Update: merge complete. StrokeOfMidnight (talk) 01:41, 30 April 2020 (UTC)Reply

Deletion of dubious content edit

Latest comment: 2 years ago1 comment1 person in discussion

I have deleted the following sentence: "There are more general versions^[1] with applications including the theory of stochastic differential equations.^[2]" The article of Taraldsen has not been published in the last four years and has been cited only three times, all in an incidental and unimportant way. The deleted sentence incorrectly states that it is used in the latter paper; all that paper says is that Taraldsen's paper has some related work. They use the standard Doob-Dynkin lemma. Gumshoe2 (talk) 03:47, 30 January 2022 (UTC)Reply

References

^ Taraldsen, Gunnar (2018). "Optimal Learning from the Doob-Dynkin lemma". arXiv:1801.00974 [math.ST].
^ Hammersley, William R. P.; Šiška, David; Szpruch, Łukasz (2021-03-01). "Weak existence and uniqueness for McKean–Vlasov SDEs with common noise". The Annals of Probability. 49 (2). arXiv:1908.00955. doi:10.1214/20-AOP1454. ISSN 0091-1798. S2CID 199405528.

Add topic

[1] Taraldsen, Gunnar (2018). "Optimal Learning from the Doob-Dynkin lemma". arXiv:1801.00974 [math.ST].

[2] Hammersley, William R. P.; Šiška, David; Szpruch, Łukasz (2021-03-01). "Weak existence and uniqueness for McKean–Vlasov SDEs with common noise". The Annals of Probability. 49 (2). arXiv:1908.00955. doi:10.1214/20-AOP1454. ISSN 0091-1798. S2CID 199405528.

[1]

[2]