Skip to main content
Have a personal or library account? Click to login
On the Alienation of Multiplicative and Additive Functions Cover

On the Alienation of Multiplicative and Additive Functions

Open Access
|Nov 2024

Full Article

1. Notation and terminology

Throughout this paper S denotes an arbitrary semigroup, i.e. a set equipped with an associative binary operation and μ := ∑iI αiδzi is a linear combination of Dirac measures (δzi)iI, where (zi)iI are fixed elements in S and (αi)iI ∈ ℂ are such that ∫S(t) = ∑iI αi = 1 and {αi|αi ≠ 0, iI} is a finite set. A function A: S → ℂ is additive if A(xy) = A(x) + A(y) for all x, yS. A function χ: S → ℂ is multiplicative if χ(xy) = χ(x)χ(y) for all x, yS.

Two complex-valued functions f and g are quadratically equivalent if for some nonvanishing constants c1, c2 ∈ ℂ we have

Δy3c1f+c2gx=0
for all xS, where Δy denotes the difference operator with span y given by
Δyfx:=fxyfx
and the iterates Δyn are defined respectively Δy0f:=f, Δyn+1f:=ΔyΔynf, n = 1, 2, . . . . In particular, for n = 3:
Δy3fx=fxy33fxy2+3fxyfx
or, equivalently,
Δy3=fy33fy2+3fyf,
where fy(x) = f(xy) for all x, yS.

2. Introduction

Let A and m be an additive and a multiplicative functions respectively. Then

(2.1)
Axy=Ax+Ay,x, yS,
and
(2.2)
mxy=mxmy,x, yS.

Summing up these two functional equations side by side we obtain

Axy+mxy=Ax+Ay+mxmy,x, yS.

Conversely, a natural question is whether given two functions f : S → ℂ and g : S → ℂ, the corresponding equation

(2.3)
fxy+gxy=fx+fy+gxgy,x, yS,
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

afxy+bfx+y+cfxfy+dfx+dfy=0.

By algebraic methods Ger [8] proved that the solutions f, g : MR of the Pexider functional equation

(2.4)
fx+y+gx+y=fx+fy+gxgy,x, yM,
on a commutative monoid M mapping into an integral domain R are closely related to the solutions of the trigonometric functional equation
(2.5)
hx+y=φxhy+hx,x, yM.

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:

gxy=gxgy+fxfy,x, yS,
instead of equation (2.5). A secondary goal is to obtain the solutions of the functional equation
(2.6)
Sfxytdμt+Sgxytdμt=fx+fy+gxgy,x,yS,
and to prove that the system of equations
Sfxytdμt=fx+fy,Sgxytdμt=gxgy,x, yS,
is equivalent to (2.6) when f and g are assumed not to be quadratically equivalent.

The solutions of the functional equation

(2.7)
Sfxytdμt=fx+fy,x, yS,
are of the form f = A + ∫S A(t)(t) where A is an additive function (see Lemma 4.1 below), while the functional equation
(2.8)
Sgxytdμt=gxgy,x, yS,
has been solved by E. Elqorachi and A. Redouani [5, Corollary 2.5]. The solutions are of the form g = χ ∫S χ(t)(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

fxy+gxy=fx+fy+gxgy,x, yS,
are the following pairs:
  • (a) g=χ+α2α2+1 , f=Aα2α2+12χ1, where α ∈ ℂ\ {i,i} and A is additive and χ is multiplicative;

  • (b) g = A + 1, f=B+12A2, 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, yS satisfies the cocycle equation

(3.1)
Cfxy, z+Cfx, y=Cfx, yz+Cfy, z,x, y, zS.

From (2.3) we find that

Cfx, y=gxgygxy,x, yS.

Inserting the last identity into (3.1), we obtain the following functional equation

(3.2)
gxygzgygz+gyz=gxgyzgxgy+gxy, x, y, zS.

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

gz1gxygxgy=gx1gyzgygz,x,y,zS.

Since g ≠ 1, there exists x0S such that

(3.3)
gxygxgy=(gx01)1gx1gyx0gygx0,yS.

Using (3.3), the term g(yx0) − g(y)g(x0) can be written as

gyx0gygx0=gx011gy1gx02gx02,x,yS.

It follows from (3.3) that g satisfies the cosine functional equation

(3.4)
gxy=gxgy+α2gx1gy1,x, yS,
where α2=gx012gx02gx02.

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, yS} and α(g − 1) = ±ig.

  • (ii) g=11+c2m and αg1=c1+c2m, where c ∈ ℂ \ {0, i,i} and m is a nonzero multiplicative function.

  • (iii) g=δ1χ1+δχ2δ1+δ and αg1=χ2χ1δ1+δ, where χ1 and χ2 are two multiplicative functions such that χ1χ2 and δ ∈ ℂ \ {0, i,i}.

  • (iv) g = χ ± ϕ and α(g − 1) = −, where χ is a nonzero multiplicative function and ϕ is a solution of the special sine addition law

