reflexive, symmetric, antisymmetric, transitive?

• Apr 6th 2011, 11:07 PM
jander1
reflexive, symmetric, antisymmetric, transitive?
For each of these binary relations, determine whether they are reflexive, symmetric,
antisymmetric, transitive. Give reasons for your answers and state whether or not they
form order relations or equivalence relations.

On the set {audi, ford, bmw, mercedes}, the relation
{(audi, audi), (audi, bmw), (bmw, bmw), (ford, ford), (mercedes,mercedes),
(audi, mercedes), (audi, ford), (bmw, ford), (mercedes, ford) }.

Let F be the set of all possible filenames consisting of character strings of at
least one character. The relation R contains all pairs of names (name1, name2)
where the first eight characters of name1 are the same as the first eight
characters of name2, or if name1 and name 2 have fewer than eight characters
and are exactly the same.
• Apr 7th 2011, 12:05 AM
FernandoRevilla
What have you tried so far?
• Apr 7th 2011, 12:51 AM
jander1
I don't really know were to start :(
• Apr 7th 2011, 01:38 AM
FernandoRevilla
Quote:

Originally Posted by jander1
I don't really know were to start :http://mathhelpforum.com/discrete-math/177098-reflexive-symmetric-antisymmetric-transitive.html#post638179\" rel=\"nofollow\">
I don't really know were to start :(

Suppose the parent set is $\{a_1,a_2,a_3,a_4\}$. A relation defined on this set is reflexive if the relation-set contains the element $(a_i,a_i)$ for all $i=1,2,3,4$. Is it the case here?
A relation defined on this set is symmetric if for any $(a_i,a_j)$ belonging to the relation-set, the element $(a_j,a_i)$ is also present in the relation-set. Is it the case here for all $i,j=1,2,3,4$?
A relation defined on this set is transitive if for two elements $(a_i,a_j)$ and $(a_j,a_k)$ belonging to the relation-set, the element $(a_i,a_k)$ is also present in the relation-set. Is it the case here for all $i,j,k=1,2,3,4?$