An analogue of big q-Jacobi polynomials in the algebra of symmetric functions
Grigori Olshanski

TL;DR
This paper constructs a new five-parameter family of bases in the algebra of symmetric functions, extending properties of orthogonal polynomials and linking to infinite-dimensional q-Beta distributions.
Contribution
It introduces a novel inhomogeneous basis in symmetric functions, utilizing big q-Jacobi polynomials and multivariate interpolation polynomials for infinite variables.
Findings
Bases are orthogonal in weighted Hilbert spaces.
Embedded algebra of symmetric functions into continuous functions on Omega.
Connected to infinite-dimensional q-Beta distributions.
Abstract
The main result of the paper is a construction of a five-parameter family of new bases in the algebra of symmetric functions. These bases are inhomogeneous and share many properties of systems of orthogonal polynomials on an interval of the real line. This means, in particular, that the algebra of symmetric functions is embedded into the algebra of continuous functions on a certain compact space Omega, and under this realization, our bases turn into orthogonal bases of weighted Hilbert spaces corresponding to certain probability measures on Omega. These measures are of independent interest --- they are an infinite-dimensional analogue of the multidimensional q-Beta distributions. Our construction uses the big q-Jacobi polynomials and an extension of the Knop-Okounkov-Sahi multivariate interpolation polynomials to the case of infinite number of variables.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
;
An analogue of big -Jacobi polynomials in the algebra of symmetric functions
Grigori Olshanski
Institute for Information Transmission Problems of the Russian Academy of Sciences, Moscow, Russia;
Skolkovo Institute of Science and Technology (Skoltech), Moscow, Russia
To the memory of Mikhail Semenovich Agranovich
Abstract.
It is well known how to construct a system of symmetric orthogonal polynomials with an arbitrary finite number of variables out of an arbitrary system of orthogonal polynomials on the real line. In the special case of the big -Jacobi polynomials, the number of variables can be made infinite. As a result, in the algebra of symmetric functions, there arises an inhomogeneous basis whose elements are orthogonal with respect to some probability measure. This measure is defined on a certain space of infinite point configurations and hence determines a random point process.
Key words and phrases:
big q-Jacobi polynomials; interpolation polynomials; symmetric functions; Schur functions; beta distribution
The present research was carried out at the Institute for Information Transmission Problems of the Russian Academy of Sciences at the expense of the Russian Science Foundation (project 14-50-00150).
1. Introduction
Let denote the algebra of symmetric functions over . The main result of the paper is a construction of a five-parameter family of new bases in . These bases are inhomogeneous and share many properties of systems of orthogonal polynomials on a segment. This means, in particular, that is realized as a dense subalgebra of , the algebra of continuous functions on a certain compact space , and under this realization, our bases turn into orthogonal bases of Hilbert spaces on with respect to certain probability measures. Those measures on are of independent interest — they are an infinite-dimensional analogue of multidimensional -Beta distributions. Important elements of our construction are: 1) the big -Jacobi polynomials; 2) a generalization of the Knop-Okounkov-Sahi multivariate interpolation polynomials to the case of infinite number of variables.
1.1. Orthogonal systems in an abstract algebra
We begin with a little formalism. Assume we are given a commutative unital graded algebra over , such that for all and . Further, assume that is a fixed homogeneous basis in containing the unity (here ranges over a set of indices).
Definition 1.1**.**
By an orthogonal system in adapted to a distinguished homogeneous basis we mean the following data:
(i) is an injective homomorphism of the algebra into the algebra of continuous functions on a locally compact space with pointwise operations;
(ii) is a probability Borel measure on such that all functions coming from elements of the algebra are square integrable with respect to ;
(iii) is an inhomogeneous basis in such that
[TABLE]
and
[TABLE]
for all indices and , where the angular brackets denote the inner product in induced by the map .
In the case when (the algebra of polynomials in one variable) with the distinguished basis we obtain the standard definition of a system of orthogonal polynomials on the real line.
Remark 1.2**.**
We attach to a linear functional (an analogue of the moment functional). Namely, given , we expand it on the basis and define as the coefficient of the unity element in this expansion. Then the inner product in takes the form
[TABLE]
and hence depends on the basis only. It also follows that the basis has to be inhomogeneous, because otherwise the inner product will degenerate.
Remark 1.3**.**
In the case , the orthogonal polynomials can be obtained via the Gram–Schmidt orthogonalization process applied to the monomials. In the abstract situation, when the homogeneous components are not necessarily one-dimensional, this method is not directly applicable. Therefore, the very existence of an orthogonal system adapted to a given homogeneous basis should be viewed as a special effect.
1.2. Example: symmetric orthogonal polynomials in variables
Denote by the algebra of symmetric polynomials in variables . Set and take as the distinguished homogeneous basis the Schur polynomials. They are indexed by the partitions of length .
Then there exists a well-known procedure of constructing an orthogonal system in starting from an arbitrary system of orthogonal polynomials on . Namely, the inhomogeneous basis consists of the polynomials
[TABLE]
As the space , one takes the subset of vectors in with coordinates , and the measure on ensuring the orthogonality property of the polynomials has the form
[TABLE]
where is the weight measure of the initial system .
1.3. Results
Recall that denotes the algebra of symmetric functions and take as the distinguished homogeneous basis the Schur symmetric functions . They are indexed by arbitrary partitions . The main result of the paper is Theorem 4.1. Its short formulation, based on Definition 1.1, is the following.
Theorem. * In the algebra there exists a -parameter family of orthogonal systems adapted to the homogeneous basis *:
[TABLE]
Here ranges over the set of partitions; the point in the parentheses denotes the collection of arguments of symmetric functions; the parameter lies in ; the parameters and are real, , ; the parameters and are also subject to some constraints: for instance, a sufficient condition is .
The Hilbert spaces in which the algebra is embedded look as follows. The space is compact and its elements are arbitrary point configurations (=subsets) in the countable set
[TABLE]
(a segment of a two-sided -lattice). The probability measures are a particular case (the degenerate series) of the determinantal measures introduced in [4]. Each of these measures is concentrated on the subset of infinite configurations.
An important role in the construction of the inhomogeneous symmetric functions is played by one more inhomogeneous basis in — the -interpolation symmetric functions . They are an analogue of the -interpolation symmetric polynomials of Knop–Okounkov–Sahi. The symmetric functions can be defined axiomatically, for them there exists an analogue of Okounkov’s combinatorial formula, and their expansion on the Schur functions can be written explicitly (Theorems 2.1 and 2.7).
On the other hand, the functions can be expanded, in an explicit way, on the basis . From this we derive a two-step expansion of the functions on the Schur functions (Theorem 3.4).
The measures and the interpolation symmetric functions seem to be of independent interest.
1.4. Connection with big -Jacobi polynomials
The classical big -Jacobi polynomials are orthogonal on the lattice with a certain weight and can be expressed through the -hypergeometric series (Andrews–Askey’s [2], Koekoek–Swarttouw [7]). In the hierarchy of -orthogonal polynomials, they are next to the Askey–Wilson polynomials, which are at the top level and expressed through .
The procedure described in §1.2 allows one to introduce the -variate symmetric big -Jacobi polynomials, and the latter are exploited in the construction of the symmetric functions . Namely, is obtained from the -variate polynomials with the same index by a limit transition as . Note that in this limit transition, some parameters of the -variate polynomials vary together with .
1.5. Other examples of orthogonal systems in
A “lifting” of the Koornwinder polynomials (which are a multivariate extension of the Askey–Wilson polynomials) to the algebra is described by Rains [20, §7]. However, on the Askey–Wilson–Koornwinder level, the picture looks more complicated; in particular, orthogonality in is understood in a more formal sense (existence of a moment functional).
There are also examples of orthogonal systems in on a much lower level of the hierarchy of hypergeometric polynomials: these are the Meixner and Laguerre symmetric functions (author’s papers [17] and [18], Petrov [19, §9.4.5]).
1.6. Generalization
All the results of the present paper admit an extension to the situation when the distinguished homogeneous basis consists of the Macdonald symmetric functions with two parameters and (the Schur functions are a particular case corresponding to ). However, I decided to separately examine the case first, because this can be achieved by elementary tools, by using explicit determinantal formulas (in the spirit of [16]). In the general case, when , determinantal formulas are absent and the proofs become substantially more complicated.
1.7. Acknowledgment
I am grateful to Vadim Gorin, Leonid Petrov, and especially to Cesar Cuenca for valuable comments.
2. Interpolation symmetric functions
2.1. Notation
The symbols denote partitions, which we identify with the corresponding Young diagrams. We use a standard notation:
length of partition ;
size of partition (=number of boxes in Young diagram) ;
transposing Young diagram ;
;
or means that diagram is contained in diagram .
Recall the notation and for the algebra of symmetric functions over and the algebra of symmetric polynomials in variables over , respectively. Here and in what follows the parameter takes the values . The Schur function with index is denoted by and the Schur polynomial with the same index and variables is denoted by ; a standard agreement is that if .
Next, denote by the real Banach space whose elements are vectors with the norm . It is important for us that the elements can be interpreted as continuous functions on .
Throughout the whole paper is a fixed parameter. To every partition we attach a vector
[TABLE]
Notation of -Pochhammer symbols: if is an arbitrary number, then
[TABLE]
More generally,
[TABLE]
2.2. Interpolation symmetric functions: statement of result
Theorem 2.1**.**
(i)* For each partition there exists a unique, within a scalar factor, symmetric function with the following properties*:**
[TABLE]
(ii)* Moreover, whenever does not contain .*
(iii)* The expansion of the function on the Schur functions has the form*
[TABLE]
where
[TABLE]
(iv)* In what follows we use the normalization in which the constant in front of the sum in (iii) equals . Then*
[TABLE]
where is the hook length corresponding to the box .
The proof is given below in §2.5.
In connection with formula (2.2) it is worth noting that, by definition,
[TABLE]
which agrees with the formula
[TABLE]
It follows from (iii) that
[TABLE]
Furthermore, for there is a combinatorial formula (Theorem 2.7).
2.3. Interpolation symmetric polynomials in variables
For an arbitrary partition and arbitrary natural number we set
[TABLE]
(the number of factors in the numerator equals ). Evidently, lies in the algebra of symmetric polynomials and the top homogeneous component of coincides with the Schur polynomial .
The polynomial is a particular case of multiparameter Schur polynomials (see Macdonald [10, 6th variation]) and also a particular case of the interpolation polynomials studied in the works of Knop [5], Okounkov [12], [13], [14], [15], and Sahi [21], [22] (see also Koornwinder’s survey [9]).
The connection with the notations of these papers is the following. Our polynomial is equal to:
with parameters , in the notation of Knop [5];
, in the notation of Okounkov [12], [13];
, in the notation of Sahi [22].
Proposition 2.2**.**
The expansion of the polynomial on the Schur polynomials has the form
[TABLE]
where the coefficients do not depend on and are given by the formula (2.2).
This expansion is readily obtained from [12, (1.12) and (1.9)] by setting . Here is an independent elementary derivation.
Proof.
(a) Let us prove the formula
[TABLE]
Expanding the left-hand side in (2.5) on the powers of the variable we obtain
[TABLE]
where denotes the elementary symmetric polynomial of degree . This can be rewritten as
[TABLE]
Using the well-known formula [11, Ch. I, §2, Example 3]
[TABLE]
we obtain
[TABLE]
and the desired expression arises after reduction of similar terms in the exponent of . As will be seen in what follows, it is important for us that after cancellation the term containing the product disappears.
(b) Denote by the determinant in the right-hand side of the formula for . Introducing the notation
[TABLE]
we rewrite the matrix elements as
[TABLE]
Next, applying (2.5), we may write
[TABLE]
where
[TABLE]
It follows
[TABLE]
The sum is actually finite, because for the first column of the matrix vanishes due to the factor in the denominator.
The determinant of this matrix is transformed in the following way:
[TABLE]
Note that the latter determinant vanishes whenever for some . Indeed, then for , and hence the matrix elements with indices vanish for , which entails the vanishing of the determinant. Thus, we may assume that for all .
Now we pass from collections to partitions with by setting
[TABLE]
Then the inequalities mean that . Now we rewrite the expressions for the determinants and in terms of .
For the first determinant we obtain
[TABLE]
[TABLE]
[TABLE]
Finally,
[TABLE]
The second determinant is rewritten easily:
[TABLE]
and after division by we obtain .
Substituting these expression in (2.6) we obtain the desired formula for . ∎
By analogy with the definition of the vectors we introduce the following definition: for any ,
[TABLE]
Proposition 2.3**.**
Let and be partitions with .
(i)* If does not contain , then .*
(ii)* , where is defined in (2.3).*
Proof.
(i) Consider the matrix of size with elements
[TABLE]
If does not contain , then there exists at least one index such that . Then for all pairs , such that , the inequality holds. It follows that for every such pair , one of the factors in the expression for vanishes. This in turn implies that and hence .
(ii) A similar argument shows that in the case the matrix is lower triangular. Therefore, its determinant equals the product of the diagonal elements. It follows that
[TABLE]
Extracting from each factor the quantity we obtain
[TABLE]
where the first equality follows from [11, Ch. I, §3, Example 1, (3)] and the second equality is the definition (2.3). ∎
2.4. Approximation
Denote by the subspace in formed by the elements of degree at most , where . In the similar way we define the subspace . These subspaces have finite dimension and the canonical projection determines a projection . Under the condition the latter projection is a linear isomorphism and hence has the inverse:
[TABLE]
Evidently, extends for every .
Definition 2.4**.**
Let us say that a sequence converges to a certain element if and for large enough
[TABLE]
in the finite-dimensional space . Then we write or .
Here are two simple propositions.
Proposition 2.5**.**
The condition of convergence is equivalent to the following:* and as , the coefficients of the expansion of the elements on the Schur polynomials converge to the corresponding coefficients in the expansion of the element on the Schur function.*
Proof.
Under the canonical projection , the Schur function turns into the Schur polynomial for every with . Hence, conversely,
[TABLE]
This makes the proposition evident. ∎
For an arbitrary set
[TABLE]
Proposition 2.6**.**
If , then for any .
Proof.
By virtue of Proposition 2.5 it suffices to check that for any , but this holds true because and in the metric of the space . ∎
2.5. Proof of Theorem 2.1
We apply Propositions 2.2 and 2.3, Definition 2.4, and Propositions 2.5 and 2.6.
Fix a partition and set
[TABLE]
where the coefficients are defined in (2.2).
Note that for any fixed partition . From this and Proposition 2.2 it follows that
[TABLE]
in the sense of Definition 2.4.
Therefore, for any . In particular, this holds for with an arbitrary partition . Note that if , then coincides with , which implies that . Applying Proposition 2.3 we see that whenever does not contain , and .
Thus, we have proved all the claims of Theorem 2.1, except that about uniqueness in (i). But it is a formal consequence of the existence claim, because equals the number of partitions with .
2.6. Combinatorial representation
The theorem below is a complement to Theorem 2.1. Recall the definition of a reverse tableau of shape (see [16, §11]): this is a filling of the boxes of the diagram by numbers which weakly decrease along the rows from left to right and strictly decrease down the columns. We denote by the set of all reverse tableaux of shape and with the values in .
Theorem 2.7**.**
For any partition and any vector the following combinatorial formula holds:**
[TABLE]
where the series on the right absolutely converges, and the same holds with the parentheses removed.
Example 2.8**.**
For the three diagrams , , and , the formula (2.7) gives:
[TABLE]
Note that the result agrees with claim (iii) of Theorem 2.1.
Proof.
(a) Let us check that the series in (2.7) absolutely converges and the same holds with the parentheses removed. Indeed, attach to every vector the following vector with positive coordinates
[TABLE]
Evidently, also lies in .
On the other hand,
[TABLE]
Consequently our series is dominated by the convergent series
[TABLE]
(b) Observe that for there is a combinatorial representation, which is similar to (2.7); the only difference is that the summation is taken over the finite subset consisted of the reverse tableaux with the values in :
[TABLE]
Indeed, this follows (after is a simple reformulation) from a more general result due to Okounkov [13, Theorem III].
On the other hand, we know that
[TABLE]
Setting and taking a formal limit transition as in the combinatorial representation for we obtain (2.7).
In order to justify this limit transition we note that the difference between the infinite series for and the finite series for is a partial sum in (2.7) corresponding to the tableaux from . The estimate given above shows that the absolute value of this partial sum does not exceed
[TABLE]
which tends to zero as . ∎
2.7. Another approach
Let us briefly describe a bit different way of constructing the symmetric functions , which gives the same result. For every we define a projection (an algebra morphism) as the specialization of the th variable at . These projections are consistent with the filtration, and the filtered algebra is canonically isomorphic to (here we substantially use the fact that ). Next, it is readily verified that for any fixed , the elements are consistent with the projections. This allows us to define as the projective limit of these elements.
3. Symmetric functions
3.1. A -analogue of the beta distribution
The classical beta distribution is supported by the segment . It can be carried over to the segment by a linear change of the variable, and in such form it serves as the weight measure for the Jacobi polynomials.
Both variants of the beta distribution, on the segment and on the segment , have -analogues, which, however, substantially differ — they are not reduced to each other by a change of the variable. Moreover, the corresponding systems of orthogonal polynomials (the little and big -Jacobi polynomials) are on different levels of the -hypergeometric hierarchy. We need the second, more complicated, -analogue of the beta distribution, introduced in the note [1] by Andrews and Askey.
Recall that the parameter is fixed and belongs to . We also introduce a quadruple of parameters , where , , and the condition on will appear shortly. The distribution that we need is supported by a bounded countable subset of ,
[TABLE]
and has the form
[TABLE]
where is a normalizing constant factor and
[TABLE]
The condition on is that the weight function must be well defined and strictly positive at all points . The numerator in (3.2) is strictly positive on , so that it is necessary that the same be true for the denominator. The range of parameters satisfying this requirement consists of two parts:
The principal series consists of pairs of complex-conjugate numbers in ; in this case the numbers and are nonzero and complex-conjugate.
The complementary series consists of pairs of reals that lie together in one of the open intervals between two neighboring points of the two-sided infinite sequence
[TABLE]
in this case the numbers and are nonzero reals of the same sign.
The normalization factor is determined from
[TABLE]
As shown in [1], the series on the right can be summed explicitly and the result is given by a multiplicative formula.
3.2. Big -Jacobi polynomials
We denote by the monic orthogonal polynomials on with the weight function given by (3.2). The pair is assumed to be in the principal or complementary series (see above). Here is an explicit formula:
[TABLE]
The symmetry is not evident from (3.3), but it can be verified by making use of a transformation of the hypergeometric series. In the case the formula takes the indeterminate form , but it can be resolved by the limit transition.
The polynomials were called the big -Jacobi polynomials by Andrews and Askey, see their paper [2, pp. 46–49]; see also [6, p. 442, Remarks] (or [7, end of §3.5, Remarks]), [8, §14.5] (the notation in these works is different from ours).
Next, we define the -variate analogues of the polynomials according to the scheme of §1.2:
[TABLE]
where ranges over the set of partitions with .
3.3. Expansion on interpolation polynomials
In what follows the pair of parameters will vary together with , so that we introduce a new notation by setting
[TABLE]
Definition 3.1**.**
We say that a quadruple of parameters is admissible if , , and the pair satisfies one of the following two conditions:
either ,
or and lie together in one of the open intervals between neighboring points of the two-sided infinite sequence
[TABLE]
In other words, belongs to the principal or complementary series, but in the second case it is additionally supposed that and are nonzero and have the same sign; then multiplying by does not take them out the complementary series. The exceptional case is excluded; it is examined separately in §5.2.
In what follows we suppose that the quadruple of parameters is admissible in the sense of Definition 3.1.
Proposition 3.2**.**
The following expansion holds:**
[TABLE]
where the coefficients do not depend on and are given by
[TABLE]
Proof.
We argue as in the proof of Proposition 2.2. Set
[TABLE]
and examine the expansion
[TABLE]
The coefficients , of course, vanish for , so that the series actually terminates. In terms of these coefficients, the desired expansion looks as follows:
[TABLE]
Here the factor arises because of the transformation in the denominator of the formula for , see (2.4).
The coefficients are computed directly from the formula (3.3):
[TABLE]
Substituting them in (3.5) we obtain the desired result. As in the proof of Proposition 2.2, the initial determinant of order is reduced to a determinant of order due to the factors in the denominator. ∎
Combining Propositions 3.2 and 2.2 we immediately obtain
Corollary 3.3**.**
The following expansion holds:**
[TABLE]
where the coefficients and do not depend on and are given by (3.4) and (2.2).
3.4. Construction of symmetric functions
Recall that the quadruple of parameters is assumed to be admissible in the sense of Definition 3.1.
Theorem 3.4**.**
(i)* For any partition there exists a limit in the sense of Definition 2.4*
[TABLE]
(ii)* The symmetric functions are expanded on the interpolation functions and on the Schur functions as follows*:**
[TABLE]
where the coefficients and are given by (3.4) and (2.2).
In particular, it follows from (ii) that the top homogeneous component of the function coincides with the Schur function , which in turn implies that the elements form a basis in .
Proof.
Observe that
[TABLE]
Then it is seen from the formula of Corollary 3.3 that the coefficients in the expansion of the polynomials on the Schur polynomials converge as , which yields (i). The same formula also provides the limit values of the coefficients, which gives (ii).
∎
4. Infinite-dimensional beta distribution and orthogonality
4.1. The space and the embedding
As before, we fix two parameters and . In accordance with (3.1) we set
[TABLE]
By a configuration in we mean an arbitrary subset of . The set of all configurations is denoted by . Identifying with , we endow with the direct product topology. Then becomes a compact space homeomorphic to the Cantor set.
The space is the disjoint union of the subsets and (finite and infinite configurations). The subset is countable and dense in . Its complement is uncountable and also dense in . Next,
[TABLE]
where consists of -point configurations.
Denote by the space of continuous real-valued functions on with the supremum norm. This is a Banach algebra over with pointwise operations. Observe that the algebra is realized, in a natural way, as a dense subalgebra in . Namely, the value of a function at a given configuration is obtained by substituting the points , enumerated in an arbitrary order, as arguments of the symmetric function , and if the configuration is finite, then one adds a countable set of [math]’s. The definition is correct, because the resulting sequence of arguments lies in , and the result does not depend on the enumeration chosen because of the very definition of the algebra . The continuity of on is readily checked. Finally, the fact that is dense in follows from the Stone–Weierstrass theorem, because the functions from obviously separate points of the space .
From the definition (3.1) it is seen that the set can be identified, in a natural way, with for any admissible values of the triple . Therefore, the space is essentially the same for all . However, its concrete realization and the embedding depend on .
4.2. Orthogonality of functions
Let us list the main definitions and facts, which are used below in the formulation of Theorem 4.1.
We are dealing with the algebra of symmetric functions over .
In §3, we defined an inhomogeneous basis in whose elements are denoted by . Here the index ranges over the set of partitions and the top homogeneous component of the element is the Schur function .
The assumptions on the parameters are the following: and the quadruple is admissible in the sense of Definition 3.1.
Next, in §4.1, we defined a totally disconnected compact space (its concrete realization depends on the parameters ) and an embedding of the algebra into the algebra of continuous functions on ; the image of in is dense.
This embedding allows us to realize elements as continuous functions on the space .
Theorem 4.1**.**
Let be fixed and range over the set of partitions.
(i)* There exists a unique probability Borel measure on the space , such that the functions form an orthogonal basis in the Hilbert space .*
(ii)* The norms of these functions are given by*
[TABLE]
where the symbol is defined in (2.1),
[TABLE]
Comments. 1. The Young diagram is obtained from the diagram by replacing each its box by a square.
-
From our assumptions on the parameters it follows that , , and, moreover, the expression on the right-hand side of (4.1) is strictly positive for every partition .
-
As it will be seen from the proof, it is appropriate to regard the measure as an infinite-dimensional analogue of the -beta distribution on defined in §3.1.
Proof.
(a) From the general construction of §1.2 it follows that the -variate polynomials are orthogonal on with respect to the probability measure that assigns to a given configuration the weight
[TABLE]
where is a normalization constant. Actually, we do not need to know the exact form of this measure, its existence already suffices.
(b) Denote by the same measure but viewed as a measure on the larger space . Let us show that the measures converge to a probability measure on as .
Indeed, let us denote the pairing between measures and functions by the angular brackets. Below we identify polynomials from with the corresponding functions on ; likewise, elements of the algebra are identified with the corresponding functions on .
The measure is characterized by the property
[TABLE]
where denotes the empty Young diagram (= the zero partition) and is a shorthand notation:
[TABLE]
From Corollary 3.3 it is seen that the transition matrix between the bases and is unitriangular and its elements converge as . It follows that for every there exists a limit .
On the other hand, . Consequently, for every there exists a limit for . Because the linear span of the Schur functions is dense in , we conclude that the measures weakly converge to a probability Borel measure .
(c) From the above argument it follows that the limit measure satisfies the relations
[TABLE]
Due to stability of the Schur polynomials, the structure constants of the algebra in the basis stabilize as grows, and their stable values coincide with the structure constants of the algebra in the basis . Therefore, more general limit relations holds:
[TABLE]
Now we use again the fact that the transition matrix between the bases and is unitriangular and its elements converge. Moreover, we know (Theorem 3.4) that their limit values coincide with the elements of the transition matrix between the bases and of the algebra , where is a shorthand notation for . This gives us limit relations
[TABLE]
They imply that the images of the functions in the Hilbert space are pairwise orthogonal, and for their norms the following limit relations hold
[TABLE]
(d) However, the above argument does not allow yet to exclude the situation when the limit measure will be degenerate in the sense that some of the functions will be zero almost everywhere with respect to the measure . Let us show that this is impossible, by computing explicitly the norms by means of the formula (4.3).
From the definition of the polynomials it follows that
[TABLE]
where
[TABLE]
For the latter quantity there is the following explicit expression:
[TABLE]
It is obtained from formulas given in [8, §14.5] whose derivation can in turn be extracted from computations in [2] or [3, §7.3].
Now we compute the product in the right-hand side of (4.4) in consecutive order:
The contribution from (4.5) equals .
The contribution from (4.6) equals .
The contribution from (4.7) equals .
Note that all these expressions do not depend on . There remains the contribution from(4.8); it already depends on , and we find its asymptotics:
The contribution from (4.8) equals
[TABLE]
Since grows as while the number of factors does not depend on , the second product can be written as
[TABLE]
After multiplication by the first product the parameter is happily cancelled, and we obtain that the contribution from (4.8) is
[TABLE]
Finally, combining all the contributions together we obtain the expression from the right-hand of (4.1), together with the additional factor , which tends to . This completes the proof of the theorem.
∎
5. Concluding remarks
5.1. Complement to Theorem 4.1
As above we assume that is an admissible quadruple of parameters (Definition 3.1). According to claim (i) of Theorem 4.1, there exists a probability Borel measure on , which makes the functions orthogonal. Recall that the compact space consists of arbitrary configurations on , finite or infinite (see §4.1).
Theorem 5.1**.**
The measure is concentrated on the subset of infinite configurations.
The proof is the same as that of Corollary 4.10 in [4]. The key fact is that the measures on defined by (4.2) form a coherent system in the sense of [4], which in turn is proved exactly as Theorem 4.7 in [4].
5.2. Exceptional case
Let us briefly describe what happens in this case (recall that it was excluded from consideration up to the present moment).
If , then the symmetric functions still exist and the measures from (4.2) still have a limit. On the other hand, the right-hand side of (4.1) vanishes for any nonzero partition because of the vanishing factor (note that ). This suggests that the limit measure is a delta measure at a distinguished configuration . The next theorem shows that this holds true.
Theorem 5.2**.**
In the exceptional case , the limit measure is the delta measure at a distinguished infinite configuration — the dense packing of the whole lattice .
This means in particular that in the exceptional case, is an extreme coherent system. The result is not interesting from the viewpoint of harmonic analysis. On the other hand, a similar situation holds for the sequence of Plancherel measures on the sets (Young diagrams with boxes). Based on this formal analogy one might ask if the measures with possess (like the Plancherel measures on ) any interesting properties.
5.3. Limit transition as
It is well known that the big -Jacobi polynomials (see (3.3)) can be degenerated to the classical Jacobi polynomials with parameters , if one takes a suitable limit regime with .
Namely, one has to set , , and then let , , . As the parameters vary in this way, the weight measure of the big -Jacobi polynomials converges to the probability measure
[TABLE]
which is the weight measure of the classical Jacobi polynomials, and hence the polynomials also converge.
This shows that the big -Jacobi polynomials can be viewed as a -analogue of the classical Jacobi polynomials.
However, such a limit regime is incompatible with our large- limit transition. Indeed, in the limit, the parameters and must be real and of opposite sign. On the other hand, in our large -limit, we use the polynomials with parameters , where is fixed. If and are real and of opposite sign, then for large enough the quadruple is outside the admissible range.
This is a manifestation of the fact that our construction is a specific “quantum” effect, which is destroyed in the limit.
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[1] G. E. Andrews and R. Askey, q 𝑞 q -Extension of the Beta Function. Proc. Amer. Math. Soc. 81 (1981), No. 1, 97–100.
- 2[2] G. E. Andrews and R. Askey, Classical orthogonal polynomials. In: Polynômes orthogonaux. Lectures Notes in Math. 1171. Springer, 1985, pp. 36–62.
- 3[3] G. Gasper and M. Rahman, Basic hypergeometric series. Second edition. Encyclopedia of Mathematics and its Applications 96. Cambridge Univ. Press, 2004.
- 4[4] V. Gorin and G. Olshanski, A quantization of the harmonic analysis on the infinite-dimensional unitary group. J. Funct. Anal. 270 (2016), 375–418.
- 5[5] F. Knop, Symmetric and non-symmetric quantum Capelli polynomials. Comment. Math. Helv. 72 (1997), 84–100.
- 6[6] R. Koekoek, P. A. Lesky and R. F. Swarttouw, Hypergeometric orthogonal polynomials and their q 𝑞 q -analogues, Springer-Verlag, 2010.
- 7[7] R. Koekoek and R. F. Swarttouw, The Askey-scheme of hypergeometric orthogonal polynomials and its q 𝑞 q -analogue. Report 98-17, Faculty of Technical Mathematics and Informatics, Delft University of Technology, 1998; http://aw.twi.tudelft.nl/~koekoek/askey/ ; ar Xiv:math/9602214.
- 8[8] T.H. Koornwinder, Additions to the formula lists in “Hypergeometric orthogonal polynomials and their q 𝑞 q -analogue” by Koekoek, Lesky and Swarttouw, ar Xiv:1401.0815.
