how could one prove that if the degree of a separable field extension $\ell/k$ is at most $a$, then the degree of its normal closure $N/k$ is at most $a!$?
2026-02-23 04:52:41.1771822361
Degree of normal closure
135 Views Asked by Bumbble Comm https://math.techqa.club/user/bumbble-comm/detail At
1
There are 1 best solutions below
Related Questions in SEPARABLE-EXTENSION
- Find the degree of splitting field of a separable polynomial over finite field
- If $\alpha$ separable over $F$ then $F(\alpha )/F$ is a separable extension.
- non separable, non normal, finite field extension
- Is $\mathbb{F}_q(x)$ a perfect field?
- Does a finite $[E:K]_s$ imply that $[E_s:K]$ is finite?
- Converse to Prop. V.6.11 from Lang's *Algebra*: $E/k$ normal $\impliedby E^{\operatorname{Aut}(E/k)}/k $ purely inseparable?
- If $E/k$ is not separable, but satisfies the property that there exists a positive integer $n$ for which every $\alpha \in E$ of degree less than $n$
- Let $L/K$ be a finite separable field extension. How to prove there are finitely many intermediate fields?
- Prove this field extension is separable
- $\mathbb F_p(t) \leq L $ a finite extension
Trending Questions
- Induction on the number of equations
- How to convince a math teacher of this simple and obvious fact?
- Find $E[XY|Y+Z=1 ]$
- Refuting the Anti-Cantor Cranks
- What are imaginary numbers?
- Determine the adjoint of $\tilde Q(x)$ for $\tilde Q(x)u:=(Qu)(x)$ where $Q:U→L^2(Ω,ℝ^d$ is a Hilbert-Schmidt operator and $U$ is a Hilbert space
- Why does this innovative method of subtraction from a third grader always work?
- How do we know that the number $1$ is not equal to the number $-1$?
- What are the Implications of having VΩ as a model for a theory?
- Defining a Galois Field based on primitive element versus polynomial?
- Can't find the relationship between two columns of numbers. Please Help
- Is computer science a branch of mathematics?
- Is there a bijection of $\mathbb{R}^n$ with itself such that the forward map is connected but the inverse is not?
- Identification of a quadrilateral as a trapezoid, rectangle, or square
- Generator of inertia group in function field extension
Popular # Hahtags
second-order-logic
numerical-methods
puzzle
logic
probability
number-theory
winding-number
real-analysis
integration
calculus
complex-analysis
sequences-and-series
proof-writing
set-theory
functions
homotopy-theory
elementary-number-theory
ordinary-differential-equations
circles
derivatives
game-theory
definite-integrals
elementary-set-theory
limits
multivariable-calculus
geometry
algebraic-number-theory
proof-verification
partial-derivative
algebra-precalculus
Popular Questions
- What is the integral of 1/x?
- How many squares actually ARE in this picture? Is this a trick question with no right answer?
- Is a matrix multiplied with its transpose something special?
- What is the difference between independent and mutually exclusive events?
- Visually stunning math concepts which are easy to explain
- taylor series of $\ln(1+x)$?
- How to tell if a set of vectors spans a space?
- Calculus question taking derivative to find horizontal tangent line
- How to determine if a function is one-to-one?
- Determine if vectors are linearly independent
- What does it mean to have a determinant equal to zero?
- Is this Batman equation for real?
- How to find perpendicular vector to another vector?
- How to find mean and median from histogram
- How many sides does a circle have?
Since $l/k$ is separable, we can write $l=k(a)$ for some separable $a\in l$. Let $p(x)$ be the minimal polynomial $\in k[X]$ over $k$ of $a$. Also, $p(x)$ is (of course) separable.
Let $\operatorname{deg}(p)=m$ and let $a_1,a_2,\dots,a_m$ (where $a_1=a$) be all the roots of $p$.
We have $m\leq n$ ($n$ is the upper bound on the degree).
We consider the set of ascending fields: $$k\leq k(a_1)\leq k(a_1,a_2)\leq k(a_1,a_2,a_3)\leq \dots\leq k(a_1,a_2,a_3,\dots,a_m)$$
Clearly (by assumption) $[k(a_1):k]=[l:k]=m$.
And for every $1<j\leq m$, the polynomial $\frac{p(x)}{(x-a_1)(x-a_2)\dots (x-a_{j-1})}$ belongs to $k(a_1,a_2,\dots,a_{j-1})[X]$ (due to the division algorithm). But this polynomial has $a_j$ as a root. This means its degree is at least that of the minimal polynomial of $a_j$ over $k(a_1,a_2,\dots,a_{j-1})$.
So $$[k(a_1,a_2,\dots,a_{j-1},a_j):k(a_1,a_2,\dots,a_{j-1})]=[k(a_1,a_2,\dots,a_{j-1})(a_j):k(a_1,a_2,\dots,a_{j-1})]$$$$\leq \operatorname{deg}\left(\frac{p(x)}{(x-a_1)(x-a_2)\dots (x-a_{j-1})}\right)=(m-j+1)$$
Since this result holds for arbitrary $1<j\leq m$, we get, by the tower theorem: $$[k(a_1,a_2,\dots,a_m):k]=[k(a_1):k]\prod_{j=2}^m[k(a_1,a_2,\dots,a_{j-1},a_j):k(a_1,a_2,\dots,a_{j-1})]$$$$\leq m\prod_{j=2}^m (m-j+1)=m \prod_{r=1}^{m-1} r=m!$$
Then, since $m\leq n$, we get $[k(a_1,a_2,a_3,\dots,a_m):k]\leq n!$
Lastly, since $p$ is separable and $k(a_1,a_2,a_3,\dots,a_m)$ is the splitting field of $p$ over $k$, $k(a_1,a_2,a_3,\dots,a_m)/k$ is normal.
So $N\leq k(a_1,a_2,a_3,\dots,a_m)$ giving us $$[N:k]\leq [k(a_1,a_2,a_3,\dots,a_m):k]\leq n!$$