Next Article in Journal
Adaptive Fuzzy Command Filtered Finite-Time Tracking Control for Uncertain Nonlinear Multi-Agent Systems with Unknown Input Saturation and Unknown Control Directions
Next Article in Special Issue
Almost Repdigit k-Fibonacci Numbers with an Application of k-Generalized Fibonacci Sequences
Previous Article in Journal
Optimization Models for Reducing Off-Cuts of Raw Materials in Construction Site
Previous Article in Special Issue
On the Classification of Telescopic Numerical Semigroups of Some Fixed Multiplicity
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Pauli Gaussian Fibonacci and Pauli Gaussian Lucas Quaternions

by
Ayşe Zeynep Azak
Faculty of Education, Mathematics and Science Education Department, Sakarya University, Sakarya 54300, Turkey
Mathematics 2022, 10(24), 4655; https://doi.org/10.3390/math10244655
Submission received: 10 November 2022 / Revised: 1 December 2022 / Accepted: 5 December 2022 / Published: 8 December 2022

Abstract

:
We have investigated new Pauli Fibonacci and Pauli Lucas quaternions by taking the components of these quaternions as Gaussian Fibonacci and Gaussian Lucas numbers, respectively. We have calculated some basic identities for these quaternions. Later, the generating functions and Binet formulas are obtained for Pauli Gaussian Fibonacci and Pauli Gaussian Lucas quaternions. Furthermore, Honsberger’s identity, Catalan’s and Cassini’s identities have been given for Pauli Gaussian Fibonacci quaternions.

1. Introduction