(3.5)
ϕxy=ϕxχy+ϕyχx,x, yS.

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 g=ααc. Since g is a solution of (3.4), we check by elementary computations that αc = −1 and hence g=α2α2+1. Using this formulas in (2.3), we get that fα2(α2+1)2 is an additive function. That is f=A+α2(α2+1)2, 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

(3.6)
δ1+α1δ1+δχ1+δα1δ1+δχ21=0.

Using [11, Theorem 3.18], equation (3.6) shows that χ1 = 1 and δ = α−1 or χ2 = 1 and δ = α since χ1χ2, then g=χ+α2α2+1, where χ is a multiplicative function. Using this form of g in equation (2.3) we get after some rearrangements that f=Aα2(α2+1)2χ1, 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

(3.7)
χ+iα1±1ϕ1=0.

Since χ ≠ 0, we deduce that ϕχ because otherwise, we will have χ(xy) = 2χ(x)χ(y) for all x, yS 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, yS, or equivalently

(3.8)
fxy=fx+fy+AxAy,x, yS.

Consider the particular Levi–Civita equation

(3.9)
ψxy=ψxχy+χxψy+ϕxϕy,x, yS,
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 f=B+12A2, 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

fxy+gxy=fx+fy+gxgy,x, yS,
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 Δy3f+g=0. This is a contradiction. If (f, g) has the form as in Theorem 3.1(a) such that α ≠ 0, then we find that Δy3fc1g=Δy3Ac1=0, where c=1α2+1, 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)(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

(4.1)
SSSfxykstdμkdμsdμt=fxySdμt2+SSfksdμkdμs.

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

(4.2)
SSSfxykstdμkdμsdμt =SfxykdμkSdμt+SfsdμsSdμt =Sdμtfx+fy+Sfsdμs.

By comparing (4.1) and (4.2) and taking into account that S(t) = 1 we deduce that f + S f(s)(s) −SS f(ks)(k)(s) is additive. Consequently f = AS f(s)(s) + SS f(ks)(k)(s), where A is an additive function. Putting this back into (2.7) we find that −S f(s)(s) + SS f(ks)(k)(s) = S A(s)(s). This completes the proof.

Theorem 4.2

The solutions f, g : S → ℂ of the functional equation

Sfxytdμt+Sgxytdμt=fx+fy+gxgy,x,yS,
are the following pairs:
  • (a) g = c, f = A + ∫S A(t)(t) + cc2, where c ∈ ℂ and A is additive;

  • (b) g = A, f=B+SBtdμt+12A2+SA2tdμt1, where A and B are additive, and ∫S A(t)(t) = −1;

  • (c) g = c (φ − 1), f = A+ S A(t)(t)+c2 (φ − 1)−c, where c ∈ ℂ\ {−1, 0}, φ is a multiplicative function such that φ ≠ 1, Sφtdμt=cc+1 and A is additive;

  • (d) g = χ S χ(t)(t), f = A + S A(t)(t), where χ is an nonzero multiplicative function such that χ ≠ 1 and A is additive;

  • (e) g=rχ+α2α2+1, f=r2A+SAtdμtα2(α2+1)2χ1+r1rα2α2+1, where α ∈ ℂ\ {0, i,−i}, r ∈ ℂ\ {0} and rα2+1α2, A is additive and χ is a multiplicative function such that χ ≠ 1 and Sχtdμt=rα21r+1;

  • (f) g = r(A+1), f=r2B+SBtdμt+12A2+12SA2tdμt(r1)2, where r ∈ ℂ\ {0} and A, B are additive such that A ≠ 0 and SAtdμt=r1r.

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 fc + c2 is a solution of equation (2.7). Then, using Lemma 4.1, we conclude that fc + c2 = A + S A(t)(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)(t) + S g(xyzt)(t) first as S f((xy)zt)(t) + S g((xy)zt)(t), then as S f(x(yz)t)(t) + S g(x(yz)t)(t). Comparing the results, we obtain the following

(4.3)
fxy+fz+gxygz=fx+fyz+gxgyz,x,y,zS.

Subtracting g(x)g(y)g(z) + f(y) from both sides of (4.3), we get

(4.4)
fxyfxfy+gzgxygxgy=fyzfyfz+gxgyzgygz,x, y, zS.

Since g is not constant, there exist z1, z2S such that g(z1) ≠ g(z2). So, from (4.4) we get

fxyfxfy+gz1gxygxgy=k1y+gxk2y,x,yS,
and
fxyfxfy+gz2gxygxgy=k3y+gxk4y,x,yS,
for some functions kj, j = 1, 2, 3, 4, or equivalently
1gz11gz2fxyfxfygxygxgy=k1yk2yk3yk4y1gx,x,yS.

Since g(z1) ≠ g(z2) we have

(4.5)
fxyfxfy=ρ1y+gxρ2y,x, yS,
and
(4.6)
gxygxgy=ρ3y+gxρ4y, x, yS,
for some functions ρj, j = 1, 2, 3, 4.

Putting this back into (4.4) we get after some rearrangements that

(4.7)
gxρ2y+gzρ4yρ3zgyρ4z=ρ1z+gyρ2zρ1ygzρ3y, x, y, zS.

Taking into account that g is not constant, (4.7) shows that

(4.8)
ρ1z+gyρ2z=ρ1y+gzρ3y, y, zS,
and
(4.9)
ρ2y+gzρ4y=ρ3z+gyρ4z,y, zS.

Consequently, for the same reason, (4.8) and (4.9) show that

(4.10)
ρj=aj+bjg,j=1,2,3,4,
where aj, bj are constants.

Substituting (4.10) into (4.8) and (4.9) we infer that

b1=a2=a3andb3=b2=a4.

Then, from (4.5) and (4.6) we deduce that f and g satisfy the functional equations

(4.11)
fxy=fx+fy+b1gx+b1gy+b2gxgy+a1,x,yS,
and
(4.12)
gxy=b4+1gygx+b2gx+b2gy+b1, x, yS.

By replacing y by t in (4.11) and (4.12) and integrating the results obtained with respect to t we get

(4.13)
Sfxtdμt=fx+a0gx+b0, xS,
and
(4.14)
Sgxtdμt=c0gx+d0, xS,
where a0 := b1 + b2 S g(t)(t), b0 := S f(t)(t) + b1 S g(t)(t) + a1, c0 := (b4 + 1) S g(t)(t) + b2 and d0 := b2 S g(t)(t) + b1. Now, by using the relations (4.13) and (4.14) in (2.6) we get
(4.15)
fxy+rgxy+q=fx+fy+gxgy, x, yS,
where r := a0 + c0 and q = b0 + d0.

First case: r = 0. In this case (4.15) becomes

(4.16)
fxy+q=fx+fy+gxgy, x, yS.

Equation (4.16) shows that the Cauchy difference Cf has the form

Cfx, y=gxgyq,x, yS.

Using again the cocycle equation (3.1) leads to

gzgxygy=gxgyzgy, x, y, zS.

Since g ≠ 0, we deduce that

(4.17)
gxy=gxφy+gy, x, yS,
where φ(y) := (g(s0))−1 [g(ys0) − g(y)], for some s0S 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, yS. Using the centrality of g, (4.17) shows that

gxφy1=gyφx1,x, yS.

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

fxyq=fxq+fyq+AxAy,x, yS.

Then from [4, Theorem 4.1] we have f=B+12A2+q, where B is an additive function. Since the pair (f, g) satisfies (2.6), by taking x = y we have the following relation

(4.18)
2SAtdμt+1Ax=qSAtdμt12SA2tdμtSBtdμt, xS.

Recall that g is a nonconstant function. So, from (4.18) we deduce that S A(t)(t) = −1 and q=SBtdμt+12SA2tdμt1. This proves (b).

If φ ≠ 1, then

(4.19)
gx=cφx1, xS,
where c ∈ ℂ \ {0}. Inserting (4.19) into (4.16), we deduce that fc2 (φ − 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) yields
(4.20)
cSφtdμt+cSφtdμtcφxφy=qSAtdμt+c,x, yS.

From (4.19) we deduce that φ can not be constant. So (4.20) shows that S φ(t)(t) + c ∫S φ(t)(t) − c = 0 and qS A(t)(t) + c = 0. Then f(x) = A(x)+ S A(t)(t)+c2 (φ − 1)−c, xS and Sφtdμt=cc+1. This proves (c).

Second case: r ≠ 0. From equation (4.15) one can easily verify that F := r−2 (fq) 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) g=rχ+α2α2+1 and f=r2Aα2(α2+1)2χ1+q, where α ∈ ℂ \ {i,i}, A is additive and χ is multiplicative.

  • (ii) g = r (A + 1) and f=r2B+12A2+q, 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

