Universal Sets

Why Specify a Universal Set?

In Set Builder Notation, a set is described by giving a domain and a condition that selects elements from that domain. For example, $\{x\in\mathbb Z:x>0\}$ selects positive integers, while $\{x\in\mathbb R:x>0\}$ selects positive real numbers. The condition $x>0$ is the same, but the allowed candidates differ. A set is therefore understood relative to the domain that supplies its candidates.

When several sets are being discussed together, it is useful to choose one set that contains all the objects relevant to that discussion. This set is called a universal set, often denoted by $U$. The word “universal” is always relative to a stated context: $U$ is intended to contain every object under consideration in that context. It does not mean that $U$ contains every mathematical object without restriction.

For example, if the question concerns the students in one class, the class roster could be a universal set for sets of students in that class. If we are classifying integers from $-5$ through $5$, we could use $U=\{-5,-4,\ldots,4,5\}$. The choice depends on what the discussion needs to include. A different problem may require a different universal set.

Context determines the universe. A universal set $U$ is a chosen set containing all objects under discussion. It is not necessarily the largest set imaginable, and it need not be unique.

Universal Sets and Subset Inclusion

Suppose a collection $\mathcal F$ of sets is under discussion. We call $U$ a universal set for $\mathcal F$ if every set in the collection is a subset of $U$: $$ \forall A\in\mathcal F,\quad A\subseteq U. $$ Here $\mathcal F$ is a collection whose members are sets. The condition $A\subseteq U$ means that every element of $A$ also belongs to $U$, by the definition of subset inclusion from Subset and Proper Subset. Thus, every element appearing in any set in $\mathcal F$ is included in the chosen universe.

In many applications, the universal set is also the domain in a set-builder expression. If $P(x)$ is a condition defined on $U$, the expression $\{x\in U:P(x)\}$ selects only objects from $U$ that satisfy $P$. No object outside $U$ can enter the set, even if it would satisfy the condition. This is one reason the domain must be read as part of the definition, rather than as incidental notation.

Worked Example: Choosing a Universe for a Finite Collection

Let $$ U=\{\text{red},\text{blue},\text{green},\text{gold}\} $$ and consider $$ A=\{\text{red},\text{blue}\},\qquad B=\{\text{blue},\text{green}\},\qquad C=\varnothing. $$ Each element of $A$ belongs to $U$, so $A\subseteq U$. Each element of $B$ also belongs to $U$, so $B\subseteq U$. The empty set is a subset of every set, by the result established in Subset and Proper Subset; hence $C\subseteq U$. Therefore $U$ is a universal set for the collection $\mathcal F=\{A,B,C\}$.

The choice is not forced. The larger set $$ V=\{\text{red},\text{blue},\text{green},\text{gold},\text{silver}\} $$ also contains every element of $A$, $B$, and $C$, so it is another universal set for $\mathcal F$. The extra element “silver” is not needed for this collection, but its presence does not prevent $V$ from being a universal set.

A Basic Containment Result

A set defined by a condition on $U$ is automatically contained in $U$. This follows directly from the membership characterization for condition-defined sets in Set Membership. The result records explicitly what the domain restriction already ensures.

Proposition (A Condition-Defined Set Lies in Its Domain). Let $U$ be a set, let $P(x)$ be a condition defined on $U$, and define $$ S=\{x\in U:P(x)\}. $$ Then $S\subseteq U$.

Proof. Let $y$ be an arbitrary element of $S$. By the membership characterization of a condition-defined set, $y\in U$ and $P(y)$. In particular, $y\in U$. Since every element $y$ of $S$ belongs to $U$, the definition of subset inclusion gives $S\subseteq U$.

The proposition concerns the set produced by a set-builder expression whose domain is $U$. It does not say that every set one might mention is automatically a subset of $U$. If a new object outside $U$ enters the discussion, then either the chosen universe must be enlarged or the discussion must make clear that the object is outside the current universe.

