Science Fair Project Encyclopedia
This description gets a bit murky to the non-mathematician at the definition of the polynomial. What is t? What is a "polynomial ring"? Is there a simpler way to describe this concept without bringing in so many other mathematical areas, or at least a way to make them optional? Perhaps a good example is required to help ground the definition, although that might damage the generality. Brent Gulanowski 19:01, 30 Nov 2003 (UTC)
Well, it's dense rather than murky. But I agree, really. I've added some initial comments that are intended to clarify what is happening. We'll see if these are to others' taste.
Charles Matthews 17:22, 1 Dec 2003 (UTC)
Well, I'm sorry to say that I wasn't too happy with the motivational part, since it didn't really say what the goal was (to get a polynomial whose zeros are the eigenvalues) and it used the fact that every matrix can be approximated by diagonalizable ones, which is not intuitively clear. I tried to write some other motivational intro.
The approximation business - it may not be intuitive, but it certainly helps a great deal to understand linear algebra if one has this concept. I was once told that my proof of the Cayley-Hamilton theorem using it was the 'worst ever'. But that was by a functional-analyst; while to an algebraic geometer it is just a good way to use the Zariski topology, and then use the fact that identities hold on closed sets.
So, I wonder where it belongs in the WP articles. Charles Matthews 07:34, 15 Jul 2004 (UTC)
Roots and zeroes
I think this is a somewhat pedantic point. But given the edit comment The values for which a polynomial has a value of zero are called 'roots' and not 'zeros, I think it should be pointed out that in P. M. Cohn's Algebra, it is polynomials that have zeroes and equations P = 0 that have roots.
Charles Matthews 09:10, 15 Jul 2004 (UTC)
The contents of this article is licensed from www.wikipedia.org under the GNU Free Documentation License. Click here to see the transparent copy and copyright details