Code
omega <- c("he", "him", "they", "them")
plural <- c("they", "them")
singular <- setdiff(omega, plural)
event_space <- list(
impossible = character(0),
plural = plural,
singular = singular,
certain = omega
)
event_spaceSuppose that our pronoun model assigns a probability to the event that a form is plural. It must also assign a probability to the event that the form is not plural, since the second event is the complement of the first. If the model assigns probabilities to two events, it must also assign a probability to their union. The collection of measurable events must be closed under these operations.
A sigma-algebra, also called an event space, is a collection of events that contains the sample space and is closed under complements and countable unions. The model assigns probabilities only to events in this collection, which we write as \mathcal{F}.
To see why the collection needs structure, use the four outcome sample space
\Omega_4 \equiv\{\textit{he},\textit{him},\textit{they},\textit{them}\}.
Let P be the plural event:
P\equiv\{\textit{they},\textit{them}\}.
Its complement is
P^c=\{\textit{he},\textit{him}\}.
If plural number is the only distinction that the model measures, one possible sigma-algebra is
\mathcal{F}_P \equiv\{\varnothing,P,P^c,\Omega_4\}.
Plural and singular are measurable under \mathcal{F}_P. Accusative case is not, because the accusative event does not belong to \mathcal{F}_P.
A collection \mathcal{F} is a sigma-algebra only if it satisfies three requirements.
The first requirement includes the certain event among the measurable events. The second includes the complement of every measurable event. The third includes the union of any countable collection of measurable events.
Some events follow from the three requirements. Since \Omega\in\mathcal{F}, closure under complements gives
\Omega^c=\varnothing\in\mathcal{F}.
Intersections follow from complements and unions. De Morgan’s law gives
B\cap C=(B^c\cup C^c)^c.
Thus a sigma-algebra that is closed under complements and countable unions is also closed under intersections.
Consider the proposed collection
\mathcal{G}\equiv\{\Omega_4,P\}.
Check the proposed collection against each requirement.
Adding P^c and \varnothing repairs these failures and produces \mathcal{F}_P.
The following R list represents the four events in \mathcal{F}_P.
omega <- c("he", "him", "they", "them")
plural <- c("they", "them")
singular <- setdiff(omega, plural)
event_space <- list(
impossible = character(0),
plural = plural,
singular = singular,
certain = omega
)
event_spaceThe list omits the singleton event \{\textit{them}\}. This set is a subset of \Omega_4, but it is not an event in \mathcal{F}_P. The model represents them as an outcome, but it cannot assign a probability to the event containing them alone.
For a small finite sample space, we will often use the power set 2^\Omega, the collection containing every subset of \Omega. In that case, every possible grouping of the represented outcomes is measurable. The smaller sigma-algebra \mathcal{F}_P shows that this choice is not automatic.
In the example above, the accusative event does not belong to \mathcal{F}_P. We thus cannot write its probability under a probability measure whose domain is \mathcal{F}_P. To assign a probability to accusative case, we must use a sigma-algebra that contains the accusative event.
For the finite examples in this course, taking \mathcal{F}\equiv2^\Omega makes every subset measurable. We still write \mathcal{F} separately because this choice is part of the probability-space specification.