Examples of Proof: Sets

We discussed in class how to formally show that one set is a subset of another and how to show two sets are
equal. Here are some examples.
In the first proof here, remember that it is important to use different dummy variables when talking about
different sets or different elements of the same set. You dont want to accidently start by assuming that two
elements are equal. Note that I discovered the relationship between m and n in my scratch work (I asked myself
what needed to be true to make 4m + 1 equal to 4n 3, setting them equal and solving I got n = m + 1).
Theorem Let A = {n : n = 4k + 1 for some k Z} and B = {n : n = 4k 3 for some k Z}. Prove A = B
Proof: We must show that A B and B A.
First, we show that A B.
Let x A. By definition of A, x = 4m + 1 for some m Z. Letting n = m + 1, we check by substitution that
4n 3 = 4(m + 1) 3 = 4m + 4 3 = 4m + 1 = x. Hence, x = 4n 3 for some n Z (namely, n = m + 1).
Thus, x B and we have shown A B.
Now we show that B A.
Let x B. By definition of B, x = 4n 3 for some n Z. Letting m = n 1, we check by substitution that
4m + 1 = 4(n 1) + 1 = 4n 4 + 1 = 4n 3 = x. Thus, x = 4m + 1 for some m Z (namely, m = n 1).
Ergo, x A and we have shown B A.
Therefore, A = B. 
Here is another set equality proof (from class) about set operations.
Theorem For any sets A and B, A B = A B c .
Proof: We must show A B A B c and A B c A B. First, we show that A B A B c .
Let x A B. By definition of set difference, x A and x 6 B. By definition of complement, x 6 B implies
that x B c . Hence, it is true that both, x A and x B c . By definition of intersection, x A B c .
Now we show that A B c A B.
Let x A B c . By definition of intersection, x A and x B c . By definition of complement, x B c implies
that x 6 B. Hence, x A and x 6 B. By definition of set difference, x A B.
Thus, A B = A B c . 
Here are some basic subset proofs about set operations.
Theorem For any sets A and B, A B A.
Proof: Let x A B. By definition of intersection, x A and x B. Thus, in particular, x A is true. 
Theorem For any sets A and B, B A B.
Proof: Let x B. Thus, it is true that at least one of x A or x B is true. Since x A or x B is true, by
definition of union, x A B. 
Theorem For any sets A and B, A B A.
Proof: Let x A B. By definition of set difference, x A and x 6 B. Thus, in particular, x A is true. 

Examples of Proofs: Inequalities

