Repaso de la clase pasada
( Ω , F , P ) (\Omega, \mathcal{F},\mathbb{P}) ( Ω , F , P )
A n ⊆ A n + 1 , { A n } n ∈ N ⊆ F A_{n}\subseteq A_{n+1},\{ A_{n} \}_{n \in \mathbb{N}}\subseteq \mathcal{F} A n ⊆ A n + 1 , { A n } n ∈ N ⊆ F
P ( ⋃ A n ) = lim n → ∞ P ( A n ) \mathbb{P}\left( \bigcup A_{n} \right)=\underset{ n\to \infty }{ \lim } \mathbb{P}(A_{n}) P ( ⋃ A n ) = n → ∞ lim P ( A n )
Llamo B n = A n − A n − 1 B_{n}=A_{n}-A_{n-1} B n = A n − A n − 1 A 0 = ∅ A_{0}=\emptyset A 0 = ∅
⋃ B n = ⋃ A n B n ∩ B m = ∅ n ≠ m \bigcup B_{n}=\bigcup A_{n}\quad \quad B_{n}\cap B_{m}=\emptyset \quad n\neq m ⋃ B n = ⋃ A n B n ∩ B m = ∅ n = m
P ( ⋃ A n ) = P ( ⋃ B n ) = ∑ n = 1 ∞ P ( A n − A a n − 1 ) = ∑ n = 1 ∞ P ( A n ) − P ( A n − 1 ) \mathbb{P}\left( \bigcup A_{n} \right)=\mathbb{P}\left( \bigcup B_{n} \right)=\sum_{n=1}^{\infty} \mathbb{P}(A_{n}-A_{a_{n}-1})=\sum_{n=1}^{\infty} \mathbb{P}(A_{n})-\mathbb{P}(A_{n-1}) P ( ⋃ A n ) = P ( ⋃ B n ) = n = 1 ∑ ∞ P ( A n − A a n − 1 ) = n = 1 ∑ ∞ P ( A n ) − P ( A n − 1 )
Lo ultimo pues A n ⊆ A n + 1 A_{n}\subseteq A_{n+1} A n ⊆ A n + 1
= lim n → ∞ ∑ n = 1 N P ( A n ) − P ( A n − 1 ) =\underset{ n\to \infty }{ \lim } \sum_{n=1}^{N} \mathbb{P}(A_{n})-\mathbb{P}(A_{n-1}) = n → ∞ lim n = 1 ∑ N P ( A n ) − P ( A n − 1 )
= lim M → ∞ P ( A M ) − P ( A 0 ) = lim M → ∞ P ( A M ) =\underset{ M\to \infty }{ \lim } \mathbb{P}(A_{M})-\mathbb{P}(A_{0})=\underset{ M\to \infty }{ \lim } \mathbb{P}(A_{M}) = M → ∞ lim P ( A M ) − P ( A 0 ) = M → ∞ lim P ( A M )
Corolario : {\color{Red}\text{Corolario}:} Corolario :
A n ⊇ A n + 1 , Entonces P ( ⋂ A n ) = lim n → ∞ P ( A n ) \begin{array}{l}
\text{$A_{n}\supseteq A_{n+1},$ Entonces $\mathbb{P}\left( \bigcap A_{n} \right)=\underset{ n\to \infty }{ \lim }\mathbb{P}(A_{n})$ }
\end{array} A n ⊇ A n + 1 , Entonces P ( ⋂ A n ) = n → ∞ lim P ( A n )
Dem : {\color{Red} \text{Dem}:} Dem :
Tomo complemento
Ej:
Ω = { ω 1 , ω 2 , … , ω n , … } \Omega=\{ \omega_{1},\omega_{2},\dots,\omega _{n},\dots \} Ω = { ω 1 , ω 2 , … , ω n , … }
Para definir P , \mathbb{P}, P , alcanza con una sucesión ( P i ) i ∈ N ⊆ R ≥ 0 (P_{i})_{i \in \mathbb{N}}\subseteq \mathbb{R}_{\geq 0} ( P i ) i ∈ N ⊆ R ≥ 0 y que ∑ P i = 1 \sum P_{i}=1 ∑ P i = 1
P ( { ω i } ) = P i \mathbb{P}(\{ \omega_{i} \})=P_{i} P ({ ω i }) = P i
Ej:
Tomo dos dados y los sumo
A = A= A = "La suma es 4 4 4 "
B = B= B = "El segundo es par"
Ω = { ( a , b ) : a , b ∈ { 1 , 2 , … , 6 } } \Omega=\{ (a,b):a,b \in \{ 1,2,\dots,6 \} \} Ω = {( a , b ) : a , b ∈ { 1 , 2 , … , 6 }}
A = { ( 1 , 3 ) , ( 3 , 1 ) , ( 2 , 2 ) } A=\{ (1,3),(3,1),(2,2) \} A = {( 1 , 3 ) , ( 3 , 1 ) , ( 2 , 2 )}
P ( A ) = 3 36 \mathbb{P}(A)=\frac{3}{36} P ( A ) = 36 3 , P ( B ) = 1 2 \mathbb{P}(B)=\frac{1}{2} P ( B ) = 2 1
B = { ( a , b ) : a ∈ { 1 , . . , 6 } , b ∈ { 2 , 4 , 6 } } B=\{ (a,b):a \in \{ 1,..,6 \},b \in \{ 2,4,6 \} \} B = {( a , b ) : a ∈ { 1 , .. , 6 } , b ∈ { 2 , 4 , 6 }}
Probabilidad condicional
Dados A A A y B B B eventos de Ω \Omega Ω con P ( B ) > 0 \mathbb{P}(B)> 0 P ( B ) > 0 . Definimos
P ( A ∣ B ) = P ( A ∩ B ) P ( B ) \mathbb{P}(A \bigm| B)=\frac{\mathbb{P}(A\cap B)}{\mathbb{P}(B)} P ( A B ) = P ( B ) P ( A ∩ B )
Ejemplo
De una urna con 5 bolitas rojas y 4 blancas, saco 1. Además 2 de las blancas y 1 roja tienen cruz.
Defino 3 eventos
B = B= B = "La bolilla es blanca"
R = R= R = "La bolilla es roja"
C = C= C = "La bolilla tiene cruz"
P ( B ) = 4 9 P ( B ∣ C ) = 2 3 P ( B ∣ C c ) = 1 3 P ( C ∣ R ) = 1 5 P ( C ∣ R c ) = 1 2 \mathbb{P}(B)=\frac{4}{9}\quad \quad \mathbb{P}(B\bigm| C)= \frac{2}{3}\quad \quad \mathbb{P}(B\bigm| C^{c})= \frac{1}{3}\quad \mathbb{P}(C\bigm| R)= \frac{1}{5}\quad \mathbb{P}(C\bigm| \mathbb{R}^{c})=\frac{1}{2} P ( B ) = 9 4 P ( B C ) = 3 2 P ( B C c ) = 3 1 P ( C R ) = 5 1 P ( C R c ) = 2 1
P ( C c ∣ R ) = 4 5 \mathbb{P}(C^{c}\bigm| R)= \frac{4}{5} P ( C c R ) = 5 4
O b s : Obs: O b s : Si P ( B ) > 0 \mathbb{P}(B)> 0 P ( B ) > 0 ,
P B ( A ) : = P ( A ∣ B ) es una probabilidad \mathbb{P}_{B}(A) :=\mathbb{P}(A\bigm| B)\text{ es una probabilidad} P B ( A ) := P ( A B ) es una probabilidad
O b s : Obs: O b s : P ( A ∣ B ) + P ( A ∣ B c ) \mathbb{P}(A\bigm|B)+\mathbb{P}(A\bigm|B^{c}) P ( A B ) + P ( A B c ) no tiene por qué dar 1.
O b s : Obs: O b s : A ∣ B A\bigm|B A B no es un evento
Es una nueva función de probabilidad.
Por lo tanto P ( A ∣ B ∣ C ) \mathbb{P}(A\bigm|B\bigm|C) P ( A B C ) no tiene sentido.
En general, lo que están queriendo escribir es P ( A ∣ B ∩ C ) \mathbb{P}(A\bigm|B\cap C) P ( A B ∩ C )
Ejemplo:
P B ( A ∣ C ) = P B ( A ∩ C ) P B ( C ) = P ( A ∩ C ∣ B ) P ( C ∣ B ) \mathbb{P}_{B}(A\bigm| C)=\frac{\mathbb{P}_{B}(A\cap C)}{\mathbb{P}_{B}(C)}=\frac{\mathbb{P}(A\cap C\bigm| B)}{\mathbb{P}(C\bigm| B)} P B ( A C ) = P B ( C ) P B ( A ∩ C ) = P ( C B ) P ( A ∩ C B )
Ni idea que es esto. No jugar mucho con las notaciones.
O b s : Obs: O b s : P ( A ∩ B ) = P ( A ∣ B ) ⋅ P ( B ) \mathbb{P}(A\cap B)=\mathbb{P}(A\bigm|B)\cdot \mathbb{P}(B) P ( A ∩ B ) = P ( A B ) ⋅ P ( B ) Regla de multiplicación.
Sigamos con la misma urna:
Ahora saco 2 bolillas sin reposición.
A = A= A = "Las 2 bolillas que saqué son rojas"
R i = R_{i}= R i = "La i´-ésima es roja"
A = R 1 ∩ R 2 A=R_{1}\cap R_{2} A = R 1 ∩ R 2
P ( R 1 ∩ R 2 ) = P ( R 1 ) ⋅ P ( R 2 ∣ R 1 ) = 5 9 ⋅ 4 8 \mathbb{P}(R_{1}\cap R_{2})=\mathbb{P}(R_{1})\cdot \mathbb{P}(R_{2}\bigm|R_{1})= \frac{5}{9}\cdot \frac{4}{8} P ( R 1 ∩ R 2 ) = P ( R 1 ) ⋅ P ( R 2 R 1 ) = 9 5 ⋅ 8 4
P ( A ∩ B ∩ C ) = P ( A ) ⋅ P ( B ∣ A ) ⋅ P ( C ∣ A ∩ B ) \mathbb{P}(A\cap B\cap C)=\mathbb{P}(A)\cdot \mathbb{P}(B\bigm|A)\cdot \mathbb{P}(C\bigm|A\cap B) P ( A ∩ B ∩ C ) = P ( A ) ⋅ P ( B A ) ⋅ P ( C A ∩ B )
Ejercicio: Generalizarlo a n n n eventos
En simultáneo: ya no hay pares sino subconjuntos.
( 5 2 ) ( 9 2 ) \frac{
\begin{pmatrix}
5 \\
2
\end{pmatrix}}{
\begin{pmatrix}
9 \\
2
\end{pmatrix}
} ( 9 2 ) ( 5 2 )
Tengo 3 monedas, elijo una al azar(de forma uniforme)
Una tiene 2 caras, el resto son comunes.
Tiro la moneda y observo. La pregunta es ¿Cuál es la probabilidad que salga cara?
Después,
O b s : Obs: O b s : Dados A A A y B B B eventos
A = ( A ∩ B ) ⋃ d ( A ∩ B c ) A=(A\cap B)\bigcup ^{d} (A\cap B^{c} ) A = ( A ∩ B ) ⋃ d ( A ∩ B c )
P ( A ) = P ( A ∩ B ) + P ( A ∩ B c ) si 0 < P ( B ) < 1 \mathbb{P}(A)=\mathbb{P}(A\cap B)+\mathbb{P}(A\cap B^{c} )\text{ si } 0<\mathbb{P}(B)<1 P ( A ) = P ( A ∩ B ) + P ( A ∩ B c ) si 0 < P ( B ) < 1
P ( A ) = P ( A ∣ B ) ⋅ P ( B ) + P ( A ∣ B c ) ⋅ P ( B c ) \mathbb{P}(A)=\mathbb{P}(A\bigm| B)\cdot \mathbb{P}(B)+\mathbb{P}(A\bigm| B^{c} )\cdot \mathbb{P}(B^{c} ) P ( A ) = P ( A B ) ⋅ P ( B ) + P ( A B c ) ⋅ P ( B c )
Volvamos a los eventos:
C = C= C = "Sale cara"
A = A= A = "Elijo la moneda de dos caras"
P ( C ) = P ( C ∣ A ) ⋅ P ( A ) + P ( C ∣ A c ) ⋅ P ( A c ) = 1 ⋅ 1 3 + 1 2 ⋅ 2 3 = 2 3 \mathbb{P}(C)=\mathbb{P}(C\bigm| A)\cdot \mathbb{P}(A)+\mathbb{P}(C\bigm| A^{c} )\cdot \mathbb{P}(A^{c} )=1\cdot \frac{1}{3}+ \frac{1}{2}\cdot \frac{2}{3} = \frac{2}{3} P ( C ) = P ( C A ) ⋅ P ( A ) + P ( C A c ) ⋅ P ( A c ) = 1 ⋅ 3 1 + 2 1 ⋅ 3 2 = 3 2
En general, si { E i } i ∈ N \{ E_{i} \}_{i \in \mathbb{N}} { E i } i ∈ N es una partición de Ω \Omega Ω .
⋃ E i ∈ Ω y E i ∩ E j = ∅ \bigcup E_{i} \in \Omega \quad y\quad E_{i}\cap E_{j}=\emptyset ⋃ E i ∈ Ω y E i ∩ E j = ∅
P ( A ) = ∑ P ( A ∣ E i ) ⋅ P ( E i ) \mathbb{P}(A)=\sum \mathbb{P}(A\bigm| E_{i})\cdot \mathbb{P}(E_{i}) P ( A ) = ∑ P ( A E i ) ⋅ P ( E i )
Mismos eventos que antes (3 monedas, etc.)
P ( A ∣ C ) = P ( A ∩ C ) P ( C ) = P ( C ∣ A ) ⋅ P ( C ) P ( C ) = 1 ⋅ 1 3 2 3 = 1 2 \displaystyle\mathbb{P}(A\bigm|C)=\frac{\mathbb{P}(A\cap C)}{\mathbb{P}(C)}=\frac{\mathbb{P}(C\bigm|A)\cdot \mathbb{P}(C)}{\mathbb{P}(C)}= \frac{1\cdot \frac{1}{3}}{\frac{2}{3}}= \frac{1}{2} P ( A C ) = P ( C ) P ( A ∩ C ) = P ( C ) P ( C A ) ⋅ P ( C ) = 3 2 1 ⋅ 3 1 = 2 1
Fórmula de Bayes
Si A A A y B B B son eventos. P ( A ) , P ( B ) > 0. \mathbb{P}(A),\mathbb{P}(B)> 0. P ( A ) , P ( B ) > 0. Entonces:
P ( A ∣ B ) = P ( B ∣ A ) ⋅ P ( A ) P ( B ) \mathbb{P}(A\bigm| B)= \frac{\mathbb{P}(B\bigm| A)\cdot \mathbb{P}(A)}{\mathbb{P}(B)} P ( A B ) = P ( B ) P ( B A ) ⋅ P ( A )
Ejemplo:
Una enfermedad afecta al 1 por mil de la población y un test para detectar la enfermedad tiene:
Sensibilidad del 95%: La probabilidad de que dé positivo estando enfermo es 0.95.
Especificidad del 99%: Probabilidad de que dé negativo sino estoy enfermo.
P = P= P = "Es test da positivo"
E = E= E = "Tengo la enfermedad"
P ( E ) = 0 , 001 \mathbb{P}(E)=0,001 P ( E ) = 0 , 001
P ( P ∣ E ) = 0 , 95 \mathbb{P}(P\bigm|E)=0,95 P ( P E ) = 0 , 95
P ( P c ∣ E c ) = 0 , 99 \mathbb{P}(P^{c}\bigm|E^{c})=0,99 P ( P c E c ) = 0 , 99
P ( E ∣ P ) = P ( P ∣ E ) ⋅ P ( E ) P ( P ) = P ( P ∣ E ) ⋅ P ( E ) P ( P ∣ E ) ⋅ P ( E ) + P ( P ∣ E c ) ⋅ P ( E c ) = \mathbb{P}(E\bigm|P)=\frac{\mathbb{P}(P\bigm| E)\cdot \mathbb{P}(E)}{\mathbb{P}(P)}=\frac{\mathbb{P}(P\bigm| E)\cdot \mathbb{P}(E)}{\mathbb{P}(P\bigm| E)\cdot \mathbb{P}(E)+\mathbb{P}(P\bigm| E^{c} )\cdot \mathbb{P}(E^{c} )}= P ( E P ) = P ( P ) P ( P E ) ⋅ P ( E ) = P ( P E ) ⋅ P ( E ) + P ( P E c ) ⋅ P ( E c ) P ( P E ) ⋅ P ( E ) =
= 0.95 ⋅ 0.001 0.95 ⋅ 0.001 + 0.01 ⋅ 0.999 = 0.087 =\frac{0.95\cdot{0}.001}{0.95\cdot{0}.001+0.01\cdot{0}.999}=0.087 = 0.95 ⋅ 0 .001 + 0.01 ⋅ 0 .999 0.95 ⋅ 0 .001 = 0.087
Da eso porque la enfermedad es muy rara. Y la cantidad de personas sanas es mucho. Es decir, en mil personas solo 1 está enfermo. Además hay 10 falsos positivos.
Ver el problema de bibliotecarios y granjeros.
Independencia de eventos
A A A y B B B son independientes si
P ( A ∩ B ) = P ( A ) ⋅ P ( B ) \mathbb{P}(A\cap B)=\mathbb{P}(A)\cdot \mathbb{P}(B) P ( A ∩ B ) = P ( A ) ⋅ P ( B )
Si P ( B ) > 0 \mathbb{P}(B)>0 P ( B ) > 0
P ( A ∣ B ) = P ( A ∩ B ) P ( B ) = P ( A ) \mathbb{P}(A\bigm| B)=\frac{\mathbb{P}(A\cap B)}{\mathbb{P}(B)}=\mathbb{P}(A) P ( A B ) = P ( B ) P ( A ∩ B ) = P ( A )
Ejemplo:
A = A= A = "La suma es 4"
B = B= B = "El segundo es par"
C = C= C = "La suma es 3"
A A A y B B B son independientes?
P ( A ) = 3 36 \mathbb{P}(A)= \frac{3}{36} P ( A ) = 36 3 , P ( B ) = 1 2 \mathbb{P}(B)= \frac{1}{2} P ( B ) = 2 1 , P ( A ∩ B ) = 1 36 ≠ 3 36 ⋅ 1 2 \mathbb{P}(A \cap B)= \frac{1}{36} \neq \frac{3}{36} \cdot \frac{1}{2} P ( A ∩ B ) = 36 1 = 36 3 ⋅ 2 1
B B B y C C C ? si.
P ( C ) = 2 36 , P ( C ∩ B ) = 1 36 , P ( C ∩ B ) = 2 36 ⋅ 1 2 \mathbb{P}(C)= \frac{2}{36},\quad\mathbb{P}(C\cap B)= \frac{1}{36},\quad\mathbb{P}(C \cap B)= \frac{2}{36} \cdot \frac{1}{2} P ( C ) = 36 2 , P ( C ∩ B ) = 36 1 , P ( C ∩ B ) = 36 2 ⋅ 2 1
O b s : Obs: O b s :
Si A ∩ B = ∅ A\cap B=\emptyset A ∩ B = ∅ . Son independientes si y solo si P ( A ) = 0 = P ( B ) \mathbb{P}(A)=0=\mathbb{P}(B) P ( A ) = 0 = P ( B )
Si A A A y B B B son independientes, entonces A A A y B c B^{c} B c también.
P ( A ∩ B c ) = P ( A ) − P ( A ∩ B ) = P ( A ) − P ( A ) ⋅ P ( B ) = P ( A ) ⋅ ( 1 − P ( B ) ) = P ( A ) ⋅ P ( B c ) \mathbb{P}(A\cap B^{c} )=\mathbb{P}(A)-\mathbb{P}(A\cap B)=\mathbb{P}(A)-\mathbb{P}(A)\cdot \mathbb{P}(B)=\mathbb{P}(A)\cdot(1-\mathbb{P}(B))=\mathbb{P}(A)\cdot \mathbb{P}(B^{c} ) P ( A ∩ B c ) = P ( A ) − P ( A ∩ B ) = P ( A ) − P ( A ) ⋅ P ( B ) = P ( A ) ⋅ ( 1 − P ( B )) = P ( A ) ⋅ P ( B c )
Ejercicio 2:
Monedas como antes. Elijo una, la tiro 2 veces.
C i = C_{i}= C i = "El tiro i-ésimo es cara"
C 1 C_{1} C 1 y C 2 C_{2} C 2 son independientes?
A = A= A = "Elijo la moneda de dos caras"
P ( C 1 ∩ C 2 ) = P ( C 1 ∩ C 1 ∣ A ) ⋅ P ( A ) + P ( C 1 ∩ C 2 ∣ A c ) ⋅ P ( A c ) = 1 ⋅ 1 3 + 1 4 ⋅ 2 3 = 1 2 \mathbb{P}(C_{1}\cap C_{2})=\mathbb{P}(C_{1}\cap C_{1}\bigm| A)\cdot \mathbb{P}(A)+ \mathbb{P}(C_{1}\cap C_{2}\bigm| A^{c} )\cdot \mathbb{P}(A^{c} )=1\cdot \frac{1}{3}+ \frac{1}{4} \cdot \frac{2}{3} = \frac{1}{2} P ( C 1 ∩ C 2 ) = P ( C 1 ∩ C 1 A ) ⋅ P ( A ) + P ( C 1 ∩ C 2 A c ) ⋅ P ( A c ) = 1 ⋅ 3 1 + 4 1 ⋅ 3 2 = 2 1
P ( C 1 ) = 2 3 P ( C 2 ) = 2 3 ⟹ \mathbb{P}(C_{1})= \frac{2}{3}\quad\mathbb{P}(C_{2})= \frac{2}{3}\implies P ( C 1 ) = 3 2 P ( C 2 ) = 3 2 ⟹ NO
Independencia de 3 (o más) eventos
A , B A,B A , B y C C C son independientes.
Si P ( A ∩ B ) = P ( A ) ⋅ P ( B ) \mathbb{P}(A\cap B)=\mathbb{P}(A)\cdot \mathbb{P}(B) P ( A ∩ B ) = P ( A ) ⋅ P ( B )
P ( A ∩ C ) = P ( A ) ⋅ P ( C ) P ( C ∩ B ) = P ( C ) ⋅ P ( B ) P ( A ∩ B ∩ C ) = P ( A ) ⋅ P ( B ) ⋅ P ( C ) \begin{array}{c}
\mathbb{P}(A\cap C)=\mathbb{P}(A)\cdot \mathbb{P}(C) \\
\mathbb{P}(C\cap B)=\mathbb{P}(C)\cdot \mathbb{P}(B) \\
\mathbb{P}(A\cap B\cap C)=\mathbb{P}(A)\cdot \mathbb{P}(B)\cdot \mathbb{P}(C)
\end{array} P ( A ∩ C ) = P ( A ) ⋅ P ( C ) P ( C ∩ B ) = P ( C ) ⋅ P ( B ) P ( A ∩ B ∩ C ) = P ( A ) ⋅ P ( B ) ⋅ P ( C )
Para m m m eventos
A 1 , A 2 , … , A m A_{1},A_{2},\dots,A_{m} A 1 , A 2 , … , A m son independientes. Si para toda elección de cualquiera cantidad de ellos la probabilidad se factoriza:
P ( A 1 ∩ A 2 ∩ ⋯ ∩ A m ) = P ( A 1 ) ⋅ P ( A 2 ) … P ( A m ) \mathbb{P}(A_{1}\cap A_{2}\cap\dots \cap A_{m})=\mathbb{P}(A_{1})\cdot \mathbb{P}(A_{2}) \dots \mathbb{P}(A_{m}) P ( A 1 ∩ A 2 ∩ ⋯ ∩ A m ) = P ( A 1 ) ⋅ P ( A 2 ) … P ( A m )