Results 1 to 6 of 6

Math Help - Polynomial in GF(p^n) irreducible or...

  1. #1
    Junior Member
    Joined
    Aug 2012
    From
    Sweden
    Posts
    37
    Thanks
    1

    Polynomial in GF(p^n) irreducible or...

    I'd appreciate some hints or advice for this assignment:

    Let F be a field of characteristic p and f(x) = x^p - x - c be a polynomial in F[x]. Show that f is either irreducible in F[x] or that all its roots lie in F.

    So F=GF(p^n), n>0. If n=1 we have x^p - x - c = x - c, but what properties could I use for general n?
    Follow Math Help Forum on Facebook and Google+

  2. #2
    Senior Member jakncoke's Avatar
    Joined
    May 2010
    Posts
    388
    Thanks
    80

    Re: Polynomial in GF(p^n) irreducible or...

    Let E be a splitting field for f(x) = x^p - x - c over F of char p. Then for r \in E be a root for f(x), then r + 0, r + 1, ..., r + p - 1 are also roots.
    I have to make a quick point, that f has no repeated roots.for if, assuming root a in E, f(x) = h(x)(x-a) , then f'(x) = h(x) + h'(x)(x-a), and f'(a) = h(a).
    Since f'(x) = px^{p-1} - 1  = -1 f'(a) = h(a)  \not = 0 , so no repeated roots.


    Since (r+i)^{p} - (r+i) - c = r^{p} -r - c +  i^{p} - i  = 0 . for  i \in \{0,...,p-1\} (Since a^{p} = a (mod p)
    so F(r) \cong E
    Take g(x)  \in F[x] to be the minimal polynomial such that g(r) = 0.

    Then [E : F ] = deg(g).

    If f = f_1...f_m is the decomposition of f into unique factorization, since g is the min. polynomial s.t g(r) = 0, g divides f. since we made f into a unique factorization g divides one of the f_i, since f_i are monic and irreducible, this means g(x)*1 = f_i, thus deg( f_i) = deg(g) for all  i .

    So deg(g) divides deg(f).
    Since deg(f) = p, either f = g and f is irreducible
    or deg(g) = 1, and [E: F] = 1, and so  r \in F
    Last edited by jakncoke; February 26th 2013 at 11:37 AM.
    Follow Math Help Forum on Facebook and Google+

  3. #3
    Junior Member
    Joined
    Aug 2012
    From
    Sweden
    Posts
    37
    Thanks
    1

    Re: Polynomial in GF(p^n) irreducible or...

    Thank you for your reply. I don't understand this however: "this means g(x)*1 = f_i" Why does this follow from the f_i being monic and irreducible?

    Also, is it true in general in GF(p^n)[x] that if r is a root then so is r+i, i=0,1,...,p-1? If so, how? Suppose \sum_{k=0}^m b_k x^k has r for a root. Then \sum b_k (a+i)^k = \sum b_k (a^k + i^k) = \sum b_k i^k. How is that zero?
    Follow Math Help Forum on Facebook and Google+

  4. #4
    Senior Member jakncoke's Avatar
    Joined
    May 2010
    Posts
    388
    Thanks
    80

    Re: Polynomial in GF(p^n) irreducible or...

    Quote Originally Posted by spudwish View Post
    Thank you for your reply. I don't understand this however: "this means g(x)*1 = f_i" Why does this follow from the f_i being monic and irreducible?

    Also, is it true in general in GF(p^n)[x] that if r is a root then so is r+i, i=0,1,...,p-1? If so, how? Suppose \sum_{k=0}^m b_k x^k has r for a root. Then \sum b_k (a+i)^k = \sum b_k (a^k + i^k) = \sum b_k i^k. How is that zero?
    if g(x) is the minimal polynomial such that g(r) = 0, then by def it is the polynomial of lowest degree such that if any other polynomial p(r) = 0, g divides p.
    if g(x) divides f(x). Then since f(x) is factorized as the product of irreducible elements, then the minimal polynomial dividing f(x) is one of those irreducible elements means it is one of those irreducible elements,
    for irreducible means that it cannot be factored anymore, so anything that divides it means f_i = g(x)q(x) if q is a factor that is not a unit then f_i wouldn't really be irreducble in the first place right?

    As for your second question. It is not true in general. Take x^2 + 1 in Z_2[X] it has a root 1. But 1+1=0, if not a root of it.
    Follow Math Help Forum on Facebook and Google+

  5. #5
    MHF Contributor

    Joined
    Mar 2011
    From
    Tejas
    Posts
    3,279
    Thanks
    672

    Re: Polynomial in GF(p^n) irreducible or...

    jakncoke, i'm a little unclear on your argument as to why deg(g)|deg(f). i understand that g = fi for some i, but this only shows deg(g) ≤ deg(f) = p. the degrees of the factors sum, not multiply. something is missing here, perhaps you should also show that if r + a (for a in Z[SUB]p[/SUP]) is another root of f, with minimal polynomial h, that deg(g) = deg(h), hmm?
    Follow Math Help Forum on Facebook and Google+

  6. #6
    Senior Member jakncoke's Avatar
    Joined
    May 2010
    Posts
    388
    Thanks
    80

    Re: Polynomial in GF(p^n) irreducible or...

    Quote Originally Posted by Deveno View Post
    jakncoke, i'm a little unclear on your argument as to why deg(g)|deg(f). i understand that g = fi for some i, but this only shows deg(g) ≤ deg(f) = p. the degrees of the factors sum, not multiply. something is missing here, perhaps you should also show that if r + a (for a in Z[SUB]p[/SUP]) is another root of f, with minimal polynomial h, that deg(g) = deg(h), hmm?
    I said deg(g) = deg( f_i) for all i which implies that either f factorizes into linear factors(which is showed earlier must be true if it has a root in E) or is irreducible. Thus deg(g) = p or 1 which divides deg(f)=p
    Follow Math Help Forum on Facebook and Google+

Similar Math Help Forum Discussions

  1. Replies: 1
    Last Post: November 25th 2012, 10:11 AM
  2. Irreducible polynomial
    Posted in the Advanced Algebra Forum
    Replies: 1
    Last Post: January 22nd 2010, 06:15 AM
  3. Irreducible Polynomial 2
    Posted in the Advanced Algebra Forum
    Replies: 7
    Last Post: June 8th 2009, 10:22 PM
  4. please please please help me~~ irreducible polynomial
    Posted in the Advanced Algebra Forum
    Replies: 3
    Last Post: March 26th 2009, 11:26 PM
  5. Irreducible Polynomial Help
    Posted in the Advanced Algebra Forum
    Replies: 0
    Last Post: February 22nd 2009, 06:43 PM

Search Tags


/mathhelpforum @mathhelpforum