- #1
matqkks
- 285
- 5
- TL;DR Summary
- Application of well ordeing principle
In many books on number theory they define the well ordering principle (WOP) as:
Every non- empty subset of positive integers has a least element.
Then they use this in the proof of the division algorithm by constructing non-negative integers and applying WOP to this construction. Is it possible to apply the WOP to a subset of non-negative integers? Am I being too pedantic?
Every non- empty subset of positive integers has a least element.
Then they use this in the proof of the division algorithm by constructing non-negative integers and applying WOP to this construction. Is it possible to apply the WOP to a subset of non-negative integers? Am I being too pedantic?