Dismiss Notice
Join Physics Forums Today!
The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

Irreducibles of small degree

  1. Nov 17, 2009 #1
    Proposition. A polynomial of degree 2 or 3 over a field F is reducible iff it has a root in F.

    Tell me if I'm on the right track... I see that x^4 + 3x^2 + 2 is reducible (x^2+1)(x^2+2) but has no roots in Q.

    This serves as a counterexample to the proposition if states for polynomial up to degree 4?
  2. jcsd
  3. Nov 18, 2009 #2


    User Avatar
    Science Advisor

    Yes, that serves as a counter example for polynomials of degree 4. And that's why your proposition only says "degree 2 or 3".

    If a polynomial of degree three is "reducible", then it must be "reduced" to two linear factors. And those two linear factors will give roots. If a polynomial of degree three is "reducible" then it is "reduced" to either a product of three linear factors or a product of a linear factor and an irreducible quadratic. In either case, you have at least one linear factor that gives a root.
    Last edited by a moderator: Nov 20, 2009
Share this great discussion with others via Reddit, Google+, Twitter, or Facebook