Phrase "R is a binary relation on a set A" is commonly used to mean that R is a subset of the cartesian product A x A. That is, R is a collection of ordered pairs of elements of A.
Everywhere I look, binary relation is defined as the set of ordered pairs containing elements from 2 sets.
But then I get a a problem that says
How many binary relations are there on the set (1, 2, 3}?
This doesn't make sense to me. How can you have a relation with only 1 set?
I just took the cartesian product and found that there were 9 results. It was more of a guess than anything else.
It took a few times reading to figure this out a little more.
May I present you with another example, and maybe you could help me figure out what I'm doing wrong?
I am presented with the set {1,2}
So, the product is {(1,1), (1,2), (2,1), (2,2)}
and there would be 16 relations?
I am then asked a series of questions such as "How many relations are reflexive? Symmetrical?"
I know I need to set up a matrix showing all the possible relations, but... aren't they all possible? Wouldn't the matrix be all "1"s?
Think about what the definition is.
A relation on a set is a subset of the Cartesian product.
So you have to think about all the possible subsets of:
A reflexive relation is one which includes (1,1) and (2,2). (By looking hard at the definition of "reflexive", ask yourself: why?)
A symmetric relation is one where, if (a, b) is in the relation, then (b, a) is also in that relation.
So as there's only 16 possible relations, it's feasible to list them all out and examine them one by one for whether they have all these properties.
For example, is reflexive, because it has (1, 1) and (2, 2), but not symmetric - because it has (1, 2) but not (2, 1).
And so on. As I say, list them all out and look at them - it's an instructional exercise in its own right.