Complement Probability
In probability, an event \(A\) is a set of outcomes inside a sample space \(S\).
The complement of an event, written \(A^{c}\) (sometimes \(A'\)), means “not \(A\)”:
all outcomes in \(S\) that are not in \(A\). Because every outcome is either in \(A\) or in \(A^{c}\)
(and never in both), the two events form a complete split of the sample space.
That split leads to the most useful identity in basic probability:
\[
P(A) + P(A^{c}) = 1
\quad\Longrightarrow\quad
P(A^{c}) = 1 - P(A).
\]
This rule works for any probability model where \(P(\cdot)\) is a valid probability measure, including
equally likely finite outcomes (like fair dice), biased models, and continuous distributions.
Why complements are so useful
Complements are often easier than “direct counting.” For example, if \(P(\text{rain})=0.3\),
then \(P(\text{no rain}) = 1-0.3 = 0.7\). In a finite, equally likely sample space, if \(|S|\) is the total
number of outcomes and \(|A|\) is the number of favorable outcomes, then
\[
P(A)=\frac{|A|}{|S|}
\quad\text{and}\quad
P(A^{c})=\frac{|S|-|A|}{|S|}.
\]
So if a standard deck has 52 cards and 4 are aces, \(P(\text{ace})=4/52\) and
\(P(\text{not ace})=(52-4)/52=48/52\).
“At least” and “at most” conversions
Complements are especially powerful for inequality statements. If \(X\) is a discrete count (like the number
of successes), then:
\[
\{X \ge k\}^{c} = \{X \le k-1\},
\qquad
\{X \le k\}^{c} = \{X \ge k+1\}.
\]
That means you can compute “at least \(k\)” by subtracting the easier “at most \(k-1\)” from 1, and vice versa.
A classic special case is “at least one”:
\[
P(X \ge 1) = 1 - P(X=0).
\]
In many problems, \(P(X=0)\) (“none happen”) is simpler to compute than summing many cases for “one or more.”
Common checks
A good sanity check is that both probabilities stay between 0 and 1, and that they add to 1:
\(P(A^{c})\ge 0\), \(P(A)\ge 0\), and \(P(A)+P(A^{c})=1\). If you input a probability outside \([0,1]\),
you know something is inconsistent (a counting mistake, wrong denominator, or a percent/decimal mismatch).
This tool computes the complement numerically and also illustrates the idea visually: the circle represents \(A\),
and everything outside the circle (inside the sample space) represents \(A^{c}\).
