Real analysis

Real analysis (traditionally, the theory of functions of a real variable) is a branch of mathematical analysis dealing with the real numbers and real-valued functions of a real variable. In particular, it deals with the analytic properties of real functions and sequences, including convergence and limits of sequences of real numbers, the calculus of the real numbers, and continuity, smoothness and related properties of real-valued functions

Scope

Construction of the real numbers

Main article: Construction of the real numbers

The theorems of real analysis rely intimately upon the structure of the real number line. The real number system consists of a set (${\displaystyle \mathbb {R} }$), together with two operations (+ and •) and an order (<), and is, formally speaking, an ordered quadruple consisting of these objects: ${\displaystyle (\mathbb {R} ,+,\bullet ,<)}$. There are several ways of formalizing the definition of the real number system. The synthetic approach gives a list of axioms for the real numbers as a complete ordered field. Under the usual axioms of set theory, one can show that these axioms are categorical, in the sense that there is a model for the axioms, and any two such models are isomorphic. Any one of these models must be explicitly constructed, and most of these models are built using the basic properties of the rational number system as an ordered field. These constructions are described in more detail in the main article.
In addition to these algebraic notions, the real numbers, equipped with the absolute value function as a metric (that is, ${\displaystyle d:\mathbb {R} \times \mathbb {R} \to \mathbb {R} _{\geq 0}}$, defined by ${\displaystyle d(x,y)=|x-y|}$), constitutes the prototypical example of a metric space. Many important theorems in real analysis (e.g., the intermediate value theorem) remain valid when they are restated as statements involving metric spaces. These theorems are frequently topological in nature, and placing them in the more abstract setting of metric spaces (or topological spaces) may lead to proofs that are shorter, more natural, or more elegant.

Order properties of the real numbers

The real numbers have several important lattice-theoretic properties that are absent in the complex numbers. Most importantly, the real numbers form an ordered field, in which addition and multiplication preserve positivity. Moreover, the ordering of the real numbers is total, and the real numbers have the least upper bound property. These order-theoretic properties lead to a number of important results in real analysis, such as the monotone convergence theorem, the intermediate value theorem and the mean value theorem.
However, while the results in real analysis are stated for real numbers, many of these results can be generalized to other mathematical objects. In particular, many ideas in functional analysis and operator theory generalize properties of the real numbers – such generalizations include the theories of Riesz spaces and positive operators. Also, mathematicians consider real and imaginary parts of complex sequences, or by pointwise evaluation of operator sequences.

Sequences

Main article: Sequence (mathematics)

A sequence is a function whose domain is a countable, totally ordered set, usually taken to be the natural numbers or whole numbers.^[1] Occasionally, it is also convenient to consider bidirectional sequences indexed by the set of all integers, including negative indices.
Of interest in real analysis, a real-valued sequence, here indexed by the natural numbers, is a map ${\displaystyle a:\mathbb {N} \to \mathbb {R} ,\ n\mapsto a_{n}}$. Each ${\displaystyle a(n)=a_{n}}$ is referred to as a term (or, less commonly, an element) of the sequence. A sequence is rarely denoted explicitly as a function; instead, by convention, it is almost always notated as if it were an ordered ∞-tuple, with individual terms or a general term enclosed in parentheses:

${\displaystyle (a_{n})=(a_{n})_{n\in \mathbb {N} }=(a_{1},a_{2},a_{3},\cdots )}$.^[2]

A sequence that tends to a limit (i.e., ${\textstyle \lim _{n\to \infty }a_{n}}$ exists) is said to be convergent; otherwise it is divergent. (See the section on limits for details) A real-valued sequence ${\displaystyle (a_{n})}$ is bounded if there exists ${\displaystyle M\in \mathbb {R} }$ such that ${\displaystyle |a_{n}|<M}$ for all ${\displaystyle n\in \mathbb {N} }$. A real-valued sequence ${\displaystyle (a_{n})}$ is monotonically increasing or decreasing if

