Math 2.0

Sequences, series, summability Multiple series and sequences Theorem

Moore–Osgood theorem

Builds on Pringsheim convergenceUniform convergenceComplete metric space

Statement

Let (X,d)(X, d) be a complete metric space, for example ℝ\R or ℂ\C, and let (am,n)m,n≥1(a_{m,n})_{m, n \ge 1} be a double sequence in XX. Assume:

  1. for each mm, the limit bm=lim⁡n→∞am,nb_m = \lim_{n \to \infty} a_{m,n} exists;
  2. there is a sequence (cn)(c_n) such that am,n→cna_{m,n} \to c_n as m→∞m \to \infty, uniformly in nn, that is, sup⁡nd(am,n,cn)→0\sup_n d(a_{m,n}, c_n) \to 0.

Then the limits lim⁡m→∞bm\lim_{m \to \infty} b_m and lim⁡n→∞cn\lim_{n \to \infty} c_n exist, the Pringsheim double limit lim⁡m,n→∞am,n\lim_{m,n \to \infty} a_{m,n} exists, and all three are equal.

Remarks

Proof idea: uniform convergence gives an MM such that d(am,n,am′,n)<2εd(a_{m,n}, a_{m',n}) < 2\varepsilon for all nn when m,m′≥Mm, m' \ge M. Letting n→∞n \to \infty gives d(bm,bm′)≤2εd(b_m, b_{m'}) \le 2\varepsilon, so (bm)(b_m) is a Cauchy sequence and has a limit LL by completeness. The triangle inequality d(cn,L)≤d(cn,aM,n)+d(aM,n,bM)+d(bM,L)d(c_n, L) \le d(c_n, a_{M,n}) + d(a_{M,n}, b_M) + d(b_M, L) then shows cn→Lc_n \to L, and the same splitting gives the double limit. Example: for am,n=1m+1na_{m,n} = \frac{1}{m} + \frac{1}{n} the convergence in mm is uniform, and all limits equal 00. Without uniformity the conclusion fails: am,n=mm+na_{m,n} = \frac{m}{m+n} gives lim⁡mlim⁡nam,n=0\lim_m \lim_n a_{m,n} = 0 but lim⁡nlim⁡mam,n=1\lim_n \lim_m a_{m,n} = 1. Without completeness it also fails: in ℚ\mathbb{Q}, take rationals xk→2x_k \to \sqrt{2} and am,n=xmin⁡(m,n)a_{m,n} = x_{\min(m,n)}; both hypotheses hold, but bm=xmb_m = x_m has no limit in ℚ\mathbb{Q}.

Going deeper

For a student

This is the abstract principle behind many interchange results in analysis. The theorem that a uniform limit of continuous functions is continuous, and the theorem that uniform limits commute with integration, follow the same pattern. For double series, it gives conditions under which summing by rows, by columns, or over squares gives the same value.

Reading path

To understand this page from the ground up, read these 30 pages in order. The foundations come first.

Show the path as a graph
Double sequence, concept, no evidence levelDouble sequenceconceptElement, definition, no evidence levelElementdefinitionExtended real number line, object, no evidence levelExtended real number …objectProposition, concept, no evidence levelPropositionconceptReal numbers, object, no evidence levelReal numbersobjectSequence, definition, no evidence levelSequencedefinitionSet bounded above, definition, no evidence levelSet bounded abovedefinitionPringsheim convergence, definition, no evidence levelPringsheim convergencedefinitionSet, definition, no evidence levelSetdefinitionImplication, definition, no evidence levelImplicationdefinitionPredicate, definition, no evidence levelPredicatedefinitionReal sequence, definition, no evidence levelReal sequencedefinitionSupremum, definition, no evidence levelSupremumdefinitionOrdered pair, definition, no evidence levelOrdered pairdefinitionExistential quantifier, definition, no evidence levelExistential quantifierdefinitionUniversal quantifier, definition, no evidence levelUniversal quantifierdefinitionLimit of a sequence, definition, no evidence levelLimit of a sequencedefinitionCartesian product, definition, no evidence levelCartesian productdefinitionSubset, definition, no evidence levelSubsetdefinitionUniqueness quantifier, definition, no evidence levelUniqueness quantifierdefinitionPointwise convergence, definition, no evidence levelPointwise convergencedefinitionBinary relation, definition, no evidence levelBinary relationdefinitionUniform convergence, definition, no evidence levelUniform convergencedefinitionFunction, definition, no evidence levelFunctiondefinitionMetric space, definition, no evidence levelMetric spacedefinitionConvergence of a sequence in a metric space, definition, no evidence levelConvergence of a sequ…definitionDiameter of a set, definition, no evidence levelDiameter of a setdefinitionEpsilon characterisation of Cauchy sequences, statement, no evidence levelEpsilon characterisat…statementComplete metric space, definition, no evidence levelComplete metric spacedefinitionMoore–Osgood theorem, statement, no evidence levelMoore–Osgood theoremstatement
Each page uses the pages above it. The colour of the bar on a box shows how strong the evidence is, and the box also gives it as text. The list has the same pages.
  • no evidence level
  1. Double sequence concept
  2. Element definition
  3. Extended real number line object
  4. Proposition concept
  5. Real numbers object
  6. Sequence definition
  7. Set bounded above definition
  8. Pringsheim convergence definition
  9. Set definition
  10. Implication definition
  11. Predicate definition
  12. Real sequence definition
  13. Supremum definition
  14. Ordered pair definition
  15. Existential quantifier definition
  16. Universal quantifier definition
  17. Limit of a sequence definition
  18. Cartesian product definition
  19. Subset definition
  20. Uniqueness quantifier definition
  21. Pointwise convergence definition
  22. Binary relation definition
  23. Uniform convergence definition
  24. Function definition
  25. Metric space definition
  26. Convergence of a sequence in a metric space definition
  27. Diameter of a set definition
  28. Epsilon characterisation of Cauchy sequences statement
  29. Complete metric space definition
  30. Moore–Osgood theorem statement

Further reading

  1. Web https://en.wikipedia.org/wiki/Iterated_limit
About this page
TagQN2210XCST
URIm2://QN2210XCST
Kindstatement, theorem
WritingW0 stub
MSC40B05, 40A30
StatusThis copy of the site has no build data. Run m2 status QN2210XCST.
AboutPringsheim convergence
UsesPringsheim convergence, Uniform convergence, Complete metric space
Changed2 November 2026

Markdown · JSON · Edit on GitHub

What this page needs for W1

  • an inventory row: the row of the inventory that the node accounts for (0 of 1)
  • a source with a locator (0 of 1)

The writing levels say how complete the text of a page is. They do not measure its truth.

What links here

No page links to this page yet.