Next Article in Journal
Mathematical Modelling of Inventory and Process Outsourcing for Optimization of Supply Chain Management
Previous Article in Journal
Measurement and Analysis of High Frequency Assert Volatility Based on Functional Data Analysis
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Remarks Regarding Computational Aspects in Algebras Obtained by Cayley–Dickson Process and Some of Their Applications

1
Faculty of Mathematics and Computer Science, Ovidius University of Constanţa, Bd. Mamaia 124, 900527 Constanta, Romania
2
Doctoral School of Mathematics, Ovidius University of Constanţa, 900527 Constanta, Romania
*
Author to whom correspondence should be addressed.
Mathematics 2022, 10(7), 1141; https://doi.org/10.3390/math10071141
Submission received: 20 February 2022 / Revised: 12 March 2022 / Accepted: 25 March 2022 / Published: 2 April 2022

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 A , an algebra over the field K, where K is a commutative field with c h a r K 2 . Algebra A is called unitary if it contains an identity element with respect to the algebra’s multiplication.
We define the associator of three elements a , b , c A as below
( a , b , c ) = a b c a b c .
In an arbitrary algebra over a field K, the following relation is true ([5], (1.2))
( a b , c , d ) a , b c , d + a , b , c d = a b , c , d + a , b , c d .
An algebra A is alternative if the following relations are fulfilled: a 2 b = a a b and a b 2 = a b b , for all a , b A . Analgebra A is flexible if a b a = a b a = a b a , for all a , b A and power associative if the subalgebra < a > of A , generated by an arbitrary element a A , is associative. We know that an alternative algebra is a flexible and a power associative algebra. If in a unitary algebra A K we have x 2 + α x x + β x = 0 , for each x A , with α x , β x K , this algebra is a quadratic algebra. A finite-dimensional algebra A 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 A be a finite dimensional unitary algebra over a field K , with a map called a scalar involution
x ¯ : A A , x x ¯ .
This map is a linear map and has the following properties
x y ¯ = y ¯ x ¯ , x ¯ ¯ = x ,
and
x + x ¯ , x x ¯ K · 1 , for all x , y A .
The element x ¯ is called the conjugate of the element x. The linear form
t : A K , t x = x + x ¯
and the quadratic form
n : A K ,   n x = x x ¯
are called the trace and the norm of the element x. From here, we have that an algebra A with a scalar involution is a quadratic algebra.
With δ K , a fixed non-zero element, the following algebra multiplication is defined over the vector space
A A : a 1 , a 2 b 1 , b 2 = a 1 b 1 + δ b ¯ 2 a 2 , a 2 b 1 ¯ + b 2 a 1 .
We obtain an algebra structure over A A , denoted by A , δ , called the algebra obtained from A by the Cayley–Dickson process with dim A , δ = 2 dim A .
For x A , δ , x = a 1 , a 2 , the map
x ¯ : A , δ A , δ , x x ¯ = a ¯ 1 , a 2 ,
is a scalar involution of the algebra A , δ , which extend the involution x ¯ of the initial algebra A . We consider the maps
t x = t ( a 1 )
and
n x = n a 1 δ n ( a 2 )
which are the trace and the norm of the element x A , δ .
Let A = K . If we apply the above process t times, t 1 , we get an algebra over K, denoted
A t = δ 1 , , δ t K .
By induction, the set { 1 , f 2 , , f n } , n = 2 t , generates, in this algebra, a basis with the properties:
f i 2 = δ i 1 , i K , δ i 0 , i = 2 , , n
and
f i f j = f j f i = σ i j f k , σ i j K , σ i j 0 , i j , i , j = 2 , , n ,
with σ i j and f k uniquely determined by f i and f j .
In each algebra A t with the basis { 1 , f 2 , , f n } satisfying relations 5 and 6 , we have:
f i f i x = δ i x = ( x f i ) f i ,
for all i { 1 , 2 , , n } and for every x A t . ([7], Lemma 4)
From the above, it results that each x A t can be written under the form
x = x 1 + x 2 f 2 t 1 ,
where x 1 and x 2 A t 1 .
All algebras A t obtained by the Cayley–Dickson process are flexible and power associative, for all t 1 , and, in general, are not division algebras, for all t 1 . For example, if K = R ,   t = 2 ,   δ 1 = δ 2 = 1 , we obtain the classical division quaternion algebra and for t = 3 ,   δ 1 = δ 2 = δ 3 = 1 , we obtain the division octonion algebra.

2. Some Remarks Regarding Algebras Obtained by the Cayley–Dickson Process