The set of complex numbers with integer coefficients was first described by Carl Friedrich Gauss, and these numbers were called Gaussiannumbers [1]. Then, Horadam gave the definition of the n-th generalized complex Fibonacci quaternion and provided some identities regarding these numbers. Furthermore, he defined Fibonacci quaternions [2]. Gaussian Fibonacci and Gaussian Lucas sequences were introduced by Jordan. Moreover, some basic identities and summation formulas were obtained [3]. The recurrence relation of the Gaussian Fibonacci numbers G F n for n > 1 is defined by
G F n = G F n 1 + G F n 2
where G F 0 = i , G F 1 = 1 . These recurrence relations also satisfy the following equality G F n = F n + i F n 1 where F n is the n-th Fibonacci number [3,4]. In the same manner, the recurrence relation of the Gaussian Lucas numbers G L n for n > 2 is defined by
G L n = G L n 1 + G L n 2
where G L 0 = 2 i , G L 1 = 1 + 2 i . Again, the following equality can be observed
G L n = L n + i L n 1
where L n is the n-th Lucas number [3,4].
An extension of the Fibonacci numbers to the complex plane was discussed by Berzsenyi [5].
The algebras of the complex numbers, quaternions, octonions, and sedenions are found by using a doubling procedure. This procedure is called as Cayley–Dickson process. In this regard, we extend the field of real numbers to complex numbers via this process. The complex number system is both commutative and associative. However, the quaternions are not commutative, although they are associative. On the other hand, octonions and sedenions are both non-commutative and non-associative. The main question is, why do we need these expanding number systems? It is because quaternions have applications in quantum mechanics, computer graphics, and vision [6,7,8]. Octonions are used in quantum information theory and robotics [9,10]. Sedenions are used in neural networks, time series, and traffic forecasting problems [11,12].
The sequences in finite fields whose terms depend in a simple manner on their predecessors are of importance for a variety of applications. Because it is easy to generate by recursive procedures, and these sequences have advantageous features from the computational viewpoint [13]. Thus, mathematicians increased the number of terms to be added at the beginning and turned to studies on number sequences similar to Fibonacci numbers, such as tribonacci, tetranacci, pentanacci, etc. Later, these studies were carried over to Cayley algebras, see [14,15,16,17,18,19,20,21,22,23,24,25,26,27,28,29,30,31,32]. Thus, one of the most active research areas of recent years has come to the fore, and studies on Cayley algebras have attracted researchers in various ways.
Complex Fibonacci quaternions have been defined by Halici [33]. Then, Binet’s formula, generating functions and the matrix representation of these quaternions have been proven. Recently, n-th quaternion Gaussian Lucas numbers have been introduced to the literature. The Binet formula, some summation formulas, and the Cassini identity have been given by using the matrix representation of Gaussian Lucas numbers [34]. This time, they have expressed the quaternions instead of the Gaussian Lucas numbers by taking the Gaussian Fibonacci coefficients. In this way, the Binet formula, generating function ve some identities regarding the norm of these quaternions have been derived [35].
The Binet formula of the Gaussian Fibonacci sequence and Gaussian Lucas sequence are
G F n = 1 α β 1 i β α n 1 i α β n
and
G L n = α n β n α β G L 1 + α n 1 β n 1 α β G L 0
respectively, where α and β denote the roots of the characteristic equation for Gaussian Fibonacci sequence and G L 0 , G L 1 denote the initial values for the Gaussian Lucas numbers [34,35].
The Pauli matrices that have been introduced by Wolfgang Pauli form a set of 2 × 2 complex matrices as follows:
1 = 1 0 0 1 , σ 1 = 0 1 1 0 , σ 2 = 0 i i 0 , σ 3 = 1 0 0 1
The multiplication rules are given by
σ 1 2 = σ 2 2 = σ 3 2 = 1 , σ 1 σ 2 = σ 2 σ 1 = i σ 3 σ 2 σ 3 = σ 3 σ 2 = i σ 1 , σ 3 σ 1 = σ 1 σ 3 = i σ 2
Further, these matrices are Hermitian and unitary. These 2 × 2 types of Hermitian matrices form a basis for the real vector space and the span of I , i σ 1 , i σ 2 , i σ 3 is isomorphic to the real algebra of quaternions [36,37].
The Pauli quaternions are defined by Kim as follows:
q = a 0 1 + a 1 σ 1 + a 2 σ 2 + a 3 σ 3 ,
where 1 , σ 1 , σ 2 and σ 3 represent the Pauli matrices.
Let q = a 0 1 + a 1 σ 1 + a 2 σ 2 + a 3 σ 3 and p = b 0 1 + b 1 σ 1 + b 2 σ 2 + b 3 σ 3 be Pauli quaternions, then the product of these quaternions are given by [37]
q . p = a 0 b 0 + a 1 b 1 + a 2 b 2 + a 3 b 3 1 + a 0 b 1 + a 1 b 0 + i a 2 b 3 a 3 b 2 σ 1 + a 0 b 2 + a 2 b 0 + i a 3 b 1 a 1 b 3 σ 2 + a 0 b 3 + a 3 b 0 + i a 1 b 2 a 2 b 1 σ 3 .
The conjugate and the norm of Pauli quaternions are
q * = a 0 1 a 1 σ 1 a 2 σ 2 a 3 σ 3
and
N q = q . q * = a 0 2 a 1 2 a 2 2 a 3 2 ,
respectively [37].
Torunbalcı has presented Pauli Fibonacci and Pauli Lucas quaternions by taking the real coefficients of Pauli quaternion as the Fibonacci number sequence. Honsberger’s, d’Ocagne’s, Catalan, Cassini identities, generating function and Binet formula and the matrix representation have been given for the Pauli Fibonacci quaternions [38].
In a recent paper [39] on a base of quaternions, the families of associated sequences of real polynomials and numbers were defined. Quaternion equivalents for quasi-Fibonacci numbers (shortly quaternaccis) were introduced. In OEIS, there is a number of quaternacci sequences connected with generalized Gaussian Fibonacci integers. We are also interested in quaternions with coefficients of Gaussian Fibonacci numbers.
Especially, in this work, our aim is to introduce Pauli Fibonacci quaternions and Pauli Lucas quaternions whose coefficients consist of Gaussian Fibonacci numbers and Gaussian Lucas numbers, respectively. We called these numbers the Pauli Gaussian Fibonacci and Pauli Gaussian Lucas numbers, respectively. Then, some algebraic properties of these quaternions have been shown. Moreover, some identities and formulas for these quaternions have been obtained.

2. The Pauli Gaussian Fibonacci Quaternions

