In mathematics, Gaussian brackets are a special notation invented by Carl Friedrich Gauss to represent the convergents of a simple continued fraction in the form of a simple fraction. Gauss used this notation in the context of finding solutions of the indeterminate equations of the form .[1]
This notation should not be confused with the widely prevalent use of square brackets to denote the greatest integer function: denotes the greatest integer less than or equal to . This notation was also invented by Gauss and was used in the third proof of the quadratic reciprocity law. The notation , denoting the floor function, is now more commonly used to denote the greatest integer less than or equal to .[2]
The notation
The Gaussian brackets notation is defined as follows:[3][4]
![{\displaystyle {\begin{aligned}\quad [\,\,]&=1\\[1mm][a_{1}]&=a_{1}\\[1mm][a_{1},a_{2}]&=[a_{1}]a_{2}+[\,\,]\\[1mm]&=a_{1}a_{2}+1\\[1mm][a_{1},a_{2},a_{3}]&=[a_{1},a_{2}]a_{3}+[a_{1}]\\[1mm]&=a_{1}a_{2}a_{3}+a_{1}+a_{3}\\[1mm][a_{1},a_{2},a_{3},a_{4}]&=[a_{1},a_{2},a_{3}]a_{4}+[a_{1},a_{2}]\\[1mm]&=a_{1}a_{2}a_{3}a_{4}+a_{1}a_{2}+a_{1}a_{4}+a_{3}a_{4}+1\\[1mm][a_{1},a_{2},a_{3},a_{4},a_{5}]&=[a_{1},a_{2},a_{3},a_{4}]a_{5}+[a_{1},a_{2},a_{3}]\\[1mm]&=a_{1}a_{2}a_{3}a_{4}a_{5}+a_{1}a_{2}a_{3}+a_{1}a_{2}a_{5}+a_{1}a_{4}a_{5}+a_{3}a_{4}a_{5}+a_{1}+a_{3}+a_{5}\\[1mm]\vdots &\\[1mm][a_{1},a_{2},\ldots ,a_{n}]&=[a_{1},a_{2},\ldots ,a_{n-1}]a_{n}+[a_{1},a_{2},\ldots ,a_{n-2}]\end{aligned}}}](https://wikimedia.org/api/rest_v1/media/math/render/svg/d109e38af6a6033ff06986702488eb68029d3d29)
The expanded form of the expression can be described thus: "The first term is the product of all n members; after it come all possible products of (n -2) members in which the numbers have alternately odd and even indices in ascending order, each starting with an odd index; then all possible products of (n-4) members likewise have successively higher alternating odd and even indices, each starting with an odd index; and so on. If the bracket has an odd number of members, it ends with the sum of all members of odd index; if it has an even number, it ends with unity."[4]
With this notation, one can easily verify that[3]
![{\displaystyle {\cfrac {1}{a_{1}+{\cfrac {1}{a_{2}+{\cfrac {1}{a_{3}+\cdots {\frac {\ddots }{\cfrac {1}{a_{n-1}+{\frac {1}{a_{n}}}}}}}}}}}}={\frac {[a_{2},\ldots ,a_{n}]}{[a_{1},a_{2},\ldots ,a_{n}]}}}](https://wikimedia.org/api/rest_v1/media/math/render/svg/0a7b41e4855c14f6f2274f4ae5d1d6d5950a86dd)
Properties
- The bracket notation can also be defined by the recursion relation:
![{\displaystyle \,\,[a_{1},a_{2},a_{3},\ldots ,a_{n}]=a_{1}[a_{2},a_{3},\ldots ,a_{n}]+[a_{3},\ldots ,a_{n}]}](https://wikimedia.org/api/rest_v1/media/math/render/svg/9b3cc42fe1309ecb5590a45fcb9b5438fe871d85)
- The notation is symmetric or reversible in the arguments:
![{\displaystyle \,\,[a_{1},a_{2},\ldots ,a_{n-1},a_{n}]=[a_{n},a_{n-1},\ldots ,a_{2},a_{1}]}](https://wikimedia.org/api/rest_v1/media/math/render/svg/4e8bb8c40774dff3b950c9f5bd0d5d26ee9094c1)
- The Gaussian brackets expression can be written by means of a determinant:
![{\displaystyle \,\,[a_{1},a_{2},\ldots ,a_{n}]={\begin{vmatrix}a_{1}&-1&0&0&\cdots &0&0&0\\[1mm]1&a_{2}&-1&0&\cdots &0&0&0\\[1mm]0&1&a_{3}&-1&\cdots &0&0&0\\[1mm]\vdots &&&&&&&\\[1mm]0&0&0&0&\cdots &1&a_{n-1}&-1\\[1mm]0&0&0&0&\cdots &0&1&a_{n}\end{vmatrix}}}](https://wikimedia.org/api/rest_v1/media/math/render/svg/bad35b9d50ef400e9c6e4aeb6e809e2d4ec6920e)
- The notation satisfies the determinant formula (for
use the convention that ): ![{\displaystyle \,\,{\begin{vmatrix}[a_{1},\ldots ,a_{n}]&[a_{1},\ldots ,a_{n-1}]\\[1mm][a_{2},\ldots ,a_{n}]&[a_{2},\ldots ,a_{n-1}]\end{vmatrix}}=(-1)^{n}}](https://wikimedia.org/api/rest_v1/media/math/render/svg/4e9790a9351a80d315b5052c04acf47abb8f7119)
![{\displaystyle [-a_{1},-a_{2},\ldots ,-a_{n}]=(-1)^{n}[a_{1},a_{2},\ldots ,a_{n}]}](https://wikimedia.org/api/rest_v1/media/math/render/svg/131df3070d4797ff6cb28f8dce24db5b45b10727)
- Let the elements in the Gaussian bracket expression be alternatively 0. Then
![{\displaystyle {\begin{aligned}\,\,\quad [a_{1},0,a_{3},0,\ldots ,a_{2m+1}]&=a_{1}+a_{3}+\cdots +a_{2m+1}\\[1mm][a_{1},0,a_{3},0,\ldots ,a_{2m+1},0]&=1\\[1mm][0,a_{2},0,a_{4},\ldots ,a_{2m}]&=1\\[1mm][0,a_{2},0,a_{4},\ldots ,a_{2m},0]&=0\end{aligned}}}](https://wikimedia.org/api/rest_v1/media/math/render/svg/4b3bfa8c7ff4de35ee3d36bf72adda325afaea8d)
Applications
The Gaussian brackets have been used extensively by optical designers as a time-saving device in computing the effects of changes in surface power, thickness, and separation of focal length, magnification, and object and image distances.[4][5]
References
Additional reading
The following papers give additional details regarding the applications of Gaussian brackets in optics.
|