Jerrek
18-09-2003, 20:24
Hey guys... I'm looking for some answers here.
Given:
http://home.cogeco.ca/~johannj/net_stuff/combin.jpg
I need to give a combinatorial proof of this identity, and I also need to give an algebraic proof for this identity.
Now the combinatorial part is relatively easy if I understand it. Basically, on the left you're counting the number of even sets (2i being even) and on the right you're counting the number of odd sets (2i + 1 being odd). So, given a set S it gets mapped to:
[ {1, 2, ..., n} \ S, if n is not an element of S
[ ({1, 2, ..., n} \ S) UNION {n}) if n is an element of S
So basically you have a one to one correspondence:
For example, given a set {1, 2, 3}, you have:
{1}, {2}, {3}, {1, 2, 3} -- odd subsets
{2,3}, {1,3}, {1,2}, empty set -- even subsets
See? Each one of the odd subsets has a complement in the even subsets.
Now the question is... how to prove this algebraiclly? They give a hint to expand (1 - 1)^n. Eh. Help?
Given:
http://home.cogeco.ca/~johannj/net_stuff/combin.jpg
I need to give a combinatorial proof of this identity, and I also need to give an algebraic proof for this identity.
Now the combinatorial part is relatively easy if I understand it. Basically, on the left you're counting the number of even sets (2i being even) and on the right you're counting the number of odd sets (2i + 1 being odd). So, given a set S it gets mapped to:
[ {1, 2, ..., n} \ S, if n is not an element of S
[ ({1, 2, ..., n} \ S) UNION {n}) if n is an element of S
So basically you have a one to one correspondence:
For example, given a set {1, 2, 3}, you have:
{1}, {2}, {3}, {1, 2, 3} -- odd subsets
{2,3}, {1,3}, {1,2}, empty set -- even subsets
See? Each one of the odd subsets has a complement in the even subsets.
Now the question is... how to prove this algebraiclly? They give a hint to expand (1 - 1)^n. Eh. Help?