Extensions of the Cosine-Sine functional equation
Omar Ajebbar, Elhoucien Elqorachi

TL;DR
This paper explores new extensions of the cosine-sine functional equation, aiming to broaden its applicability and deepen understanding of its mathematical properties.
Contribution
It introduces novel extensions of the cosine-sine functional equation, expanding the theoretical framework and potential applications.
Findings
Extended the functional equation to new forms
Provided proofs for the generalized equations
Discussed implications for mathematical analysis
Abstract
The aim of the present paper is to give extensions of the cosine-sine functional equation.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsFunctional Equations Stability Results
Extensions of the Cosine-Sine functional equation
Omar Ajebbar
Omar Ajebbar
Department of Mathematics
Ibn Zohr University, Faculty of Sciences, Agadir
Morocco
and
Elhoucien Elqorachi
Elhoucien Elqorachi
Department of Mathematics
Ibn Zohr University, Faculty of Sciences, Agadir
Morocco
Abstract.
The aim of the present paper is to give extensions of the cosine-sine functional equation.
Key words and phrases:
Functional equation; Cosine-Sine functional equation; Levi-Civita; Monoid; Group; Additive function; Multiplicative function; Character.
2010 Mathematics Subject Classification. Primary 39B52; Secondary 39B32
1. Introduction
1.1. Connection to the literature
In the present paper we solve the following functional equations:
[TABLE]
on a group , where is the average of two different characters and of and is a character of such that and ;
[TABLE]
where are distinct characters of a group ;
[TABLE]
where is the average of two given nonzero multiplicative functions and on a monoid and is an additive function on such that ;
[TABLE]
where and are two different characters of a group and is a nonzero additive function on . To solve the functional equations (1.1), (1.2), (1.3) and (1.4) we will need to solve respectively the corresponding functional equations
[TABLE]
[TABLE]
[TABLE]
and
[TABLE]
We notice that (1.1), (1.2), (1.3), (1.4), (1.5), (1.6), (1.7) and (1.8) are examples of Levi-Civita’s functional equation
[TABLE]
on which lots of work has been done. Székelyhidi [12, Section 10] computes for any abelian group the solution of
[TABLE]
under the assumption that each of the sets and is linearly independent. The structure of any solution of Levi-Civita’s functional equation on monoids was described by using matrix-coefficients of the right regular representations [10, Theorem 5.2]. In [3, pp . 25-27] Vincze’s equation, which is a particular case of our functional equations, was solved. We refer also to [1, 8, 9, 13].
If then the functional equations (1.1) and (1.3) become
[TABLE]
which was recently solved by Ebanks [6], Stetkær [11], and Ebanks and Stetkær [7].
If , and then Eq. (1.1) and (1.3) reduce to the sine addition law
[TABLE]
for which solutions are known on semigroups, see for example [10, Theorem 4.1].
Chung, Kannappan and Ng [5] solved the functional equation
[TABLE]
where is a group. Recently, the results of [5] were extended by the authors [2] to semigroups generated by their squares.
We relate the solutions of the functional equations (1.1), (1.5), (1.2), (1.6), (1.4) and (1.8) to those of a functional equation of type
[TABLE]
where and are two characters of , which was solved by Stetkær [11].
1.2. Motivation
In [6] Ebanks solved the functional equation
[TABLE]
for four unknown central functions on certain semigroups , where is a fixed multiplicative function on .
In [11] Stetkær solved, by removing the restriction of the solutions, the functional equation
[TABLE]
and its Pexiderized version
[TABLE]
on a group , where and are fixed characters of .
In [7] Ebanks and Stetkær studied the more general variant of (1.10)
[TABLE]
for four unknown on a monoid, where is a linear combination of distinct multiplicative functions.
Recently Belfakih and Elqorachi [4, Theorem 2.7] solved the functional equation
[TABLE]
on a monoid , where are linear combinations of at least distinct nonzero multiplicative functions on , and are the unknown functions.
Let be a group. Let and be two different characters of and let be a non zero additive function. Let be two constants satisfying . We check by elementary computations that the functions defined by , and satisfy the functional equation
[TABLE]
on the group , which implies, by simple computations, that the triple is a solution of the functional equation
[TABLE]
for all , where and because . Moreover, for a given character of , we check easily that the quadruple satisfies the functional equation
[TABLE]
while the functions , , , and satisfy the functional equation
[TABLE]
with , , and .
The papers cited above motivate us to deal with the functional equations (1.1), (1.2), (1.3), (1.4), (1.5), (1.6), (1.7) and (1.8), which are not covered by the cited works.
1.3. About our results
In the present paper we solve the functional equations (1.1), (1.2), (1.3), (1.4), (1.5), (1.6), (1.7) and (1.8), which are not in the literature. We express the solutions of the functional equations (1.1), (1.2), (1.3) and (1.4) respectively in term of the solutions of (1.5), (1.6), (1.7) and (1.8). We relate some categories of solutions to the solutions of the functional equation where and are two characters of the group , which was recently solved by Stetkær [11]. Our results are extensions of those of [11] and [7].
There is no connection between the functional equations (1.1), (1.2), (1.3) and (1.4) nor between (1.5), (1.6), (1.7) and (1.8), but the reasonings for the functional equations with additive function , i.e. (1.3), (1.4), (1.7) and (1.8) are similar to those for the functional equations that not contain the additive function, i.e. (1.1), (1.2), (1.5), (1.6). This is due to fact that the resolution of this functional equations
(1) make use the linear independence between some unknown functions and the given arguments in equations, namely multiplicative functions, additive function or characters.
(2) relate some of them to the functional equation , where and are two characters of the group .
The organization of the paper is as follows. In the next section we give some definitions and notations. In the third section we give preliminary results that we need in the paper. In sections 4, 5, 6 and 7 we prove our main results and give some examples.
Our methods are elementary algebraic manipulations (no analysis or geometry come into play).
2. Set Up and Terminology
Definition 2.1**.**
Let be a function on a semigroup . We say that
is central if for all .
is additive if for all .
is multiplicative if for all .
If is a group, then we say that is a character of if is a homomorphism of into , where denotes the multiplicative group of nonzero complex numbers.
If is a group, then denotes the commutator of , i.e., the subgroup of generated by the set of commutators .
If and are two characters of a group , we denote by a solution of the functional equation
[TABLE]
Blanket assumption: Throughout this paper denotes a group or a monoid with identity element .
3. Preliminaries
In this section we give the essential tools that we will need in the paper.
Proposition 3.1**.**
[10*, Theorem 3.18(a)]** Let be a semigroup and . Let be different multiplicative functions and let .
If , then , in particular, any set of non zero multiplicative functions is linearly independent.*
Lemma 3.2**.**
[2, pp. 1122-1123]** Let be an additive function and be a multiplicative function on a semigroup .
If , where and is multiplicative for each , then .
Let and be characters of . The following result, which is taken from [11, Proposition 4, Theorem 11], solves the functional equation
[TABLE]
Theorem 3.3**.**
[11*, p.5, pp .8-9]** Let be a group.
(1) If then the solutions of (3.1) are the functions where is an additive function on .
(2) If then the solutions of (3.1) are the functions*
[TABLE]
where such that , ranges over and ranges over the additive functions on with the transformation property
[TABLE]
Remark 3.4**.**
According to [11, Proposition 4], if the central solutions of (3.1) are the functions where ranges over .
Lemma 3.5**.**
*Let be a group. Let be a solution of the functional equation (1.1).
(1) If then , and is arbitrary, where is a constant.
(2) If and the set is linearly dependent then the set is also linearly dependent.*
Proof.
(1) Assume that . Then is arbitrary. By putting in (1.1), we get that where and . Substituting this back into (1.1) we obtain
[TABLE]
for all . Since the characters , and are different the set is linearly independent. Then we get, from the identity above, that and . So that because . Hence, and .
(2) Assume that and is linearly dependent. Since the set is linearly independent there exist such that . So that
[TABLE]
for all , from which we get, taking (1.1) into account, that
[TABLE]
for all . As we deduce from the identity above, by choosing such that , that the set is linearly dependent. ∎
Proposition 3.6**.**
*Let be a monoid. For the solutions of the functional equation (1.3) can be listed as follows
(1) arbitrary and ;
(2) , arbitrary, and , where and range over .*
Proof.
(1) Assume that . Then is arbitrary. Let be arbitrary. Since the functional equation (1.3) implies
[TABLE]
for all . So, the set being linearly independent, and arbitrary, we deduce that .
(2) Assume that . Taking in (1.3) and seeing that and we get that for all . So that
[TABLE]
where . Substituting (3.3) back into (1.3) we get that
[TABLE]
for all . Choosing such that we deduce from the last functional equation that
[TABLE]
where .
Substituting (3.3) and (3.3) back into (1.3) we get that
[TABLE]
for all . Since we derive that
[TABLE]
Conversely, it is easy to check that the formulas of (1) and (2) define solutions of (1.3) for . ∎
Proposition 3.7**.**
*Let be a group and let be a constant. For the solutions of the functional equation (1.4) can be listed as follows
(1) arbitrary, , and ;
(2) , arbitrary, and , where and range over .*
Proof.
By proceeding as in the proof of Proposition 3.6. ∎
4. Solutions of Eq. (1.5) and Eq. (1.1)
In this section and are different characters of a group , and .
4.1. Solutions of Eq. (1.5)
In this subsection we solve the functional equation (1.5), i.e.,
[TABLE]
where are the unknown functions to be determined.
Proposition 4.1 solves the functional equation (1.5) when the set is linearly independent.
Proposition 4.1**.**
Let be a solution of (1.5) such that the set is linearly independent. Then
[TABLE]
where is a character of and is a constant.
Proof.
Let be arbitrary. We compute as and then as . Using Eq. (1.5) and that we obtain
[TABLE]
On the other hand, by applying Eq. (1.5) to the pair we get that
[TABLE]
So that
[TABLE]
As the set is linearly independent and are arbitrary, we derive from (4.1) and (4.2) that is a solution of the following functional equations as a system
[TABLE]
[TABLE]
[TABLE]
and
[TABLE]
for all . The functional equation (4.3) implies that where is a multiplicative function. By subtracting (4.4) from (4.5) we get that
[TABLE]
for all . Since we have . So, being arbitrary, we deduce that .
If , then and the functional equation (4.6) reduces to
[TABLE]
for all , which yields, by putting , that . Thus the functional equation (1.5) becomes for all . This implies, by putting , that , which contradicts the linear independence of the set .
Hence and then is a character of . So, the functional equation (4.6) implies that
[TABLE]
So that the functional equation (1.5) reduces to
[TABLE]
for all , from which we get, by putting and , that . ∎
Theorem 4.2**.**
*The solutions of (1.5) are:
(1) and , where is a character of and is a constant;
(2) , where is a constant;
(3)*
[TABLE]
[TABLE]
where are constants such that .
Proof.
It is easy to check that the formulas in parts (1)-(3) define solutions of the functional equation (1.5), so left is to show that any solution fits into (1)-(3).
If the set is linearly independent we get, by Proposition 4.1, the part (1) of Theorem 6.2.
In the remainder of the proof we assume that is linearly dependent. Recall that the set is linearly independent because , and are different characters of . Then there exists a triple such that
[TABLE]
Substituting this back into (1.5) we get by a small computation that
[TABLE]
for all . Since , and are different characters of , we derive by Proposition 3.1 that is a solution of the following identities as a system
[TABLE]
[TABLE]
and
[TABLE]
When we subtract (4.9) from (4.8) we obtain
[TABLE]
If the identity (4.11) reduces to . Hence because . So, taking (4.7) and (4.10) into account, we get that
[TABLE]
which is solution (2).
If the identity (4.11) implies that
[TABLE]
Substituting this back into (4.8) and (4.10) we derive that
[TABLE]
and
[TABLE]
The solution occurs in part (3). This completes the proof. ∎
4.2. Solutions of Eq. (1.1)
In Theorem 4.3 we solve the functional equation (1.1), i.e.,
[TABLE]
where are the unknown functions to be determined.
Theorem 4.3**.**
*The solutions of (1.1) can be listed as follows:
(1) , is arbitrary, and , where is a constant;
(2) , , is arbitrary, and , where and are constants;
(3)*
[TABLE]
[TABLE]
*where are constants such that ;
(4) , , , and , where are constants and is a character of ;
(5)*
[TABLE]
[TABLE]
where and are constants.
Proof.
We check by elementary computations that if and are of the forms (1)-(5) then is a solution of (1.1), so left is that any solution of (1.1) fits into (1)-(5).
By putting in (1.1) we get that
[TABLE]
We split the discussion into the subcases and .
Case 1: Suppose . Then (4.12) gives
[TABLE]
where and . Hence, the set is linearly dependent.
If then, according to Lemma 3.5(1), we get that is arbitrary, and , which is solution (1).
If . So, by Lemma 3.5(2), the set is linearly dependent. Since the set is linearly independent there exists a triple such that
[TABLE]
By substituting (4.13) and (4.14) in (1.1) we derive by simple computations that
[TABLE]
for all . So, the set being linearly independent, we derive from the identity above that satisfies the following identities as a system
[TABLE]
[TABLE]
and
[TABLE]
By subtracting (4.16) from (4.15) we get that
[TABLE]
If then (4.18) implies that because . Hence, from (4.13), (4.14), (4.15) and (4.18) we get that
[TABLE]
This is solution (2).
If then we obtain, from (4.18), that
[TABLE]
By substituting (4.19) in (4.15) and in (4.17) we get that
[TABLE]
and
[TABLE]
Let
[TABLE]
[TABLE]
Notice that because . By using (4.13), (4.14), (4.19), (4.20) and (4.21) we obtain by small computations
[TABLE]
[TABLE]
[TABLE]
and
[TABLE]
which is solution (3).
Case 2: Suppose . Then from (4.12) we get that
[TABLE]
Substituting this back into (1.1) we obtain
[TABLE]
for all . So that
[TABLE]
for all , i.e., the quadruple is a solution of the functional equation (1.5), so, according to Theorem 6.2, that quadruple falls into three categories:
(i) ,
where is a character of and is a constant. We define complex constants by , , and . So, the identities above and (4.22) yield, by writing instead of , that
[TABLE]
[TABLE]
which is solution (4).
(ii)
[TABLE]
where is a constant.
Defining complex constants , , and we obtain, by a small computation, from the identities above and (4.22) that
[TABLE]
[TABLE]
which is solution (5).
(iii)
[TABLE]
[TABLE]
where such that . Using (4.22) and the identities above we get that
[TABLE]
Defining
[TABLE]
[TABLE]
we have , and . Sine we have . Moreover the identities and (4.23) read
[TABLE]
[TABLE]
and
[TABLE]
which is solution (3). This completes the proof of Theorem 4.3. ∎
From Case 1 of the proof of Theorem 4.3 we derive that if satisfy the functional equation (1.1) and , then and are abelian, or and are abelian.
According to [11, Proposition 5], if and is an abelian group then the function , in the formulas of solutions of the form (4) in Theorem 4.3, take the form , where ranges over . On groups that need not be abelian, the expression of is given by Theorem 3.3.
Example 4.4**.**
If we choice in Theorem 4.3(2), or in Theorem 4.3(3), or and in Theorem 4.3(4), we get that , then the functional equation (1.1) reduces to
[TABLE]
*which was solved in [7, Theorem 8].
(1) for in Theorem 4.3(2), we get, by putting , that*
[TABLE]
*which is the solution obtained in [7, Theorem 8(d)].
(2) for in Theorem 4.3(3) we obtain*
[TABLE]
and
[TABLE]
*where are constants. Furthermore for we have and . The solution was obtained in [7, Proposition 6(b), Theorem 8(b)].
(3) for and in Theorem 4.3(4),*
[TABLE]
where are constants. Furthermore for we have . The solution was obtained in [7, Theorem 8(a)].
Example 4.5**.**
By taking , and in Theorem 4.3(3) we get that
[TABLE]
which is the solution of the classic sine addition law obtained in [10, Theorem 4.1(c)].
5. Solutions of Eq. (1.6) and Eq. (1.2)
In this section are distinct characters of a group .
5.1. Solutions of Eq. (1.6)
In Theorem 5.1 we solve the functional equation (1.6), i.e.,
[TABLE]
where are the unknown functions to be determined.
Theorem 5.1**.**
*The solutions of (1.6) are:
(1)*
[TABLE]
*for all , where are constants ;
(2)*
[TABLE]
for all , where is a character of and is a constant.
Proof.
Elementary computations show that if are of the forms (1)-(2) then is a solution of (1.6), so left is that any solution of (1.6) fits into (1)-(2). We consider two cases.
Case 1: Suppose that the set is linearly dependent. Since are different characters then, according to Proposition 3.1, the set is linearly independent. So there exist such that
[TABLE]
Substituting this in (1.6) we get that
[TABLE]
for all . So, by using the linear independence of , we obtain
[TABLE]
for all and all . Hence
[TABLE]
for all , with arbitrary. The result occurs in part (1).
Case 2: Suppose that the set is linearly independent. Let be arbitrary. We compute by using the associativity of the operation of . We have
[TABLE]
On the other hand, by using (1.6), and that are multiplicative, we obtain
[TABLE]
Since the set is linearly independent and are arbitrary we derive from (5.1) and (5.2) that
[TABLE]
and
[TABLE]
for all and all . The functional equation (5.3) says that is a multiplicative function of . If there exists such that then . So, by putting in (1.6), we get that , which contradicts that the set is linearly independent. Thus is a character of and the functional equations (5.5) becomes
[TABLE]
for all and all , i.e., for all .
To find we put in (1.6) which yields that
[TABLE]
where . The result occurs in part (2). This completes the proof of Theorem 5.1. ∎
5.2. Solutions of Eq. (1.2)
In Theorem 5.2 we solve the functional equation (1.2), i.e.,
[TABLE]
where are the unknown functions to be determined.
Theorem 5.2**.**
*The solutions of (1.2) are:
(1)*
[TABLE]
*for all , where are constants;
(2)*
[TABLE]
*for all , where are constants;
(3)*
[TABLE]
for all , where is a character of , and and are constants.
Proof.
We check by elementary computations that if are of the forms (1)-(3) then is a solution of (1.2), so left is that any solution of (1.2) fits into (1)-(3).
We will discuss two cases according to whether the set is linearly independent or not.
Case 1: Suppose that the set is linearly dependent. As seen earlier the set is linearly independent. Then there exist such that
[TABLE]
There are two subcases to consider.
Subcase 1.1: Suppose that . Then is arbitrary, and taking (5.6) into account, the functional equation (1.2) implies that
[TABLE]
for all and all . So, the set being linearly independent, and and arbitrary, we get, according to Proposition 3.1, that for all . The result occurs in part (1).
Subcase 1.2: Suppose that . Then, we derive from Eq. (1.2) that there exist constants such that
[TABLE]
By substituting (5.7) in (1.2) we obtain by a small computation, that
[TABLE]
for all . Since the set is linearly independent, and and arbitrary, we get, according to Proposition 3.1, that
[TABLE]
for all . The identities (5.6), (5.7) and (5.8), with arbitrary, constitute the result (2).
Case 2: Suppose that the set is linearly independent. By putting in the functional equation (1.2) we get that
[TABLE]
Since the set is linearly independent the identity (5.9) impose that , which implies that
[TABLE]
Substituting this back into (1.2) we get, by elementary computation, that
[TABLE]
for all . Then the functions satisfy the functional equation (1.6). Hence, according to Theorem 5.1 and seeing that the set is linearly independent, we derive that:
[TABLE]
for all , where is a character of and is a constant. Using this and the identity (5.10) we get that
[TABLE]
[TABLE]
[TABLE]
and
[TABLE]
for all . Defining complex constants
[TABLE]
and written instead of for all , the formulas above read
[TABLE]
for all . The result occurs in part (3). This completes the proof. ∎
We close this section with relating our results to two functional equations in the literature. The proof of Theorem 5.2 reveals that if the set is linearly independent, then the solutions of the functional equation (1.2) are of the form (3) in Theorem 5.2. This is an extension of [11, Theorem 14] as example 5.3 says.
Example 5.4 relate Theorem 5.2(3) to the simple generalization of Prexider’s functional equation
[TABLE]
where is a character of (see [11, Proposition 15]).
Example 5.3**.**
If we choice and for all in part (3) of Theorem 5.2 we get that for all . With the notations and we get that
[TABLE]
where and are constants, and satisfies the functional equation
[TABLE]
which is the solution obtained in [11, Theorem 14].
Example 5.4**.**
If we take , , and for all in part (3) of Theorem 5.2, we get that for all and where is an additive function on . With the notations we obtain
[TABLE]
where are constants, which is the solution obtained in [11, Proposition 15].
6. Solutions of Eq. (1.7) and Eq. (1.3)
Throughout this section denotes a monoid with identity element , different nonzero multiplicative functions, an additive function such that and .
6.1. Solutions of Eq. (1.7)
Proposition 6.1 solves the functional equation (1.7), i.e.,
[TABLE]
under the assumption that the set is linearly independent.
Proposition 6.1**.**
*The solutions of (1.7) such that the set is linearly independent are:
[TABLE]
where is a non zero multiplicative function and is a constant such that and .
Proof.
It is easy to check that the formulas in Proposition 6.1 define solutions of Eq. (1.7), so left is that any solution is of that form.
Let be arbitrary. First we compute as and then as . Using Eq. (1.7) and that we obtain
[TABLE]
On the other hand, by making use that and are multiplicative and that is additive, we get from Eq. (1.7) that
[TABLE]
So that
[TABLE]
As the set is linearly independent and are arbitrary, we derive from (6.1) and (6.2) that is a solution of the following functional equations as a system
[TABLE]
[TABLE]
and
[TABLE]
for all . The functional equation (6.3) implies that where is a multiplicative function. From (6.4) and (6.5) we get that
[TABLE]
for all , from which we deduce that for all , and then . Hence, the functional equation (1.7) reduces to
[TABLE]
for all , which yields, by putting , that
[TABLE]
If or , then the set is linearly dependent, contradicting the hypothesis. Thus , , and . ∎
Theorem 6.2**.**
*The solutions of (1.7) are:
(1) , where is a non zero multiplicative function and is a constant such that and ;
(2) ;
(3)*
[TABLE]
[TABLE]
where are constants such that and .
Proof.
(1) If the set is linearly independent we get, by Proposition 6.1, the part (1) of Theorem 6.2.
In the remainder of the proof we assume that is linearly dependent.
(2) If then is arbitrary and the functional equation (1.7) implies that
[TABLE]
for all . So . In what follows we assume that .
(3) By using Lemma 3.2 we get that the set is linearly independent. So, seeing that there exists a triple such that
[TABLE]
Substituting this back into (1.7) we get by a small computation that
[TABLE]
for all . We derive that is a solution of the following identities as a system
[TABLE]
[TABLE]
and
[TABLE]
When we subtract (6.7) from (6.6) we obtain
[TABLE]
We have . Indeed, if the identity (6.9) reduces to
[TABLE]
Hence , which contradicts the assumption on . Hence, the identity (6.9) implies that
[TABLE]
Substituting this back into (6.6) and (6.8) we derive that
[TABLE]
and
[TABLE]
Conversely, simple computations show that the formulas in (1)-(3) define solutions of (1.7). ∎
6.2. Solutions of Eq. (1.3)
In Theorem 6.3 we solve the functional equation (1.3), i.e.,
[TABLE]
where are the unknown functions to be determined.
Theorem 6.3**.**
*The solutions of (1.3) can be listed as follows:
(1) , is arbitrary and ;
(2) , , is arbitrary, and , where are constants.
(3)*
[TABLE]
[TABLE]
and
[TABLE]
*where are constants such that and .
(4) , , , and , where and are constants, and is a non zero multiplicative function.*
Proof.
We check by elementary computations that if and are of the forms (1)-(4) then is a solution of (1.3), so left is that any solution of (1.3) fits into (1)-(4).
There are two cases to consider.
Case 1. Suppose . By Proposition 3.6, we obtain solutions (1) and (2).
Case 2. Suppose . Taking in (1.3) we get that
[TABLE]
We split the discussion into the subcases and .
Subcases 2.1. Suppose . Then (6.10) gives
[TABLE]
where , and . Hence, the set is linearly dependent. As we get, according to Lemma 3.5(1), that . So, by Lemma 3.5(2), the set is linearly dependent. Since the set is linearly independent there exists a triple such that
[TABLE]
By substituting (6.11) and (6.12) in (1.3) we derive by simple computations that
[TABLE]
for all . So, the set being linearly independent, we derive from the identity above that satisfies the following identities as a system
[TABLE]
[TABLE]
and
[TABLE]
The first and the second identities imply that . Since and we have , so that
[TABLE]
Substituting this in the first identity we get that
[TABLE]
hence,
[TABLE]
The third identity implies that
[TABLE]
so that
[TABLE]
Let
[TABLE]
[TABLE]
Notice that and because and . From (6.11), (6.12), (6.13) and (6.14) we get that
[TABLE]
[TABLE]
and
[TABLE]
From (6.15) we obtain
[TABLE]
which is solution (3).
Subcases 2.2. Suppose . Then from (6.10) we get that
[TABLE]
Substituting this back into (1.3) we obtain
[TABLE]
for all . So that
[TABLE]
for all , i.e., the quadruple is a solution of the functional equation (1.7), so, according to Theorem 6.2, it falls into two categories:
(i) ,
where is a non zero multiplicative function and is a constant such that and . We define complex constants by , , and . So, the identities above and (6.16) yield that
, , , and , which is solution (4).
(ii)
[TABLE]
[TABLE]
where such that and . Taking (6.16) into account and using the identities above we get, by simple computations, that
[TABLE]
Defining
[TABLE]
[TABLE]
we have because , because , , then (6.17) reads
[TABLE]
[TABLE]
and
[TABLE]
which is solution (3). ∎
Remark 6.4**.**
If satisfy the functional equation (1.3), the formulas in parts (3) and (4) of Theorem 6.3 reveal that if the functions and are abelian.
Example 6.5**.**
If we choice in Theorem 6.3(3) or in Theorem 6.3(4) we get that , then the functional equation (1.3) reduces to
[TABLE]
*which was solved in [7, Theorem 8], and we obtain:
(a) for in Theorem 6.3(3),*
[TABLE]
and
[TABLE]
*which is the solution obtained in [7, Theorem 8(b)].
(b) for in Theorem 6.3(4),*
[TABLE]
where are constants and is a non zero multiplicative function such that and , which is the solution obtained in [7, Theorem 8(a)].
Example 6.6**.**
By taking , and in Theorem 6.3(3) we get that
[TABLE]
which is the solution of the classic sine addition law in case obtained in [10, Theorem 4.1(c)].
7. Solutions of Eq. (1.8) and Eq. (1.4)
Throughout this section denotes a group with identity element , different characters and a nonzero additive function. We deal with the functional equations (1.8) and (1.4)
7.1. Solutions of Eq. (1.8)
In Theorem 7.1 we solve the functional equation (1.8), i.e.,
[TABLE]
where are the unknown functions to be determined.
Theorem 7.1**.**
*The solutions of (1.8) are:
(1) , arbitrary, and , where ranges over ;
(2) , , and , where is a character of and ranges over ;
(3) , , and , where and range over , and over .*
Proof.
Elementary computations show that if and are of the forms (1)-(3) then is a solution of (1.8), so left is that any solution of (1.8) fits into (1)-(3).
If then is arbitrary and the functional equation (1.8) becomes for all . Since the set is linearly independent we get that , which occurs in (1) for . In the rest of the proof we assume that . We consider two cases.
Case 1. Suppose that the set is linearly independent. Let be arbitrary. We compute by using the associativity of the operation of . We have
[TABLE]
On the other hand, by using (1.8), that and are multiplicative and is additive, we get that
[TABLE]
Since the set is linearly independent and are arbitrary we derive from (7.1) and (7.2) that
[TABLE]
[TABLE]
[TABLE]
and
[TABLE]
for all . The functional equation (7.3) says that is a multiplicative function on . If there exists such that then . So, by putting in (1.8), we get that , which contradicts that the set is linearly independent. Thus is a character of .
Since is a character of and is an additive function on we derive from (7.5) that .
Taking into account that the functional equation (7.4) becomes
[TABLE]
for all , i.e., .
To find we put in (1.8) which yields that
[TABLE]
where . The result occurs in part (2).
Case 2. Suppose that the set is linearly dependent. Since is linearly independent and there exists a triple such that
[TABLE]
Combining (1.8) and (7.7) we get by a small computation that
[TABLE]
for all
On the other hand (7.7) gives
[TABLE]
for all . Since the set is linearly independent we get from (7.8) and (7.9) that
[TABLE]
[TABLE]
and
[TABLE]
If then we get from (7.11) that . So, (7.7) and (7.12) imply that and . From (7.10) we obtain with arbitrary. The result occurs in part (1).
If then we derive from (7.10), (7.11) and (7.12) that
[TABLE]
In (7.7) and the identities above we put , which yields that
[TABLE]
The result occurs in part (3). ∎
7.2. Solutions of Eq. (1.4)
In Theorem 7.2 we solve the functional equation (1.4), i.e.,
[TABLE]
where are the unknown functions to be determined.
Theorem 7.2**.**
*The solutions of (1.4) are:
(1) , arbitrary, , and , where ranges over ;
(2) , , arbitrary, and , where , and range over ;
(3) and , where and are constants such that and ;
(4)
, where is a character of , and range over and over ;
(5) , where and range over , and and over .*
Proof.
We check by elementary computations that if and are of the forms (1)-(5) then is a solution of (1.4), so left is that any solution of (1.4) fits into (1)-(5).
There are two cases to consider.
Case 1. is proportional to . By Proposition 3.7 we get solutions (1) and (2).
Case 2. is not proportional to . By putting in the functional equation (1.4) we get that
[TABLE]
We consider two subcases according to whether or not.
Subcase 2.1. . Then (7.13) becomes
[TABLE]
where and . So the set is linearly dependent. As is not proportional to we derive, according to Lemma 3.5(1), that . So, by Lemma 3.5(2), the set is linearly dependent. As the set is linearly independent we deduce that there exists a triple such that
[TABLE]
Let be arbitrary. By substituting (7.14) and (7.15) in (1.4) we obtain
[TABLE]
for all . Since the set is linearly independent we derive from the identity above that , and . So, being arbitrary, we deduce that
[TABLE]
Since is not proportional to we get from (7.14) that . Hence, the second identity in (7.16) implies that because . So, by putting we derive from (7.16) that
[TABLE]
The result occurs in part (3).
Subcase 2.2. . Here we get from (7.13) that
[TABLE]
Substituting this back into (1.4) we get, by elementary computation, that
[TABLE]
for all . Then the quadruple satisfies the functional equation (1.8), hence, according to Theorem 7.1 and seeing that is not proportional to , that quadruple falls into two categories:
(i) , , and , where is a character of and ranges over . Then
[TABLE]
So, (7.17) gives
[TABLE]
Defining
[TABLE]
and written instead of the formulas above read
[TABLE]
Moreover since is not proportional to , is non zero. The result obtained occurs in part (4).
(ii) , , and , where and range over , and over . Then
[TABLE]
So, by using (7.17), we get that
[TABLE]
Defining , , and , we get, by using the formula of above, (7.18) and (7.19), that
[TABLE]
The result occurs in part (5). ∎
Example 7.3**.**
If we choice in part (4) of Theorem 7.2 we get that and
[TABLE]
with the same constraints on and , which is the solution obtained in [11, Theorem 14].
Example 7.4**.**
If we choice in part (5) we get that and
[TABLE]
With the notations and the formulas above read
[TABLE]
which is a solution obtained in [11, Theorem 14] corresponding to the non zero central solutions of the functional equation
[TABLE]
We close with non-examples. On finite monoids or groups the only additive function is , so the functional equations (1.3) and (1.4) become
[TABLE]
where is a monoid, is the average of two distinct nonzero multiplicative functions and on , and
[TABLE]
where is a group and is a character of , which was recently solved in [7] and [10].
on the other hand, on perfect groups, i.e. groups such that , the only character is so that the function cannot exist. As examples of perfect groups we cite connected groups and semi-simple Lie groups like , and for .
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[1] J. Aczél, Lectures on functional equations and their applications. Mathematics in Sciences and Engineering, Vol. 19, Academic Press, New York-London xx+510 pp. 1966.
- 2[2] O. Ajebbar and E. Elqorachi, The Cosine-Sine functional equation on a semigroup with an involutive automorphism, Aequationes Math. 91 (6) (2017), 1115-1146.
- 3[3] T. Andreescu, I. Boreico, O. Mushkarov and N. Nicolov, Topics in functional equations. Second Edition. XYZ Press, LLC, 2015.
- 4[4] K. Belfakih and E. Elqorachi, A note on Levi-Civita functional equation in monoids. Manuscript 2018.
- 5[5] J. K. Chung, Pl. Kannappan and C. T. Ng, A generalization of the cosine-sine functional equation on groups, Linear Algebra Appl. 66 (1985), 259-277.
- 6[6] B. Ebanks, An extension of the sine addition formula on groups and semigroups, Publ. Math. Debrecen 93 (1-2) (2018), 9-27.
- 7[7] B. Ebank and H. Stetkær, Extensions of the Sine Addition Formula on Monoids, Results Math. (2018) 73: 119.
- 8[8] T. Levi-Civita, Sulle funzioni che ammettono una formula d’addizione del tipo f ( x + y ) = ∑ i = 1 n X i ( x ) Y i ( y ) 𝑓 𝑥 𝑦 superscript subscript 𝑖 1 𝑛 subscript 𝑋 𝑖 𝑥 subscript 𝑌 𝑖 𝑦 f(x+y)=\sum_{i=1}^{n}X_{i}(x)Y_{i}(y) , (Italian) Rom. Acc. L. Rend. (5) 22, No. 2, (1913), 181-183.
