##### Differences

This shows you the differences between two versions of the page.

 cs-401r:assignment-1.5 [2014/09/18 17:41]cs401rPML Updated points to reflect how scored. cs-401r:assignment-1.5 [2014/09/24 15:41]cs401rPML [Question 1: Useful theorems in probability theory] added link to example proofs page Both sides previous revision Previous revision 2014/09/25 19:49 ringger [Question 1: Useful theorems in probability theory] 2014/09/24 15:41 cs401rPML [Question 1: Useful theorems in probability theory] added link to example proofs page2014/09/18 17:41 cs401rPML Updated points to reflect how scored.2014/09/17 08:34 ringger [Question 2: Independence] 2014/09/10 11:49 ringger [Question 2: Independence] 2014/09/10 11:46 ringger [Question 1: Useful theorems in probability theory] 2014/09/06 23:27 ringger [Question 1: Useful theorems in probability theory] 2014/09/05 11:14 cs401rpml [Question 2: Independence] 2014/09/05 11:14 cs401rpml [Question 2: Independence] 2014/09/05 11:05 cs401rpml [Question 2: Independence] 2014/09/05 11:05 cs401rpml [Question 2: Independence] 2014/09/05 11:04 cs401rpml [Question 3: Chain rule] 2014/09/05 11:04 cs401rpml [Question 2: Independence] 2014/09/05 11:03 cs401rpml [Question 1: Useful theorems in probability theory] 2014/09/05 11:02 cs401rpml [Instructions] 2014/09/05 11:02 cs401rpml 2014/09/05 08:22 ringger created 2014/09/25 19:49 ringger [Question 1: Useful theorems in probability theory] 2014/09/24 15:41 cs401rPML [Question 1: Useful theorems in probability theory] added link to example proofs page2014/09/18 17:41 cs401rPML Updated points to reflect how scored.2014/09/17 08:34 ringger [Question 2: Independence] 2014/09/10 11:49 ringger [Question 2: Independence] 2014/09/10 11:46 ringger [Question 1: Useful theorems in probability theory] 2014/09/06 23:27 ringger [Question 1: Useful theorems in probability theory] 2014/09/05 11:14 cs401rpml [Question 2: Independence] 2014/09/05 11:14 cs401rpml [Question 2: Independence] 2014/09/05 11:05 cs401rpml [Question 2: Independence] 2014/09/05 11:05 cs401rpml [Question 2: Independence] 2014/09/05 11:04 cs401rpml [Question 3: Chain rule] 2014/09/05 11:04 cs401rpml [Question 2: Independence] 2014/09/05 11:03 cs401rpml [Question 1: Useful theorems in probability theory] 2014/09/05 11:02 cs401rpml [Instructions] 2014/09/05 11:02 cs401rpml 2014/09/05 08:22 ringger created Last revision Both sides next revision Line 22: Line 22: (Adapted from: Manning & Schuetze, p. 59, exercise 2.1) (Adapted from: Manning & Schuetze, p. 59, exercise 2.1) - Use the [[Set Theory Identities]] and [[Axioms of Probability Theory]] to prove each of the following statements. ​ Develop your proof first in terms of sets and then translate into probabilities;​ use set theoretic operations on sets and arithmetic operators on probabilities. ​ Be sure to apply [[Proofs|good proof technique]]:​ justify each step in your proofs; set up your proofs in two-column format, with each step showing a statement on the left and a justification on the right. Remember that in order to invoke an axiom as justification,​ you must first satisfy the conditions / pre-requisites of the axiom. ​  ​ + Use the [[Set Theory Identities]] and [[Axioms of Probability Theory]] to prove each of the following statements. ​ Develop your proof first in terms of sets and then translate into probabilities;​ use set theoretic operations on sets and arithmetic operators on probabilities. ​ Be sure to apply [[Proofs|good proof technique]]:​ justify each step in your proofs; set up your proofs in two-column format, with each step showing a statement on the left and a justification on the right. Remember that in order to invoke an axiom as justification,​ you must first satisfy the conditions / pre-requisites of the axiom. ​See the proofs on the [[example_proofs|example proofs page]]. # $P(\varnothing) = 0$ # $P(\varnothing) = 0$ # $A \subseteq B \Rightarrow P(A) \leq P(B)$ # $A \subseteq B \Rightarrow P(A) \leq P(B)$
cs-401r/assignment-1.5.txt ยท Last modified: 2014/09/25 19:49 by ringger