AI summary by TwinMind

Lecture 5: The Archimedian Property, Density of the Rationals, and Absolute Value

MIT OpenCourseWare

1h 18m 12s

Theorem on Real Numbers (R)

  • Unique ordered field with least upper bound property containing rational numbers
  • Field: set with operations plus and multiplication
  • Ordered field: has order that interacts naturally with addition/multiplication
  • Least upper bound property: every non-empty subset bounded above has supremum in R
  • Rational numbers Q lack this property (example: {q ∈ Q: q² < 2} bounded above but no supremum in Q since √2 ∉ Q)

Real Numbers Properties

  • Not discrete like integers (between any two reals exists another real)
  • For x, y ∈ R with x < y, exists r ∈ R such that x < r < y where r = (x+y)/2
  • Same property holds for rationals, but question: given x, y ∈ R with x < y, does there exist r ∈ Q such that x < r < y?

Archimedean Property

  • Statement: If x, y ∈ R and x > 0, then ∃ n ∈ N such that nx > y
  • Proof by contradiction:
    • Assume ∀ n ∈ N, n ≤ y/x
    • Then N is bounded above by y/x
    • By least upper bound property, N has supremum a ∈ R
    • Since a is supremum, a-1 is not upper bound for N
    • ∃ m ∈ N such that a-1 < m
    • Therefore a < m+1, contradicting that a is upper bound for N

Density of Rationals

  • Statement: If x, y ∈ R with x < y, then ∃ r ∈ Q such that x < r < y
  • Three cases to consider:
    • Case A: x < 0 < y (choose r = 0)
    • Case B: 0 ≤ x < y (main proof)
    • Case C: x < y ≤ 0 (reduce to Case B)

Case B Proof:

  • By Archimedean property, ∃ n ∈ N such that n(y-x) > 1
  • By Archimedean property again, ∃ l ∈ N such that l > nx
  • Set S = {k ∈ N: k > nx} is non-empty
  • By well-ordering property, S has least element m
  • Since m ∈ S: nx < m
  • Since m is least in S: m-1 ≤ nx, so m ≤ nx+1
  • From n(y-x) > 1: nx+1 < ny
  • Therefore nx < m ≤ nx+1 < ny
  • Dividing by n: x < m/n < y
  • Choose r = m/n ∈ Q

Case C:

  • If x < y ≤ 0, then 0 ≤ -y < -x
  • By Case B, ∃ r̃ ∈ Q such that -y < r̃ < -x
  • Therefore x < -r̃ < y, choose r = -r̃

Characterization of Supremum

  • For non-empty S ⊆ R bounded above, x = sup S iff:
    1. x is upper bound for S
    2. ∀ ε > 0, ∃ y ∈ S such that x-ε < y ≤ x
  • Analogous characterization for infimum

Example Application

  • Theorem: sup{1 - 1/n : n ∈ N} = 1
  • Proof: 1 is upper bound since 1-1/n < 1 for all n
  • For ε > 0, by Archimedean property ∃ n such that 1/ε < n
  • Therefore 1/n < ε, so 1-ε < 1-1/n < 1
  • Both conditions satisfied, so sup = 1

Operations on Sets

  • For x ∈ R, A ⊆ R:
    • x + A = {x + a : a ∈ A}
    • x · A = {x · a : a ∈ A}
  • Theorem: If A non-empty bounded above:
    • sup(x + A) = x + sup A
    • If x > 0: sup(x · A) = x · sup A
    • If x < 0: sup(x · A) = x · inf A

Comparison of Sets

  • If A, B ⊆ R with A bounded above, B bounded below
  • If ∀ x ∈ A, ∀ y ∈ B: x ≤ y
  • Then sup A ≤ inf B

Absolute Value Properties

  • Definition: |x| = x if x ≥ 0, |x| = -x if x < 0
  • Properties proven:
    1. |x| ≥ 0; |x| = 0 iff x = 0
    2. |x| = |-x|
    3. |xy| = |x||y|
    4. |x²| = |x|²
    5. |x| ≤ y iff -y ≤ x ≤ y
    6. x ≤ |x|
  • Triangle inequality introduced but proof cut short due to time

TwinMind

Get summaries like this for your own meetings

TwinMind takes notes in the background during meetings, lectures, and calls, then writes the summary for you.

Free plan to get started

No bot joins your calls

Phone, desktop & Chrome apps

Your next meeting, summarized like this

TwinMind listens in the background and turns meetings, lectures, and calls into searchable notes you can chat with. Start free.

Available on phone, desktop & Chrome

Your next meeting, summarized like this

TwinMind listens in the background and turns meetings, lectures, and calls into searchable notes you can chat with. Start free.

Available on phone, desktop & Chrome

Your next meeting, summarized like this

TwinMind listens in the background and turns meetings, lectures, and calls into searchable notes you can chat with. Start free.

Available on phone, desktop & Chrome