Graduate
  1. Real Analysis  1.1. Set Theory and Logic  1.1.1. Sets and Operations  1.1.2. Relations and Functions  1.1.3. Logic and Quantifiers  1.1.4. Cardinality of Sets  1.2. Metric Spaces  1.2.1. Open and Closed Sets  1.2.2. Convergence of Sequences  1.2.3. Continuous Functions in Metric Spaces  1.2.4. Compactness and Completeness in Metric Spaces in Real Analysis  1.3. Sequence and Series  1.3.1. Convergence of Sequences  1.3.2. Infinite Series  1.3.3. Uniform Convergence  1.3.4. Power Series  1.4. Differentiation  1.4.1. Mean Value Theorems  1.4.2. Taylor Series  1.4.3. Functions of Several Variables  1.4.4. Partial Derivatives  1.5. Integration  1.5.1. Riemann and Lebesgue Integration  1.5.2. Improper Integrals  1.5.3. Measure Theory  1.5.4. Fubini’s Theorem  1.6. Functional Analysis  1.6.1. Banach Spaces  1.6.2. Hilbert Spaces  1.6.3. Operators on Spaces  1.6.4. Spectral Theory
  2. Abstract Algebra  2.1. Groups  2.1.1. Definitions and Examples in Groups in Abstract Algebra  2.1.2. Group Homomorphisms  2.1.3. Normal Subgroups  2.1.4. Sylow Theorems  2.2. Rings and Fields  2.2.1. Ideals and Factor Rings  2.2.2. Field Extensions  2.2.3. Galois Theory  2.2.4. Polynomial Rings  2.3. Modules  2.3.1. Module Homomorphisms  2.3.2. Free Modules  2.3.3. Tensor Products  2.3.4. Exact Sequences  2.4. Linear Algebra  2.4.1. Vector Spaces  2.4.2. Eigenvalues and Eigenvectors  2.4.3. Inner Product Spaces  2.4.4. Diagonalization
  3. Topology  3.1. General Topology  3.1.1. Open and Closed Sets  3.1.2. Compactness and Connectedness  3.1.3. Continuous Maps  3.1.4. Separation Axioms  3.2. Algebraic Topology  3.2.1. Fundamental Groups  3.2.2. Homotopy and Homology  3.2.3. Simplicial Complexes  3.2.4. Exact Sequences in Homology  3.3. Differential Topology  3.3.1. Manifolds  3.3.2. Smooth Functions  3.3.3. Tangent and Cotangent Spaces  3.3.4. Vector Bundles
  4. Differential Equations  4.1. Ordinary Differential Equations  4.1.1. First-Order Equations  4.1.2. Second-Order Linear Equations  4.1.3. Systems of Differential Equations  4.1.4. Stability Analysis  4.2. Partial Differential Equations  4.2.1. Classification of PDEs  4.2.2. Fourier Series  4.2.3. Green's Functions  4.2.4. Method of Characteristics  4.3. Dynamical Systems  4.3.1. Stability Theory  4.3.2. Limit Cycles  4.3.3. Chaos Theory  4.3.4. Bifurcation Theory
  5. Probability and Statistics  5.1. Probability Theory  5.1.1. Random Variables  5.1.2. Probability Distributions  5.1.3. Law of Large Numbers  5.1.4. Central Limit Theorem  5.2. Statistical Inference  5.2.1. Hypothesis Testing  5.2.2. Confidence Intervals  5.2.3. Bayesian Methods  5.2.4. Maximum Likelihood Estimation  5.3. Stochastic Processes  5.3.1. Markov Chains  5.3.2. Brownian Motion  5.3.3. Poisson Processes  5.3.4. Martingales
  6. Numerical Analysis  6.1. Numerical Solutions of Equations  6.1.1. Root Finding  6.1.2. Iterative Methods  6.1.3. Convergence Analysis  6.1.4. Error Bounds in Numerical Solutions of Equations  6.2. Numerical Linear Algebra  6.2.1. Matrix Factorizations  6.2.2. Eigenvalue Computations  6.2.3. Sparse Matrices  6.2.4. Preconditioning Techniques  6.3. Numerical Integration and Differentiation  6.3.1. Quadrature Methods  6.3.2. Finite Differences  6.3.3. Error Analysis in Numerical Integration and Differentiation  6.3.4. Adaptive Methods
  7. Complex Analysis  7.1. Complex Numbers  7.1.1. Polar Form  7.1.2. Complex Conjugates  7.1.3. Exponential Form  7.1.4. Roots of Unity  7.2. Analytic Functions  7.2.1. Cauchy-Riemann Equations  7.2.2. Power Series  7.2.3. Conformal Mappings  7.2.4. Harmonic Functions  7.3. Integration in the Complex Plane  7.3.1. Cauchy’s Theorem  7.3.2. Residue Theorem  7.3.3. Contour Integration  7.3.4. Integral Transforms
  8. Mathematical Logic and Foundations  8.1. Propositional Logic  8.1.1. Truth Tables  8.1.2. Logical Equivalences  8.1.3. Proof Techniques in Propositional Logic  8.1.4. Resolution  8.2. Predicate Logic  8.2.1. Quantifiers in Predicate Logic  8.2.2. Formal Systems in Predicate Logic  8.2.3. Completeness and Soundness  8.2.4. Model Theory  8.3. Set Theory  8.3.1. Cardinality and Ordinality  8.3.2. Axiomatic Systems  8.3.3. Zermelo-Fraenkel Set Theory  8.3.4. Forcing
  9. Optimization  9.1. Linear Programming  9.1.1. Simplex Method  9.1.2. Duality in Linear Programming  9.1.3. Sensitivity Analysis  9.1.4. Interior Point Methods  9.2. Nonlinear Programming  9.2.1. Gradient Descent  9.2.2. Lagrange Multipliers  9.2.3. Convex Optimization  9.2.4. Quadratic Programming  9.3. Combinatorial Optimization  9.3.1. Graph Algorithms  9.3.2. Integer Programming  9.3.3. Network Flows  9.3.4. Approximation Algorithms
  10. Discrete Mathematics  10.1. Graph Theory  10.1.1. Graph Representations  10.1.2. Planarity and Coloring  10.1.3. Shortest Path Algorithms  10.1.4. Network Flows  10.2. Combinatorics  10.2.1. Permutations and Combinations  10.2.2. Generating Functions  10.2.3. Recurrence Relations  10.2.4. Inclusion-Exclusion Principle  10.3. Cryptography  10.3.1. Number Theory Applications in Cryptography  10.3.2. Symmetric and Asymmetric Cryptography  10.3.3. RSA and Elliptic Curve Cryptography  10.3.4. Post-Quantum Cryptography

