Real analysis

Not to be confused with Reanalysis.

Mathematics of real numbers and real functions

Part of a series on

Mathematics

* History
* Index

Areas

* Number theory
* Geometry
* Algebra
* Calculus and Analysis
* Discrete mathematics
* Logic
* Set theory
* Probability
* Statistics and Decision theory

Relationship with sciences

* Physics
* Chemistry
* Geosciences
* Computation
* Biology
* Linguistics
* Economics
* Philosophy
* Education

Mathematics Portal

* v
* t
* e

In mathematics, the branch of real analysis studies the behavior of real numbers, sequences and series of real numbers, and real functions.[1] Some particular properties of real-valued sequences and functions that real analysis studies include convergence, limits, continuity, smoothness, differentiability and integrability.

Real analysis is distinguished from complex analysis, which deals with the study of complex numbers and their functions.

## Scope

[edit]

### Construction of the real numbers

[edit]

Main article: Construction of the real numbers

The theorems of real analysis rely on the properties of the (established) real number system. The real number system consists of an uncountable set ( R {\displaystyle \mathbb {R} } ), together with two binary operations denoted + and  ⋅ {\displaystyle \cdot } , and a total order denoted ≤. The operations make the real numbers a field, and, along with the order, an ordered field. The real number system is the unique complete ordered field, in the sense that any other complete ordered field is isomorphic to it. Intuitively, completeness means that there are no 'gaps' (or 'holes') in the real numbers. This property distinguishes the real numbers from other ordered fields (e.g., the rational numbers  Q {\displaystyle \mathbb {Q} } ) and is critical to the proof of several key properties of functions of the real numbers. The completeness of the reals is often conveniently expressed as the least upper bound property (see below).

### Order properties of the real numbers

[edit]

The real numbers have various lattice-theoretic properties that are absent in the complex numbers. Also, the real numbers form an ordered field, in which sums and products of positive numbers are also positive. Moreover, the ordering of the real numbers is total, and the real numbers have the least upper bound property:

> Every nonempty subset of  R {\displaystyle \mathbb {R} } that has an upper bound has a least upper bound that is also a real number.

These order-theoretic properties lead to a number of fundamental 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.[clarification needed]

### Topological properties of the real numbers

[edit]

Many of the theorems of real analysis are consequences of the topological properties of the real number line. The order properties of the real numbers described above are closely related to these topological properties. As a topological space, the real numbers has a standard topology, which is the order topology induced by order  < {\displaystyle <} . Alternatively, by defining the metric or distance function d : R × R -> R ≥ 0 {\displaystyle d:\mathbb {R} \times \mathbb {R} \to \mathbb {R} _{\geq 0}} using the absolute value function as  d ( x , y ) = | x − y | {\displaystyle d(x,y)=|x-y|} , the real numbers become the prototypical example of a metric space. The topology induced by metric  d {\displaystyle d} turns out to be identical to the standard topology induced by order  < {\displaystyle <} . Theorems like the intermediate value theorem that are essentially topological in nature can often be proved in the more general setting of metric or topological spaces rather than in  R {\displaystyle \mathbb {R} } only. Often, such proofs tend to be shorter or simpler compared to classical proofs that apply direct methods.

### Sequences

[edit]

Main article: Sequence

