q-analog
From Wikipedia, the free encyclopedia
Jump to navigation
Jump to search
In mathematics, a q-analog of a theorem, identity or expression is a generalization involving a new parameter q that returns the original theorem, identity or expression in the limit as q → 1. Typically, mathematicians are interested in q-analogs that arise naturally, rather than in arbitrarily contriving q-analogs of known results. The earliest q-analog studied in detail is the basic hypergeometric series, which was introduced in the 19th century.[1]
q-analogues are most frequently studied in the mathematical fields of combinatorics and special functions. In these settings, the limit q → 1 is often formal, as q is often discrete-valued (for example, it may represent a prime power). q-analogs find applications in a number of areas, including the study of fractals and multi-fractal measures, and expressions for the entropy of chaotic dynamical systems. The relationship to fractals and dynamical systems results from the fact that many fractal patterns have the symmetries of Fuchsian groups in general (see, for example Indra's pearls and the Apollonian gasket) and the modular group in particular. The connection passes through hyperbolic geometry and ergodic theory, where the elliptic integrals and modular forms play a prominent role; the q-series themselves are closely related to elliptic integrals.
q-analogs also appear in the study of quantum groups and in q-deformed superalgebras. The connection here is similar, in that much of string theory is set in the language of Riemann surfaces, resulting in connections to elliptic curves, which in turn relate to q-series.
Contents
1 "Classical" q-theory
1.1 Combinatorial q-analogs
1.2 Cyclic sieving
2 q → 1
3 Applications in the physical sciences
4 See also
5 References
6 External links
"Classical" q-theory
Classical q-theory begins with the q-analogs of the nonnegative integers.[2] The equality
lim q → 1 1 − q n 1 − q = n {\displaystyle \lim
{q\rightarrow 1}{\frac {1-q^{n}}{1-q}}=n} \lim {{q\rightarrow 1}}{\frac {1-q^{n}}{1-q}}=n
suggests that we define the q-analog of n, also known as the q-bracket or q-number of n, to be
[ n ] q
1 − q n 1 − q
1 + q + q 2 + … + q n − 1 . {\displaystyle [n]_{q}={\frac {1-q^{n}}{1-q}}=1+q+q^{2}+\ldots +q^{n-1}.} [n]_{q}={\frac {1-q^{n}}{1-q}}=1+q+q^{2}+\ldots +q^{{n-1}}.
By itself, the choice of this particular q-analog among the many possible options is unmotivated. However, it appears naturally in several contexts. For example, having decided to use [n]q as the q-analog of n, one may define the q-analog of the factorial, known as the q-factorial, by
[ n ] q !
[ 1 ] q ⋅ [ 2 ] q ⋯ [ n − 1 ] q ⋅ [ n ] q
1 − q 1 − q ⋅ 1 − q 2 1 − q ⋯ 1 − q n − 1 1 − q ⋅ 1 − q n 1 − q = 1 ⋅ ( 1 + q ) ⋯ ( 1 + q + ⋯ + q n − 2 ) ⋅ ( 1 + q + ⋯ + q n − 1 ) . {\displaystyle {\begin{aligned}{\big [}n]_{q}!&=[1]_{q}\cdot [2]_{q}\cdots [n-1]_{q}\cdot [n]_{q}\\[6pt]&={\frac {1-q}{1-q}}\cdot {\frac {1-q^{2}}{1-q}}\cdots {\frac {1-q^{n-1}}{1-q}}\cdot {\frac {1-q^{n}}{1-q}}\\[6pt]&=1\cdot (1+q)\cdots (1+q+\cdots +q^{n-2})\cdot (1+q+\cdots +q^{n-1}).\end{aligned}}} {\begin{aligned}{\big [}n]_{q}!&=[1]_{q}\cdot [2]_{q}\cdots [n-1]_{q}\cdot [n]_{q}\\[6pt]&={\frac {1-q}{1-q}}\cdot {\frac {1-q^{2}}{1-q}}\cdots {\frac {1-q^{{n-1}}}{1-q}}\cdot {\frac {1-q^{n}}{1-q}}\\[6pt]&=1\cdot (1+q)\cdots (1+q+\cdots +q^{{n-2}})\cdot (1+q+\cdots +q^{{n-1}}).\end{aligned}}
This q-analog appears naturally in several contexts. Notably, while n! counts the number of permutations of length n, [n]q! counts permutations while keeping track of the number of inversions. That is, if inv(w) denotes the number of inversions of the permutation w and Sn denotes the set of permutations of length n, we have
∑ w ∈ S n q inv ( w ) = [ n ] q ! . {\displaystyle \sum
{w\in S_{n}}q^{{\text{inv}}(w)}=[n]_{q}!.} \sum {{w\in S_{n}}}q^
\text{inv}}(w)}}=[n]_{q}!.
In particular, one recovers the usual factorial by taking the limit as q → 1 {\displaystyle q\rightarrow 1} q\rightarrow 1.
The q-factorial also has a concise definition in terms of the q-Pochhammer symbol, a basic building-block of all q-theories:
[ n ] q ! = ( q ; q ) n ( 1 − q ) n . {\displaystyle [n]_{q}!={\frac {(q;q)_{n}}{(1-q)^{n.} [n]_{q}!={\frac {(q;q)_{n}}{(1-q)^{n}}}.
From the q-factorials, one can move on to define the q-binomial coefficients, also known as Gaussian coefficients, Gaussian polynomials, or Gaussian binomial coefficients:
( n k ) q = [ n ] q ! [ n − k ] q ! [ k ] q ! . {\displaystyle {\binom {n}{k}}_{q}={\frac {[n]_{q}!}{[n-k]_{q}![k]_{q}!}}.} {\binom {n}{k}}_{q}={\frac {[n]_{q}!}{[n-k]_{q}![k]_{q}!}}.
The q-exponential is defined as:
e q x
∑ n
0 ∞ x n [ n ] q ! . {\displaystyle e_{q}^{x}=\sum
{n=0}^{\infty }{\frac {x^{n}}{[n]_{q}!}}.} e_{q}^{x}=\sum {{n=0}}^{\infty }{\frac {x^{n}}{[n]_{q}!}}.
q-trigonometric functions, along with a q-Fourier transform have been defined in this context.
Combinatorial q-analogs
The Gaussian coefficients count subspaces of a finite vector space. Let q be the number of elements in a finite field. (The number q is then a power of a prime number, q = pe, so using the letter q is especially appropriate.) Then the number of k-dimensional subspaces of the n-dimensional vector space over the q-element field equals
( n k ) q . {\displaystyle {\binom {n}{k}}_{q}.} {\binom nk}_{q}.
Letting q approach 1, we get the binomial coefficient
( n k ) , {\displaystyle {\binom {n}{k}},} {\binom nk},
or in other words, the number of k-element subsets of an n-element set.
Thus, one can regard a finite vector space as a q-generalization of a set, and the subspaces as the q-generalization of the subsets of the set. This has been a fruitful point of view in finding interesting new theorems. For example, there are q-analogs of Sperner's theorem and Ramsey theory.[citation needed]
Cyclic sieving
Main article: Cyclic sieving
Let q = (e2πi/n)d be the d-th power of a primitive n-th root of unity. Let C be a cyclic group of order n generated by an element c. Let X be the set of k-element subsets of the n-element set {1, 2, ..., n}. The group C has a canonical action on X given by sending c to the cyclic permutation (1, 2, ..., n). Then the number of fixed points of cd on X is equal to
( n k ) q . {\displaystyle {\binom {n}{k}}_{q}.} {\binom nk}_{q}.
q → 1
Main article: Field with one element
Conversely, by letting q vary and seeing q-analogs as deformations, one can consider the combinatorial case of q
1 as a limit of q-analogs as q → 1 (often one cannot simply let q
1 in the formulae, hence the need to take a limit).
This can be formalized in the field with one element, which recovers combinatorics as linear algebra over the field with one element: for example, Weyl groups are simple algebraic groups over the field with one element.
Applications in the physical sciences
q-analogs are often found in exact solutions of many-body problems.[citation needed] In such cases, the q → 1 limit usually corresponds to relatively simple dynamics, e.g., without nonlinear interactions, while q < 1 gives insight into the complex nonlinear regime with feedbacks.
An example from atomic physics is the model of molecular condensate creation from an ultra cold fermionic atomic gas during a sweep of an external magnetic field through the Feshbach resonance.[3] This process is described by a model with a q-deformed version of the SU(2) algebra of operators, and its solution is described by q-deformed exponential and binomial distributions.
See also
List of q-analogs
Stirling number
Young tableau
References
Andrews, G. E., Askey, R. A. & Roy, R. (1999), Special Functions, Cambridge University Press, Cambridge.
Gasper, G. & Rahman, M. (2004), Basic Hypergeometric Series, Cambridge University Press, ISBN 0521833574.
Ismail, M. E. H. (2005), Classical and Quantum Orthogonal Polynomials in One Variable, Cambridge University Press.
Koekoek, R. & Swarttouw, R. F. (1998), The Askey-scheme of hypergeometric orthogonal polynomials and its q-analogue, 98-17, Delft University of Technology, Faculty of Information Technology and Systems, Department of Technical Mathematics and Informatics.
Exton, H. (1983), q-Hypergeometric Functions and Applications, New York: Halstead Press, Chichester: Ellis Horwood, 1983, ISBN 0853124914 , ISBN 0470274530 , ISBN 978-0470274538
Ernst, Thomas (2003). "A Method for q-calculus" (PDF). Journal of Nonlinear Mathematical Physics. 10 (4): 487–525. Bibcode:2003JNMP...10..487E. doi:10.2991/jnmp.2003.10.4.5. Retrieved 2011-07-27.
C. Sun; N. A. Sinitsyn (2016). "Landau-Zener extension of the Tavis-Cummings model: Structure of the solution". Phys. Rev. A. 94 (3): 033808. arXiv:1606.08430. Bibcode:2016PhRvA..94c3808S. doi:10.1103/PhysRevA.94.033808.
External links
Hazewinkel, Michiel, ed. (2001) [1994], "Umbral calculus", Encyclopedia of Mathematics, Springer Science+Business Media B.V. / Kluwer Academic Publishers, ISBN 978-1-55608-010-4
q-analog from MathWorld
q-bracket from MathWorld
q-factorial from MathWorld
q-binomial coefficient from MathWorld
Categories:
CombinatoricsQ-analogs
Navigation menu
Not logged in
Talk
Contributions
Create account
Log in
Article
Talk
Read
Edit
View history
Search
Main page
Contents
Featured content
Current events
Random article
Donate to Wikipedia
Wikipedia store
Interaction
Help
About Wikipedia
Community portal
Recent changes
Contact page
Tools
What links here
Related changes
Upload file
Special pages
Permanent link
Page information
Wikidata item
Cite this page
In other projects
Wikimedia Commons
Print/export
Download as PDF
Printable version
Languages
Français
한국어
日本語
Polski
Русский
Suomi
中文
Edit links
This page was last edited on 14 March 2020, at 19:55 (UTC).
Text is available under the Creative Commons Attribution-ShareAlike License; additional terms may apply. By using this site, you agree to the Terms of Use and Privacy Policy. Wikipedia® is a registered trademark of the Wikimedia Foundation, Inc., a non-profit organization.
Privacy policy
About Wikipedia
Disclaimers
Contact Wikipedia
Developers
Statistics
Cookie statement
Mobile view
Wikimedia Foundation
Powered by MediaWiki
