Let X be a set. A partition of X is a subset

In summary, the conversation discusses partitions and equivalence relations in the context of a set X. It is stated that a partition of X is a subset of P(X) where for every x in X, there is precisely one subset A in the partition that contains x. It is also mentioned that if R is an equivalence relation on X, then the collection of relative sets R(x) forms a partition. The conversation then goes on to discuss proving a theorem regarding the equivalence of two relations, R_pi and R_(pi_R). The speaker mentions starting with proving that R_pi is an equivalence relation, and then possibly needing to prove that the collection of relative sets R(x) forms a partition. The conversation ends with the speaker stating that the conditions
  • #1
laminatedevildoll
211
0
Let X be a set. A partition of X is a subset [tex]\pi \subseteq P(X)[/tex] so

that for every [tex]x \in X[/tex] there is precisely one [tex]A \in \pi[/tex] so

that [tex]x\in A[/tex]. If R is an equivalence relation on X, then

[tex]\pi_R = {R(x): x \in X} [/tex]is a partition.

If [tex]\pi[/tex] is partition of X then

[tex]R_\pi= \bigcup[/tex] [tex]A[/tex] x [tex]A[/tex] is an equivalence

relation, where

[tex]A\in \pi[/tex] Furthermore,

[tex]\pi_(R_\pi)=\pi[/tex] where [tex]\pi_(R_\pi)[/tex] (pi sub R sub pi)

[tex]R_(\pi_R)= R[/tex]

To prove this theorem, I have started out by proving that [tex]R_\pi[/tex] is

an equivalence relation, for reflexitivity, symmetry, and transitivity. In order

to complete the proof, do I need to prove [tex]\pi_(R_\pi)=\pi[/tex]

[tex]R_(\pi_R)= R[/tex]

Do I do that by using the following conditions?

1. [tex]x \in R(X)[/tex] for each [tex]x \in X[/tex]

2. If [tex]y \in R(x)[/tex], then [tex]x \in R(y)[/tex]

3. If [tex]R(x) \cap R(y) \noteq \empty[/tex], then [tex]R(x)= R(y)[/tex]
 
Last edited:
Physics news on Phys.org
  • #2
Your two statements (which are two be proved) can be interpreted as,
1. Given that R is an equivalence relation, show that the collection of relative sets R(x) form a partition
2. Given that P(pi) is a partition, show that the above described relation is an equivalence relation.

So yes, i guess you need to show these statements as true.
The conditions you want to use will be useful but just remember the three properties of equivalence relation and use whatever you can accordingly.

-- AI
 
  • #3


Yes, in order to fully prove the theorem, you would need to prove that \pi_(R_\pi)=\pi and R_(\pi_R)= R. This can be done by using the conditions you mentioned and showing that both sides contain the same elements. In other words, you would need to show that for any A \in \pi, there exists an x \in X such that A = R(x), and vice versa. Similarly, for R_(\pi_R)= R, you would need to show that for any x,y \in X, x and y are related by R if and only if there exists an A \in \pi_R such that x,y \in A. This can also be done by using the conditions you mentioned and showing that both sides are equivalent. Once you have proven these two statements, you can conclude that \pi_(R_\pi)=\pi and R_(\pi_R)= R, thus completing the proof.
 

1. What is a set in mathematics?

A set is a collection of elements or objects. These elements can be anything, such as numbers, letters, or even other sets.

2. What is a partition of a set?

A partition of a set is a way of dividing the set into smaller subsets, where each element of the original set is included in exactly one of the subsets. In other words, the subsets are non-overlapping and together they cover the entire original set.

3. How is a partition different from a subset?

A subset is a smaller set that is contained within a larger set. In contrast, a partition divides a set into smaller subsets that, when combined, make up the original set. Also, unlike a subset, the subsets in a partition are non-overlapping.

4. Can a set have more than one partition?

Yes, a set can have multiple partitions. For example, the set of even numbers can be partitioned into subsets of even and odd numbers, or into subsets of prime and composite numbers.

5. How is a partition useful in mathematics?

Partitions are useful in many areas of mathematics, including combinatorics, group theory, and topology. They provide a way to break down a complex set into smaller and more manageable subsets, making it easier to analyze and understand. They also have applications in various real-world problems, such as scheduling and data analysis.

Similar threads

Replies
4
Views
323
Replies
2
Views
121
  • Set Theory, Logic, Probability, Statistics
Replies
1
Views
1K
  • Set Theory, Logic, Probability, Statistics
Replies
9
Views
1K
  • Calculus and Beyond Homework Help
Replies
1
Views
1K
  • Set Theory, Logic, Probability, Statistics
Replies
2
Views
1K
  • Set Theory, Logic, Probability, Statistics
Replies
3
Views
2K
  • Calculus and Beyond Homework Help
Replies
3
Views
507
  • Set Theory, Logic, Probability, Statistics
Replies
1
Views
2K
  • Set Theory, Logic, Probability, Statistics
Replies
7
Views
2K
Back
Top