If F is ANY field then (x^m-1)|(x^n-1) in F[x] if and only if m|n.

  • Thread starter Thread starter taskforce123
  • Start date Start date
  • Tags Tags
    Field
Click For Summary

Homework Help Overview

The discussion revolves around the divisibility of polynomials in the context of fields, specifically addressing the statement that if F is any field, then (x^m-1) divides (x^n-1) in F[x] if and only if m divides n. Participants are exploring the proof of this statement and its applicability to any field.

Discussion Character

  • Conceptual clarification, Assumption checking, Problem interpretation

Approaches and Questions Raised

  • Participants are attempting to understand the implications of the divisibility condition and questioning the necessity of proving it for any field. There are discussions about the nature of m and n, and suggestions to refer back to existing proofs for guidance.

Discussion Status

The discussion is ongoing, with participants sharing their thoughts on how to approach the proof and questioning the steps involved. Some have suggested reviewing previous lemmas and proofs to ensure that all steps are justified in the context of any field.

Contextual Notes

There is an emphasis on ensuring that the proof holds universally across different fields, which raises questions about the assumptions made in the original proof. Participants are considering the need for additional justification in their arguments.

taskforce123
Messages
3
Reaction score
0
Hello. The question that I am having trouble with is the one found in the title. I will repeat it again here in the post.

"If F is ANY field then (x^m-1)|(x^n-1) in F[x] if and only if m|n."

I have determined that if m|n, then (x^m-1)|(x^n-1) as long as n >= 2 and s >= r >= 1. However, the part that I am now having trouble proving is that this statement holds for ANY field. I am not looking for an answer, but maybe a more precise definition of what I am trying to prove, and maybe the steps I need to take to prove it. Thank you very much in advance.
 
Physics news on Phys.org
Here's an idea which doesn't work:

If x^n-1 divides x^m-1 then any linear factor of x^n-1 is a linear factor of x^m-1. The linear factors correspond to the roots. So if x^n-1 divides x^m-1 then all roots of x^n-1 must be roots of x^m-1.

The is useless since a polynomial doesn't even need to have roots. Can you do something so that our approach will work?
 
What are m,n? Naturals I assume
 
Ok aassuming they are:

Perform division, paying attention to the form of the powers you get for the quotient
 
I worked through the proof myself for the most part, but to make it easier to view, I attached the proof that was provided to us.

https://www.physicsforums.com/attachment.php?attachmentid=49748&stc=1&
d=1344716150

What I must prove now is that this holds for ANY field. This is where I get stuck. Basically, how would I go about proving that this statement holds for ANY field?
 

Attachments

  • Problem.png
    Problem.png
    12.1 KB · Views: 509
Why don't you do the exact same things as in the lemma?? Only some notation will be different.
 
It seems that what I need to do is prove that this works for ANY field. So would I need to do something extra with the already existing proof in order to solve the problem?
 
taskforce123 said:
It seems that what I need to do is prove that this works for ANY field. So would I need to do something extra with the already existing proof in order to solve the problem?

Maybe. Go over the proof and see whether every step is justified in F(x) (and why it is justified).
 

Similar threads

  • · Replies 22 ·
Replies
22
Views
1K
  • · Replies 3 ·
Replies
3
Views
1K
  • · Replies 6 ·
Replies
6
Views
2K
  • · Replies 1 ·
Replies
1
Views
2K
Replies
1
Views
2K
  • · Replies 1 ·
Replies
1
Views
1K
  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 4 ·
Replies
4
Views
1K
Replies
9
Views
2K
Replies
8
Views
2K