MHB Prove Nonzero Integer Lemma in $F[t, t^{-1}]$

  • Thread starter Thread starter mathmari
  • Start date Start date
  • Tags Tags
    Integer
Click For Summary
The discussion centers on proving a lemma regarding the ring $F[t, t^{-1}]$ where $F$ has characteristic zero. It establishes that a polynomial $n$ is a nonzero integer if and only if it divides 1, either $n-1$ or $n+1$ divides 1, and there exists a power of $t$ such that the expression $(x-1)/(t-1) \equiv n \pmod{t-1}$. The proof begins by confirming that if $n$ is a nonzero constant polynomial, then it is invertible, hence $n \mid 1$. The discussion also explores the implications of the conditions on $n-1$ and $n+1$, leading to the conclusion that $n$ must be a nonzero constant in $F$. The final query addresses whether a certain root is in $F$ or an extension, indicating a need for further clarification on the nature of roots in this context.
mathmari
Gold Member
MHB
Messages
4,984
Reaction score
7
Hey! :o

I want to prove the following lemma:

Let $F[t,t^{-1}]$ be the ring of the polynomials in $t$ and $t^{-1}$ with coefficients in the field $F$ and assume that the characteristic of $F$ is zero.
Then for any $n$ in $F[t, t^{-1}]$, $n$ is a nonzero integer if and only if
  • $n$ divides $1$
  • either $n-1$ divides $1$ or $n+1$ divides $1$, and
  • there is a power $x$ of $t$, so that $\dfrac{x-1}{t-1}\equiv n \pmod {t-1}$

I need some help to prove the direct direction...

We suppose that $n \in F[t, t^{-1}] \land n \in \mathbb{Z}\setminus \{0\}$.

That means that $n$ is a nonzero constant polynomial of $F[t, t^{-1}]$. Since $F$ is a field, $n$ is invertible, i.e., $n \mid 1$.

Is this correct so far?

How can we show the other two points?
 
Physics news on Phys.org
Is the proof as follows?

From an other lemma we have that $(t^n-1)/(t-1)\equiv n \pmod {t-1} \tag {1}$.

Direct:

Let $n \in \mathbb{Z} \setminus \{0\}$, then $n \mid 1$, since $F$ is a field.

It also holds that $n-1 \mid 1$ or $n+1 \mid 1$, otherwise it would be $n-1=0 \Rightarrow n=1$ and $n+1=0 \Rightarrow n=-1$.

From the relation $(1)$ we have that $(t^n-1)/(t-1)\equiv n \pmod {t-1}$, so there is a power $x$ of $t$ such that $(x-1)/(t-1)\equiv n \pmod {t-1}$.

Converse:

We suppose that $n\in F[t,t^{-1}]$ and $n \mid 1$ and $( n-1 \mid 1 \text{ or } n+1 \mid 1 )$ and $(t^k-1)/(t-1)\equiv n \mod (t-1)$.

Since $n\in F[t,t^{-1}]$ is invertible ($n \mid 1$) we have that $n=at^i$, where $a \in F \setminus \{0\}, i \in \mathbb{Z}$.

Since also $n-1$ or $n+1$ is invertible ($ n-1 \mid 1 \text{ or } n+1 \mid 1 $) we have that
$$n-1=b_1t^{j_1}, b_1\in F \setminus \{0\}, j_1 \in \mathbb{Z} \Rightarrow at^i-1=b_1t^{j_1} \\ \text{ or } \\ n-1=b_2t^{j_2}, b_2\in F \setminus \{0\}, j_2 \in \mathbb{Z} \Rightarrow at^i-1=b_2t^{j_2}$$

If $i \neq 0$, then $at^i \pm 1$ has a nonzero root , which is not a root of $bt^j, b \in \{b_1, b_2 \}, j \in \{j_1, j_2 \}$.

So, it must be $i=0$.

So, $n=a \in F \setminus \{0\}$.

Since $(t^k-1)/(t-1)\equiv n \mod (t-1), k \in \mathbb{Z}$ we have that $$k \equiv n \mod (t-1) \Rightarrow n-k \equiv 0 \mod (t-1) \Rightarrow \exists y \in F[t, t^{-1}]: n-k=y(t-1) \Rightarrow n=k+y(t-1)$$
Since $n \in F\setminus \{0\}$, we have that $n$ is nonzero constant polynomial, so it must be $y=0$.

So, we have that $n=k \in \mathbb{Z} \setminus \{0\}$. Is this correct? Could I improve something?
 
mathmari said:
If $i \neq 0$, then $at^i \pm 1$ has a nonzero root , which is not a root of $bt^j, b \in \{b_1, b_2 \}, j \in \{j_1, j_2 \}$.

Is this root in $F$ or in an extension of $F$ ?
 
Thread 'How to define a vector field?'
Hello! In one book I saw that function ##V## of 3 variables ##V_x, V_y, V_z## (vector field in 3D) can be decomposed in a Taylor series without higher-order terms (partial derivative of second power and higher) at point ##(0,0,0)## such way: I think so: higher-order terms can be neglected because partial derivative of second power and higher are equal to 0. Is this true? And how to define vector field correctly for this case? (In the book I found nothing and my attempt was wrong...

Similar threads

Replies
48
Views
4K
Replies
1
Views
1K
  • · Replies 3 ·
Replies
3
Views
2K
  • · Replies 25 ·
Replies
25
Views
3K
  • · Replies 4 ·
Replies
4
Views
2K
  • · Replies 4 ·
Replies
4
Views
2K
  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 8 ·
Replies
8
Views
2K
  • · Replies 1 ·
Replies
1
Views
2K
Replies
7
Views
2K