Open main menu
Home
Random
Recent changes
Special pages
Community portal
Preferences
About Wikipedia
Disclaimers
Incubator escapee wiki
Search
User menu
Talk
Dark mode
Contributions
Create account
Log in
Editing
Cauchy sequence
(section)
Warning:
You are not logged in. Your IP address will be publicly visible if you make any edits. If you
log in
or
create an account
, your edits will be attributed to your username, along with other benefits.
Anti-spam check. Do
not
fill this in!
===Modulus of Cauchy convergence=== If <math>(x_1, x_2, x_3, ...)</math> is a sequence in the set <math>X,</math> then a ''modulus of Cauchy convergence'' for the sequence is a [[Function (mathematics)|function]] <math>\alpha</math> from the set of [[natural number]]s to itself, such that for all natural numbers <math>k</math> and natural numbers <math>m, n > \alpha(k),</math> <math>|x_m - x_n| < 1/k.</math> Any sequence with a modulus of Cauchy convergence is a Cauchy sequence. The existence of a modulus for a Cauchy sequence follows from the [[well-ordering property]] of the natural numbers (let <math>\alpha(k)</math> be the smallest possible <math>N</math> in the definition of Cauchy sequence, taking <math>\varepsilon</math> to be <math>1/k</math>). The existence of a modulus also follows from the principle of [[countable choice]]. ''Regular Cauchy sequences'' are sequences with a given modulus of Cauchy convergence (usually <math>\alpha(k) = k</math> or <math>\alpha(k) = 2^k</math>). Any Cauchy sequence with a modulus of Cauchy convergence is equivalent to a regular Cauchy sequence; this can be proven without using any form of the axiom of choice. Moduli of Cauchy convergence are used by constructive mathematicians who do not wish to use any form of choice. Using a modulus of Cauchy convergence can simplify both definitions and theorems in constructive analysis. Regular Cauchy sequences were used by {{harvtxt|Bishop|2012}} and by {{harvtxt|Bridges|1997}} in constructive mathematics textbooks.
Edit summary
(Briefly describe your changes)
By publishing changes, you agree to the
Terms of Use
, and you irrevocably agree to release your contribution under the
CC BY-SA 4.0 License
and the
GFDL
. You agree that a hyperlink or URL is sufficient attribution under the Creative Commons license.
Cancel
Editing help
(opens in new window)