Friday, January 14, 2005

How to sum binomials

Could somebody please point out to me how to prove

I am not able to produce it with the usual tricks for manipulating binomials.

This arises in the following problem: In dimension D=2n, this shows that Fierzing works, that is that the product of two chiral Weyl spinors can be reexpressed as a linear combination of even dimensional forms. Maple gives me confidence that the above expression is correct, but how can I convince myself (and worse: students) that it holds?


Anonymous said...

That's easy...

Sorry, I don't know how to display math equations on this blog.








Anonymous said...

You obviously have a lower standard of proof for yourself compared to your students... :)

Anonymous said...

You ask why the sum of 2n choose 2k from k = 0 to
k = n is 4^n/2.

Well, this is the number of subsets of even size of
a 2n-element set.

The number of subsets of a 2n-element set is 4^n,
and half these are even. That does it.

By the way, I'm John Baez. I'm only posting
"anonymously" because I couldn't manage to log in
on that blogger website. I gave them a username,
password, my name and an email address, and it all
seemed to work fine.

But when I try to "sign in" to post something, I keep
getting looped around back to the same page where I'm
supposed to type my username and password.

Any hints?

John Baez said...

Hmm, this time I was able to log on!

Anyway, there's a tricky step in the proof I just gave.
The trick is to show that precisely half the subsets of
any finite set have an even number of elements.

While plausible (and true), your students may still have
some fun showing it.

Anonymous said...


setting x=1 gives the proof.