Quadratic Polynomials and Irreducibles and Primes

In summary, the conversation is about a theorem in the book "Introductory Algebraic Number Theory" by Saban Alaca and Kenneth S. Williams. The theorem states that if a polynomial f(x) with coefficients in an integral domain D has a factorization into linear factors in a field extension F, then the roots of f(x) cannot all be in D. The proof of this theorem involves showing that a root of f(x) in F is both in D and not in D, leading to a contradiction. The conversation also mentions confusion about the swapping between D[X] and F[X] and the meaning of "neither a/p nor b/p is in D" in the assumed factorization of f(x).
  • #1
Math Amateur
Gold Member
MHB
3,998
48
I am reading "Introductory Algebraic Number Theory"by Saban Alaca and Kenneth S. Williams ... and am currently focused on Chapter 1: Integral Domains ...

I need some help with the proof of Theorem 1.2.2 ...

Theorem 1.2.2 reads as follows:
View attachment 6514
https://www.physicsforums.com/attachments/6515
In the above text from Alaca and Williams, we read the following:

"... ... Then the roots of \(\displaystyle f(X)\) in \(\displaystyle F\) are \(\displaystyle -ds/p\) and \(\displaystyle -d^{-1} t \). But \(\displaystyle d^{-1} t \in D\) while neither \(\displaystyle a/p\) nor \(\displaystyle b/p\) is in \(\displaystyle D\). Thus no such factorization exists. ... I am unsure of how this argument leads top the conclusion that \(\displaystyle f(X)\) does not factor into linear factors in \(\displaystyle D[X]\) ... in other words how does the argument that "" ... \(\displaystyle d^{-1} t \in D\) while neither \(\displaystyle a/p\) nor \(\displaystyle b/p\) is in \(\displaystyle D\) ... "lead to the conclusion that no such factorization exists. ...

Indeed ... in particular ... how does the statement "neither \(\displaystyle a/p\) nor \(\displaystyle b/p\) is in \(\displaystyle D\)" have meaning in the assumed factorization \(\displaystyle f(X) = (cX + s) ( dX + t )\) ... ... ? ... What is the exact point being made about the assumed factorization ... ?I am also a little unsure of what is going on when Alaca and Williams change or swap between \(\displaystyle D[X]\) and \(\displaystyle F[x]\) ...Can someone help with an explanation ...

Help will be appreciated ...

Peter
 
Last edited:
Physics news on Phys.org
  • #2
Hi Peter,

The contradiction here is that $-d^{-1}t$ is in $D$ and also not in $D$. As $d, t\in D$, $-d^{-1}t\in D$. On the other hand, $-d^{-1}t$ is one of the roots of $f$ in $F[X]$, namely $a/p$ or $b/p$; since neither $a/p$ nor $b/p$ is in $D$, $-d^{-1}t$ is not in $D$.
 
  • #3
Euge said:
Hi Peter,

The contradiction here is that $-d^{-1}t$ is in $D$ and also not in $D$. As $d, t\in D$, $-d^{-1}t\in D$. On the other hand, $-d^{-1}t$ is one of the roots of $f$ in $F[X]$, namely $a/p$ or $b/p$; since neither $a/p$ nor $b/p$ is in $D$, $-d^{-1}t$ is not in $D$.
Thanks Euge ... that is clear now ...

Appreciate your help ...

Peter
 

FAQ: Quadratic Polynomials and Irreducibles and Primes

What is a quadratic polynomial?

A quadratic polynomial is a polynomial of degree two, meaning it has an exponent of two on its highest degree term. It is in the form ax^2 + bx + c, where a, b, and c are constants and x is a variable.

What is an irreducible polynomial?

An irreducible polynomial is a polynomial that cannot be factored into lower degree polynomials with integer coefficients. In other words, it cannot be broken down any further and has no roots.

What is a prime polynomial?

A prime polynomial is a polynomial that is both irreducible and has a leading coefficient of 1. This means it cannot be factored into lower degree polynomials with integer coefficients and has no rational roots.

How do you determine if a quadratic polynomial is irreducible?

To determine if a quadratic polynomial is irreducible, you can use the quadratic formula or complete the square to find its roots. If the roots are irrational, then the polynomial is irreducible.

Can a quadratic polynomial be both irreducible and prime?

Yes, a quadratic polynomial can be both irreducible and prime. For example, x^2 + 2 is both irreducible and prime, as it cannot be factored and has a leading coefficient of 1.

Similar threads

Replies
6
Views
2K
Replies
2
Views
2K
Replies
1
Views
2K
Replies
1
Views
3K
Replies
1
Views
1K
Replies
1
Views
1K
Back
Top