Proof Problem: Show f(x-1)=f(x) for All x ∈ E

  • Thread starter Thread starter Cyannaca
  • Start date Start date
  • Tags Tags
    Proof
Cyannaca
Messages
22
Reaction score
0
I would really appreciate if anyone could help me with this problem.

F is a group homomorphism from G= (E, *) to H= (F,#).
If , for all x e E , x*x e ker(f).
Show that for all x e E, f(x-1)=f(x)

Now I don't know how I should start the proof. Also, I would like to know if I can assume that Ker(f) is equal to the identity element.
 
Physics news on Phys.org
If x*x \in Ker(f) then this means precisely that f(x*x) = 1_F where 1_F is the identity element of H. You want to show something like:

f(x*y) = f(x)#f(y)

and

f(x^{-1}) = (f(x))^{-1}

In fact, you probably already have these proved somewhere. If you do, then use them and the rest should be very simple. Actually, I don't remember the definitions, but I have a feeling that the first thing (that f(x*y) = f(x)#f(y)) might just be a property of homomorphisms. The second property follows from the first at least in the case where x*x is in Ker(f), and probably in general too.
 
You've got F as a homomorphism, and the underlying set of H (at least that's what I presume H=(F,#) means. Usually there is no reason to distinguish the group from its elements like that. Also, if you're not going to tex it then it's common to indicate inverses by putting the minus 1 in an exponent, since x-1 doesn't really make sense for a group. You may not assume ker(f) is the identity element, since that is saying f is an injection which is not given.

From the definition y in ker f iff f(y)=e conclude something about f(xx), and use AKG's stuff above which is the (usual) definitoin of what a homomorphism is.

And remember showing that y is the inverse of x is showing exactly that xy=yx=e.
 
Matt, I believe he/she meant f (lower case) to be the homomorphism, and F to be the set underlying group H.
 
Is that what the guy is talking about, F(x-1) is actually F(x^(-1))? Just written differently? No wonder the problem look mysterious! This is a completely simple problem now that it is written so it can be read! If F(x*x) goes to 1, then x is its own inverse, since by group property there can be only a unique inverse.

You got to be careful about how you write the inverse if you use a calculator, you know!
 
Last edited:
I asked online questions about Proposition 2.1.1: The answer I got is the following: I have some questions about the answer I got. When the person answering says: ##1.## Is the map ##\mathfrak{q}\mapsto \mathfrak{q} A _\mathfrak{p}## from ##A\setminus \mathfrak{p}\to A_\mathfrak{p}##? But I don't understand what the author meant for the rest of the sentence in mathematical notation: ##2.## In the next statement where the author says: How is ##A\to...
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