# Mathematical Proof/Print version

This is the print version of Mathematical ProofYou won't see this message or any elements not part of the book's content when you print or preview this page. |

The current, editable version of this book is available in Wikibooks, the open-content textbooks collection, at

https://en.wikibooks.org/wiki/Mathematical_Proof

# Cover

# Introduction to Set Theory

Objects known as **sets** are often used in mathematics, and there exists *set theory* which studies them.
Although set theory can be discussed formally ^{[1]}, it is not necessary for us to have such a formal discussion in this book, and we may not be interested in and understand the formal discussion in this stage.

Even if we do not discuss set theory formally, it is important for us to understand some basic concepts about sets, which will be covered in this chapter.

## What is a set?[edit | edit source]

A *set* may be viewed as a collection of well-defined, distinct objects (the objects can also be sets). Because of the vagueness of the term "well-defined", we do not regard this as the definition of set. Instead, we regard set as a primitive notion (i.e., concepts not defined in terms of previously-defined concepts).
Other examples of primitive notions in mathematics include *point* and *line*.

We have mentioned that a set is a collection of well-defined, distinct objects. Objects in a set are called *elements* of the set.
We write to mean that the element belongs to the set . If does not belong to , we write .

**Example.**

- Consider the set of all even numbers . Elements of include (but are not limited to) -2, 0, and 4, i.e., .
- The elements of the English alphabet (a set) are English letters.

## Ways of describing a set[edit | edit source]

There are multiple ways to describe a set precisely (in the sense that element(s) belonging to the set is (are) known precisely).

If a set consists of a small number of elements, then the *listing method* may be quite efficient.
In the listing method, elements of a set are listed within a pair of braces ({}). In particular, just changing the listing *order* of elements
does *not* change the set represented.
For example, and are both representing the same set whose elements are 1 and 2.
If the elements listed in the pair of braces are the same, the notations created by the listing method with different listing orders refer to the *same* set.
Also, repeatedly listing a specific element in a set does *not* change the set represented.
For example, and are both representing the same set whose elements are 1 and 2.
In particular, if a set contains no elements, it can be denoted by based on the listing method or .
This kind of set is called an empty set.

Another way to describe a set is using *words*. For example, consider the set of prime numbers less than 10. If we use the listing method instead, the set is represented by .

The third way to describe a set is advantageous when a set contains many elements. This method is called *set-builder notation*.
There are *three* parts within a pair of braces in this notation.
They are illustrated below with descriptions:

As one may expect, two sets are *equal* if and only if they contain the same elements.
Equivalently, two sets and are equal if and only if each element of is also an element of and each element of is also an element of .
This can be regarded as an axiom ^{[2]} or a definition. If two sets and are equal, we write . If not, we write .

In this book, when we are solving an equation, we are only considering its *real* solution(s) unless stated otherwise.

**Example.**

- .
- .
- .

**Exercise.**
Assume and are different elements. Is each of the following statements true or false?

## Set cardinality[edit | edit source]

If a set contains *finite* number of elements, it is called a *finite* set, and it is called an *infinite* set otherwise.
If a set is finite, then its cardinality is its number of elements. For infinite sets, it is harder and more complicated to define their cardinalities, and so we will do this in the later chapter about set cardinalities.
For each set , its cardinality is denoted by .

**Example.**

- Let . Then, .
- Let . Then, (not 3 since the element is listed repeatedly).
- Let . Then, since there is no solution for (for real number ), and thus is an empty set.
- Let . Solving , we have . Hence, and thus
^{[3]}.

There are some special infinite sets for which notations are given, as follows:

- is the set of all natural numbers (0 is
*not*regarded as a natural number in this book). - is the set of all integers.
- is the set of all rational numbers.
- (nonstandard notation) is the set of all irrational numbers.
- is the set of all real numbers.
- is the set of all complex numbers.

In particular, we can use set-builder notation to express , as follows: .

**Example.**

**Exercise.**
Use set-builder notation to express without using "" in the expression.

We can express like this: ().

## Subsets[edit | edit source]

**Definition.**
(Subset)
A set is a *subset* of a set (denoted by ) if each element of is also an element of .

**Remark.**

- If is
*not*a subset of , we denote it as . - Recall that two sets and if and only if each element of belongs to and each element of belongs to . Using the notion of subsets, we can write if and only if and .

**Example.**