In the following, we consider A t 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 A t , obtained by the Cayley–Dickson process, the following identity is satisfied:
x 2 y x = x 2 y x .
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 A t , obtained by the Cayley–Dickson process, the following identities are satisfied:
w 2 , v , x + x w , v , w + w x , v , w = 0
w 2 , y , x + x 2 , v , w + x w , y , w + w x , y , w + w x , v , x + x w , v , x = 0 ,
where   x , y , v , w A t .
Proof. 
From the above remark, we have that x 2 y x = x 2 y x , for all x , y A t . Denoting T 1 = x 2 y x , T 2 = x 2 y x , we linearize these relations. For x + λ w , y + λ v , with v , w A t , λ K , λ nonzero, arbitrary chosen, we obtain
T 1 = ( x + λ w ) 2 y + λ v x + λ w =
= ( ( x + λ w ) 2 y + λ v ) x + λ w = T 2 . We have
T 1 = x 2 + λ x w + λ w x + λ 2 w 2 ( y x + λ y w + λ v x + λ 2 v w ) =
= λ 4 w 2 v w + λ 3 w 2 y w + v x + x w + w x v w +
+ λ 2 w 2 y x + x 2 v w + x w + w x y w + v x +
+ λ x w + w x y x + x 2 y w + v x + x 2 y x .
T 2 = x 2 + λ x w + λ w x + λ 2 w 2 y + λ v x + λ w =
= x 2 y + λ x 2 v + x w + w x y + λ 2 w 2 y + x w + w x v + λ 3 w 2 v x + λ w =
= λ 4 w 2 v w + λ 3 w 2 v x + ( w 2 y + x w + w x v ) w +
+ λ 2 x 2 v + x w + w x y w + w 2 y + x w + w x v x +
+ λ x 2 y w + x 2 v + x w + w x y x + x 2 y x .
Comparing the coefficients of λ 3 , we obtain
w 2 y w + v x + x w + w x v w =
= w 2 v x + w 2 y + x w + w x v w and
w 2 y w + w 2 v x + x w v w + w x ( v w ) =
= w 2 v x + w 2 y w + x w v w + w x v w , therefore
w 2 , v , x + x w , v , w + w x , v , w = 0
Comparing the coefficients of λ 2 , we obtain
w 2 y x + x 2 v w + x w + w x y w + v x =
= x 2 v + x w + w x y w + w 2 y + x w + w x v x and w 2 y x + x 2 v w + x w y w + x w v x + w x y w + w x v x =
= x 2 v w + x w y w + w x y w + w 2 y x + x w v x + w x v x , therefore
w 2 , y , x + x 2 , v , w + x w , y , w + w x , y , w + w x , v , x + x w , v , x = 0 .
Comparing the coefficients of λ , we obtain
x w + w x y x + x 2 y w + v x = x 2 y w + x 2 v + x w + w x y x and
x w y x + w x y x + x 2 y w + x 2 v x =
= x 2 y w + x 2 v x + x w y x + w x y x . It results
x 2 , y , w + x w , y , x + w x , y , x = 0 ,
which is similar to relation 10 .
Remark 2.
The above results are true for a field of an arbitrary characteristic, namely even if char K 2 . However, if char K 2 , the proof of relation 10 is more simple. Indeed, we have 2 w 2 , v , x + 2 x w , v , w + 2 w x , v , w =
= w + x 2 , v , x + w + w x 2 , v , x w 2 x 2 , v , x = 0 , by using Remark 1.
Proposition 1 and the above remark improved Proposition 2.9 from [8].
Proposition 2.
In all algebras A t , obtained by the Cayley–Dickson process, the following identity is satisfied:
x m , y , x n = 0 , m , n N ;
Proof. 
Algebras A t are power-associative and for each x A t , we have x 2 t x x + n x = 0 . From here, we have that x m = α m x x + β m x , α m x , β m x K . It results that
x m , y , x n = α m x x + β m x , y , α n x x + β n x = 0 .
Proposition 3.
Let A t , be an algebra obtained by the Cayley–Dickson process. We consider the elements x , y A t , such that the following equality holds:
( x y ¯ + y x ¯ ) 2 = γ 2 n x n y , γ K { 0 } .
Then the algebra < x , y > , generated by x and y , has dimension 1 .
Proof. 
We prove that [ x y ¯ + y x ¯ ] 2 = γ 2 n x n y = γ 2 x x ¯ y y ¯ , for all x , y A , if and only if x = s y , s K . Since x y ¯ + y x ¯ = x y ¯ + x y ¯ ¯ K , therefore, if x = s y , we have relation 12 . Now, supposing that relation 12 is true and if there is not an element s K such that x = s y , then, for a , b K , a 0 , b 0 , we have a x + b y 0 . If we have a x + b y = 0 , it results x = b a y , false. It results that
a x + b y a x + b y ¯ 0 .
from relation 13 , we have
a 2 x x ¯ + a b x y ¯ + b a y x ¯ + b 2 y y ¯ 0 .
In relation 14 , we take a = y y ¯ and we obtain
y y ¯ x x ¯ + b x y ¯ + b y x ¯ + b 2 0 .
If we take b = γ 1 x y ¯ + y x ¯ K , with b 0 and we replace this value in relation 15 , we get γ 2 x x ¯ y y ¯ ( x y ¯ + y x ¯ ) 2 0 , which it is not true. It results that there is an element v K such that x = v y . From here, we have that the dimension of the algebra < x , y > is 1. □
The above proposition generalized Proposition 2.8 from [9].
Proposition 4.
Let A t be an algebra obtained by the Cayley–Dickson process over a field with characteristic not 2 and a   A t .
(1) If a A t K , then the solution in A t of the equation x 2 = a are the solutions in K of the following system:
2 x 0 2 n x = a 0 2 x 0 x i = a i , i { 1 , 2 , , 2 t 1 } ,
where a = i = 0 2 t 1 a i f i , x = i = 0 2 t 1 x i f i , a i , x i K .
(2) If a K , then the solution in A t of the equation x 2 = a are the solutions in K of the following system:
2 x 0 2 n x = a 2 x 0 x i = 0 , i { 1 , 2 , , 2 t 1 } .
Proof. 
(1) Let a A t K , a = i = 0 2 t 1 a i f i . Since A t is a quadratic algebra, we have that x 2 = 2 x 0 x n x = a , therefore 2 x 0 2 n x = a 0 and 2 x 0 x i = a i , i { 1 , 2 , , 2 t 1 } .
(2) Let a K. It results x 2 = 2 x 0 x n x = a . We get 2 x 0 2 n x = a and 2 x 0 x i = 0 , i { 1 , 2 , , 2 t 1 } . If x 0 = 0 , then n x = a . If x 0 0 , then x i = 0 , for all i { 1 , 2 , , 2 t 1 } , and x 0 is the solution in K of the equation x 0 2 = a . □
Remark 3.
Let a A t . We denote a = a 0 + a , a 0 K . Therefore all elements b A t of the form b = τ + θ a , τ , θ K , 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 A t , obtained by the Cayley–Dickson, is not an easy problem, even if t is small, t { 2 , 3 } , 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 A t . 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 A t 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 2 n with real coefficients. For finding roots of the companion polynomial we used some special softs.
Let H 1 , 1 be the real division quaternion algebra, the algebra of the elements of the form a = a 0 · 1 + a 1 e 1 + a 2 e 2 + a 3 e 3 , where a i R , i { 0 , 1 , 2 , 3 } and the elements of basis { 1 , e 1 , e 2 , e 3 } given by the following multiplication table:
·1 e 1 e 2 e 3
11 e 1 e 2 e 3
e 1 e 1 1 e 3 e 2
e 2 e 2 e 3 1 e 1
e 3 e 3 e 2 e 1 1
The norm of a real quaternion a is n a = a 1 2 + a 2 2 + a 3 2 + a 4 2 . For the real quaternion algebra, in [20], the Fibonacci quaternions were defined:
F n = f n + f n + 1 e 1 + f n + 2 e 2 + f n + 3 e 3
and the formula of the norm was given:
n F n = F n F ¯ n = 3 f 2 n + 3 .
Here F ¯ n = f n f n + 1 e 1 f n + 2 e 2 f n + 3 e 3 is the conjugate of the element F n in the algebra H 1 , 1 .
In [19], the authors presented specific formulae for solving the following equation
x 2 + b x + c = 0 ,
with b , c H 1 , 1 .
Proposition 5
([19] Theorem 2.3). Solutions to the quadratic equation
x 2 + b x + c = 0 , b , c H 1 , 1
are:
Case 1. If b , c R and b 2 < 4 c then:
x = 1 2 ( b + e e 1 + f e 2 + g e 3 )
with e 2 + f 2 + g 2 = 4 c b 2 where e , f , g R .
Case 2. If b , c R and b 2 4 c then:
x = b ± b 2 4 c 2
Case 3. If b R , c R then:
x = b 2 ± θ 2 c 1 θ e 1 c 2 θ e 2 c 3 θ e 3 ,
where c = c 0 + c 1 e 1 + c 2 e 2 + c 3 e 3 and
θ = b 2 4 c 0 + b 2 4 c 0 2 + 16 c 1 2 + c 2 2 + c 3 2 2
Case 4. If b R then:
x = ( R e ( b ) ) 2 ( b + T ) 1 ( c N )
with b = b R e ( b ) = I m ( b ) , c = c ( R e ( b ) ) 2 ( b ( R e ( b ) ) 2 ) , where ( T , N ) are chosen in the following way:
(1) T = 0 , N = ( Γ ± Γ 2 4 Ψ ) / 2 , if Δ = 0 , Γ 2 4 Ψ ;
(2) T = ± 2 E Γ , N = Ψ if Δ = 0 , Γ 2 < 4 Ψ ;
(3) T = ± z , N = ( T 3 + Γ T + Δ ) / 2 T if Δ 0 and z is the unique positive solution to the equation:
z 3 + 2 Γ z 2 + ( Γ 2 4 Ψ ) z Δ 2 = 0 ,
where Γ = | b | 2 + 2 R e ( c ) , Ψ = | c | 2 and Δ = 2 R e ( b ¯ c ) .
By using the above results, we will give solutions to the monic quadratic equation x 2 + b x + c = 0 , where b , c H 1 , 1 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:
b = I m ( b ) ,
c = c ( R e ( b ) ) 2 ( b ( R e ( b ) ) 2 ) ,
Γ = n ( b ) + 2 R e ( c ) ,
Δ = 2 R e ( b ¯ c ) ,
Ψ = n ( c ) ,
The above elements help us to compute parameters T , N and then to obtain the solutions. The expression of the solutions depends on the parameters T , N , Δ . The first step is to see when Δ is 0 or not. To compute Δ , we will compute first b and c , where
b = F n = f n + f n + 1 e 1 + f n + 2 e 2 + f n + 3 e 3
c = F m = f m + f m + 1 e 1 + f m + 2 e 2 + f m + 3 e 3
b = b R e ( b ) = I m ( b )
b = f n + 1 e 1 + f n + 2 e 2 + f n + 3 e 3
We obtain the following formulae, whose demonstrations can be found in Appendix A.
c = [ ( 4 f m f n 2 ) + ( 4 f m + 1 2 f n f n + 1 ) e 1 + ( 4 f m + 2 2 f n f n + 2 ) e 2 + ( 4 f m + 3 2 f n f n + 3 ) e 3 ] / 4
Δ = 2 ( f n + 1 f m + 1 + f n + 2 f m + 2 + f n + 3 f m + 3 ) f n ( f n + 1 2 + f n + 2 2 + f n + 3 2 ) .
Remark 4.
(1) The solutions to Equation 16 , in case 4, depends when Δ is zero or not. The question is when Δ = 0 ? From its expression it is clear that, in the most of cases, we have Δ 0 .
(2) When n = m , in relation 23 , we have ( f n + 1 f m + 1 + f n + 2 f m + 2 + f n + 3 f m + 3 ) = ( f n + 1 2 + f n + 2 2 + f n + 3 2 ) . From here, relation Δ = 0 implies 2 f n f n + 1 2 + f n + 2 2 + f n + 3 2 = 0 , therefore, f n = 2 . It results that n = m = 3 . In this particular case, we obtain particular solutions to Equation 16 , 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 16 , 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 21 . must be obtained.
For Γ and Ψ, we have
Γ = 3 f 2 n + 3 3 2 f n 2 + 2 f m
and
Ψ = 3 f 2 m + 3 + f n 2 16 ( f n 2 + 4 f n + 1 2 + 4 f n + 2 2 + 4 f n + 3 2 )
f n 2 ( f m f n + 2 f m + 1 f n + 1 + 2 f m + 2 f n + 2 + 2 f m + 3 f n + 3 )
In the known references, we can find some examples of roots of equations with coefficients in H 1 , 1 . 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:
x 2 + F 3 x + F 3 = 0 ,
where F 3 = f 3 + f 4 e 1 + f 5 e 2 + f 6 e 3 is a Fibonacci quaternion;
x 2 + F 0 x + F 0 = 0 ,
where F 0 = e 1 + e 2 + 2 e 3 is a Fibonacci quaternion
x 2 + F 0 x + F 1 = 0 ,
where F 0 = e 1 + e 2 + 2 e 3 and F 1 = 1 + e 1 + 2 e 2 + 3 e 3 are Fibonacci quaternions.
Proposition 6.
Equation 26 has the following solutions:
x 1 = 1 + α 98 F 3 f 3 ,
x 2 = 1 + β 98 F 3 f 3 ,
where α = 49 + 2499 and β = 49 2499 .
Proof. 
We have n = m = 3 , therefore b = c , then Δ = 0 , from Remark 4. Replacing in formula 25 , for Ψ , we obtain:
Ψ = ( f 3 2 + f 4 2 + f 5 2 + f 6 2 ) + f 3 2 16 ( f 3 2 + 4 f 4 2 + 4 f 5 2 + 4 f 6 2 )
- f n 2 ( f 3 2 + 2 f 4 2 + 2 f 5 2 + 2 f 6 2 )
Ψ = ( 2 2 + 3 2 + 5 2 + 8 2 ) + 1 4 ( 2 2 + 4 · 3 2 + 4 · 5 2 + 4 · 8 2 )
2 2 ( 2 2 + 2 · 3 2 + 2 · 5 2 + 2 · 8 2 )
Ψ = 102 + 396 4 200 = 1 .
Replacing in formula 24 , we obtain:
Γ = 3 f 2 n + 3 3 2 f n 2 + 2 f m
Γ = 3 f 9 3 2 f 3 2 + 2 f 3
Γ = 102 6 + 4 = 100
We are in the first subcase of case 4 from Proposition 5. Therefore T = 0 , N = ( Γ ± Γ 2 4 Ψ ) / 2 . N = ( 100 ± ( 10000 4 ) / 2 , N = 50 ± ( 9996 ) / 2 , N = 50 ± 2499 . It results the following solutions:
x = ( R e ( b ) ) / 2 ( b + T ) 1 ( c N )
x = 1 ( 3 e 1 + 5 e 2 + 8 e 3 ) 1 ( [ ( 4 · 2 2 2 ) + ( 4 · 3 2 · 2 · 3 ) e 1 +
+ ( 4 · 5 2 · 2 · 5 ) e 2 + ( 4 · 8 2 · 2 · 8 ) · e 3 ) ] / 4 ( 50 ± 2499 ) )
x = 1 ( 3 e 1 + 5 e 2 + 8 e 3 ) 1 ( 1 ( 50 ± 2499 ) )
x = 1 ( 3 e 1 + 5 e 2 + 8 e 3 ) 1 ( 49 2499 ) )
We have ( 3 e 1 + 5 e 2 + 8 e 3 ) 1 = 1 98 3 e 1 + 5 e 2 + 8 e 3 . Denoting with α = 49 + 2499 and β = 49 2499 , we obtain the following solutions:
x 1 = 1 + α 98 3 e 1 + 5 e 2 + 8 e 3 = 1 + α 98 F 3 f 3 ,
x 2 = 1 + β 98 3 e 1 + 5 e 2 + 8 e 3 = 1 + β 98 F 3 f 3 .
Proposition 7.
Equation 27 has the following solutions:
x 1 = 3 3 + 3 6 F 0 ,
x 2 = 3 3 3 6 F 0 .
Proof. 
Now, for n = 0 , m = 0 , we have b = F 0 = e 1 + e 2 + 2 e 3 and c = F 0 = e 1 + e 2 + 2 e 3 . It results Δ = 2 ( f n + 1 f m + 1 + f n + 2 f m + 2 + f n + 3 f m + 3 ) f n ( f n + 1 2 + f n + 2 2 + f n + 3 2 ) =
= 2 ( 1 + 1 + 4 ) = 12 . For Ψ , we obtain Ψ = 3 f 2 m + 3 + f n 2 16 ( f n 2 + 4 f n + 1 2 + 4 f n + 2 2 + 4 f n + 3 2 ) f n 2 ( f m f n + 2 f m + 1 f n + 1 + 2 f m + 2 f n + 2 + 2 f m + 3 f n + 3 ) = 3 · 2 = 6 . Γ = 3 f 2 n + 3 3 2 f n 2 + 2 f m = 6 z 3 + 2 Γ z 2 + ( Γ 2 4 Ψ ) z Δ 2 = 0 z 3 + 12 z 2 + 36 48 z 144 = 0
z 3 + 12 z 2 12 z 144 = 0 z = 12 T 1 , 2 = ± 2 3
We have b = b = c = c , therefore, for T 1 = 2 3 , we get
N 1 = ( T 1 3 + Γ T 1 + Δ ) / 2 T 1 = 24 3 + 12 3 + 12 4 3 = 9 3 + 3 3 = 9 + 3 , therefore x 1 = ( b + 2 3 ) 1 ( c 9 3 ) =
= 2 3 + e 1 + e 2 + 2 e 3 1 9 3 + e 1 + e 2 + 2 e 3 =
= 1 18 2 3 e 1 e 2 2 e 3 9 3 + e 1 + e 2 + 2 e 3 =
= 1 18 [ 18 3 + 3 3 + 9 F 0 ] = 3 3 + 3 6 F 0
For T 1 = 2 3 , we have N 2 = 24 3 12 3 + 12 4 3 = 36 3 12 4 3 = 9 3 , therefore
x 2 = 2 3 + e 1 + e 2 + 2 e 3 1 9 + 3 + e 1 + e 2 + 2 e 3 =
= 1 18 2 3 e 1 e 2 2 e 3 9 + 3 + e 1 + e 2 + 2 e 3 =
= 1 18 2 3 + e 1 + e 2 + 2 e 3 9 + 3 + e 1 + e 2 + 2 e 3 =
= 1 18 [ 18 3 + 6 + 9 + 3 3 F 0 6 ] =
= 3 3 3 6 F 0 .
Proposition 8.
Equation 28 has the following solutions:
x 1 , 2 = F ¯ 0 + T 1 , 2 n F 0 + T 1 , 2 ( F 1 N 1 , 2 ) ,
where δ is the real positive solution of the equation z 3 + 16 z 2 + 4 z 324 = 0 and T 1 , 2 = ± δ , N 1 , 2 = ( T 1 , 2 3 + 8 T 1 , 2 + 18 ) / 2 T 1 , 2 .
Proof. 
Now, we take n = 0 , m = 1 . We have F 0 = e 1 + e 2 + 2 e 3 and F 1 = 1 + e 1 + 2 e 2 + 3 e 3 . We have b = b = F 0 and c = c = F 1 . We have Δ = 2 ( f n + 1 f m + 1 + f n + 2 f m + 2 + f n + 3 f m + 3 ) f n ( f n + 1 2 + f n + 2 2 + f n + 3 2 ) = 2 ( 1 + 2 + 6 ) = 18 . For Ψ , we obtain Ψ = 3 f 2 m + 3 + f n 2 16 ( f n 2 + 4 f n + 1 2 + 4 f n + 2 2 + 4 f n + 3 2 ) - f n 2 ( f m f n + 2 f m + 1 f n + 1 + 2 f m + 2 f n + 2 + 2 f m + 3 f n + 3 ) = 3 · 5 = 15 . Γ = 3 f 2 n + 3 3 2 f n 2 + 2 f m = 3 · 2 3 2 · 0 + 2 = 8 z 3 + 2 Γ z 2 + ( Γ 2 4 Ψ ) z Δ 2 = 0 z 3 + 16 z 2 + 4 z 324 = 0 . This equation has a real positive solution δ 3 , 4 . We have T 1 , 2 = ± δ , N 1 , 2 = ( T 1 , 2 3 + 8 T 1 , 2 + 18 ) / 2 T 1 , 2 . Therefore, we get x 1 , 2 = ( F 0 + T 1 , 2 ) 1 ( F 1 N 1 , 2 ) = F ¯ 0 + T 1 , 2 n F 0 + T 1 , 2 ( F 1 N 1 , 2 ) .
We consider now the equation
x 2 + x b + c = 0 ,
with b , c H 1 , 1 , which are not in the cases described in Proposition 5, but can be reduced to these situations. Let p x = x 2 + x b + c . We remark that p x ¯ = x 2 + x b + c ¯ = x ¯ 2 + b ¯ x ¯ + c ¯ . Therefore, if x 0 is a solution to Equation 29 , then its conjugate x ¯ 0 is a solution to the equation
x ¯ 2 + b ¯ x ¯ + c ¯ = 0 ,
called the conjugate of Equation 16 . Conversely, if x 0 is a solution to Equation 30 , then x ¯ 0 is a solution to 29 . This equation can be solved by using Proposition 5. We consider the particular case when b , c are Fibonacci quaternion elements. For this purpose, we must compute the elements
b ¯ = I m ( b ¯ )
c ¯ = c ¯ ( R e ( b ¯ ) / 2 ) ( b ¯ ( R e ( b ¯ ) ) / 2 ) ,
Γ ¯ = n ( b ¯ ) + 2 R e ( c ¯ ) ,
Δ ¯ = 2 R e ( b c ¯ ) ,
Ψ ¯ = n ( c ¯ ) .
We obtain
b ¯ = I m ( b ¯ ) = f n + 1 e 1 f n + 2 e 2 f n + 3 e 3 ,
c ¯ = [ ( 4 f m f n 2 ) ( 4 f m + 1 2 f n f n + 1 ) e 1 ( 4 f m + 2 2 f n f n + 2 ) e 2 - ( 4 f m + 3 2 f n f n + 3 ) e 3 ] / 4 ,
Γ ¯ = 3 f 2 n + 3 3 2 f n 2 + 2 f m ,
Δ ¯ = 2 ( f n + 1 f m + 1 + f n + 2 f m + 2 + f n + 3 f m + 3 ) f n ( f n + 1 2 + f n + 2 2 + f n + 3 2 ) ,
Ψ ¯ = 3 f 2 m + 3 + f n 2 16 ( f n 2 + 4 f n + 1 2 + 4 f n + 2 2 + 4 f n + 3 2 ) f n 2 ( f m f n + 2 f m + 1 f n + 1 + 2 f m + 2 f n + 2 + 2 f m + 3 f n + 3 ) .
From the above remarks, we will solve the following equations:
x 2 + x F 3 + F 3 = 0 ,
where F 3 = f 3 + f 4 e 1 + f 5 e 2 + f 6 e 3 is a Fibonacci quaternion;
x 2 + x F 0 + F 0 = 0 ,
where F 0 = e 1 + e 2 + 2 e 3 is a Fibonacci quaternion
x 2 + x F 0 + F 1 = 0 ,
where F 0 = e 1 + e 2 + 2 e 3 and F 1 = 1 + e 1 + 2 e 2 + 3 e 3 are Fibonacci quaternions.
Proposition 9.
Equation 31 has the following solutions:
z 1 = 1 α 98 F ¯ 3 f 3
and
z 2 = 1 β 98 F ¯ 3 f 3 ,
where α = 49 + 2499 and β = 49 2499 .
Proof. 
For Equation 31 , we consider its conjugate x ¯ 2 + F ¯ 3 x ¯ + F ¯ 3 = 0 . From the above formulae and Proposition 6, we have, Δ ¯ = 0 , Ψ ¯ = 1 , Γ ¯ = 100 , T = 0 , N = ( Γ ¯ ± Γ ¯ 2 4 Ψ ¯ ) / 2 therefore, N = ( 100 ± ( 10000 4 ) / 2 , N = 50 ± ( 9996 ) / 2 , N = 50 ± 2499 , b ¯ = 3 e 1 5 e 2 8 e 3 and c ¯ = 1 . It results the following solutions:
x = ( R e ( b ¯ ) ) / 2 ( b ¯ + T ) 1 ( c ¯ N ) .
x = 1 + ( 3 e 1 + 5 e 2 + 8 e 3 ) 1 ( 1 ( 50 ± 2499 ) )
x = 1 + ( 3 e 1 + 5 e 2 + 8 e 3 ) 1 ( 49 2499 ) )
We have ( 3 e 1 + 5 e 2 + 8 e 3 ) 1 = 1 98 3 e 1 + 5 e 2 + 8 e 3 . Denoting with α = 49 + 2499 and β = 49 2499 , we obtain the following solutions:
x 1 = 1 α 98 3 e 1 + 5 e 2 + 8 e 3 = 1 α 98 F 3 f 3 ,
x 2 = 1 β 98 3 e 1 + 5 e 2 + 8 e 3 = 1 β 98 F 3 f 3 . From here, solutions of Equation (31) are z 1 = x ¯ 1 = 1 α 98 F ¯ 3 f 3 and z 2 = x ¯ 2 = 1 β 98 F ¯ 3 f 3 .
Proposition 10.
Equation 32 has the following solutions:
z 1 = 3 3 + 3 6 F 0
and
z 2 = 3 + 9 + 3 18 F 0 .
Proof. 
For Equation 32 , we consider its conjugate x ¯ 2 + F ¯ 0 x ¯ + F ¯ 0 = 0 . From the above formulae and Proposition 7, we have, Δ ¯ = 12 , Ψ ¯ = 6 , Γ ¯ = 6 . Equation z 3 + 2 Γ z 2 + ( Γ 2 4 Ψ ) z Δ 2 = 0 is the same z 3 + 12 z 2 12 z 144 = 0 , with solution z = 12 , therefore, T 1 , 2 = ± 2 3 . Equation 32 has solution x = ( R e ( b ¯ ) ) / 2 ( b ¯ + T ) 1 ( c ¯ N ) . We have b ¯ = b ¯ = c ¯ = c ¯ = e 1 e 2 2 e 3 , therefore, for T 1 = 2 3 , we have
N 1 = ( T 1 3 + Γ T 1 + Δ ) / 2 T 1 = 24 3 + 12 3 + 12 4 3 = 9 3 + 3 3 = 9 + 3 , therefore x 1 = ( b ¯ + 2 3 ) 1 ( c ¯ 9 3 ) =
= 2 3 e 1 e 2 2 e 3 1 9 3 e 1 e 2 2 e 3 =
= 1 18 2 3 + e 1 + e 2 + 2 e 3 9 + 3 + e 1 + e 2 + 2 e 3 =
= 1 18 [ 18 3 + 3 3 + 9 F 0 ] = 3 + 3 + 3 6 F 0
For T 1 = 2 3 , we have N 2 = 24 3 12 3 + 12 4 3 = 36 3 12 4 3 = 9 3 , therefore,
x 2 = 2 3 e 1 e 2 2 e 3 1 9 + 3 e 1 e 2 2 e 3 =
= 1 18 2 3 + e 1 + e 2 + 2 e 3 9 + 3 e 1 e 2 2 e 3 =
= 1 18 [ 18 3 + 9 3 F 0 ] =
= 3 9 + 3 18 F 0 . From here, solutions of Equation 32 are z 1 = x ¯ 1 = 3 + 3 + 3 6 F ¯ 0 = 3 3 + 3 6 F 0 and z 2 = x ¯ 2 = 3 9 + 3 18 F ¯ 0 = 3 + 9 + 3 18 F 0 .
Proposition 11.
Equation 33 has the following solutions:
z 1 , 2 = F ¯ 0 + T 1 , 2 n F ¯ 0 + T 1 , 2 ( F 1 N 1 , 2 ) ,
where δ is the real positive solution of the equation z 3 + 16 z 2 + 4 z 324 = 0 and T 1 , 2 = ± δ , N 1 , 2 = ( T 1 , 2 3 + 8 T 1 , 2 + 18 ) / 2 T 1 , 2 .
Proof. 
For Equation 33 , we consider its conjugate x ¯ 2 + F ¯ 0 x ¯ + F ¯ 1 = 0 . From the above formulae and Proposition 8, we have Δ ¯ = 18 , Ψ ¯ = 15 , Γ ¯ = 8 . We have F 0 = e 1 + e 2 + 2 e 3 , F 1 = 1 + e 1 + 2 e 2 + 3 e 3 , b ¯ = b ¯ = e 1 e 2 2 e 3 , c ¯ = c ¯ = 1 e 1 2 e 2 3 e 3 . It results in the following equation z 3 + 2 Γ z 2 + ( Γ 2 4 Ψ ) z Δ 2 = 0 z 3 + 16 z 2 + 4 z 324 = 0 . This equation has a real positive solution δ 3 , 4 . We have T 1 , 2 = ± δ ,
N 1 , 2 = ( T 1 , 2 3 + 8 T 1 , 2 + 18 ) / 2 T 1 , 2 . Therefore, we get x 1 , 2 = ( F ¯ 0 + T 1 , 2 ) 1 ( F ¯ 1 N 1 , 2 ) = F 0 + T 1 , 2 n F ¯ 0 + T 1 , 2 ( F ¯ 1 N 1 , 2 ) . From here, we obtain solutions for Equation 33 , the same as for 28 , namely z 1 , 2 = F ¯ 0 + T 1 , 2 n F ¯ 0 + T 1 , 2 ( F 1 N 1 , 2 ) .
Now, we consider the equation
x 2 + A x + x B + C = 0 ,
with A , B , C H 1 , 1 , which are not in the cases described in Proposition 5, but can be reduced to these situations. We have that x 2 + A x + x B + C = x + B 2 + A B x + B A B + C . Denoting y = x + B , σ = A B and η = A B + C , it results the following equation
y 2 + σ y + η = 0 .
which is a 16 -type equation. Therefore, if z is a solution to Equation 34 , then z + B is a solution to Equation 35 and if w is a solution to Equation 35 , therefore w B is a solution to Equation 34 . □
Proposition 12.
Solutions to the equation
x 2 + F 0 x + x F 0 + F m = 0 ,
where F 0 = e 1 + e 2 + 2 e 3 and F m = f m + f m + 1 e 1 + f m + 2 e 2 + f m + 3 e 3 are Fibonacci quaternions,
x 1 , 2 = ± θ 2 F 0 c 1 θ e 1 c 2 θ e 2 c 3 θ e 3 ,
where θ= 2 3 f 2 m + 3 + 6 f m + 36 f m 6 , c 1 = f m + 1 , c 2 = f m + 2 , c 3 = f m + 3
Proof. 
From the above, Equation 36 is equivalent to y 2 + η = 0 , with η = F 0 2 + F m = 6 + F m . Now, we are in case 3 of Proposition 5. We have b = 0 , c 0 = 6 + f m , c 1 = f m + 1 , c 2 = f m + 2 , c 3 = f m + 3 . Therefore,
θ = 4 6 + f m + 4 3 f 2 m + 3 + 6 f m + 36 2 = 2 3 f 2 m + 3 + 6 f m + 36 f m 6 .
The solutions to the equation y 2 + η = 0 are
x 1 , 2 = ± θ 2 c 1 θ e 1 c 2 θ e 2 c 3 θ e 3 .
Solutions to Equation 36 are x 1 , 2 F 0 .
Proposition 13.
With the above notations, solutions to the equation
x 2 + F 0 x + x F 0 + F 2 = 0 ,
are
x 1 = 1 2 e 1 5 2 e 2 9 2 e 3
and
x 2 = 1 + 1 2 e 2 + 1 2 e 3 .
Proof. 
We take m = 2 and we get θ = 2 3 f 7 + 6 f 2 + 36 f 2 6 =
= 2 3 · 13 + 6 + 36 1 6 = 2 81 1 6 = 2 · 2 = 2 . We obtain the following solutions: x 1 , 2 = ± 1 F 0 e 1 3 2 e 2 5 2 e 3 . It results x 1 , 2 = ± 1 e 1 e 2 2 e 3 e 1 3 2 e 2 5 2 e 3 . We have x 1 = 1 2 e 1 5 2 e 2 9 2 e 3 and x 2 = 1 + 1 2 e 2 + 1 2 e 3 . □

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 c , Δ , used in Section 3.
First, we compute c . We have:
c = c ( f n / 2 ) ( b ( f n ) / 2 )
c = c ( f n / 2 ) ( f n + f n + 1 e 1 + f n + 2 e 2 + f n + 3 e 3 ( f n ) / 2 )
c = c f n ( f n + 2 f n + 1 e 1 + 2 f n + 2 e 2 + 2 f n + 3 e 3 ) / 4
c = c ( f n 2 + 2 f n f n + 1 e 1 + 2 f n f n + 2 e 2 + 2 f n f n + 3 e 3 ) / 4
c = [ 4 ( f m + f m + 1 e 1 + f m + 2 e 2 + f m + 3 e 3 ) ( f n 2 + 2 f n f n + 1 e 1 + 2 f n f n + 2 e 2 + 2 f n f n + 3 e 3 ) ] / 4
c = [ 4 f m + 4 f m + 1 e 1 + 4 f m + 2 e 2 + 4 f m + 3 e 3 f n 2 2 f n f n + 1 e 1 2 f n f n + 2 e 2 2 f n f n + 3 e 3 ] / 4
c = [ 4 f m f n 2 + 4 f m + 1 e 1 2 f n f n + 1 e 1 + 4 f m + 2 e 2 2 f n f n + 2 e 2 + 4 f m + 3 e 3 2 f n f n + 3 e 3 ] / 4
c = [ ( 4 f m f n 2 ) + ( 4 f m + 1 2 f n f n + 1 ) e 1 + ( 4 f m + 2 2 f n f n + 2 ) e 2 + ( 4 f m + 3 2 f n f n + 3 ) e 3 ] / 4 .
Now, we compute Δ , We obtain:
Δ = 2 R e ( ( f n + 1 e 1 f n + 2 e 2 f n + 3 e 3 ) c )
Δ = 2 R e ( ( f n + 1 e 1 f n + 2 e 2 f n + 3 e 3 ) [ ( 4 f m f n 2 ) + ( 4 f m + 1 2 f n f n + 1 ) e 1 +
+ ( 4 f m + 2 2 f n f n + 2 ) e 2 + ( 4 f m + 3 2 f n f n + 3 ) e 3 ] / 4 ) =
= 2 R e ( ( f n + 1 e 1 [ ( 4 f m f n 2 ) + ( 4 f m + 1 2 f n f n + 1 ) e 1 +
+ ( 4 f m + 2 2 f n f n + 2 ) e 2 + ( 4 f m + 3 2 f n f n + 3 ) e 3 ) ] / 4
f n + 2 e 2 [ ( 4 f m f n 2 ) + ( 4 f m + 1 2 f n f n + 1 ) e 1 +
+ ( 4 f m + 2 2 f n f n + 2 ) e 2 + ( 4 f m + 3 2 f n f n + 3 ) e 3 ) ] / 4
f n + 3 e 3 [ ( 4 f m f n 2 ) + ( 4 f m + 1 2 f n f n + 1 ) e 1 +
+ ( 4 f m + 2 2 f n f n + 2 ) e 2 + ( 4 f m + 3 2 f n f n + 3 ) e 3 ) ] / 4 ) . Therefore
Δ = 2 R e ( [ f n + 1 e 1 ( 4 f m f n 2 ) + f n + 1 e 1 ( 4 f m + 1 - 2 f n f n + 1 ) e 1 + f n + 1 e 1 ( 4 f m + 2 2 f n f n + 2 ) e 2 +
+ f n + 1 e 1 ( 4 f m + 3 2 f n f n + 3 ) e 3 ] / 4
[ f n + 2 e 2 ( 4 f m f n 2 ) + f n + 2 e 2 ( 4 f m + 1 2 f n f n + 1 ) e 1 + f n + 2 e 2 ( 4 f m + 2 2 f n f n + 2 ) e 2 +
+ f n + 2 e 2 ( 4 f m + 3 2 f n f n + 3 ) e 3 ) ] / 4 [ f n + 3 e 3 ( 4 f m f n 2 ) + f n + 3 e 3 ( 4 f m + 1 2 f n f n + 1 ) e 1 +
+ f n + 3 e 3 ( 4 f m + 2 2 f n f n + 2 ) e 2 + f n + 3 e 3 ( 4 f m + 3 2 f n f n + 3 ) e 3 ) ] / 4 )
Δ = 2 R e ( [ f n + 1 ( 4 f m f n 2 ) e 1 f n + 1 ( 4 f m + 1 2 f n f n + 1 ) + f n + 1 ( 4 f m + 2 2 f n f n + 2 ) e 3
f n + 1 ( 4 f m + 3 2 f n f n + 3 ) e 2 ) ] / 4
[ f n + 2 ( 4 f m f n 2 ) e 2 f n + 2 ( 4 f m + 1 2 f n f n + 1 ) e 3 f n + 2 ( 4 f m + 2 2 f n f n + 2 ) +
+ f n + 2 ( 4 f m + 3 2 f n f n + 3 ) e 1 ] / 4 [ f n + 3 ( 4 f m f n 2 ) e 3 + f n + 3 ( 4 f m + 1 2 f n f n + 1 ) e 2 -
f n + 3 ( 4 f m + 2 2 f n f n + 2 ) e 1 f n + 3 ( 4 f m + 3 2 f n f n + 3 ) ] / 4 )
Δ = 2 ( [ f n + 1 ( 4 f m + 1 2 f n f n + 1 ) + f n + 2 ( 4 f m + 2 2 f n f n + 2 ) f n + 3 ( 4 f m + 3 2 f n f n + 3 ) ] / 4 )
Δ = 2 [ 4 ( f n + 1 f m + 1 + f n + 2 f m + 2 + f n + 3 f m + 3 ) 2 f n ( f n + 1 2 + f n + 2 2 + f n + 3 2 ) ] / 4
Then, we get that
Δ = 2 ( f n + 1 f m + 1 + f n + 2 f m + 2 + f n + 3 f m + 3 ) f n ( f n + 1 2 + f n + 2 2 + f n + 3 2 ) .
For Γ we obtain the following formula
Γ = n ( b ) + 2 R e ( c )
Γ = 3 f 2 n + 3 f n 2 + ( 4 f m f n 2 ) / 2
Γ = 3 f 2 n + 3 f n 2 1 2 f n 2 + 2 f m
Γ = 3 f 2 n + 3 3 2 f n 2 + 2 f m .
For Ψ we get
Ψ = n ( c )
Ψ = ( 4 f m f n 2 ) 2 / 16 + ( 4 f m + 1 2 f n f n + 1 ) 2 / 16 + ( 4 f m + 2 2 f n f n + 2 ) 2 / 16 + ( 4 f m + 3 2 f n f n + 3 ) 2
/ 16 Ψ = ( ( 4 f m ) 2 8 f m f n 2 + f n 4 ) / 16 + ( ( 4 f m + 1 ) 2 16 f m + 1 f n f n + 1 + ( 2 f n f n + 1 ) 2 ) / 16 +
+ ( ( 4 f m + 2 ) 2 - 16 f m + 2 f n f n + 2 + ( 2 f n f n + 2 ) 2 ) / 16 + ( ( 4 f m + 3 ) 2 - 16 f m + 3 f n f n + 3 - ( 2 f n f n + 3 ) 2 ) / 16
Ψ = ( 4 f m ) 2 / 16 f m f n 2 / 2 + f n 4 / 16 + ( 4 f m + 1 ) 2 / 16 f m + 1 f n f n + 1 +
+ ( 2 f n f n + 1 ) 2 / 16 + ( 4 f m + 2 ) 2 / 16 f m + 2 f n f n + 2 + ( 2 f n f n + 2 ) 2 / 16 +
+ ( 4 f m + 3 ) 2 / 16 f m + 3 f n f n + 3 + ( 2 f n f n + 3 ) 2 / 16
Ψ = f m 2 + f m + 1 2 + f m + 2 2 + f m + 3 2 f m f n 2 / 2 + f n 4 / 16 f m + 1 f n f n + 1 +
+ ( f n f n + 1 ) 2 / 4 f m + 2 f n f n + 2 + ( f n f n + 2 ) 2 / 4 f m + 3 f n f n + 3 + ( f n f n + 3 ) 2 / 4
Ψ = ( f m 2 + f m + 1 2 + f m + 2 2 + f m + 3 2 ) + f n 2 16 ( f n 2 + 4 f n + 1 2 + 4 f n + 2 2 + 4 f n + 3 2 )
f n 2 ( f m f n + 2 f m + 1 f n + 1 + 2 f m + 2 f n + 2 + 2 f m + 3 f n + 3 ) . Since f m 2 + f m + 1 2 + f m + 2 2 + f m + 3 2
= 3 f 2 m + 3 , we get
Ψ = 3 f 2 m + 3 + f n 2 16 ( f n 2 + 4 f n + 1 2 + 4 f n + 2 2 + 4 f n + 3 2 ) f n 2 ( f m f n + 2 f m + 1 f n + 1 + 2 f m + 2 f n + 2 + 2 f m + 3 f n + 3 ) .
In the following we compute the elements b ¯ , c ¯ ,
We compute c . We have:
b ¯ = I m ( b ¯ ) = f n + 1 e 1 f n + 2 e 2 f n + 3 e 3
c ¯ = c ¯ ( f n / 2 ) ( b ¯ ( f n ) / 2 ) .
Replacing f n + r with f n + r and f m + r with f m + r , r { 1 , 2 , 3 } , in the formula of the element c, we obtain
c ¯ = [ ( 4 f m f n 2 ) ( 4 f m + 1 2 f n f n + 1 ) e 1 ( 4 f m + 2 2 f n f n + 2 ) e 2 - ( 4 f m + 3 2 f n f n + 3 ) e 3 ] / 4 .
Now, we compute Δ ¯ = 2 R e ( b c ¯ ) . Replacing f n + r with f n + r and f m + r with f m + r , r { 1 , 2 , 3 } , in the formulae of the elements Δ and Γ , we obtain
Δ ¯ = 2 ( f n + 1 f m + 1 + f n + 2 f m + 2 + f n + 3 f m + 3 ) f n ( f n + 1 2 + f n + 2 2 + f n + 3 2 ) ,
the same formula as for Δ ,
Γ ¯ = 3 f 2 n + 3 3 2 f n 2 + 2 f m ,
the same formula as for Γ ,
Ψ ¯ = 3 f 2 m + 3 + f n 2 16 ( f n 2 + 4 f n + 1 2 + 4 f n + 2 2 + 4 f n + 3 2 ) f n 2 ( f m f n + 2 f m + 1 f n + 1 + 2 f m + 2 f n + 2 + 2 f m + 3 f n + 3 ) ,
the same formula as for Ψ .