${\displaystyle a_{1}\leq a_{2}\leq a_{3}\leq \ldots }$ or ${\displaystyle a_{1}\geq a_{2}\geq a_{3}\geq \ldots }$

holds, respectively. If either holds, the sequence is said to be monotonic.

Limits and convergence

Main article: Limit (mathematics)

A limit is the value that a function or sequence "approaches" as the input or index approaches some value.^[3] Limits are essential to calculus (and mathematical analysis in general) and are used to define continuity, derivatives, and integrals. In fact, calculus has been defined as the study of limits and limiting processes.
First proposed by Cauchy and made rigorous by Bolzano and Weierstrass, the concept of a limit allowed Newton and Leibniz's calculus to be studied in a logically sound manner, eventually giving rise to analysis as a mathematical discipline. The modern ε-δ definition of the limit of a function of a real variable is given below.
Definition. Let ${\displaystyle f}$ be a real-valued function defined on ${\displaystyle E\subset \mathbb {R} }$. We say that ${\displaystyle f(x)}$ tends to ${\displaystyle L}$ as ${\displaystyle x}$ approaches ${\displaystyle x_{0}}$, or that the limit of ${\displaystyle f(x)}$ as ${\displaystyle x}$ approaches ${\displaystyle x_{0}}$ is ${\displaystyle L}$ if, for any ${\displaystyle \epsilon >0}$, there exists ${\displaystyle \delta >0}$ such that for all ${\displaystyle x\in E}$, ${\displaystyle 0<|x-x_{0}|<\delta }$ implies that ${\displaystyle |f(x)-L|<\epsilon }$. We write this symbolically as

${\displaystyle f(x)\to L\ \ {\text{as}}\ \ x\to x_{0}}$, or ${\displaystyle \lim _{x\to x_{0}}f(x)=L}$.

Intuitively, this definition can be thought of in the following way: We say that ${\displaystyle f(x)\to L}$ as ${\displaystyle x\to x_{0}}$, when we can always find a positive number ${\displaystyle \delta }$, such that given any positive number ${\displaystyle \epsilon }$ (no matter how small), we can guarantee that ${\displaystyle f(x)}$ and ${\displaystyle L}$ are less than ${\displaystyle \epsilon }$ apart, as long as ${\displaystyle x}$ (in the domain of ${\displaystyle f}$) is a real number that is less than ${\displaystyle \delta }$ away from ${\displaystyle x_{0}}$ but distinct from ${\displaystyle x_{0}}$. The purpose of the last stipulation, which corresponds to the condition ${\displaystyle 0<|x-x_{0}|}$ in the definition, is to ensure that ${\displaystyle \lim _{x\to x_{0}}f(x)=L}$ does not imply anything about the value of ${\displaystyle f(x_{0})}$ itself. Actually, ${\displaystyle x_{0}}$ does not even need to be in the domain of ${\displaystyle f}$ in order for ${\displaystyle \lim _{x\to x_{0}}f(x)}$ to exist.
In a closely related context, the concept of a limit applies to the behavior of a sequence ${\displaystyle (a_{n})}$ when ${\displaystyle n}$ becomes large.
Definition. Let ${\displaystyle (a_{n})}$ be a real-valued sequence. We say that ${\displaystyle (a_{n})}$ converges to ${\displaystyle a}$ if, for any ${\displaystyle \epsilon >0}$, there exists an natural number ${\displaystyle N}$ such that ${\displaystyle n\geq N}$ implies that ${\displaystyle |a-a_{n}|<\epsilon }$. We write this symbolically as

${\displaystyle a_{n}\to a\ \ {\text{as}}\ \ n\to \infty }$, or ${\displaystyle \lim _{n\to \infty }a_{n}=a}$;

