Solving Ring Theory Question - Centralizer of Division Char(D) ≠ 2

  • Thread starter Thread starter DukeSteve
  • Start date Start date
  • Tags Tags
    Ring Theory
DukeSteve
Messages
9
Reaction score
0
Hello Experts,

Here is the question, and what I did:

Q: Given a ring with division D char(D) != 2, F = Centralizer of D (means that F becomes a field). Given that x in D isn't in F but x^2 is included in F.

Needed to prove that there exists y in D and y*x*y^(-1) = -x
and also that y^2 is in C_D({x}) where C_D is the centralizer of the set {x} sub set of D.

What I did is:

I know that x is not in F so there exists such s in D that sx!=xs
Let's call sx-xs = y there is y^-1 because every non zero element in D is invertible.

Then I just tried to plug it in the equation: (sx-xs)*x*(sx-xs)^(-1) =>
(sx-xs)^(-1) should be 1/(sx-xs) but it gives nothing.

Please tell me how to solve it...I know that I miss something, please guide me step by step.
 
Physics news on Phys.org
You're almost there (remember that sx^2=x^2s):

(sx-xs)x(sx-xs)^{-1}=(sx^2-xsx)(sx-xs)^{-1}=x(xs-sx)(sx-xs)^{-1}=-x
 
Ohh thanks a lot I just figured it out!
Please excuse me if I answered before in a rude form, I didn't want to hurt you!

Thank You very much!
 
##\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