Formal Power Series: Proving ED & Irreducibility in R[x]

In summary, The ring R=F[[t]] is a commutative ring with unity, represented by infinite sums of the form a_0 + a_1 t + a_2 t +..., where b is a unit if a_0 =/= 0. R is also a Euclidean domain with respect to the norm N(b)=n if a_n is the first term of b that is =/= 0. In the polynomial ring R[x], it has been shown that x^n-t is irreducible. This was proven by showing that if the polynomial is reducible, it can be written as (x^m + k) * (x^n + k2) for some m,k,k2 in R,
  • #1
5kold
13
0

Homework Statement



Let F be a field. Consider the ring R=F[[t]] of the formal power series
in t. It is clear that R is a commutative ring with unity.

the things in R are things of the form infiniteSUM{ a_n } = a_0 + a_1 t + a_2 t +...

b is a unit iff the constant term a_0 =/= 0

Prove that R is a Euclidean domain with respect to the norm N(b)=n if a_n is the first term of b that is =/= 0.

In the polynomial ring R[x], prove that x^n-t is irreducible.



The Attempt at a Solution


I showed that it is a ED.

How do I show Irreducibility of this thing?
 
Physics news on Phys.org
  • #2
I know that if I can show if the polynomial is reducible, then it can be written as (x^m + k) * (x^n + k2) for some m,k,k2 in R. But how do I prove that this is not the case? Do I use contradiction?
 

FAQ: Formal Power Series: Proving ED & Irreducibility in R[x]

What is a formal power series?

A formal power series is a mathematical concept used to represent an infinite sequence of coefficients in a polynomial function. It is written in the form of a series, where each term contains a variable raised to a different power.

How do you prove that a formal power series is equal to its derivatives?

In order to prove that a formal power series is equal to its derivatives, we use the concept of analyticity. This means that the function represented by the power series has a convergent series expansion, which allows us to differentiate it term by term.

What is the significance of proving the existence and dominance of a formal power series?

Proving the existence and dominance of a formal power series is important in order to show that a polynomial function has a unique representation as a power series. This allows us to manipulate the function algebraically and apply various mathematical techniques to analyze its properties.

What does it mean to prove the irreducibility of a formal power series?

Proving the irreducibility of a formal power series means that the polynomial function cannot be factored into simpler polynomial functions. This is important in understanding the properties of the function and its behavior.

What are some common techniques used to prove the irreducibility of a formal power series?

Some common techniques used to prove the irreducibility of a formal power series include Eisenstein's criterion, the rational root theorem, and the use of factorization algorithms such as Berlekamp's algorithm. These techniques involve analyzing the coefficients of the power series and identifying patterns or properties that prove the irreducibility of the function.

Back
Top