if ${\displaystyle (a_{n})}$ fails to converge, we say that ${\displaystyle (a_{n})}$ diverges.
Sometimes, it is useful to conclude that a sequence converges, even though the value to which it converges is unknown or irrelevant. In these cases, the concept of a Cauchy sequence is useful.
Definition. Let ${\displaystyle (a_{n})}$ be a real-valued sequence. We say that ${\displaystyle (a_{n})}$ is a Cauchy sequence if, for any ${\displaystyle \epsilon >0}$, there exists an natural number ${\displaystyle N}$ such that ${\displaystyle m,n\geq N}$ implies that ${\displaystyle |a_{m}-a_{n}|<\epsilon }$.
It can be shown that a real-valued sequence is Cauchy if and only if it is convergent. This property of the real numbers is expressed by saying that the real numbers endowed with the standard metric, ${\displaystyle (\mathbb {R} ,|\cdot |)}$, is a complete metric space. In a general metric space, however, a Cauchy sequence need not converge.
In addition, for real-valued sequences that are monotonic, it can be shown that the sequence is bounded if and only if it is convergent.

Continuity

Main article: Continuous function

A function from the set of real numbers to the real numbers can be represented by a graph in the Cartesian plane; such a function is continuous if, roughly speaking, the graph is a single unbroken curve with no "holes" or "jumps".
There are several ways to make this intuition mathematically rigorous. Several definitions of varying levels of generality can be given. In cases where two or more definitions are applicable, they are readily shown to be equivalent to one another, so the most convenient definition can be used to determine whether a given function is continuous or not. In the first definition given below, ${\displaystyle f:I\to \mathbb {R} }$ is a function defined on a non-degenerate interval ${\displaystyle I}$ of the set of real numbers as its domain. Some possibilities include ${\displaystyle I=\mathbb {R} }$, the whole set of real numbers, an open interval ${\displaystyle I=(a,b)=\{x\in \mathbb {R} \,|\,a<x<b\},}$ or a closed interval ${\displaystyle I=[a,b]=\{x\in \mathbb {R} \,|\,a\leq x\leq b\}.}$ Here, ${\displaystyle a}$ and ${\displaystyle b}$ are distinct real numbers, and we exclude the case of ${\displaystyle I}$ being empty or consisting of only one point, in particular.
Definition. If ${\displaystyle I\subset \mathbb {R} }$ is a non-degenerate interval, we say that ${\displaystyle f:I\to \mathbb {R} }$ is continuous at ${\displaystyle p\in E}$ if ${\displaystyle \lim _{x\to p}f(x)=f(p)}$. We say that ${\displaystyle f}$ is a continuous map if ${\displaystyle f}$ is continuous at every ${\displaystyle p\in I}$.
In contrast to the requirements for ${\displaystyle f}$ to have a limit at a point ${\displaystyle p}$, which do not constrain the behavior of ${\displaystyle f}$ at ${\displaystyle p}$ itself, the following two conditions, in addition to the existence of ${\textstyle \lim _{x\to p}f(x)}$, must also hold in order for ${\displaystyle f}$ to be continuous at ${\displaystyle p}$: (i) ${\displaystyle f}$ must be defined at ${\displaystyle p}$, i.e., ${\displaystyle p}$ is in the domain of ${\displaystyle f}$; and (ii) ${\displaystyle f(x)\to f(p)}$ as ${\displaystyle x\to p}$. The definition above actually applies to any domain ${\displaystyle E}$ that does not contain an isolated point, or equivalently, ${\displaystyle E}$ where every ${\displaystyle p\in E}$ is a limit point of ${\displaystyle E}$. A more general definition applying to ${\displaystyle f:X\to \mathbb {R} }$ with a general domain ${\displaystyle X\subset \mathbb {R} }$ is the following:
Definition. If ${\displaystyle X}$ is an arbitrary subset of ${\displaystyle \mathbb {R} }$, we say that ${\displaystyle f:X\to \mathbb {R} }$ is continuous at ${\displaystyle p\in X}$ if, for any ${\displaystyle \epsilon >0}$, there exists ${\displaystyle \delta >0}$ such that for all ${\displaystyle x\in X}$, ${\displaystyle |x-p|<\delta }$ implies that ${\displaystyle |f(x)-f(p)|<\epsilon }$. We say that ${\displaystyle f}$ is a continuous map if ${\displaystyle f}$ is continuous at every ${\displaystyle p\in X}$.
A consequence of this definition is that ${\displaystyle f}$ is trivially continuous at any isolated point ${\displaystyle p\in X}$. This somewhat unintuitive treatment of isolated points is necessary to ensure that our definition of continuity for functions on the real line is consistent with the most general definition of continuity for maps between topological spaces (which includes metric spaces and ${\displaystyle \mathbb {R} }$ in particular as special cases). This definition, which extends beyond the scope of our discussion of real analysis, is given below for completeness.
Definition. If ${\displaystyle X}$ and ${\displaystyle Y}$ are topological spaces, we say that ${\displaystyle f:X\to Y}$ is continuous at ${\displaystyle p\in X}$ if ${\displaystyle f^{-1}(V)}$ is a neighborhood of ${\displaystyle p}$ in ${\displaystyle X}$ for every neighborhood ${\displaystyle V}$ of ${\displaystyle f(p)}$ in ${\displaystyle Y}$. We say that ${\displaystyle f}$ is a continuous map if ${\displaystyle f^{-1}(U)}$ is open in ${\displaystyle X}$ for every ${\displaystyle U}$ open in ${\displaystyle Y}$.
(Here, ${\displaystyle f^{-1}(S)}$ refers to the preimage of ${\displaystyle S\subset Y}$ under ${\displaystyle f}$.)