Here are some of the main inequality facts that I expect you to assume (facts 2 - 6 all hold with the less than
or equal size () as well except as noted in 3):
1. If x is a real number, then either x < 0, x > 0, or x = 0.
It is sometimes useful to do all three of these cases separately in a proof.
2. If x < y and a is any real number, then x + a < y + a and x a < y a.
You can add or subtract from both sides of an inequality.
3. If x < y and w < z, then x + w < y + z. You can add two inequalities.
If x < y and w z, then x + w < y + z.
This is the same fact as above, I am just noting that if one inequality is strict, then we can say the sum
in strict.
4. If x < y and a is a positive real number, then ax < ay.
You can multiply by a positive constant and the inequality stays in the same direction.
If x < y and a is a negative real number, then ax > ay. Multiplying by a negative constant changes the
direction of the inequality.
5. If 0 < x < y and 0 < w < z, then xw < yz.
You can multiply inequalities provided all the numbers are positive.
6. If x < y and y < z, then x < z. This is called the transitive property.
7. If x is a real number, then x2 0. The square of a real number is not negative.
Below is the first proof we ever did in lecture. Remember that in our scratch work, we found that the conclusion
was equivalent to a known fact from above. Then we wrote our proof starting from this known fact.
Theorem (The AGM Inequality, Part 1 ) If x and y are real numbers, then 2xy x2 + y 2 .
Proof: Let x and y be real numbers.
Since the square of a real number cant be negative, we have 0 (x y)2 (this is fact 7 listed above). By
expanding the square, we get 0 x2 2xy + y 2 . Adding 2xy to both sides of the inequality gives 2xy x2 + y 2
(this is allowed by fact 2 listed above). 
Illustrating a Counterexample The statement: If x is a real number, then x x2 is a false statement.
Here is one counterexample: Let x = 12 , so that x2 = 14 . But x = 21 > 14 = x2 , so this is a counterexample (the
hypothesis is true and the conclusion is false).
After thinking about the example above and trying a few more examples, you probably realized that it is true
that x x2 , when x 1 and when x 0. Lets prove this.
Theorem If x is a real number and x 0 or x 1, then x x2 .
Proof: Let x be a real number. We prove the two separate cases: x 0 or x 1.
CASE 1: Assume x 0. By fact 7, 0 x2 . Since we have x 0 and 0 x2 , by the transitive property, x x2 .
CASE 2: Assume x 1. Since x is a positive number, we can multiply both sides of this inequality by x (by
fact 4 above) to get x2 x which is the same as x x2 .
In all cases of the hypothesis, we have shown that x x2 . 
Here are some more inequality proofs, some of which you will see in lecture. Note that the proof below would
also work with in place of < everywhere.
Theorem If 0 < a < b, then a2 < ab < b2 .
Proof: Assume 0 < a < b.
Since a < b and a > 0, by fact 4, we can multiply the first inequality by a to get a2 < ab.
Since a < b and b > a > 0, by fact 4 again, we can multiply the first inequality by b to get ab < b2 .
Hence, a2 < ab < b2 . 

Corollary If 0 < c < d, then c < d.

2 2
Proof: Assume 0 < c < d. If, on the contrary, c d,then the theorem above implies that c d , so

c d. By assumption, this cannot be the case, so c < d. 

The proof of this corollary illustrates an important technique called proof by contradiction. The idea is to
assume the hypothesis, then assume the conclusion is false. If these assumptions always lead to a contradiction,
then the conclusion must be true. We will talk a lot more about this in chapter 2, but you are welcome to use
this idea now if you want to try it.
Examples of Proofs: Absolute Values
The absolute value function is one that you should have some familiarity, but is also a function that students
sometimes misunderstand. An important observation is the absolute value is a function that performs different
operations based on two cases x < 0 or x 0. Thus, most proofs and problems that involve using the absolute
value function require a look at cases.

