Scribd
Upload
133 views

Lesson Plan

1) The document proves that √2 + √3 is irrational by assuming it is rational, leading to a contradiction that √3 is rational. 2) It introduces Dedekind cuts as a way to construct the real numbers from the rational numbers, where each real number is defined as a set of rational numbers. 3) It proves several properties of real numbers under addition and multiplication, including that they are closed under these operations, and associative and commutative.

Uploaded by

Christian Dave Balasa
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
133 views

Lesson Plan

1) The document proves that √2 + √3 is irrational by assuming it is rational, leading to a contradiction that √3 is rational. 2) It introduces Dedekind cuts as a way to construct the real numbers from the rational numbers, where each real number is defined as a set of rational numbers. 3) It proves several properties of real numbers under addition and multiplication, including that they are closed under these operations, and associative and commutative.

Uploaded by

Christian Dave Balasa
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 3

The Real Numbers (Theorems)

Original Notes adopted from November 6, 2001 (Week9)

© P. Rosenthal , MAT246Y1, University of Toronto, Department of Mathematics typed by A. Ku Ong

Prove √2 + √3 is irrational
Suppose √2 + √3 rational
√2 + √3 = m/n
√2 = m/n - √3
2 = m2 /n2 – 2 m/n √3 + 3
2m/n √3 = m2 /n2 + 1
√3 = n/2m (m2 /n2 + 1)
But √3 irrational. ∴ Contradiction.
Extra problem : Is √2 + √3 + √5 rational?
Several ways of constructing real numbers from the rationals. We'll use "Dedekind cuts".
Q = set of rational numbers
Each real number will be a set of rational numbers.
-It's like the set of rationals less than the number.

0 √2
Eg. √2 = { p ∈ Q: p < 0 or p2 < 2 }

Definition: A real number x is a subset of Q such that:


1) x ≠ ∅, x ≠Q (set of all Q)
2) if p ∈ x & s ∈ Q with s < p, then s ∈ x.
3) There is no largest number x.

Eg. 3 = { p ∈ Q: p < 3 }
To each rational number m/n, associate the set {p∈Q: p < m/n } = m/n x ≤ y if x ⊂ y x < y if x ⊂ y & x ≠ y.
√2 = { p ∈ Q: p < 0 or p2 < 2 }
Is √2 a real number?
√2 ≠ ∅ (eg. 1 ∈ √2 )
√2 ≠ Q (eg. 7 ∉ √2 )
Show p ∈ √2 & q < p ⇒ q ∈ √2 Two Cases:
1) if p ≤ 0
if q < p, then q < 0, so q ∈ √2
2) if p > 0 & p ∈ √2, & if q < p,
p2 < 2,
if q < 0 , q ∈ √2
if q > 0, 0 ≤ q < p ⇒ q2 < p2
∴ q2 < 2, so q ∈ √2

Must show no largest element of √2.


Suppose p ∈ √2, show there exists q ∈ √2 with q > p.
If p ≤ 0, take q = 1.
if p > 0, p ∈ √2 ⇒ p2 < 2

( p + 1/n)2 = p2 + 2/n (p) + 1/ n2 . To show some q ∈ √2 that is bigger than p.


Want n such that p2 + 2/n (p) + 1/ n2 < 2 or 2/n (p) + 1/ n2 < 2 - p2
Choose n ∈ N large enough that
2/n (p) + 1/ n2 < 2 - p2
Let q = p + 1/n. Then q ∈ √2 & q > p
Let R denote the set of all real numbers.
Definition: If x,y ∈ R, we define x + y = { p + q: p ∈ x, q ∈ y}
Theorem: If x, y ∈ R, then (x + y) ∈ R.
Proof: Must show x + y satisfies the three properties
x + y ≠ 0, We can choose p ∈ x, q ∈ y, then p + q ∈ x + y.
To show x + y ≠ Q, pick some n ∉ x & some m ∉ y (n,m ∈ Q)
Claim: n + m ∉ x + y.
Note: If n ∉ x, n ∈ Q, then p ∈ x ⇒ p < n, for if p ≥ n, p ∈ x would imply n ∈ x ( since x has property 2).
∴p ∈ x ⇒ p < n
q∈y⇒q<m
∴ For every p ∈ x & q ∈ y, p + q < n + m
∴ n + m ∉ x + y.
Given p ∈ x + y, must show that q < p, q ∈ Q ⇒ q ∈ x + y
p = r + s, some r ∈ x, s + y.
q<r+s ∴q – r = t, some t ∈ y
q–r<s q = r + t, r ∈ x, t ∈ y ∴ q ∈ x + y.

