1. Notation and terminology
Throughout this paper S denotes an arbitrary semigroup, i.e. a set equipped with an associative binary operation and μ := ∑i∈I αiδzi is a linear combination of Dirac measures (δzi)i∈I, where (zi)i∈I are fixed elements in S and (αi)i∈I ∈ ℂ are such that ∫S dμ(t) = ∑i∈I αi = 1 and {αi|αi ≠ 0, i ∈ I} is a finite set. A function A: S → ℂ is additive if A(xy) = A(x) + A(y) for all x, y ∈ S. A function χ: S → ℂ is multiplicative if χ(xy) = χ(x)χ(y) for all x, y ∈ S.
Two complex-valued functions f and g are quadratically equivalent if for some nonvanishing constants c1, c2 ∈ ℂ we have
for all x ∈ S, where Δy denotes the difference operator with span y given by and the iterates are defined respectively , , n = 1, 2, . . . . In particular, for n = 3: or, equivalently, where fy(x) = f(xy) for all x, y ∈ S.2. Introduction
Let A and m be an additive and a multiplicative functions respectively. Then
andSumming up these two functional equations side by side we obtain
Conversely, a natural question is whether given two functions f : S → ℂ and g : S → ℂ, the corresponding equation
implies the additivity of f and hence the multiplicativity of g (alienation phenomenon). For the more detailed study of the history of this phenomenon see the survey article [ 10].During their investigations of the alienation of Cauchy’s functional equations, Dhombres [2] (where the alienation idea comes from) and Ger [6, 7, 9] obtained interesting results about the generalized ring homomorphisms equation
By algebraic methods Ger [8] proved that the solutions f, g : M → R of the Pexider functional equation
on a commutative monoid M mapping into an integral domain R are closely related to the solutions of the trigonometric functional equationThe solutions of equation (2.5) are known on commutative monoids, and then the solutions of (2.4) are described by means of additive and multiplicative functions. Furthermore, Ger [8] establishes the alienation of additivity and exponentiality up to quadratic equivalence.
By using Stetkær result [13] about the solutions of (2.5) on groups, Ger main result can be extended to the more general case, when M is a group not necessarily commutative.
The purpose of the present paper is to show how Ger’s work [8] on commutative monoids extends to the much wider framework of semigroups not necessarily commutative. Our main goal is to give the general solutions of (2.3) on all semigroups by proving a similar result as [8, Theorem 3]. In the proof we use the solutions of cosine addition law:
instead of equation (2.5). A secondary goal is to obtain the solutions of the functional equation and to prove that the system of equations is equivalent to (2.6) when f and g are assumed not to be quadratically equivalent.The solutions of the functional equation
are of the form f = A + ∫S A(t)dμ(t) where A is an additive function (see Lemma 4.1 below), while the functional equation has been solved by E. Elqorachi and A. Redouani [5, Corollary 2.5]. The solutions are of the form g = χ ∫S χ(t)dμ(t), where χ is a multiplicative function.3. Solutions of the functional equations (2.3) and alienation of equations (2.1) and (2.2)
The present section is dedicated to solve the functional equation (2.3). The solutions are expressed (in Theorem 3.1) in terms of multiplicative and additive functions. In addition, by help of these results, we will show in Theorem 3.2 that the functional equations (2.1) and (2.2) are alien to each other for non-quadratically equivalent functions.
Theorem 3.1
The solutions f, g : S → ℂ of the functional equation
are the following pairs:(a) , , where α ∈ ℂ\ {i,−i} and A is additive and χ is multiplicative;
(b) g = A + 1, , where A, B are additive.
Proof
Let the pair (f, g) be a solution of equation (2.3). If g = 1 or g = 0, then f is additive. This occurs in case (a) with χ = 1 or with χ = 0 and α = 0. From now on we assume that g ≠ 1 and g ≠ 0 and we follow the proof given by Ger [8] in the commutative case. It is well known that the Cauchy difference Cf (x, y) := f(xy) − f(x) − f(y), x, y ∈ S satisfies the cocycle equation
From (2.3) we find that
Inserting the last identity into (3.1), we obtain the following functional equation
Now, the rest of the proof takes another way, we simply notice that g satisfies the cosine addition law. Indeed, by subtracting g(x)g(y)g(z) from both sides of (3.2), we get
Since g ≠ 1, there exists x0 ∈ S such that
Using (3.3), the term g(yx0) − g(y)g(x0) can be written as
It follows from (3.3) that g satisfies the cosine functional equation
where .If α = 0, then g is multiplicative and, consequently, f is additive. This occurs in case (a). Otherwise we have to deal with a particular case of the cosine addition law (3.4) with α ≠ 0. According to [3, Theorem 3.2] (see [1, Theorem 2.2] for simpler formulas), the pair (g, α(g − 1)) has one of the forms included in the following list:
(i) g = 0 on S2, where S2 = {xy | x, y ∈ S} and α(g − 1) = ±ig.
(ii) and , where c ∈ ℂ \ {0, i,−i} and m is a nonzero multiplicative function.
(iii) and , where χ1 and χ2 are two multiplicative functions such that χ1 ≠ χ2 and δ ∈ ℂ \ {0, i,−i}.
(iv) g = χ ± ϕ and α(g − 1) = −iϕ, where χ is a nonzero multiplicative function and ϕ is a solution of the special sine addition law
First case: the pair (g, α(g − 1)) has the form (i). This case is omitted because the identities α(g − 1) = ±ig and g = 0 on S2 imply that α = 0.
Second case: the pair (g, α(g − 1)) has the form (ii). In this case we have α ≠ c and . Since g is a solution of (3.4), we check by elementary computations that αc = −1 and hence . Using this formulas in (2.3), we get that is an additive function. That is , where A is additive. This occurs in case (a) with χ = 0.
Third case: the pair (g, α(g − 1)) has the form (iii). In this case we deduce that
Using [11, Theorem 3.18], equation (3.6) shows that χ1 = 1 and δ = α−1 or χ2 = 1 and δ = α since χ1 ≠ χ2, then , where χ is a multiplicative function. Using this form of g in equation (2.3) we get after some rearrangements that , where A is an additive function. This occurs in case (a).
Fourth case: the pair (g, α(g − 1)) has the form (iv). In this case we have
Since χ ≠ 0, we deduce that ϕ ≠ χ because otherwise, we will have χ(xy) = 2χ(x)χ(y) for all x, y ∈ S which implies χ=0. In view of [4, Lemma 4.2], the identity (3.7) shows that ϕ = 1 or χ = 1.
The case ϕ = 1 does not occur because, otherwise, we will have χ = 1, which contradicts the fact that ϕ ≠ χ. So we have to take χ = 1. It follows that ϕ is additive, consequently g = A + 1, where A is an additive function. Then, from (2.3) we deduce that f and g satisfy f(xy) = f(x)+f(y)−g(xy)+g(x)g(y), x, y ∈ S, or equivalently
Consider the particular Levi–Civita equation
for unknown ψ: S → ℂ, where χ is a nonzero multiplicative function and ϕ is a nonzero solution of the special sine addition law (3.5). Taking χ = 1 and ϕ = A, one can observe that the functional equation (3.8) is a particular instance of (3.9). According to [4, Theorem 4.1] with χ = 1, we have , where B is an additive function. This is case (b), and this completes the proof.Theorem 3.2
Let S be a semigroup. If functions f : S → ℂ and g : S → ℂ are not quadratically equivalent then they satisfy the functional equation
if and only if g is multiplicative and f is additive.Proof
The “if” part of the proof is obvious.
Let the pair (f, g) be a solution of (2.3). If the pair (f, g) has the form as in Theorem 3.1(b), then . This is a contradiction. If (f, g) has the form as in Theorem 3.1(a) such that α ≠ 0, then we find that , where , which contradicts the fact that f and g are not quadratically equivalent. So, necessarily we have α = 0. Then g is multiplicative and f is additive. This completes the proof.
4. Solutions of the functional equations (2.6) and alienation of equations (2.7) and (2.8)
In this section we give (in Theorem 4.2) an exhaustive list of solutions of the functional equation (2.6). We express them in terms of multiplicative and additive functions. Furthermore, on the basis of these results, we prove in Theorem 4.3 that the functional equations (2.1) and (2.2) are alien to each other for non-quadratically equivalent functions.
To prove the next theorem we will need the following:
Lemma 4.1
Let f : S → ℂ be a solution of the functional equation (2.7). Then f is of the form f = A + ∫S A(t)dμ(t) where A is an additive function.
Proof
By replacing x by xy and y by ks in (2.7) and integrating the result obtained with respect to k and s we get
By replacing x by xyk and y by s in (2.7) and integrating the result obtained with respect to k and s we obtain
By comparing (4.1) and (4.2) and taking into account that ∫S dμ(t) = 1 we deduce that f + ∫S f(s)dμ(s) −∫S ∫S f(ks)dμ(k)dμ(s) is additive. Consequently f = A −∫S f(s)dμ(s) + ∫S ∫S f(ks)dμ(k)dμ(s), where A is an additive function. Putting this back into (2.7) we find that −∫S f(s)dμ(s) + ∫S ∫S f(ks)dμ(k)dμ(s) = ∫S A(s)dμ(s). This completes the proof.
Theorem 4.2
The solutions f, g : S → ℂ of the functional equation
are the following pairs:(a) g = c, f = A + ∫S A(t)dμ(t) + c − c2, where c ∈ ℂ and A is additive;
(b) g = A, , where A and B are additive, and ∫S A(t)dμ(t) = −1;
(c) g = c (φ − 1), f = A+ ∫S A(t)dμ(t)+c2 (φ − 1)−c, where c ∈ ℂ\ {−1, 0}, φ is a multiplicative function such that φ ≠ 1, and A is additive;
(d) g = χ ∫S χ(t)dμ(t), f = A + ∫S A(t)dμ(t), where χ is an nonzero multiplicative function such that χ ≠ 1 and A is additive;
(e) , , where α ∈ ℂ\ {0, i,−i}, r ∈ ℂ\ {0} and , A is additive and χ is a multiplicative function such that χ ≠ 1 and ;
(f) g = r(A+1), , where r ∈ ℂ\ {0} and A, B are additive such that A ≠ 0 and .
Proof
Let the pair (f, g) be a solution of (2.6). If g is constant, that is g = c, where c ∈ ℂ, we see from (2.6) that f − c + c2 is a solution of equation (2.7). Then, using Lemma 4.1, we conclude that f − c + c2 = A + ∫S A(t)dμ(t), where A is additive. This proves (a). From now on we assume that g is not constant.
Using the associative property of the semigroup operation, we compute the term ∫S f(xyzt)dμ(t) + ∫S g(xyzt)dμ(t) first as ∫S f((xy)zt)dμ(t) + ∫S g((xy)zt)dμ(t), then as ∫S f(x(yz)t)dμ(t) + ∫S g(x(yz)t)dμ(t). Comparing the results, we obtain the following
Subtracting g(x)g(y)g(z) + f(y) from both sides of (4.3), we get
Since g is not constant, there exist z1, z2 ∈ S such that g(z1) ≠ g(z2). So, from (4.4) we get
and for some functions kj, j = 1, 2, 3, 4, or equivalentlySince g(z1) ≠ g(z2) we have
and for some functions ρj, j = 1, 2, 3, 4.Putting this back into (4.4) we get after some rearrangements that
Taking into account that g is not constant, (4.7) shows that
andConsequently, for the same reason, (4.8) and (4.9) show that
where aj, bj are constants.Substituting (4.10) into (4.8) and (4.9) we infer that
Then, from (4.5) and (4.6) we deduce that f and g satisfy the functional equations
andBy replacing y by t in (4.11) and (4.12) and integrating the results obtained with respect to t we get
and where a0 := b1 + b2 ∫S g(t)dμ(t), b0 := ∫S f(t)dμ(t) + b1 ∫S g(t)dμ(t) + a1, c0 := (b4 + 1) ∫S g(t)dμ(t) + b2 and d0 := b2 ∫S g(t)dμ(t) + b1. Now, by using the relations (4.13) and (4.14) in (2.6) we get where r := a0 + c0 and q = b0 + d0.First case: r = 0. In this case (4.15) becomes
Equation (4.16) shows that the Cauchy difference Cf has the form
Using again the cocycle equation (3.1) leads to
Since g ≠ 0, we deduce that
where φ(y) := (g(s0))−1 [g(ys0) − g(y)], for some s0 ∈ S such that g(s0) ≠ 0.Now, from [12, Proposition 3], the identity (4.17) shows that φ is multiplicative. In view of (4.12) g is central: g(xy) = g(yx), x, y ∈ S. Using the centrality of g, (4.17) shows that
We may distinguish two subcases here.
If φ = 1, then (4.17) shows that g = A, where A is additive, and since f and g satisfy equation (4.16), we conclude that
Then from [4, Theorem 4.1] we have , where B is an additive function. Since the pair (f, g) satisfies (2.6), by taking x = y we have the following relation
Recall that g is a nonconstant function. So, from (4.18) we deduce that ∫S A(t)dμ(t) = −1 and . This proves (b).
If φ ≠ 1, then
where c ∈ ℂ \ {0}. Inserting (4.19) into (4.16), we deduce that f−c2 (φ − 1)−q is an additive function, that is f = A + c2 (φ − 1) + q, where A is additive. Putting back the new forms of f and g into (2.6) yieldsFrom (4.19) we deduce that φ can not be constant. So (4.20) shows that ∫S φ(t)dμ(t) + c ∫S φ(t)dμ(t) − c = 0 and q −∫S A(t)dμ(t) + c = 0. Then f(x) = A(x)+ ∫S A(t)dμ(t)+c2 (φ − 1)−c, x ∈ S and . This proves (c).
Second case: r ≠ 0. From equation (4.15) one can easily verify that F := r−2 (f − q) and G := r−1g solve the functional equation (2.3). So, we know from Theorem 3.1 that there are only the following two possibilities:
(i) and , where α ∈ ℂ \ {i,−i}, A is additive and χ is multiplicative.
(ii) g = r (A + 1) and , where A, B are additive functions.
Subcase 1: If the pair (f, g) has the form (i). If α = 0, then f and g satisfy the following equations
and respectively.From (4.21) and (4.22) we deduce that
andNow, by inserting (4.23) and (4.24) into (2.6), we see that
Since g is not constant, the last identity implies that r−2 ∫S g(t)dμ(t) = 1 and 2q −∫S f(t)dμ(t) = 0. It follows that f and g are solutions of (2.7) and (2.8) respectively. Then, from Lemma 4.1 and [5, Corollary 2.5], we deduce the desired forms of f and g. This proves (d).
From now on we assume that α ≠ 0. Using the notation , f and g can be written as f = r2 [A − c(1 − c)(χ − 1)] + q and g = r [cχ + (1 − c)] respectively. Putting this back into (2.6), one gets
As χ is not constant, (4.25) implies that 1 − r(1 − c) ≠ 0 and (1 − r(1 − c)) ∫S χ(t)dμ(t)−rc = 0. Consequently we have , and q − r2 ∫S A(t)dμ(t) − r(1 − c)(1 − r) = 0. This proves (e).
Subcase 2: If the pair (f, g) has the form (ii). Then, taking x = y, (2.6) implies that
Since A is not constant, we deduce from (4.26) that r ∫SA(t)dμ(t)+1−r = 0. Consequently we have and . This proves case (f).
Theorem 4.3
Let S be a semigroup and μ is a linear combination of Dirac measures (δzi)i∈I for some fixed elements (zi)i∈I contained in S such that ∫S dμ = 1. If functions f : S → ℂ and g : S → ℂ are not quadratically equivalent then they satisfy the equation
if and only if f and g solve the systemProof
The “if”" part of the proof is obvious.
Let the pair (f, g) be a solution of (2.6). We can easily check that if (f, g) has one of the forms (a), (b) and (f) of Theorem 4.2, then we have , which contradicts our hypothesis about f and g. In the case when (f, g) has the form (c) we obtain and when (f, g) has the form (e) we have . For the same reason, the two last cases does not occur. It follows that the only possible case is when (f, g) has the form (d). This completes the proof.