Pauli Gaussian Fibonacci and Pauli Gaussian Lucas Quaternions

: 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.


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 GF n for n > 1 is definedby where GF 0 = i, GF 1 = 1.These recurrence relations also satisfy the following equality GF n = F n + iF 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 GL n for n > 2 is defined by where GL 0 = 2 − i, GL 1 = 1 + 2i.Again, the following equality can be observed 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 respectively, where α and β denote the roots of the characteristic equation for Gaussian Fibonacci sequence and GL 0 , GL 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: The multiplication rules are given by 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: 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 The conjugate and the norm of Pauli quaternions are 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.

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 respectively, where GF n and GL 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 respectively.In order to obtain the recursive relations for Pauli Gaussian Fibonacci and Pauli Gaussian Lucas quaternions, we will consider the relations GF n+2 = GF n + GF n+1 and GL n+2 = GL n + GL n+1 for Gaussian Fibonacci and Gaussian Lucas numbers, respectively.
Definition 2. The conjugates of the Pauli Gaussian Fibonacci quaternion Q p GF n and the Pauli Gaussian Lucas quaternion Q p GL n are defined by respectively.
The addition, subtraction and multiplication of two Pauli Gaussian Fibonacci quaternions Q p GF n and Q p GF m aregiven by and respectively.Note that In this case, the norm of any Pauli Gaussian Fibonacci quaternion can be written as So, the scalar and vectorial part of any Pauli Gaussian Fibonacci quaternion is represented by In addition, Equation (2) can be rewritten in terms of the scalar and vector parts of the Pauli Gaussian Fibonacci quaternion as follows.
With the aid of Equation ( 2), the following Pauli Gaussian Fibonacci quaternion can be expressed as a matrix form Theorem 1.Let Q p GF n , Q p GL n and GF n denote the Gaussian Fibonacci number, Gaussian Lucas number and the Gaussian Fibonacci number, respectively.For n ≥ 1, we get the following relations (i) Proof.(i) Considering Equation (1) and using the identity GF n+1 + GF n−1 = GL n [3], we have the proof as follows (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 By substituting the identity GF n+1 + GF n−1 = GL n [3] into the previous equation we get (iv) Multiplying both sides of the Pauli Gaussian Fibonacci quaternions Then, adding the above equation with Q p GF n yields Theorem 2 (Honsberger's Identity).For n, m ≥ 0 and GF n , the Honsberger identity for the Pauli Gaussian Fibonacci quaternions is given by Proof.By the Equations ( 1) and ( 2), weget Using the identity GF n GF m + GF n+1 GF m+1 = F n+m (1 + 2i) [3], we obtain If the necessary arrangements are made in the last equation, we have 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: Proof.Let us use the definition of a generating function of Q p GF n as follows Multiplying both sides of the Equation (3) by −x and −x 2 gives and If we add the Equations ( 3)-( 5) and use Theorem 1, we conclude that Then, we write Let us write the generating function of Q p GL n as follows 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 2 .(ii) For n ∈ N, the Binet formula of the Pauli Gaussian Lucas quaternions is given by 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 GF n , we get If Equation ( 7) is arranged, we have (ii) Applying Binet's formula of the Gaussian Lucas to Q p GL n , we get Equation ( 8) can be stated in terms of Fibonacci numbers as follows: Furthermore, the above Pauli Gaussian Fibonacci quaternion is written by 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 Proof.Considering the Binet formula in Theorem 4 and making some necessary calculations, the following expression is obtained.
To achieve our purpose, we now put the values cd = dc = i−2 5 , α − β = √ 5 in the above equality.Thus, the proof is completed.
It is well-known that if r = 1 the Cassini identity corresponds to the Cassini identity.Thus, the following corollary can be given.