PlanetMath (more info)
 Math for the people, by the people.
Encyclopedia | Requests | Forums | Docs | Wiki | Random | RSS  
Login
create new user
name:
pass:
forget your password?
Main Menu
Owner confidence rating: Very high Entry average rating: No information on entry rating
[parent] zero of polynomial (Definition)

Let $ R$ be a subring of a commutative ring $ S$. If $ f$ is a polynomial in $ R[X]$, it defines an evaluation homomorphism from $ S$ to $ S$. Any element $ \alpha$ of $ S$ satisfying

$\displaystyle f(\alpha) = 0$
is a zero of the polynomial $ f$.

If $ R$ also is equipped with a non-zero unity, then the polynomial $ f$ is in $ S[X]$ divisible by the binomial $ x\!-\!\alpha$ (cf. the factor theorem).

For example, the real number $ \sqrt{2}$ ( $ \in \mathbb{R}$) is a zero of the polynomial $ X^2\!-\!2$ of the polynomial ring $ \mathbb{Q}[X]$.



"zero of polynomial" is owned by pahio.
(view preamble | get metadata)

View style:

See Also: polynomial function

Also defines:  zero of the polynomial

This object's parent.
Log in to rate this entry.
(view current ratings)

Cross-references: polynomial ring, real number, factor theorem, binomial, divisible, non-zero unity, evaluation homomorphism, polynomial, commutative ring, subring
There are 4 references to this entry.

This is version 3 of zero of polynomial, born on 2008-08-27, modified 2008-08-28.
Object id is 10962, canonical name is ZeroOfPolynomial.
Accessed 377 times total.

Classification:
AMS MSC12E05 (Field theory and polynomials :: General field theory :: Polynomials )
 11C08 (Number theory :: Polynomials and matrices :: Polynomials)
 13P05 (Commutative rings and algebras :: Computational aspects of commutative algebra :: Polynomials, factorization)

Pending Errata and Addenda
None.
Discussion
Style: Expand: Order:
forum policy

No messages.

Interact
post | correct | update request | add derivation | add example | add (any)