Math 2.0

statement theorem

Factor theorem

Statement

Let RR be a commutative ring, let f∈R[x]f \in R[x] and let c∈Rc \in R. Then x−cx - c divides ff in R[x]R[x] if and only if cc is a root of ff.

Remarks

The proof uses the remainder theorem: f=(x−c)q+f(c)f = (x - c) q + f(c). So x−cx - c divides ff exactly when f(c)=0f(c) = 0. For example, 11 is a root of x3−1x^3 - 1, and x3−1=(x−1)(x2+x+1)x^3 - 1 = (x - 1)(x^2 + x + 1). 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 f(c)=0f(c) = 0, then you can write ff as (x−c)(x - c) times another polynomial. Conversely, a factor x−cx - c makes f(c)=0f(c) = 0.

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.

Each node uses the nodes above it. The colour of the bar on a box shows the evidence level, and the box also gives it as text. The list below has the same nodes.
  • no evidence level
  1. Group concept
  2. Ring definition
  3. Polynomial ring definition
  4. Degree of a polynomial definition
  5. Polynomial evaluation definition
  6. Leading coefficient definition
  7. Root of a polynomial definition
  8. Monic polynomial definition
  9. Division algorithm for polynomials statement
  10. Remainder theorem statement
  11. Factor theorem statement

What depends on this

6 nodes use this node, directly or through other nodes.

Sources

  1. Web https://en.wikipedia.org/wiki/Factor_theorem, lead section