Uniform continuity

Main article: Uniform continuity

Definition. If ${\displaystyle X}$ is a subset of the real numbers, we say a function ${\displaystyle f:X\to \mathbb {R} }$ is uniformly continuous on ${\displaystyle X}$ if, for any ${\displaystyle \epsilon >0}$, there exists a ${\displaystyle \delta >0}$ such that for all ${\displaystyle x,y\in X}$, ${\displaystyle |x-y|<\delta }$ implies that ${\displaystyle |f(x)-f(y)|<\epsilon }$.
Explicitly, when a function is uniformly continuous on ${\displaystyle X}$, the choice of ${\displaystyle \delta }$ needed to fulfill the definition must work for all of ${\displaystyle X}$ for a given ${\displaystyle \epsilon }$. In contrast, when a function is continuous at every point ${\displaystyle p\in X}$ (or said to be continuous on ${\displaystyle X}$), the choice of ${\displaystyle \delta }$ may depend on both ${\displaystyle \epsilon }$ and ${\displaystyle p}$. Importantly, in contrast to simple continuity, uniform continuity is a property of a function that only makes sense with a specified domain; to speak of uniform continuity at a single point ${\displaystyle p}$ is meaningless.
On a compact set, it is easily shown that all continuous functions are uniformly continuous. If ${\displaystyle E}$ is a bounded noncompact subset of ${\displaystyle \mathbb {R} }$, then there exists ${\displaystyle f:E\to \mathbb {R} }$ that is continuous but not uniformly continuous. As a simple example, consider ${\displaystyle f:(0,1)\to \mathbb {R} }$ defined by ${\displaystyle f(x)=1/x}$. By choosing points close to 0, we can always make ${\displaystyle |f(x)-f(y)|>\epsilon }$ for any single choice of ${\displaystyle \delta >0}$, for a given ${\displaystyle \epsilon >0}$.

Absolute continuity

Main article: Absolute continuity

