Does the Factor (x+1) Affect Polynomial Coset Uniqueness in F_2[x]?

  • Context: Graduate 
  • Thread starter Thread starter gonzo
  • Start date Start date
Click For Summary
SUMMARY

The discussion centers on the polynomial coset uniqueness in the ring {F_2[x] / x^n-1}, specifically examining the role of the factor (x+1) in the ideal generated by (x+1)g(x), where g(x) is the minimal polynomial of a primitive element of F_{2^m}. The conclusion is that for distinct indices i and j, the polynomials x^i+x^{i+1} and x^j+x^{j+1} cannot belong to the same coset of this ideal, despite the factor (x+1) appearing unnecessary in the proof. The proof demonstrates that the irreducibility of g(x) plays a crucial role in establishing this uniqueness.

PREREQUISITES
  • Understanding of polynomial rings, specifically F_2[x]
  • Knowledge of minimal polynomials and primitive elements in finite fields
  • Familiarity with ideals and cosets in algebraic structures
  • Basic proficiency in modular arithmetic, particularly with polynomials
NEXT STEPS
  • Study the properties of minimal polynomials in finite fields, focusing on F_{2^m}
  • Learn about polynomial ideals and their applications in algebraic coding theory
  • Explore the implications of irreducibility in polynomial factorization
  • Investigate the structure of the ring {F_2[x] / x^n-1} and its significance in coding theory
USEFUL FOR

This discussion is beneficial for mathematicians, algebraists, and computer scientists working with finite fields, polynomial algebra, and coding theory, particularly those interested in the uniqueness of polynomial cosets and their applications.

gonzo
Messages
277
Reaction score
0
Okay, I have this problem in my book, an I'm pretty sure I solved it, but I there is something that is confuses me in the way the problem was asked.

Assume all polynomials are in the ring
[tex] {F_2[x] \over x^n-1}[/tex]
where [itex]n=2^m-1[/itex] and m>2

Let g(x) be the minimal polynomial of a primitive element of [itex]F_{2^m}[/itex]

We want to look at the ideal generated by (x+1)g(x). The problem is to prove that for [itex]i \ne j[/itex] the two polynomials [itex]x^i+x^{i+1}[/itex] and [itex]x^j+x^{j+1}[/itex] can't be in the same coset of this ideal.

My problem is that my proof seems to make the factor of (x+1) in the ideal unnecessary and that the way the problem is worded seems to imply that this factor has some importance to this property.

My proof is relatively simple. Assume j>i and j<n, and assume they are in the same coset, then we can find a pair of q's such that:

[tex] (x+1)g(x)q_1+x^i+x^{i+1}=(x+1)g(x)q_2+x^j+x^{+1} (mod(x^n-1))[/tex]

Rearranging we get:

[tex] (x+1)g(x)(q_1+q_2)+(x+1)(x^i)(1+x^{j-i})=0 (mod(x^n-1))[/tex]

Since g divides the sum of the left side and it divides the left hand term, it has to divide the right hand term on the left side as well (g is irreducible). It can't divide (x+1) and it can't divide [itex]x^i[/itex] so it has to divide the remaining factor [itex](1+x^{j-i})[/itex] but it can't divide this factor because it is the minimal polynomial of a primitive element of [itex]F_{2^m}[/itex]. Thus they can't be in the same coset since we have hit a contradiction.

However, none of this depends on the (x+1) factor in the ideal as far as I can see.

Am I missing something, or just totally off on the wrong track?=
 
Physics news on Phys.org
I can't follow the "rearranging". I get modulo ##x^n-1##
\begin{align*}
x^i +x^{i+1}&=x^j+x^{j+1}+(x+1)g(x)q(x)\\
(x+1)x^i -(x+1)x^j &= (x+1)g(x)q(x)\\
x^j(x^{i-j}-1) &= g(x)q(x)\\
x^j \,&|\,g(x)q(x)\\
x^j\,&|\,q(x)\\
(x^{i-j}-1) \,&|\,g(x)q'(x)
\end{align*}
where I used the factor ##x+1##.
 

Similar threads

  • · Replies 24 ·
Replies
24
Views
2K
  • · Replies 6 ·
Replies
6
Views
2K
Replies
48
Views
6K
  • · Replies 1 ·
Replies
1
Views
1K
  • · Replies 0 ·
Replies
0
Views
1K
  • · Replies 3 ·
Replies
3
Views
2K
  • · Replies 2 ·
Replies
2
Views
3K
  • · Replies 6 ·
Replies
6
Views
3K
  • · Replies 1 ·
Replies
1
Views
1K
  • · Replies 3 ·
Replies
3
Views
2K