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.
Keywords:
Pauli matrix; Pauli quaternion; Fibonacci quaternion; Pauli Gaussian Fibonacci quaternion; Pauli Gaussian Lucas quaternion MSC:
11B37; 11B39; 20G20
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 for is defined by
where . These recurrence relations also satisfy the following equality where is the n-th Fibonacci number [3,4]. In the same manner, the recurrence relation of the Gaussian Lucas numbers for is defined by
where . Again, the following equality can be observed
where 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
and
respectively, where and denote the roots of the characteristic equation for Gaussian Fibonacci sequence and 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 complex matrices as follows:
The multiplication rules are given by
Further, these matrices are Hermitian and unitary. These types of Hermitian matrices form a basis for the real vector space and the span of is isomorphic to the real algebra of quaternions [36,37].
The Pauli quaternions are defined by Kim as follows:
where and represent the Pauli matrices.
Let and be Pauli quaternions, then the product of these quaternions are given by [37]
The conjugate and the norm of Pauli quaternions are
and
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
and
respectively, where and are the n-th Gaussian Fibonacci and Gaussian Lucas numbers.
Furthermore, these numbers are related to Pauli Fibonacci and Pauli Lucas quaternions as follows
and
respectively.
In order to obtain the recursive relations for Pauli Gaussian Fibonacci and Pauli Gaussian Lucas quaternions, we will consider the relations and for Gaussian Fibonacci and Gaussian Lucas numbers, respectively.
Hence, for
and
respectively.
Definition 2.
The conjugates of the Pauli Gaussian Fibonacci quaternion and the Pauli Gaussian Lucas quaternion are defined by
and
respectively.
The addition, subtraction and multiplication of two Pauli Gaussian Fibonacci quaternions and 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 , and denote the Gaussian Fibonacci number, Gaussian Lucas number and the Gaussian Fibonacci number, respectively. For , we get the following relations
(i)
(ii)
(iii)
(iv)
Proof.
- (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 obtainBy substituting the identity [3] into the previous equation we get
- (iv)
- Multiplying both sides of the Pauli Gaussian Fibonacci quaternions , by and respectively gives
Then, adding the above equation with yields
□
Theorem 2
(Honsberger’s Identity). For and , the Honsberger identity for the Pauli Gaussian Fibonacci quaternions is given by
Proof.
Using the identity [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:
and
respectively.
Proof.
Let us use the definition of a generating function of as follows
Then, we write
Let us write the generating function of 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 , Binet formula of the Pauli Gaussian Fibonacci quaternions is given by
where , , and
(ii)
For , 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 , we get
If Equation (7) is arranged, we have
such that
and
(ii) Applying Binet’s formula of the Gaussian Lucas to , we get
Equation (8) can be stated in terms of Fibonacci numbers as follows:
□
Example 1.
Let be Pauli Gaussian Fibonacci quaternion. Applying Theorem 4 for , we get
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 and .
Theorem 5
(d’Ocagne’s Identity). For , 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 in the above equality. Thus, the proof is completed. □
Theorem 6.
(Catalan’s Identity) For , the Catalan identity for the Pauli Gaussian Fibonacci quaternions is
Proof.
Using the Binet formula for Pauli Gaussian Fibonacci quaternions, we have
Note that we have the following identities
□
It is well-known that if the Cassini identity corresponds to the Cassini identity. Thus, the following corollary can be given.
Corollary 1.
For , the Cassini identity for the Pauli Gaussian Fibonacci quaternions is
Example 2.
Let and be Pauli Gaussian Fibonacci quaternions. If we consider Theorem 6 for and , the calculations give the following equality
Catalan identity for and obtained from Aydın (see [38]), we found
where and are Pauli Fibonacci quaternions.
Example 3.
Let and be Pauli Gaussian Fibonacci quaternions. If we consider Corollary for and , the calculations give the following equality
On the other hand, if we consider the Cassini identity for and obtained from Aydın (see [38]), we found
where and 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
- Gauss, C.F. Theoria Residuorum Biquadraticorum; Commentatio Prima Sumtibus Dieterichtianis, Gottingae; Cambridge University Press: Cambridge, UK, 1832. [Google Scholar]
- Horadam, A.F. Complex Fibonacci Numbers and Fibonacci Quaternions. Am. Math. Mon. 1963, 70, 289–291. [Google Scholar] [CrossRef]
- Jordan, J.H. Gaussian Fibonacci and Lucas Numbers. Fibonacci Quart. 1965, 3, 315–318. [Google Scholar]
- Koshy, T. Fibonacci and Lucas Numbers with Applications; Wiley-Interscience Publication: New York, NY, USA, 2001. [Google Scholar]
- Berzsenyi, G. Gaussian Fibonacci Numbers. Fibonacci Quart. 1977, 15, 233–236. [Google Scholar]
- Mc Carthy, J.M. Introduction to Theoretical Kinematics; MIT Press: Cambridge, MA, USA, 1990. [Google Scholar]
- 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]
- Silberstein, L. LXXVI. Quaternionic Form of Relativity. Lond. Edinb. Dubl. Phil. Mag. 1912, 23, 790–809. [Google Scholar] [CrossRef]
- Blake, C.S. Sporadic SICs and the Normed Division Algebras. Found. Phys. 2017, 47, 1060–1064. [Google Scholar]
- 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]
- 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]
- Saoud, L.S.; Al-Marzouqi, H. Metacognitive Sedenion-Valued Neural Network and Its Learning Algorithm. IEEE Access 2020, 8, 144823–144838. [Google Scholar] [CrossRef]
- Lidl, R.; Niederreiter, H. Introduction to Finite Fields and Their Applications; Cambridge University Press: Cambridge, UK, 1994. [Google Scholar]
- Akkus, I.; Kızılaslan, G. On Some Properties of Tribonacci Quaternions. An. Ştiinţ. Univ. Ovidius Constanta 2018, 26, 5–20. [Google Scholar] [CrossRef]
- Akyiğit, M.; Hidayet, H.K.; Tosun, M. Fibonacci Generalized Quaternions. Adv. Appl. Clifford Algebr. 2014, 24, 631–641. [Google Scholar] [CrossRef]
- Bilgici, G.; Tokeşer, Ü.; Ünal, Z. Fibonacci and Lucas Sedenions. J. Integer Seq. 2017, 20, 1–11. [Google Scholar]
- 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]
- Cerda-Morales, G. On a Generalization for Tribonacci Quaternions. Mediterr. J. Math. 2017, 14, 239. [Google Scholar] [CrossRef]
- Cerda-Morales, G. The Unifying Formula for All Tribonacci-type Octonions Sequences and Their Properties. Konuralp J. Math. 2019, 7, 292–299. [Google Scholar]
- Cereceda, J.L. Binet’s formula for generalized tribonacci numbers. Int. J. Math. Edu. Sci. Technol. 2015, 46, 1235–1243. [Google Scholar] [CrossRef]
- Flaut, C.; Shpakivskyi, V. On Generalized Fibonacci Quaternions and Fibonacci-Narayana Quaternions. Adv. Appl. Clifford Algebr. 2013, 23, 673–688. [Google Scholar] [CrossRef]
- Halici, S.; Karatas, A. On a Generalizaton for Fibonacci Quaternions. Chaos Solitons Fractals 2017, 98, 178–182. [Google Scholar] [CrossRef]
- Halici, S. On Fibonacci Quaternions. Adv. Appl. Clifford Algebr. 2017, 22, 321–327. [Google Scholar] [CrossRef]
- Iyer, M.R. Some Results on Fibonacci Quaternions. Fibonacci Quart. 1969, 7, 201–210. [Google Scholar]
- Karataş, A.; Halıcı, S. Horadam Octonions. An. Ştiinţ. Univ. Ovidius Constanta 2017, 25, 97–106. [Google Scholar] [CrossRef]
- 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]
- Savin, D. Some Properties of Fibonacci Numbers, Fibonacci Octonions, and Generalized Fibonacci-Lucas Octonions. Adv. Differ. Equ. 2015, 2015, 298. [Google Scholar] [CrossRef]
- Soykan, Y. Tribonacci and Tribonacci-Lucas Sedenions. Mathematics 2019, 7, 74. [Google Scholar] [CrossRef]
- Soykan, Y. Tetranacci and Tetranacci-Lucas Quaternions. Asian Res. J. Math. 2019, 15, 1–24. [Google Scholar] [CrossRef]
- Soykan, Y.; Okumuş, İ.; Taşdemir, E. On Generalized Tribonacci Sedenions. Sarajevo J. Math. 2020, 16, 103–122. [Google Scholar]
- Soykan, Y.; Özmen, N.; Göcen, M. On Generalized Pentanacci Quaternions. Tbil. Math. J. 2020, 13, 169–181. [Google Scholar] [CrossRef]
- Spickerman, W.R. Binet’s Formula for the Tribonacci Sequence. Fibonacci Quart. 1982, 20, 118–120. [Google Scholar]
- Halici, S. On Complex Fibonacci Quaternions. Am. Math. Mon. 2013, 23, 105–112. [Google Scholar] [CrossRef]
- Halici, S. On Quaternion-Gaussian Lucas Numbers. Math. Meth. Appl. Sci. 2021, 44, 7601–7606. [Google Scholar] [CrossRef]
- 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]
- Condon, E.U.; Morse, P.M. Quantum Mechanics; McGraw-Hill: New York, NY, USA, 1929. [Google Scholar]
- 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]
- Aydın, F.T. Pauli-Fibonacci Quaternions. Notes Number Theory Discret. Math. 2021, 27, 184–193. [Google Scholar] [CrossRef]
- 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. |
© 2022 by the author. 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/).