Irreducible polynomial on polynomial ring

  • Thread starter Thread starter SN1987a
  • Start date Start date
  • Tags Tags
    Polynomial Ring
Click For Summary
SUMMARY

The polynomial x^2 + 1 is irreducible in the polynomial ring Z_p[x] for odd primes p of the form 3 + 4m. To prove this, one must show that x^2 = -1 has no roots in Z_p, which can be approached using Fermat's Little Theorem. The lemma regarding invertible elements in a commutative ring is also crucial in establishing the irreducibility of the polynomial. A concise two-line proof exists that leverages these mathematical principles.

PREREQUISITES
  • Understanding of polynomial rings, specifically Z_p[x]
  • Familiarity with Fermat's Little Theorem
  • Knowledge of irreducibility criteria for polynomials
  • Basic concepts of commutative algebra and invertible elements
NEXT STEPS
  • Study the application of Fermat's Little Theorem in polynomial irreducibility
  • Explore the properties of commutative rings and invertible elements
  • Research the criteria for irreducibility in polynomial rings over finite fields
  • Examine examples of irreducible polynomials in Z_p[x] for various primes
USEFUL FOR

Mathematicians, algebra students, and researchers interested in number theory and polynomial algebra, particularly those focusing on irreducibility in finite fields.

SN1987a
Messages
35
Reaction score
0
How would I prove that [itex]x^2+1[/itex] is irreducible in [itex]Z_p[x][/itex], where p is an odd prime of the form 3+4m.

I know that for it to be rreducible, it has to have roots in the ring. So [itex]x^2=-1 (mod p)[/itex]. Or [itex]x^2+1=k(3+4m)[/itex], for some k. I tried induction on m, but it does not work because [itex}x^2+1[/itex] is only reducible on [itex]Z_p[x][/itex] if p is prime, which is not the case for all m. Apperently, there exists a two-line solution.

Any tips would be appreciated.
 
Physics news on Phys.org
Hint: Fermat's little theorem and this lemma: if R is a commutative ring with identity, and a in R is invertible, then a^n=1 and a^m=1 => a^gcd(n,m)=1.
 

Similar threads

  • · Replies 1 ·
Replies
1
Views
3K
  • · Replies 18 ·
Replies
18
Views
7K
Replies
7
Views
3K
  • · Replies 13 ·
Replies
13
Views
3K
  • · Replies 1 ·
Replies
1
Views
2K
Replies
48
Views
7K
  • · Replies 6 ·
Replies
6
Views
2K
  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 12 ·
Replies
12
Views
3K
  • · Replies 3 ·
Replies
3
Views
2K