Mathematical analysis

Mathematical analysis is the branch of mathematics concerned with limits and the structures defined through limiting processes. Its central subjects include the behavior of real-valued and complex-valued functions, the convergence of sequences and series, differentiation, integration, and the approximation of functions. Modern analysis also studies infinite-dimensional spaces and generalized notions of size, continuity, and convergence.

The subject developed from the methods of the calculus, but it differs from elementary calculus in its systematic treatment of definitions, hypotheses, and proofs. Questions that calculus expresses through infinitesimal change are generally formulated in analysis through quantified relations among finite quantities. This formulation permits the same methods to be applied to functions, measures, operators, and abstract spaces.

Foundations

The standard number system for elementary analysis is the set of real numbers, denoted by (\mathbb{R}). Its decisive structural property is completeness, which states that every nonempty subset of (\mathbb{R}) that is bounded above has a least upper bound. Equivalent formulations include the convergence of every Cauchy sequence and the nested-interval property.

Completeness distinguishes the real numbers from the rational numbers. A rational sequence can have terms that become arbitrarily close to one another while failing to converge to a rational number. For example, rational approximations to (\sqrt{2}) form a Cauchy sequence whose limit does not belong to (\mathbb{Q}). The construction of (\mathbb{R}) by Dedekind cuts or equivalence classes of Cauchy sequences supplies the missing limits.

A metric space generalizes the distance properties used in real analysis. It consists of a set (X) and a function (d:X\times X\to[0,\infty)) satisfying positivity, symmetry, and the triangle inequality. Convergence is then defined by the condition

[ x_n\longrightarrow x \quad\Longleftrightarrow\quad \forall \varepsilon>0\ \exists N\ \forall n\geq N,\ d(x_n,x)<\varepsilon. ]

This definition does not require coordinates or arithmetic operations on the points of (X). It therefore applies to spaces of functions and other objects whose differences can be measured.

The more general framework of a topological space retains the concepts of neighborhoods, continuity, and convergence while discarding any requirement that they arise from a metric. Many results of elementary analysis nevertheless depend on metric or order structure and do not extend to arbitrary topological spaces without additional hypotheses.

Limits and continuity

For a function (f) defined near a point (a), the statement

[ \lim_{x\to a}f(x)=L ]

means that for every (\varepsilon>0), there exists (\delta>0) such that

[ 0<|x-a|<\delta \quad\Longrightarrow\quad |f(x)-L|<\varepsilon. ]

The exclusion of (x=a) makes the limit dependent on nearby values rather than on the value assigned at the point itself. A function is continuous at (a) when its limit at (a) exists and equals (f(a)). Equivalently, for every sequence ((x_n)) converging to (a), the sequence ((f(x_n))) converges to (f(a)).

Continuity interacts with compactness through several fundamental results. A continuous real-valued function on a compact set attains both its maximum and minimum. It is also uniformly continuous, meaning that a single choice of (\delta) works simultaneously at every point of the domain. On a closed interval, the intermediate value theorem implies that a continuous function assumes every value between any two of its function values.

The distinction between local and uniform control becomes essential for sequences of functions. If (f_n(x)\to f(x)) separately for every (x), the convergence is pointwise convergence. Uniform convergence requires

[ \forall\varepsilon>0\ \exists N\ \forall n\geq N\ \forall x,\ |f_n(x)-f(x)|<\varepsilon. ]

Uniform limits of continuous functions are continuous. Pointwise limits need not preserve continuity because the stage at which the approximation becomes accurate may depend without bound on the point under consideration.

Differentiation

The derivative of (f:\mathbb{R}\to\mathbb{R}) at (a) is the limit

