The Hong Kong University of Science and Technology · FACULTY OF MATHEMATICS

MATH2001 Chap.5 Completion and Cauchy Sequences

- one subject, every graph, every model, every mark
7 Chapters5-page Bible
Our own words - no uploaded lecturer files
Updated for this semester
Chapter 5 of 5 · MATH2001

Completion and Cauchy Sequences

A valuation supplies the geometry

A valuation measures size in a field, preserves multiplication and satisfies a triangle inequality. It defines distance through the size of a difference. The usual absolute value is one example, while p-adic valuations create a different geometry based on divisibility by a chosen prime.

Completion depends on that geometry, so the same starting field can acquire different completed fields under different valuations.

Cauchy sequences control their own tails

Convergence compares late terms with a fixed target. The Cauchy condition compares every pair of sufficiently late terms and does not name a target.

The quantifier order is essential: every positive epsilon determines one index N that must work for all late pairs. A Cauchy sequence is bounded, and that boundedness becomes important when proving that products of equivalent sequences remain equivalent.

Classes create the missing limits

Two Cauchy sequences are equivalent when their difference tends to zero.

A completed element is an equivalence class of such sequences. Addition and multiplication are defined termwise, then checked for independence from representatives. Constant sequences embed the original field. Completeness means every Cauchy sequence of completed elements converges within the completion, closing the gaps detected by the chosen valuation.

In this chapter

What this chapter covers

  • 01

    Valuations and induced distance

  • 02

    Cauchy quantifier order

  • 03

    Convergence versus Cauchy

  • 04

    Equivalent approximation sequences

  • 05

    Termwise class operations

  • 06

    Embedding by constant sequences

  • 07

    Completeness and diagonal construction

Worked example · free

Prove a geometric tail is Cauchy

Q [10 marks]. AskSia-authored practice. Let a sub n be the partial sum from k equals zero to n of three to the minus k. Prove directly that the sequence is Cauchy in the usual absolute value. The marks shown are an AskSia study allocation, not the University marking scheme.
After the chosen index N, every pair of plotted terms lies within the same epsilon band, which is the Cauchy requirement.After the chosen index N, every pair of plotted terms lies within the same epsilon band, which is the Cauchy requirement.Nall late pairs fit inside epsilonThe tail contracts even before a limit is named
After the chosen index N, every pair of plotted terms lies within the same epsilon band, which is the Cauchy requirement.
  • 3Subtract two partial sums and identify the remaining geometric tail.
  • 4Bound the finite tail by an infinite geometric tail.
  • 3Choose N from epsilon and quantify all late index pairs.
Assume m is greater than n. Then a_m-a_n is the sum from k=n+1 to m of three to the minus k. Its absolute value is at most the infinite tail beginning there, which equals one divided by 2 times 3 to the n. Given positive epsilon, choose N so that one divided by 2 times 3 to the N is below epsilon. For all m,n at least N, order the indices and apply the same bound using the smaller index. Thus every late pair is within epsilon, so the sequence is Cauchy.
Sia tip — Choose N before the late indices and state how the argument handles either ordering of m and n.
Glossary

Key terms

Valuation
A field size function satisfying positivity, multiplicativity and a triangle inequality.
Induced Distance
The distance between two elements defined as the valuation of their difference.
Cauchy Sequence
A sequence whose sufficiently late terms are uniformly close to one another.
Equivalent Sequences
Cauchy sequences whose termwise difference tends to zero under the chosen valuation.
Completion
The field of equivalence classes of Cauchy sequences built to contain limits for all Cauchy processes.
Constant Embedding
The map sending a field element to the class of the constant sequence with that value.
Complete Space
A space in which every Cauchy sequence converges to an element of the space.
FAQ

Completion and Cauchy Sequences FAQ

How is Cauchy different from convergent?

Convergence compares each late term with one named limit, while Cauchy compares every pair of late terms. A convergent sequence is Cauchy by the triangle inequality. The converse holds in a complete space, but it can fail in an incomplete one when the approximation process points toward a missing element.

Why are Cauchy sequences bounded?

Choose a tail whose terms are all within a fixed small distance of one selected late term. That tail is bounded by the selected term plus the chosen radius. Only finitely many earlier terms remain, and their sizes have a maximum. Combining the tail bound with the finite initial bound controls the whole sequence.

Why does multiplication need more work than addition?

A difference of sums splits directly into two small differences. A difference of products splits into factors times differences, so a small difference could be amplified by a large factor. Boundedness of Cauchy sequences controls those factors, allowing the product difference to be made small and representative independence to follow.

Study strategy

Exam move

Write the epsilon quantifiers before every estimate. On scratch paper, work backward from the desired epsilon bound to a condition on the index; in the final proof, present the choices forward. Keep convergence, Cauchy, equivalence and boundedness on separate cards with the objects compared and the order of quantifiers.

For class arithmetic, rehearse the product-difference decomposition until each term visibly contains one bounded factor and one difference tending to zero. Always label which valuation controls the calculation. Build an estimate ledger with one line for the target, one for each triangle-inequality split and one for every index threshold. If two thresholds arise, state that the final index is their maximum.

For completion arguments, distinguish the original field, a sequence in that field and a class of sequences typographically. This prevents the three levels from being silently exchanged during a proof.

Working through Completion and Cauchy Sequences in MATH2001? Sia is AskSia’s AI Mathematics tutor — ask any MATH2001 Completion and Cauchy Sequences question and get a clear, step-by-step explanation grounded in how MATH2001 is taught and assessed. Read this chapter free, then take your hardest questions to Sia.

A+Everything unlocked
Unlocks this Bible + all 13 of your subjects at The Hong Kong University of Science and Technology, plus 1,000+ more Bibles across the AskSia library.
Sia - your MATH2001 tutor, unlimited, worked the way the exam marks it
The full 5-page Bible + practice bank with worked solutions
Chrome extension - sync your LMS so Sia knows your deadlines
Bilingual EN / Chinese on every Bible and every Sia answer
$0.99 Trial
30-day money-back · cancel in one tap · how it works