1. Introduction
The addition law for cosine is
This gives the origin of the following functional equation on any semigroup S: for the unknown functions f, g : S → ℂ, which is called the cosine addition law. In Aczél’s monograph [1, Section 3.2.3] we find continuous real valued solutions of (1.1) in case S = ℝ.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
where α is a fixed constant in ℂ. He expressed the solutions in terms of multiplicative functions and the solution of the special case of the sine addition law. In [13, Proposition 16], he solved the functional equation on semigroups, and where z0 is a fixed element in S. We shall use these results in our computations.In this paper, we deal with the following Kannappan-cosine addition law
on a semigroup S. The functional equation (1.4) is called Kannappan functional equation because it brings up a fixed element z0 in S as in the paper of Kannappan [9].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 satisfies the following functional equation
which is of the form (1.2), and then explicit formulas for f and g on groups exist in the literature (see for example [8, Corollary 3.2.]).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.
2. Set up, notations and terminology
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 . For more details about Pχ we refer the reader to [4], [5] and [6].
3. Preliminaries
In this section, we give useful results to solve the functional equation (1.4).
Lemma 3.1.
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
Proposition 3.2.
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
where A : S\ Iχ → ℂ is additive and ρ : Pχ → ℂ is the restriction of f to Pχ. In addition, f is abelian and satisfies the following conditions:(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χ).
Proof
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.
Lemma 3.3.
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,
(2) .
(3) If f and g are linearly independent then g(z0) ≠ 0.
(ii) If f (z0) ≠ 0, then there exists µ ∈ ℂ such that
Proof
(i) Suppose that f (z0) = 0.
(1) Making the substitutions and (xyz0, z0) in (1.4) we get and = 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 that = g(z0)g(x)g(y)−g(z0)f (y)f (x). This proves the desired identity.
(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 that
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.
(ii) Suppose that f (z0) ≠ 0. By the substitutions and (xyz0, z0) in (1.4) we get = − = g(z0)g(x)g(y) − g(x)f(z0)f(y) − and = 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 obtain
Since f (z0) ≠ 0, dividing (3.6) by f (z0) we get where . 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.
4. Main results
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.,
where χ : S → ℂ is a non-zero multiplicative function, A : S \ Iχ → ℂ is additive, ρ : Pχ → ℂ is the restriction of ΨAχ,ρ, and the following conditions hold.(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.
Theorem 4.1.
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.(3) There exist a constant d ∈ ℂ \ {±1} and a multiplicative function χ on S with χ(z0) ≠ 0, such that
(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
(5) There exist constants q, γ ∈ ℂ* and two different non-zero multiplicative functions χ1 and χ2 on S, with
and such that(6) There exist constants q ∈ ℂ \ {±α}, γ ∈ ℂ* \ {±α} and δ ∈ ℂ \ {±1}, and two different non-zero multiplicative functions χ1 and χ2 on S, with
and such that(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
(8) There exist a multiplicative function χ on S with χ(z0) ≠ 0, an additive function A : S \ Iχ → ℂ and a function ρ : Pχ → ℂ such that
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).
Proof
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 and , so we have the solution family (3).
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
respectively.Subcase I.1. Assume that . Then by Lemma 3.3 (i)-(2) and (i)-(3), we get since f and g are linearly independent and then (4.1) can be rewritten as f (xy) = γf (x)f (y) − γg(x)g(y), x, y ∈ S, where . Consequently, the pair (γf, γg) satisfies the cosine addition formula (1.1). So, according to [12, Theorem 6.1] and taking into account that f and g are linearly independent, we know that there are only the following possibilities.
(I.1.i) There exist a constant q ∈ ℂ* and two different non-zero multiplicative functions χ1 and χ2 on S such that and , which gives and . By putting and using (1.4) we get
which implies by Lemma 3.1 (i) that and , since χ1 and χ2 are different and non-zero. Then we deduce that So, we are in part (5).(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 , which implies that A(z0) = −1. Now for all x, y ∈ S \ Iχ, we have xyz0 ∈ S \ Iχ, then by using (1.4) we get , which implies according to Lemma 3.1(i), that and , since A ≠ 0. Therefore, , which is a contradiction because by the assumption. So we do not have a solution corresponding to this possibility.
Subcase I.2. Suppose that , then (4.1) can be rewritten as follows βg(xy) = β2g(x)g(y) − β2f (x)f (y) + αβf (xy), x, y ∈ S with and . This shows that the pair (βg, βf) satisfies the functional equation (1.2). So, according to [12, Theorem 3.1], and taking into account that f and g are linearly independent, there are only the following possibilities.
(I.2.i) There exist a constant q ∈ ℂ\{±α} and two different non-zero multiplicative functions χ1 and χ2 on S such that and . Introducing we find that and . By using (1.4), we get
So, by Lemma 3.1(i) we obtain and , since χ1 and χ2 are different non-zero multiplicative functions. Notice that δ ≠ ±1 because q ≠ ±α. Therefore we deduce that and . Hence, by writing γ instead of β we get part (6).(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 , which gives and α = 0, since χ1 and χ2 are different. This possibility is excluded because α ≠ 0.
(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 and .
If then z0 ∉ Iχ \ Pχ. Indeed, otherwise we have χ(z0) = 0 and ΨAχ,ρ(z0) = 0. Then βg(z0) = χ(z0) + ΨAχ,ρ(z0) = 0. This contradicts the fact that g(z0) ≠ 0.
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 , which implies that A(z) = − α. Now, let x, y ∈ S \ Iχ be arbitrary. We have xyz0 ∈ S \ Iχ. By using (1.4), we get
If A = 0 then ρ ≠ 0 because ΨAχ,ρ ≠ 0, α = 0, and by (4.2). This is a special case of solution part (7).
If A ≠ 0 then by Lemma 3.1 (ii) we get from (4.2) that
As α ≠ 1, because χ(z0) ≠ 0, we deduce that and . So, we obtain that α = 0 and , and the form of f reduces to . So we are in part (7).If , by using a similar computation as above, we show that we are also in part (7).
Case II. Suppose f (z0) ≠ 0. By using system (1.4) and (3.4), we deduce by an elementary computation that for any λ ∈ ℂ
Let λ1 and λ2 be the two roots of the equation λ2 +µλ+1 = 0. Then λ1λ2 = 1 which gives λ1 ≠ 0 and λ2 ≠ 0. According to [13, Proposition 16] we deduce from (4.3) that g−λ1f := χ1(z0)χ1 and g−λ2f := χ2(z0)χ2, where χ1 and χ2 are two multiplicative functions such that χ1(z0) ≠ 0 and χ2(z0) ≠ 0, because f and g are linearly independent.If λ1 ≠ λ2, then χ1 ≠ χ2 and we get and . By putting λ1 = ic, we get the solution of category (4).
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,
Substituting this in (3.4), an elementary computation shows that for all x, y ∈ S.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
for all x, y ∈ S. Thus, the function f satisfies (3.1). Hence, in view of Proposition 3.2, we get f = A(z0)χ + ΨAχ,ρ. Then, by (4.4), we derive that g = χ(z0)χ + λ f = (χ(z0) + λ A(z0))χ + λ2ΨAχ,ρ = (χ(z0) ± A(z0))χ + ΨAχ,ρ. This is part (8).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.