Homework #1

EE 364: Spring 2026

Assignment Details

Assigned: 13 January Due: Tuesday, 20 January at 16:00

BrightSpace Assignment: Homework 1

Instructions

Write your solutions to these homework problems. Submit your work to BrightSpace by the due date. Show all work and box answers where appropriate. Do not guess.


Problem 0

Daily derivation #1, \(P(A) + P(B) = P(A \cup B) + P(A \cap B)\).

Problem 1

Use truth tables to prove whether these propositional assertions are valid or invalid:

  1. \((P \rightarrow \ \sim Q) \Leftrightarrow [(P \vee Q) \wedge \sim (P \vee Q)]\).

  2. \(\sim P \Rightarrow (P \Rightarrow Q)\).

  3. \([P \wedge (Q \rightarrow R)] \Leftrightarrow [(\sim P \vee Q) \rightarrow (P \wedge R)]\).

  4. \([(P \rightarrow Q) \wedge (P \rightarrow \ \sim Q)] \Leftrightarrow \ \sim P\).

Problem 2

Prove or disprove the following statements.

  1. \([A \subset B] \Longrightarrow [A \cap B = A]\).

  2. \([A^c \cup B = \Omega] \Longrightarrow [A \subset B]\).

  3. \([A \subset B] \Longrightarrow [A^c \cup B = \Omega]\).

    From (b) and (c) above can you justify that \([A \subset B]\) and \([A^c \cup B = \Omega]\) are equivalent? Two statements are equivalent if they always have the same truth value (either both true or both false but never different). Explain.

Problem 3

Prove or disprove the following statements. You must prove any set theoretic theorems that you use. That includes set associativity, commutativity, distributivity, De Morgan’s law, etc.

  1. \(A \cap B = \emptyset\) if and only if \(A \cup B = (A \cap B^c) \cup (A^c \cap B)\).

  2. \((A \cap B) - C = (A - C) - (B - C)\).

  3. \((A^c \cup B)^c \cap A^c = \emptyset\).

Problem 4

Suppose \(\Omega = \{w, x, y, z\}\).

  1. How many distinct subsets does \(\Omega\) have? List them.

  2. If \(A = \{w, x\}\) how many supersets does \(A\) have in \(\Omega\)? List them.

  3. If \(A = \{u, w, y\}\) how many supersets does \(A\) have in \(\Omega\)? List them.

Problem 5

The sample space describes the set of all possible outcomes of a random experiment. The cardinality of \(\left| \Omega \right|\) is the number of elements in \(\Omega\). The power set \(2^{\Omega} = \{A: A \subset \Omega\}\) is a collection of all the subsets of \(\Omega\).

  1. How big is the power set (i.e. cardinality, \(\left| 2^\Omega \right|\)) of each of the following sets?

    1. \(\Omega = \{H,T\}\).

    2. The sample space represented by the outcome of a single roll of a six-sided die.

    3. The set of positive integers less than or equal to \(N\), \(\{1, 2, \ldots, N\}\).

  2. Write the power set for each of the following sample spaces:

    1. \(\Omega = \{a\}\).

    2. \(\Omega = \{a, b\}\).

    3. \(\Omega = \{a, b, c\}\).

  3. Prove that if \(A \subset B\) then \(2^A \subset 2^B\).

Problem 6

  1. Mary chooses a letter of the alphabet (a-z) at random. Describe the sample space \(\Omega\) and probability measure \(P\). Compute the probability that a vowel (a, e, i, o, u) is sampled.

  2. A collection of plastic letters (a-z) is mixed in a jar. John draws two letters at random and without replacement (one after the other). Describe the sample space \(\Omega\). What is the probability that John draws a vowel (a, e, i, o, u) and a consonant? What is the probability that John draws two vowels?

Problem 7

Events \(A\) and \(B\) have probabilities \(P(A) = \frac34\) and \(P(B) = \frac13\).

  1. Show that \(\frac{1}{12} \le P(A \cap B) \le \frac{1}{3}\).

  2. Describe sample spaces and events \(A\) and \(B\) having \(P(A) = \frac34\) and \(P(B) = \frac13\) such that:

    1. \(P(A \cap B) = \frac{1}{12}\).

    2. \(P(A \cap B) = \frac{1}{3}\).