23.07.2012 Views

Linear Algebra

Linear Algebra

Linear Algebra

SHOW MORE
SHOW LESS

You also want an ePaper? Increase the reach of your titles

YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.

A-6<br />

The other thing is that we sometimes use induction to go down, say, from<br />

10 to 9 to 8, etc., down to 0. This is OK—‘next number’ could mean ‘next<br />

lowest number’. Of course, at the end we have not shown the fact for all natural<br />

numbers, only for those less than or equal to 10.<br />

Contradiction. Another technique of proof is to show something is true by<br />

showing it can’t be false.<br />

The classic example is Euclid’s, that there are infinitely many primes.<br />

Suppose there are only finitely many primes p1,...,pk. Consider p1 ·<br />

p2 ...pk +1. None of the primes on this supposedly exhaustive list divides<br />

that number evenly, each leaves a remainder of 1. But every number is<br />

a product of primes so this can’t be. Thus there cannot be only finitely<br />

many primes.<br />

Every proof by contradiction has the same form—assume the proposition is<br />

false and derive some contradiction to known facts.<br />

Another example is this proof that √ 2 is not a rational number.<br />

Suppose √ 2=m/n. Then<br />

2n 2 = m 2 .<br />

Factor out the 2’s: n =2 kn · ˆn and m =2 km · ˆm. Rewrite:<br />

2 · (2 kn · ˆn) 2 =(2 km · ˆm) 2 .<br />

The Prime Factorization Theorem says there must be the same number<br />

of factors of 2 on both sides, but there are an odd number (1 + 2kn) on<br />

the left and an even number (2km) on the right. That’s a contradiction<br />

so a rational with a square of 2 cannot be.<br />

Both these examples aimed to prove something doesn’t exist. A negative<br />

proposition often suggests a proof by contradiction.<br />

Sets, Functions, and Relations<br />

Sets. The perfect squares less than 20, the roots of x 5 − 3x 3 + 2, the primes—<br />

all are collections. Mathematicians work with sets, collections that satisfy the<br />

Principle of Extensionality stated below.<br />

A set can be given as a listing between curly braces: {1, 4, 9, 16}, or, if that’s<br />

unwieldy, by using set-builder notation: {x � � x 5 − 3x 3 +2=0} (read “the set<br />

of all x such that ... ”). We name sets with capital roman letters: P =<br />

{2, 3, 5, 7, 11,...} except for the set of real numbers, written R, and the set<br />

of complex numbers, written C. To denote that something is an element (or<br />

member) of a set we use ‘ ∈ ’, so 7 ∈{3, 5, 7} while 8 �∈ {3, 5, 7}.

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

Saved successfully!

Ooh no, something went wrong!