statement theorem
A polynomial over a field has at most as many roots as its degree
Statement
Let be a field and let be a nonzero polynomial of degree . Then has at most roots in . More precisely, the sum of the multiplicities of the roots of in is at most .
Remarks
The proof is an induction on with the factor theorem: a root gives with . The same statement holds over every integral domain. It fails without this hypothesis: in , the polynomial has the four roots .
Explanations
L1 human
A polynomial of degree over the real numbers has at most two roots. In general, each root takes away one linear factor, and you can do this at most times. Strange rings like can break this rule, because they have zero divisors.
What this node needs for W1
- an inventory row: the row of the inventory that the node accounts for (0 of 1)
The writing levels say how complete the text of a node is. They do not measure its truth.
What this needs
To read this node, read these 17 nodes in this order. The foundations come first, and the list ends with this node.
- no evidence level
- Group concept
- Ring definition
- Commutative ring definition
- Polynomial ring definition
- Zero divisor definition
- Degree of a polynomial definition
- Integral domain definition
- Polynomial evaluation definition
- Leading coefficient definition
- Root of a polynomial definition
- Monic polynomial definition
- Degree of a product statement
- Multiplicity of a root definition
- Division algorithm for polynomials statement
- Remainder theorem statement
- Factor theorem statement
- A polynomial over a field has at most as many roots as its degree statement
What depends on this
3 nodes use this node, directly or through other nodes.
Sources
- Web https://en.wikipedia.org/wiki/Polynomial, Solving equations