- .
- (e.g. but )
- (e.g. but )
- For each set , , i.e. each set is a subset of itself.

- This is because each element of set is an element of .

- For each set , .

- If we want to prove this directly, there are some difficulties since does not contain any element. So, what is meant by "each element of "?
- Under this situation, it may be better to
*prove by contradiction*(a proof technique covered in the later chapter about methods of proof). First, we suppose on the contrary that . By the negation of the definition, there is*at least one*element of that is*not*an element of , which is false. This yields a contradiction, and thus the hypothesis is false (explanation will be provided later), i.e. is false.

**Definition.**
(Proper subset)
A set is a *proper subset* of a set (denoted by ) if is a subset of and .

**Remark.**

- Similarly, if is
*not*a proper subset of , we write .

**Example.**

- For each
*nonempty*set , since (shown previously) and if is a*nonempty*set. - .
- .
- and .

**Exercise.**
Let .

We call some commonly encountered subsets of *intervals*.
For each real number such that ,

- (open intervals)
- (half-open (or half-closed) intervals)
- (half-open (or half-closed) intervals)
- (closed intervals)

There are also some *infinite* intervals:

Note: is a shorthand of ( is a set).

**Example.**

- .
- .
- since the element "1" of the set on LHS does
*not*belong to the set on RHS. - .

**Example.**

- The set of (real) solutions of is .
- The set of (real) solutions of is . (Note: we
*cannot*express this set as since it is required that for an interval .) - The set of (real) solutions of is .

**Exercise.**

## Universal set and Venn diagram[edit | edit source]

**Definition.**
(Universal set)
A *universal set*, denoted by , is a set containing all elements considered in a certain investigation.

**Example.**

- If we are studying real numbers, the universal set is .

**Definition.**
(Complement)
The *complement* of a set that is a subset of the universal set , denoted by , is the set
.

**Example.**

- Let and . Then, . (Note: also.)
- For each universal set , (since each element of does not belong to
^{[4]}) and (since there are no elements of that does not belong to ). - Let and . Then, since each element of does not belong to .

**Exercise.**
Let the universal set be .

A *Venn diagram* is a diagram showing all possible logical relationships between a finite number of sets.
The universal set is usually represented by a region enclosed by a rectangle, while the sets are usually represents by regions enclosed by circles.
The following is a Venn diagram.

In this diagram, if the white region represents set and the region enclosed by the rectangle represents the universal set, then the red region is the set .

However, the following is *not* a Venn diagram.

This is because there are not regions in which only the yellow and blue region intersect, and only the red and green region intersect, respectively.
So, not *all* logical relationships between the sets are shown.

To show all logical relationships between four sets, the following Venn diagram can be used.

## Set operations[edit | edit source]

Similar to the arithmetic operations for real numbers which combine two numbers into one, the set operations combine two sets into one.

### Union of sets[edit | edit source]

**Definition.**
(Union of sets)

The *union* of a set and a set , denoted by , is the set .

**Remark.**

- The "or" here is
*inclusive*, i.e. if an element belongs to*both*and , it also belongs to .

**Example.**

- .
- .
- .
- .

**Proposition.**
Let and be sets. Then,

- (commutative law)
- (associative law)
- and

**Proof.**
(Formal) proof will be discussed later. For now, you may verify these results using Venn diagram.

**Remark.**

- Because of the associative law, we can write union of three (or more) sets without brackets. We will have similar results for intersection of sets, and so we can also write intersection of three (or more) sets without brackets.

### Intersection of sets[edit | edit source]

**Definition.**
(Intersection of sets)

The *intersection* of a set and a set , denoted by , is the set .

**Remark.**

- If , we say that and are
*disjoint*.

**Proposition.**
Let and be sets. Then,

- (commutative law)
- (associative law)
- and

**Proof.**
(Formal) proof will be discussed later. For now, you may verify these results using Venn diagram.

**Proposition.**
(Distributive laws)
Let and be sets. Then,

- (the "" is "distributed" to and respectively)

### Relative complement[edit | edit source]

**Definition.**
(Relative complement)

The *relative complement* of a set in a set , denoted by , is the set .

**Remark.**

- if is the universal set. So, the complement of a set is also the relative complement of in .
- The notation is read "B with A taken away".
- We can see from the definition that

**Example.**

- .
- .
- .
- .
- .

**Exercise.**

**Proposition.**
Let and be sets. Then,

