Mathematical Claims: Sets, Quantifiers, Implications, and Counterexamples

Hello. In the previous lesson, you solved two-equation linear systems by substitution and elimination. Although this lesson looks different, it develops the language needed to state exactly what a solution means: an ordered pair belongs to a particular solution set precisely when it satisfies specified conditions.

We now finish this module by learning the basic language of mathematical claims: sets, operations on sets, quantifiers such as “for every” and “there exists,” implications, and counterexamples. These ideas will recur throughout the course—in functions and proofs, in probability events, and in the precise definitions used in calculus and machine learning.

---

1. Sets: collections with precise membership

A set is a collection of objects for which membership is unambiguous. Sets are usually named with capital letters; their members are called elements.

For example, let

$$U=\{1,2,3,4,5,6,7,8,9,10\}$$

be the universal set for the current discussion. Define

$$A=\{2,4,6,8,10\}$$

as the even elements of $U$, and

$$B=\{2,3,5,7\}$$

as the prime elements of $U$.

The notation

$$4\in A$$

means “$4$ is an element of $A$,” while

$$3\notin A$$

means “$3$ is not an element of $A$.”

A common distinction matters:

$$2\in A$$

is a statement about an element, whereas

$$\{2\}\subseteq A$$

is a statement about a set. The first says that $2$ belongs to $A$; the second says that every element of the one-element set $\{2\}$ belongs to $A$.

A set may be written by listing elements, as above, or by describing the condition that determines membership. This is set-builder notation:

$$A=\{x\in U\mid x\text{ is even}\}.$$

Read the vertical bar as “such that.” Thus this says: “$A$ is the set of all $x$ in $U$ such that $x$ is even.”

The domain or universal set is not optional background detail. For instance,

$$\{x\in \mathbb{N}\mid x<5\}$$

and

$$\{x\in \mathbb{R}\mid x<5\}$$

are radically different sets: the first is finite, while the second contains infinitely many real numbers. Throughout this lesson:

• $\mathbb{N}$ denotes the natural numbers;
• $\mathbb{Z}$ denotes the integers;
• $\mathbb{R}$ denotes the real numbers.

---

2. Set operations are logical conditions

Set operations describe how membership conditions combine. With the sets $A$ and $B$ above:

Union: “in $A$ or $B$”

The union $A\cup B$ contains elements belonging to at least one of the two sets:

$$A\cup B=\{x\in U\mid x\in A\text{ or }x\in B\}.$$

For our example,

$$A\cup B=\{2,3,4,5,6,7,8,10\}.$$

The word “or” is inclusive: an element in both sets is certainly in their union. Thus $2\in A\cup B$.

Intersection: “in $A$ and $B$”

The intersection $A\cap B$ contains the elements common to both sets:

$$A\cap B=\{x\in U\mid x\in A\text{ and }x\in B\}.$$

Here,

$$A\cap B=\{2\}.$$

The number $2$ is the only element of $U$ that is both even and prime.

Difference: “in one set but not the other”

The difference

$$A\setminus B$$

contains elements of $A$ that are not in $B$:

$$A\setminus B=\{x\in U\mid x\in A\text{ and }x\notin B\}.$$

Therefore,

$$A\setminus B=\{4,6,8,10\}.$$

Notice that order matters:

$$B\setminus A=\{3,5,7\},$$

so in general,

$$A\setminus B\ne B\setminus A.$$

Complement: “not in the set”

The complement of $A$, written $A^c$ or sometimes $A^{\prime }$, contains every element of the universal set that is not in $A$:

$$A^c=U\setminus A.$$

For this particular $U$,

$$A^c=\{1,3,5,7,9\}.$$

A complement is meaningless until its universal set is known. For example, the complement of the even integers in $\mathbb{Z}$ is the odd integers, but the complement of the even positive integers in $\mathbb{N}$ is the odd positive integers. The surrounding universe changes the answer.

The diagram makes one central translation visible:

$$x\in A\cup B⟺(x\in A)\vee (x\in B),$$

