Results 1 to 1 of 1

Thread: Generalized Well-Ordering Principle Question

  1. #1
    Super Member Aryth's Avatar
    Feb 2007

    Generalized Well-Ordering Principle Question

    I'm trying to do this proof, but I'm coming across questions about certain properties of well ordered sets that aren't answered by my material. Here's the problem I'm working on:

    For any fixed integer m, prove that the set X = \{a \in \mathbb{Z} : m \leq a\} is well-ordered.

    In trying to prove this, but I've come across a question:

    For any non-empty subset of X, Y, we shall consider the set S = \{b - m : b \in Y\}. Regardless of the set Y, S \subseteq \mathbb{N} \cup \{0\}, and thus S is well-ordered (we have proven that the subset of a well-ordered set is well-ordered). Does this imply that Y is well-ordered? I can't seem to find any information in my class materials that show this to be true, and I can't really see how to prove that property.
    Last edited by Aryth; Aug 20th 2013 at 08:00 PM.
    Follow Math Help Forum on Facebook and Google+

Similar Math Help Forum Discussions

  1. Well ordering principle and the maximum principle
    Posted in the Advanced Algebra Forum
    Replies: 6
    Last Post: Aug 3rd 2010, 09:31 AM
  2. Well Ordering Principle
    Posted in the Discrete Math Forum
    Replies: 4
    Last Post: Mar 10th 2008, 09:16 AM
  3. Well Ordering principle
    Posted in the Discrete Math Forum
    Replies: 7
    Last Post: Feb 27th 2008, 07:53 AM
  4. well-ordering principle
    Posted in the Number Theory Forum
    Replies: 1
    Last Post: Nov 10th 2007, 09:09 PM
  5. The Well-Ordering Principle
    Posted in the Advanced Algebra Forum
    Replies: 4
    Last Post: Feb 18th 2006, 04:47 PM

Search Tags

/mathhelpforum @mathhelpforum