Worked Example: Filtering a Finite Universal Set

Take $$ U=\{-3,-1,0,2,5\} $$ and define $$ S=\{x\in U:x^2\leq4\}. $$ We test each element of $U$. We have $(-3)^2=9>4$, so $-3\notin S$. We have $(-1)^2=1\leq4$, $0^2=0\leq4$, and $2^2=4\leq4$, so $-1,0,2\in S$. Finally, $5^2=25>4$, so $5\notin S$. Therefore $$ S=\{-1,0,2\}. $$ Every element of $S$ is an element of $U$, which verifies $S\subseteq U$.

The condition $x^2\leq4$ alone does not define this particular finite set. The domain $U$ is part of the specification: it says which candidates to test. The set of all real numbers satisfying $x^2\leq4$ would be a different set.

The Same Condition Can Give Different Sets

A condition does not always determine a set by itself. The domain must also be specified. To see this, use the condition $x^2\leq1$ first on the domain $U=\{-2,0,1,4\}$, and then on the domain $V=\{-2,-1,0,1,4\}$. In the first domain, the elements meeting the condition are $0$ and $1$, so the resulting set is $\{0,1\}$. In the second domain, $-1$ also qualifies, so the resulting set is $\{-1,0,1\}$.

The two sets differ because $-1$ is an allowed candidate in $V$ but not in $U$. This illustrates a general point: to evaluate $\{x\in U:P(x)\}$, check the elements of $U$, not every object that could satisfy $P$ in a larger domain.

Worked Example: Changing the Universal Set Changes the Result

Let $$ U=\{-2,0,1,4\},\qquad V=\{-2,-1,0,1,4\}, $$ and consider the condition $P(x):x^2\leq1$. For $U$, the values are $$ (-2)^2=4,\quad 0^2=0,\quad 1^2=1,\quad 4^2=16. $$ Thus $0$ and $1$, and only those elements of $U$, satisfy $P$: $$ \{x\in U:x^2\leq1\}=\{0,1\}. $$

For $V$, the additional candidate $-1$ satisfies $(-1)^2=1\leq1$. The other candidates have already been checked, and $-2$ and $4$ do not satisfy the condition. Therefore $$ \{x\in V:x^2\leq1\}=\{-1,0,1\}. $$ Both are correct evaluations of the same condition, because the domains are different.

Read the whole set-builder expression. In $\{x\in U:P(x)\}$, the condition $P(x)$ and the domain $U$ work together. Changing either one can change the resulting set.

When Is a Universal Set Unique?

For an arbitrary collection $\mathcal F$, universal sets need not be unique. If $U$ contains every member of $\mathcal F$, then a larger set $V$ may contain them as well. Even two different sets with no inclusion relation between them can both be universal for the same collection, provided both contain all the elements that appear in its members.

There is a useful special case in which uniqueness does follow. Suppose the collection $\mathcal F$ itself includes a set $U$ that contains every member of $\mathcal F$. Then any other member $V$ of $\mathcal F$ that also contains every member must equal $U$. The reason is that each of these two sets must contain the other.

Theorem (Uniqueness of a Universal Member). Let $\mathcal F$ be a collection of sets. Suppose $U\in\mathcal F$ and $A\subseteq U$ for every $A\in\mathcal F$. If $V\in\mathcal F$ also satisfies $A\subseteq V$ for every $A\in\mathcal F$, then $V=U$.

Proof. Since $V\in\mathcal F$, the assumption that every member of $\mathcal F$ is a subset of $U$ gives $V\subseteq U$. Since $U\in\mathcal F$, the assumption that every member of $\mathcal F$ is a subset of $V$ gives $U\subseteq V$. By the Equality by Double Inclusion theorem from Set Equality, $U=V$.

The hypotheses matter. Two sets that both contain every member of a collection are not necessarily equal if neither is required to be a member of that collection. The theorem establishes uniqueness only when both sets are members of the collection and each contains all its members.

