Question:
Let r be the relation on the power set P(S) of a finite set S of cardinality n. Define r by (A,B) Î r iff AÇB=Æ. What is the cardinality of r for any arbitrary n??Arun, here are some hints (full solution
available on request), see if you can get it without reading all
of them.
1. Given a set A (a subset of S) with m elements, how many sets B
are there so that A and B are related, in terms of n and m?
2. How many sets are there of size m?
3. Suppose you know there are f(n) ordered pairs (A,B) with A and
B disjoint sets (that is, 0 intersection) - how many unordered
pairs are there? Think about how many times an unordered pair
(A,B) is counted as an ordered pair, there is a general case and
a special case.
Arun, here's another hint: fix a particular set A with m elements (we may as well assume that S={1,...,n} and A={n-m+1,...,n}). If we want A intersect B = {} then B has to be contained in S-A (which we can assume is {1,...,n-m}). But any subset of S-A will work. How many such subsets are there?
Dan,
the number of such subsets(that u mention) would be
2n-m
now number of such m element subsets(or number of A's that can be
formed) would be n Cm
therefore total number of such subsets would be,
n Cm *2n-m
|
n å m=0 | n Cm×2n-m=3n |
Arun, you're either very close or
actually right, depending on how you read the question. Now that
I think back, I think that a relation, even if it is symmetric
like this one, is defined in terms of ordered, rather than
unordered, pairs. So you've got it!
My hint (3) was assuming that you were counting unordered pairs
which were related, which is a misinterpretation of the question.
If you were doing this, then you'd have counted (A,B) and (B,A)
twice (for A =/= B). Since A is only related to A when A={}
you've double counted every relation except {{},{}} which you've
counted once. So, the number of unordered relations is
(3n -1)/2+1=(1/2)(3n +1).
Dan,
actually i never read your hint no.2 and 3!!! your first one
itself was a big help(Thanks again!!)
as for your hint 3...
how would the question be if i were to consider that hint
love arun
Arun, that's good. The second paragraph of my last post explains what would have been different if you'd been looking for unordered pairs (which is what hint 3 was about).
Dan,
i understood why u stressed upon hint 3 ...
i only wanted to know if i were supposed to be looking for
unordered pairs in my solution then how would the question be (or
what changes would be there in the already given
question)??
sorry for the trouble!!i am just being a bit cautious ... bcos in
my exams ,i might get a question wherein i would be required to
look for unordered pairs...(so your hint3 would be quite useful
for me in that case)
love arun
Ah!!!!
now i understood..
DAN,
thanks for all the help!!!
love arun