MHB Multiplication Theorem on Probability and proof

alfred2
Messages
8
Reaction score
0
Hi Everyone!

I'm with Conditional Probability and I don't understan this theorem.

Theorem:
If
http://imageshack.us/a/img28/1349/1qg.png
then
http://imageshack.us/a/img209/8829/aor.png
Proof:
All the conditional probabilities are well defined, since
http://imageshack.us/a/img197/8938/4xp.png
We can rewrite the right site of the equality as follows
http://imageshack.us/a/img62/3095/5d9.png
Obviously we can simplify the terms through
http://imageshack.us/a/img855/7523/ikm.png
Can anyone say me how does the simplification work? And why it is so important to be sure that

Thank you =)
 
Mathematics news on Phys.org
Welcome to MHB, alfred! :)

The simplification is a consequence of how fractions are multiplied and simplified in general.
Consider for instance:
$$\frac 3 4 \cdot \frac 4 5 \cdot \frac 5 6 = \frac 3 {\cancel 4} \cdot \frac {\cancel 4} {\cancel 5} \cdot \frac {\cancel 5} 6 = \frac 3 6$$
 
Thanks! You were right ;)
 
Insights auto threads is broken atm, so I'm manually creating these for new Insight articles. In Dirac’s Principles of Quantum Mechanics published in 1930 he introduced a “convenient notation” he referred to as a “delta function” which he treated as a continuum analog to the discrete Kronecker delta. The Kronecker delta is simply the indexed components of the identity operator in matrix algebra Source: https://www.physicsforums.com/insights/what-exactly-is-diracs-delta-function/ by...
Fermat's Last Theorem has long been one of the most famous mathematical problems, and is now one of the most famous theorems. It simply states that the equation $$ a^n+b^n=c^n $$ has no solutions with positive integers if ##n>2.## It was named after Pierre de Fermat (1607-1665). The problem itself stems from the book Arithmetica by Diophantus of Alexandria. It gained popularity because Fermat noted in his copy "Cubum autem in duos cubos, aut quadratoquadratum in duos quadratoquadratos, et...
I'm interested to know whether the equation $$1 = 2 - \frac{1}{2 - \frac{1}{2 - \cdots}}$$ is true or not. It can be shown easily that if the continued fraction converges, it cannot converge to anything else than 1. It seems that if the continued fraction converges, the convergence is very slow. The apparent slowness of the convergence makes it difficult to estimate the presence of true convergence numerically. At the moment I don't know whether this converges or not.
Back
Top