In this section, the definition of Pauli Gaussian Fibonacci and Pauli Gaussian Lucas quaternions will be given. Then, some algebraic properties, identities and theorems are given for Pauli Gaussian Fibonacci and Pauli Gaussian Lucas quaternions.
Definition 1. 
The Pauli Gaussian Fibonacci and Pauli Gaussian Lucas quaternions are defined by
Q p G F n = G F n 1 + G F n + 1 σ 1 + G F n + 2 σ 2 + G F n + 3 σ 3
and
Q p G L n = G L n 1 + G L n + 1 σ 1 + G L n + 2 σ 2 + G L n + 3 σ 3
respectively, where G F n and G L n are the n-th Gaussian Fibonacci and Gaussian Lucas numbers.
Furthermore, these numbers are related to Pauli Fibonacci and Pauli Lucas quaternions as follows
Q p G F n = Q p F n + i Q p F n 1
and
Q p G L n = Q p L n + i Q p L n 1
respectively.
In order to obtain the recursive relations for Pauli Gaussian Fibonacci and Pauli Gaussian Lucas quaternions, we will consider the relations G F n + 2 = G F n + G F n + 1 and G L n + 2 = G L n + G L n + 1 for Gaussian Fibonacci and Gaussian Lucas numbers, respectively.
Hence, for n 0
Q p G F n + 2 = Q p G F n + Q p G F n + 1
and
Q p G L n + 2 = Q p G L n + Q p G L n + 1
respectively.
Definition 2. 
The conjugates of the Pauli Gaussian Fibonacci quaternion Q p G F n and the Pauli Gaussian Lucas quaternion Q p G L n are defined by
Q p G F n ¯ = G F n 1 G F n + 1 σ 1 G F n + 2 σ 2 G F n + 3 σ 3
and
Q p G L n ¯ = G L n 1 G L n + 1 σ 1 G L n + 2 σ 2 G L n + 3 σ 3
respectively.
The addition, subtraction and multiplication of two Pauli Gaussian Fibonacci quaternions Q p G F n and Q p G F m aregiven by
Q p G F n ± Q p G F m = G F n ± G F m . 1 + G F n + 1 ± G F m + 1 σ 1 + G F n + 2 ± G F m + 2 σ 2 + G F n + 3 ± G F m + 3 σ 3
and
Q p G F n × Q p G F m = G F n . G F m + G F n + 1 . G F m + 1 + G F n + 2 . G F m + 2 + G F n + 3 . G F m + 3 . 1 + G F n + 1 . G F m + G F n . G F m + 1 i G F n + 3 . G F m + 2 + i G F n + 2 . G F m + 3 σ 1 + G F n + 2 . G F m + i G F n + 3 . G F m + 1 + G F n . G F m + 2 i G F n + 1 . G F m + 3 σ 2 + G F n + 3 . G F m i G F n + 2 . G F m + 1 + i G F n + 1 . G F m + 2 + G F n . G F m + 3 σ 3
respectively.
Note that Q p G F n × Q p G F m Q p G F m × Q p G F n .
In this case, the norm of any Pauli Gaussian Fibonacci quaternion can be written as
N Q p G F n 2 = Q p G F n × Q p G F n ¯ = G F n 2 G F n + 1 2 G F n + 2 2 G F n + 3 2 .
So, the scalar and vectorial part of any Pauli Gaussian Fibonacci quaternion is represented by
S Q p G F n = G F n , V Q p G F n = G F n + 1 σ 1 + G F n + 2 σ 2 + G F n + 3 σ 3 .
In addition, Equation (2) can be rewritten in terms of the scalar and vector parts of the Pauli Gaussian Fibonacci quaternion as follows.
Q p G F n × Q p G F m = S Q p G F n S Q p G F m + V Q p G F n , V Q p G F m + S Q p G F n V Q p G F m + S Q p G F m V Q p G F n + V Q p G F n V Q p G F m .
With the aid of Equation (2), the following Pauli Gaussian Fibonacci quaternion can be expressed as a matrix form
Q p G F n × Q p G F m = G F n G F n + 1 G F n + 2 G F n + 3 G F n + 1 G F n i G F n + 3 i G F n + 2 G F n + 2 i G F n + 3 G F n i G F n + 1 G F n + 3 i G F n + 2 i G F n + 1 G F n G F m G F m + 1 G F m + 2 G F m + 3 .
Theorem 1. 
Let Q p G F n , Q p G L n and G F n denote the Gaussian Fibonacci number, Gaussian Lucas number and the Gaussian Fibonacci number, respectively. For n 1 , we get the following relations
(i)
Q p G F n + 1 + Q p G F n 1 = Q p G L n
(ii)
Q p G F n + Q p G F n 1 = Q p G F n + 1
(iii)
Q p G F n + 2 Q p G F n 2 = Q p G L n
(iv)
Q p G F n Q p G F n + 1 σ 1 Q p G F n + 2 σ 2 Q p G F n + 3 σ 3 = G F n G F n + 2 G F n + 4 G F n + 6
Proof. 
(i) Considering Equation (1) and using the identity G F n + 1 + G F n 1 = G L n [3], we have the proof as follows
Q p G F n + 1 + Q p G F n 1 = G F n + 1 + G F n 1 . 1 + G F n + 2 + G F n σ 1 + G F n + 3 + G F n + 1 σ 2 + G F n + 4 + G F n + 2 σ 3 = G L n 1 + G L n + 1 σ 1 + G L n + 2 σ 2 + G L n + 3 σ 3 = Q p G L n .
(ii) 
If we use Equation (1) and the recurrence relation of the Gaussian Fibonacci numbers, the proof can be easily seen.
(iii) 
Using Equation (1) and the recurrence relation of the Gaussian Fibonacci numbers, we obtain
Q p G F n + 2 Q p G F n 2 = G F n + 1 + G F n 1 . 1 + G F n + 2 + G F n σ 1 + G F n + 3 + G F n + 1 σ 2 + G F n + 4 + G F n + 2 σ 3 .
By substituting the identity G F n + 1 + G F n 1 = G L n [3] into the previous equation we get
Q p G F n + 2 Q p G F n 2 = Q p G L n .
(iv) 
Multiplying both sides of the Pauli Gaussian Fibonacci quaternions Q p G F n + 1 , Q p G F n + 2 , Q p G F n + 3 by σ 1 , σ 2 and σ 3 respectively gives
Q p G F n + 1 σ 1 Q p G F n + 2 σ 2 Q p G F n + 3 σ 3 = G F n + 1 σ 1 G F n + 2 1 + i G F n + 3 σ 3 i G F n + 4 σ 2 G F n + 2 σ 2 i G F n + 3 σ 3 G F n + 4 1 + i G F n + 5 σ 1 G F n + 3 σ 3 + i G F n + 4 σ 2 i G F n + 5 σ 1 G F n + 6 1 = G F n + 1 σ 1 G F n + 2 σ 2 G F n + 3 σ 3 G F n + 2 + G F n + 4 + G F n + 6 1 .
Then, adding the above equation with Q p G F n yields
Q p G F n Q p G F n + 1 σ 1 Q p G F n + 2 σ 2 Q p G F n + 3 σ 3 = G F n 1 + G F n + 1 σ 1 + G F n + 2 σ 2 + G F n + 3 σ 3 G F n + 1 σ 1 G F n + 2 σ 2 G F n + 3 σ 3 G F n + 2 + G F n + 4 + G F n + 6 1 = G F n G F n + 2 G F n + 4 G F n + 6 1 .
Theorem 2 
(Honsberger’s Identity). For n , m 0 and G F n , the Honsberger identity for the Pauli Gaussian Fibonacci quaternions is given by
Q p G F n × Q p G F m + Q p G F n + 1 × Q p G F m + 1 = 2 Q p G F n + m + 9 F n + m + 1 + 5 F n + m + 2 1 + 2 i .
Proof. 
By the Equations (1) and (2), we get
Q p G F n × Q p G F m + Q p G F n + 1 × Q p G F m + 1 = G F n . G F m + G F n + 1 . G F m + 1 + G F n + 2 . G F m + 2 + G F n + 3 . G F m + 3 + G F n + 1 . G F m + 1 + G F n + 2 . G F m + 2 + G F n + 3 . G F m + 3 + G F n + 4 . G F m + 4 1 + G F n + 1 . G F m + G F n + 2 . G F m + 1 + G F n . G F m + 1 + G F n + 1 . G F m + 2 + i G F n + 2 . G F m + 3 + G F n + 3 . G F m + 4 i G F n + 3 . G F m + 2 + G F n + 4 . G F m + 3 σ 1 + G F n + 2 . G F m + G F n + 3 . G F m + 1 + G F n . G F m + 2 + G F n + 1 . G F m + 3 + i G F n + 3 . G F m + 1 + G F n + 4 . G F m + 2 i G F n + 1 . G F m + 3 + G F n + 2 . G F m + 4 σ 2 + G F n + 3 . G F m + G F n + 4 . G F m + 1 + G F n . G F m + 3 + G F n + 1 . G F m + 4 + i G F n + 1 . G F m + 2 + G F n + 2 . G F m + 3 i G F n + 2 . G F m + 1 + G F n + 3 . G F m + 2 σ 3 .
Using the identity G F n G F m + G F n + 1 G F m + 1 = F n + m 1 + 2 i [3], we obtain
Q p G F n × Q p G F m + Q p G F n + 1 × Q p G F m + 1 = F n + m + F n + m + 2 + F n + m + 4 + F n + m + 6 . 1 + 2 F n + m + 1 σ 1 + F n + m + 2 σ 2 + F n + m + 3 σ 3 1 + 2 i .
If the necessary arrangements are made in the last equation, we have
Q p G F n × Q p G F m + Q p G F n + 1 × Q p G F m + 1 = 2 Q p G F n + m + 9 F n + m + 1 1 + 5 F n + m + 2 1 1 + 2 i .
Thus, the claim is verified. □
Theorem 3 
(Generating Function). The generating functions of the Pauli Gaussian Fibonacci quaternions and Pauli Gaussian Lucas quaternions are as follows:
g x = n = 0 Q p G F n . x n = Q p G F 0 + Q p G F 1 Q p G F 0 x 1 x x 2
and
h x = n = 0 Q p G L n . x n = Q p G L 0 + Q p G L 1 Q p G L 0 x 1 x x 2
respectively.
Proof. 
Let us use the definition of a generating function of Q p G F n as follows
g x = Q p G F 0 + Q p G F 1 . x + Q p G F 2 . x 2 + + Q p G F n . x n +
Multiplying both sides of the Equation (3) by x and x 2 gives
x g x = Q p G F 0 . x Q p G F 1 . x 2 Q p G F 2 . x 3 + Q p G F n . x n + 1
and
x 2 g x = Q p G F 0 . x 2 Q p G F 1 . x 3 Q p G F 2 . x 4 + Q p G F n . x n + 2
If we add the Equations (3)–(5) and use Theorem 1, we conclude that
1 x x 2 g x = Q p G F 0 + Q p G F 1 Q p G F 0 x
Then, we write
g x = n = 0 Q p G F n . x n = Q p G F 0 + Q p G F 1 Q p G F 0 x 1 x x 2 .
Let us write the generating function of Q p G L n as follows
h x = Q p G L 0 + Q p G L 1 . x + Q p G L 2 . x 2 + + Q p G L n . x n +
The proof can be easily seen if we apply a similar method used to prove the generating function for the Pauli Gaussian Fibonacci quaternions to the Equation (6).  □
Now, we will obtain the Binet formulas, which give us the n-th Pauli Gaussian Fibonacci and Pauli Gaussian Lucas quaternions, respectively.
Theorem 4 
(Binet’s Formula). (i) For n 1 , Binet formula of the Pauli Gaussian Fibonacci quaternions is given by
Q p G F n = c α n α ^ + d β n β ^
where c = 1 β i α β , d = 1 + α i α β , α = 1 + 5 2 and β = 1 5 2 .
(ii)  For n N , the Binet formula of the Pauli Gaussian Lucas quaternions is given by
Q p G L n = Q P F n G L 1 + Q P F n 1 G L 0 .
This last formula gives us the relationship between Pauli Fibonacci quaternions and Gaussian Lucas numbers.
Proof. 
(i) Applying the Binet’s formula of the Gaussian Fibonacci to Q p G F n , we get
Q p G F n = c α n α ^ + d β n β ^ 1 + c α n + 1 α ^ + d β n + 1 β ^ σ 1 + c α n + 2 α ^ + d β n + 2 β ^ σ 2 + c α n + 3 α ^ + d β n + 3 β ^ σ 3 .
If Equation (7) is arranged, we have
Q p G F n = c α n 1 + α σ 1 + α 2 σ 2 + α 3 σ 3 + d β n 1 + β σ 1 + β 2 σ 2 + β 3 σ 3 Q p G F n = c α n α ^ + d β n β ^ .
such that
α ^ = 1 + α σ 1 + α 2 σ 2 + α 3 σ 3
and
β ^ = 1 + β σ 1 + β 2 σ 2 + β 3 σ 3 .
(ii) Applying Binet’s formula of the Gaussian Lucas to Q p G L n , we get
Q p G L n = α n β n α β G L 1 + α n 1 β n 1 α β G L 0 1 + α n + 1 β n + 1 α β G L 1 + α n β n α β G L 0 σ 1 + α n + 2 β n + 2 α β G L 1 + α n + 1 β n + 1 α β G L 0 σ 2 + α n + 3 β n + 3 α β G L 1 + α n + 2 β n + 2 α β G L 0 σ 3 .
Equation (8) can be stated in terms of Fibonacci numbers as follows:
Q p G L n = F n 1 + F n + 1 σ 1 + F n + 2 σ 2 + F n + 3 σ 3 G L 1 + F n 1 1 + F n σ 1 + F n + 1 σ 2 + F n + 2 σ 3 G L 0 = Q p F n G L 1 + Q p F n 1 G L 0 .
Example 1. 
Let Q p G F 2 be Pauli Gaussian Fibonacci quaternion. Applying Theorem 4 for n = 2 , we get
Q p G F 2 = 1 β i α 2 1 + α σ 1 + α 2 σ 2 + α 3 σ 3 + 1 + α i β 2 1 + β σ 1 + β 2 σ 2 + β 3 σ 3 5 = 1 + i 1 + 2 + i σ 1 + 3 + 2 i σ 2 + 5 + 3 i σ 3 .
Furthermore, the above Pauli Gaussian Fibonacci quaternion is written by
Q p G F 2 = 11 + 2 σ 1 + 3 σ 2 + 5 σ 3 + i 11 + 1 σ 1 + 2 σ 2 + 3 σ 3 Q p G F 2 = Q p F 2 + i Q p F 1 .
Notice that the real and the imaginary parts of the Pauli Gaussian Fibonacci quaternion correspond Pauli Fibonacci quaternions for n = 2 and n = 1 .
Theorem 5 
(d’Ocagne’s Identity). For n , m 0 , the following identity holds
Q p G F m × Q p G F n + 1 Q p G F m + 1 × Q p G F n = i 2 5 β m α n β ^ α ^ β m α n α ^ β ^ .
Proof. 
Considering the Binet formula in Theorem 4 and making some necessary calculations, the following expression is obtained.
Q p G F m × Q p G F n + 1 Q p G F m + 1 × Q p G F n = c d β m α n + 1 β m + 1 α n β ^ α ^ + α m β n + 1 α m + 1 β n α ^ β ^ = c d β m α n α β β ^ α ^ β m α n α β α ^ β ^ .
To achieve our purpose, we now put the values c d = d c = i 2 5 , α β = 5 in the above equality. Thus, the proof is completed.  □
Theorem 6. 
(Catalan’s Identity) For n 1 , the Catalan identity for the Pauli Gaussian Fibonacci quaternions is
Q p G F n 2 Q p G F n + r × Q p G F n r = 1 n + 1 2 i 5 1 3 + 5 2 r β ^ α ^ + 1 3 5 2 r α ^ β ^ .
Proof. 
Using the Binet formula for Pauli Gaussian Fibonacci quaternions, we have
Q p G F n 2 Q p G F n + r × Q p G F n r = c α n α ^ + d β n β ^ c α n α ^ + d β n β ^ c α n + r α ^ + d β n + r β ^ c α n r α ^ + d β n r β ^ = d c β α n β n + r α n r β ^ α ^ + c d α β n α n + r β n r α ^ β ^ .
Note that we have the following identities
α ^ = 1 + 1 + 5 2 σ 1 + 3 + 5 2 σ 2 + 2 + 5 σ 3 , β ^ = 1 + 1 5 2 σ 1 + 3 5 2 σ 2 + 2 5 σ 3 , α ^ β ^ = 1 5 i σ 1 + 3 5 i σ 2 + 4 + 5 i σ 3 , β ^ α ^ = 1 + 5 i σ 1 + 3 + 5 i σ 2 + 4 5 i σ 3 .
It is well-known that if r = 1 the Cassini identity corresponds to the Cassini identity. Thus, the following corollary can be given.
Corollary 1. 
For n 1 , the Cassini identity for the Pauli Gaussian Fibonacci quaternions is
Q p G F n 2 Q p G F n + 1 × Q p G F n 1 = 1 n + 1 2 i 5 5 5 2 β ^ α ^ + 5 + 5 2 α ^ β ^ .
Example 2. 
Let Q p G F 5 , Q p G F 3 and Q p G F 1 be Pauli Gaussian Fibonacci quaternions. If we consider Theorem 6 for n = 3 and r = 2 , the calculations give the following equality
Q p G F 3 2 Q p G F 5 × Q p G F 1 = 1 4 2 i 5 5 + 3 5 2 1 + 5 i σ 1 + 3 + 5 i σ 2 + 4 5 i σ 3 + 5 3 5 2 1 5 i σ 1 + 3 5 i σ 2 + 4 + 5 i σ 3 = 2 i 5 5 + 15 i σ 1 + 15 + 15 i σ 2 + 20 15 i σ 3 = 2 i 1 + 3 i σ 1 + 3 + 3 i σ 2 + 4 3 i σ 3 .
Catalan identity for n = 3 and r = 2 obtained from Aydın (see [38]), we found
Q p F 3 2 Q p F 5 × Q p F 1 = 1 1 F 2 1 i σ 1 + 3 i σ 2 + 4 + i σ 3 Q p F 3 2 Q p F 5 × Q p F 1 = 1 i σ 1 + 3 i σ 2 + 4 + i σ 3 .
where Q p F 1 , Q p F 3 and Q p F 5 are Pauli Fibonacci quaternions.
Example 3. 
Let Q p G F 3 , Q p G F 2 and Q p G F 1 be Pauli Gaussian Fibonacci quaternions. If we consider Corollary for n = 3 and r = 1 , the calculations give the following equality
Q p G F 3 2 Q p G F 4 × Q p G F 2 = 1 4 2 i 5 5 5 2 1 + 5 i σ 1 + 3 + 5 i σ 2 + 4 5 i σ 3 + 5 + 5 2 1 5 i σ 1 + 3 5 i σ 2 + 4 + 5 i σ 3 = 2 i 5 5 5 i σ 1 + 15 5 i σ 2 + 20 + 5 i σ 3 = 2 i 1 i σ 1 + 3 i σ 2 + 4 + i σ 3 .
On the other hand, if we consider the Cassini identity for n = 3 and r = 1 obtained from Aydın (see [38]), we found
Q p F 3 2 Q p F 4 × Q p F 2 = 1 2 F 1 1 i σ 1 + 3 i σ 2 + 4 + i σ 3 Q p F 3 2 Q p F 4 × Q p F 2 = 1 i σ 1 + 3 i σ 2 + 4 + i σ 3 .
where Q p F 1 , Q p F 2 and Q p F 3 are Pauli Fibonacci quaternions.

