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!
====Cauchy reals==== In some frameworks of analysis, the name ''real numbers'' is given to such well-behaved sequences or rationals, and relations such as <math>x\cong y</math> are called the ''equality or real numbers''. Note, however, that there are properties which can distinguish between two <math>\cong</math>-related reals. In contrast, in a set theory that models the naturals <math>{\mathbb N}</math> and validates the existence of even classically uncountable function spaces (and certainly [[Constructive set theory#Constructive Zermelo–Fraenkel|say <math>{\mathsf{CZF}}</math>]] or even <math>{\mathsf{ZFC}}</math>) the numbers equivalent with respect to "<math>\cong</math>" in <math>{\mathbb Q}^{\mathbb N}</math> may be collected into a set and then this is called the ''[[Construction of the real numbers#Construction from Cauchy sequences|Cauchy real number]]''. In that language, regular rational sequences are degraded to a mere representative of a Cauchy real. Equality of those reals is then given by the equality of sets, which is governed by the set theoretical [[axiom of extensionality]]. An upshot is that the set theory will prove properties for the reals, i.e. for this class of sets, expressed using the logical equality. Constructive reals in the presence of appropriate choice axioms will be Cauchy-complete but not automatically order-complete.<ref>Robert S. Lubarsky, [https://arxiv.org/pdf/1510.00639.pdf ''On the Cauchy Completeness of the Constructive Cauchy Reals''], July 2015</ref>
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)