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

Click For Summary

Homework Help Overview

The discussion revolves around proving the number of elements in the field extension F(α), where F is a finite field with q elements and α is algebraic over F of degree n. Participants are exploring the properties of algebraic extensions and the structure of finite fields.

Discussion Character

  • Conceptual clarification, Mathematical reasoning

Approaches and Questions Raised

  • The original poster expresses uncertainty about how to begin the proof and questions whether F(α) is a simple extension field. Another participant provides a formula for F(α) and suggests counting options for coefficients. A follow-up question arises regarding the highest exponent in the polynomial representation of elements in F(α), leading to a discussion about the implications of α being algebraic and its minimal polynomial.

Discussion Status

The conversation is active, with participants engaging in clarifying concepts and addressing specific questions about the structure of the field extension. Guidance has been offered regarding the representation of elements in F(α) and the reasoning behind the degree of the minimal polynomial.

Contextual Notes

Participants are navigating the definitions and properties of algebraic extensions and finite fields, with an emphasis on the implications of the degree of the minimal polynomial and the independence of the spanning set.

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.
 

Similar threads

Replies
6
Views
2K
Replies
1
Views
2K
  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 6 ·
Replies
6
Views
2K
  • · Replies 5 ·
Replies
5
Views
2K
  • · Replies 2 ·
Replies
2
Views
2K
  • · Replies 3 ·
Replies
3
Views
2K
Replies
8
Views
2K
Replies
1
Views
2K