x , if x < 0;
Definition If x is a real number, then the absolute value of x is defined by |x| =
x
, if x 0.
In other words, the number is left alone if x 0 and the sign is flipped if x < 0. So negatives are never output
by this function. Because of this fact, some students get confused about how |x| = x sometimes, but remember this is only the case if x is already negative (so x is positive). Lets do some proofs with the absolute value.
Theorem If x is a real number, then |x|2 = x2 .
Proof: Let x be a real number. We prove the two separate cases: x < 0 or x 0.
CASE 1: Assume x < 0. By the definition of absolute value, |x| = x. Squaring both sides gives |x|2 = (x)2 .
Since (x)2 = x2 for any real number (see Prop. 1.43(e) in the book), we have |x|2 = x2 .
CASE 2: Assume x 0. By the definition of absolute value, |x| = x. Squaring both sides gives |x|2 = x2 .
In all cases, |x|2 = x2 . 
Theorem If x is a real number, then x |x|.
Proof: Let x be a real number. We prove the two separate cases: x < 0 or x 0.
CASE 1: Assume x < 0. By the definition of absolute value, |x| = x > 0. Since we have x < 0 and 0 < |x|,
by the transitive property, x < |x| (in which case it is also true, though less specific, to say that x |x|.
CASE 2: Assume x 0. By the definition of absolute value, |x| = x. In which case it is also true, though less
specific as before, to say that x |x|.
In all cases, x |x|.
A useful observation about absolute values and inequalities is that |x| < 5 is the same as saying 5 < x < 5.
If you are working with inequalities and absolute values, it might be wise to rewrite the inequality in this way.
Theorem If |x + 2| < 10 and x > 0, then |x 5| < 5.
Proof: Assume |x + 2| < 10 and x > 0. Rewriting the first inequality without the absolute value, we have
10 < x + 2 < 10. By subtracting two from, we obtain 12 < x < 8. Hence, noting both assumptions, we
have 0 < x < 8. Subtracting five, we obtain 5 < x 5 < 3. Since x 5 < 3 and 3 < 5, we have x 5 < 5 (by
the transitive property). Thus, 5 < x 5 < 5 which is equivalent to |x 5| < 5. 

Examples of Proofs: Rational Numbers

Here we prove several things about the rational numbers which you probably already believe to be true, but
it is a chance for you to see several direct proofs. Remember, a direct proof starts with the hypothesis and
ends with the conclusion. In the middle we use logical deductions from known facts and definitions. For all the
proofs below we are essentially just unwinding the definition of a rational number.
Definition A rational number is any number, x, that can be written in the form x =
and b with b 6= 0.

a
b

for some integers a

Theorem If x and y are rational numbers, then xy is a rational number.

Proof: Assume x and y are rational numbers.
By the definition of a rational number, x = ab and y = dc for some integers a, b, c, and d where b and d
are not zero. By substitution, xy = ab dc = ac
bd . Since p = ac and q = bd are integers and q = bd is not zero,
we have shown that xy can be written in the form pq for some integers p and q. Hence, xy is a rational number. 
You can see that we couldnt use the symbols a and b for both x and y as that would assume that x and y are
the same.
Theorem If x and y are rational numbers, then x + y is a rational number.
Proof: Assume x and y are rational numbers.
By the definition of a rational number, x = ab and y = dc for some integers a, b, c, and d where b and d are not
bc
ad+bc
zero. By substitution, x + y = ab + dc . Getting a common denominator we have x + y = ad
bd + bd = bd . Since
p = ad + bc and q = bd are integers and q = bd is not zero, we have shown that xy can be written in the form
p
q for some integers p and q. Hence x + y is a rational number. 
Theorem If x and y are rational numbers and y 6= 0, then x/y is a rational number.
Proof: Assume x and y are rational numbers and y 6= 0.
By the definition of a rational number, x = ab and y = dc for some integers a, b, c, and d where b and d are not
a

zero. Since y = dc cant be zero by assumption, c must also be nonzero. By substitution, x/y = cb = ad
bc . Since
d
p = ad and q = bc are integers and q = bc is not zero, we have shown that xy can be written in the form pq for
some integers p and q. Hence x/y is a rational number. 
The next two proofs illustrate how mathematicians try to generalize theorems.
Theorem If x is a rational numbers, then x2 is a rational number.
Proof: Assume x is a rational number.
By the definition of a rational number, x = ab for some integers a and b where b is not zero. By substitution,

2
2
x2 = ab = ab2 . Since p = a2 and q = b2 are integers and q = b2 is not zero, we have shown that xy can be
written in the form pq for some integers p and q. Hence, x2 is a rational number. 
Theorem If x is a rational numbers and n is a natural number, then xn is a rational number.
Proof: Assume x is a rational number.
By the definition
of being rational, x = ab for some integers a and b where b is not zero. By substitution,


a n
an
n
x = b = bn . Since p = an and q = bn are integers and q = bn is not zero, we have shown that xy can be
written in the form qp for some integers p and q. Hence, xn is a rational number. 

Most of the facts above dont hold true in general for irrational numbers. For example, x = 2 is irrational
2
(we will prove this later in the quarter), how x2 = 2 = 2 = 12 is a rational number. So the square of an
irrational number may or may not be irrational. The sum of two irrational number can be rational and the
product of two irrational number can be rational (you may see if you can find counterexamples).