Is there exactly one Y ∈ [X]R such that Y ∩ B = {}?

In summary, we discuss how to prove that the relation R defined on the powerset of A is an equivalence relation and how to find a unique element Y in the equivalence class [X]R such that Y ∩ B = {}. This can be done by first explicitly mentioning that Y = X\B ∈ [X]R and then considering another element Z ∈ [X]R that is disjoint from B and analyzing its relationship with X. This allows us to show that Y = Z and therefore prove the desired statement.
  • #1
Syrus
214
0

Homework Statement



Suppose B ⊆ A and define a relation R on P(A) as follows:

R = {(X,Y) ∈ P(A) x P(A) | (X∆Y) ⊆ B}

a) Show that R is an equivalence relation on P(A).
b) Prove that for every X ∈ P(A) there is exactly one Y ∈ [X]R such that Y ∩ B = { }.

*P(A) is the powerset of A

Homework Equations





The Attempt at a Solution



I have successfully completed part (a) of this exercise. I seem to be having a problem with part (b). My proof so far goes like this:

Let X ∈ P(A) and suppose Y = X\B ∈ [X]R such that Y ∩ B = { }. Now let Z ∈ [X]R such that Y ∩ B = { }. We must show that Y = Z, so let w ∈ Y. Then w ∈ X and w ∉ B...
 
Last edited:
Physics news on Phys.org
  • #2
First you must explicitly mention that Y = X\B ∈ [X]R, which I imagine you might already have done.

Once this is done, consider this other Z ∈ [X]R disjoint from B. We know that X\Z ∪ Z\X ⊆ B. What does this say about Z relative to X?
 

FAQ: Is there exactly one Y ∈ [X]R such that Y ∩ B = {}?

What is an equivalence relation?

An equivalence relation is a relation that satisfies three properties: reflexivity, symmetry, and transitivity. Reflexivity means that every element is related to itself. Symmetry means that if two elements are related, then they can be swapped in the relation. Transitivity means that if two elements are related, and one of them is related to a third element, then the other two elements are also related.

How do you prove that a relation is an equivalence relation?

To prove that a relation is an equivalence relation, you need to show that it satisfies the three properties of reflexivity, symmetry, and transitivity. This can be done by providing examples of elements and showing that they satisfy these properties, or by using logical arguments to show that the properties hold for all elements in the relation.

What are some common examples of equivalence relations?

Some common examples of equivalence relations include "is equal to" in mathematics, "is the same age as" in a group of people, and "is congruent to" in geometry. In each of these examples, the relation satisfies the three properties of reflexivity, symmetry, and transitivity.

Why is proving an equivalence relation important?

Proving an equivalence relation is important because it allows us to understand the structure and properties of a set or collection of elements. It also allows us to classify elements into distinct groups based on their relation, and this can be useful in solving problems or making decisions.

Can a relation be partially an equivalence relation?

No, a relation cannot be partially an equivalence relation. It either satisfies all three properties of reflexivity, symmetry, and transitivity, or it does not. If a relation fails to satisfy one of these properties, it is not an equivalence relation.

Back
Top