I got the concept about well ordering but I could not figure out how to connect it with the simple induction. I beleive it should be simple since all we learned about well ordering was a set must have smallest element. Okay, If a set has smallest element does this mean that the smallest element is true then the rest of the element must be true unless I assume that all elements including the smallest element belong to some group.
Here I get confused, How can I prove that my assumption is hundred percent correct.
Otherwise, it would be very clear and self explanatory to say that my assumption is true due to blah... mathematic proof therefore my smallest number belong to blah.. group and therefore the n+1 number following the smallest number also belong to blah... group and vallah there we go my proof is done. May be I am missing something here. I think I should talk to prof about this matter.
Subscribe to:
Post Comments (Atom)
No comments:
Post a Comment