Must show : x + y has no largest element.


Suppose p + q ∈ x + y, with p ∈ x, q ∈ y since x & y are real numbers.
There exists s ∈ x with s > p & a t ∈ y with t > q, then s + t ∈ x + y, & s + t > p + q.
∴ x + y is a real number
Define 0 = { p ∈ Q: p < 0 } Clearly 0 ∈ R.
Theorem: 0 + x = x ∀ x ∈ R.
Proof: First, to show 0 + x ⊂ x
0+x={p+q:p<0+q∈x}
If p + q ∈ 0 + x, p + q < q, q ∈ x ⇒ p + q ∈ x
∴ 0 + x ⊂ x.

To show: x ⊂ 0 + x
Suppose r ∈ x, then there exists s ∈ x with s > r.
s + ( r – s) = q + p with q ∈ x, p ∈ 0

∴ r = p + q ∈ 0 + x.
x < y if x ⊂ y & x ≠ y.

Definition: x is positive if 0 < x.


For x, y ≥ 0, we define xy = { p ∈ Q: p ≤ 0 or p = st with s > 0 & s ∈ x, t > 0 & t ∈ y } Must show: xy has
the properties of a real number.
------0--------x----------negatives-------
For x a real number,
-x ={ - p: p ∈ Q, p ∉x} taking away a largest element if there is one.
2 = { q : q < 2}
Theorem: For every x, x + (-x) = 0 Define x * 0 = 0 * x = 0 ∀ x
Define |x| = { x if x ≥ 0
{-x if x < 0
Define xy = { |x||y| if x ≥ 0 y ≥ 0
{ or if x ≤ 0, y ≤0
{-(|x||y|) if x ≥ 0 y ≤ 0
{ or x ≤ 0 & y > 0

1 = { p ∈ Q: p < 1}
Theorem :1 * x = x ∀ x
Definition: If x > 0, define 1/x ---0---1/x--------x---------
1/x = { p ∈ Q : p ≤ 0 or p = 1/q with q ∈ Q, q ∉ x } take away biggest element.
Definition: If x ≤ 0 . Define 1/x = - 1/|x|
Theorem: For all x ≠ 0, x * 1/x = 1.
Prove that addition and multiplication are associative and commutative.
Prove distributive law: x ( y + z ) = xy + xz
For any set S of real numbers, b ∈ R is an upperbound for S if x ≤ b, ∀ x ∈ S.
If each member of S is a subset of Q, b ⊂ Q, x ⊂ b ∀ x ∈ S, so b contains the union of all sets in S.
Completeness Property of R: Every subset of R other than ∅ that has an upper bound has a lub.
Proof: Suppose S ≠ ∅, b is an upperbound for S. Let c be the union of all the sets of rational numbers that
are in S. c ⊂ Q . Claim: c is the least upperbound of S.
Must Show:
1) c is a real number
2) c is an upperbound of S
3) If b any upperbound of S, b ≥ c.
1) S ≠ ∅ ⇒ c ≠ ∅.
b an upperbound for S ⇒ every member of s is contained b.
Pick r ∈ Q such that r ∉ b ( b ∈ R)
Then r ∉ c, for if r ∈ c, r ∈ x some x ∈ S.
(Then every rational less than r would be in x) (b wouldn't contain x) ∴ c ≠ Q.

If p ∈ c & q < p, p ∈ x some x ∈ R, q ⊂ p ⇒ q ∈ x ( x ∈ R) ∴ q ∈ c.


Any largest element of c would be a largest element of some x ∈ S. ∴ c ∈ R.
2) If x ∈ S, x ⊂ c, so x ≤ c.
3) If b any upperbound of S, b ⊃ x, ∀ x ∈ S
⇒ b ⊃ union of x's = c.

You might also like