Reading Comprehensive - Transitivity Relation

  • Context: MHB 
  • Thread starter Thread starter highmath
  • Start date Start date
  • Tags Tags
    Reading Relation
Click For Summary
SUMMARY

Transitivity is a fundamental property of both partial order relations and equivalence relations in mathematics. A relation is defined as a set of ordered pairs from a base set, where transitivity ensures that if (a, b) and (b, c) are in the relation, then (a, c) must also be included. Equivalence relations further require the reflexive and symmetric properties, alongside transitivity. Understanding these concepts is crucial for grasping the structure of mathematical relations.

PREREQUISITES
  • Understanding of mathematical relations and ordered pairs
  • Familiarity with partial order relations
  • Knowledge of equivalence relations and their properties
  • Basic mathematical logic and set theory
NEXT STEPS
  • Study the properties of partial order relations in detail
  • Explore equivalence relations and their applications in mathematics
  • Learn about the implications of transitivity in various mathematical contexts
  • Investigate examples of transitive relations in real-world scenarios
USEFUL FOR

Mathematicians, educators, students studying set theory, and anyone interested in the foundational concepts of relations in mathematics.

highmath
Messages
35
Reaction score
0
Can one explain to me the sentence:
"Transitivity (or transitiveness) is a key property of both partial order relations and equivalence relations.".
...in simple words. The sentence is from Wikipedia at address:
https://en.wikipedia.org/wiki/Transitive_relation
 
Physics news on Phys.org
It looks pretty straight forward. The sentence is talking about two kinds of "relations", partial order relations, and equivalence relations. It is saying that the property of "transitivity" is a key property in each.

If your question is about the meanings of those words, a "relation", in mathematics, on sets is any set of "ordered pairs" of members of those sets. We can think of the fact that (a, b) is in that set as meaning that a and b are "related" in this way. In particular a relation is said to be an "order" relation if and only if, whenever (a, b) and (b, c) are pairs in the relation, so is (a, c).

A relation is an "equivalence" (we sometimes use the notation "a~b" to indicate that (a, b) is in the set of ordered pairs) relation if and only if it satisfies 3 conditions:
The "reflexive property": for any member, a, of the base set, we have a~ a (that the pair (a, a) is in the set of ordered pairs).
The "symmetric property": for any two members, a and b, of the base set we have that if a~b (that if (a, b)is in the set of ordered pairs) then b~ a (that (b, a) is in the set of ordered pairs.)
The "transitive property": For any three members, a, b, and c, of the base set we have that if a~b (that if (a, b) is in the set of ordered pairs) and if b~ c (if (b, c) is in the set of ordered pairs) then a~c (that (a, c) is in the set of ordered pairs.

In either case, the order relation or the equivalence relation, "transitivity" is an important property.
 

Similar threads

  • · Replies 1 ·
Replies
1
Views
1K
  • · Replies 35 ·
2
Replies
35
Views
5K
  • · Replies 29 ·
Replies
29
Views
3K
  • · Replies 10 ·
Replies
10
Views
2K
  • · Replies 2 ·
Replies
2
Views
2K
  • · Replies 1 ·
Replies
1
Views
1K
  • · Replies 5 ·
Replies
5
Views
2K
  • · Replies 4 ·
Replies
4
Views
2K
  • · Replies 1 ·
Replies
1
Views
506
Replies
5
Views
2K