How to write a mathematically rigorous definition of completeness

royzizzle
Messages
48
Reaction score
0
I know that the definition of completeness is that a set contains the limits of rational numbers.

and I know the definition of convergence is that for all e>0 there exists N such that for n>=N |xn - x| < e where x is the limit of the sequence.

how to combine the two?
thanks in advance
 
Physics news on Phys.org
I know the definition in terms of metric spaces, so maybe this is what youre looking for...

A metric space (E,d) is called complete if every Cauchy sequence in E converges in E.

of course the definition for cauchy sequence is a sequence given any e>0
there is a positive integer N such that d(pm,pn) < e whenever n,m >N
 
There are, in fact, six properties of the real numbers that are equivalent to "completeness".

1. The least upper bound property (every non-empty set having an upper bound has a least upper bound) and its "twin" the greatest lower bound property.

2. Monotone convergence (every increasing sequence having an upper bound converges and its "twin" that every decreasing sequence having a lower bound converges.)

3. The Cauchy Criterion (every Cauchy sequence converges)

4. The Bolzano-Weierstrass property (every bounded sequence contains a convergent subsequence.)

5. Every closed and bounded set is compact.

6. The set of all real numbers, with the usual metric, is a connected set.

Given anyone of those you can prove the other five.
 
Last edited by a moderator:
Hi all, I've been a roulette player for more than 10 years (although I took time off here and there) and it's only now that I'm trying to understand the physics of the game. Basically my strategy in roulette is to divide the wheel roughly into two halves (let's call them A and B). My theory is that in roulette there will invariably be variance. In other words, if A comes up 5 times in a row, B will be due to come up soon. However I have been proven wrong many times, and I have seen some...
Namaste & G'day Postulate: A strongly-knit team wins on average over a less knit one Fundamentals: - Two teams face off with 4 players each - A polo team consists of players that each have assigned to them a measure of their ability (called a "Handicap" - 10 is highest, -2 lowest) I attempted to measure close-knitness of a team in terms of standard deviation (SD) of handicaps of the players. Failure: It turns out that, more often than, a team with a higher SD wins. In my language, that...
Back
Top