- .
- .
- .
- if and only if .
- .
- .

**Proof.**
(Formal) proof will be discussed later. For now, you may verify these results using Venn diagram.

**Theorem.**
(De Morgan's Laws)
Let and be sets. Then,

**Proof.**
(Formal) proof will be discussed later. For now, you may verify these results using Venn diagram.

**Example.**
Suppose the universal set is , and .
Since , .
On the other hand, since and , .

**Exercise.**

### Symmetric difference[edit | edit source]

**Definition.**
(Symmetric difference)

The *symmetric difference* of sets and , denoted by , is the set .

**Example.**

- .

**Proposition.**
Let and be sets. Then,

- (associative law)
- (commutative law)

**Exercise.**

### Power set[edit | edit source]

**Definition.**
(Power set)
The power set of a set , denoted by , is the set of all subsets of . In set-builder notation,
.

**Remark.**

- Since for each set , is an element of each power set.
- Also, since for each set , is an element of the power set .

**Example.**

- . Its cardinality is 1.
- If , then . Its cardinality is 2.
- If , then . Its cardinality is 4.
- . Its cardinality is 8.

**Theorem.**
(Cardinality of power set of a finite set)
Let be a finite set with cardinality . Then, .

**Proof.**
Assume is a finite set with cardinality .
Since each element of the power set is a subset of , it suffices to prove that there are subsets of .
In the following, we consider subsets of with different number of elements separately, and count the number of subsets of each of the different types using combinatorics.

- For the subset with zero element, it is the empty set, and thus there is only one such subset.
- For the subsets with one element, there are subsets.
- For the subsets with two elements, there are subsets.
- ...
- For the subsets with elements, there are subsets.
- For the subset with elements, it is the set , and thus there is only one such subset.

So, the total number of subsets of is by *binomial theorem*.

**Remark.**

- The proof method employed here is called
*direct proof*, which is probably the most "natural" method, and most commonly used. We will discuss methods of proof in a later chapter. - There are alternative ways to prove this theorem.

**Exercise.**
In each of the following questions, choose the *power set* of the set given in the question.

It is given that . In each of the following questions, choose the *cardinality* of the set given in the question.

### Cartesian product[edit | edit source]

**Definition.**
(Cartesian product)
The *Cartesian product* of sets and , denoted by , is .

**Remark.**

- is the
*ordered pair*(i.e. a pair of things for which order is*important*).

- The ordered pair is used to specify points on the plane, and the ordered pair is called
*coordinates*.

- The ordered pair is used to specify points on the plane, and the ordered pair is called

- In particular, we have if .
- (notation) We use to denote for each set .
- We can observe that .

**Example.**
Let and . Then,

- .
- .

**Remark.**

- We can see from the above example that the Cartesian product is
*not commutative*, i.e. it is not necessary for .

**Exercise.**
Let .

Similarly, we can define the Cartesian product of three or more sets.

**Definition.**
(Cartesian product of three or more sets)
Let be an integer greater than 2. The Cartesian product of sets is
.

**Remark.**

- (notation) We use to denote , where .

# Logic

As discussed in the introduction, logical statements are different from common English. We will discuss concepts like "or," "and," "if," "only if." (Here I would like to point out that in most mathematical papers it is acceptable to use the term "we" when referring to oneself. This is considered polite by not commanding the audience to do something nor excluding them from the discussion.)

## Truth and statement[edit | edit source]

We encounter *statements* frequently in mathematics.

**Definition.**
(Statement)
A *statement* is a declarative sentence that is either **true** or **false** (but not both), and its *truth value* is **true** (denoted by ) or **false** (denoted by ).

**Example.**
Consider the following sentences:

- The number 9 is even.
- .
- Mathematics is easy.
- How to solve ?
- Please read this book.

- The sentence 1 and 2 above are
*statements*(even if the sentence 1 is false). - The sentences 3, 4 and 5 are
*not*statements, since they are not declarative sentences, and we cannot say whether each of them is true or false.

- In particular, the sentence 3 is an opinion, the sentence 4 is a question, and the sentence 5 is a command. Thus, none of them are declarative.

**Exercise.**

For the sentences that are not statements, there is a special type of sentences among them, namely *open statement*.

**Definition.**
(Open statement)
An *open statement* is a sentence whose truth value depends on the input of certain variable.

**Remark.**

- Since the truth value may change upon input change, we cannot determine the truth value of an open statement (we cannot say it is (always) true or it is (always) false).

**Example.**
Consider the sentence ( is read "such that").

- This sentence is true when , and false otherwise.
- This sentence is an open statement.

To express all possible combinations of *truth values* of some statements, we usually list them in a table, called a *truth table*.

**Example.**
(Truth table for two statements)
For two statements and , the truth table for them is as follows:

**Example.**
(Truth table for three statements)
For three statements , and , the truth table for them is as follows:

**Remark.**

- In general, there are possible combinations of truth values of statements, since each statement has two possible truth values.
- The truth table for three statement may seem to be complicated, and you may miss (or duplicate) some combinations in the truth table if you are not careful enough. Because of this, here is an advice for constructing such truth table:

- for , write four 's and then four 's, from top to bottom;
- for , write in this pattern from top to bottom: ;
- for , write in this pattern from top to bottom: .

## Conjunction, disjunction and negation[edit | edit source]

In this section, we will discuss some ways (conjunction and disjunction) to combine two statements into one statement, which is analogous to Mathematical Proof/Introduction to Set Theory#Set operations, in which two sets are combined into one set. Also, we will discuss a way (negation) to change a statement to another one.

### Conjunctions[edit | edit source]

**Definition.**
(Conjunction)
The *conjunction* of statements and , denoted by , is a statement that is true when *both* and are true, and false otherwise.

**Remark.**

- is read "P and Q", and the conjunction of the statements and can also be expressed by " and " directly.

**Example.**
(Truth table for )
The truth table for (in terms of possible combinations of truth values of and ^{[6]}) is

- We can see that is true only when
*both*and are true, and false otherwise.

### Disjunctions[edit | edit source]

**Definition.**
(Disjunction)
The *disjunction* of statements and , denoted by , is a statement that is false when *both* and are false, and true otherwise.

**Remark.**

- That is, is true when
*at least one*of and is true, and false otherwise. - is read "P or Q", and the disjunction of the statements and can also be expressed by " or " directly.
- The meaning of "or" in mathematics may be different from the meaning of "or" as an English word. For "or" in mathematics, it is used
*inclusively*, i.e. or means or or both. However, as an English word, "or" may be used*exclusively*, i.e. or means or but not both. For example, when someone say "I will go to library or go to park this afternoon.", we interpret this as "I will either go to library, or go to park, but not both.".

**Example.**
(Truth table for )
The truth table for is

- We can see that is false only when
*both*and are false, and true otherwise.

### Negations[edit | edit source]

**Definition.**
The *negation* of a statement , denoted by , is a statement with truth value that is opposite to that of .

**Remark.**

- is read "not P", and the negation of the statement can also be expressed by "not ", or "It is not the case that " directly.
- Another common notation for the negation of a statement is .
- We refer to process of expressing a negation of a statement as
*negating*a statement.

**Example.**
(Truth table for )
The truth table for is

- We can see that always has the opposite truth value to that of .

To negate a statement, we usually add the word "not" into a statement, or delete it from a statement.
For example, the negation of the statement "The number 4 is even." is "The number 4 is *not* even.", and the negation of the statement "The number 1 is not prime." is "The number 1 is ~~not~~ prime."

**Exercise.**
Complete the following truth table:

- We can observe that in some combinations of truth values of and , the truth values of and are different.

**Exercise.**
Let be the statement "The number 3 is even.", and be the statement "The number is irrational."

Write down (in words) the negation of each of and *without using the word "not"*.

- The negation of can be "The number 3 is odd.".
- The negation of can be "The number is rational."

**Exercise.**
Let be the statement and be the statement .

(a) Is the statement true or false?

(b) Is the statement true or false?

(c) Is the statement true or false?

(d) Is the statement true or false?

- First, we can see that both and are false.

(a) Since is false, the answer is *true*.

(b) Since is false, the answer is *true*.

(c),(d) Since and are both true, the answer for (c) and (d) are both *true*.

## Conditionals[edit | edit source]

Apart from the above ways to form a new statement, we also have another very common way, namely the "if-then combination".
The statement formed using the "if-then combination" is called a *conditional*.

**Definition.**
(Conditionals)
The *conditional* of two statements and is the statement "If then .", denoted by .
and are called the *hypothesis* and *consequent* of the conditional respectively.
The conditional is *false* when is true and is false, and *true* otherwise.

**Example.**
(Truth table for )
The truth table for is

- We can observe that, in particular, even if the hypothesis is false, the conditional is true, by definition
^{[7]}. - Another observation is that when the consequent is true, then no matter the hypothesis is true or false, the conditional must be true (see 1st and 3rd row).

To understand more intuitively why the conditional is always true when the hypothesis is false, consider the following example.

**Example.**
Suppose Bob is taking a mathematics course, called MATH1001. The course instructor of MATH1001 warns Bob that if he fails the final examination of this course, then he will fail this course.
Let be the statement "Bob fails the final examination of MATH1001.", and be the statement "Bob fails MATH1001".
Then, the statement made by the course instructor is "".

For the statement made by the course instructor to be true, *either* Bob actually fails the final examination of MATH1001, and he actually fails the course, *or* Bob passes the final examination of MATH1001.
In the latter case, whether Bob fails MATH1001 or not does not matter, since the course instructor does not promise anything if Bob passes the final examination of MATH1001 ^{[8]}.

For the statement made by the course instructor to be false, the only situation is that Bob fails the final examination of MATH1001, but he still passes MATH1001 ( is true and is false) (this shows that the instructor is lying!).

### Converse and biconditionals[edit | edit source]

After discussing *conditional* of and , we will discuss *biconditional* of and . As suggested by its name, there are *two* conditionals involved.
The conditional involved, in addition to , is , which is called the *converse* of the conditional .

In mathematics, given that the conditional is true, we are often interested in knowing whether its *converse* is true as well ^{[9]}.

**Example.**
The converse of the statement made by the course instructor in the previous example is "If Bob fails MATH1001, then he fails the final examination of MATH1001.".

**Definition.**
(Biconditionals)
The *biconditional* of two statements and , denoted by , is , that is, "If then ." and "If then .".

**Remark.**

- We also write
*if and only if*in this case.

- To understand the phrase "if and only if" more clearly, consider the following:
- if and only if can be interpreted as " if and only if ".
- For " if ", it should be easy to accept that it means "If then ".
- For " only if , it means can
*only*be true when is true. That is, is a*necessary condition*for . Thus, we can deduce that when is true, must be true (or else cannot possibly be true). Hence, " only if " means "If then .".

**Example.**
(Truth table for )
The truth table for is

- We can see that is true when both and have the
*same*truth values (i.e. either both and are true, or both and are false), and false otherwise.

### Implication and logical equivalence[edit | edit source]

When the conditional is *true*, we can say " *implies* ", denoted by .
On the other hand, when does *not* imply , i.e. is *false*, we denote this by .

We have some other equivalently ways to say " implies ", namely

- is a
*sufficient condition*for (or is sufficient for in short)

- We call to be
*sufficient*for since when implies , then " is true" is*sufficient*to deduce " is true".

- We call to be

- is a
*necessary condition*for (or is necessary for in short)

- We call to be
*necessary*for since when implies , the hypothesis cannot be possibly true when the consequent is false (or else the conditional will be false). This explains the*necessity*of " is true".

- We call to be

When , we are often interested knowing whether the *converse* of is true or not, i.e. whether we have or not ^{[10]}.

In the case where but , we have multiple equivalent ways to express this:

- is
*sufficient but not necessary*for .

- From the previous interpretation, when we say is necessary for , we mean . Hence, when is sufficient but not necessary for , we mean and .

- is a
*stronger condition*than (or is*stronger*than in short).

In the case where and as well, the biconditional is also true, and we denote this by . There are also multiple equivalent ways to express this:

- is
*logically equivalent to*.

- We say they are
*logically*equivalent since they always have the same truth values (because is true), which is related to*logic*.

- We say they are

- "
*if and only if*" (is true).

- Recall that we also use " if and only if " to express the
*biconditional*. Thus, technically, we should write " if and only if " is true in the case where . However, we rarely write this in practice, and usually omit the phrase "is true" since it makes the expression more complicated. So, when we write " if and only if " in this context, we mean that the biconditional is true without saying it explicitly. - Usually, when we just write " if and only if ", we have the meaning of the logical equivalence , rather than the statement . If we really want to have the latter meaning, we should specify that " if and only if " refers to a
*statement*.

- Recall that we also use " if and only if " to express the

- is
*necessary and sufficient*for .

- Following the previous interpretation, is necessary and sufficient for means and .

**Theorem.**
(Some laws about conjunction, disjunction and negation)
In the following, , and are arbitrary statements.

- (double negation)
- (commutative law of conjunction)
- (commutative law of disjunction)
- (associative law of conjunction)
- (associative law of conjunction)
- (distributive law)
- (distributive law)
- (De Morgan's law)
- (De Morgan's law)

**Proof.**
They can be shown using truth tables.

**Remark.**

- You may observe that there are also some analogous results in set theory (some even have the same name!), discussed in the chapter about set theory. This is because the results discussed in the chapter about set theory are actually proven from the corresponding results above almost directly.

**Theorem.**
(Bridge between conditional and disjunction)
The statements and are logically equivalent.

**Proof.**
It can be shown using the following truth table:

**Theorem.**
(Logical equivalence of a conditional and its contrapositive)
The *contrapositive* of a conditional is defined to be another conditional , and they are logically equivalent.

**Proof.**
Using the bridge between conditional and disjunction and some other laws, it can be shown as follows:

**Remark.**

- It may seem "surprising" when we "suddenly" negate twice. Indeed, when we are thinking about how to prove the logical equivalence, we do not directly do this from nowhere. Instead, we are "motivated" to do so after observing that and . So, we sort of finish the above series of equivalence "like a sandwich" (from left to right and from right to left simultaneously). This may be useful for other similar proofs.
- This result is very important for Proof by Contrapositive, which will be discussed later.

## Tautologies and contradictions[edit | edit source]

Before defining what tautologies and contradictions are, we need to introduce some terms first.
In the previous sections, we have discussed the meaning of the symbols and .
These symbols are sometimes called *logical connectives*,
and we can use *logically connectives* to make some complicated statements.
Such statements, which are composed of at least one given (or component) statements (usually denoted by etc.) and at least one logical connective, are called *compound statements*.

**Definition.**
(Tautologies and contradictions)
A *compound statement* is called a tautology (contradiction) if it is true (false) for each possible combination of truth values of the component statement(s) that comprise .

**Remark.**

- We use to denote a tautology and to denote a contradiction.
- When a statement is a tautology, we can also write , since it means and always have the same truth value, and because the truth value of is always true, the truth value of is also always true, i.e. is a tautology.

- Because of this, when we want to prove that a statement is
*always true*, one way is to show that . For example, if we want to prove that and are logically equivalent, we may show that .

- Because of this, when we want to prove that a statement is

**Example.**
Let be an arbitrary statement. Then,

- is a tautology.
- is a contradiction.

This is because the truth table for is

**Example.**
Let and be arbitrary statements.
Then, is a tautology, since its truth table is

**Exercise.**
The following are some further questions on this example.

Prove that is a tautology without using truth tables.

Since

A student claims that is a contradiction with the following argument:

- Since , the conditional is a contradiction.

Comment on his claim.

- The claim is wrong.
- The step is incorrect, since we should use distributive law here instead, and we cannot apply associative law with two types of logical connector here.
- Indeed, it is shown in an above question that the conditional is neither tautology nor contradiction.

**Theorem.**
(Laws about tautologies and contradictions)
Let be an arbitrary statement. Then,

- .
- .
- .
- .
- .
- .

**Proof.**
They can be shown using truth tables.

## Quantifiers[edit | edit source]

Recall that an *open statement* is a sentence whose truth values depends on the input of certain variable.
In this section, we will discuss a way to change an open statement into a statement, by "restricting the input" using quantifiers, and such statement made is called an quantified statement.
For example, consider the statement "The square of each real number is nonnegative.". It can be rephrased as "For each real number , ."
We can let be the *open statement* "". Then, it can be further rephrased as "For each real number , ."
In this case, we can observe how an open statement () is converted to a statement (For each real number , ),
and the phrase "for each" is a type of the *universal quantifier*.
Other phrases that are also universal quantifiers include "for every", "for all" and "whenever".
The universal quantifier is usually denoted by (an inverted "A").
After introducing this notation, the statement we mention can be further rephrased as "" (we also use some set notations here).

In general, we can use the universal quantifier to change an open statement to a statement, which is "" in which is a (universal) set (or domain) which restricts the input .

Apart from the universal quantifier, another way to convert an open statement into a statement is using an *existential quantifier*.
Each of the phrases "there exists", "there is", "there is at least one", "for some" ^{[11]}, "for at least one" is referred to as an *existential quantifier*, and is denoted by (an inverted "E"). For example, we can rewrite the statement "The square of some real number is negative." as "" (which is false).

In general, we can use the existential quantifier to change an open statement to a statement, which is "" in which is a (universal) set (or domain) which restricts the input .

Another quantifier that is related to *existential* quantifier is the *unique existential quantifier*. Each of the phrases "there exists a unique", "there is exactly one", "for a unique", "for exactly one" is referred to as *unique existential quantifier*, which is denoted by .
For example, we can rewrite the statement "There exists a unique real number such that ." as "."
We can express the unique existential quantifier in terms of existential and universal quantifiers, by *defining* "" as

- There exists such that , AND for every , if and , then (i.e., and are actually referring to the same thing, so there is
*exactly one*such that ).

In general, we need to separate the existence and uniqueness part as above to prove statements involving unique existential quantifier.

### Negation of quantified statements[edit | edit source]

**Example.**
The statement "" ^{[12]} can be expressed in words (partially) as "There exists a set such that ."

**Exercise.**
Write down the *negation* of this statement in words (partially).
(Hint: What is the negation of " ( is a nonnegative integer)."? Hence, what is the negation of "There is at least one such that ."?)

- For the hint, the negation of " ( is a nonnegative integer)." is "", and the negation of "There is at least one such that ." is hence "There is no such that ". It can also be expressed equivalently as "For each , is
*not*satisfied.", or . - Inspired from the hint, the negation of this statement can be written as "For each set , ."

From this example, we can see that the negation of the statement "" is logically equivalent to "".
Now, it is natural for us to want to know also the negation of the statement ".
Consider this: when it is not the case that is true for each , it means that is false for *at least one* . In other words, .
Hence, we know that the negation of the statement "" is logically equivalent to .

### Quantified statements with more than one quantifier[edit | edit source]

A quantified statement may contain more than one quantifier. When only one type of quantifier is used in such quantified statement, the situation is simpler. For example, consider the statement "For each real number and for each real number , is a real number." It can be written as "". When we interchange "" and "", the meaning of the statement is not affected (the statement still means "The product of two arbitrary real numbers is a real number.") Because of this, we can simply write the statement as "" without any ambiguity.

For an example that involve two existential quantifiers, consider the statement "There exists an real number and an real number such that is a real number." It can be written as "." Similarly, interchanging "" and "" does not affect the meaning of the statement (the statement still means "For at least one pair of real numbers and , is a real number.") Because of this, we can simply write the statement as "" without any ambiguity.

However, when both types of quantifier are used in such quantified statement, things get more complicated. For example, consider the statement "For each integer , there exists an integer such that ." This can also be written as "". It means that for each integer, we can find a (strictly) smaller one, and we can see that this is a true statement. For instance, if you choose , I can choose or . Indeed, for the integer chosen by you, I can always choose my as so that .

Let's see what happen if we interchange "" and "". The statement becomes
, meaning that there exists an integer such that it is (strictly) smaller than *every* integer ! This is false, since, for example, there is no integer that is (strictly) smaller than itself (which is an integer).
In this example, we can see that interchanging the positions of universal quantifier and existential quantifier can change the meaning of the statement.
Hence, it is very important to understand clearly the meaning of a quantified statement with both universal and existential quantifiers.
To ease the understanding, here is a tips for reading such statement:

- For the variable associated to the quantifier , it
*may*depend on the variable(s) introduced earlier in the statement, but*must*be independent from the variable(s) introduced later in the statement.

What does it mean? For example, consider the above example. *In the first case*, we have . Then, since the variable appears *earlier* than the variable which associated to , *may depend* on (This is similar to the case in English. In a sentence, a thing may depend on other things mentioned earlier.). For instance, when you choose , and I choose . Then, . However, if you change your choice to , then my does not work, and I need to change my to, say, 8 so that .
Then, we can see that depends on in this case.
*In the second case*, we have . In this case, the variable appears *later* than the variable . Hence, the variable must be independent from from . That is, when such is determined, it needs to satisfy for each chosen, and the cannot change depend on what is. Indeed, cannot *possibly* depend on , since is supposed to be determined when is not even introduced!

## Exercises[edit | edit source]

In the following questions, are statements.

A. Construct the truth tables for each the following statements, and also give its converse and contrapositive:

B. Negate the following statements: