The addition law for cosine is
The functional equation (1.1) has been solved on groups by Poulsen and Stetkær [10], on semigroups generated by their squares by Ajebbar and Elqorachi [3], and recently by Ebanks [5] on semigroups.
In [12, Theorem 3.1], Stetkær solved the following functional equation
In this paper, we deal with the following Kannappan-cosine addition law
In the special case, where {f, g} is linearly dependent and g ≠ 0, we get that there exists a constant λ ∈ ℂ such that the function (1 − λ2)g satisfies the functional equation (1.3).
If S is a monoid with an identity element e, and f (e) = 0 and g(e) ≠ 0, or g(e) = 0 and f (e) ≠ 0, the last functional equation is the cosine addition law which was solved recently on general semigroups by Ebanks [5].
Now, if α := f (e) ≠ 0 and β := g(e) ≠ 0 we get that the pair
The natural general setting of the functional equation (1.4) is for S being a semigroup, because the formulation of (1.4) requires only an associative composition in S, not an identity element and inverses. Thus we study in the present paper Kannappan-cosine functional equation (1.4) on semigroups S, generalizing previous works in which S is a group. So, the result of the present paper is a natural continuation of results contained in the literature.
The purpose of the present paper is to show how the relations between (1.4) and (1.2)–(1.3) on monoids extend to much wider framework, in which S is a semigroup. We find explicit formulas for the solutions, expressing them in terms of homomorphisms and additive maps from a semigroup into ℂ (Theorem 4.1). The continuous solutions on topological semigroups are also found.
Throughout this paper, S is a semigroup (a set with an associative composition) and z0 is a fixed element in S. If S is topological, we denote by 𝒞(S) the algebra of continuous functions from S to the field of complex numbers ℂ.
Let f : S → ℂ be a function. We say that f is central if f (xy) = f (yx) for all x, y ∈ S, and that f is abelian if f (x1x2, . . . , xn) = f (xσ(1)xσ(2), . . . , xσ(n)) for all x1, x2, . . . , xn ∈ S, all permutations σ of n elements and all n ∈ ℕ. A map A : S → ℂ is said to be additive if A(xy) = A(x) + A(y), for all x, y ∈ S and a map χ : S → ℂ is multiplicative if χ(xy) = χ(x)χ(y), for all x, y ∈ S. If χ ≠ 0, then the nullspace Iχ := {x ∈ S | χ(x) = 0} is either empty or a proper subset of S and Iχ is a two sided ideal in S if not empty and S \ Iχ is a subsemigroup of S. Note that additive and multiplicative functions are abelian.
For any subset T ⊆ S let T2 := {xy | x, y ∈ T } and for any fixed element z0 in S we let T2z0 := {xyz0 | x, y ∈ T}.
To express solutions of our functional equations studied in this paper we will use the set
In this section, we give useful results to solve the functional equation (1.4).
Let S be a semigroup, n ∈ ℕ, and χ, χ1, χ2, . . . , χn : S → ℂ be different non-zero multiplicative functions. Then
- (a)
{χ1, χ2, · · ·, χn} is linearly independent.
- (b)
If A : S \ Iχ → ℂ is a non-zero additive function, then the set {χA, χ} is linearly independent on S \ Iχ.
The proposition below gives the solutions of the functional equation
Let S be a semigroup, and χ : S → ℂ be a multiplicative function such that χ(z0) ≠ 0. If f : S → ℂ is a solution of (3.1), then
- (I)
f (xy) = f (yx) = 0 for all x ∈ Iχ \ Pχ and y ∈ S \ Iχ.
- (II)
If x ∈ {up, pv, upv} with p ∈ Pχ and u, v ∈ S \ Iχ, then x ∈ Pχ and we have respectively ρ(x) = ρ(p)χ(u), ρ(x) = ρ(p)χ(v) or ρ(x) = ρ(p)χ(uv).
Conversely, the function f of the form (3.2) define a solution of (3.1). Moreover, if S is a topological semigroup and f ∈ 𝒞(S), then χ ∈ 𝒞(S), A ∈ 𝒞(S \ Iχ) and ρ ∈ 𝒞(Pχ).
See [7, Proposition 4.3].
To shorten the way to finding the solutions of functional equation (1.4), we prove the following lemma that contains some key properties.
Let S be a semigroup and let f, g : S → ℂ be the solutions of the functional equation (1.4) with g ≠ 0. Then
- (i)
If f (z0) = 0 then
- (1)
for all x, y ∈ S,
(3.3) g\left( {z_0^2} \right)g\left( {xy} \right) = g\left( {{z_0}} \right)\left[ {g\left( x \right)g\left( y \right) - f\left( x \right)f\left( y \right)} \right] + f\left( {z_0^2} \right)f\left( {xy} \right), - (2)
.g{(z_0^2)^2} = g{({z_0})^3} + f{(z_0^2)^2} - (3)
If f and g are linearly independent then g(z0) ≠ 0.
- (1)
- (ii)
If f (z0) ≠ 0, then there exists µ ∈ ℂ such that
(3.4) f\left( {xy{z_0}} \right) = f\left( x \right)g\left( y \right) + f\left( y \right)g\left( x \right) + \mu f\left( x \right)f\left( y \right),\;\;\;\;x,\;y \in S.
- (i)
Suppose that f (z0) = 0.
- (1)
Making the substitutions
and (xyz0, z0) in (1.4) we get\left( {xy,z_0^2} \right) andg\left( {xyz_0^3} \right) = g\left( {xy} \right)g\left( {z_0^2} \right) - f\left( {xy} \right)f\left( {z_0^2} \right) = g(xyz0)g(z0)−f (xyz0)f (z0) = g(z0)g(x)g(y) − g(z0)f (x)f (y), respectively. Comparing these expressions, we deduce thatg\left( {xyz_0^3} \right) = g(z0)g(x)g(y)−g(z0)f (y)f (x). This proves the desired identity.g\left( {xy} \right)g\left( {z_0^2} \right) - f\left( {z_0^2} \right)f\left( {xy} \right) - (2)
It follows directly by putting x = y = z0 in the equation (3.3).
- (3)
For a contradiction we suppose that g(z0) = 0. Then using (1.4), we get
= g(x)g(yz0) − f (x)f (yz0) = g(xy)g(z0) − f (xy)f (z0) = 0 since f (z0) = g(z0) = 0. Then we deduce thatg\left( {xyz_0^2} \right) (3.5) g\left( x \right)g\left( {y{z_0}} \right) = f\left( x \right)f\left( {y{z_0}} \right),\;\;\;\;x,\;y \in S.
If g(yz0) = 0 for all y ∈ S then 0 = g(xyz0) = g(x)g(y) − f (x)f (y), x, y ∈ S. So, g(x)g(y) = f (x)f (y), x, y ∈ S. Hence, f = g or f = − g, which contradicts the fact that f and g are linearly independent. So g ≠ 0 on Sz0, and from (3.5) we get that g = c1f with c1 := f (az0)/g(az0) for some a ∈ S such that g(az0) ≠ 0. This is also a contradiction, since f and g are linearly independent. So we conclude that g(z0) ≠ 0.
- (1)
- (ii)
Suppose that f (z0) ≠ 0. By the substitutions
and (xyz0, z0) in (1.4) we get\left( {x,yz_0^2} \right) =g\left( {xyz_0^3} \right) −g\left( x \right)g\left( {yz_0^2} \right) = g(z0)g(x)g(y) − g(x)f(z0)f(y) −f\left( x \right)f\left( {yz_0^2} \right) andf\left( x \right)f\left( {yz_0^2} \right) = g(xyz0)g(z0) − f (xyz0)f (z0) = g(z0)g(x)g(y) − g(z0)f (x)f (y) − f (xyz0)f (z0), respectively. Then, by the associativity of the operation in S we obtaing\left( {xyz_0^3} \right) (3.6) Since f (z0) ≠ 0, dividing (3.6) by f (z0) we get\matrix{ {f\left( {{z_0}} \right)\left[ {f\left( {xy{z_0}} \right) - f\left( x \right)g\left( y \right) - f\left( y \right)g\left( x \right)} \right]} \hfill \cr {\;\;\;\;\;\;\;\;\;\;\;\;\;\;\;\;\;\;\;\;\;\;\;\;\;\;\;\;\;\;\;\;\;\;\;\;\;\;\;\;\;\;\; = f\left( x \right)\left[ {f\left( {yz_0^2} \right) - f\left( y \right)g\left( {{z_0}} \right) - f\left( {{z_0}} \right)g\left( y \right)} \right].} \hfill \cr } (3.7) wheref\left( {xy{z_0}} \right) = f\left( x \right)g\left( y \right) + f\left( y \right)g\left( x \right) + f\left( x \right)\psi \left( y \right), . Substituting (3.7) back into (3.6), we find out that f (z0)f (x)ψ(y) = f (x)f (y)ψ(z0), which implies that ψ(y) = µf (y) with µ := ψ(z0)/f (z0). Therefore, (3.7) becomes f (xyz0) = f (x)g(y) + f (y)g(x) + µf (x)f (y). This completes the proof of Lemma 3.3.\psi \left( y \right): = f{({z_0})^{ - 1}}\left[ {f\left( {yz_0^2} \right) - f\left( y \right)g\left( {{z_0}} \right) - f\left( {{z_0}} \right)g\left( y \right)} \right]
Now, we are ready to describe the solutions of the functional equation (1.4).
Let ΨAχ,ρ : S → ℂ denote the function of the form in [6, Theorem 3.1 (B)], i.e.,
- (i)
ΨAχ,ρ(qt) = ΨAχ,ρ(tq) = 0 for all q ∈ Iχ and t ∈ S \ Iχ.
- (ii)
If x ∈ {up, pv, upv} for p ∈ Pχ and u, v ∈ S\Iχ, then x ∈ Pχ and we have ρ(x) = ρ(p)χ(u), ρ(x) = ρ(p)χ(v), or ρ(x) = ρ(p)χ(uv), respectively.
The solutions f, g : S → ℂ of the functional equation (1.4) are the following pairs of functions.
- (1)
f = g = 0.
- (2)
S ≠ S2z0 and we have
where gz0 : S \ S2z0 → ℂ is an arbitrary non-zero function.f = \pm g\;\;\;and\;\;\;g\left( x \right) = \left\{ {\matrix{ {{g_{{z_0}}}\left( x \right)} \hfill & {for\;x \in S\backslash {S^2}{z_0},} \hfill \cr 0 \hfill & {forx \in {S^2}{z_0},} \hfill \cr } } \right. - (3)
There exist a constant d ∈ ℂ \ {±1} and a multiplicative function χ on S with χ(z0) ≠ 0, such that
f = {{d\chi \left( {{z_0}} \right)} \over {1 - {d^2}}}\chi \;\;\;and\;\;\;g = {{\chi \left( {{z_0}} \right)} \over {1 - {d^2}}}\chi . - (4)
There exist a constant c ∈ ℂ* \ {±i} and two different multiplicative functions χ1 and χ2 on S, with χ1(z0) ≠ 0 and χ2(z0) ≠ 0 such that
f = - {{{\chi _1}\left( {{z_0}} \right){\chi _1} - {\chi _2}\left( {{z_0}} \right){\chi _2}} \over {i\left( {{c^{ - 1}} + c} \right)}}\;\;\;and\;\;\;g = {{{c^{ - 1}}{\chi _1}\left( {{z_0}} \right){\chi _1} + c{\chi _2}\left( {{z_0}} \right){\chi _2}} \over {{c^{ - 1}} + c}}. - (5)
There exist constants q, γ ∈ ℂ* and two different non-zero multiplicative functions χ1 and χ2 on S, with
and{\chi _1}\left( {{z_0}} \right) = {{{q^2} - {{(1 + \xi )}^2}} \over {2\gamma q}},\;\;\;{\chi _2}\left( {{z_0}} \right) = - {{{q^2} - {{(1 - \xi )}^2}} \over {2\gamma q}}, such that\xi : = \pm \sqrt {1 + {q^2}} f = {{{\chi _1} + {\chi _2}} \over {2\gamma }} + \xi {{{\chi _1} - {\chi _2}} \over {2\gamma }}\;\;\;and\;\;\;g = q{{{\chi _1} - {\chi _2}} \over {2\gamma }}. - (6)
There exist constants q ∈ ℂ \ {±α}, γ ∈ ℂ* \ {±α} and δ ∈ ℂ \ {±1}, and two different non-zero multiplicative functions χ1 and χ2 on S, with
and{\chi _1}\left( {{z_0}} \right) = {{{{(1 + \delta )}^2} - {{(\alpha + q)}^2}} \over {2\gamma \left( {1 + \delta } \right)}},\;\;\;\;{\chi _2}\left( {{z_0}} \right) = {{{{(1 - \delta )}^2} - {{(\alpha - q)}^2}} \over {2\gamma \left( {1 - \delta } \right)}}, such that\delta : = \pm \sqrt {1 + {q^2} - {\alpha ^2}} f = \alpha {{{\chi _1} + {\chi _2}} \over {2\gamma }} + q{{{\chi _1} - {\chi _2}} \over {2\gamma }}\;\;\;and\;\;\;g = {{{\chi _1} + {\chi _2}} \over {2\gamma }} + \delta {{{\chi _1} - {\chi _2}} \over {2\gamma }}. - (7)
There exist a constant β ∈ ℂ*, a non-zero multiplicative function χ on S, an additive function A : S \ Iχ → ℂ and a function ρ : Pχ → ℂ with χ(z0) = 1/β and A(z0) = 0 such that
f = {1 \over \beta }{\Psi _{A\chi ,\rho }}\;\;\;and\;\;\;g = {1 \over \beta }\left( {\chi \pm {\Psi _{A\chi ,\rho }}} \right). - (8)
There exist a multiplicative function χ on S with χ(z0) ≠ 0, an additive function A : S \ Iχ → ℂ and a function ρ : Pχ → ℂ such that
f = A\left( {{z_0}} \right)\chi + {\Psi _{A\chi ,\rho }}\;\;\;and\;\;\;g = \left( {\chi \left( {{z_0}} \right) \pm A\left( {{z_0}} \right)} \right)\chi + {\Psi _{A\chi ,\rho }}.
Moreover, if S is a topological semigroup and f ∈ 𝒞(S) then g ∈ 𝒞(S) in cases (1), (2), (4)–(8), and if d ≠ 0 then also in (3).
If g = 0, then (1.4) reduces to f (x)f (y) = 0 for all x, y ∈ S. This implies that f = 0, so we get the first part of solutions. From now we may assume that g ≠ 0.
If f and g are linearly dependent, then there exists d ∈ ℂ such that f = dg. Substituting this into (1.4) we get the following functional equation
If d2 = 1, then g(xyz0) = 0 for all x, y ∈ S. Therefore, S ≠ S2z0 because g ≠ 0. So, we are in solution family (2) with gz0 an arbitrary non-zero function.
If d2 ≠ 1, then by [13, Proposition 16] there exists a multiplicative function χ on S such that χ(z0)χ := (1 − d2)g and χ(z0) ≠ 0. Then we deduce that
For the rest of the proof, we assume that f and g are linearly independent. We split the proof into two cases according to whether f (z0) = 0 or f (z0) ≠ 0.
Case I. Suppose f (z0) = 0. Then by Lemma 3.3 (i)-(3) and (i)-(1), we have g(z0) ≠ 0 and
Subcase I.1. Assume that
(I.1.i) There exist a constant q ∈ ℂ* and two different non-zero multiplicative functions χ1 and χ2 on S such that
(I.1.ii) There exist a non-zero multiplicative function χ on S, an additive function A on S \ Iχ and a function ρ on Pχ such that γg = ΨAχ,ρ and γf = χ ± ΨAχ,ρ.
If z0 ∈ Iχ \ Pχ we have γg(z0) = ΨAχ,ρ(z0) = 0 by definition of ΨAχ,ρ. If z0 ∈ Pχ we have χ(z0) = 0 and |γg(z0)|=|ρ(z0)|=|χ(z0) ± ρ(z0)|=|γf (z0)|= 0. So, if z0 ∈ Iχ we get that γg(z0) = 0, which is a contradiction because g(z0) ≠ 0 and
Hence, z0 ∈ S \ Iχ and we have χ(z0) ≠ 0. Since f (z0) = 0, by the assumption, we get
Subcase I.2. Suppose that
(I.2.i) There exist a constant q ∈ ℂ\{±α} and two different non-zero multiplicative functions χ1 and χ2 on S such that
(I.2.ii) α ≠ 0 and there exist two different non-zero multiplicative functions χ1 and χ2 on S such that βf = αχ1 and βg = χ2. By using (1.4) again we get
(I.2.iii) There exist a non-zero multiplicative function χ on S, an additive function A on S \ Iχ and a function ρ on Pχ such that βf = αχ + ΨAχ,ρ and βg = χ ± ΨAχ,ρ, which gives
If
On the other hand z0 ∉ Pχ. Indeed, otherwise we have χ(z0) = 0. Then βg(z0) = ΨAχ,ρ(z0) = βf (z0) = 0, which is a contradiction because g(z0) ≠ 0. So, z0 ∈ S \ Iχ and then χ(z0) ≠ 0. Since f (z0) = 0 we get that
If A = 0 then ρ ≠ 0 because ΨAχ,ρ ≠ 0, α = 0, and
If A ≠ 0 then by Lemma 3.1 (ii) we get from (4.2) that
If
Case II. Suppose f (z0) ≠ 0. By using system (1.4) and (3.4), we deduce by an elementary computation that for any λ ∈ ℂ
If λ1 ≠ λ2, then χ1 ≠ χ2 and we get
If λ1 = λ2 =: λ, then g − λf =: χ(z0)χ where χ is a multiplicative function on S such that χ(z0) ≠ 0, because f and g are linearly independent. Hence,
Moreover λ = 1 or λ = −1 because λ1λ2 = 1. Hence, (λ, µ) = (1, −2) or (λ, µ) = (−1, 2) since λ2 + µλ + 1 = 0 and λ ∈ {−1, 1}. So, the functional equation above reduces to
Conversely, it is easy to check that the formulas for f and g listed in Theorem 4.1 define solutions of (1.4).
Finally, suppose that S is a topological semigroup. The continuity of the solutions of the forms (1)–(6) follows directly from [11, Theorem 3.18], and for the ones of the forms (7) and (8) it is parallel to the proof used in [5, Theorem 2.1] for categories (7) and (8). This completes the proof of Theorem 4.1.