Worked Example: A Unique Universal Member

Consider the collection $$ \mathcal F=\bigl\{\{a\},\{b\},\{a,b\}\bigr\}. $$ The set $U=\{a,b\}$ is a member of $\mathcal F$, and each member of $\mathcal F$ is a subset of $U$. Now suppose $V\in\mathcal F$ also contains every member of $\mathcal F$. In particular, $\{a,b\}\subseteq V$, because $\{a,b\}$ itself belongs to $\mathcal F$. Also, $V\subseteq\{a,b\}$, because $V$ is a member of $\mathcal F$ and $U$ contains every member. The Equality by Double Inclusion theorem gives $V=\{a,b\}$. Thus $\{a,b\}$ is the unique universal member of this collection.

The set $\{a,b,c\}$ would still contain every member of $\mathcal F$, so it is a universal set for $\mathcal F$ in the broader sense. It is not a member of $\mathcal F$, however, and so it does not contradict the theorem.

Choosing and Using a Universe Carefully

In a proof, stating the universe makes the available objects explicit. If $U$ is the domain, then an arbitrary candidate $x\in U$ may be used when proving a statement about all elements of $U$. If a condition-defined set is being studied, membership requires both $x\in U$ and the defining condition. Keeping those requirements separate helps prevent accidental use of candidates that are not in the domain.

A universal set is also a modeling choice. It should be large enough to include every relevant object, but there is no requirement that it include irrelevant objects. For instance, a study of the integers from $1$ to $20$ might take that finite collection as its universe. Taking $\mathbb Z$ instead is also possible, but then conditions over the universe are interpreted among all integers, not merely those from $1$ to $20$. The mathematical statements must match the chosen domain.

Notation or claim	Meaning
$U$ is a universal set for $\mathcal F$	Every set $A\in\mathcal F$ satisfies $A\subseteq U$.
$\{x\in U:P(x)\}$	Elements of $U$ that satisfy $P$, and no candidates outside $U$.
$S\subseteq U$	Every element of $S$ belongs to $U$.
A larger set containing all members of $\mathcal F$	May also be a universal set; universal sets are not generally unique.
A universal member of $\mathcal F$	If it contains all members of $\mathcal F$, it is unique by double inclusion.

Practical check. Before evaluating or proving something about a set, identify the universe: which objects are eligible to be considered? Then use the membership characterization and subset definitions with that domain kept explicit.

In each question, pay attention to both the collection of sets and the domain from which the elements are selected.

Check Your Understanding

Let $U=\{1,2,3,4\}$ and $S=\{x\in U:x\text{ is even}\}$. List $S$ and state why $S\subseteq U$.
Give a universal set for the collection $\mathcal F=\{\{p,q\},\{q,r\}\}$. Give a different universal set for the same collection.
Evaluate $\{x\in\{-3,0,2\}:x^2\leq4\}$. Show how each element of the domain is handled.
Explain why $\{x\in\{0,1\}:x\geq0\}$ and $\{x\in\{-1,0,1\}:x\geq0\}$ are equal even though their domains differ.
In the Uniqueness of a Universal Member theorem, which two subset inclusions give $U=V$?
If $U$ is universal for a collection $\mathcal F$, must it be the only set that is universal for $\mathcal F$? Explain why or why not.

Notation or claim	Meaning
\(U\) is a universal set for \(\mathcal F\)	Every set \(A\in\mathcal F\) satisfies \(A\subseteq U\).
\(\{x\in U:P(x)\}\)	Elements of \(U\) that satisfy \(P\), and no candidates outside \(U\).
\(S\subseteq U\)	Every element of \(S\) belongs to \(U\).
A larger set containing all members of \(\mathcal F\)	May also be a universal set; universal sets are not generally unique.
A universal member of \(\mathcal F\)	If it contains all members of \(\mathcal F\), it is unique by double inclusion.

What You'll Learn