Extension of Finite Fields: Proving the Number of Elements in F(\alpha)

AI Thread Summary
In the discussion, the focus is on proving that the extension field F(α) has q^n elements, where F is a finite field with q elements and α is algebraic over F with degree n. It is established that F(α) can be expressed as the set of linear combinations of powers of α up to n-1, due to the properties of algebraic elements and their minimal polynomials. The reasoning behind using n-1 as the highest exponent is clarified by noting that any polynomial of degree higher than n-1 can be reduced to a polynomial of degree at most n-1 using the minimal polynomial of α. The conclusion drawn is that the number of choices for the coefficients in these linear combinations leads to the total number of elements in F(α) being q^n. This discussion effectively outlines the relationship between the algebraic degree of α and the structure of the extension field.
Elzair
Messages
10
Reaction score
0

Homework Statement



Let E be an extension of a finite field F, where F has q elements. Let \alpha \epsilon E be algebraic over F of degree n. Prove F \left( \alpha \right) has q^{n} elements.

Homework Equations



An element \alpha of an extension field E of a field F is algebraic over F if f \left( \alpha \right) = 0 for some nonzero f\left(x\right) \epsilon F[x].

The Attempt at a Solution



I do not know how to begin. Is F \left( \alpha \right) a simple extension field?
 
Physics news on Phys.org
The answer is rather simple, F(\alpha)=\{a_0+a_1\alpha+...+a_{n-1} \alpha ^{n-1} : a_0,...,a_{n-1} \in F\}
Now count the number of options to choose each a's and multiply them, to get your answer.
 
Thanks! I just have one question, though. Why is n-1 the highest exponent? Doesn't F \left( \alpha \right) have degree n?
 
That becasue when you show that F(\alpha) is spanned by \{ 1,\alpha,..,\alpha ^{n-1} \} you use the fact that alpha is algebraic with minimal polynomial of degree n when you show that every polyonimal with degree higher than n-1 we can write in terms of a polynomial of degree n-1 at most. And from the minimality of the minimal polynomial we show that this set is independent.

From there we conclude what I wrote in my first post.
 
Thread 'Use greedy vertex coloring algorithm to prove the upper bound of χ'
Hi! I am struggling with the exercise I mentioned under "Homework statement". The exercise is about a specific "greedy vertex coloring algorithm". One definition (which matches what my book uses) can be found here: https://people.cs.uchicago.edu/~laci/HANDOUTS/greedycoloring.pdf Here is also a screenshot of the relevant parts of the linked PDF, i.e. the def. of the algorithm: Sadly I don't have much to show as far as a solution attempt goes, as I am stuck on how to proceed. I thought...
Back
Top