Results 1 to 1 of 1

Thread: well orderable set, recursion

  1. #1
    Junior Member
    Joined
    Mar 2009
    Posts
    29

    well orderable set, recursion

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

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

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

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

    and show that

    $\displaystyle 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; Mar 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: Mar 28th 2010, 02:23 PM
  2. recursion
    Posted in the Discrete Math Forum
    Replies: 3
    Last Post: Dec 13th 2009, 07:00 AM
  3. Recursion Depth
    Posted in the Algebra Forum
    Replies: 0
    Last Post: Oct 27th 2009, 11:01 AM
  4. Recursion
    Posted in the Discrete Math Forum
    Replies: 4
    Last Post: Sep 30th 2008, 09:40 PM
  5. Recursion
    Posted in the Discrete Math Forum
    Replies: 1
    Last Post: Sep 16th 2008, 06:24 PM

Search Tags


/mathhelpforum @mathhelpforum