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
Let A and m be an additive and a multiplicative functions respectively. Then
Summing 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
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
The 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:
The solutions of the functional equation
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.
The solutions f, g : S → ℂ of the functional equation
- (a)
,g = {{\chi + {\alpha ^2}} \over {{\alpha ^2} + 1}} , where α ∈ ℂ\ {i,−i} and A is additive and χ is multiplicative;f = A - {{{\alpha ^2}} \over {{{\left( {{\alpha ^2} + 1} \right)}^2}}}\left( {\chi - 1} \right) - (b)
g = A + 1,
, where A, B are additive.f = B + {1 \over 2}{A^2}
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
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)
andg = {1 \over {1 + {c^2}}}m , where c ∈ ℂ \ {0, i,−i} and m is a nonzero multiplicative function.\alpha \left( {g - 1} \right) = {c \over {1 + {c^2}}}m - (iii)
andg = {{{\delta ^{ - 1}}{\chi _1} + \delta {\chi _2}} \over {{\delta ^{ - 1}} + \delta }} , where χ1 and χ2 are two multiplicative functions such that χ1 ≠ χ2 and δ ∈ ℂ \ {0, i,−i}.\alpha \left( {g - 1} \right) = {{{\chi _2} - {\chi _1}} \over {{\delta ^{ - 1}} + \delta }} - (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
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
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
Let S be a semigroup. If functions f : S → ℂ and g : S → ℂ are not quadratically equivalent then they satisfy the functional equation
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
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:
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. 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.
The solutions f, g : S → ℂ of the functional equation
- (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;f = B + \int_S {B\left( t \right)d\mu \left( t \right) + {1 \over 2}\left[ {{A^2} + \int_S {{A^2}\left( t \right)d\mu \left( t \right)} } \right] - 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;\int_S {\varphi \left( t \right)d\mu \left( t \right) = {c \over {c + 1}}} - (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)
,g = r{{\chi + {\alpha ^2}} \over {{\alpha ^2} + 1}} , where α ∈ ℂ\ {0, i,−i}, r ∈ ℂ\ {0} andf = {r^2}\left[ {A + \int_S {A\left( t \right)d\mu \left( t \right) - {{{\alpha ^2}} \over {{{({\alpha ^2} + 1)}^2}}}\left( {\chi - 1} \right)} } \right] + r\left( {1 - r} \right){{{\alpha ^2}} \over {{\alpha ^2} + 1}} , A is additive and χ is a multiplicative function such that χ ≠ 1 andr \ne {{{\alpha ^2} + 1} \over {{\alpha ^2}}} ;\int_S {\chi \left( t \right)d\mu \left( t \right) = {r \over {{\alpha ^2}\left( {1 - r} \right) + 1}}} - (f)
g = r(A+1),
, where r ∈ ℂ\ {0} and A, B are additive such that A ≠ 0 andf = {r^2}\left[ {B + \int_S {B\left( t \right)d\mu \left( t \right) + {1 \over 2}{A^2} + {1 \over 2}\int_S {{A^2}\left( t \right)d\mu \left( t \right)} } } \right] - {(r - 1)^2} .\int_S {A\left( t \right)d\mu \left( t \right) = {{r - 1} \over r}}
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
Since g(z1) ≠ g(z2) we have
Putting this back into (4.4) we get after some rearrangements that
Taking into account that g is not constant, (4.7) shows that
Consequently, for the same reason, (4.8) and (4.9) show that
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
By replacing y by t in (4.11) and (4.12) and integrating the results obtained with respect to t we get
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
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
Recall that g is a nonconstant function. So, from (4.18) we deduce that ∫S A(t)dμ(t) = −1 and
If φ ≠ 1, then
From (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
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)
andg = r{{\chi + {\alpha ^2}} \over {{\alpha ^2} + 1}} , where α ∈ ℂ \ {i,−i}, A is additive and χ is multiplicative.f = {r^2}\left[ {A - {{{\alpha ^2}} \over {{{({\alpha ^2} + 1)}^2}}}\left( {\chi - 1} \right)} \right] + q - (ii)
g = r (A + 1) and
, where A, B are additive functions.f = {r^2}\left[ {B + {1 \over 2}{A^2}} \right] + q
Subcase 1: If the pair (f, g) has the form (i). If α = 0, then f and g satisfy the following equations
From (4.21) and (4.22) we deduce that
Now, 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
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
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
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
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