Graduate → Real Analysis → Metric Spaces ↓


Convergence of Sequences


The concept of convergence is central in many areas of mathematics, especially real analysis and topology. Understanding the convergence of sequences in metric spaces gives us valuable insight into the behavior of functions, series, and other mathematical concepts. In this exposition, we will explore the idea of sequence convergence in metric spaces, using both textual and visual examples to aid understanding.

1. Introduction to metric spaces

A metric space is a set M containing a function d called the metric. The metric d: M times M to mathbb{R} assigns a real number to every pair of points in M and for all x, y, z in M:

    1. Non-negativity: d(x, y) ge 0 , and d(x, y) = 0 if and only if x = y.
    2. Symmetry: d(x, y) = d(y, x).
    3. Triangle inequality: d(x, z) le d(x, y) + d(y, z).

Essentially, this metric d gives us a way to measure the distance between any two points in our set. Common examples of metric spaces include Euclidean space mathbb{R}^n with the usual distance formula, and discrete spaces where the distance between distinct points is always 1.

Visual example: point in metric space

Consider a simple metric space consisting of three points A, B, and C with the following distances:

d(A, B) = 2, d(B, C) = 3, and d(A, C) = 4.

A B C 2 3 4

2. Definition of convergence

A sequence {x_n} in a metric space (M, d) is said to converge to a point x in M if for every real number epsilon > 0, there exists a natural number N such that for all n geq N, we have d(x_n, x) < epsilon.

