statement theorem
Factor theorem
Statement
Let be a commutative ring, let and let . Then divides in if and only if is a root of .
Remarks
The proof uses the remainder theorem: . So divides exactly when . For example, is a root of , and . The theorem gives the bound on the number of roots of a polynomial over a field.
Explanations
L1 human
Each root gives a linear factor. If , then you can write as times another polynomial. Conversely, a factor makes .
What this node needs for W2
- edge about out: the concepts that the statement is about (0 of 1)
- edge proves in: at least one proof node (0 of 1)
- edge instance_of or illustrates in: one example that shows the statement at work (0 of 1)
- explanation L2 (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 11 nodes in this order. The foundations come first, and the list ends with this node.
- no evidence level
- Group concept
- Ring definition
- Polynomial ring definition
- Degree of a polynomial definition
- Polynomial evaluation definition
- Leading coefficient definition
- Root of a polynomial definition
- Monic polynomial definition
- Division algorithm for polynomials statement
- Remainder theorem statement
- Factor theorem statement
What depends on this
6 nodes use this node, directly or through other nodes.
- Finite subgroups of the multiplicative group of a field are cyclic 0CKGBEJX6B
- The multiplicative group of a finite field is cyclic 0EBZ3G455G
- Impossibility of trisecting the angle 0EWXPZCSZ0
- A polynomial over a field has at most as many roots as its degree 0KJVQV3E0F
- Polynomials of degree two or three are irreducible iff they have no roots 0VNE161QCK
- Primitive element of a finite field 0YAA9CJQXF
Sources
- Web https://en.wikipedia.org/wiki/Factor_theorem, lead section