Let ${\displaystyle I\subset \mathbb {R} }$ be an interval on the real line. A function ${\displaystyle f:I\to \mathbb {R} }$ is absolutely continuous on ${\displaystyle I}$ if for every positive number ${\displaystyle \epsilon }$, there is a positive number ${\displaystyle \delta }$ such that whenever a finite sequence of pairwise disjoint sub-intervals ${\displaystyle (x_{1},y_{1}),(x_{2},y_{2}),\ldots ,(x_{n},y_{n})}$ of ${\displaystyle I}$ satisfies^[4]

${\displaystyle \sum _{k=1}^{n}(y_{k}-x_{k})<\delta }$

then

${\displaystyle \displaystyle \sum _{k=1}^{n}|f(y_{k})-f(x_{k})|<\epsilon .}$

Absolutely continuous functions are continuous: consider the case n = 1 in this definition. The collection of all absolutely continuous functions on I is denoted AC(I).
The following conditions on a real-valued function f on a compact interval [a,b] are equivalent:^[5]

(1) f is absolutely continuous;

(2) f has a derivative f ′ almost everywhere, the derivative is Lebesgue integrable, and

${\displaystyle f(x)=f(a)+\int _{a}^{x}f'(t)\,dt}$

for all x on [a,b];

(3) there exists a Lebesgue integrable function g on [a,b] such that

${\displaystyle f(x)=f(a)+\int _{a}^{x}g(t)\,dt}$

for all x on [a,b].

If these equivalent conditions are satisfied then necessarily g = f ′ almost everywhere.
Equivalence between (1) and (3) is known as the fundamental theorem of Lebesgue integral calculus, due to Lebesgue.^[6]

Series

Main article: series (mathematics)

Given an (infinite) sequence ${\displaystyle (a_{n})}$, we can define an associated series as the formal mathematical object ${\textstyle a_{1}+a_{2}+a_{3}+\cdots =\sum _{n=1}^{\infty }a_{n}}$, sometimes simply written as ${\textstyle \sum a_{n}}$. The partial sums of a series ${\textstyle \sum a_{n}}$ are the numbers ${\textstyle s_{n}=\sum _{j=1}^{n}a_{j}}$. A series ${\textstyle \sum a_{n}}$ is said to be convergent if the sequence consisting of its partial sums, ${\displaystyle (s_{n})}$, is convergent; otherwise it is divergent. The sum of a convergent series is defined as the number ${\textstyle s=\lim _{n\to \infty }s_{n}}$.
It is to be emphasized that the word "sum" is used here in a metaphorical sense as a shorthand for taking the limit of a sequence of partial sums and should not be interpreted as simply "adding" an infinite number of terms. For instance，in contrast to the behavior of finite sums，rearranging the terms of an infinite series may result in convergence to a different number (see the article on the Riemann rearrangement theorem for further discussion).
An example of a convergent series is a geometric series which forms the basis of one of Zeno's famous paradoxes:

${\displaystyle \sum _{n=1}^{\infty }{\frac {1}{2^{n}}}={\frac {1}{2}}+{\frac {1}{4}}+{\frac {1}{8}}+\cdots =1}$.

In contrast, the harmonic series has been known since the Middle Ages to be a divergent series:

${\displaystyle \sum _{n=1}^{\infty }{\frac {1}{n}}=1+{\frac {1}{2}}+{\frac {1}{3}}+\cdots =\infty }$.

(Here, "${\displaystyle =\infty }$" is merely a notational convention to indicate that the partial sums of the series grow without bound.)
A series ${\textstyle \sum a_{n}}$ is said to converge absolutely if ${\textstyle \sum |a_{n}|}$ is convergent. A convergent series ${\textstyle \sum a_{n}}$ for which ${\textstyle \sum |a_{n}|}$ diverges is said to converge conditionally (or nonabsolutely). It is easily shown that absolute convergence of a series implies its convergence. On the other hand, an example of a conditionally convergent series is

${\displaystyle \sum _{n=1}^{\infty }{\frac {(-1)^{n-1}}{n}}=1-{\frac {1}{2}}+{\frac {1}{3}}-{\frac {1}{4}}+\cdots =\log 2}$.

Taylor series

Main article: Taylor series

The Taylor series of a real or complex-valued function ƒ(x) that is infinitely differentiable at a real or complex number a is the power series

${\displaystyle f(a)+{\frac {f'(a)}{1!}}(x-a)+{\frac {f''(a)}{2!}}(x-a)^{2}+{\frac {f^{(3)}(a)}{3!}}(x-a)^{3}+\cdots .}$

which can be written in the more compact sigma notation as

${\displaystyle \sum _{n=0}^{\infty }{\frac {f^{(n)}(a)}{n!}}\,(x-a)^{n}}$

where n! denotes the factorial of n and ƒ ⁽ⁿ⁾(a) denotes the nth derivative of ƒ evaluated at the point a. The derivative of order zero ƒ is defined to be ƒ itself and (x − a)⁰ and 0! are both defined to be 1. In the case that a = 0, the series is also called a Maclaurin series.

Fourier series

A Fourier series decomposes periodic functions or periodic signals into the sum of a (possibly infinite) set of simple oscillating functions, namely sines and cosines (or complex exponentials). The study of Fourier series is a branch of Fourier analysis.

Differentiation

Main article: Differentiation (mathematics)

Formally, the derivative of the function f at a is the limit

${\displaystyle f'(a)=\lim _{h\to 0}{\frac {f(a+h)-f(a)}{h}}}$

If the derivative exists everywhere, the function is differentiable. One can take higher derivatives as well, by iterating this process.
One can classify functions by their differentiability class. The class C⁰ consists of all continuous functions. The class C¹ consists of all differentiable functions whose derivative is continuous; such functions are called continuously differentiable. Thus, a C¹ function is exactly a function whose derivative exists and is of class C⁰. In general, the classes C^k can be defined recursively by declaring C⁰ to be the set of all continuous functions and declaring C^k for any positive integer k to be the set of all differentiable functions whose derivative is in C^k−1. In particular, C^k is contained in C^k−1 for every k, and there are examples to show that this containment is strict. C^∞ is the intersection of the sets C^k as k varies over the non-negative integers. C^ω consists of all analytic functions, and is strictly contained in C^∞.

Integration

Riemann integration

Main article: Riemann integral

The Riemann integral is defined in terms of Riemann sums of functions with respect to tagged partitions of an interval. Let [a,b] be a closed interval of the real line; then a tagged partition of [a,b] is a finite sequence

${\displaystyle a=x_{0}\leq t_{1}\leq x_{1}\leq t_{2}\leq x_{2}\leq \cdots \leq x_{n-1}\leq t_{n}\leq x_{n}=b.\,\!}$

This partitions the interval [a,b] into n sub-intervals [x_i−1, x_i] indexed by i, each of which is "tagged" with a distinguished point t_i ∈ [x_i−1, x_i]. A Riemann sum of a function f with respect to such a tagged partition is defined as

${\displaystyle \sum _{i=1}^{n}f(t_{i})\Delta _{i};}$

thus each term of the sum is the area of a rectangle with height equal to the function value at the distinguished point of the given sub-interval, and width the same as the sub-interval width. Let Δ_i = x_i−x_i−1 be the width of sub-interval i; then the mesh of such a tagged partition is the width of the largest sub-interval formed by the partition, max_i=1...n Δ_i. The Riemann integral of a function f over the interval [a,b] is equal to S if:

For all ε > 0 there exists δ > 0 such that, for any tagged partition [a,b] with mesh less than δ, we have

${\displaystyle \left|S-\sum _{i=1}^{n}f(t_{i})\Delta _{i}\right|<\varepsilon .}$

When the chosen tags give the maximum (respectively, minimum) value of each interval, the Riemann sum becomes an upper (respectively, lower) Darboux sum, suggesting the close connection between the Riemann integral and the Darboux integral