The infimum of the set of reciprocals of the natural numbers is zero.

Let S={1n:nN}
The infimum infS=0.


Proof

for all sS, s>0, so 0 a lower bound.

Suppose for the sake of contradiction there is some w>0 such that w is the greatest lower bound.
Then 1w>0
By the Archimedean property, there is some yN such that 1w<y.
Then w>1y.
But yN, so wS
so w not a lower bound (a contradiction)
reductio ad absurdum, QED.


Powered by Forestry.md