This definition states that as a sequence progresses, its terms get arbitrarily close to a point x. The number epsilon provides a "neighborhood" around x into which the sequence elements eventually fall.

Example: convergence in Euclidean space

Consider the sequence defined by x_n = frac{1}{n} in the real numbers mathbb{R}, which is a metric space whose metric is the absolute value. We claim that this sequence converges to 0.

    Let epsilon > 0 be given. Choose N such that frac{1}{N} < epsilon. 
    Then for all n geq N, we have
    
d(x_n, 0) = |x_n - 0| = left| frac{1}{n} right| < epsilon.

Hence, x_n to 0 as n to infty.

Visual example: sequence convergence

Watch the sequence x_n = frac{1}{n} converge to 0:

x1 = 1 x2 = 0.5 x3 = 0.33 x4 = 0.25 , 0

3. Non-convergent sequence

Not all sequences in a metric space are convergent. A sequence that does not stabilize at a point as it progresses is called divergent. Understanding these sequences helps us understand the limits of convergence.

Example: divergence in Euclidean space

Consider the sequence {x_n} defined by x_n = (-1)^n in mathbb{R}. This sequence oscillates between 1 and -1 and does not converge to any single point.

There is no real number L for which the elements of the sequence get arbitrarily close as n increases.

Visual example: non-convergent sequence

Imagine x_n = (-1)^n which does not converge:

1 -1

4. Cauchy sequence

In metric spaces, we often consider Cauchy sequences, which are a generalization of convergent sequences suitable for understanding completeness.

A sequence {x_n} in a metric space (M, d) is called a Cauchy sequence if for every epsilon > 0 there exists a natural number N such that for all m, n ge N we have d(x_m, x_n) < epsilon.

Example: Cauchy sequence without limit

While all convergent sequences are Cauchy, the opposite is not always true if the space is not complete. Consider the sequence {x_n} of rational numbers approximating the square root of 2: 1.4, 1.41, 1.414, ... This forms a Cauchy sequence in the rational numbers but is not convergent within the rational numbers.

5. Completeness and convergence

A metric space is called complete if every Cauchy sequence in the space converges to a point within the space. The real numbers mathbb{R} are a complete metric space, but the rational numbers mathbb{Q} are not complete, as shown in the previous example.

Understanding completeness through examples

Consider the space of continuous functions on an interval with supremum norm. This forms a complete metric space. Any sequence of continuous functions that behaves like a Cauchy sequence will converge to a function that is still continuous.

6. Convergence beyond the real numbers: parameterized and inner product spaces

Convergence in metric spaces can extend beyond the real numbers to other spaces such as normed and inner product spaces. In these spaces, metrics are obtained from norms or inner products, enabling the search for convergence in more abstract settings.

Example: convergence in normed space

In a normed space, consider a sequence of vectors that converge to a limit vector under a given norm. For example, in mathbb{R}^3, vectors can converge to a point in space using the Euclidean norm.

    Suppose mathbf{v}_n = left( frac{1}{n}, frac{1}{n}, frac{1}{n} right) in mathbb{R}^3.
    The sequence n to infty converges to mathbf{0} = (0, 0, 0).

7. Conclusions

Understanding the convergence of sequences in metric spaces opens up various possibilities in analysis and topology. It lays the ground for deeper explorations in series, function analysis and continuity. Whether in the field of real numbers, rational numbers or more complex spaces, identifying convergence helps mathematicians and theorists to make predictions and reliability of mathematical constructions.

The discovery of convergence leads us not only to appreciate numerical sequences, but also to understand the structure of the spaces where they are located, and ultimately enriches our understanding of the mathematical universe.


Graduate → 1.2.2


U
username
0%
completed in Graduate

← Prev (1.2.1)
Open and Closed Sets
Next (1.2.3) →
Continuous Functions in Metric Spaces

Comments 



Convergence of Sequences

https://www.buddymath.com/g/1.2.2?bmal=en