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
Constructive analysis
(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!
====Variations==== The above definition of <math>x\cong y</math> uses a common bound <math>\tfrac{2}{n}</math>. Other formalizations directly take as definition that for any fixed bound <math>\tfrac{2}{N}</math>, the numbers <math>x</math> and <math>y</math> must eventually be forever at least as close. Exponentially falling bounds <math>2^{-n}</math> are also used, also say in a real number condition <math>\forall n. |x_n-x_{n+1}|<2^{-n}</math>, and likewise for the equality of two such reals. And also the sequences of rationals may be required to carry a modulus of convergence. Positivity properties may defined as being eventually forever apart by some rational. [[axiom of non-choice|Function choice]] in <math>{\mathbb N}^{\mathbb N}</math> or stronger principles aid such frameworks.
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)