(4.21)
fxyq=fxq+fyq,x, yS,
and
(4.22)
r1gxy=r1gxr1gy,x, yS,
respectively.

From (4.21) and (4.22) we deduce that

(4.23)
Sfxytdμt=fx+fy+Sftdμt2q,x, yS
and
(4.24)
Sgxytdμt=r2gxgySgtdμt,x, yS.

Now, by inserting (4.23) and (4.24) into (2.6), we see that

r2Sgtdμt1gxgy=2qSftdμt, x, yS.

Since g is not constant, the last identity implies that r−2 S g(t)(t) = 1 and 2qS f(t)(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 c:=1α2+1, f and g can be written as f = r2 [Ac(1 − c)(χ − 1)] + q and g = r [ + (1 − c)] respectively. Putting this back into (2.6), one gets

(4.25)
rc1r1cSχtdμtrcχxχy =qr2SAtdμtr1r1c,x, yS.

As χ is not constant, (4.25) implies that 1 − r(1 − c) ≠ 0 and (1 − r(1 − c)) S χ(t)(t)−rc = 0. Consequently we have r11c, Sχtdμt=rc1r1c and qr2 S A(t)(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

(4.26)
2rrSAtdμt+1rAx=qr+r2r22SA2tdμtrSAtdμtr2SBtdμt,xS.

Since A is not constant, we deduce from (4.26) that r ∫SA(t)(t)+1−r = 0. Consequently we have SAtdμt=r1r and q=r22SA2tdμt+r2SBtdμt(r1)2. This proves case (f).

Theorem 4.3

Let S be a semigroup and μ is a linear combination of Dirac measures (δzi)iI for some fixed elements (zi)iI contained in S such that ∫S = 1. If functions f : S → ℂ and g : S → ℂ are not quadratically equivalent then they satisfy the equation

Sfxytdμt+Sgxytdμt=fx+fy+gxgy,x,yS,
if and only if f and g solve the system
Sfxytdμt=fx+fy ,Sgxytdμt=gxgy,x, yS.

Proof

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 Δy3f+g=0, which contradicts our hypothesis about f and g. In the case when (f, g) has the form (c) we obtain Δy3fcg=0 and when (f, g) has the form (e) we have Δy3f+r0α2α2+1g=0. 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.

DOI: https://doi.org/10.2478/amsil-2024-0022 | Journal eISSN: 2391-4238 (formerly 0860-2107) | Journal ISSN: 0860-2107
Language: English
Page range: 27 - 41
Submitted on: May 18, 2024
Accepted on: Oct 23, 2024
Published on: Nov 15, 2024
Published by: University of Silesia in Katowice, Institute of Mathematics
In partnership with: Paradigm Publishing Services

© 2024 Mohamed Chakiri, Abdellatif Chahbi, Elhoucien Elqorachi, published by University of Silesia in Katowice, Institute of Mathematics
This work is licensed under the Creative Commons Attribution 4.0 License.