Mathematics Prelims

Basic Analysis

This page lists the definitions and theorems from basic real and general analysis that you’ll need to follow the posts here.  I’m not going to go into a lot of details about these ideas, but will give some basic definitions and statements of theorems, then link you to corresponding pages on Wikipedia to let you read some more if you’re interested.

Supremum and Infimum: We say that a set of real numbers, S \subseteq \mathbb{R}, is bounded if there exists a M \in \mathbb{R} such that for each s \in X we have |s| < M.  More generally, we say that U is an upper bound of S if s < U for each s \in S.  Similarly, L is a lower bound of S if L < s for each s \in S.  Simply saying that S is bounded means that S is both bounded above (has an upper bound) and bounded below (has a lower bound).  The supremum of S is the least upper bound of S and is denoted \sup S.  Obviously, a supremum will only exist if a set is bounded above, but that alone is not a sufficient condition for the existence of the supremum.  For example, consider the all of the rational numbers that are strictly less than \pi: S = \mathbb{Q} \cap (-\infty,\pi).  In \mathbb{Q} this set is bounded above, but no supremum exists:  For any rational number q < \pi that you find, you can always find another one that’s closer.  In the space \mathbb{R}, however, there is a least upper bound, namely \pi.  A space is said to have the completeness property if every set that is bounded above has a supremum.

The infimum is defined similarly to the supremum: the infimum of a set S is the greatest lower bound of S.  Naturally we require that S be bounded below for an infimum to exist, but just like with supremum, this isn’t enough.  It’s not difficult to show that if a set has the completeness property (so every set bounded above has a supremum), then every set that is bounded below has an infimum (just take the supremum of the set of all lower bounds).

Sequences: A sequence is simply a function whose domain is the natural numbers.  In the case of real-valued sequences, a sequence is a function s: \mathbb{N} \to \mathbb{R}.  For complex-valued sequences, it’s a function s : \mathbb{N} \to \mathbb{C}.  In some arbitrary space X, a sequence in X is a function s : \mathbb{N} \to X.  Basically, a sequence is just an ordered collection of elements of the space where elements can repeat (so it’s not simply just a subset of elements).

Countable and Uncountable: I’m just going to go ahead and link you to Wikipedia: Countably Infinite, Uncountable.

Bolzano-Weierstrass Theorem: Bolzano-Weierstrass states that every bounded real-valued sequence has a convergent subsequence.  The proof of this has two not-too-difficult parts: First you show that every monotonic sequence converges if and only if it is bounded, then you show that every bounded sequence has a monotonic subsequence.  (The actual statement of this theorem on Wikipedia is more general, but this is what I’m referring to if I say “Bolzano-Weierstrass.”)

1 Comment »

  1. [...] Analysis Page I’ve added a page on “Basic Analysis” that lists some definitions and basic theorems that you should be familiar with if [...]

    Pingback by Basic Analysis Page « Mathematics Prelims — July 15, 2008 @ 1:20 pm | Reply


RSS feed for comments on this post. TrackBack URI

Leave a comment

Blog at WordPress.com.