3
$\begingroup$

I'm doing a question from a PDF on Abstract Algebra.(The pdf can be found here http://abstract.pugetsound.edu/ 2012 edition). I have to show that the Principle of Well-Ordering implies that $1$ is the smallest natural number; this is only part of the whole question.(Question 14 of Chapter 2).

This is what I got so far.

Proof.

Let $S$ be an arbitrary subset of the Natural Number excluding one. By the Principle of Well-Ordering there exist a least element $X \in S.$ Now add $1$ to $S.$ $1$ is now the least element. Since there is no $X < 1$ in any such set $S,$ $1$ is the smallest element of any set $S$ and therefore the smallest natural number.

$\endgroup$
  • $\begingroup$ I made a formatting edit to your question. I changed all instances of "one" into the numeral $1.$ Please make sure I did not change your question. $\endgroup$ – user2468 Aug 13 '12 at 1:05
  • 5
    $\begingroup$ In the reasoning that you have so far, you are assuming that 1 is smaller than any other natural number by saying "there is no $X < 1$ in any such set"; so you have begged the question. What are the axioms you are starting from? $\endgroup$ – Niel de Beaudrap Aug 13 '12 at 1:12
  • 3
    $\begingroup$ This is a weird question, because that is usually an axiom, or else part of the definition of the $<$ relation. I join Niel de Beaudrap in asking what the axioms are, or at least a link to the PDF, if it is online. $\endgroup$ – MJD Aug 13 '12 at 2:25
  • $\begingroup$ One possibility that makes the question make sense is to define $\mathbb{Z}$ as the essentially unique ordered integral domain with well-ordered positive elements, and $\mathbb{N}$ as the set of positive elements. $\endgroup$ – Chris Eagle Aug 13 '12 at 9:54
5
$\begingroup$

By the Well-Ordering principle, there is a least element $a$ in $\mathbb{N}$. Suppose, to the contrary, that $a<1$. Multiplying both sides of the inequality by $a$, we have $a^2<a$. Since $\mathbb{N}$ is closed under multiplication, $a^2\in\mathbb{N}$, which contradicts the assumption that $a$ is the least element in $\mathbb{N}$.

$\endgroup$
  • 5
    $\begingroup$ You may need to prove as a lemma that $a<b\implies ac<bc$. $\endgroup$ – crf Aug 13 '12 at 1:46
-4
$\begingroup$

let S=N{1},by well-ordering principle, S has a least element, namely x. We claim that x>1. Suppose x<1, and x is a natural number, then we have 1-1=0 is also a natural number, contradiction arises. Hence 1

$\endgroup$

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy

Not the answer you're looking for? Browse other questions tagged or ask your own question.