Prep for Algebra Comprehensive Exam #2

  • Thread starter Thread starter BSMSMSTMSPHD
  • Start date Start date
  • Tags Tags
    Algebra Exam
BSMSMSTMSPHD
Messages
131
Reaction score
0
2. Let R be an integral domain containing F as a subring. Suppose that R is finite-dimensional when viewed as a vector space over F. Prove that R is a field.

SOLUTION

I will show that \forall \ r \in R, (r \neq 0), r is a unit. Equivalently, \forall \ r \in R, (r \neq 0), \exists \ s \in R, (s \neq 0), such that <br /> rs = sr = 1.

Suppose dim_{F}(R)=n and consider the subset \{ 1, r, r^2, r^3, ..., r^n, r^{n+1} \}. This set is linearly dependent over F. That is, \exists \ a_0, a_1, ..., a_{n+1} \in F - \{ 0 \} such that:

a_0(1) + a_1(r) + a_2(r^2) + ... + a_n(r^n) + a_{n+1}(r^{n+1}) = 0

Then, a_1(r) + a_2(r^2) + ... + a_n(r^n) + a_{n+1}(r^{n+1}) = -a_0

Since F is a field, and a_0 \neq 0, it follows that a_0 must be a unit. So, we can divide the last equation by -a_0 producing:

- \frac{a_1}{a_0}(r) - \frac{a_2}{a_0}(r^2) - ... - \frac{a_n}{a_0}(r^n) - \frac{a_{n+1}}{a_0}(r^{n+1}) = 1r(- \frac{a_1}{a_0} - \frac{a_2}{a_0}(r) - ... - \frac{a_n}{a_0}(r^{n-1}) - \frac{a_{n+1}}{a_0}(r^n)) = 1Call the expression in the parentheses s. We have shown that rs=1. Additionally, s \neq 0 since R in n-dimensional over F. Finally, since R is an integral domain, rs = sr = 1.

Therefore, every element in R is a unit, and so R must be a field.
 
Last edited:
Physics news on Phys.org
Another approach is to show the maximal ideal of R is \{ 0\}. But this is not shorter than what you did.

By using the theorem.

Theorem: Let R be a commutative unitary ring. R is a field if and only if its maximal ideal is \{ 0 \}.
 
There's a problem with your proof: we don't know that a_0 \neq 0. Linear dependence doesn't imply that all the a_i's are nonzero - it implies that they're not all zero, leaving the possibility of some being zero as long as we have at least one nonzero a_j.
 
Ah yes, you are right. I shouldn't have written that all of the coefficients were not zero. I suspect that we can say a_0 \neq 0 based on the second line:

a_1(r) + a_2(r^2) + ... + a_n(r^n) + a_{n+1}(r^{n+1}) = -a_0

Help?
 
One way you can overcome this is by letting j be the first index for which a_j \neq 0. Your expression will become:

a_j r^j + a_{j+1} r^{j+1} + \cdots + a_{n+1} r^{n+1} = 0

Then you can pull out r^j:

r^j \left(a_j + a_{j+1} r + \cdots + a_{n+1} r^{n+1-j}\right) = 0

Now your previous argument, together with the fact that R is an integral domain, can be used to finish things off.
 
injective linear maps of finite dimensional spaces are surjective. done.
 
##\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