Results 1 to 4 of 4

Math Help - A sets proof

  1. #1
    Member
    Joined
    Dec 2008
    From
    Auckland, New Zealand
    Posts
    189

    A sets proof

    Hi again, another question I am having trouble starting:

    Let I be a nonempty subset of \mathbb{Z} such that:

    (\forall x \in I)(\forall y \in I)[(x-y) \in I] and (\forall z \in \mathbb{Z})(\forall x \in I)[z \cdot x \in I].

    Show that for some n \in I, I = \{z \in \mathbb{Z} \colon z = xn \ for \ some \ x \in \mathbb{Z}\}.

    Please no full solutions, but if someone could show me how to proceed
    Follow Math Help Forum on Facebook and Google+

  2. #2
    Banned
    Joined
    Oct 2009
    Posts
    4,261
    Quote Originally Posted by nzmathman View Post
    Hi again, another question I am having trouble starting:

    Let I be a nonempty subset of \mathbb{Z} such that:

    (\forall x \in I)(\forall y \in I)[(x-y) \in I] and (\forall z \in \mathbb{Z})(\forall x \in I)[z \cdot x \in I].

    Show that for some n \in I, I = \{z \in \mathbb{Z} \colon z = xn \ for \ some \ x \in \mathbb{Z}\}.

    Please no full solutions, but if someone could show me how to proceed


    1) Take a minimal positive element in I (why is there such an element?)

    2) Applying Euclides algorithm show that any element in I is an integer multiple of the element you found in (1)

    3) Go grab a beer and be happy.

    Tonio
    Follow Math Help Forum on Facebook and Google+

  3. #3
    Member
    Joined
    Dec 2008
    From
    Auckland, New Zealand
    Posts
    189
    Quote Originally Posted by tonio View Post
    1) Take a minimal positive element in I (why is there such an element?)

    2) Applying Euclides algorithm show that any element in I is an integer multiple of the element you found in (1)

    3) Go grab a beer and be happy.

    Tonio
    I know why a minimal element of I exists, but why can we conclude a minimal positive element exists?

    Also, how would I apply Euclidean algorithm to something this abstract?
    Follow Math Help Forum on Facebook and Google+

  4. #4
    MHF Contributor
    Joined
    Oct 2009
    Posts
    5,417
    Thanks
    718
    I know why a minimal element of I exists, but why can we conclude a minimal positive element exists?
    There is no minimal element of I. Take any x\in I. Then the set \{zx\mid z\in\mathbb{Z}\}\subseteq I does not have a minimal element.

    To prove that there is a minimal positive element, it is sufficient to know that there is any positive element. This is natural numbers we are talking about

    Also, how would I apply Euclidean algorithm to something this abstract?
    Take any (w.l.o.g. positive) x\in I and the minimal positive element m of I. Then the GCD of x and m is a linear combination of x and m by Bézout's identity, an application of the Euclid's algorithm. From there it is easy to show that m divides x.
    Follow Math Help Forum on Facebook and Google+

Similar Math Help Forum Discussions

  1. Help with Proof of Sets
    Posted in the Discrete Math Forum
    Replies: 1
    Last Post: October 20th 2010, 08:25 PM
  2. Sets proof
    Posted in the Discrete Math Forum
    Replies: 3
    Last Post: November 16th 2008, 04:03 PM
  3. Proof with sets
    Posted in the Discrete Math Forum
    Replies: 1
    Last Post: May 8th 2008, 01:11 AM
  4. Proof - sets
    Posted in the Discrete Math Forum
    Replies: 5
    Last Post: January 11th 2008, 03:32 PM
  5. Proof of sets
    Posted in the Business Math Forum
    Replies: 2
    Last Post: February 3rd 2007, 04:29 AM

Search Tags


/mathhelpforum @mathhelpforum