Abstract
Due to the computational aspects which appear in the study of algebras obtained by the Cayley–Dickson process, it is difficult to obtain nice properties for these algebras. For this reason, finding some identities in such algebras plays an important role in obtaining new properties of these algebras and facilitates computations. In this regard, in the first part of this paper, we present some new identities and properties in algebras obtained by the Cayley–Dickson process. As another remark regarding the computational aspects in these algebras, in the last part of this paper, we solve some quadratic equations in the real division quaternion algebra when their coefficients are some special elements. These special coefficients allowed us to solve interesting quadratic equations, providing solutions directly, without using specialized softs.
MSC:
17A35; 17A45; 15A18
1. Introduction
Algebras obtained by the Cayley–Dickson process have at present many applications in various domains, for example, coding theory, computer vision physics, etc. In these algebras it is difficult to obtain nice properties. When their dimension increase, algebras obtained by the Cayley–Dickson process lose commutativity, associativity, and alternativity. For this reason, the study of all kinds of identities on these algebras is very useful for obtaining new properties and relations. Several papers are devoted to the study of these identities ([1,2,3,4] etc.). Therefore, it is very interesting to continue the study of these identities in algebras obtained by the Cayley–Dickson process, since these relations can be helpful to replace the missing commutativity, associativity, and alternativity.
In the following, we consider , an algebra over the field K, where K is a commutative field with . Algebra is called unitary if it contains an identity element with respect to the algebra’s multiplication.
We define the associator of three elements as below
In an arbitrary algebra over a field K, the following relation is true ([5], (1.2))
An algebra is alternative if the following relations are fulfilled: and for all Analgebra is flexible if for all and power associative if the subalgebra of , generated by an arbitrary element , is associative. We know that an alternative algebra is a flexible and a power associative algebra. If in a unitary algebra we have for each with this algebra is a quadratic algebra. A finite-dimensional algebra without zero divisors is called a division algebra (see [6]). The Cayley–Dickson process and the properties of the obtained algebras, will be briefly presented in the following. For other details see [6,7].
Let be a finite dimensional unitary algebra over a field with a map called a scalar involution
This map is a linear map and has the following properties
and
The element is called the conjugate of the element x. The linear form
and the quadratic form
are called the trace and the norm of the element x. From here, we have that an algebra with a scalar involution is a quadratic algebra.
With , a fixed non-zero element, the following algebra multiplication is defined over the vector space
We obtain an algebra structure over denoted by , called the algebra obtained from by the Cayley–Dickson process with .
For , , the map
is a scalar involution of the algebra , which extend the involution of the initial algebra . We consider the maps
and
which are the trace and the norm of the element .
Let . If we apply the above process t times, , we get an algebra over K, denoted
By induction, the set , generates, in this algebra, a basis with the properties:
and
with and uniquely determined by and
In each algebra with the basis satisfying relations and we have:
for all and for every . ([7], Lemma 4)
From the above, it results that each can be written under the form
where and .
All algebras obtained by the Cayley–Dickson process are flexible and power associative, for all and, in general, are not division algebras, for all . For example, if we obtain the classical division quaternion algebra and for we obtain the division octonion algebra.
2. Some Remarks Regarding Algebras Obtained by the Cayley–Dickson Process
In the following, we consider an algebra obtained by the Cayley–Dickson process. In this section we present some new relations, properties and solutions to a quadratic equation in these algebras. In the next section, we will present solutions to a few quadratic equations over quaternion real division algebra, when the coefficients of these equations are some special elements.
Remark 1
([1]). In all algebras , obtained by the Cayley–Dickson process, the following identity is satisfied:
To obtain identities in these algebras, in [1] the linearization method was presented, a method which we will use in the next sentence.
Proposition 1.
If the field K has an arbitrary characteristic, then, in all algebras , obtained by the Cayley–Dickson process, the following identities are satisfied:
where
Proof.
From the above remark, we have that , for all . Denoting , we linearize these relations. For , with , , nonzero, arbitrary chosen, we obtain
. We have
Comparing the coefficients of , we obtain
and
, therefore
Comparing the coefficients of , we obtain
and
, therefore
Comparing the coefficients of , we obtain
and
. It results
which is similar to relation □
Remark 2.
The above results are true for a field of an arbitrary characteristic, namely even if char. However, if char, the proof of relation is more simple. Indeed, we have
, by using Remark 1.
Proposition 1 and the above remark improved Proposition 2.9 from [8].
Proposition 2.
In all algebras , obtained by the Cayley–Dickson process, the following identity is satisfied:
Proof.
Algebras are power-associative and for each we have . From here, we have that . It results that
□
Proposition 3.
Let , be an algebra obtained by the Cayley–Dickson process. We consider the elements such that the following equality holds:
Then the algebra generated by x and has dimension
Proof.
We prove that for all if and only if . Since , therefore, if we have relation . Now, supposing that relation is true and if there is not an element such that then, for we have If we have it results false. It results that
from relation we have
In relation we take and we obtain
If we take with and we replace this value in relation we get which it is not true. It results that there is an element such that . From here, we have that the dimension of the algebra is 1. □
The above proposition generalized Proposition 2.8 from [9].
Proposition 4.
Let be an algebra obtained by the Cayley–Dickson process over a field with characteristic not 2 and .
(1) If then the solution in of the equation are the solutions in K of the following system:
where .
(2) If then the solution in of the equation are the solutions in K of the following system:
Proof.
(1) Let , . Since is a quadratic algebra, we have that , therefore and .
(2) Let K. It results . We get and . If then . If then for all and is the solution in K of the equation . □
Remark 3.
Let . We denote . Therefore all elements of the form commute with a. (see [8], Proposition 2.11 and Remark 2.12).
3. A Quadratic Equation over Real Quaternions
Solving equations with coefficients in algebras obtained by the Cayley–Dickson, is not an easy problem, even if t is small, that means we have coefficients in quaternion or in octonion algebras. There are many papers devoted to the study of the roots of polynomial equations with coefficients in . In [10], the author studied zeros of polynomials over Cayley–Dickson algebras, without providing a clear algorithm to find them. In the papers [11,12,13,14,15,16,17,18,19] the authors studied roots of quaternionic and octonionic polynomials and provided laboriously methods to find these roots. To find these roots “by hand” is not so easy and, in most cases, are used specialized softs. Even so, the above-mentioned methods are done only for quaternions and octonions, since in the proof are used Moufang identities, which are true only in alternative algebras. To generalize these algorithms to all algebras can be a real challenge. In this section, we consider quadratic equations over real division quaternion algebra, when the coefficients are some special elements. These special coefficients allowed us to solve interesting quadratic equations, providing solutions directly, without using specialized softs. For example, in [13], the authors find roots of a polynomial of degree n, with quaternionic coefficients, by using its companion polynomial, which is polynomial of degree with real coefficients. For finding roots of the companion polynomial we used some special softs.
Let be the real division quaternion algebra, the algebra of the elements of the form where and the elements of basis given by the following multiplication table:
| · | 1 | |||
| 1 | 1 | |||
The norm of a real quaternion a is For the real quaternion algebra, in [20], the Fibonacci quaternions were defined:
and the formula of the norm was given:
Here is the conjugate of the element in the algebra .
In [19], the authors presented specific formulae for solving the following equation
with .
Proposition 5
([19] Theorem 2.3). Solutions to the quadratic equation
are:
Case 1. If and then:
with where .
Case 2. If and then:
Case 3. If then:
where and
Case 4. If then:
with , , where are chosen in the following way:
(1) if
(2) if
(3) if and z is the unique positive solution to the equation:
where and .
By using the above results, we will give solutions to the monic quadratic equation , where are two Fibonacci quaternion elements. We will show that, by using such elements, we can obtain a much simpler form of the solutions. Due to the chosen coefficients, we are interested only in cases 3 or 4 of Proposition 5. To be able to compute solutions, we must compute first the following elements:
The above elements help us to compute parameters and then to obtain the solutions. The expression of the solutions depends on the parameters . The first step is to see when is 0 or not. To compute , we will compute first and , where
Remark 4.
(1) The solutions to Equation in case 4, depends when Δ is zero or not. The question is when ? From its expression it is clear that, in the most of cases, we have .
(2) When , in relation , we have . From here, relation implies , therefore, . It results that . In this particular case, we obtain particular solutions to Equation , solutions which will be presented at the end of this paper. Due to the monotonicity of the Fibonacci sequence, in the rest of cases, we have 0.
(3) From above, we remark that the solutions to Equation , when are involved two Fibonacci quaternions as coefficients, can be obtained by using subcases 3 and 4 from Proposition 5. To obtain these solutions, root of the polynomial of the third degree must be obtained.
For Γ and Ψ, we have
and
In the known references, we can find some examples of roots of equations with coefficients in . Most of them are “served”, with the roots already known. By using the above results, we will find the roots for the following equations, equations which are not in the above-described situation:
where is a Fibonacci quaternion;
where is a Fibonacci quaternion
where and are Fibonacci quaternions.
Proposition 6.
Equation has the following solutions:
where and .
Proof.
We have , therefore then , from Remark 4. Replacing in formula for , we obtain:
-
Replacing in formula we obtain:
We are in the first subcase of case 4 from Proposition 5. Therefore , . , , . It results the following solutions:
We have . Denoting with and , we obtain the following solutions:
□
Proposition 7.
Equation has the following solutions:
Proof.
Now, for , we have and . It results
. For , we obtain =+++++++
We have , therefore, for , we get
therefore
For we have therefore
□
Proposition 8.
Equation has the following solutions:
where δ is the real positive solution of the equation and .
Proof.
Now, we take . We have and . We have and . We have . For , we obtain =++++-+++. This equation has a real positive solution We have . Therefore, we get
□
We consider now the equation
with , which are not in the cases described in Proposition 5, but can be reduced to these situations. Let . We remark that . Therefore, if is a solution to Equation then its conjugate is a solution to the equation
called the conjugate of Equation . Conversely, if is a solution to Equation , then is a solution to . This equation can be solved by using Proposition 5. We consider the particular case when are Fibonacci quaternion elements. For this purpose, we must compute the elements
We obtain
From the above remarks, we will solve the following equations:
where is a Fibonacci quaternion;
where is a Fibonacci quaternion
where and are Fibonacci quaternions.
Proposition 9.
Equation has the following solutions:
and
where and .
Proof.
For Equation , we consider its conjugate . From the above formulae and Proposition 6, we have, , therefore, , , , and . It results the following solutions:
We have . Denoting with and , we obtain the following solutions:
From here, solutions of Equation (31) are and □
Proposition 10.
Equation has the following solutions:
and
Proof.
For Equation , we consider its conjugate . From the above formulae and Proposition 7, we have, . Equation is the same , with solution , therefore, . Equation has solution . We have , therefore, for , we have
therefore
For we have therefore,
. From here, solutions of Equation are and □
Proposition 11.
Equation has the following solutions:
where δ is the real positive solution of the equation and .
Proof.
For Equation , we consider its conjugate . From the above formulae and Proposition 8, we have We have , , , It results in the following equation . This equation has a real positive solution We have
. Therefore, we get . From here, we obtain solutions for Equation , the same as for , namely
Now, we consider the equation
with , which are not in the cases described in Proposition 5, but can be reduced to these situations. We have that . Denoting and it results the following equation
which is a -type equation. Therefore, if z is a solution to Equation then is a solution to Equation and if w is a solution to Equation therefore is a solution to Equation . □
Proposition 12.
Solutions to the equation
where and are Fibonacci quaternions,
where θ=
Proof.
From the above, Equation is equivalent to , with . Now, we are in case 3 of Proposition 5. We have . Therefore,
The solutions to the equation are
Solutions to Equation are □
Proposition 13.
With the above notations, solutions to the equation
are
and
Proof.
We take and we get
== We obtain the following solutions: It results . We have and . □
4. Conclusions
In this paper, we gave some new identities and properties in algebras obtained by the Cayley–Dickson process and we provide more examples of quadratic equations over real division quaternion algebras with coefficients Fibonacci quaternion elements. These special coefficients allowed us to solve interesting quadratic equations, provided solutions directly, without using specialized softs. As further research, we intend to study some types of the equation over algebras obtained by the Cayley–Dickson in higher dimensions and to find methods to solve these equations.
Author Contributions
Conceptualization, C.F. and G.Z.; Formal analysis, C.F.; Funding acquisition, G.Z.; Investigation, C.F. and G.Z.; Methodology, C.F.; Supervision, C.F.; Validation, C.F.; Writing—original draft, C.F. All authors have read and agreed to the published version of the manuscript.
Funding
This paper is financial supported by Doctoral School of Mathematics, Ovidius University of Constanţa, România.
Institutional Review Board Statement
Not applicable.
Informed Consent Statement
Not applicable.
Data Availability Statement
Not applicable.
Conflicts of Interest
The authors declare no conflict of interest.
Appendix A
Since the computations are too long, we give in this section the proof of formulae for used in Section 3.
First, we compute We have:
Now, we compute , We obtain:
= ++
+=
=+
++−
++
++−
++
++. Therefore
= +-++
+
++
++
+
+-
= +
=
Then, we get that
For we obtain the following formula
For we get
=
= +++
+-++--
. Since
, we get
In the following we compute the elements
We compute We have:
Replacing with and with in the formula of the element c, we obtain
Now, we compute Replacing with and with in the formulae of the elements and we obtain
the same formula as for ,
the same formula as for
the same formula as for
References
- Bremner, M.; Hentzel, I. Identities for Algebras Obtained from the Cayley-Dickson Process. Commun. Algebra 2001, 29, 3523–3534. [Google Scholar] [CrossRef]
- Hentzel, I.R. Identities of Cayley-Dickson Algebras. J. Algebr. 1997, 188, 292–309. [Google Scholar] [CrossRef]
- Isaev, I.M. Identities of a finite Cayley-Dickson Algebra. Algebra Logika 1984, 23, 407–418. [Google Scholar] [CrossRef]
- Racine, M.L. Minimal Identities of Octonions Algebras. J. Algebr. 1988, 115, 251–260. [Google Scholar] [CrossRef][Green Version]
- Zorn, M. Alternative rings and related questions I: Existence of the radical. Ann. of Math. 1941, 42, 676–686. [Google Scholar] [CrossRef]
- Schafer, R.D. An Introduction to Nonassociative Algebras; Academic Press: New York, NY, USA, 1966. [Google Scholar]
- Schafer, R.D. On the algebras formed by the Cayley-Dickson process. Amer. J. Math. 1954, 76, 435–446. [Google Scholar] [CrossRef]
- Flaut, C.; Mustacă, D. Some Remarks and Properties of Algebras Obtained by the Cayley-Dickson Process. Available online: https://arxiv.org/pdf/2101.06789.pdf (accessed on 10 February 2022).
- Flaut, C.; Shpakivskyi, V. Some identities in algebras obtained by the Cayley-Dickson process. Adv. Appl. Clifford Algebr. 2013, 23, 63–76. [Google Scholar] [CrossRef][Green Version]
- Ludkovsky, S.V. Zeros of Polynomials Over Cayley-Dickson Algebras. Available online: https://arxiv.org/pdf/math/0406048.pdf (accessed on 10 February 2022).
- Chapman, A. Factoring Octonion Polynomials. Int. Algebra Comput. 2020, 30, 1457–1463. [Google Scholar] [CrossRef]
- Chapman, A. Polynomial Equations over Octonion Algebras. J. Algebra Appl. 2020, 19, 2050102. [Google Scholar] [CrossRef]
- Janovska, D.; Opfer, G. A note on the computation of all zeros of simple quaternionic polynomials. Siam J. Numer. Anal. 2010, 48, 244–256. [Google Scholar] [CrossRef][Green Version]
- Niven, I. Equations in quaternions. Am. Math. Monthly 1941, 48, 654–661. [Google Scholar] [CrossRef]
- Porter, R.M. Quaternionic Linear and Quadratic Equations. J. Nat. Geom. 1997, 11, 101–106. [Google Scholar]
- Pumplün, S.; Walcher, S. On the zeros of polynomials over quaternions. Commun. Algebra 2002, 30, 4007–4018. [Google Scholar] [CrossRef]
- Serodio, R.; Siu, L.S. Zeros of Quaternion Polynomials. Appl. Math. Lett. 2001, 14, 237–239. [Google Scholar] [CrossRef][Green Version]
- Serodio, R.; Pereira, E.; Vitoria, J. Computing the Zeros of Quaternion Polynomials. Comput. Math. Appl. 2001, 42, 1229–1237. [Google Scholar] [CrossRef]
- Huang, L.; Wasin, S. Quadratic Formulas for Quaternions. Appl. Math. Lett. 2002, 15, 533–540. [Google Scholar] [CrossRef]
- Horadam, A.F. Complex Fibonacci Numbers and Fibonacci Quaternions. Am. Math. Monthly 1963, 70, 289–291. [Google Scholar] [CrossRef]
Publisher’s Note: MDPI stays neutral with regard to jurisdictional claims in published maps and institutional affiliations. |
© 2022 by the authors. Licensee MDPI, Basel, Switzerland. This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC BY) license (https://creativecommons.org/licenses/by/4.0/).