3. Conclusions

In this research, we have extended the quaternions in [38] to the complex case by taking the components of Gaussian Fibonacci and Gaussian Lucas numbers. We have obtained some identities and formulas for these special quaternions, which are specific to Fibonacci quaternions. On the other hand, Pauli matrices and Pauli quaternions have applications in many areas, including quantum mechanics and quantum field theory. We believe that it will be a resource for researchers working in these fields.

Funding

This research received no external funding.

Data Availability Statement

Not applicable.

Conflicts of Interest

The author declares no conflict of interest.

References

  1. Gauss, C.F. Theoria Residuorum Biquadraticorum; Commentatio Prima Sumtibus Dieterichtianis, Gottingae; Cambridge University Press: Cambridge, UK, 1832. [Google Scholar]
  2. Horadam, A.F. Complex Fibonacci Numbers and Fibonacci Quaternions. Am. Math. Mon. 1963, 70, 289–291. [Google Scholar] [CrossRef]
  3. Jordan, J.H. Gaussian Fibonacci and Lucas Numbers. Fibonacci Quart. 1965, 3, 315–318. [Google Scholar]
  4. Koshy, T. Fibonacci and Lucas Numbers with Applications; Wiley-Interscience Publication: New York, NY, USA, 2001. [Google Scholar]
  5. Berzsenyi, G. Gaussian Fibonacci Numbers. Fibonacci Quart. 1977, 15, 233–236. [Google Scholar]
  6. Mc Carthy, J.M. Introduction to Theoretical Kinematics; MIT Press: Cambridge, MA, USA, 1990. [Google Scholar]
  7. Shoemake, K. Animation Rotation with Quaternion Curves. In Proceedings of the SIGGRAPH ’85: 12th Annual Conference on Computer Graphics and Interactive Techniques, San Francisco, CA, USA, 22–26 July 1985; Volume 19, pp. 245–254. [Google Scholar]
  8. Silberstein, L. LXXVI. Quaternionic Form of Relativity. Lond. Edinb. Dubl. Phil. Mag. 1912, 23, 790–809. [Google Scholar] [CrossRef] [Green Version]
  9. Blake, C.S. Sporadic SICs and the Normed Division Algebras. Found. Phys. 2017, 47, 1060–1064. [Google Scholar]
  10. Wu, J.; Sun, Y.; Wang, M.; Liu, M. Hand-eye Calibration: 4-D procrustes Analysis Approach. IEEE Trans. Instrum. Meas. 2019, 69, 2966–2981. [Google Scholar] [CrossRef]
  11. Kopp, M.; Kreil, D.; Neun, M.; Jonietz, D.; Martin, H.; Herruzo, P.; Gruca, A.; Soleymani, A.; Wu, F.; Liu, Y.; et al. Traffic4cast at Neurips 2020—Yet More on the Unreasonable Effectiveness of Gridded Geo-spatial Processes. In Proceedings of the NeurIPS 2020 Competition and Demonstration Track, Virtual Event, 6–12 December 2021; Escalante, H.J., Hofmann, K., Eds.; Volume 133, pp. 325–343. [Google Scholar]
  12. Saoud, L.S.; Al-Marzouqi, H. Metacognitive Sedenion-Valued Neural Network and Its Learning Algorithm. IEEE Access 2020, 8, 144823–144838. [Google Scholar] [CrossRef]
  13. Lidl, R.; Niederreiter, H. Introduction to Finite Fields and Their Applications; Cambridge University Press: Cambridge, UK, 1994. [Google Scholar]
  14. Akkus, I.; Kızılaslan, G. On Some Properties of Tribonacci Quaternions. An. Ştiinţ. Univ. Ovidius Constanta 2018, 26, 5–20. [Google Scholar] [CrossRef] [Green Version]
  15. Akyiğit, M.; Hidayet, H.K.; Tosun, M. Fibonacci Generalized Quaternions. Adv. Appl. Clifford Algebr. 2014, 24, 631–641. [Google Scholar] [CrossRef]
  16. Bilgici, G.; Tokeşer, Ü.; Ünal, Z. Fibonacci and Lucas Sedenions. J. Integer Seq. 2017, 20, 1–11. [Google Scholar]
  17. Catarino, P.; Campos, H. From Fibonacci Sequence to More Recent Generalisations. In Mathematics and Its Applications in Science and Engineering; Springer: Cham, Swiztherland, 2022. [Google Scholar]
  18. Cerda-Morales, G. On a Generalization for Tribonacci Quaternions. Mediterr. J. Math. 2017, 14, 239. [Google Scholar] [CrossRef] [Green Version]
  19. Cerda-Morales, G. The Unifying Formula for All Tribonacci-type Octonions Sequences and Their Properties. Konuralp J. Math. 2019, 7, 292–299. [Google Scholar]
  20. Cereceda, J.L. Binet’s formula for generalized tribonacci numbers. Int. J. Math. Edu. Sci. Technol. 2015, 46, 1235–1243. [Google Scholar] [CrossRef]
  21. Flaut, C.; Shpakivskyi, V. On Generalized Fibonacci Quaternions and Fibonacci-Narayana Quaternions. Adv. Appl. Clifford Algebr. 2013, 23, 673–688. [Google Scholar] [CrossRef] [Green Version]
  22. Halici, S.; Karatas, A. On a Generalizaton for Fibonacci Quaternions. Chaos Solitons Fractals 2017, 98, 178–182. [Google Scholar] [CrossRef]
  23. Halici, S. On Fibonacci Quaternions. Adv. Appl. Clifford Algebr. 2017, 22, 321–327. [Google Scholar] [CrossRef]
  24. Iyer, M.R. Some Results on Fibonacci Quaternions. Fibonacci Quart. 1969, 7, 201–210. [Google Scholar]
  25. Karataş, A.; Halıcı, S. Horadam Octonions. An. Ştiinţ. Univ. Ovidius Constanta 2017, 25, 97–106. [Google Scholar] [CrossRef] [Green Version]
  26. Kızılateş, C.; Kirlak, S. A New Generalization of Fibonacci and Lucas Type Sedenions. J. Discret. Math. Sci. Cryptogr. 2022, 1–12. [Google Scholar] [CrossRef]
  27. Savin, D. Some Properties of Fibonacci Numbers, Fibonacci Octonions, and Generalized Fibonacci-Lucas Octonions. Adv. Differ. Equ. 2015, 2015, 298. [Google Scholar] [CrossRef] [Green Version]
  28. Soykan, Y. Tribonacci and Tribonacci-Lucas Sedenions. Mathematics 2019, 7, 74. [Google Scholar] [CrossRef] [Green Version]
  29. Soykan, Y. Tetranacci and Tetranacci-Lucas Quaternions. Asian Res. J. Math. 2019, 15, 1–24. [Google Scholar] [CrossRef] [Green Version]
  30. Soykan, Y.; Okumuş, İ.; Taşdemir, E. On Generalized Tribonacci Sedenions. Sarajevo J. Math. 2020, 16, 103–122. [Google Scholar]
  31. Soykan, Y.; Özmen, N.; Göcen, M. On Generalized Pentanacci Quaternions. Tbil. Math. J. 2020, 13, 169–181. [Google Scholar] [CrossRef]
  32. Spickerman, W.R. Binet’s Formula for the Tribonacci Sequence. Fibonacci Quart. 1982, 20, 118–120. [Google Scholar]
  33. Halici, S. On Complex Fibonacci Quaternions. Am. Math. Mon. 2013, 23, 105–112. [Google Scholar] [CrossRef]
  34. Halici, S. On Quaternion-Gaussian Lucas Numbers. Math. Meth. Appl. Sci. 2021, 44, 7601–7606. [Google Scholar] [CrossRef]
  35. Halici, S.; Cerda-Morales, G. On Quaternion-Gaussian Fibonacci Numbers and Their Properties. An. Ştiinţ. Univ. Ovidius Constanta 2021, 29, 71–82. [Google Scholar] [CrossRef]
  36. Condon, E.U.; Morse, P.M. Quantum Mechanics; McGraw-Hill: New York, NY, USA, 1929. [Google Scholar]
  37. Kim, J.E. A Representation of de Moivre’s Formula Over Pauli Quaternions. Ann. Acad. Rom. Sci. Ser. Math. Appl. 2017, 9, 145–151. [Google Scholar]
  38. Aydın, F.T. Pauli-Fibonacci Quaternions. Notes Number Theory Discret. Math. 2021, 27, 184–193. [Google Scholar] [CrossRef]
  39. Bajorska-Harapińska, B.; Smoleń, B.; Wituła, R. On Quaternion Equivalents for Quasi-Fibonacci Numbers, Shortly Quaternaccis. Adv. Appl. Clifford Algebr. 2019, 29, 54. [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

Azak, A.Z. Pauli Gaussian Fibonacci and Pauli Gaussian Lucas Quaternions. Mathematics 2022, 10, 4655. https://doi.org/10.3390/math10244655

AMA Style

Azak AZ. Pauli Gaussian Fibonacci and Pauli Gaussian Lucas Quaternions. Mathematics. 2022; 10(24):4655. https://doi.org/10.3390/math10244655

Chicago/Turabian Style

Azak, Ayşe Zeynep. 2022. "Pauli Gaussian Fibonacci and Pauli Gaussian Lucas Quaternions" Mathematics 10, no. 24: 4655. https://doi.org/10.3390/math10244655

APA Style

Azak, A. Z. (2022). Pauli Gaussian Fibonacci and Pauli Gaussian Lucas Quaternions. Mathematics, 10(24), 4655. https://doi.org/10.3390/math10244655

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