PROJECTENGRAM

COMPLEMENT

Tags: #◇Computer Science #◇STT101A #◇Conceptual #◇Complement


◇Overview

In set-theoretic probability, the Complement of an event AA (denoted AcA^c, A′A', or A‾\overline{A}) is the set of all outcomes in the sample space SS that are not in AA. Every outcome in SS belongs to either AA or AcA^c, never both.

◇Key Definitions

  • Set Definition: Ac={ω∈S:ω∉A}=S∖AA^c = \{\omega \in S : \omega \notin A\} = S \setminus A.
  • Partition Property: A∪Ac=SA \cup A^c = S (collectively exhaustive) and A∩Ac=∅A \cap A^c = \emptyset (mutually exclusive).
  • Involution Law: (Ac)c=A(A^c)^c = A.
  • Boundary Complements: Sc=∅S^c = \emptyset and ∅c=S\emptyset^c = S.

◇Worked Example

Problem: Let the sample space of rolling a fair die be S={1,2,3,4,5,6}S = \{1, 2, 3, 4, 5, 6\}, and let A={2,3,5}A = \{2, 3, 5\} be the event of rolling a prime number. Find AcA^c and P(Ac)P(A^c).

Solution:

  • Ac=S∖A={1,4,6}A^c = S \setminus A = \{1, 4, 6\} (note that 11 is not prime).
  • P(Ac)=∣Ac∣∣S∣=36=0.50P(A^c) = \frac{|A^c|}{|S|} = \frac{3}{6} = 0.50.

◇References & Navigation

CONFIRMATION // 理解度の確認

ACTIVE RECALL VERIFICATION

Select an answer to verify conceptual comprehension and reveal the technical rationale.

Q1

For any event AA in sample space SS, what are A∪AcA \cup A^c and A∩AcA \cap A^c, respectively?

Q2

If XX is a discrete random variable counting the number of defective items in a batch of 1010, what is the complement of the event A={X≥2}A = \{X \ge 2\}?

Q3

Which statement is ALWAYS true about an event AA and its complement AcA^c?

Q4

What is the complement of (A∩Bc)(A \cap B^c) according to De Morgan's Laws and double negation?

Q5

Why are two mutually exclusive events AA and BB NOT necessarily complements of each other?