Hilbert series and Berezin-Gelfand duality
Vadim Schechtman

TL;DR
This paper explores the appearance of Jacobi and Hahn polynomials in the Hilbert series of certain homogeneous spaces, illustrating their mathematical relationships.
Contribution
It provides an example linking special orthogonal polynomials to the Hilbert series of homogeneous spaces, highlighting a novel connection.
Findings
Jacobi polynomials appear in Hilbert series
Hahn polynomials as discrete counterparts in the series
Illustration of polynomial roles in geometric contexts
Abstract
We give an example showing how Jacobi polynomials and their discrete counterparts (Hahn polynomials) appear in the Hilbert series of some homogeneous spaces.
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.
Taxonomy
TopicsAlgebraic structures and combinatorial models · Advanced Combinatorial Mathematics · Advanced Algebra and Geometry
HILBERT SERIES AND BEREZIN-GELFAND DUALITY
Vadim Schechtman
Introduction
I.1. In their great work on spherical functions [BG] Berezin and Gelfand wrote:
”… there exists a deep duality between the function … giving the law of multiplication in the center of the [infinitesimal] group ring [of a semisimple Lee group] and the function … giving multiplication of representations.
… an analogous duality exists between matrix elements of … an irreducible representation of the group … and the so-called ”Clebsch-Gordan coefficients”…
Another example of such a duality are the formulas of Gelfand-Tsetlin for matrix elements of irreducible representations of the algebra of complex matrices with trace [math] and the formulas for coordinates in the group of unitary matrices… In all of these cases the duality consists in the fact that functions of discrete arguments satisfy finite difference equations analogous to differential equations satisfied by functions of real variables that correspond to them.”
The second of the above examples may be expressed by saying that we have a duality between the classical orthogonal polynomials (Jacobi etc.) and their discrete analogues (Hahn etc.). (In fact, all of the above examples admit a similar reformulation.)
The main purpose of the present note is to propose an example illustrating that exactly this type of dual polynomials appears in certain Hilbert series. Namely, let us say that two polynomials and of the same degree and such that , are Euler dual if there is an equality of formal power series
[TABLE]
(we will see shortly that the equality of degrees is equivalent to ).
Here is an example of an Euler dual pair, which is the main observation of this note.
Theorem 1. For each integer we have
[TABLE]
where
[TABLE]
and
[TABLE]
Here denote the Jacobi polynomials and denote the Hahn polynomials which are the discrete analogues of (their definitions are recalled below).
We have ; .
These polynomials satisfy the following properties: (a) All coefficients of are positive integers, , and all its roots are situated on the real half-line . (b) If is an integer then is an integer, , and all its roots lie on the vertical line . (Formally, the polynomials may be interpreted as spherical functions on a (non-existent) homogeneous space where denotes the symmetric group on letters, cf. [D].)
The geometric meaning of the Hilbert series (I2) is as follows. Consider the Grassmanian of two-dimensional planes in embedded by Plücker into the projective space, . Let be its section by a generic linear subspace of codimension .
Theorem 2. The series (I1) is the Hilbert series of the embedding , i.e. , .
As a consequence we get another proof of an elegant result due to David Beckwith [B] (cf. also [BK]). In fact this remarkable paper was the starting point of the present note. Our Theorem 2 is the discrete, or Gelfand dual counterpart of Beckwith’s theorem. As a second consequence, we get another proof of [Bran], Corollary 7.2 for the series .
The above relation between Euler duality and Gelfand duality is the first idea of this note.
I.2. The other idea which we wanted to discuss is analogy of Euler duality to Mellin transform. It can be immediately seen already on the formal level:
Mellin transform:
[TABLE]
Inverse:
[TABLE]
We see that resembles a continuous analogue to generating function (i.e. to Euler transform), whereas resembles taking coefficients of a power series, i.e. to inverse Euler:
[TABLE]
We see similarities and differences.
Certainly this analogy is behind the scene in [RV]. We review in the first section the main features of this analogy (in particular, the analogue of Hecke lemma, which in this case is a theorem of Popoviciu - Ehrhart - Stanley).
In the last section we introduce some polynomials generalising the above ones. They are enumerated by pairs where is a Young diagram and ; we discuss their properties and make some conjectures about them.
The useful discussions with V.Hinich, V.Gorbounov and F.Hirzebruch are gratefully acknowledged.
This work was finished during the author’s stay at Max-Planck-Institut für Mathematik in Bonn, in August 2009.
§0. Jacobi and Hahn polynomials (recollections)
0.1. Finite differences.
;
0.2. Hypergeometric function.
[TABLE]
Gauss hypergeometric function
0.3. Jacobi polynomials (cf. [BE], 10.8, [NU]) , are polynomials orthogonal on with respect to the scalar product
[TABLE]
They satisfy the differential equation
[TABLE]
They can be defined by the Rodrigues formula
[TABLE]
We have:
[TABLE]
[TABLE]
[TABLE]
[TABLE]
Particular cases. Gegenbauer (ultraspherical) polynomials:
[TABLE]
Legendre polynomials:
Generating function:
[TABLE]
Derivation:
[TABLE]
Hahn polynomials
0.4. Let us recall first some classical definitions and formulas related to orthogonal polynomials of a discrete variable, cf. [H], [WE], [NSU].
We consider polynomial solutions of a finite difference equation
[TABLE]
where , , .
Given as above, let be function (not necessarily polynomial!) satisfying to the difference equation
[TABLE]
Set
[TABLE]
. Then
[TABLE]
is a polynomial of degree satisfying (0.4.1) with . The number is a normalising constant: if we want that then
[TABLE]
(so if we want the existence of a solution of degree , the factors in the product should be ; recall that and , so and are constants). Formula is the finite difference analogue of the Rodrigues formula.
0.5. More specifically, let be numbers. Set
[TABLE]
[TABLE]
[TABLE]
and . Then the polynomials given by (0.4.4) are called the Hahn polynomials111Wolfgang Hahn (1911 - 1998), a student of Issai Schur, PhD 1933. and denoted by .
Explicitly,
[TABLE]
[TABLE]
cf. [NSU], (75a). The first polynomials are:
[TABLE]
cf. (0.5.1b).
If is a positive integer then the ’s satisfy the othogonality relation
[TABLE]
for suitable constants .
Relation to Jacobi polynomials:
[TABLE]
cf. [NSU], (56).
0.6. We have
[TABLE]
[TABLE]
§1. Euler transform and toy Hecke lemma
1.1. Euler transform. , , whence
[TABLE]
where , . Let us say that is the Euler transform of , and write .
We will see that this operation is in many respects analogous to inverse Mellin transform.
Let us call the defect of .
For a natural denote .
1.1.1. . In other words, .
We define by
[TABLE]
Then , . We say that is the inverse Euler transform of and write .
[TABLE]
where if and for . If then for .
Here .
It follows:
1.1.2.
1.2. Set
[TABLE]
Let us consider as a rational function on , so is also a rational function, and we can consider its Taylor expansion at [math].
(”Taylor”, not Laurent, since is regular at infinity, moreover, it has [math] of order at .)
1.2.1. Theorem (Tiberiu Popoviciu, cf. [S], 4.6). .
We see again that .
Proof. First verify this for
[TABLE]
The general case follows by Taylor expansion of at .
1.3. Another interpretation. For a polynomial we have its discrete Taylor expansion at :
[TABLE]
So we see that
; one can call this number the ”‘discrete order of zero” of at ; let us denote it .
Theorem of Popoviciu implies that the
[TABLE]
1.4. Corollary (”toy Hecke lemma”, cf. [S], 4.7). Let , . Then
[TABLE]
iff
[TABLE]
for all .
(Note that ”in the critical strip” by our hypothesis.)
Proof. iff . By Theorem,
[TABLE]
so we get our assertion by putting .
§2. Three sets of polynomials
2.2. Let us define the following sequences of polynomials, indexed by natural numbers:
(a)
[TABLE]
For example:
[TABLE]
We set
[TABLE]
These polynomials have been known since long ago, cf. [K].
(b)
[TABLE]
For example:
[TABLE]
2.2. Theorem (a)
[TABLE]
[TABLE]
(b)
[TABLE]
Proof. (a) The first equality in (2.2.1) follows from the definition; the second one — from (0.3.3). The equality (2.2.2) immediately follows.
(b) Take (0.3.2) with and .
2.2.2. Corollary (cf. [B], formula (6) and Theorem). Let denote the Legendre polynomial. Then
[TABLE]
This is equivalent to (2.2.1): it suffices to take into account that
[TABLE]
by (0.3.5).
Just for completeness we add
2.2.2. Corollary (D.Beckwith, [B]). The generating function
[TABLE]
satisfies the differential equation with initial condition:
[TABLE]
Proof (op. cit.) One verifies directly that if the function satisfies the functional equation
[TABLE]
then it satisfies (2.2.5). Explicitly, the solution to (2.2.6) is
[TABLE]
where . Now, using (0.3.6) and (0.3.7) one sees that
[TABLE]
and now 2.2.1 implies that .
2.3. Corollary. The polynomials are self-reciprocal, .
This follows from (2.2.3) and (0.3.4). Of course one can see this immediately from the definition of .
2.4. Corollary (cf. [L], Theorem 3)
Proof. Replace by in (2.2.2) and you get (2.2.3). This also may be verified directly.
2.5. We define another sequence of polynomials:
[TABLE]
. Note that .
The following theorem is well known.
2.5.2. Theorem.
[TABLE]
Proof. The following elementary lemma is usefull (cf. [GW]):
2.5.2. Lemma. If then
[TABLE]
2.5.3. Lemma. (a)
[TABLE]
(b)
[TABLE]
Proof. Induction on , then on .
To finish the proof of 2.6, we remark that where
[TABLE]
and
[TABLE]
and use 2.5.3 with .
§3. Hahn polynomials vs Hilbert polynomials
3.1. Note the following evident properties of the polynomials :
[TABLE]
[TABLE]
Let us define polynomials by the generating series
[TABLE]
So we have ,
[TABLE]
Note that if then . It follows that
[TABLE]
3.2. Theorem.
[TABLE]
Proof. Let us set in the discussion 0.5 , . Then we obtain:
[TABLE]
It follows that
[TABLE]
whence
[TABLE]
[TABLE]
by (3.3.1).
This theorem should be compared with 2.2: note that are discrete analogues of . In fact, the polynomials (3.2.1) where introduced (up to a constant multiple) already by Chebyshev, cf. [Ch].
Geometric meaning of ’s
3.3. The result below is a particular case of an old theorem due to Hirzebruch. Let be the grassmanian of two-dimensional planes in . Consider the Plücker embedding
[TABLE]
where .
Consider the coordinate algebra of : where
[TABLE]
Let be its Hilbert series.
3.4. Theorem, cf. [Hir].
3.5. Proof. We follow [GW]. Set . We have where and is the obvious parabolic. Let be the highest weight of the irreducible -module . We can identify with the irreducible -module of highest weight .
Its dimension may be calculated using the Hermann Weyl character formula:
[TABLE]
the product over the positive roots of the system . In the notations of Bourbaki, [Bou], the positive roots are ; the half-sum of the positive roots
[TABLE]
and
[TABLE]
It follows easily that
[TABLE]
3.6. As a corollary we conclude that all numbers are integers for , hence for all by (3.1.1).
Note that the coefficients of are by definition
[TABLE]
(we see here a sort of reciprocity between and ). In particular they are all integers.
4. Hill polynomials
4.1. A hill is a sequence of positive integers such that
and for .
is called the width of and is called the height of .
Another way of looking at hills is as follows. Let , be a Young diagram. Define two hills
[TABLE]
(the ”even” and ”odd” doubles of ). This way one gets a bijection between the set of hills and the set of pairs where is a Young diagram and .
Define polynomials
[TABLE]
and
[TABLE]
We have . These polynomials will be called Hill polynomials.
4.2. The following discussion is inspired by [RV] (cf. also [G], [M]). For an integer let denote the set of hills of width ; set .
Define an operator , by
[TABLE]
if , and to be the unique map. Define the sets of corresponding polynomials , and an operator by
[TABLE]
For an arbitrary we denote and
. We have
[TABLE]
For any let denote the set of polynomials all whose roots lie on the line .
The following Lemma generalises slightly the Lemma from [RV], no. 2.
4.3. Lemma. If and then where .
Proof goes along the same lines as in loc. cit. We have where
[TABLE]
If then
[TABLE]
Let , , so , cf. (4.2.1). For all , and establishes a bijection between the roots of (counted with their multiplicities) and the roots of . Similarly, for all and establishes a bijection between the roots of and the roots of .
In other words, all roots of are situated in the right half-plane and the reflection with respect to the line maps them bijectively to the roots of of . It follows that if (resp. ) then is less than (resp. greater than) . Thus (*) implies .
As an immediate corollary we get
4.4. Theorem. All roots of lie on the line .
4.5. It is likely that satisfies a difference equation of order of the form
[TABLE]
where is a polynomial of degree .
Exercise. Prove this for hills of height .
4.6. Define dual hill polynomials by
[TABLE]
where .
We also have
[TABLE]
where .
We have
[TABLE]
4.7. Conjecture. All roots of are simple and lie on the real half line .
4.8. Example. Let denote the following hill of width and height : ; then evidently from (3.1.3), so we conclude that all roots of lie on the line .
As a corollary of this and of Thm. 3.2, all roots of the Hahn polynomials lie on the line .
The dual hill polynomials coincide with (note that the coefficients of may be interpreted as numbers of some standard Yong tableaux, [S2]). Their roots are simple and belong to by Thm. 2.2 since the roots of Jacobi polynomials are simple and lie in the interval .
4.9. Example: Eulerian polynomials. A sort of ”opposite” example is provided by the hills of width one: , . In this case we have , . Let us denote for brevity by . The roots of are:
[TABLE]
After change of variable the polynomials will more or less coincide with the polynomials introduced by Euler in his proof of the product formula for and , cf. [Eu] (a), [W], III, §XIX.
Passing to the duals
[TABLE]
we see that conicides with the Eulerian polynomial discussed by Hirzebruch in [Hir2], cf. [Eu] (b). Conjecture 4.7 amounts to saying that all roots of are real and simple. This is a well known fact.
References
[BE] Higher transcendental functions, H.Bateman Manuscript Project, A.Erdèlyi (Ed.), McGraw-Hill, 1953
[B] D.Beckwith, Legendre polynomials and polygon dissections?, The American Mathematical Monthly 105 (1998), 256 - 257.
[BG] F.Berezin, I.M.Gelfand, Some remarks on the theory of spherical functions on symmetric Riemannian manifolds, Tr. Mosk. Mat. Ob-va, 5 (1956), 311 - 351.
[Bou] N.Bourbaki, Groupes et algèbres de Lie, Chap. VI. Hermann, Paris, 1968.
[Bran] P.Brändén, On linear transformations preserving the Pólya frequency property, arXiv:math/0403364.
[BK] V.M.Buchstaber, E.V.Koritskaya, Quasilinear Burgers-Hopf equation and Stasheff polytopes, Funct. Anal. Appl., 41 (2007), 34 - 47.
[Ch] P.L.Chebyshev, Sur une nouvelle série, Bull. Phys.-Math. de l’Acad. Imp. des Sciences de St. Pétersbourg, XVII, 257 - 261 = Oeuvres, tome I, 381 - 384.
[D] Ch.Dunkl, An addition theorem for Hahn polynomials: the spherical functions, SIAM J. Math. Anal. 9 (1978), 627 - 637.
[Eu] L.Euler, (a) De summis serierum reciprocarum ex potestatibus numerorum naturalium ortarum Dissertatio altera in qua eadem summationes ex fonte maxime diverso derivantur, Opera Omnia, Ser. I, XIV, 138 - 155. (b) Remarques sur un beau rapport entre les séries des puissances tant direct que réciproques, Ibid., XV, 70 - 90.
[Gol] V.Golyshev, The canonical strip. I, math.AG/0903.2076.
[GW] B.H.Gross, N.R.Wallach, On the Hilbert polynomials and Hilbert series of homogeneous projective varieties, Preprint.
[H] W.Hahn,Über Orthogonalpolynome, die -Differenzengleichungen genügen, Math. Nachr. 2 (1949), 4 - 34.
[Hir] F.Hirzebruch, Characteristic numbers of homogeneous domains, Semin. Analytic Functions 2 (1958), 92 - 104.
[Hir2] F.Hirzebruch, Eulerian polynomials, Münster J. Math. 1 (2008), 9 - 14.
[K] T.P.Kirkman, On the -partitions of the -gon and -ace, Philos. Trans. Roy. Soc. London 147 (1857), 217 - 272.
[L] C. W. Lee, The associahedron and triangulations of the -gon, Europ. J. Combinatorics 10 (1989), 551 - 560.
[Lev] R.J.Levitt, The zeros of Hahn polynomials, SIAM Review 9 (1967), 191 - 203.
[M] L.Manivel, The canonical strip phenomenon for complete intersections in homogeneous spaces, arXiv:0904.2470.
[NSU] A.F.Nikiforov, S.K.Suslov, V.B.Uvarov, Classical orthogonal polynomials of the discrete variable (Russian), Moscow, Nauka, 1985.
[NU] A.F.Nikiforov, V.B.Uvarov, Special functions of mathematical physics, Birkhäuser, 1988.
[RV] F.Rodrigues-Villegas, On the zeros of certain polynomials, Proc. Amer. Math. Soc. 130 (2002), 2251 - 2254.
[S] R.Stanley, Hilbert functions of graded algebras, Adv. Math. 28 (1978), 57 - 83.
[S2] R.Stanley, Polygon dissections and standard Young tableaux, J. Combinatorial Theory, Series A 76 (1996), 175 - 177.
[WE] Maria Weber, A.Erdèlyi, On the finite difference analogue of Rodrigues’ formula, The American Mathematical Monthly 59 (1952), 163 - 168.
[W] A.Weil, Number Theory. An approach through history, Birkhäuser, 1983.
