Set Membership and Set-Builder Notation

Elements, Membership, and Conditions

A set can be described by listing its elements or by specifying a condition that its elements satisfy. Set-builder notation gives a concise way to write the second description. To use it reliably, read each expression as a membership test: an object belongs to the set exactly when it comes from the stated domain and satisfies the stated condition.

We use \(\in\) to mean “is an element of” and \(\notin\) to mean “is not an element of.” For example, \(3\in\{1,3,5\}\), while \(2\notin\{1,3,5\}\). The notation \(\mathbb{R}\) denotes the real numbers, \(\mathbb{Z}\) the integers, and \(\mathbb{N}=\{1,2,3,\ldots\}\) the positive integers.

Read the notation from left to right: “the set of all \(x\) in \(D\) such that \(P(x)\).” The symbol \(x\) is a placeholder for an element of \(D\). It is the condition, not the particular letter, that matters. Thus \(\{x\in\mathbb{R}:x>0\}\) and \(\{t\in\mathbb{R}:t>0\}\) describe the same positive real numbers.

The domain is important. The condition \(x>2\) describes different collections when \(x\) is required to be real, integer, or natural. A complete set-builder description includes the domain explicitly, or makes it clear from context.

The Membership Test for Set-Builder Notation

Proof. By the definition of \(\{x\in D:P(x)\}\), its elements are exactly those elements \(x\) that belong to \(D\) and satisfy \(P(x)\). Substituting \(a\) for the variable \(x\), the statement that \(a\) is an element of this set means precisely that \(a\in D\) and \(P(a)\) is true. Conversely, if both \(a\in D\) and \(P(a)\) is true, then \(a\) meets the defining condition for membership in the set, so \(a\in\{x\in D:P(x)\}\). \(\square\)

This theorem turns reading a set-builder expression into a two-part check: first verify that the proposed element is in the domain, then evaluate the condition. If either part fails, the element does not belong to the described set.

Proof. By the definition of the interval notation \((a,b]\), a real number \(x\) belongs to \((a,b]\) precisely when it is strictly greater than \(a\) and less than or equal to \(b\). These are exactly the two inequalities in the set-builder condition. At \(x=a\), the required inequality \(a<a\) is false, so \(a\) is excluded. At \(x=b\), the inequalities become \(a<b\le b\); the first holds by the hypothesis \(a<b\), and the second holds by equality, so \(b\) is included. \(\square\)

Describing Finite Sets

A finite set can be written by listing its elements inside braces, or by giving a condition that selects exactly those elements from a domain. For a roster such as \(\{2,5,8\}\), membership means that the proposed element equals at least one of the listed entries. Repeated entries do not create additional elements: the set records which elements occur, not how many times they are written.

Proof. The roster notation \(\{a_1,\ldots,a_n\}\) specifies the set whose elements are the objects listed. Thus if \(y\) belongs to that set, it must be one of the listed objects, which means \(y=a_i\) for at least one index \(i\) in the list. Conversely, if \(y=a_i\) for one of the listed indices, then \(y\) is one of the listed elements and so belongs to the set. This argument also covers a list with a single entry: membership then means equality with that entry. \(\square\)

The restriction \(x\in\mathbb{Z}\) and the equation \(x^2=9\) play different roles. The first says which objects may be considered; the second selects which of those objects qualify. Writing both parts prevents ambiguity.

Proof. Suppose first that \(\{x\in D:P(x)\}=\varnothing\). If there were an \(x\in D\) for which \(P(x)\) were true, the membership test would give \(x\in\{x\in D:P(x)\}\), contradicting that this set is empty. Conversely, suppose there is no \(x\in D\) for which \(P(x)\) is true. The membership test says that any element of \(\{x\in D:P(x)\}\) would have to be an \(x\in D\) satisfying \(P(x)\). There is no such \(x\), so the set has no elements and is \(\varnothing\). \(\square\)

Translating Words into Conditions

To convert a verbal description into set-builder notation, identify the possible elements first, then state the test they must pass. For instance, “the real numbers greater than or equal to \(4\)” has domain \(\mathbb{R}\) and condition \(x\ge4\), giving \(\{x\in\mathbb{R}:x\ge4\}\). “The integers between \(0\) and \(6\), including both endpoints” has domain \(\mathbb{Z}\) and condition \(0\le x\le6\), giving \(\{x\in\mathbb{Z}:0\le x\le6\}\).

Words about endpoints should be translated literally. “Greater than” means \(>\), so the endpoint is not included; “greater than or equal to” means \(\ge\), so equality is permitted. The same distinction applies to “less than” and “less than or equal to.” For a finite set, a phrase such as “the listed values” can often be written directly as a roster, while a shared rule for the values can be written as a condition.

Common mistake. Consider the statement “the integers greater than \(2\)” and the incorrect translation \(\{x\in\mathbb{R}:x>2\}\). This expression includes \(5/2\), because \(5/2\in\mathbb{R}\) and \(5/2>2\); but \(5/2\) is not an integer. The correction is \(\{x\in\mathbb{Z}:x>2\}\). Its domain excludes \(5/2\), while it includes \(3\), since \(3\in\mathbb{Z}\) and \(3>2\). The error was not in the inequality; it was in choosing the wrong domain.

When checking a set-builder expression, keep the two questions separate: “Is the candidate in the domain?” and “Does it satisfy the condition?” This prevents a true inequality from being mistaken for sufficient evidence of membership, and it also makes endpoint and empty-set cases easier to handle.