Answer:
isn't an equivalence relation. It is reflexive but neither symmetric nor transitive.
Step-by-step explanation:
Let 
denote a set of elements. 
would denote the set of all ordered pairs of elements of 
.
For example, with 
, 
and 
are both members of . However, 
because the pairs are ordered.
A relation on is a subset of . For any two elements
, 
if and only if the ordered pair 
is in 
.
A relation on set is an equivalence relation if it satisfies the following:
- Reflexivity: for any
, the relation needs to ensure that 
(that is: 
.)
- Symmetry: for any , if and only if
. In other words, either both and 
are in , or neither is in .
- Transitivity: for any
, if and 
, then 
. In other words, if and 
are both in , then 
also needs to be in .
The relation (on ) in this question is indeed reflexive. 
, 
, and 
(one pair for each element of ) are all elements of .
isn't symmetric. 
but 
(the pairs in 
are all ordered.) In other words, 
isn't equivalent to 
under even though 
.
Neither is transitive. 
and 
. However, . In other words, under relation , 
and 
does not imply 
.
A line graph. The amount of time to do those things relates more to a line graph
3(x)=6
3(2)=6
which says 6=6
The original price of the running shoes was $45. Divide got a 20% discount on them and saved $9, and had to pay only pay $36.
- Lyla
