Field of characteristic p. automosphism.

In summary, we have proven that $T$ is a subfield of $K$ and any automorphism of $K$ that fixes every element of $F$ will also fix every element of $T$.
  • #1
caffeinemachine
Gold Member
MHB
816
15
Let $F$ be a field of characteristic $p \neq 0$. Let $K$ be an extension of $F$. Define $T= \{ a \in K : a^{p^n} \in F \text{ for some } n \}$.
a) Prove that $T$ is a subfield of $K$.
b) Show that any automorphism of $K$ leaving every element of $F$ fixed also leaves every element of $T$ fixed.

ATTEMPT:Part (a) is easy after observing that $(a+b)^{p^m}=a^{p^m}+b^{p^m}$.

Now part (b). Let $\phi : K \rightarrow K$ be an automorphism with $\phi(x)=x, \, \forall x \, \in F$.

NOTATION: $\phi^2(a)= \phi(\phi(a))$, $\phi^3(a)=\phi(\phi(\phi(a)))$ and so on.

Now consider the special case when $a \in T-F$ with $a^p \in F$. We need to show that $\phi(a)=a$.

Since $a^p \in F$ we have $\phi(a^p)=a^p$.

Thus $[\phi(a)]^p = a^p$. This leads to $[\phi^r(a)]^p=a^p$ and also to the conclusion that $a \in T \Rightarrow \phi(a) \in T$.

Consider $\phi(a), \phi^2(a), \ldots, \phi^{p+1}(a)$.

If these are all distinct then the polynomial $x^p - a^p \in K[x]$ will have $p+1$ distinct roots. Since this is impossible thus some two of
the elements are same. This leads to the conclusion that $\exists r \in \mathbb{Z}^+$ such that $\phi^r(a)=a$.

Now we need to show that the minimum value of such an $r$ is one.

How do I proceed from here?
 
Physics news on Phys.org
  • #2


To prove that the minimum value of $r$ is one, we can assume that $r>1$ and reach a contradiction.

Assuming $r>1$, we have $\phi^r(a)=a$ and $\phi^r(a^p)=a^p$. Since $\phi$ is an automorphism, we can apply it to both sides of the equation to get $\phi^{r+1}(a^p)=\phi(a^p)=a^p$.

Now, since $a^p \in F$, we have $\phi^{r+1}(a^p)=\phi(a^p)=a^p$. We can continue this process and show that $\phi^{r+k}(a^p)=a^p$ for all $k \in \mathbb{Z}^+$.

This means that $a^p$ is a fixed point of $\phi$ for all positive powers of $r$, which contradicts the fact that $r$ is the minimum value for which $\phi^r(a)=a$.

Therefore, our assumption that $r>1$ is false and we can conclude that $r=1$, which means that $\phi(a)=a$.

Since this holds for all $a \in T-F$, we can conclude that $\phi$ leaves every element of $T$ fixed.
 

FAQ: Field of characteristic p. automosphism.

What is a field of characteristic p?

A field of characteristic p is a type of mathematical structure that has a specific characteristic, or a specific prime number, that governs its operations. This characteristic determines the behavior of the field's elements under addition and multiplication. For example, a field with characteristic 3 would have elements that behave differently under addition and multiplication than a field with characteristic 5.

What is an automorphism?

An automorphism is a type of mathematical function that maps a structure onto itself, preserving the structure's properties. In the context of a field of characteristic p, an automorphism is a function that preserves the characteristic and operation rules of the field.

How are fields of characteristic p related to Galois theory?

Fields of characteristic p are related to Galois theory because they are often used to study field extensions, which are essential to understanding Galois theory. In particular, fields of characteristic p are important in studying finite fields, which play a crucial role in Galois theory.

What is the significance of studying automorphisms in fields of characteristic p?

Studying automorphisms in fields of characteristic p allows us to understand the structure and properties of these fields in a more comprehensive way. It also helps us to identify important properties, such as subfields and irreducible polynomials, which are essential in many areas of mathematics and science.

Can automorphisms in fields of characteristic p be used in practical applications?

Yes, automorphisms in fields of characteristic p have practical applications in areas such as coding theory, cryptography, and coding algorithms. They are also used in various engineering applications, such as error-correction codes in communication systems and in designing efficient algorithms for computer graphics and image processing.

Similar threads

Replies
8
Views
1K
Replies
12
Views
1K
Replies
4
Views
1K
Replies
39
Views
3K
Replies
1
Views
1K
Replies
1
Views
1K
Replies
36
Views
2K
Replies
23
Views
1K
Replies
3
Views
1K
Back
Top