The Fibonacci octonions (Q2340059): Difference between revisions

For \(n \geq 0\), any \(n\)-th Fibonacci and Lucas octonions are defined by \[ Q_n = \sum_{s=0}^7 F_{n+s}{\mathbf e}_s \, \text{ and }\, T_n = \sum_{s=0}^7 L_{n+s}{\mathbf e}_s, \] respectively, where \(F_n\) and \(L_n\) are respectively, the \(n\)-th Fibonacci and Lucas numbers and \(({\mathbf e}_1, {\mathbf e}_2, ..., {\mathbf e}_7)\) is the standard octonion basis. Six theorems are proved. { Theorem 2.3} The generating function for the Fibonacci octonin \(Q_n\) is \[ g(x) = \frac{1}{1-x-x^2}\sum_{s=0}^7 (F_s + F_{s-1}x){\mathbf e}_s. \] { Theorem 2.4} For \(n \geq 0\), the Binet Formulae for the Fibonacci and Lucas octonions are \[ Q_n = \frac{\alpha^*\alpha^n - \beta^*\beta^n}{\alpha - \beta}\, \text{and }\, T_n = \alpha^*\alpha^n + \beta^*\beta^n, \] respectively, where \(\alpha^* = \sum\limits_{s=0}^7 \alpha^s {\mathbf e}_s\) and \(\beta^* = \sum\limits_{s=0}^7 \beta^s {\mathbf e}_s\). { Theorem 2.5} For the integer number \(m\) and the natural number \(n\), the generating function of the octonion \(Q_{m+n}\) is \[ \sum_{n=0}^{\infty} Q_{m+n} x^n = \frac{Q_m + q_{m-1}x}{1 - x- x^2}. \] { Theorem 2.6} For the integer numbers \(n\) and \(r\), we have \[ Q^2_n - Q_{n+r}Q_{n-r} = (-1)^{n+r}[F_r^2T_0 - F_{2r}(Q_0 - 14{\mathbf e}_5 - 14{\mathbf e}_6 - 7{\mathbf e}_7)]. \] { Theorem 2.7} For the integer number \(n\), we have \[ Q_{n+1}Q_{n-1} - Q_{n}^2 = (-1)^{n}[T_0 - Q_0 + 14{\mathbf e}_5 + 14{\mathbf e}_6 + 7{\mathbf e}_7)]. \] { Theorem 2.8} For the integer numbers \(n\) and \(r\), we have \[ Q_{m+1}Q_n - Q_{m}Q_{n+1} = (-1)^{m}[F_{n-m}T_0 + L_{n-m}(Q_0 - 14{\mathbf e}_5 - 14{\mathbf e}_6 - 7{\mathbf e}_7)]. \]