Œ0 !!! 0 b !

!
1 "3 "5 0
"

0 1 "1 "1

x1 " 2x2 " x3 C 3x4 D 0

"2x1 C 4x2 C 5x3 " 5x4 D 3

3x1 " 6x2 " 6x3 C 8x4 D 2

4#7

2 3 2 3

2 3 2 3 1 0 0 0
60
1 1 0 1 1
1 0 0 0 1 0 1 0 60 1 1 07 2 0 2 27

40 1 0 05 40 1 1 05
6
40 0 0 05
7 6
40 0 0 3 35
7

0 0 1 1 0 0 0 1 0 0 0 1 0 0 0 0 4

Problem Set 2

Lay 1.2

re and

rowechelon

echelon
hot

echelon

echelon

E E 33 E I

57 Bottom

E E ge

cities

O O 4 8 12

I 70 65

X Xz

X 7 2 3 3 4 basic

Xz 2 4 3 Xz Xy

3 12 4
free

X 7Xz 3 3 4

7 2 3631

24

7 21 9 6

4 47

X isfree

Xy is free

312

Xz 4

1 7 6
2 4 15


false

false

true

true

Any nonzero matrix may be row reduced (that is, transformed by elementary row operations) into
more than one matrix in echelon form, using different sequences of row operations.

When row operations on a matrix produce an echelon form, further row operations to obtain the
reduced echelon form do not change the positions of the leading entries

The algorithm that follows consists of four steps, and it produces a matrix in echelon form.

The combination of steps 1–4 is called the forward phase of the row reduction algorithm.

The statement “x3 is free” means that you are free to choose any value for x3.Each different choice
of x3 determines a (different) solution of the system, and every solution of the system is determined
by a choice of x3.

no pivot in last columnof avg matrix

unless my element
O
 2 3 2 3 2 3
1 1 0 1 1 1 0 0 $ $
40 0 1 15 40 1 1 05 40 $5
0 0 0 0 0 0 1 1 0 0 0
2 3 2 3
1 0 0 0 $ $ $ $
61 1 0 07 40 0 $ $5
6 7
40 1 1 05 0 0 0 $
0 0 1 1
2 3 h
0 1 1 1 1
60 0 2 2 27 ! " ! "
6 7 2 3 h 1 "3 "2
40 0 0 0 35
4 6 7 5 h "7
0 0 0 0 0
h k

2 3 2 3 x1 C hx2 D 2 x1 C 3x2 D 2
1 2 3 4 1 3 5 7
44 4x1 C 8x2 D k 3x1 C hx2 D k
5 6 75 43 5 7 95
6 7 8 9 5 7 9 1
2#2
$

3#2

! " ! "
1 3 4 7 1 4 0 7
3 9 7 6 2 7 0 10
! " ! "
0 1 "6 5 1 "2 "1 3
1 "2 7 "6 3 "6 "2 2
2 3 2 3
3 "4 2 0 1 "7 0 6 5 Œ0 0 0 5 0!
4 "9 12 "6 05 4 0 0 1 "2 "3 5
"6 8 "4 0 "1 7 "4 2 7
2 3
1 "3 0 "1 0 "2
60 1 0 0 "4 17
6 7
40 0 0 1 9 45
0 0 0 0 0 0
2 3
1 2 "5 "6 0 "5
60 1 "6 "3 0 27
6 7
40 0 0 0 1 05
0 0 0 0 0 0

3#5

2 3 3#5
$ $ $
40 $ $5
0 0 0
2 3
0 $ $ $ 4
40 0 $ $5
0 0 0 0
 WEB

p.t/ D a0 C a1 t C a2 t 2
.1; 12/ .2; 15/ .3; 16/ a0 a1
a2
a0 C a1 .1/ C a2 .1/2 D 12
a0 C a1 .2/ C a2 .2/2 D 15
a0 C a1 .3/ C a2 .3/2 D 16

p.t/ D a0 C a1 t C a2 t 2 C a3 t 3 C a4 t 4
C a5 t 5
5
n # .n C 1/

n D 30 n D 300

x3

! "
1 0 "8 "3 x1 " 8x3 D "3
0 1 "1 "1 x2 " x3 D "1

x1 x1 x2
x2 8̂
<x1 D "3 C 8x3
x2 D "1 C x3
:̂
x3

8̂
<x1 D "3 C 8x3
x2 D "1 C x3
:̂
x3 D 1 C x2

x2 x3
Math 22a The Joy of Sets Fall 2020

1. Let A = {12n n 2 Z}, and let B = {k 2 Z k is even}, and let C = {3j j 2 Z}. Show
that A ⇢ B \ C. That is, show that if x 2 A, then x 2 B and x 2 C.
Let’s start with some notation and visual intuition. Generally speaking we’ll be drawing an example
as below, with A and B as subsets of a larger “universe” S.

B S
A

Operation Expression Picture Description

B S
A
Intersection A\B x 2 A \ B if x 2 A and x 2 B.

B S
A
Set di↵erence ArB x 2 A r B if x 2 A and x 62 B.

B S
0
A
Complement c
A (or A or A) x 2 A0 if x 62 A.

B S
Subset A ⇢ B (or B A) A x 2 A =) x 2 B.
For each of the following, determine whether the statement is true for all sets A, B and C. If
an equality fails, determine whether one or the other of the possible inclusions holds. Prove your
assertions.

2. (A \ B) [ (A r B) = A

3. A [ (B r C) = (A [ B) r (A [ C)

4. Suppose A = {k 2 Z | 3|k} and B = {2k | k 2 Z} are subsets of Z. Describe (a) (A [ B)0 and
(b) (A \ B)0 .
Math 22a Proof Methods Fall 2020

1. Give a direct proof of the following statements.

(a) Recall that, for natural numbers n and k with k  n, the binomial coefficient is defined
as nk = k! (nn! k)! . Show that, if n 2 is an integer, that n2 = 2 n2 + n1 .

(b) If x is an integer and x2 |x, then x 2 { 1, 0, 1}.

2. Give a contrapositive proof of the following statements.

(a) Suppose x and y are integers. If 3 6 | xy, then 3 6 | x and 3 6 | y.

(b) (Hammack Problem 5.6) Suppose x is a real number. If x3 x > 0, then x > 1.

(c) (Hammack Problem 5.7) Suppose a and b are integers. If both ab and a + b are even,
then both a and b are even.
Prove the following using proof by contradiction.
p
3. 2 is irrational.

4. There are infinitely many prime numbers.

5. (Basically Hammack Problem 6.16)1 Suppose x and y are non-negative real numbers. Then
x+y p
xy
2
p
or, equivalently, x + y 2 xy.

1 x+y
This is also called the AM-GM Inequality, as it says that the Arithmetic Mean is always greater than or
p 2
equal to the Geometeric Mean xy.