What Does Equivalence Relations Mean in Set Theory?

AI Thread Summary
Equivalence relations in set theory involve understanding properties like reflexivity and transitivity. A relation is reflexive if every element relates to itself, while transitivity means if (a, b) and (b, c) are in the relation, then (a, c) must also be included. The discussion clarifies that a relation must satisfy these properties as a whole, not just for individual pairs. For example, the relation R is reflexive and transitive, while R1 is not reflexive because it lacks the pair (4, 4). Understanding these definitions is crucial for grasping equivalence relations in set theory.
kingstar
Messages
38
Reaction score
0
Hi,

I'm reading a book on sets and it mentions a set B = {1,2,3,4}
and it says that
R3 = {(x, y) : x ∈ B ∧y ∈ B}
What does that mean? Does that mean every possible combination in the set?

Also the book doesn't clarify this completely but for example using the set B say i had another set

R = {(1,2),(2,3),(1,3),(1,1),(2,2),(3,3),(4,4)},

Would this be clarified as transitive and reflexive? My question is does a set need to have all transitive properties and all the reflexive properties to be called transitive and reflexive.

If i had another set:

R1 = {(1,2),(2,3),(1,3),(1,1),(2,2),(3,3)}

In which i removed (4,4) would this set R1 still be considered reflexive?

Thanks in advance
 
Mathematics news on Phys.org
Your first example is a transitive and reflexive relation. A relation is transitive and reflexive if it satisfies the axioms for transitivity and reflexivity.

Your other example is not reflexive, since 4 is an element of X, but 4 ~ 4 is not satisfied.
 
My question is does a set need to have all transitive properties and all the reflexive properties to be called transitive and reflexive.
You appear to have the wrong idea about the "transitive" and "reflexive" properties. You cannot talk about "all the transitive properties" and "all the reflexive properties" because there is only one of each. We apply the term "reflexive" to the whole relation, not individual pairs. If we have a relation on set A, then it is a subset of AxA, the set of all ordered pairs with each member from set A. Such a relation is called "reflexive" if and only if, for every a in A, (a, a) is in the relation. If a particular such pair, say, (x, x), is in the relation, we do NOT call that pair "a reflexive property". Similarly, a relation is called "transitive" if and only if whenever pairs (a, b) and (b, c) are in the relation, so is (a, c). We do NOT apply the term "transitive" to the individual pairs.
 
  • Like
Likes 1 person
Ahh, thanks! This helped me understand it a lot better
 
Seemingly by some mathematical coincidence, a hexagon of sides 2,2,7,7, 11, and 11 can be inscribed in a circle of radius 7. The other day I saw a math problem on line, which they said came from a Polish Olympiad, where you compute the length x of the 3rd side which is the same as the radius, so that the sides of length 2,x, and 11 are inscribed on the arc of a semi-circle. The law of cosines applied twice gives the answer for x of exactly 7, but the arithmetic is so complex that the...
Is it possible to arrange six pencils such that each one touches the other five? If so, how? This is an adaption of a Martin Gardner puzzle only I changed it from cigarettes to pencils and left out the clues because PF folks don’t need clues. From the book “My Best Mathematical and Logic Puzzles”. Dover, 1994.
Back
Top