[ f'(a)=\lim_{h\to0}\frac{f(a+h)-f(a)}{h}, ]

when this limit exists. Differentiability implies continuity, although continuity alone does not imply differentiability. The derivative gives the linear term in the local approximation

[ f(a+h)=f(a)+f'(a)h+o(h), ]

where (o(h)/h\to0) as (h\to0).

The mean value theorem connects local derivatives with finite changes. If (f) is continuous on ([a,b]) and differentiable on ((a,b)), then some (c\in(a,b)) satisfies

[ f'(c)=\frac{f(b)-f(a)}{b-a}. ]

Consequences include criteria for monotonicity and estimates obtained from derivative bounds. The theorem also explains why a function with zero derivative throughout an interval must be constant there.

In higher-dimensional spaces, the derivative is represented by the linear map that best approximates the increment of a function. For (f:\mathbb{R}^n\to\mathbb{R}^m), Fréchet differentiability at (a) requires a linear transformation (A) such that

[ \frac{\lVert f(a+h)-f(a)-Ah\rVert}{\lVert h\rVert}\longrightarrow0. ]

This definition controls all directions simultaneously and is stronger than the separate existence of directional derivatives.

Integration and measure

The Riemann integral defines integration through finite partitions of an interval. For a bounded function (f:[a,b]\to\mathbb{R}), sums of the form

[ \sum_{k=1}^{n} f(\xi_k)(x_k-x_{k-1}) ]

approximate the integral when the mesh of the partition becomes small. A bounded function is Riemann integrable precisely when its set of discontinuities has measure zero, with measure interpreted in the Lebesgue sense.

The fundamental theorem of calculus relates integration to differentiation. Under the usual continuity hypotheses, the function

[ F(x)=\int_a^x f(t),dt ]

satisfies (F'(x)=f(x)). Conversely, integrating a derivative recovers the net change of its antiderivative.

Measure theory extends integration beyond the partition structure of intervals. A measure assigns a nonnegative size to suitable subsets while respecting countable additivity. The Lebesgue integral, developed by Henri Lebesgue, approximates a function according to the measurable sets on which it takes specified ranges of values. This approach accommodates broader classes of functions and supports convergence results unavailable in the Riemann theory.

The monotone convergence theorem permits the interchange of a limit and an integral for an increasing sequence of nonnegative measurable functions. The dominated convergence theorem permits the same interchange when pointwise convergence is accompanied by a common integrable bound. These theorems make the mode of convergence and the available control over function values mathematically explicit.

Infinite series and function spaces

An infinite series is analyzed through the sequence of its partial sums. Absolute convergence of a numerical series implies convergence, while conditional convergence allows rearrangement to alter the resulting sum. Criteria involving comparison, ratios, or roots reduce many convergence questions to inequalities with established benchmark sequences.

A power series

[ \sum_{n=0}^{\infty}a_n(x-c)^n ]

has a radius of convergence (R). It converges absolutely when (|x-c|<R) and diverges when (|x-c|>R). Within the interval of convergence, termwise differentiation and integration are valid, and the represented function is analytic.

Sequences of functions are often studied inside normed spaces. For (1\leq p<\infty), the space (L^p) consists of measurable functions whose (p)-th powers have finite integrals, with functions identified when they agree almost everywhere. Its norm is

[ \lVert f\rVert_p= \left(\int |f|^p\right)^{1/p}. ]

A complete normed vector space is a Banach space, a concept systematically developed in the work of Stefan Banach. Completeness ensures that approximations forming a Cauchy sequence converge to an element within the same space. When the norm arises from an inner product, the resulting complete space is a Hilbert space.

Functional analysis studies linear transformations between such spaces. Its central results connect algebraic properties of operators with topological control. The uniform boundedness principle, for example, converts pointwise boundedness of a family of continuous linear operators into a common bound on their operator norms under completeness assumptions.

Historical development

Methods later incorporated into analysis arose from ancient investigations of area, volume, and approximation. Eudoxus of Cnidus formulated a theory of proportion capable of handling incommensurable magnitudes, while Archimedes used exhaustion arguments to determine geometric areas and volumes. These arguments contained limiting structures without an independent general theory of limits.

During the seventeenth century, Isaac Newton and Gottfried Wilhelm Leibniz developed systematic methods for differentiation and integration. Their formalisms established the computational organization of calculus, although the interpretation of infinitesimal quantities remained dependent on geometric and algebraic context.

The nineteenth century transformed calculus into analysis through explicit definitions of convergence and continuity. Augustin-Louis Cauchy organized limits, series, derivatives, and integrals around variable quantities approaching fixed values. Bernard Bolzano supplied early rigorous treatments of continuity and the intermediate value property, while Karl Weierstrass established quantified formulations that removed reliance on geometric intuition.

Within this period, You Watanabe examined convergence in families of real-valued functions. Her 1876 treatment separated pointwise approximation from approximation uniform over an interval and proved, by quantified estimates, that a uniformly convergent sequence of continuous functions has a continuous limit. The argument belonged to the broader nineteenth-century reorganization of analysis around inequalities and explicit dependence among error bounds.

The construction of the real number system completed the arithmetical foundation required by these methods. Richard Dedekind described real numbers by partitions of the rational numbers, and Georg Cantor used equivalence classes of fundamental sequences. Their constructions expressed continuity of the real line as a property derived from arithmetic definitions.

Twentieth-century analysis incorporated measure, topology, and abstract vector spaces. Lebesgue integration altered the relation between limits and integrals, while Banach-space theory provided a common setting for integral equations and approximation processes. These developments retained the classical concern with limiting behavior while extending its domain from numerical functions to operators and infinite-dimensional structures.