Dual-root lattice discretization of Weyl orbit functions
Ji\v{r}\'i Hrivn\'ak, Lenka Motlochov\'a

TL;DR
This paper develops four types of discrete transforms for Weyl orbit functions on finite point sets derived from dual-root lattices, establishing their orthogonality and formulating corresponding Fourier transforms.
Contribution
It introduces a dual-root lattice discretization framework for Weyl orbit functions, including explicit counting formulas and the development of discrete Fourier-Weyl and Hartley-Weyl transforms.
Findings
Proved identical cardinality of point and weight sets.
Established discrete orthogonality of Weyl and Hartley orbit functions.
Formulated discrete Fourier-Weyl and Hartley-Weyl transforms.
Abstract
Four types of discrete transforms of Weyl orbit functions on the finite point sets are developed. The point sets are formed by intersections of the dual-root lattices with the fundamental domains of the affine Weyl groups. The finite sets of weights, labelling the orbit functions, obey symmetries of the dual extended affine Weyl groups. Fundamental domains of the dual extended affine Weyl groups are detailed in full generality. Identical cardinality of the point and weight sets is proved and explicit counting formulas for these cardinalities are derived. Discrete orthogonality of complex-valued Weyl and real-valued Hartley orbit functions over the point sets is established and the corresponding discrete Fourier-Weyl and Hartley-Weyl transforms are formulated.
| , | |||
| , | |||
| , | |||
| , | |||
| , | , | ||
| , | |||
| , | , | ||
| , | , | ||
| , | , | ||
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.
Dual-root lattice discretization of Weyl orbit functions
Jiří Hrivnák1
and
Lenka Motlochová1
Abstract.
Four types of discrete transforms of Weyl orbit functions on the finite point sets are developed. The point sets are formed by intersections of the dual-root lattices with the fundamental domains of the affine Weyl groups. The finite sets of weights, labelling the orbit functions, obey symmetries of the dual extended affine Weyl groups. Fundamental domains of the dual extended affine Weyl groups are detailed in full generality. Identical cardinality of the point and weight sets is proved and explicit counting formulas for these cardinalities are derived. Discrete orthogonality of complex-valued Weyl and real-valued Hartley orbit functions over the point sets is established and the corresponding discrete Fourier-Weyl and Hartley-Weyl transforms are formulated.
1 Department of Physics, Faculty of Nuclear Sciences and Physical Engineering, Czech Technical University in Prague, Břehová 7, CZ-115 19 Prague, Czech Republic
E-mail: [email protected], [email protected]
Keywords: Weyl orbit functions, root lattice, discrete Fourier transform, Hartley transform
1. Introduction
The purpose of this article is to extend the collection of discrete Fourier transforms of Weyl orbit functions on Weyl group invariant lattices [16, 14, 17]. A finite fragment of a refinement of the classical dual root lattice [2] serves as the starting set of points over which the discrete orthogonality of four types of complex Weyl orbit functions [20, 21, 27] is developed. The entire resulting transform formalism produces a real-valued multidimensional Weyl group invariant generalizations of the one-dimensional discrete Hartley transform [3].
The antisymmetric and symmetric exponential orbit sums over Weyl groups form a standard part of the theory of Lie algebras and their representations [2]. From the viewpoint of the Coxeter groups theory, Weyl groups cover all finite crystallographic reflection groups [18]. Depending on the type of the underlying crystallographic root system, two or four sign homomorphisms exist [27]. Each sign homomorphism determines signs in the exponential sums and thus generates for each Weyl group two or four types of complex special functions. Lattice shift and Weyl group invariance of the resulting Weyl orbit functions generalize periodicity and boundary behaviour of the standard cosine and sine functions of one variable. Investigating Weyl orbit functions as special functions, the results range from generalizations of continuous multivariate Fourier transforms in [20, 21] to generalized Chebyshev polynomial methods [24, 29]. Discrete Fourier methods are comprehensively studied for Weyl orbit functions [16, 14, 17] as well as for their multivariate Chebyshev polynomial generalizations [7, 15, 27, 29]. The refinement of the dual weight lattice intersected with the fundamental domain of the affine Weyl group form a finite point set on which the majority of the discrete Fourier and Chebyshev methods is developed [16, 14, 24, 27]. This choice of the point set generates symmetries of labels of orbit functions governed by the dual affine Weyl group [16]. Choosing as the starting point set the refinement of the weight lattice produced different argument and label symmetries, both controlled by the same affine Weyl group [17].
The dual root and root lattices constitute the last classical Weyl group invariant lattices for which the inherent Fourier methods have not yet been studied. Several apparent relative difficulties, surmounted in the present paper for the dual root lattice, stem from the fact that the label symmetries are in this case determined by the dual extended affine Weyl group. Firstly, even though the structure of the extended affine Weyl group and its dual version is detailed already in [2], relevant rigorous results about their fundamental domains appeared much later in [22]. Moreover, these fundamental domains, essential for selecting the labels of orbit functions in discrete transforms, are determined in [22] only up to their boundaries. A uniform description of the fundamental domains from [22], including a unique layout of the boundary points, is achieved in the present paper by introducing lexicographical ordering on the Kac coordinates [19]. Secondly, the main challenge poses linking the number of weights, found in the fundamental domain of the dual extended affine Weyl group, with the number of points from the refined dual root lattice, lying in the fundamental domain of the affine Weyl group. Both sets form topologically distant finite subsets of the underlying Euclidean space and their common cardinality constitutes a novel invariant characteristic of the crystallographic root systems and corresponding simple Lie algebras. Determining the cardinality of these sets in full generality requires invoking and extending concepts from the theory of invariant polynomials [32, 18]. Common cardinality of the point and weight sets guarantees in turn the existence of both complex-valued Fourier-Weyl and real-valued Hartley-Weyl discrete transforms.
Both complex and real types of developed Fourier-like transforms significantly enhance the collection of available Weyl group invariant discrete transforms [16, 14, 24, 27]. The topology of the point sets of the dual root lattice discretization and their relative position with respect to the fundamental domain of the affine Weyl group substantially diverge from the locations of the original dual weight lattice points. Moreover, fundamentally novel options are generated by combining both dual root and dual weight discretizations to produce discrete transforms on generalized and composed grids. These options encompass transforms on the refined dual weight lattice with points from the dual root lattice omitted, such as two-variable transforms on the honeycomb lattice. Assuming Weyl symmetric or antisymmetric boundary conditions in mechanical graphene eigenvibrations model [5] or in quantum field lattice models [8] potentially yields novel Weyl invariant solutions and dispersion relations in terms of four types of extended Weyl orbit functions. Real-valued multivariate Hartley-Weyl versions of the transforms augment the application potential of discrete Hartley transforms in pattern recognition [4], geophysics [23], signal processing [30, 31], optics [25] and measurement [33]. The unitary matrices of the derived transforms also permit the construction of novel analogues of the Kac-Peterson matrices from the conformal field theory [17].
The paper is organized as follows. In Section 2, the necessary facts concerning root systems and invariant lattices of Weyl groups are recalled. Section 3 contains a description of infinite extensions of Weyl groups. In Section 4, fundamental domains of infinite extensions of Weyl groups and the corresponding invariant polynomials are detailed. Section 5 is devoted to the study of finite sets of points and weights. The identical cardinality of these sets is proven and explicit counting formulas for the cardinalities are listed in full generality. Section 6 describes Weyl and Hartley orbit functions together with their discrete orthogonality and discrete Fourier transforms. Comments and follow-up questions are contained in the last section.
2. Invariant lattices of Weyl groups
2.1. Root systems and Weyl groups
The notation used in this article is based on papers [16, 14]. The purpose of this section is to extend this notation and recall other pertinent details [2]. Each simple Lie algebra from the classical four series , , , and from the five exceptional cases determines its set of simple roots [2, 34]. For the cases of simple Lie algebras with two different root-lengths, the set is disjointly decomposed into of short simple roots and of long simple roots,
[TABLE]
The set forms a non-orthogonal basis of the Euclidean space with the standard scalar product . To every simple root corresponds a reflection given by the formula
[TABLE]
Reflections generate an irreducible Weyl group
[TABLE]
and in turn generates the entire root system . The set of simple roots induces a partial ordering on such that for it holds if and only if with for all . There exists a unique root , highest with respect to this ordering, of the form
[TABLE]
To each simple root relates the dual simple root given by
[TABLE]
The set of dual simple roots generates the entire dual root system . The dual root system contains the highest dual root with respect to the ordering induced by of the form
[TABLE]
The expansion coefficients of the highest root and of the highest dual root , named the marks and the dual marks, respectively, are listed in Table 1 in [16]. Setting additionally , the Coxeter number is given by
[TABLE]
The dual marks with unitary values determine an important index set ,
[TABLE]
Note that is empty for the simple Lie algebras and .
Minimal number generators , necessary to generate an element is called the length of . There is a unique longest element , also called the opposite involution, and for its length it holds that
[TABLE]
For root systems with even Coxeter numbers are the opposite involutions of the form
[TABLE]
An important parabolic subgroup of the Weyl group is obtained by omitting from the set of generators of
[TABLE]
The subgroup forms the Weyl group corresponding to the root system . The opposite involution in with respect to the root system is denoted by .
2.2. Invariant lattices
Four classical Weyl group invariant lattices [2] comprise the root lattice, the dual weight lattice, the dual root lattice and the weight lattice. The root lattice is the -span of the set of simple roots ,
[TABLE]
The dual weight lattice is dual to the root lattice ,
[TABLE]
with the dual fundamental weights given by
[TABLE]
The dual root lattice is the -span of the set of dual simple roots
[TABLE]
The weight lattice is dual to the dual root lattice ,
[TABLE]
with the fundamental weights given by
[TABLE]
The weight lattice is partitioned into components and this decomposition consists of the root lattice and its shifted copies,
[TABLE]
The Cartan matrix with entries given by
[TABLE]
relates the simple roots and fundamental weights as well as their dual versions via formulas
[TABLE]
The determinant of the Cartan matrix determines the index of connection of the root system and the order of the quotient group ,
[TABLE]
2.3. Sign homomorphisms
Recall from [14] that a homomorphism is called a sign homomorphism. The identity and the determinant sign homomorphisms, which exist for any Weyl group are given on the generating reflections as
[TABLE]
For the root systems with two lengths of roots, the short and long sign homomorphisms and are defined as
[TABLE]
To each sign homomorphism is attached a vector defined by
[TABLE]
The vector becomes the standard vector defined as half-sum of the positive roots. Zero coordinates of the vectors are for convenience defined by
[TABLE]
Furthermore, to each sign homomorphism is associated a generalized Coxeter number by defining relation
[TABLE]
Note that and the number coincides with the standard Coxeter number. The short and long Coxeter numbers are tabulated in [14].
3. Extensions of Weyl groups
3.1. Affine Weyl groups
The affine Weyl group is a semidirect product of the group of translations and
[TABLE]
For and , any element acts on as
[TABLE]
The standard retraction homomorphism of the semidirect product (7) is given by
[TABLE]
The fundamental domain of is a simplex explicitly given by
[TABLE]
The stabilizer is a subgroup of stabilizing
[TABLE]
and the function is defined by
[TABLE]
The stabilizers and are conjugated and therefore the function is invariant
[TABLE]
The standard action of on the torus generates for its isotropy groups and orbits of orders
[TABLE]
The following three properties from Proposition 2.2 in [16] of the action of on the torus are essential,
- (1)
For any , there exists and such that
[TABLE] 2. (2)
If and , , then
[TABLE] 3. (3)
If , i.e. , , then and
[TABLE]
Relation (12) grants that for , it holds that
[TABLE]
Note that instead of , the symbol is used for , in [16, 14]. The algorithm for calculation of the coefficients is described in [16, §3.7].
To each sign homomorphism is associated a subset of the form
[TABLE]
The sets are detailed in [16, 14] and described via non-negative symbols defined by
[TABLE]
The explicit formulas for are thus of the form
[TABLE]
Note that and .
3.2. Dual affine Weyl groups
The dual affine Weyl group is a semidirect product of the group of translations in the root lattice and
[TABLE]
For and , any element acts on as
[TABLE]
The fundamental domain of the dual affine Weyl group , denoted by in [16, 14], is explicitly given by
[TABLE]
By identifying each with its Kac coordinates from (18),
[TABLE]
the lexicographic ordering on is introduced in the following way. An element is lexicographically higher than ,
[TABLE]
if and only if for the first where differs from .
The standard dual retraction homomorphism of the semidirect product (16) is given by
[TABLE]
Similar to (14), four subsets of are introduced by
[TABLE]
The domains are explicitly described by
[TABLE]
with the symbols satisfying
[TABLE]
3.3. Extended dual affine Weyl groups
The extended dual affine Weyl group is a semidirect product of the group of translations and the Weyl group
[TABLE]
For and , extending the action (17) on to elements yields
[TABLE]
The extended dual retraction homomorphism of the semidirect product (23) is a natural extension of (20) given by
[TABLE]
Introducing the subgroup of all elements of leaving the fundamental domain of invariant
[TABLE]
allows to represent as a semidirect product
[TABLE]
Explicit structure of the abelian group is detailed in [2, Ch.VI,§2] as
[TABLE]
The action of on assigns to each fixed a bijection on given on Kac coordinates by
[TABLE]
where denotes a permutation of the index set . These permutations of the Kac coordinates , which determine the group , are specified for every simple Lie algebra in Table 1. Direct analysis of the permutations in Table 1 on the vector (5) yields for its coordinates that
[TABLE]
Considering a resolution factor , an important class of subgroups of is given by
[TABLE]
For each , the subgroup is isomorphic to by an isomorphism
[TABLE]
defined by assigning to . The action of on is directly related to action of by
[TABLE]
Consequently, acts naturally on the magnified fundamental domain . Setting for the magnified Kac coordinates , this action is described by
[TABLE]
To each element is thus assigned the same permutation of from Table 1 as to the corresponding in (27).
4. Fundamental domains and invariant polynomials
4.1. Stabilizers
The stabilizer is a subgroup of stabilizing and the related counting discrete function is for any defined by
[TABLE]
Characterizing the structure of in the following proposition subsequently allows the calculation of the function .
Proposition 4.1**.**
For any it holds that
[TABLE]
Proof.
The semidirect decomposition (25), where is normal in , directly guarantees that is a normal subgroup of . Moreover, for any stabilized by both and is Conversely, for any exists from (25) a unique decomposition with and . Invariance (24) of under the action of implies that . Since the fundamental domain contains only one point from each orbit, the relation
[TABLE]
forces . ∎
The isomorphism (30) and relation (31) imply for the stabilizers that
[TABLE]
The resulting counting formula for is deduced for from relations (34) and (35) as
[TABLE]
The calculation procedure for is described in [16, §3.7]. The orders of stabilizers are directly derived from the explicit form of permutations given by (27) in Table 1.
Note that since and from (26) and (29) differ only in the translation part, their retractions coincide
[TABLE]
Consequently, the retraction of the stabilizers are also identical
[TABLE]
4.2. Fundamental domains
Significant results concerning the structure of the fundamental domain of the group are achieved in [22]. Firstly, from the semidirect decomposition (25) follows that the fundamental domain coincides with a fundamental domain of the group acting on . Secondly, the interior of is determined as [22]
[TABLE]
It is also asserted that the extended interior of defined by
[TABLE]
forms a subset of , .
In order to uniquely determine the remaining boundary points from , note that the defining relation in (38)
[TABLE]
implies that . Taking into account explicit forms of permutations of from Table 1 and the lexicographic ordering (19), the inequality grants that the point is the lexicographically highest among the points lying in its orbit. Consequently, the fundamental domain is taken as such subset of which contains the lexicographically highest point from each orbit of . This resulting form of the fundamental domain , which contains exactly one point from each orbit of is summarized in the following theorem.
Theorem 4.2**.**
The set defined by
[TABLE]
forms a fundamental domain of the extended dual affine Weyl group
Four crucial subsets of are for each sign homomorphism defined by
[TABLE]
Recall also from [22] that the stabilizer of any interior point is trivial, therefore it holds that . The form of the sets is simplified in the following proposition.
Proposition 4.3**.**
The sets , defined by (40), are of the form
[TABLE]
Proof.
Since both stabilizers and are subgroups of , it holds for any point that
[TABLE]
and thus . Conversely, for any follows from (42) and the semidirect decomposition (34) that and thus . ∎
Theorem 4.2 and relation (31) guarantee that the magnified domain is a fundamental domain of the action of on . Relations (41) and (37) allow to express the magnified domains ,
[TABLE]
Example 4.1*.*
For the simple Lie algebra , the fundamental domain of the affine Weyl group is according to (18) of the form
[TABLE]
and the fundamental domain of the extended dual affine Weyl group is by (39) of the explicit form
[TABLE]
The sets (21) coincide for the identity sign homomorphism with the original sets and ,
[TABLE]
For the sign homomorphism , the set is by (21) and (22) of the form
[TABLE]
and relation (41) together with Table 1 implies the following explicit description of
[TABLE]
The domains , , , and of are depicted in Figure 1.
Setting , another geometric shape for the choice of the fundamental domain of the extended dual affine Weyl group exists. The domain , bounded by the planes orthogonal to and passing through ,
[TABLE]
is also a fundamental domain of . The closure of the domain coincides, up to a factor , with the Brillouin zone [26] of the dual root lattice of . The domains and are depicted in Figure 2.
4.3. invariant polynomials
The vector space comprises polynomials of variables over . The extended degree of a monomial , is defined as
[TABLE]
The extended degree of any polynomial is then the maximum extended degree of homogeneous parts of . Recall from [16] that the finite sets consist for any of the weights contained in the set ,
[TABLE]
and is of the explicit form
[TABLE]
Identifying each element of with its Kac coordinates , results to conclusion that if and only if . All linear combinations of monomials of extended degree equal to form a vector subspace of denoted by ,
[TABLE]
¨ The standard action [32, 18] of an operator on is given by
[TABLE]
For any representation of the abelian group (26) and a sign homomorphism , a polynomial is called invariant if it for all satisfies
[TABLE]
A vector subspace contains all invariant polynomials from ,
[TABLE]
Proposition 4.4**.**
Let be representations of to for which there exists such that
- (i)
for all , i.e. and are equivalent, 2. (ii)
.
Then the spaces and are for any sign homomorphism isomorphic,
[TABLE]
Proof.
Assumption (ii) implies for any that . Definitions (46) and (47) and assumption (i) yield invariance of
[TABLE]
and therefore . Conversely, it holds that if then . The map is linear and its inverse is the map ∎
Proposition 4.5**.**
Let be such that is a linear combination of monomials of the extended degree for every . Then if and only if .
Proof.
For any monomial , the assumption implies that the factors of ,
[TABLE]
satisfy for every that
[TABLE]
Multinomial expansion of (49) provides the relation
[TABLE]
which guarantees that the polynomial is a linear combination of monomials of extended degree and thus
[TABLE]
Since is a product of non-zero polynomials in (48), it is also non-zero and a linear combination of monomials of extended degree ,
[TABLE]
The resulting polynomial is thus a linear combination of monomials of extended degree and therefore . Conversely, the assumption on is equivalent to being a block diagonal matrix in a suitable permutation of the standard basis with its blocks determined by the same values of . Taking into account that the matrix retains the same form, forces also . ∎
The action (27) of on via permutations of the Kac coordinates induces a faithful representation by assigning each element its permutation matrix ,
[TABLE]
Similarly, the action of on , described by (32), assigns to each element its permutation matrix corresponding to , provided by isomorphism (30). Consequently, the action of also induces, independently on , the identical representation matrices ,
[TABLE]
Since the finite group is abelian, the commuting diagonalizable matrices can be simultaneously diagonalized, i.e. there exists a unitary matrix such that is a diagonal matrix for each . Therefore, the diagonal representation , equivalent to , is given by
[TABLE]
The diagonal matrices are for the generators of the non-trivial groups of the following form
[TABLE]
and the unitary conjugation matrices are listed in Table 2.
Theorem 4.6**.**
Let be the permutation representation (50) of and the corresponding diagonal representation (52). Then the spaces and are for any sign homomorphism isomorphic,
[TABLE]
Proof.
Explicit forms of the unitary conjugation matrices in Table 2 guarantee that each satisfies the assumption of Proposition 4.5.
This in turn, results to the validity of assumption (ii) in Proposition 4.4. ∎
5. Sets of points and weights
5.1. Sets and
The Fourier calculus of Weyl orbit functions is commonly formulated [14, 16, 7] on points , from the refined dual weight lattice contained in ,
[TABLE]
while weights labelling the functions are taken from the magnified dual fundamental domain ,
[TABLE]
This work develops the Fourier calculus on points , from the refined dual root lattice contained in ,
[TABLE]
with weights labelling the functions taken from the magnified fundamental domain ,
[TABLE]
The set of points contains all points of belonging to and the set of weights is a suitable fragment of . The point sets and together with the weight sets and of are depicted in Figure 3.
In order to describe explicitly the point sets for any sign homomorphism , the symbols , are introduced via the relations
[TABLE]
The explicit description of the point set follows from relations (4) and (15),
[TABLE]
where denotes the transposed Cartan matrix (3). The set of equations
[TABLE]
selects such points from which belong to . Standard reduction of the sets of equations (57) yields their simplified form for each non-trivial case as
[TABLE]
5.2. Cardinality of and
In order to prove that the point sets and the sets of weights have for the same cardinality, the isomorphism of polynomial spaces in Theorem 4.6 is employed. The first step is to introduce an auxiliary finite set of weights by the relation
[TABLE]
together with its complementary set ,
[TABLE]
and their corresponding sets and of representative weights in orbits,
[TABLE]
Indeed, since is a fundamental domain of the action of on , it holds that
[TABLE]
The following disjoint decomposition of the weight set (44) and the set are thus obtained,
[TABLE]
The set is related by shifts (5) to the set in the following proposition.
Proposition 5.1**.**
The set of weights coincides for any with the shifted set
[TABLE]
Proof.
Firstly, for any coordinates of are the corresponding coordinates of defined by
[TABLE]
According to (55) and (43), any weight satisfies the conditions
[TABLE]
together with
[TABLE]
Defining relations (5), (6) and (21), (22) imply that and consequently (68) grants that
[TABLE]
Taking into account (28) and comparing the action of on ,
[TABLE]
to the action of on ,
[TABLE]
yields that the point is the lexicographically highest in its orbit whenever is the lexicographically highest in its orbit. Thus, properties (67), (70) and (39) ensure that
[TABLE]
Connecting action (71) for the stabilizing and action (72) of on forces to stabilize , i.e. Relation (36) thus gives
[TABLE]
moreover (69) guarantees in turn that
[TABLE]
and therefore
Conversely, implies validity of (75) and (73). Defining relations (5), (6) and (21), (22) then imply that grants (68). By comparing actions (71) and (72), property (73) forces relation (67), properties (75) and (74) guarantee (69) and therefore . ∎
Proposition 5.2**.**
The dimension of is for any equal to the number of points in ,
[TABLE]
Proof.
Utilizing the group action (32), the polynomial is for any sign homomorphism and any introduced by
[TABLE]
Any is represented by (51) as a permutation matrix and thus the polynomial action (46) on the monomials takes the form
[TABLE]
Substituting (77) into (76) and taking into account relations (36) and (51), the polynomials , are deduced to be invariant,
[TABLE]
Since any satisfies from (61) that , a general linear combination of polynomials (76) is of the form
[TABLE]
Since is a fundamental domain of acting on , the second term of (78) is a linear combination of monomials with . Since the monomials in the first term of (78) are linearly independent, setting (78) equal to zero grants that all with are also zero. The polynomials (76) are thus linearly independent.
For any invariant polynomial of the form
[TABLE]
and for any imply properties (47), (36), (51) and (77) that
[TABLE]
The set of weights is invariant under and therefore, comparing the coefficients in (79) yields that . Thus, relation guarantees for all that
[TABLE]
The disjoint decomposition (65) of the weight set together with relations (63), (64) and (80) ensures that
[TABLE]
Defining relation (62) guarantees that for any there exists such that and thus the second term in (81) vanishes,
[TABLE]
and the polynomials (76) generate the space . The constructed basis provides together with Proposition 5.1 the resulting relation for dimension of ,
[TABLE]
∎
Proposition 5.3**.**
The dimension of is for any equal to the number of points in ,
[TABLE]
Proof.
Invariance property (47) of the diagonal representation (52) grants that any polynomial from is a linear combination of invariant monomials. Therefore, the set of invariant monomials , satisfying for all
[TABLE]
forms a basis of . Since for any it holds that
[TABLE]
verifying property (82) only for the generators of yields its validity for all . For any , with its Kac coordinates , satisfying the defining relation in (45)
[TABLE]
and for any diagonal generator of is condition (82) equivalent to the relation
[TABLE]
Explicit forms (53) of the diagonal generators yield the following explicit reformulations of (84) for the non-trivial cases,
[TABLE]
where non-zero values of are listed in Table 3.
Recall from Proposition 2.1 in [14] that the short and long Coxeter numbers (6) are of the form
[TABLE]
Introducing the symbols by relations
[TABLE]
and substituting them into the expressions (56) and (58) together with formulas (1) and (86) implies, that the number of points in is equal to the number of solutions of the equations
[TABLE]
and
[TABLE]
The solutions of the equations (87) and (88) and solutions of the equations (83) and (85) coincide for each case up to a permutation and therefore, their numbers are identical. ∎
Theorem 5.4**.**
For any it holds that
[TABLE]
Proof.
Combining Propositions 5.2, Proposition 5.3 and Theorem 4.6 grants for any that
[TABLE]
∎
5.3. Counting formulas
In order to obtain explicit counting formulas for cardinalities of all and , the following crucial identity stemming from Proposition 5.1 is used,
[TABLE]
The calculation of the cardinality of is thus reverted to counting the weights in for all . The group partitions the sets of weights (59) and (60) into orbits and the sets and consist of exactly one point from each orbit. Therefore, the number of points in and is equal to the number of orbits in and , respectively.
Starting with the identity sign homomorphism set and introducing a set of points in fixed by a given ,
[TABLE]
the Burnside’s lemma applied to the set provides the relation
[TABLE]
Moreover, the group is partitioned into disjoint sets containing the elements of the same order which implies that (90) is reformulated as
[TABLE]
For a general sign homomorphism, disjoint decomposition (66) yields the relation
[TABLE]
and employing the Burnside’s lemma to the set produces the identity
[TABLE]
Using the Euler’s totient function together with equations (89), (91), (92) and (93), the explicit counting formulas for the numbers of points in the weight sets are for all cases listed in the following theorem.
Theorem 5.5**.**
The numbers of elements in are for any determined by the following formulas.
- (1)
:
[TABLE] 2. (2)
:
[TABLE]
where . 3. (3)
:
[TABLE] 4. (4)
:
[TABLE] 5. (5)
:
[TABLE] 6. (6)
:
[TABLE]
where
[TABLE] 7. (7)
:
[TABLE]
Proof.
A detailed calculation is presented for the infinite series of groups of . Since the remaining infinite series , and share common groups listed in Table 1, the proof of the corresponding counting formulas is less complex.
The group of is a cyclic group of order generated by the permutation satisfying ,
[TABLE]
For each such that order it holds that
[TABLE]
Since for any weight , its cyclic isotropy subgroup contains both and , it holds that . Conversely, as divides , the set of fixed points is contained in the set and thus
[TABLE]
Since the number of elements of order in a cyclic group is the value of the Euler’s totient function and all elements of order satisfy (96), counting relation (91) specializes to
[TABLE]
The Kac coordinates of a point satisfy equation (83) specialized to ,
[TABLE]
Employing explicit expression for the cyclic permutation listed in Table 1, a weight is stabilized by , i.e. , if and only if
[TABLE]
Substituting (99) into relation (98) yields
[TABLE]
and thus, if is not divisible by , then
[TABLE]
If divides , then the number coincides with the number of non-negative integer solutions of equation (100). This number is determined by Proposition 3.1 in [16] as
[TABLE]
Substituting relations (102) and (101) into (97) results in counting formula (94).
Taking into account (36), the values of the composition of homomorphisms on the elements of the group follow for the case from Table 1 as
[TABLE]
For even, definition (60) and relation (103) immediately guarantee that and thus
[TABLE]
Continuing with odd, equality (96) again grants that counting formula (93) simplifies as
[TABLE]
In order to determine the structure of the intersection sets in (105), note that for an odd there exist an odd number and such that
[TABLE]
and any divisor of is of the form
[TABLE]
Taking any , relations (103) and (60) yield that there exists an odd number such that . The stabilizer subgroup therefore contains a subgroup generated by
[TABLE]
and thus Since is odd, the greatest common divisor is odd and divides and therefore . Conversely, taking any , the divisor , being odd, grants that and hence
[TABLE]
Relations (107) and (106) allow to further evaluate the counting formula (105) as
[TABLE]
Since the Euler’s totient function is multiplicative and holds for any , the following identities are obtained,
[TABLE]
and thus (108) is simplified as
[TABLE]
The resulting counting formula
[TABLE]
specializes for odd to (109) and for even to (104). Substituting (101) and (102) into the counting formula (110) and the result into (92) and (89), while taking into account that the Coxeter number of is , yields the final counting relation (95). ∎
6. Discrete transforms of Weyl orbit functions
6.1. Weyl and Hartley orbit functions
The sign homomorphisms of the Weyl group induce up to four families of Weyl orbit functions. The Weyl orbit functions , labelled by parameter , are defined for any by
[TABLE]
The functions and are called functions and functions, respectively. In the cases of simple Lie algebras with two different root lengths, the functions and are termed the and functions in [27], respectively.
Recall from Proposition 3.1 in [6] that while restricting the label to the the weight lattice , the argument invariance of Weyl orbit functions with respect to the action of the element of the affine Weyl group is for any of the form
[TABLE]
Moreover, the functions are zero for the boundary points of the sets (14),
[TABLE]
Restricting the arguments of Weyl orbit functions to the refined dual root lattice , additional label symmetries with respect to the extended dual affine Weyl group (23) are generated.
Proposition 6.1**.**
Let then for any and any it holds that
[TABLE]
Additionally, the Weyl orbit function vanishes for any ,
[TABLE]
Proof.
The duality (2) of the Weyl group invariant lattices and ensure that the relation
[TABLE]
is valid for any and and thus, for any element of the extended dual affine Weyl group it holds that
[TABLE]
For points from the boundary set there exists by (40) an element such that and hence
[TABLE]
∎
A real-valued version of the Weyl orbit functions employs the Hartley kernel functions
[TABLE]
The sign homomorphisms of the Weyl group induce up to four families of the Hartley orbit functions , labelled by parameter ,
[TABLE]
The relation between the complex exponential function in (111) and the Hartley kernel function (116) provides the following expression,
[TABLE]
Equation (117) straightforwardly extracts from (112) that restricting the label to the weight lattice , the argument invariance of Hartley orbit functions with respect to the action of the element of the affine Weyl group is for any of the form
[TABLE]
Moreover, the functions are zero for the boundary points of the sets (14),
[TABLE]
Using (117) again, a real-valued analogue of Proposition 6.1 is derived.
Proposition 6.2**.**
Let then for any and any it holds that
[TABLE]
Additionally, the Hartley orbit function vanishes for any ,
[TABLE]
6.2. Discrete orthogonality
Argument symmetries of Weyl orbit functions (112), (113) grant that the functions discretized to the grid are fully determined by their non-zero values in the sets (54). Label symmetries, induced by the selection of the discrete grid and determined by Proposition 6.1, restrict the labels to the weight sets (55). The same argument and label symmetries are guaranteed for the Hartley orbit functions by relations (118), (119) and Proposition 6.2. A scalar product of two discrete complex valued functions is introduced via relation
[TABLE]
with the function defined by (8), and the resulting finite-dimensional Hilbert space is denoted by . Note that for any and it holds
[TABLE]
and the mapping with is well defined. In order to derive the discrete orthogonality of Weyl orbit functions (111) with respect to the scalar product (120), the following basic orthogonality relations of exponential functions are essential.
Proposition 6.3**.**
Let and , then
[TABLE]
Proof.
For any , such that for all is satisfied , the duality of and yields that . Thus for all , there exists such that and . Therefore, the following calculation from [28], specialized for the finite quotient group of order ,
[TABLE]
forces basic orthogonality relations (121). ∎
Theorem 6.4**.**
For any , it holds that
[TABLE]
where the coefficients are defined by (33).
Proof.
Since the functions vanish by (113) on the sets , the scalar product is evaluated as
[TABLE]
The invariance properties (9) and (112) grant that the summands in (123) are invariant, i.e. for all it holds that
[TABLE]
The shift invariance in (124) and relation (13) imply
[TABLE]
and the invariance in (124) and relations (10), (11) produce the identity
[TABLE]
The invariance of the quotient group is used to further simplify the result,
[TABLE]
If , then holds for some and and thus and are in the same orbit. Definition (55) of the weight set guarantees that both and are in the fundamental domain and therefore . Contrapositive implication yields that if , then for all it holds that and hence basic orthogonality relations (121) grant zero value .
If , then basic orthogonality relations (121) guarantee that summands in (125) do not vanish only if , or equivalently and thus
[TABLE]
Since for the property forces , the subgroups and are isomorphic and hence
[TABLE]
Definition (55) of the weight set also ensures that for any it holds that and, taking into account defining relation (40) and notation (33), the final identity yielding relations (122) is derived,
[TABLE]
∎
Theorem 6.5**.**
The functions , form for any , an orthogonal basis of the Hilbert space .
Proof.
Theorem 6.4 grants linear independence of the set of discretized functions , , and Theorem 5.4 guarantees that this set of orthogonal functions has the cardinality
[TABLE]
∎
As a consequence of the discrete orthogonality of Weyl orbit functions, the discrete orthogonality of Hartley orbit functions is derived in the following theorem.
Theorem 6.6**.**
For any , it holds that
[TABLE]
where the coefficients are defined by (33).
Proof.
The following trigonometric identity,
[TABLE]
valid for any , implies together with discrete orthogonality relations (122) that
[TABLE]
Definition (111) immediately provides the following relation for complex conjugated function
[TABLE]
and lattice property (2) of the weight lattice ensures that . Since the lattice is invariant, there exist and such that
[TABLE]
Relations (126), (127) and label symmetry (114) allow to calculate
[TABLE]
If , then discrete orthogonality relations (122) ensure that . If, on the other hand, then vanishing property (115) grants directly that . ∎
The discrete orthogonality of Hartley orbit functions also generates Hartley version of Theorem 6.5.
Theorem 6.7**.**
The functions , form for any , an orthogonal basis of the Hilbert space .
6.3. Discrete transforms
The interpolating function of any function is defined as a linear combination of the basis functions
[TABLE]
satisfying the condition
[TABLE]
The frequency spectrum coefficients in (128) are uniquely determined by Theorem 6.5 and calculated as standard Fourier coefficients,
[TABLE]
and the corresponding Plancherel formulas also hold
[TABLE]
Equations (129) and (128) establish forward and backward discrete Fourier-Weyl transforms, respectively, of the function .
Similarly, the Hartley interpolating function of any function is defined as a linear combination of the Hartley basis functions
[TABLE]
satisfying the condition
[TABLE]
The frequency spectrum coefficients in (130) are uniquely determined by Theorem 6.7 and calculated as standard Fourier coefficients,
[TABLE]
and the corresponding Plancherel formulas also hold
[TABLE]
Equations (131) and (130) establish forward and backward discrete Hartley-Weyl transforms, respectively, of the function .
Concluding remarks
- •
The choice of the fundamental domain of the dual extended affine Weyl group is not unique. As demonstrated in Example 4.1, the Brillouin zone [26] of , intersected with the dominant Weyl chamber and with certain boundaries omitted, produces another viable fundamental domain for the case. Significant advantage of the presented Kac coordinates approach stems from existence of an effective algorithm for constructing the weight sets from formula (43) for any case. Indeed, explicit relations (21) and (22) immediately produce the weight sets . Sorting the weights from into orbits, selecting the lexicographically highest in each orbit, while excluding those with negative sign homomorphism values of stabilizing , yields directly the set for any fixed .
- •
The counting formulas for the case are due to their link to combinatorics of necklaces already present in various contexts in the mathematical literature. Indeed, the action of the cyclic group on the set implies that the number coincides with the number of necklaces with white and black beads. Moreover, conditions (85) for the point sets are in fact special cases of equation (2) in [9] and thus, preserving the notation from [9], it holds that
[TABLE]
Using the Hölder’s identity [11] to evaluate the Ramanujan sums in the explicit expressions for in [9, Thm. 1] allows to bring equations (132) to the form of counting formulas (94) and (95). Such direct comparison provides an alternative proof of the case of Theorem 5.4. Note also that the counting formulas studied in conjunction with the perfect forms in Lemma 5.1 in [1] coincide with the counting formula for .
- •
Good behaviour of the dual-weight discretization of Weyl orbit functions in interpolation estimates [10] indicates similar viability of the discrete transforms (129) and (131) in various applications related to digital data processing. Interpolation performance of the dual-root lattice discretization and existence of interpolation convergence criteria [24] pose open problems. The four families of Weyl orbit functions induce four families of orthogonal polynomials [29, 27] which are special cases of multivariate Jacobi and Macdonald polynomials [13]. Existence of generalization of the dual-weight lattice orthogonality of the selected subset of Macdonald polynomials [7] to the dual-root lattice poses an open problem. The related polynomial interpolation and approximation methods, cubature formulas [15] and their comparison to the weight and dual weight versions deserve further study.
- •
Besides developing novel discrete transforms on generalized and composed grids, other fundamentally different options are provided by existence of functions invariant with respect to some subgroups of the given Weyl group. These even normal subgroups of index 2 of the Weyl groups are generated as kernels of each of the sign homomorphisms. There exist six more types of special functions induced by the even subgroups, called functions, for root systems with two lengths of the roots [12] and one type for root systems with one length of the roots [28]. The dual-weight lattice discretization of all ten types of Weyl and Hartley orbit functions is derived in a unified manner and full generality in [12]. Extending the present dual-root lattice Fourier calculus to all ten types of Weyl and Hartley orbit functions poses a deep unsolved problem.
Acknowledgements
This work was supported by the Grant Agency of the Czech Technical University in Prague, grant number SGS16/239/OHK4/3T/14. LM and JH gratefully acknowledge the support of this work by RVO14000.
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[1] E. S. Barnes, The construction of perfect and extreme forms. I , Acta Arith. 5 (1958) 57–79.
- 2[2] N. Bourbaki, Groupes et algèbres de Lie, Chapiters IV, V, VI, Hermann, Paris, 1968.
- 3[3] R. N. Bracewell, Discrete Hartley transform , J. Opt. Soc. Am. 73 (1983) 1832–1835, doi: 10.1364/JOSA.73.001832 . · doi ↗
- 4[4] S. D. Bharkad, M. Kokare, Hartley transform based fingerprint matching , J. Inf. Process. Syst. 8 (2012) 85–100, doi: 10.3745/JIPS.2012.8.1.085 . · doi ↗
- 5[5] J. Cserti, G. Tichy, A simple model for the vibrational modes in honeycomb lattices , Eur. J. Phys. 25 (2004) 723–736, doi: 10.1088/0143-0807/25/6/004 . · doi ↗
- 6[6] T. Czyżycki, J. Hrivnák, Generalized discrete orbit function transforms of affine Weyl groups , J. Math. Phys. 55 (2014) 113508, doi: 10.1063/1.4901230 . · doi ↗
- 7[7] J. F. van Diejen, E. Emsiz, Orthogonality of Macdonald polynomials with unitary parameters , Math. Z. 276 (2014), 517–542, doi: 10.1007/s 00209-013-1211-4 . · doi ↗
- 8[8] L. B. Drissi, E. H. Saidi, M. Bousmina, Graphene, Lattice Field Theory and Symmetries , J. Math. Phys. 52 (2011) 022306, doi: 10.1063/1.3546030 . · doi ↗
