06.09.2021 Views

Linear Algebra, Theory And Applications, 2012a

Linear Algebra, Theory And Applications, 2012a

Linear Algebra, Theory And Applications, 2012a

SHOW MORE
SHOW LESS

Create successful ePaper yourself

Turn your PDF publications into a flip-book with our unique Google optimized e-Paper software.

26 PRELIMINARIES<br />

Proof: If a equals a prime number, the prime factorization clearly exists. In particular<br />

the prime factorization exists for the prime number 2. Assume this theorem is true for all<br />

a ≤ n − 1. If n is a prime, then it has a prime factorization. On the other hand, if n is not<br />

a prime, then there exist two integers k and m such that n = km where each of k and m<br />

are less than n. Therefore, each of these is no larger than n − 1 and consequently, each has<br />

a prime factorization. Thus so does n. It remains to argue the prime factorization is unique<br />

except for order of the factors.<br />

Suppose<br />

n∏ m∏<br />

p i =<br />

i=1<br />

where the p i and q j are all prime, there is no way to reorder the q k such that m = n and<br />

p i = q i for all i, and n + m is the smallest positive integer such that this happens. Then<br />

by Theorem 1.9.7, p 1 |q j for some j. Since these are prime numbers this requires p 1 = q j .<br />

Reordering if necessary it can be assumed that q j = q 1 . Then dividing both sides by p 1 = q 1 ,<br />

n−1<br />

∏<br />

i=1<br />

p i+1 =<br />

j=1<br />

m−1<br />

∏<br />

j=1<br />

q j<br />

q j+1 .<br />

Since n + m was as small as possible for the theorem to fail, it follows that n − 1=m − 1<br />

and the prime numbers, q 2 , ··· ,q m can be reordered in such a way that p k = q k for all<br />

k =2, ··· ,n. Hence p i = q i for all i because it was already argued that p 1 = q 1 , and this<br />

results in a contradiction. <br />

1.10 Systems Of Equations<br />

Sometimes it is necessary to solve systems of equations. For example the problem could be<br />

to find x and y such that<br />

x + y =7and2x − y =8. (1.2)<br />

The set of ordered pairs, (x, y) which solve both equations is called the solution set. For<br />

example, you can see that (5, 2) = (x, y) is a solution to the above system. To solve this,<br />

note that the solution set does not change if any equation is replaced by a non zero multiple<br />

of itself. It also does not change if one equation is replaced by itself added to a multiple<br />

of the other equation. For example, x and y solve the above system if and only if x and y<br />

solve the system<br />

−3y=−6<br />

{ }} {<br />

x + y =7, 2x − y +(−2) (x + y) =8+(−2) (7). (1.3)<br />

The second equation was replaced by −2 times the first equation added to the second. Thus<br />

the solution is y =2, from −3y = −6 and now, knowing y =2, it follows from the other<br />

equation that x + 2 = 7 and so x =5.<br />

Why exactly does the replacement of one equation with a multiple of another added to<br />

it not change the solution set? The two equations of (1.2) are of the form<br />

E 1 = f 1 ,E 2 = f 2 (1.4)<br />

where E 1 and E 2 are expressions involving the variables. The claim is that if a is a number,<br />

then (1.4) has the same solution set as<br />

E 1 = f 1 ,E 2 + aE 1 = f 2 + af 1 . (1.5)

Hooray! Your file is uploaded and ready to be published.

Saved successfully!

Ooh no, something went wrong!