Scribd Logo
Upload

Welcome to Scribd!

  • Pow 7

    Uploaded by

    Becca Jahr
    12 views1 page
    The document proves that if R and S are equivalence relations on a set A, and T is the intersection of R and S, then T is also an equivalence relation on A. It shows that T is reflexive by stating that if x is in A, then (x,x) will be in both R and S since they are both reflexive relations, and thus (x,x) will be in their intersection T, making T reflexive. It also notes that to complete the proof it needs to show T is symmetric and transitive using set notation.

    Original Description:

    Original Title

    pow7

    Copyright

    © Attribution Non-Commercial (BY-NC)

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    The document proves that if R and S are equivalence relations on a set A, and T is the intersection of R and S, then T is also an equivalence relation on A. It shows that T is reflexive by stating that if x is in A, then (x,x) will be in both R and S since they are both reflexive relations, and thus (x,x) will be in their intersection T, making T reflexive. It also notes that to complete the proof it needs to show T is symmetric and transitive using set notation.

    Copyright:

    Attribution Non-Commercial (BY-NC)
    Download as PDF, TXT or read online from Scribd
    Flag for inappropriate content
    12 views1 page

    Pow 7

    Uploaded by

    Becca Jahr
    The document proves that if R and S are equivalence relations on a set A, and T is the intersection of R and S, then T is also an equivalence relation on A. It shows that T is reflexive by stating that if x is in A, then (x,x) will be in both R and S since they are both reflexive relations, and thus (x,x) will be in their intersection T, making T reflexive. It also notes that to complete the proof it needs to show T is symmetric and transitive using set notation.

    Copyright:

    Attribution Non-Commercial (BY-NC)
    Download as PDF, TXT or read online from Scribd
    Flag for inappropriate content
    of 1

    POW 7

    It’s Not Easy Being Green


    Rebecca Jahr
    March 21, 2011

    Theorem: Suppose that R and S are equivalence relations on a set A and that T = R∩S.
    Then T is an equivalence relation on A.

    Proof:We will show that T is reflexive, symmetric, and transitive. First we will prove that
    T is reflexive. Let x ∈ A. Since R is reflexive, (x, x) ∈ R. Since S is reflexive, (x, x) ∈ S.
    Then (x, x) ∈ R ∩ S = T . Thus T is reflexive.
    
    You need to show that T is reflexive, symmetric, and transitive. It might be good to
    use set notation on this one. For example for reflexivity: Let x ∈ A. Since R is reflexive,
    (x, x) ∈ R. Since S is reflexive, (x, x) ∈ S. Then (x, x) ∈ R ∩ S = T . Thus T is reflexive.

    You might also like