q-analog
Builds on Permutation
Definition
Let be an indeterminate, or a complex number close to . A q-analog of an expression is an expression , depending on , such that . A q-analog of an identity or a theorem is an identity or a theorem about q-analogs that reduces to the original one as . For an integer , the q-integer is and the q-factorial is , with .
Remarks
Example: is a q-analog of , since as . Likewise is a q-analog of . It is the generating function of the number of inversions over the permutations of : . For , the inversion numbers are , and .
Non-example: is not a q-analog of , since as , and for .
The definition by a limit alone does not fix a unique q-analog. In practice a q-analog is chosen because it keeps the structure of the original, such as a recurrence or a combinatorial meaning. Main examples are the Gaussian binomial coefficients, the q-Pochhammer symbol and the q-binomial theorem.
Reading path
To understand this page from the ground up, read these 2 pages in order. The foundations come first.
Show the path as a graph
- no evidence level
- Permutation definition
- q-analog definition
Further reading
About this page
| Tag | CK80HQNHEK |
|---|---|
| URI | m2://CK80HQNHEK |
| Kind | definition |
| Writing | W0 stub |
| MSC | 05A30, 11B65 |
| Defines | q-analog |
| Uses | Permutation |
| Changed | 2 November 2026 |
Markdown · JSON · Edit on GitHub
What this page needs for W1
- a source with a locator (0 of 1)
The writing levels say how complete the text of a page is. They do not measure its truth.
What links here
No page links to this page yet.