Abstract functional equation
by math_explorer, Jan 26, 2013, 2:05 AM
An anti-homomorphism from a ring
to a ring
is a homomorphism
(what a great letter) between the additive groups that also satisfies
and
for any
.
A Jordan homomorphism from a ring
to a ring
is a homomorphism
between the additive groups that also satisfies
and
for any
.
Why do people have so many things named after them!?
If
is a domain, then the Jordan homomorphism is either a homomorphism or an anti-homomorphism.
This is so literally a functional equation...
Proof.
Let
denote the statement
.
![\[P(a, 1) \Longrightarrow \eta(a^2) = \eta(a)^2 \qquad \forall a \in R\]](//latex.artofproblemsolving.com/a/c/2/ac2e2b944ea650ee7644d36068ba2e390d3046d0.png)
![\[P(a, a) \Longrightarrow \eta(a^3) = \eta(a)^3 \qquad \forall a \in R\]](//latex.artofproblemsolving.com/8/f/a/8fa511a4062299feab8c756babf5fd4ff8a952ee.png)
Hmm qq is a substring of \qquad. /random
Subtracting
and
from
yields
![\[ \eta(abc + cba) = \eta(a)\eta(b)\eta(c) + \eta(c)\eta(b)\eta(a) \]](//latex.artofproblemsolving.com/3/f/d/3fd1efb21884c4000074930ff33d17f42a162615.png)
(since
is an additive group homomorphism)
Let this statement be
.
So, for any
we have

using
and
and of course the additive-group-homomorphism properties.
(darn I'm not sure what the best way to typeset this without overflowing width is)
So (this is the only place where we use the condition that
is a domain) one of the factors in the original expression is 0, i.e. either
or
for any
(*).
In fact, the single condition (*) plus the additive-group-homomorphism properties are sufficient to prove that
is either a homomorphism or an anti-homomorphism.
To prove this, we need to show it works like a homomorphism on all pairs
with
, or like an anti-homomorphism on all pairs
with
. This is somewhat an abuse of English but I think it gets the point across better than equation after equation. We provide two ways to finish.
The Straightforward Bash
Claim. For any
, either
acts as a homomorphism or as an anti-homomorphism on both pairs
and
. Similar remarks hold for
and
.
Proof of claim. If this is not true, then the only other possibility for (*) is that
acts as a homomorphism on one pair and as an anti-homomorphism on the other.
Suppose (WLOG)
and
. Consider
.
If
then
too.
Otherwise if
then
too.
Both contradict our initial assumption. Thus
acts as a homomorphism on both or as an anti-homomorphism on both.
-- end claim --
Now: suppose
works on some pair as only a homomorphism and on some other pair as only an anti-homomorphism, that is:
while
.
From what we just derived, this forces
to work as both a homomorphism and an anti-homomorphism on the pairs
and
. Thus:

i.e.
works on
as only a homomorphism, and on
as only an anti-homomorphism, impossible.
Thus
is fully a homomorphism or fully an anti-homomorphism (it may be partially both, on elements that commute). Q.E.D.
Slick Group Theory!
Observe:
1.
2.
and
together imply
(additive homomorphism properties + distributivity)
3.
implies
since obviously
commutes with everybody multiplicatively just like 
(Firefox, how can you not think "multiplicatively" is a word?!)
Therefore, for any
, the set of all
such that
is a subgroup of the additive group of
.
Similar remarks hold if you fix
and collect all
, or if you look at pairs with
, or both.
Some quick group-theory lemmata:
Lemma 1. The intersection of any number of subgroups of a group is a subgroup. Proof. Just verify all the axioms trivially.
Lemma 2. If the union of two subgroups
and
of a group
is
itself then one of the subgroups is improper. Proof: If
is included in
or vice versa, the result is clear; otherwise, take
and
and observe that
is in neither
nor
, a contradiction.
Therefore:
Fix
and collect
and
.
From (*),
; also, as we discussed,
and
are subgroups of the additive group of
. Then by Lemma 2, either
or
(**).
Now collect
and
.
Note that
, which is a subgroup of
from our initial discussion and Lemma 1. Similarly,
is a subgroup of
too. Then (**) says that for any
, either
or
, i.e.
. By Lemma 2 either
, whence
is a homomorphism, or
, whence
is an anti-homomorphism. Q.E.D.






A Jordan homomorphism from a ring






Why do people have so many things named after them!?
If

This is so literally a functional equation...
Proof.
Let


![\[P(a, 1) \Longrightarrow \eta(a^2) = \eta(a)^2 \qquad \forall a \in R\]](http://latex.artofproblemsolving.com/a/c/2/ac2e2b944ea650ee7644d36068ba2e390d3046d0.png)
![\[P(a, a) \Longrightarrow \eta(a^3) = \eta(a)^3 \qquad \forall a \in R\]](http://latex.artofproblemsolving.com/8/f/a/8fa511a4062299feab8c756babf5fd4ff8a952ee.png)
Hmm qq is a substring of \qquad. /random
Subtracting



![\[ \eta(abc + cba) = \eta(a)\eta(b)\eta(c) + \eta(c)\eta(b)\eta(a) \]](http://latex.artofproblemsolving.com/3/f/d/3fd1efb21884c4000074930ff33d17f42a162615.png)
(since

Let this statement be

So, for any


using


(darn I'm not sure what the best way to typeset this without overflowing width is)
So (this is the only place where we use the condition that




In fact, the single condition (*) plus the additive-group-homomorphism properties are sufficient to prove that

To prove this, we need to show it works like a homomorphism on all pairs




The Straightforward Bash
Claim. For any






Proof of claim. If this is not true, then the only other possibility for (*) is that

Suppose (WLOG)



If


Otherwise if


Both contradict our initial assumption. Thus

-- end claim --
Now: suppose



From what we just derived, this forces




i.e.



Thus

Slick Group Theory!
Observe:
1.

2.



3.




(Firefox, how can you not think "multiplicatively" is a word?!)
Therefore, for any




Similar remarks hold if you fix



Some quick group-theory lemmata:
Lemma 1. The intersection of any number of subgroups of a group is a subgroup. Proof. Just verify all the axioms trivially.
Lemma 2. If the union of two subgroups











Therefore:
Fix



From (*),






Now collect


Note that












This post has been edited 1 time. Last edited by math_explorer, Mar 26, 2015, 5:36 AM
Reason: align
Reason: align