Want to take part in these discussions? Sign in if you have an account, or apply for one below
Vanilla 1.1.10 is a product of Lussumo. More Information: Documentation, Community Support.
I started an article bijective proof.
In a section on polynomial identities, I give a proof that polynomials in several variables are uniquely determined by their values at natural number arguments, an intuitively obvious statement if there ever was one. Without bothering to look up whether there are standard nice proofs, I cooked up a proof myself. Please let me know if you know of nicer proofs.
Edit: Having written this, it’s painfully obvious how to prove more general statements even more simply. Ah well. I still invite comments.
It suffices to prove the following:
Let be an infinite integral domain and let be an infinite subset of . Given , if for all , then .
We proceed by induction on . The case is well known (at least if is an algebraically closed field – but we can embed an integral domain in the algebraic closure of its fraction field). If the claim holds for , then given such that for all , we know that is the zero polynomial for all ; but then is a one-variable polynomial over that vanishes at infinitely many points, so .
Yep, thanks. I would have added the (obvious) remark that we first embed into its field of fractions , and then use well-known facts about .
So I went ahead and supplanted the earlier clunky proof with a version of Zhen Lin’s (thanks again).
Doron Zeilberger is fond of proving identities by checking them at the smallest few nontrivial inputs, eg 1,2 and 3, where these are trivial to calculate.
I added some details to some examples that had been there. Will probably write (and rewrite) more later.
1 to 6 of 6