A sequence is a function whose domain is a countable, totally ordered set.[2] The domain is usually taken to be the natural numbers,[3] although it is occasionally convenient to also 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  a : N -> R : n ↦ a n {\displaystyle a:\mathbb {N} \to \mathbb {R} :n\mapsto a_{n}} . Each  a ( n ) = a n {\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:[4] ( a n ) = ( a n ) n ∈ N = ( a 1 , a 2 , a 3 , … ) . {\displaystyle (a_{n})=(a_{n})_{n\in \mathbb {N} }=(a_{1},a_{2},a_{3},\dots ).} A sequence that tends to a limit (i.e.,  lim n -> ∞ a n {\textstyle \lim _{n\to \infty }a_{n}} exists) is said to be convergent; otherwise it is divergent. (See the section on limits and convergence for details.) A real-valued sequence  ( a n ) {\displaystyle (a_{n})} is bounded if there exists  M ∈ R {\displaystyle M\in \mathbb {R} } such that  | a n | < M {\displaystyle |a_{n}|<M} for all  n ∈ N {\displaystyle n\in \mathbb {N} } . A real-valued sequence  ( a n ) {\displaystyle (a_{n})} is monotonically increasing or decreasing if  a 1 ≤ a 2 ≤ a 3 ≤ ⋯ {\displaystyle a_{1}\leq a_{2}\leq a_{3}\leq \cdots } or  a 1 ≥ a 2 ≥ a 3 ≥ ⋯ {\displaystyle a_{1}\geq a_{2}\geq a_{3}\geq \cdots } holds, respectively. If either holds, the sequence is said to be monotonic. The monotonicity is strict if the chained inequalities still hold with  ≤ {\displaystyle \leq } or  ≥ {\displaystyle \geq } replaced by < or >.

Given a sequence  ( a n ) {\displaystyle (a_{n})} , another sequence  ( b k ) {\displaystyle (b_{k})} is a subsequence of  ( a n ) {\displaystyle (a_{n})} if  b k = a n k {\displaystyle b_{k}=a_{n_{k}}} for all positive integers  k {\displaystyle k} and  ( n k ) {\displaystyle (n_{k})} is a strictly increasing sequence of natural numbers.

### Limits and convergence

[edit]

Main article: Limit (mathematics)

Roughly speaking, a limit is the value that a function or a sequence "approaches" as the input or index approaches some value.[5] (This value can include the symbols  ± ∞ {\displaystyle \pm \infty } when addressing the behavior of a function or sequence as the variable increases or decreases without bound.) The idea of a limit is fundamental to calculus (and mathematical analysis in general) and its formal definition is used in turn to define notions like continuity, derivatives, and integrals. (In fact, the study of limiting behavior has been used as a characteristic that distinguishes calculus and mathematical analysis from other branches of mathematics.)

The concept of limit was informally introduced for functions by Newton and Leibniz, at the end of the 17th century, for building infinitesimal calculus. For sequences, the concept was introduced by Cauchy, and made rigorous, at the end of the 19th century by Bolzano and Weierstrass, who gave the modern ε-δ definition, which follows.

Definition. Let  f {\displaystyle f} be a real-valued function defined on  E ⊂ R {\displaystyle E\subset \mathbb {R} } . We say that  f ( x ) {\displaystyle f(x)} tends to  L {\displaystyle L} as  x {\displaystyle x} approaches  x 0 {\displaystyle x_{0}} , or that the limit of  f ( x ) {\displaystyle f(x)} as  x {\displaystyle x} approaches  x 0 {\displaystyle x_{0}} is  L {\displaystyle L} if, for any  ε > 0 {\displaystyle \varepsilon >0} , there exists  δ > 0 {\displaystyle \delta >0} such that for all  x ∈ E {\displaystyle x\in E} ,  0 < | x − x 0 | < δ {\displaystyle 0<|x-x_{0}|<\delta } implies that  | f ( x ) − L | < ε {\displaystyle |f(x)-L|<\varepsilon } . We write this symbolically as  f ( x ) -> L as x -> x 0 , {\displaystyle f(x)\to L\ \ {\text{as}}\ \ x\to x_{0},} or as  lim x -> x 0 f ( x ) = L . {\displaystyle \lim _{x\to x_{0}}f(x)=L.} Intuitively, this definition can be thought of in the following way: We say that  f ( x ) -> L {\displaystyle f(x)\to L} as  x -> x 0 {\displaystyle x\to x_{0}} , when, given any positive number  ε {\displaystyle \varepsilon } , no matter how small, we can always find a  δ {\displaystyle \delta } , such that we can guarantee that  f ( x ) {\displaystyle f(x)} and  L {\displaystyle L} are less than  ε {\displaystyle \varepsilon } apart, as long as  x {\displaystyle x} (in the domain of  f {\displaystyle f} ) is a real number that is less than  δ {\displaystyle \delta } away from  x 0 {\displaystyle x_{0}} but distinct from  x 0 {\displaystyle x_{0}} . The purpose of the last stipulation, which corresponds to the condition  0 < | x − x 0 | {\displaystyle 0<|x-x_{0}|} in the definition, is to ensure that  lim x -> x 0 f ( x ) = L {\textstyle \lim _{x\to x_{0}}f(x)=L} does not imply anything about the value of  f ( x 0 ) {\displaystyle f(x_{0})} itself. Actually,  x 0 {\displaystyle x_{0}} does not even need to be in the domain of  f {\displaystyle f} in order for  lim x -> x 0 f ( x ) {\textstyle \lim _{x\to x_{0}}f(x)} to exist.

In a slightly different but related context, the concept of a limit applies to the behavior of a sequence  ( a n ) {\displaystyle (a_{n})} when  n {\displaystyle n} becomes large.

Definition. Let  ( a n ) {\displaystyle (a_{n})} be a real-valued sequence. We say that  ( a n ) {\displaystyle (a_{n})} converges to a {\displaystyle a} if, for any  ε > 0 {\displaystyle \varepsilon >0} , there exists a natural number  N {\displaystyle N} such that  n ≥ N {\displaystyle n\geq N} implies that  | a − a n | < ε {\displaystyle |a-a_{n}|<\varepsilon } . We write this symbolically as  a n -> a as n -> ∞ , {\displaystyle a_{n}\to a\ \ {\text{as}}\ \ n\to \infty ,} or as lim n -> ∞ a n = a ; {\displaystyle \lim _{n\to \infty }a_{n}=a;} if  ( a n ) {\displaystyle (a_{n})} fails to converge, we say that  ( a n ) {\displaystyle (a_{n})} diverges.

Generalizing to a real-valued function of a real variable, a slight modification of this definition (replacement of sequence  ( a n ) {\displaystyle (a_{n})} and term  a n {\displaystyle a_{n}} by function  f {\displaystyle f} and value  f ( x ) {\displaystyle f(x)} and natural numbers  N {\displaystyle N} and  n {\displaystyle n} by real numbers  M {\displaystyle M} and  x {\displaystyle x} , respectively) yields the definition of the limit of  f ( x ) {\displaystyle f(x)} as  x {\displaystyle x} increases without bound, notated  lim x -> ∞ f ( x ) {\textstyle \lim _{x\to \infty }f(x)} . Reversing the inequality  x ≥ M {\displaystyle x\geq M} to  x ≤ M {\displaystyle x\leq M} gives the corresponding definition of the limit of  f ( x ) {\displaystyle f(x)} as  x {\displaystyle x} decreases without bound,  lim x -> − ∞ f ( x ) {\textstyle \lim _{x\to -\infty }f(x)} .

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  ( a n ) {\displaystyle (a_{n})} be a real-valued sequence. We say that  ( a n ) {\displaystyle (a_{n})} is a Cauchy sequence if, for any  ε > 0 {\displaystyle \varepsilon >0} , there exists a natural number  N {\displaystyle N} such that  m , n ≥ N {\displaystyle m,n\geq N} implies that  | a m − a n | < ε {\displaystyle |a_{m}-a_{n}|<\varepsilon } .

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,  ( R , | ⋅ | ) {\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.

#### Uniform and pointwise convergence for sequences of functions

[edit]

Main article: Uniform convergence

In addition to sequences of numbers, one may also speak of sequences of functions on E ⊂ R {\displaystyle E\subset \mathbb {R} } , that is, infinite, ordered families of functions  f n : E -> R {\displaystyle f_{n}:E\to \mathbb {R} } , denoted  ( f n ) n = 1 ∞ {\displaystyle (f_{n})_{n=1}^{\infty }} , and their convergence properties. However, in the case of sequences of functions, there are two kinds of convergence, known as pointwise convergence and uniform convergence, that need to be distinguished.

Roughly speaking, pointwise convergence of functions  f n {\displaystyle f_{n}} to a limiting function  f : E -> R {\displaystyle f:E\to \mathbb {R} } , denoted  f n -> f {\displaystyle f_{n}\rightarrow f} , simply means that given any  x ∈ E {\displaystyle x\in E} ,  f n ( x ) -> f ( x ) {\displaystyle f_{n}(x)\to f(x)} as  n -> ∞ {\displaystyle n\to \infty } . In contrast, uniform convergence is a stronger type of convergence, in the sense that a uniformly convergent sequence of functions also converges pointwise, but not conversely. Uniform convergence requires members of the family of functions,  f n {\displaystyle f_{n}} , to fall within some error  ε > 0 {\displaystyle \varepsilon >0} of  f {\displaystyle f} for every value of  x ∈ E {\displaystyle x\in E} , whenever  n ≥ N {\displaystyle n\geq N} , for some integer  N {\displaystyle N} . For a family of functions to uniformly converge, sometimes denoted  f n ⇉ f {\displaystyle f_{n}\rightrightarrows f} , such a value of  N {\displaystyle N} must exist for any  ε > 0 {\displaystyle \varepsilon >0} given, no matter how small. Intuitively, we can visualize this situation by imagining that, for a large enough  N {\displaystyle N} , the functions  f N , f N + 1 , f N + 2 , … {\displaystyle f_{N},f_{N+1},f_{N+2},\ldots } are all confined within a 'tube' of width  2 ε {\displaystyle 2\varepsilon } about  f {\displaystyle f} (that is, between  f − ε {\displaystyle f-\varepsilon } and  f + ε {\displaystyle f+\varepsilon } ) for every value in their domain E {\displaystyle E} .

The distinction between pointwise and uniform convergence is important when exchanging the order of two limiting operations (e.g., taking a limit, a derivative, or integral) is desired: in order for the exchange to be well-behaved, many theorems of real analysis call for uniform convergence. For example, a sequence of continuous functions (see below) is guaranteed to converge to a continuous limiting function if the convergence is uniform, while the limiting function may not be continuous if convergence is only pointwise. Karl Weierstrass is generally credited for clearly defining the concept of uniform convergence and fully investigating its implications.

### Compactness

[edit]

Main article: Compactness

Compactness is a concept from general topology that plays an important role in many of the theorems of real analysis. The property of compactness is a generalization of the notion of a set being closed and bounded. (In the context of real analysis, these notions are equivalent: a set in Euclidean space is compact if and only if it is closed and bounded.) Briefly, a closed set contains all of its boundary points, while a set is bounded if there exists a real number such that the distance between any two points of the set is less than that number. In  R {\displaystyle \mathbb {R} } , sets that are closed and bounded, and therefore compact, include the empty set, any finite number of points, closed intervals, and their finite unions. However, this list is not exhaustive; for instance, the set  { 1 / n : n ∈ N } ∪ { 0 } {\displaystyle \\{1/n:n\in \mathbb {N} \\}\cup \\{0}\\} is a compact set; the Cantor ternary set C ⊂ [ 0 , 1 ] {\displaystyle {\mathcal {C}}\subset [0,1]} is another example of a compact set. On the other hand, the set  { 1 / n : n ∈ N } {\displaystyle \\{1/n:n\in \mathbb {N} \\}} is not compact because it is bounded but not closed, as the boundary point 0 is not a member of the set. The set  [ 0 , ∞ ) {\displaystyle [0,\infty )} is also not compact because it is closed but not bounded.

For subsets of the real numbers, there are several equivalent definitions of compactness.

Definition. A set  E ⊂ R {\displaystyle E\subset \mathbb {R} } is compact if it is closed and bounded.

This definition also holds for Euclidean space of any finite dimension,  R n {\displaystyle \mathbb {R} ^{n}} , but it is not valid for metric spaces in general. The equivalence of the definition with the definition of compactness based on subcovers, given later in this section, is known as the Heine-Borel theorem.

A more general definition that applies to all metric spaces uses the notion of a subsequence (see above).

Definition. A set  E {\displaystyle E} in a metric space is compact if every sequence in  E {\displaystyle E} has a convergent subsequence.

This particular property is known as subsequential compactness. In  R {\displaystyle \mathbb {R} } , a set is subsequentially compact if and only if it is closed and bounded, making this definition equivalent to the one given above. Subsequential compactness is equivalent to the definition of compactness based on subcovers for metric spaces, but not for topological spaces in general.

The most general definition of compactness relies on the notion of open covers and subcovers, which is applicable to topological spaces (and thus to metric spaces and  R {\displaystyle \mathbb {R} } as special cases). In brief, a collection of open sets  U α {\displaystyle U_{\alpha }} is said to be an open cover of set  X {\displaystyle X} if the union of these sets is a superset of  X {\displaystyle X} . This open cover is said to have a finite subcover if a finite subcollection of the  U α {\displaystyle U_{\alpha }} could be found that also covers  X {\displaystyle X} .

Definition. A set  X {\displaystyle X} in a topological space is compact if every open cover of  X {\displaystyle X} has a finite subcover.

Compact sets are well-behaved with respect to properties like convergence and continuity. For instance, any Cauchy sequence in a compact metric space is convergent. As another example, the image of a compact metric space under a continuous map is also compact.

### Continuity

[edit]

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,  f : I -> R {\displaystyle f:I\to \mathbb {R} } is a function defined on a non-degenerate interval  I {\displaystyle I} of the set of real numbers as its domain. Some possibilities include  I = R {\displaystyle I=\mathbb {R} } , the whole set of real numbers, an open interval I = ( a , b ) = { x ∈ R ∣ a < x < b } , {\displaystyle I=(a,b)=\\{x\in \mathbb {R} \mid a<x<b\\},} or a closed interval I = [ a , b ] = { x ∈ R ∣ a ≤ x ≤ b } . {\displaystyle I=[a,b]=\\{x\in \mathbb {R} \mid a\leq x\leq b\\}.} Here,  a {\displaystyle a} and  b {\displaystyle b} are distinct real numbers, and we exclude the case of  I {\displaystyle I} being empty or consisting of only one point, in particular.

Definition. If  I ⊂ R {\displaystyle I\subset \mathbb {R} } is a non-degenerate interval, we say that  f : I -> R {\displaystyle f:I\to \mathbb {R} } is continuous at p ∈ I {\displaystyle p\in I} if  lim x -> p f ( x ) = f ( p ) {\textstyle \lim _{x\to p}f(x)=f(p)} . We say that  f {\displaystyle f} is a continuous map if  f {\displaystyle f} is continuous at every  p ∈ I {\displaystyle p\in I} .

In contrast to the requirements for  f {\displaystyle f} to have a limit at a point  p {\displaystyle p} , which do not constrain the behavior of  f {\displaystyle f} at  p {\displaystyle p} itself, the following two conditions, in addition to the existence of  lim x -> p f ( x ) {\textstyle \lim _{x\to p}f(x)} , must also hold in order for  f {\displaystyle f} to be continuous at  p {\displaystyle p} : (i) f {\displaystyle f} must be defined at  p {\displaystyle p} , i.e.,  p {\displaystyle p} is in the domain of  f {\displaystyle f} ; and (ii) f ( x ) -> f ( p ) {\displaystyle f(x)\to f(p)} as  x -> p {\displaystyle x\to p} . The definition above actually applies to any domain  E {\displaystyle E} that does not contain an isolated point, or equivalently,  E {\displaystyle E} where every  p ∈ E {\displaystyle p\in E} is a limit point of  E {\displaystyle E} . A more general definition applying to  f : X -> R {\displaystyle f:X\to \mathbb {R} } with a general domain  X ⊂ R {\displaystyle X\subset \mathbb {R} } is the following:

Definition. If  X {\displaystyle X} is an arbitrary subset of  R {\displaystyle \mathbb {R} } , we say that  f : X -> R {\displaystyle f:X\to \mathbb {R} } is continuous at p ∈ X {\displaystyle p\in X} if, for any  ε > 0 {\displaystyle \varepsilon >0} , there exists  δ > 0 {\displaystyle \delta >0} such that for all  x ∈ X {\displaystyle x\in X} ,  | x − p | < δ {\displaystyle |x-p|<\delta } implies that  | f ( x ) − f ( p ) | < ε {\displaystyle |f(x)-f(p)|<\varepsilon } . We say that  f {\displaystyle f} is a continuous map if  f {\displaystyle f} is continuous at every  p ∈ X {\displaystyle p\in X} .

A consequence of this definition is that  f {\displaystyle f} is trivially continuous at any isolated point p ∈ X {\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  R {\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  X {\displaystyle X} and  Y {\displaystyle Y} are topological spaces, we say that  f : X -> Y {\displaystyle f:X\to Y} is continuous at p ∈ X {\displaystyle p\in X} if  f − 1 ( V ) {\displaystyle f^{-1}(V)} is a neighborhood of  p {\displaystyle p} in  X {\displaystyle X} for every neighborhood  V {\displaystyle V} of  f ( p ) {\displaystyle f(p)} in  Y {\displaystyle Y} . We say that  f {\displaystyle f} is a continuous map if  f − 1 ( U ) {\displaystyle f^{-1}(U)} is open in  X {\displaystyle X} for every  U {\displaystyle U} open in  Y {\displaystyle Y} .

(Here,  f − 1 ( S ) {\displaystyle f^{-1}(S)} refers to the preimage of  S ⊂ Y {\displaystyle S\subset Y} under  f {\displaystyle f} .)

#### Uniform continuity

[edit]

Main article: Uniform continuity

Definition. If  X {\displaystyle X} is a subset of the real numbers, we say a function  f : X -> R {\displaystyle f:X\to \mathbb {R} } is uniformly continuous on X {\displaystyle X} if, for any  ε > 0 {\displaystyle \varepsilon >0} , there exists a  δ > 0 {\displaystyle \delta >0} such that for all  x , y ∈ X {\displaystyle x,y\in X} ,  | x − y | < δ {\displaystyle |x-y|<\delta } implies that  | f ( x ) − f ( y ) | < ε {\displaystyle |f(x)-f(y)|<\varepsilon } .

Explicitly, when a function is uniformly continuous on  X {\displaystyle X} , the choice of  δ {\displaystyle \delta } needed to fulfill the definition must work for all of X {\displaystyle X} for a given  ε {\displaystyle \varepsilon } . In contrast, when a function is continuous at every point  p ∈ X {\displaystyle p\in X} (or said to be continuous on  X {\displaystyle X} ), the choice of  δ {\displaystyle \delta } may depend on both  ε {\displaystyle \varepsilon } and p {\displaystyle p} . 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  p {\displaystyle p} is meaningless.

On a compact set, it is easily shown that all continuous functions are uniformly continuous. If  E {\displaystyle E} is a bounded noncompact subset of  R {\displaystyle \mathbb {R} } , then there exists  f : E -> R {\displaystyle f:E\to \mathbb {R} } that is continuous but not uniformly continuous. As a simple example, consider  f : ( 0 , 1 ) -> R {\displaystyle f:(0,1)\to \mathbb {R} } defined by  f ( x ) = 1 / x {\displaystyle f(x)=1/x} . By choosing points close to 0, we can always make  | f ( x ) − f ( y ) | > ε {\displaystyle |f(x)-f(y)|>\varepsilon } for any single choice of  δ > 0 {\displaystyle \delta >0} , for a given  ε > 0 {\displaystyle \varepsilon >0} .

#### Absolute continuity

[edit]

Main article: Absolute continuity

Definition. Let  I ⊂ R {\displaystyle I\subset \mathbb {R} } be an interval on the real line. A function  f : I -> R {\displaystyle f:I\to \mathbb {R} } is said to be absolutely continuous on I {\displaystyle I} if for every positive number  ε {\displaystyle \varepsilon } , there is a positive number  δ {\displaystyle \delta } such that whenever a finite sequence of pairwise disjoint sub-intervals  ( x 1 , y 1 ) , ( x 2 , y 2 ) , … , ( x n , y n ) {\displaystyle (x_{1},y_{1}),(x_{2},y_{2}),\ldots ,(x_{n},y_{n})} of  I {\displaystyle I} satisfies[6]

∑ k = 1 n ( y k − x k ) < δ {\displaystyle \sum _{k=1}^{n}(y_{k}-x_{k})<\delta }

then

∑ k = 1 n | f ( y k ) − f ( x k ) | < ε . {\displaystyle \sum _{k=1}^{n}|f(y_{k})-f(x_{k})|<\varepsilon .}

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). Absolute continuity is a fundamental concept in the Lebesgue theory of integration, allowing the formulation of a generalized version of the fundamental theorem of calculus that applies to the Lebesgue integral.

### Differentiation

[edit]

Main articles: Derivative and Differential calculus

The notion of the derivative of a function or differentiability originates from the concept of approximating a function near a given point using the "best" linear approximation. This approximation, if it exists, is unique and is given by the line that is tangent to the function at the given point  a {\displaystyle a} , and the slope of the line is the derivative of the function at  a {\displaystyle a} .

A function  f : R -> R {\displaystyle f:\mathbb {R} \to \mathbb {R} } is differentiable at  a {\displaystyle a} if the limit

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

exists. This limit is known as the derivative of  f {\displaystyle f} at  a {\displaystyle a} , and the function  f ′ {\displaystyle f'} , possibly defined on only a subset of  R {\displaystyle \mathbb {R} } , is the derivative (or derivative function) of f {\displaystyle f} . If the derivative exists everywhere, the function is said to be differentiable.

As a simple consequence of the definition,  f {\displaystyle f} is continuous at  a {\displaystyle a} if it is differentiable there. Differentiability is therefore a stronger regularity condition (condition describing the "smoothness" of a function) than continuity, and it is possible for a function to be continuous on the entire real line but not differentiable anywhere (see Weierstrass's nowhere differentiable continuous function). It is possible to discuss the existence of higher-order derivatives as well, by finding the derivative of a derivative function, and so on.

One can classify functions by their differentiability class. The class  C 0 {\displaystyle C^{0}} (sometimes  C 0 ( [ a , b ] ) {\displaystyle C^{0}([a,b])} to indicate the interval of applicability) consists of all continuous functions. The class  C 1 {\displaystyle C^{1}} consists of all differentiable functions whose derivative is continuous; such functions are called continuously differentiable. Thus, a  C 1 {\displaystyle C^{1}} function is exactly a function whose derivative exists and is of class  C 0 {\displaystyle C^{0}} . In general, the classes  C k {\displaystyle C^{k}} can be defined recursively by declaring  C 0 {\displaystyle C^{0}} to be the set of all continuous functions and declaring  C k {\displaystyle C^{k}} for any positive integer  k {\displaystyle k} to be the set of all differentiable functions whose derivative is in  C k − 1 {\displaystyle C^{k-1}} . In particular,  C k {\displaystyle C^{k}} is contained in  C k − 1 {\displaystyle C^{k-1}} for every  k {\displaystyle k} , and there are examples to show that this containment is strict. Class  C ∞ {\displaystyle C^{\infty }} is the intersection of the sets  C k {\displaystyle C^{k}} as  k {\displaystyle k} varies over the non-negative integers, and the members of this class are known as the smooth functions. Class  C ω {\displaystyle C^{\omega }} consists of all analytic functions, and is strictly contained in  C ∞ {\displaystyle C^{\infty }} (see bump function for a smooth function that is not analytic).

### Series

[edit]

Main article: Series (mathematics)

A series formalizes the imprecise notion of taking the sum of an endless sequence of numbers. The idea that taking the sum of an "infinite" number of terms can lead to a finite result was counterintuitive to the ancient Greeks and led to the formulation of a number of paradoxes by Zeno and other philosophers. The modern notion of assigning a value to a series avoids dealing with the ill-defined notion of adding an "infinite" number of terms. Instead, the finite sum of the first  n {\displaystyle n} terms of the sequence, known as a partial sum, is considered, and the concept of a limit is applied to the sequence of partial sums as  n {\displaystyle n} grows without bound. The series is assigned the value of this limit, if it exists.

Given an (infinite) sequence ( a n ) {\displaystyle (a_{n})} , we can define an associated series as the formal mathematical object  a 1 + a 2 + a 3 + ⋯ = ∑ n = 1 ∞ a n {\textstyle a_{1}+a_{2}+a_{3}+\cdots =\sum _{n=1}^{\infty }a_{n}} , sometimes simply written as  ∑ a n {\textstyle \sum a_{n}} . The partial sums of a series  ∑ a n {\textstyle \sum a_{n}} are the numbers  s n = ∑ j = 1 n a j {\textstyle s_{n}=\sum _{j=1}^{n}a_{j}} . A series  ∑ a n {\textstyle \sum a_{n}} is said to be convergent if the sequence consisting of its partial sums,  ( s n ) {\displaystyle (s_{n})} , is convergent; otherwise it is divergent. The sum of a convergent series is defined as the number  s = lim n -> ∞ s n {\textstyle s=\lim _{n\to \infty }s_{n}} .

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:

∑ n = 1 ∞ 1 2 n = 1 2 + 1 4 + 1 8 + ⋯ = 1. {\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:

∑ n = 1 ∞ 1 n = 1 + 1 2 + 1 3 + ⋯ = ∞ . {\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  ∑ a n {\textstyle \sum a_{n}} is said to converge absolutely if  ∑ | a n | {\textstyle \sum |a_{n}|} is convergent. A convergent series  ∑ a n {\textstyle \sum a_{n}} for which  ∑ | a n | {\textstyle \sum |a_{n}|} diverges is said to converge non-absolutely.[7] It is easily shown that absolute convergence of a series implies its convergence. On the other hand, an example of a series that converges non-absolutely is

∑ n = 1 ∞ ( − 1 ) n − 1 n = 1 − 1 2 + 1 3 − 1 4 + ⋯ = ln ⁡ 2. {\displaystyle \sum _{n=1}^{\infty }{\frac {(-1)^{n-1}}{n}}=1-{\frac {1}{2}}+{\frac {1}{3}}-{\frac {1}{4}}+\cdots =\ln 2.}

#### Taylor series

[edit]

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

f ( a ) + f ′ ( a ) 1 ! ( x − a ) + f ″ ( a ) 2 ! ( x − a ) 2 + f ( 3 ) ( a ) 3 ! ( x − a ) 3 + ⋯ . {\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

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

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

A Taylor series of f about point a may diverge, converge at only the point a, converge for all x such that  | x − a | < R {\displaystyle |x-a|<R} (the largest such R for which convergence is guaranteed is called the radius of convergence), or converge on the entire real line. Even a converging Taylor series may converge to a value different from the value of the function at that point. If the Taylor series at a point has a nonzero radius of convergence, and sums to the function in the disc of convergence, then the function is analytic. The analytic functions have many fundamental properties. In particular, an analytic function of a real variable extends naturally to a function of a complex variable. It is in this way that the exponential function, the logarithm, the trigonometric functions and their inverses are extended to functions of a complex variable.

#### Fourier series

[edit]

Main article: Fourier series

The first four partial sums of the Fourier series for a square wave. Fourier series are an important tool in real analysis.

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 typically occurs and is handled within the branch mathematics > mathematical analysis > Fourier analysis.

### Integration

[edit]

Integration is a formalization of the problem of finding the area bound by a curve and the related problems of determining the length of a curve or volume enclosed by a surface. The basic strategy to solving problems of this type was known to the ancient Greeks and Chinese, and was known as the method of exhaustion. Generally speaking, the desired area is bounded from above and below, respectively, by increasingly accurate circumscribing and inscribing polygonal approximations whose exact areas can be computed. By considering approximations consisting of a larger and larger ("infinite") number of smaller and smaller ("infinitesimal") pieces, the area bound by the curve can be deduced, as the upper and lower bounds defined by the approximations converge around a common value.

The spirit of this basic strategy can easily be seen in the definition of the Riemann integral, in which the integral is said to exist if upper and lower Riemann (or Darboux) sums converge to a common value as thinner and thinner rectangular slices ("refinements") are considered. Though the machinery used to define it is much more elaborate compared to the Riemann integral, the Lebesgue integral was defined with similar basic ideas in mind. Compared to the Riemann integral, the more sophisticated Lebesgue integral allows area (or length, volume, etc.; termed a "measure" in general) to be defined and computed for much more complicated and irregular subsets of Euclidean space, although there still exist "non-measurable" subsets for which an area cannot be assigned.

#### Riemann integration

[edit]

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 ] {\displaystyle [a,b]} be a closed interval of the real line; then a tagged partition P {\displaystyle {\cal {P}}} of  [ a , b ] {\displaystyle [a,b]} is a finite sequence

a = x 0 ≤ t 1 ≤ x 1 ≤ t 2 ≤ x 2 ≤ ⋯ ≤ x n − 1 ≤ t n ≤ x n = b . {\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 ] {\displaystyle [a,b]} into  n {\displaystyle n} sub-intervals  [ x i − 1 , x i ] {\displaystyle [x_{i-1},x_{i}]} indexed by  i = 1 , … , n {\displaystyle i=1,\ldots ,n} , each of which is "tagged" with a distinguished point  t i ∈ [ x i − 1 , x i ] {\displaystyle t_{i}\in [x_{i-1},x_{i}]} . For a function  f {\displaystyle f} bounded on  [ a , b ] {\displaystyle [a,b]} , we define the Riemann sum of  f {\displaystyle f} with respect to tagged partition  P {\displaystyle {\cal {P}}} as

∑ i = 1 n f ( t i ) Δ i , {\displaystyle \sum _{i=1}^{n}f(t_{i})\Delta _{i},}

where  Δ i = x i − x i − 1 {\displaystyle \Delta _{i}=x_{i}-x_{i-1}} is the width of sub-interval  i {\displaystyle 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. The mesh of such a tagged partition is the width of the largest sub-interval formed by the partition,  ‖ Δ i ‖ = max i = 1 , … , n Δ i {\textstyle \|\Delta _{i}\|=\max _{i=1,\ldots ,n}\Delta _{i}} . We say that the Riemann integral of  f {\displaystyle f} on  [ a , b ] {\displaystyle [a,b]} is  S {\displaystyle S} if for any  ε > 0 {\displaystyle \varepsilon >0} there exists  δ > 0 {\displaystyle \delta >0} such that, for any tagged partition  P {\displaystyle {\cal {P}}} with mesh  ‖ Δ i ‖ < δ {\displaystyle \|\Delta _{i}\|<\delta } , we have

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

This is sometimes denoted  R ∫ a b f = S {\textstyle {\mathcal {R}}\int _{a}^{b}f=S} . When the chosen tags give the maximum (respectively, minimum) value of each interval, the Riemann sum is known as the upper (respectively, lower) Darboux sum. A function is Darboux integrable if the upper and lower Darboux sums can be made to be arbitrarily close to each other for a sufficiently small mesh. Although this definition gives the Darboux integral the appearance of being a special case of the Riemann integral, they are, in fact, equivalent, in the sense that a function is Darboux integrable if and only if it is Riemann integrable, and the values of the integrals are equal. In fact, calculus and real analysis textbooks often conflate the two, introducing the definition of the Darboux integral as that of the Riemann integral, due to the slightly easier to apply definition of the former.

The fundamental theorem of calculus asserts that integration and differentiation are inverse operations in a certain sense.

#### Lebesgue integration and measure

[edit]

Main article: Lebesgue integral

Lebesgue integration is a mathematical construction that extends the integral to a larger class of functions; it also extends the domains on which these functions can be defined. The concept of a measure, an abstraction of length, area, or volume, is central to Lebesgue integral probability theory.

### Distributions

[edit]

Main article: Distribution (mathematics)

Distributions (or generalized functions) are objects that generalize functions. Distributions make it possible to differentiate functions whose derivatives do not exist in the classical sense. In particular, any locally integrable function has a distributional derivative.

### Relation to complex analysis

[edit]

Real analysis is an area of analysis that studies concepts such as sequences and their limits, continuity, differentiation, integration and sequences of functions. By definition, real analysis focuses on the real numbers, often including positive and negative infinity to form the extended real line. Real analysis is closely related to complex analysis, which studies broadly the same properties of complex numbers. In complex analysis, it is natural to define differentiation via holomorphic functions, which have a number of useful properties, such as repeated differentiability, expressibility as power series, and satisfying the Cauchy integral formula.

In real analysis, it is usually more natural to consider differentiable, smooth, or harmonic functions, which are more widely applicable, but may lack some more powerful properties of holomorphic functions. However, results such as the fundamental theorem of algebra are simpler when expressed in terms of complex numbers.

Techniques from the theory of analytic functions of a complex variable are often used in real analysis – such as evaluation of real integrals by residue calculus.

## Important results

[edit]

Important results include the Bolzano–Weierstrass and Heine–Borel theorems, the intermediate value theorem and mean value theorem, Taylor's theorem, the fundamental theorem of calculus, the Arzelà-Ascoli theorem, the Stone-Weierstrass theorem, Fatou's lemma, and the monotone convergence and dominated convergence theorems.

## Generalizations and related areas of mathematics

[edit]

Various ideas from real analysis can be generalized from the real line to broader or more abstract contexts. These generalizations link real analysis to other disciplines and subdisciplines. For instance, generalization of ideas like continuous functions and compactness from real analysis to metric spaces and topological spaces connects real analysis to the field of general topology, while generalization of finite-dimensional Euclidean spaces to infinite-dimensional analogs led to the concepts of Banach spaces and Hilbert spaces and, more generally to functional analysis. Georg Cantor's investigation of sets and sequence of real numbers, mappings between them, and the foundational issues of real analysis gave birth to naive set theory. The study of issues of convergence for sequences of functions eventually gave rise to Fourier analysis as a subdiscipline of mathematical analysis. Investigation of the consequences of generalizing differentiability from functions of a real variable to ones of a complex variable gave rise to the concept of holomorphic functions and the inception of complex analysis as another distinct subdiscipline of analysis. On the other hand, the generalization of integration from the Riemann sense to that of Lebesgue led to the formulation of the concept of abstract measure spaces, a fundamental concept in measure theory. Finally, the generalization of integration from the real line to curves and surfaces in higher dimensional space brought about the study of vector calculus, whose further generalization and formalization played an important role in the evolution of the concepts of differential forms and smooth (differentiable) manifolds in differential geometry and other closely related areas of geometry and topology.

## See also

[edit]

* List of real analysis topics
* Time-scale calculus – a unification of real analysis with calculus of finite differences
* Real multivariable function
* Real coordinate space
* Complex analysis

## References

[edit]

1. ^ Tao, Terence (2003). "Lecture notes for MATH 131AH" (PDF). Course Website for MATH 131AH, Department of Mathematics, UCLA.
2. ^ "Sequences intro". khanacademy.org.
3. ^ Gaughan, Edward (2009). "1.1 Sequences and Convergence". Introduction to Analysis. AMS (2009). ISBN 978-0-8218-4787-9.
4. ^ Some authors (e.g., Rudin 1976) use braces instead and write  { a n } {\displaystyle \\{a_{n}\\}} . However, this notation conflicts with the usual notation for a set, which, in contrast to a sequence, disregards the order and the multiplicity of its elements.
5. ^ Stewart, James (2008). Calculus: Early Transcendentals (6th ed.). Brooks/Cole. ISBN 978-0-495-01166-8.
6. ^ Royden 1988, Sect. 5.4, page 108; Nielsen 1997, Definition 15.6 on page 251; Athreya & Lahiri 2006, Definitions 4.4.1, 4.4.2 on pages 128,129. The interval I is assumed to be bounded and closed in the former two books but not the latter book.
7. ^ The term unconditional convergence refers to series whose sum does not depend on the order of the terms (i.e., any rearrangement gives the same sum). Convergence is termed conditional otherwise. For series in  R n {\displaystyle \mathbb {R} ^{n}} , it can be shown that absolute convergence and unconditional convergence are equivalent. Hence, the term "conditional convergence" is often used to mean non-absolute convergence. However, in the general setting of Banach spaces, the terms do not coincide, and there are unconditionally convergent series that do not converge absolutely.

## Sources

[edit]

* Athreya, Krishna B.; Lahiri, Soumendra N. (2006), Measure theory and probability theory, Springer, ISBN 0-387-32903-X
* Nielsen, Ole A. (1997), An introduction to integration and measure theory, Wiley-Interscience, ISBN 0-471-59518-7
* Royden, H.L. (1988), Real Analysis (third ed.), Collier Macmillan, ISBN 0-02-404151-3

## Bibliography

[edit]

* Abbott, Stephen (2001). Understanding Analysis. Undergraduate Texts in Mathematics. New York: Springer-Verlag. ISBN 0-387-95060-5.
* Aliprantis, Charalambos D.; Burkinshaw, Owen (1998). Principles of real analysis (3rd ed.). Academic. ISBN 0-12-050257-7.
* Bartle, Robert G.; Sherbert, Donald R. (2011). Introduction to Real Analysis (4th ed.). New York: John Wiley and Sons. ISBN 978-0-471-43331-6.
* Bressoud, David (2007). A Radical Approach to Real Analysis. MAA. ISBN 978-0-88385-747-2.
* Browder, Andrew (1996). Mathematical Analysis: An Introduction. Undergraduate Texts in Mathematics. New York: Springer-Verlag. ISBN 0-387-94614-4.
* Carothers, Neal L. (2000). Real Analysis. Cambridge: Cambridge University Press. ISBN 978-0521497565.
* Dangello, Frank; Seyfried, Michael (1999). Introductory Real Analysis. Brooks Cole. ISBN 978-0-395-95933-6.
* Kolmogorov, A. N.; Fomin, S. V. (1975). Introductory Real Analysis. Translated by Richard A. Silverman. Dover Publications. ISBN 0486612260. Retrieved 2 April 2013.
* Rudin, Walter (1976). Principles of Mathematical Analysis. Walter Rudin Student Series in Advanced Mathematics (3rd ed.). New York: McGraw–Hill. ISBN 978-0-07-054235-8.
* Rudin, Walter (1987). Real and Complex Analysis (3rd ed.). New York: McGraw-Hill. ISBN 978-0-07-054234-1.
* Spivak, Michael (1994). Calculus (3rd ed.). Houston, Texas: Publish or Perish, Inc. ISBN 091409890X.

## External links

[edit]

* How We Got From There to Here: A Story of Real Analysis by Robert Rogers and Eugene Boman
* A First Course in Analysis by Donald Yau
* Analysis WebNotes by John Lindsay Orr
* Interactive Real Analysis by Bert G. Wachsmuth
* A First Analysis Course by John O'Connor
* Mathematical Analysis I by Elias Zakon
* Mathematical Analysis II by Elias Zakon
* Trench, William F. (2003). Introduction to Real Analysis (PDF). Prentice Hall. ISBN 978-0-13-045786-8.
* Earliest Known Uses of Some of the Words of Mathematics: Calculus & Analysis
* Basic Analysis: Introduction to Real Analysis by Jiri Lebl
* Topics in Real Analysis by Gerald Teschl, University of Vienna.

* v
* t
* e

Major topics in mathematical analysis

* Calculus: Integration
* Differentiation
* Differential equations
* ordinary
* partial
* stochastic
* Fundamental theorem of calculus
* Calculus of variations
* Vector calculus
* Tensor calculus
* Matrix calculus
* Lists of integrals
* Table of derivatives

* Real analysis
* Complex analysis
* Hypercomplex analysis (quaternionic analysis)
* Functional analysis
* Fourier analysis
* Least-squares spectral analysis
* Harmonic analysis
* P-adic analysis (P-adic numbers)
* Measure theory
* Representation theory

* Functions
* Continuous function
* Special functions
* Limit
* Series
* Infinity

Mathematics portal
*[v]: View this template
*[t]: Discuss this template
*[e]: Edit this template