Division algebra with only algebraic elements over an algebraically closed field
Let
Proof
Let
and be its minimal polynomial. Since has no zero divisors, must be an ^irreducible: For if then and hence either or , a contradiction. Since is irreducible it is linear by ^A2, thus whence .
Corollaries
The following situations guarantee every element
- All elements of a finite-dimensional unital associative algebra are algebraic.
- Dixmier’s lemma
- Quillen’s lemma
Footnotes
-
Equivalently
is an algebra such that every has a minimal polynomial with a nonzero constant term ↩