This article is rated C-class on Wikipedia's
content assessment scale. It is of interest to the following WikiProjects: | |||||||||||
|
Dedekind completeness is the property that every Dedekind cut of the real numbers is generated by a real number. I would have simply removed the comment that Dedekind completeness is sometimes used to refer to the LUB property, but I wanted to get a second opinion on whether this misnomer is actually in sufficiently common usage. Hurkyl ( talk) 11:15, 2 July 2012 (
The proof seems unconvincing. Someone better than me in mathematics please verify it, and perhaps replace it with the proof in the main page involving the monotone subsequence theorem followed by monotone convergence theorem. Venkatarun95 ( talk) 04:06, 10 July 2014 (UTC)
It says: "suppose that S has an upper bound B1". But S may contain no upper bound at all, all its upper bound being real numbers but not in S. For example, in the set ]0,1[ (or {0,1} if you prefer this notation), there is no upper bound belonging to S. Even its least one, 1, is not member of S. In that case, there is no "B1". and the proof does not work. wku2m5rr ( talk) 07:17, 18 July 2023 (UTC)