Perron's criterion
Perron's Criterion states: Let with and is then irreducible.
Proof
We start of with a lemma: exactly one zero of satisfies and the rest satisfy . Proof (due to Laurentiu Panaitopol): First, we will prove that no exists such that and . Suppose we find such an root. Then, we have that However, this means that This is a contradiction, so such a root can not exist.
Now, let the roots of be . Since , one of the roots, say , satisfies . Then, let , where . We know that , and . Therefore,
This means that .
This means, for all , we have:
Therefore, all of the other zeroes of satisfy .
Now, we will prove Perron's Criterion. Let , where . Since has only one root outside the unit circle, , assume that it is a root of . Then, we get that the roots of , , have a product of , a nonzero integer. However, , a contradiction. Thus, is irreducible.