Results 1 to 1 of 1

Math Help - well orderable set, recursion

  1. #1
    Junior Member
    Joined
    Mar 2009
    Posts
    29

    well orderable set, recursion

    Suppose C is a well orderable set, f: C \times C \rightarrow C, A \subseteq C, and let

    A_f =_{df} \cap \{ X \subseteq C | A \subseteq X \text{ }\& \text{ }f[X \times X] \subseteq X \}

    be the closure of A under f. Define the sets  \{ A_n \}_{n \in \mathbb{N}} by the recursion

    A_0=A, A_{n+1}=A_n \cup f[A_n \times A_n],

    and show that

    A_f=\cup_{n \in \mathbb{N}} A_n.

    I do not have any good ideas on how to prove this. It looks like this is true the way the sets are built up, but I do not see how to argue that. Thanks.
    Last edited by eskimo343; March 26th 2010 at 01:15 PM.
    Follow Math Help Forum on Facebook and Google+

Similar Math Help Forum Discussions

  1. Recursion help.
    Posted in the Discrete Math Forum
    Replies: 1
    Last Post: March 28th 2010, 02:23 PM
  2. recursion
    Posted in the Discrete Math Forum
    Replies: 3
    Last Post: December 13th 2009, 07:00 AM
  3. Recursion Depth
    Posted in the Algebra Forum
    Replies: 0
    Last Post: October 27th 2009, 11:01 AM
  4. Recursion
    Posted in the Discrete Math Forum
    Replies: 4
    Last Post: September 30th 2008, 09:40 PM
  5. Recursion
    Posted in the Discrete Math Forum
    Replies: 1
    Last Post: September 16th 2008, 06:24 PM

Search Tags


/mathhelpforum @mathhelpforum