- #1
Matherer
- 2
- 0
I am trying to understand the following theorem:
An ordered field has the least upper bound property iff it has the greatest lower bound property.
Before I try going through the proof, I have to understand the porblem. The problem is, I don't see why this would be true in the first place... I can have an upper bound without a lower can't I? Can someone explain?
An ordered field has the least upper bound property iff it has the greatest lower bound property.
Before I try going through the proof, I have to understand the porblem. The problem is, I don't see why this would be true in the first place... I can have an upper bound without a lower can't I? Can someone explain?