Artin's lemma in Galois Theory: when is [E:F] < |G|?

  • Thread starter Thread starter Boorglar
  • Start date Start date
  • Tags Tags
    Theory
Boorglar
Messages
210
Reaction score
10
I am trying to understand Galois Theory and reading through various theorems and lemmas, some of which are still confusing me.

A lemma proved by Artin states that if F is the fixed field of a finite group G of automorphisms in a field E, then the degree [E:F] ≤ |G| = n. The proof relies on setting up a linear dependence relationship for any set of n+1 elements in E, using n equations in n+1 unknowns with coefficients obtained by every permutation in G.

I am trying to get an intuitive understanding of the result. I already know that in the case where G is the Galois group G(E/F) and E is a splitting field of a separable polynomial over F, then F is the fixed field of G and [E:F] = |G|. But what properties of E and G could cause [E:F] < |G|?

I can't find any example where strict inequality arises.
 
Physics news on Phys.org
You can't find a counterexample because I believe none exists. In fact, given any set S of n distinct isomorphisms of a field E_1 into a field E_2 (here they don't even need to form a group just some set of isomorphisms), then [E:\mathrm{Fix}(S) ] \geq n.

Whatever source you are using probably split the proof that if S is a group then [E:\mathrm{Fix}(S) ] =n into separate lemmas so I would imagine there is also a proof of the above fact nearby the proof of the other inequality in your book.
 
Yes, I think you are right. I found out later in the book, they prove that if F is a fixed field of E under the finite group of automorphisms of E, then E is a finite, normal, separable extension of F (in fact the two properties are equivalent). This implies that [E:F] = |G(E/F)| ≥ |G|, which is the other inequality.

I was scratching my head for a while before I realized this.

An interesting side-effect of [E:F] = n is that it proves the set of all automorphisms of G is linearly independent over F, since from Artin's proof, the nxn system of equations must have only the trivial solution.
 
Last edited:
##\textbf{Exercise 10}:## I came across the following solution online: Questions: 1. When the author states in "that ring (not sure if he is referring to ##R## or ##R/\mathfrak{p}##, but I am guessing the later) ##x_n x_{n+1}=0## for all odd $n$ and ##x_{n+1}## is invertible, so that ##x_n=0##" 2. How does ##x_nx_{n+1}=0## implies that ##x_{n+1}## is invertible and ##x_n=0##. I mean if the quotient ring ##R/\mathfrak{p}## is an integral domain, and ##x_{n+1}## is invertible then...
The following are taken from the two sources, 1) from this online page and the book An Introduction to Module Theory by: Ibrahim Assem, Flavio U. Coelho. In the Abelian Categories chapter in the module theory text on page 157, right after presenting IV.2.21 Definition, the authors states "Image and coimage may or may not exist, but if they do, then they are unique up to isomorphism (because so are kernels and cokernels). Also in the reference url page above, the authors present two...
When decomposing a representation ##\rho## of a finite group ##G## into irreducible representations, we can find the number of times the representation contains a particular irrep ##\rho_0## through the character inner product $$ \langle \chi, \chi_0\rangle = \frac{1}{|G|} \sum_{g\in G} \chi(g) \chi_0(g)^*$$ where ##\chi## and ##\chi_0## are the characters of ##\rho## and ##\rho_0##, respectively. Since all group elements in the same conjugacy class have the same characters, this may be...
Back
Top