and

$$x\in A\cap B⟺(x\in A)\wedge (x\in B).$$

Here $\vee$ means “or,” $\wedge$ means “and,” and $⟺$ means “if and only if,” or “the two statements have exactly the same truth value.”

This also explains De Morgan’s law:

$$(A\cup B{)}^c=A^c\cap B^c.$$

To be outside $A\cup B$, an element must be in neither $A$ nor $B$. Equivalently, it must be outside $A$ and outside $B$.

There is a paired law:

$$(A\cap B{)}^c=A^c\cup B^c.$$

To fail to be in both $A$ and $B$, an element need only fail membership in at least one of them.

---

3. Subsets and equality as universal claims

The claim

$$A\subseteq B$$

means every element of $A$ also belongs to $B$. It can be expressed precisely as:

$$(\forall x\in U)[x\in A⟹x\in B].$$

The symbol $\forall$ means “for every” or “for all.” Thus a subset claim is already a logical statement involving a universal quantifier and an implication.

For example, if

$$C=\{2\},$$

then

$$C\subseteq A,$$

because every element of $C$—there is only one, namely $2$—is in $A$.

Two sets are equal exactly when they have the same members. In logical notation,

$$A=B⟺(\forall x\in U)[x\in A⟺x\in B].$$

A standard proof of equality therefore has two parts:

1. Show that $A\subseteq B$.
2. Show that $B\subseteq A$.

This principle will later become useful when comparing solution sets of equations, domains of functions, and probability events.

---

4. From open expressions to mathematical statements

Consider the expression

$$x^2>0.$$

By itself, this is not yet a true or false mathematical statement: it depends on the value of $x$. It is called an open sentence or predicate.

For instance:

$$(-2{)}^2>0$$

is true, but

$$0^2>0$$

is false.

A predicate becomes a statement once we specify a particular input or quantify the variable.

The two essential quantifiers are:

Symbol	Meaning	What makes the claim true?
$\forall$	“for every”	Every permitted value satisfies the condition.
$\exists$	“there exists”	At least one permitted value satisfies the condition.

For example,

$$(\forall x\in \mathbb{R})x^2\ge 0$$

states that every real number has a nonnegative square. This statement is true.

In contrast,

$$(\exists x\in \mathbb{Z})3x-2=0$$

is false. Solving gives

$$x=\frac{2}{3},$$

which is real and rational, but not an integer. No integer witness exists.

A quantified statement must always state its domain. Compare:

$$(\exists x\in \mathbb{R})x^2=2$$

with

$$(\exists x\in \mathbb{Q})x^2=2.$$

The first is true, since $x=\sqrt{2}$ is real. The second is false, because $\sqrt{2}$ is not rational. The equation did not change; the allowed set of values did.

---

5. Implications: the structure of “if … then …”

An implication has the form

$$P⟹Q,$$

read as “if $P$, then $Q$.” The condition $P$ is the hypothesis; $Q$ is the conclusion.

For example,

$$(\forall x\in \mathbb{Z})[x>3⟹x\ge 4]$$

is true. Once an integer is greater than $3$, it must be at least $4$.

An implication is false only in one situation:

• the hypothesis is true, and
• the conclusion is false.

This is precisely why a counterexample to a conditional must satisfy the hypothesis.

Consider the false statement

$$(\forall x\in \mathbb{R})[x>0⟹x^2>x].$$

Choose

$$x=\frac{1}{2}.$$

Then the hypothesis holds:

$$\frac{1}{2}>0,$$

but the conclusion fails:

$${\left(\frac{1}{2}\right)}^2=\frac{1}{4}<\frac{1}{2}.$$

Therefore $x=\frac{1}{2}$ is a valid counterexample.

By contrast, choosing a negative number would not refute this claim. For $x=-1$, the hypothesis $x>0$ is already false. A value outside the hypothesis does not test whether the implication keeps its promise.

Also, do not automatically reverse an implication. From

$$P⟹Q$$

you cannot conclude

$$Q⟹P.$$