References

  1. Bremner, M.; Hentzel, I. Identities for Algebras Obtained from the Cayley-Dickson Process. Commun. Algebra 2001, 29, 3523–3534. [Google Scholar] [CrossRef]
  2. Hentzel, I.R. Identities of Cayley-Dickson Algebras. J. Algebr. 1997, 188, 292–309. [Google Scholar] [CrossRef]
  3. Isaev, I.M. Identities of a finite Cayley-Dickson Algebra. Algebra Logika 1984, 23, 407–418. [Google Scholar] [CrossRef]
  4. Racine, M.L. Minimal Identities of Octonions Algebras. J. Algebr. 1988, 115, 251–260. [Google Scholar] [CrossRef] [Green Version]
  5. Zorn, M. Alternative rings and related questions I: Existence of the radical. Ann. of Math. 1941, 42, 676–686. [Google Scholar] [CrossRef]
  6. Schafer, R.D. An Introduction to Nonassociative Algebras; Academic Press: New York, NY, USA, 1966. [Google Scholar]
  7. Schafer, R.D. On the algebras formed by the Cayley-Dickson process. Amer. J. Math. 1954, 76, 435–446. [Google Scholar] [CrossRef]
  8. 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).
  9. 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]
  10. Ludkovsky, S.V. Zeros of Polynomials Over Cayley-Dickson Algebras. Available online: https://arxiv.org/pdf/math/0406048.pdf (accessed on 10 February 2022).
  11. Chapman, A. Factoring Octonion Polynomials. Int. Algebra Comput. 2020, 30, 1457–1463. [Google Scholar] [CrossRef]
  12. Chapman, A. Polynomial Equations over Octonion Algebras. J. Algebra Appl. 2020, 19, 2050102. [Google Scholar] [CrossRef] [Green Version]
  13. 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]
  14. Niven, I. Equations in quaternions. Am. Math. Monthly 1941, 48, 654–661. [Google Scholar] [CrossRef]
  15. Porter, R.M. Quaternionic Linear and Quadratic Equations. J. Nat. Geom. 1997, 11, 101–106. [Google Scholar]
  16. Pumplün, S.; Walcher, S. On the zeros of polynomials over quaternions. Commun. Algebra 2002, 30, 4007–4018. [Google Scholar] [CrossRef]
  17. Serodio, R.; Siu, L.S. Zeros of Quaternion Polynomials. Appl. Math. Lett. 2001, 14, 237–239. [Google Scholar] [CrossRef] [Green Version]
  18. Serodio, R.; Pereira, E.; Vitoria, J. Computing the Zeros of Quaternion Polynomials. Comput. Math. Appl. 2001, 42, 1229–1237. [Google Scholar] [CrossRef] [Green Version]
  19. Huang, L.; Wasin, S. Quadratic Formulas for Quaternions. Appl. Math. Lett. 2002, 15, 533–540. [Google Scholar] [CrossRef] [Green Version]
  20. 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.

Share and Cite

MDPI and ACS Style

Flaut, C.; Zaharia, G. Remarks Regarding Computational Aspects in Algebras Obtained by Cayley–Dickson Process and Some of Their Applications. Mathematics 2022, 10, 1141. https://doi.org/10.3390/math10071141

AMA Style

Flaut C, Zaharia G. Remarks Regarding Computational Aspects in Algebras Obtained by Cayley–Dickson Process and Some of Their Applications. Mathematics. 2022; 10(7):1141. https://doi.org/10.3390/math10071141

Chicago/Turabian Style

Flaut, Cristina, and Geanina Zaharia. 2022. "Remarks Regarding Computational Aspects in Algebras Obtained by Cayley–Dickson Process and Some of Their Applications" Mathematics 10, no. 7: 1141. https://doi.org/10.3390/math10071141

Note that from the first issue of 2016, this journal uses article numbers instead of page numbers. See further details here.

Article Metrics

Back to TopTop