Assume that R is an ordered field (i.e. R is a model of real numbers). We define the set of natural numbers N as the smallest inductive set containing 1R (multiplicative identity of the field R), where by definition a set X⊂R is inductive if x∈X implies x+1R∈X.
Now I wish to prove that every nonempty subset M of N contains a minimal element. My book proves it as follows: If 1R∈M then 1R is the minimal element, otherwise consider the set E:=N−M, which contains 1R. The set E must contain a natural number n such that all natural numbers not larger than n belong to E but n+1 belongs to M; if there were no such n, the set E which contains 1R would contain along with each of its elements n, the number n+1R too, hence it would equal the whole N, a contradiction. The number n+1R so found is the minimal element of M.
But I do not think the bold-faced argument is correct (why E would contain n+1 if n∈E?), or if it is correct according to what axioms is it correct?
Answer
Assume that there is no such n as above, so that for every n either for some k≤n we have k is not an element of E or n+1∈E. I prove the former case cannot happen: For 1 it does not happen. If for n it does not happen, for n+1 the only case to check is that n+1 itself is an element of E as well (since all other naturals less than or equal to n by the induction hypothesis is already in E. If n+1 were not in E then it would be in M, then there would be indeed such an n as in the question. So n+1 would be in E. Hence E=N.
No comments:
Post a Comment