The reversed statement is called the converse, and it requires separate justification.

---

6. Counterexamples and negating claims correctly

A counterexample is one permitted value that makes a universally quantified statement false.

For the false statement

$$(\forall x\in \mathbb{R})x^2\ge x,$$

take

$$x=\frac{1}{2}.$$

Then

$${\left(\frac{1}{2}\right)}^2=\frac{1}{4}<\frac{1}{2}.$$

One example is enough: a universal claim promises that every allowed value works, so one failure disproves it.

The formal pattern is:

$$\neg [(\forall x\in U)P(x)]⟺(\exists x\in U)\neg P(x).$$

Read it as:

“It is not true that every $x$ satisfies $P$” means “there exists an $x$ that does not satisfy $P$.”

For a universally quantified implication, the pattern becomes especially useful:

$$\neg [(\forall x\in U)(P(x)⟹Q(x))]⟺(\exists x\in U)[P(x)\wedge \neg Q(x)].$$

That right-hand side is the exact recipe for a counterexample: find one allowed object for which the hypothesis is true and the conclusion false.

The opposite quantifier rule is:

$$\neg [(\exists x\in U)P(x)]⟺(\forall x\in U)\neg P(x).$$

Thus, an existential claim is disproved differently. You cannot refute “there exists” merely by trying a few values that fail; you must show that every allowed value fails.

For example,

$$(\exists x\in \mathbb{Z})x^2=2$$

is false, but checking $x=0$, $x=1$, and $x=2$ would not be a proof. The needed conclusion is:

$$(\forall x\in \mathbb{Z})x^2\ne 2.$$

A useful hand-check routine for any elementary claim is:

1. Name the domain. Are the variables integers, rationals, reals, or elements of a specified set?
2. Identify the quantifier. Does the statement claim “every” or “at least one”?
3. For an implication, separate hypothesis and conclusion.
4. For a universal statement, look for one allowed failure.
5. For an existential statement, seek a valid witness; to refute it, show no witness can exist.

---

7. Quantifier order changes the meaning

With more than one quantifier, order matters.

Consider:

$$(\forall x\in \mathbb{Z})(\exists y\in \mathbb{Z})x+y=0.$$

This is true. For each integer $x$, choose

$$y=-x.$$

The choice of $y$ is allowed to depend on $x$.

Now reverse the order:

$$(\exists y\in \mathbb{Z})(\forall x\in \mathbb{Z})x+y=0.$$

This is false. It claims that there is one fixed integer $y$ that makes $x+y=0$ for every integer $x$. No single value can cancel every possible $x$.

A second example shows how a nested claim can be refuted:

$$(\forall n\in \mathbb{R})(\exists m\in \mathbb{R})m^2=n.$$

This says every real number has a real square root. It is false: choose

$$n=-1.$$

There is no real $m$ for which

$$m^2=-1.$$

The outer universal claim fails at $n=-1$. The inner existential claim fails because no real witness $m$ exists.

This distinction will become essential when you reach limits in calculus, where statements often have several quantifiers and where the permitted dependence of one variable on another matters.

---

Conclusion

Mathematical language makes claims testable and precise.

• A set is defined by clear membership, often using set-builder notation.
• Union corresponds to logical “or”; intersection corresponds to logical “and”; complements express “not.”
• A subset claim is a universal implication:

$$A\subseteq B⟺(\forall x)[x\in A⟹x\in B].$$

• The universal quantifier $\forall$ makes a claim about every allowed value; the existential quantifier $\exists$ requires at least one witness.
• A conditional fails only when its hypothesis is true and its conclusion is false.
• A counterexample refutes a universal statement by exhibiting one valid failure.
• Negating a universal produces an existential, and negating an existential produces a universal.
• Quantifier order is meaningful: a choice allowed to depend on one variable is not the same as one fixed choice for all variables.

The next module begins with functions: rules that assign one output to each permitted input. The precision developed here—especially domains, set-builder notation, and implication—will make function definitions and their graphs much easier to interpret.