# Difference between revisions of "Cohn's criterion"

(→Proof) |
(→Proof) |
||

Line 6: | Line 6: | ||

The following proof is due to M. Ram Murty. | The following proof is due to M. Ram Murty. | ||

− | We start off with a lemma. Let <math> | + | We start off with a lemma. Let <math>g(x)=a_nx^n+a_{n-1}x^{n-1}+\cdots+a_1x+a_0\in \mathbb{Z}[x]</math>. Suppose <math>a_n\geq 1</math>, <math>|a_i|\leq H</math>. |

− | Then, any complex root of <math> | + | Then, any complex root of <math>g(x)</math>, <math>\phi</math>, has a non positive real part or satisfies <math>|\phi|<\frac{1+\sqrt{1+4H}}{2}</math>. |

Proof: If <math>|z|>1</math> and Re <math>z>0</math>, note that: | Proof: If <math>|z|>1</math> and Re <math>z>0</math>, note that: |

## Latest revision as of 08:37, 4 March 2021

Let be a prime number, and an integer. If is the base- representation of , and , then is irreducible.

## Proof

The following proof is due to M. Ram Murty.

We start off with a lemma. Let . Suppose , . Then, any complex root of , , has a non positive real part or satisfies .

Proof: If and Re , note that: This means if , so .

If , this implies if and . Let . Since , one of and is 1. WLOG, assume . Let be the roots of . This means that . Therefore, is irreducible.

If , we will need to prove another lemma:

All of the zeroes of satisfy Re .

Proof: If , then the two polynomials are and , both of which satisfy our constraint. For , we get the polynomials , , , and , all of which satisfy the constraint. If ,

If Re , we have Re , and then For , then . Therefore, is not a root of .

To finish the proof, let . Since , one of and is 1. WLOG, assume . By our lemma, . Thus, if are the roots of , then . This is a contradiction, so is irreducible.