Introduction
A spectral measure records moments, but often conceals the structure which produces them. For a subfactor these moments are the dimensions of the box spaces, or equivalently the numbers of closed walks of even length at the root of the principal graph. The question of spectral measure blowup is to realize the same numbers on a space where the measure becomes simpler. The circular measures of [3 , 6 ] provide the basic examples, with roots of unity and trigonometric densities replacing the atoms of the rooted law. Representation graphs and joint spectral measures offer further examples in the work of Evans and Pugh [20 , 21 , 22 ] . The free orthogonal coordinate laws of [7 ] provide another example, with an S U q 2 SU_q^2 S U q 2 model and an explicit circular density.
For deformed Fourier subfactors of index M N MN M N , with M M M , N N N the orders of the 2 finite abelian groups, the models of [4 ] suggest Gram matrices of phases as blowup variables. We extend the generic formula over independent circles to arbitrary parameters, identify the compact group replacing these circles, and study its geometry and law.
We begin with 2 preliminary calculations explaining this choice of viewpoint. First, at small index > 4 > 4 > 4 , the rooted laws can still be computed entirely from finite graphs. We organize the Haagerup, Asaeda–Haagerup, 3311 and 2221 examples [1 , 24 , 30 ] through their moment recurrences, and then recover their atoms and annular multiplicities. The scalar lift associated to the annular theory of Jones [28 ] remains available, but its support now includes a reciprocal pair on the positive half-line. This is a useful computation, without being a uniform model for subfactors of larger index.
Second, the exceptional diagrams lead to a different kind of measure. Their ternary indices 2 , 3 , 5 2, 3, 5 2 , 3 , 5 are the inverses of the Deligne parameters of E 6 , E 7 , E 8 E_6, E_7, E_8 E 6 , E 7 , E 8 [16 ] . We first examine how the root affects the circular law, then turn to the signed root measures of Deligne and de Man [17 ] . For Cartan powers of the adjoint representation, their atoms admit a uniform description along the exceptional series. This illustrates the usefulness of retaining root or representation data behind a scalar measure. The question of obtaining such a description for the circular laws themselves remains open.
For the main results, let X , Y X,Y X , Y be finite abelian groups of orders M , N ≥ 2 M,N \ge2 M , N ≥ 2 , and take Q ∈ T X × Y Q \in\mathbb{T}^{X \times Y} Q ∈ T X × Y . The deformed Fourier matrix is
H = F X ⊗ Q F Y , H i a , j b = Q i b ( F X ) i j ( F Y ) a b H = F_X \otimes_Q F_Y,\qquad H_{ia,jb} = Q_{ib}(F_X)_{ij}(F_Y)_{ab} H = F X ⊗ Q F Y , H ia , j b = Q ib ( F X ) ij ( F Y ) ab
Row and column phases of Q Q Q do not change its subfactor law, so we work with the dephasing Q 0 b = Q i 0 = 1 Q_{0b}=Q_{i0}=1 Q 0 b = Q i 0 = 1 . The generic case means that all the other entries are multiplicatively independent.
Theorem A. Form, for each k ∈ X k \in X k ∈ X and e ∈ Y e \in Y e ∈ Y , the phase matrix
W i j k , e = Q i + k , j + e Q i j Q i + k , j Q i , j + e W_{ij}^{k,e} = \frac{Q_{i+k,j+e}Q_{ij}}{Q_{i+k,j}Q_{i,j+e}} W ij k , e = Q i + k , j Q i , j + e Q i + k , j + e Q ij and let K Q K_Q K Q be the closed subgroup of T X × Y \mathbb{T}^{X \times Y} T X × Y generated by the dephasings ( W i j W 00 / W i 0 W 0 j ) i j (W_{ij}W_{00}/W_{i0}W_{0j})_{ij} ( W ij W 00 / W i 0 W 0 j ) ij of these matrices. With Haar measure on K Q K_Q K Q and normalized matrix trace M − 1 T r M^{-1}Tr M − 1 T r , we have
μ H = ( 1 − 1 N ) δ 0 + 1 N l a w ( Z Z ∗ ) , Z ∈ K Q \mu_H = \left(1-\frac{1}{N}\right)\delta_0+\frac{1}{N}law(ZZ^*),\qquad Z\in K_Q μ H = ( 1 − N 1 ) δ 0 + N 1 l a w ( Z Z ∗ ) , Z ∈ K Q Consequently the box spaces satisfy
dim P n = 1 M N ∫ K Q T r ( ( Z Z ∗ ) n ) d Z \dim P_n = \frac{1}{MN}\int_{K_Q}Tr((ZZ^*)^n)\,dZ dim P n = M N 1 ∫ K Q T r (( Z Z ∗ ) n ) d Z for every $n \ge 1.
Thus the blowup has 2 ingredients: a compact abelian group and the Gram matrix of its coordinate phases. The group is the whole dephased torus T ( M − 1 ) ( N − 1 ) \mathbb{T}^{(M-1)(N-1)} T ( M − 1 ) ( N − 1 ) for generic Q Q Q , and is finite when all entries of Q Q Q are roots of unity. At a bicharacter all the dephased second differences are trivial, giving back the Fourier law. Theorem 4.1 and Proposition 4.2 establish the formula using the crossed coproduct descriptions of [4 , 8 , 11 ] .
There is also a graph interpretation. The lattice I X ⊗ I Y I_X \otimes I_Y I X ⊗ I Y , formed from the augmentation ideals of X X X and Y Y Y , is the first homology of the complete bipartite graph K X , Y K_{X,Y} K X , Y . The quotient determined by Q Q Q gives an abelian covering, maximal in the generic case. Fourier transform turns its incidence operator into the phase matrix Z Z Z , and identifies K Q K_Q K Q with the flat connections which are trivial on the relations. This is the content of Theorem 5.1 .
Theorem B. The generic moments are lower bounds for all the rooted moments. Equality at every order holds precisely when the quantum permutation group is the generic one. Otherwise the first strict inequality occurs at the length of the shortest nontrivial relation in the crossed coproduct generators. Moreover, writing d = dim K Q d=\dim K_Q d = dim K Q , we have
dim P n ∼ C ( M N ) n n − d / 2 \dim P_n \sim C(MN)^n n^{-d/2} dim P n ∼ C ( M N ) n n − d /2 with an explicit constant C > 0 C>0 C > 0 , so the rooted law determines the dimension of K Q K_Q K Q .
Theorems 4.3 , 4.4 and 6.1 describe these ways of recovering information from the law. There is also information which it loses: transposition preserves the rooted law of any complex Hadamard matrix [8 ] , and here it transposes K Q K_Q K Q . For generic parameters with M ≠ N M \ne N M = N , however, it changes the isomorphism class of the quantum permutation group, as shown in Theorem 4.6 .
The index 6 case gives a concrete picture of both the finite and the infinite possibilities:
Theorem C. For H = F 2 ⊗ Q F 3 H = F_2 \otimes_{\mathbb{Q}} F_3 H = F 2 ⊗ Q F 3 , the relation subgroups are exactly the ideals of the ring of Eisenstein integers Z [ ζ ] \mathbb{Z}[\zeta] Z [ ζ ] , where ζ = e π i / 3 \zeta= e^{\pi i/3} ζ = e π i /3 . A nonzero ideal generated by b + c ζ b+c\zeta b + c ζ gives a quantum group of order 6 ( b 2 + b c + c 2 ) 6(b^2+bc+c^2) 6 ( b 2 + b c + c 2 ) and the coset graph of the torus map { 6 , 3 } b , c \{6,3\}_{b,c} { 6 , 3 } b , c . The zero ideal gives the honeycomb lattice and the law
μ H = 1 2 δ 0 + 1 2 law ( 2 + A ) = 2 3 δ 0 + 1 6 p 3 ( ∣ x − 3 ∣ ) d x \mu_H = \frac{1}{2}\delta_0 + \frac{1}{2}\operatorname{law}(2+A) = \frac{2}{3}\delta_0 + \frac{1}{6}p_3(|x-3|)\,dx μ H = 2 1 δ 0 + 2 1 law ( 2 + A ) = 3 2 δ 0 + 6 1 p 3 ( ∣ x − 3∣ ) d x where A A A is the adjacency operator of the kagome lattice and p 3 p_3 p 3 is the density of the length of the 3-step planar random walk, expressible by a complete elliptic integral.
These are Theorems 5.10 , 5.11 and 5.15 . The finite graphs include the cube, Heawood and Pappus graphs; the infinite law explains the kagome distribution of [2 ] . At index 8 we find the diamond lattice and arbitrarily delayed exceptional moments. The triangular lattice at index 9 extends to circulant families at every square index. Following [9 ] , we locate the first Jacobi defect and construct finite-depth laws with arbitrarily long generic truncations.
§ 2 and § 4 contain the preliminaries, § 5 recalls the quantum groups, and § 6 proves the Gram formula. § 7 treats coverings and index 6, § 8 treats growth and indices 8 and 9, and § 9 contains the circulant families and Jacobi comparisons.
Acknowledgements. We would like to thank C. Arhancet and S. Palcoux for useful discussions.
Rooted laws, lifts and loop counts
We begin with the data one can read directly from a principal graph. Walk counts determine a probability measure, the choice of a root determines its weights, and a change of variable reorganizes these weights into a lift. Our examples below index 5 will serve as a point of comparison for the matrix-valued blowups later in the paper. We write T r T^r T r for the ordinary trace, displaying the dimension factor whenever a normalized trace is intended.
From walks to a measure
Let ( Γ , o ) (\Gamma,o) ( Γ , o ) be a bipartite rooted graph with bounded adjacency operator A A A on ℓ 2 ( V ) \ell^2(V) ℓ 2 ( V ) ; edge multiplicities are included in A A A . Choose the even part to contain o o o and write
A = ( 0 Λ Λ ∗ 0 ) , K = Λ Λ ∗ A = \begin{pmatrix} 0 & \Lambda\\ \Lambda^* & 0 \end{pmatrix}, \qquad K = \Lambda\Lambda^* A = ( 0 Λ ∗ Λ 0 ) , K = Λ Λ ∗
The positive operator K K K describes 2 successive steps on the graph. This is the operator whose measure we use throughout.
Definition 1.1. The rooted law of ( Γ , o ) (\Gamma,o) ( Γ , o ) is the probability measure μ \mu μ characterized by
c n = ∫ x n d μ ( x ) = ⟨ K n δ o , δ o ⟩ = ⟨ A 2 n δ o , δ o ⟩ c_n = \int x^n\,d\mu(x) = \langle K^n\delta_o,\delta_o\rangle= \langle A^{2n}\delta_o,\delta_o\rangle c n = ∫ x n d μ ( x ) = ⟨ K n δ o , δ o ⟩ = ⟨ A 2 n δ o , δ o ⟩ for n ≥ 0 n \ge0 n ≥ 0 . Thus c n c_n c n counts the walks of length $2ns t a r t i n g a n d e n d i n g a t starting and ending at s t a r t in g an d e n d in g a t o.
Equivalently, this is the image by x ↦ x 2 x \mapsto x^2 x ↦ x 2 of the spectral measure of A A A at the root. For a finite graph, the mass at an eigenvalue α \alpha α of K K K is ∥ P x δ o ∥ 2 \|P_x\delta_o\|^2 ∥ P x δ o ∥ 2 , where P x P_x P x is its spectral projection. Eigenvalues alone therefore do not determine the rooted law.
Proposition 1.2. Let p n ( v ) p_n(v) p n ( v ) count the walks of length n n n from o o o to v v v . The moments and their generating function satisfy
c n = ∑ v p n ( v ) 2 , ∑ n ≥ 0 c n z n = ⟨ ( I d − z K ) − 1 δ o , δ o ⟩ c_n = \sum_v p_n(v)^2,\qquad\sum_{n\ge0}c_n z^n = \langle(I d-zK)^{-1}\delta_o,\delta_o\rangle c n = v ∑ p n ( v ) 2 , n ≥ 0 ∑ c n z n = ⟨( I d − z K ) − 1 δ o , δ o ⟩ where the series converges for ∣ z ∣ ∥ K ∥ < 1 |z|\|K\|<1 ∣ z ∣∥ K ∥ < 1 .
Proof. For each possible midpoint v v v , choose the outward walk and the reversed return walk independently. There are p n ( v ) 2 p_n(v)^2 p n ( v ) 2 choices, giving the first formula. The second is the Neumann series for I d − z K Id-zK I d − z K , evaluated on the vector at the root. □
Finite graphs need only finitely many such comparisons. We record the elementary observation which will replace the diagonalization of the 4 graphs below.
Lemma 1.3. Suppose that Γ \Gamma Γ has m m m even vertices and that η \eta η is a finite signed measure with at most r r r atoms. If
∫ x n d η ( x ) = c n ( 0 ≤ n < m + r ) \int x^n\,\mathrm{d}\eta(x)=c_n \qquad(0\le n<m+r) ∫ x n d η ( x ) = c n ( 0 ≤ n < m + r ) then η \eta η is the rooted law of Γ \Gamma Γ .
Proof. The spectral measure of K K K has at most m m m atoms. Subtracting η \eta η gives a signed measure supported at, say, t ≤ m + r t\le m+r t ≤ m + r distinct points. Its first t t t moments vanish. The equations for its masses form a Vandermonde system at these points, which is invertible, so every mass is zero. □
For a finite-index irreducible inclusion N ⊂ M N\subset M N ⊂ M of type I I 1 \mathrm{II}_1 II 1 factors, the principal graph is rooted at the trivial N N N -N N N bimodule. If M − 1 = N M_{-1}=N M − 1 = N , M 0 = M M_0=M M 0 = M and M 1 , M 2 , … M_1,M_2,\ldots M 1 , M 2 , … is the Jones tower, its box spaces and their dimensions are
P n = N ′ ∩ M n − 1 , dim P n = c n = dim Hom ( 1 , θ ⊗ n ) P_n=N'\cap M_{n-1},\qquad\dim P_n=c_n=\dim\operatorname{Hom}(1,\theta^{\otimes n}) P n = N ′ ∩ M n − 1 , dim P n = c n = dim Hom ( 1 , θ ⊗ n )
where θ \theta θ is the dual canonical object. Multiplication by θ \theta θ corresponds to 2 steps on the graph. The dual principal graph gives the same numbers, so either graph can be used to compute the subfactor law; see [27 , 29 , 30 , 31 ] for this background.
The positive bimodule dimension vector w w w , normalized by w o = 1 w_o=1 w o = 1 , satisfies K w = [ M : N ] w Kw=[M:N]w K w = [ M : N ] w . In the finite case, Perron–Frobenius theory identifies the top atom and its mass as
x max = [ M : N ] , μ ( { x max } ) = D − 1 , D = ∑ v e v e n w v 2 x_{\max}=[M:N],\qquad\mu(\{x_{\max}\})=D^{-1},\qquad D=\sum_{v\ \mathrm{even}}w_v^2 x m a x = [ M : N ] , μ ({ x m a x }) = D − 1 , D = v even ∑ w v 2
Here D D D is the global dimension of the even part. This gives a useful check on a rooted law computed from loops.
The circle and the position of the root
For a law on [ 0 , 4 ] [0,4] [ 0 , 4 ] we lift through the map
σ ( u ) = ( u + u − 1 ) 2 , u ∈ T \sigma(u)=(u+u^{-1})^2,\qquad u\in\mathbb{T} σ ( u ) = ( u + u − 1 ) 2 , u ∈ T
by giving equal weights to the points of each fiber. The resulting circular measure ε \varepsilon ε is uniquely specified by σ ∗ ε = μ \sigma_*\varepsilon=\mu σ ∗ ε = μ and invariance under inversion and multiplication by − 1 -1 − 1 . In the notation of [3 , 6 ] , let d n d_n d n be uniform on the 2 n 2n 2 n -th roots of unity and let d n ′ = 2 d 2 n − d n d'_n=2d_{2n}-d_n d n ′ = 2 d 2 n − d n , uniform on the solutions of u 2 n = − 1 u^{2n}=-1 u 2 n = − 1 . We use the densities
h j ( u ) = 1 − Re ( u 2 j ) h_j(u)=1-\operatorname{Re}(u^{2j}) h j ( u ) = 1 − Re ( u 2 j )
and write h j d n h_jd_n h j d n for multiplication of d n d_n d n by this density.
Proposition 1.4. For the path A n − 1 A_{n-1} A n − 1 on vertices 1 , … , n − 1 1,\ldots,n-1 1 , … , n − 1 , the circular measure at vertex j j j is
ε j = h j d n \varepsilon_j=h_jd_n ε j = h j d n For the half-line rooted at j j j , the same formula holds with Haar measure in place of d n d_n d n .
Proof. The adjacency eigenvalues of the path and their weights at vertex j j j are
2 cos ( k π / n ) , 2 n sin 2 ( j k π / n ) , 1 ≤ k < n 2\cos(k\pi/n),\qquad\frac{2}{n}\sin^2(jk\pi/n),\qquad1\le k<n 2 cos ( k π / n ) , n 2 sin 2 ( j k π / n ) , 1 ≤ k < n
On the circle the points e ± i k π / n e^{\pm ik\pi/n} e ± ik π / n each have d n d_n d n -mass 1 / ( 2 n ) 1/(2n) 1/ ( 2 n ) , and their density is h j = 2 sin 2 ( j k π / n ) h_j=2\sin^2(jk\pi/n) h j = 2 sin 2 ( j k π / n ) . Their combined weight is therefore exactly the one above. The density vanishes at ± 1 \pm1 ± 1 , and invariance under u ↦ − u u\mapsto-u u ↦ − u gives the required measure after squaring the adjacency eigenvalue.
For a fixed moment order, a sufficiently distant truncation of the half-line cannot affect a walk from j j j and back. Passing to the limit in the finite paths proves the Haar formula. □
The harmonic is therefore read from the distance of the root to the missing endpoint: moving the root changes the density, even on the same path. At j = 1 j=1 j = 1 on the half-line we obtain the Catalan moments and the free Poisson law. For comparison, the remaining A , D A,D A , D formulas of [6 Theorems 2.1, 3.1, 3.2 and 4.1] are
Here A n − 1 A_{n-1} A n − 1 is rooted at an endpoint, the cycle A ~ 2 n − 1 \widetilde{A}_{2n-1} A 2 n − 1 anywhere, D n + 1 D_{n+1} D n + 1 at the end of its long arm, and D ~ n + 2 \widetilde{D}_{n+2} D n + 2 at an extending vertex. The cycle formula follows directly by diagonalizing the cyclic shift: every Fourier vector has squared modulus 1 / ( 2 n ) 1/(2n) 1/ ( 2 n ) at the root. The program zabel.py compares all 4 formulas with walk counts for 3 ≤ n ≤ 8 3 \le n \le8 3 ≤ n ≤ 8 . We return to the exceptional diagrams in § 4 .
Annular coefficients beyond the circle
To pass the threshold 4, it is convenient to use z = u 2 z=u^2 z = u 2 and the map Ψ ( z ) = 2 + z + z − 1 \Psi(z)=2+z+z^{-1} Ψ ( z ) = 2 + z + z − 1 . Its fibers are still reciprocal pairs, although they need not lie on the circle.
Proposition 1.5. Every compactly supported probability measure μ \mu μ on [ 0 , ∞ ) [0,\infty) [ 0 , ∞ ) lifts uniquely to an inversion-invariant measure ν \nu ν on T ∪ ( 0 , ∞ ) \mathbb{T}\cup(0,\infty) T ∪ ( 0 , ∞ ) under Ψ \Psi Ψ . If f ( t ) = ∑ n ≥ 0 c n t n f(t)=\sum_{n\ge0}c_nt^n f ( t ) = ∑ n ≥ 0 c n t n and b k = ∫ z k d ν ( z ) b_k=\int z^k\,\mathrm{d}\nu(z) b k = ∫ z k d ν ( z ) , then
1 + 2 ∑ k ≥ 1 b k q k = 1 − q 1 + q ( q ( 1 + q ) 2 ) 1+2\sum_{k\ge1}b_kq^k=\frac{1-q}{1+q}\left(\frac{q}{(1+q)^2}\right) 1 + 2 k ≥ 1 ∑ b k q k = 1 + q 1 − q ( ( 1 + q ) 2 q ) as formal series. The fibers over [ 0 , 4 ] [0,4] [ 0 , 4 ] lie on T \mathbb{T} T , and those over ( 4 , ∞ ) (4,\infty) ( 4 , ∞ ) lie on the positive half-line.
Proof. Solving Ψ ( z ) = x \Psi(z)=x Ψ ( z ) = x amounts to solving z 2 − ( x − 2 ) z + 1 = 0 z^2-(x-2)z+1=0 z 2 − ( x − 2 ) z + 1 = 0 . The 2 roots are inverse to each other: they are conjugate points of modulus 1 for 0 ≤ x ≤ 4 0\le x\le4 0 ≤ x ≤ 4 , and positive real points for x > 4 x>4 x > 4 . Uniform measure on each fiber constructs ν \nu ν , including the singleton fibers at the endpoints. Inversion invariance forces exactly these weights.
For the moment identity, use x = 2 + z + z − 1 x=2+z+z^{-1} x = 2 + z + z − 1 to write
1 − q 1 + q ⋅ 1 1 − q x / ( 1 + q ) 2 = 1 − q 2 ( 1 − q z ) ( 1 − q z − 1 ) = 1 + ∑ k ≥ 1 ( z k + z − k ) q k \frac{1-q}{1+q}\cdot\frac{1}{1-qx/(1+q)^2}=\frac{1-q^2}{(1-qz)(1-qz^{-1})}=1+\sum_{k\ge1}(z^k+z^{-k})q^k 1 + q 1 − q ⋅ 1 − q x / ( 1 + q ) 2 1 = ( 1 − q z ) ( 1 − q z − 1 ) 1 − q 2 = 1 + k ≥ 1 ∑ ( z k + z − k ) q k
Integration and inversion invariance give the claimed coefficients. This is the transform used in [3 , 6 ] . □
On the circle, Ψ ( u 2 ) = σ ( u ) \Psi(u^2)=\sigma(u) Ψ ( u 2 ) = σ ( u ) , so this construction is compatible with the preceding circular measures. For a subfactor of index > 4 >4 > 4 , its significance is given by the annular Temperley–Lieb decomposition of [28 ] :
c n = C n + ∑ k = 1 n ( 2 n n − k ) a k , C n = 1 n + 1 ( 2 n n ) (1) c_n=C_n+\sum_{k=1}^{n}\binom{2n}{n-k}a_k,\qquad C_n=\frac{1}{n+1}\binom{2n}{n} \tag*{(1)} c n = C n + k = 1 ∑ n ( n − k 2 n ) a k , C n = n + 1 1 ( n 2 n ) (1)
The coefficient a k a_k a k is the total multiplicity of lowest weight k k k , summing over rotation eigenvalues, while the weight zero term is Temperley–Lieb. Comparing this triangular expansion with the transform yields
a 1 = 2 b 1 + 1 , a k = 2 b k ( k ≥ 2 ) a_1=2b_1+1,\qquad a_k=2b_k\quad(k\ge2) a 1 = 2 b 1 + 1 , a k = 2 b k ( k ≥ 2 )
In particular, the moments of the lift have a representation-theoretic meaning. The first nonzero annular coefficient requires no spectral computation.
Lemma 1.6. Suppose that a connected locally finite bipartite graph has no multiple edges, has exactly 1 vertex at each distance less than n n n from its root, and has m ≥ 1 m \ge1 m ≥ 1 vertices at distance n n n . Then
c k = C k ( k < n ) , c n − C n = m − 1 c_k=C_k\quad(k<n),\qquad c_n-C_n=m-1 c k = C k ( k < n ) , c n − C n = m − 1 For a principal graph of index > 4 >4 > 4 , the annular coefficients satisfy a k = 0 a_k=0 a k = 0 for k < n k<n k < n and a n = m − 1 a_n=m-1 a n = m − 1 .
Proof. A closed walk which reaches distance n n n must use at least 2 n 2n 2 n steps. Before this order, every walk is a Dyck path on the initial chain, giving C k C_k C k . At order n n n , the only new walks travel straight to a vertex at distance n n n and straight back. There are m m m such choices, in place of the single choice on the half-line. All other walks remain unchanged, proving the difference m − 1 m-1 m − 1 . Substitution in (1) , starting at k = 1 k=1 k = 1 , gives the annular assertion. □
Finite computations between indices 4 and 5
The classification in [30 ] lists 5 non-Temperley–Lieb principal graph pairs in the interval ( 4 , 5 ) (4,5) ( 4 , 5 ) , up to duality. We use 4 of them: Haagerup and Asaeda–Haagerup [1 , 24 ] , the 3311 example of Goodman, de la Harpe and Jones [23 ] , and the 2221 example of Izumi [26 ] . Figure 1 fixes the roots. In the last 2 pairs, the graphs coincide and their 4 arms have the indicated lengths.
Figure 1. The 4 pairs of principal graphs, with the root at the left.
We start with integer sequences. This keeps the computation rational until the final extraction of the atoms, and treats the 4 examples in the same way.
Proposition 1.7. For each graph in the following table, define r 0 , r 1 r_0,r_1 r 0 , r 1 as indicated and put
r n + 2 = s r n + 1 − p r n r_{n+2}=sr_{n+1}-pr_n r n + 2 = s r n + 1 − p r n Its rooted moments, with c 0 = 1 c_0=1 c 0 = 1 , are given for n ≥ 1 n\ge1 n ≥ 1 by
Table 1.
Thus, apart from the displayed elementary powers, only a recurrence of order 2 is needed.
Proof. Let x ± x_{\pm} x ± be the roots of t 2 − s t + p t^2-st+p t 2 − s t + p . They are distinct and positive in all 4 cases. The recurrence has the solution
r n = r 1 − r 0 x − x + − x − x + n + r 0 x + − r 1 x + − x − x − n r_n=\frac{r_1-r_0x_-}{x_+-x_-}x_+^n+\frac{r_0x_+-r_1}{x_+-x_-}x_-^n r n = x + − x − r 1 − r 0 x − x + n + x + − x − r 0 x + − r 1 x − n
Hence each proposed sequence is the moment sequence of a finite signed measure: the displayed powers give its rational atoms, and x ± x_{\pm} x ± give 2 more atoms. Add an atom at zero if needed to make the zeroth moment equal to 1. The resulting support sizes are r = 4 , 6 , 4 , 3 r = 4, 6, 4, 3 r = 4 , 6 , 4 , 3 .
Use the dual graphs for Haagerup and Asaeda–Haagerup, and the principal graphs for 3311 and 2221. They have respectively m = 4 , 6 , 6 , 4 m = 4, 6, 6, 4 m = 4 , 6 , 6 , 4 even vertices. Lemma 1.3 reduces the proof to walk counts through orders 7, 11, 9, 6, respectively. Starting with p 0 = δ o p_0 = \delta_o p 0 = δ o , the updates p n + 1 = A p n p_{n+1} = Ap_n p n + 1 = A p n and c n = ∑ v p n ( v ) 2 c_n = \sum_v p_n(v)^2 c n = ∑ v p n ( v ) 2 give exactly the proposed values at these orders. The program riis.py performs these finite comparisons in integer arithmetic on both graphs of each pair, and checks the recurrences through order 40. □
The radicals enter only when we solve these 4 quadratic recurrences. They give the following description of the laws.
Theorem 1.8. The rooted laws of the Haagerup, Asaeda–Haagerup, 3311 and 2221 subfactors are, in this order,
μ = 1 3 δ 0 + 1 3 δ 2 + ∑ ± 1 6 ( 1 ∓ 3 13 ) δ ( 5 ± 13 ) / 2 \mu= \frac{1}{3}\delta_0 + \frac{1}{3}\delta_2 + \sum_{\pm}\frac{1}{6}\left(1 \mp\frac{3}{\sqrt{13}}\right)\delta_{(5\pm\sqrt{13})/2} μ = 3 1 δ 0 + 3 1 δ 2 + ± ∑ 6 1 ( 1 ∓ 13 3 ) δ ( 5 ± 13 ) /2 μ = 1 4 δ 0 + 1 4 δ 1 + 1 8 δ 2 + 1 8 δ 3 + ∑ ± 1 8 ( 1 ∓ 4 17 ) δ ( 5 ± 17 ) / 2 \mu= \frac{1}{4}\delta_0 + \frac{1}{4}\delta_1 + \frac{1}{8}\delta_2 + \frac{1}{8}\delta_3 + \sum_{\pm}\frac{1}{8}\left(1 \mp\frac{4}{\sqrt{17}}\right)\delta_{(5\pm\sqrt{17})/2} μ = 4 1 δ 0 + 4 1 δ 1 + 8 1 δ 2 + 8 1 δ 3 + ± ∑ 8 1 ( 1 ∓ 17 4 ) δ ( 5 ± 17 ) /2 μ = 5 12 δ 0 + 1 4 δ 2 + ∑ ± 2 ∓ 3 12 δ 3 ± 3 \mu= \frac{5}{12}\delta_0 + \frac{1}{4}\delta_2 + \sum_{\pm}\frac{2\mp\sqrt{3}}{12}\delta_{3\pm\sqrt{3}} μ = 12 5 δ 0 + 4 1 δ 2 + ± ∑ 12 2 ∓ 3 δ 3 ± 3 μ = 2 3 δ 1 + ∑ ± 1 6 ( 1 ∓ 3 21 ) δ ( 5 ± 21 ) / 2 \mu= \frac{2}{3}\delta_1 + \sum_{\pm}\frac{1}{6}\left(1 \mp\frac{3}{\sqrt{21}}\right)\delta_{(5\pm\sqrt{21})/2} μ = 3 2 δ 1 + ± ∑ 6 1 ( 1 ∓ 21 3 ) δ ( 5 ± 21 ) /2 where the sum over ± \pm ± includes both conjugate terms.
Proof. In the first row of Proposition 1.7, the coefficients of x + n x_+^n x + n and x − n x_-^n x − n in r n r_n r n are 1 − 3 / 13 1 - 3/\sqrt{13} 1 − 3/ 13 and 1 + 3 / 13 1 + 3/\sqrt{13} 1 + 3/ 13 . Dividing by 6 gives the quadratic masses, while 2 n + 1 / 6 2^{n+1}/6 2 n + 1 /6 gives mass 1 / 3 1/3 1/3 at 2. Their total mass is 2 / 3 2/3 2/3 , leaving mass 1 / 3 1/3 1/3 at zero. The other rows work in exactly the same way: solve the recurrence using r 0 , r 1 r_0,r_1 r 0 , r 1 , divide by the denominator in the table, and restore total mass 1 at zero. In the 2221 case no mass is left at zero.
For Asaeda–Haagerup, the quadratic contribution before division by 8 is
r n = ( 1 − 4 17 ) ( 5 + 17 2 ) n + ( 1 + 4 17 ) ( 5 − 17 2 ) n r_n = \left(1-\frac{4}{\sqrt{17}}\right)\left(\frac{5+\sqrt{17}}{2}\right)^n + \left(1+\frac{4}{\sqrt{17}}\right)\left(\frac{5-\sqrt{17}}{2}\right)^n r n = ( 1 − 17 4 ) ( 2 5 + 17 ) n + ( 1 + 17 4 ) ( 2 5 − 17 ) n
The atoms at 1, 2, 3 have total mass 1/2 and the quadratic pair has mass 1/4, leaving mass 1/4 at zero. Lemma 1.3 identifies these measures with the rooted laws, and riis.py checks their radical weights by exact arithmetic. □
Only the top atom lies above 4. It is the index, with weight D − 1 D^{-1} D − 1 , and Proposition 1.5 replaces it by 2 atoms of weight 1 / ( 2 D ) 1/(2D) 1/ ( 2 D ) at z , z − 1 z,z^{-1} z , z − 1 , where z > 1 z > 1 z > 1 and z + z − 1 = [ M : N ] − 2 z + z^{-1} = [M:N] - 2 z + z − 1 = [ M : N ] − 2 . All remaining mass lifts to the circle. Combining this with Lemma 1.6 gives the following data:
Table 1 (PDF p. 7).
The moments, and the annular multiplicities given by (1) , start as follows:
Table 1 (PDF p. 8).
The computations therefore separate 2 questions. The scalar lift and its annular coefficients remain explicit above index 4; the choice of a useful model at arbitrary index is another matter. The Hadamard examples in the following sections replace the varying scalar support by a compact phase group and a Gram matrix.
Exceptional graphs and root measures
The ternary indices 2, 3, 5 of the exceptional graphs are the inverses of their Deligne parameters. We examine the graph weights first, then compute a uniform family of signed root measures. This separates the 2 calculations underlying the question at the end of the section.
Root choices and ternary grids
Retain d n d_n d n , d n ′ d'_n d n ′ , h j h_j h j from § 2 . Let d l ′ ′ d''_l d l ′′ be uniform on the points e 2 π i j / ( 12 l ) e^{2\pi i j/(12l)} e 2 π ij / ( 12 l ) with j ≡ ± 1 ( m o d 6 ) j \equiv\pm1 \pmod6 j ≡ ± 1 ( mod 6 ) , and let d l ′ ′ ′ = 1 2 ( 3 d 3 − d 1 ) d'''_l=\frac{1}{2}(3d_3-d_1) d l ′′′ = 2 1 ( 3 d 3 − d 1 ) be uniform on the sixth roots other than ± 1 \pm1 ± 1 . The smallest exceptional graph illustrates the dependence on the root.
Proposition 2.1. In E 6 E_6 E 6 , let s s s be the tip of the short arm and a a a the tip of an arm of length 2. Their rooted laws satisfy
μ s = 1 2 ( 1 + 1 3 ) δ 2 − 3 + 1 2 ( 1 − 1 3 ) δ 2 + 3 , μ a = 1 2 μ s + 1 2 δ 1 \mu_s=\frac{1}{2}\left(1+\frac{1}{\sqrt{3}}\right)\delta_{2-\sqrt{3}}+\frac{1}{2}\left(1-\frac{1}{\sqrt{3}}\right)\delta_{2+\sqrt{3}},\qquad\mu_a=\frac{1}{2}\mu_s+\frac{1}{2}\delta_1 μ s = 2 1 ( 1 + 3 1 ) δ 2 − 3 + 2 1 ( 1 − 3 1 ) δ 2 + 3 , μ a = 2 1 μ s + 2 1 δ 1 Their circular lifts are
ε s = 1 3 ( 1 + 2 h 1 ) d 2 ′ ′ , ε a = 1 2 ε s + 1 2 d 1 ′ ′ ′ \varepsilon_s=\frac{1}{3}(1+2h_1)d''_2,\qquad\varepsilon_a=\frac{1}{2}\varepsilon_s+\frac{1}{2}d'''_1 ε s = 3 1 ( 1 + 2 h 1 ) d 2 ′′ , ε a = 2 1 ε s + 2 1 d 1 ′′′ so changing the tip removes one component of the circular measure and rescales the other.
Proof. Exchange the 2 long arms and decompose the vertex space into the symmetric and antisymmetric subspaces. The antisymmetric part is a 2-vertex path, so the square of its adjacency is the identity. The symmetric part is the weighted path with edge weights 1, 2 \sqrt{2} 2 , 1. Reflection of this path exchanges e s e_s e s and the normalized sum of the 2 long-arm tips.
The vector e a e_a e a has squared norm 1 / 2 1/2 1/2 in each subspace, giving μ a = ( μ s + δ 1 ) / 2 \mu_a=(\mu_s+\delta_1)/2 μ a = ( μ s + δ 1 ) /2 . The square of the weighted path, restricted to the parity class of s s s , has diagonal entries 1, 3 and off-diagonal entries 2 \sqrt{2} 2 . Its eigenvalues are 2 ± 3 2\pm\sqrt{3} 2 ± 3 , whose weights follow from total mass 1 and first moment 1.
On the 2 fibers of d 2 ′ ′ d''_2 d 2 ′′ , the density ( 1 + 2 h 1 ) / 3 (1+2h_1)/3 ( 1 + 2 h 1 ) /3 is 1 ∓ 1 / 3 1\mp1/\sqrt{3} 1 ∓ 1/ 3 at σ ( u ) = 2 ± 3 \sigma(u)=2\pm\sqrt{3} σ ( u ) = 2 ± 3 . Each fiber has d 2 ′ ′ d''_2 d 2 ′′ -mass 1 / 2 1/2 1/2 , and d 1 ′ ′ ′ d'''_1 d 1 ′′′ lifts δ 1 \delta_1 δ 1 . This gives the circular formulas. □
We now use the long-arm tip in E 6 E_6 E 6 , and the tip of the longest arm in E 7 E_7 E 7 , E 8 E_8 E 8 . The Coxeter numbers h h h , indices and initial moments at these tips are
Table 2.
The eigenvalues 2 cos ( π m / h ) 2\cos(\pi m/h) 2 cos ( π m / h ) , with m m m running over the exponents, place the circular support on the grid of 2 h = 12 l 2h=12l 2 h = 12 l roots of unity. This explains l = h / 6 l=h/6 l = h /6 ; the weights still depend on the root. The formulas of [3 ] are as follows.
Theorem 2.2 ([3 ] ). The circular measures at these roots are
ε E 6 = 1 6 ( d 2 ′ ′ + 2 h 1 d 2 ′ ′ + 3 d 1 ′ ′ ) , ε E 7 = 1 3 ( 2 h 2 d 3 ′ ′ + d 1 ′ ) , ε E 8 = 1 3 ( 2 ( h 1 + h 3 ) d 5 ′ ′ − d 1 ′ ′ ) \varepsilon_{E_6}=\frac{1}{6}\left(d''_2+2h_1d''_2+3d''_1\right),\qquad\varepsilon_{E_7}=\frac{1}{3}\left(2h_2d''_3+d'_1\right),\qquad\varepsilon_{E_8}=\frac{1}{3}\left(2(h_1+h_3)d''_5-d''_1\right) ε E 6 = 6 1 ( d 2 ′′ + 2 h 1 d 2 ′′ + 3 d 1 ′′ ) , ε E 7 = 3 1 ( 2 h 2 d 3 ′′ + d 1 ′ ) , ε E 8 = 3 1 ( 2 ( h 1 + h 3 ) d 5 ′′ − d 1 ′′ ) In terms of the binary grids, the same measures are
ε E 6 = h 1 d 12 + 1 2 ( d 12 − d 6 − d 4 + d 3 ) , ε E 7 = h 2 d 9 ′ + 1 2 ( d 1 ′ − d 3 ′ ) , ε E 8 = ( h 1 + h 3 ) d 15 ′ − 1 2 ( d 5 ′ + d 3 ′ ) \varepsilon_{E_6}=h_1d_{12}+\frac{1}{2}(d_{12}-d_6-d_4+d_3),\qquad\varepsilon_{E_7}=h_2d'_9+\frac{1}{2}(d'_1-d'_3),\qquad\varepsilon_{E_8}=(h_1+h_3)d'_{15}-\frac{1}{2}(d'_5+d'_3) ε E 6 = h 1 d 12 + 2 1 ( d 12 − d 6 − d 4 + d 3 ) , ε E 7 = h 2 d 9 ′ + 2 1 ( d 1 ′ − d 3 ′ ) , ε E 8 = ( h 1 + h 3 ) d 15 ′ − 2 1 ( d 5 ′ + d 3 ′ ) The respective ternary indices are l = 2 , 3 , 5 l=2,3,5 l = 2 , 3 , 5 .
Proof. The first E 6 E_6 E 6 formula follows from Proposition 2.1. The remaining identities are [3 Theorems 7.1 and 8.7] , with the binary E 6 E_6 E 6 expression also given in [6 Theorem 6.2] . Passing between the 2 presentations amounts to separating root-of-unity grids into their congruence classes. All 6 expressions are checked against graph walks through order 12 by zabel.py. □
Signed root measures and their moments
The exceptional series of [16 ] uses the following parameter μ \mu μ , expressed through the dual Coxeter number h ∨ h^\vee h ∨ :
Table 1 (PDF p. 9).
For example, the adjoint dimension is given throughout the table by
dim g = 2 ( 5 − μ ) ( 6 + μ ) μ ( 1 + μ ) (2) \dim\mathfrak{g}=\frac{2(5-\mu)(6+\mu)}{\mu(1+\mu)} \tag*{(2)} dim g = μ ( 1 + μ ) 2 ( 5 − μ ) ( 6 + μ ) (2)
Similar formulas describe small tensor powers [16 , 33 ] . We recover this one from the signed root measures of Deligne and de Man [17 ] .
Let Δ + \Delta_+ Δ + be the positive roots, ρ \rho ρ their half-sum and θ \theta θ the highest root. Normalize the pairing on weights by the Killing form, so ( θ , θ ) = 1 / h ∨ (\theta,\theta)=1/h^\vee ( θ , θ ) = 1/ h ∨ . For a dominant integral weight λ \lambda λ , define
L g ( λ ) = ∑ α ∈ Δ + ( δ 12 ( λ + ρ , α ) − δ 12 ( ρ , α ) ) L_{\mathfrak{g}}(\lambda)=\sum_{\alpha\in\Delta_+}\left(\delta_{12(\lambda+\rho,\alpha)}-\delta_{12(\rho,\alpha)}\right) L g ( λ ) = α ∈ Δ + ∑ ( δ 12 ( λ + ρ , α ) − δ 12 ( ρ , α ) )
Each root moves a unit atom to the right. The resulting measure has total mass zero and support in ( 0 , ∞ ) (0,\infty) ( 0 , ∞ ) . In the normalization ( ⋅ , ⋅ ) 2 (\cdot,\cdot)_2 ( ⋅ , ⋅ ) 2 where long roots have squared length 2, the atom locations are μ ( λ + ρ , α ) 2 \mu(\lambda+\rho,\alpha)_2 μ ( λ + ρ , α ) 2 and μ ( ρ , α ) 2 \mu(\rho,\alpha)_2 μ ( ρ , α ) 2 .
Proposition 2.3. For L = L g ( λ ) L=L_{\mathfrak{g}}(\lambda) L = L g ( λ ) , the function ξ ( x ) = − L ( ( − ∞ , x ] ) \xi(x)=-L((-\infty,x]) ξ ( x ) = − L (( − ∞ , x ]) is a sum of interval indicators, and
ξ ( x ) = ∑ α ∈ Δ + 1 [ 12 ( ρ , α ) , 12 ( λ + ρ , α ) ) ( x ) , ∫ f d L = ∫ f ′ ( x ) ξ ( x ) d x \xi(x)=\sum_{\alpha\in\Delta_+}\mathbf{1}_{[12(\rho,\alpha),12(\lambda+\rho,\alpha))}(x),\qquad\int f\,\mathrm{d}L=\int f'(x)\xi(x)\,\mathrm{d}x ξ ( x ) = α ∈ Δ + ∑ 1 [ 12 ( ρ , α ) , 12 ( λ + ρ , α )) ( x ) , ∫ f d L = ∫ f ′ ( x ) ξ ( x ) d x for f ∈ C 1 ( 0 , ∞ ) f\in C^1(0,\infty) f ∈ C 1 ( 0 , ∞ ) . Its logarithmic and first 2 ordinary moments are
∫ log x d L ( x ) = log dim V λ , ∫ x d L ( x ) = 24 ( λ , ρ ) , ∫ x 2 d L ( x ) = 72 c λ \int\log x\,\mathrm{d}L(x)=\log\dim V_\lambda,\qquad\int x\,\mathrm{d}L(x)=24(\lambda,\rho),\qquad\int x^2\,\mathrm{d}L(x)=72c_\lambda ∫ log x d L ( x ) = log dim V λ , ∫ x d L ( x ) = 24 ( λ , ρ ) , ∫ x 2 d L ( x ) = 72 c λ where c λ = ( λ , λ + 2 ρ ) c_\lambda=(\lambda,\lambda+2\rho) c λ = ( λ , λ + 2 ρ ) is the quadratic Casimir eigenvalue, equal to 1 on the adjoint representation.
Proof. Dominance gives 2 ( λ + ρ , α ) ≥ 2 ( ρ , α ) > 0 2(\lambda+\rho,\alpha)\ge2(\rho,\alpha)>0 2 ( λ + ρ , α ) ≥ 2 ( ρ , α ) > 0 . Each difference δ b − δ a \delta_b-\delta_a δ b − δ a therefore contributes the interval [ a , b ) [a,b) [ a , b ) to ξ \xi ξ , and f ( b ) − f ( a ) f(b)-f(a) f ( b ) − f ( a ) is the integral of f ′ f' f ′ on that interval. This proves the integral formula and ξ ≥ 0 \xi\ge0 ξ ≥ 0 .
The logarithmic identity is the Weyl dimension formula: dim V λ = ∏ α ∈ Δ + ( λ + ρ , α ) ( ρ , α ) \dim V_\lambda=\prod_{\alpha\in\Delta_+}\frac{(\lambda+\rho,\alpha)}{(\rho,\alpha)} dim V λ = ∏ α ∈ Δ + ( ρ , α ) ( λ + ρ , α ) . The linear identity uses ∑ α ∈ Δ + α = 2 ρ \sum_{\alpha\in\Delta_+}\alpha=2\rho ∑ α ∈ Δ + α = 2 ρ . For the quadratic identity, the Killing normalization gives ∑ α ∈ Δ + ( v , α ) 2 = ( v , v ) / 2 \sum_{\alpha\in\Delta_+}(v,\alpha)^2=(v,v)/2 ∑ α ∈ Δ + ( v , α ) 2 = ( v , v ) /2 , and hence
1 2 ( ( λ + ρ , λ + ρ ) − ( ρ , ρ ) ) = 1 2 ( λ , λ + 2 ρ ) \frac{1}{2}\bigl((\lambda+\rho,\lambda+\rho)-(\rho,\rho)\bigr)=\frac{1}{2}(\lambda,\lambda+2\rho) 2 1 ( ( λ + ρ , λ + ρ ) − ( ρ , ρ ) ) = 2 1 ( λ , λ + 2 ρ )
This proves the remaining identities.
Thus L L L compares 2 ordered positive diagonal operators. For λ ≠ 0 \lambda\ne0 λ = 0 , normalizing ξ ( x ) d x \xi(x)\,dx ξ ( x ) d x gives a probability measure; retaining the signs instead makes dimension and Casimir simple integrals.
One can also retain the Casimir through the heat measure of the compact group. If V V V is the adjoint representation, D = dim V D=\dim V D = dim V , and V ⊗ n = ⨁ λ m n , λ V λ V^{\otimes n}=\bigoplus_\lambda m_{n,\lambda}V_\lambda V ⊗ n = ⨁ λ m n , λ V λ , the image ν t \nu_t ν t of heat measure under χ V / D \chi_V/D χ V / D satisfies
∫ x n d ν t ( x ) = D − n ∑ λ m n , λ e − t c λ dim V λ \int x^n\,d\nu_t(x)=D^{-n}\sum_\lambda m_{n,\lambda}e^{-tc_\lambda}\dim V_\lambda ∫ x n d ν t ( x ) = D − n λ ∑ m n , λ e − t c λ dim V λ
The limit t → ∞ t\to\infty t → ∞ gives the Haar character moments. These representation measures provide models for the graph question, without identifying them with the circular laws.
A uniform calculation for Cartan powers
Take λ = k θ \lambda=k\theta λ = k θ , so that V k θ V_{k\theta} V k θ is the k k k -th Cartan power of the adjoint representation. A grading by the highest coroot reduces the root calculation to one repeated translation. Write x α = 1 2 ( ρ , α ) x_\alpha=\frac{1}{2}(\rho,\alpha) x α = 2 1 ( ρ , α ) and let τ a \tau_a τ a denote translation by a a a .
Lemma 2.4. For any simple Lie algebra, the levels ⟨ α , θ ∨ ⟩ \langle\alpha,\theta^\vee\rangle ⟨ α , θ ∨ ⟩ of positive roots are 0 , 1 , 2 0,1,2 0 , 1 , 2 . Only θ \theta θ has level 2, and 2 h ∨ − 4 2h^\vee-4 2 h ∨ − 4 roots have level 1. Put
U g = ∑ ⟨ α , θ ∨ ⟩ = 1 ( δ x α + μ − δ x α ) , μ = 6 h ∨ U_{\mathfrak g}=\sum_{\langle\alpha,\theta^\vee\rangle=1}\left(\delta_{x_\alpha+\mu}-\delta_{x_\alpha}\right),\qquad\mu=\frac{6}{h^\vee} U g = ⟨ α , θ ∨ ⟩ = 1 ∑ ( δ x α + μ − δ x α ) , μ = h ∨ 6 Then the Cartan measures satisfy
L g ( k θ ) = ∑ j = 0 k − 1 τ j μ U g + δ 6 + ( 2 k − 1 ) μ − δ 6 − μ L_{\mathfrak g}(k\theta)=\sum_{j=0}^{k-1}\tau_{j\mu}U_{\mathfrak g}+\delta_{6+(2k-1)\mu}-\delta_{6-\mu} L g ( k θ ) = j = 0 ∑ k − 1 τ j μ U g + δ 6 + ( 2 k − 1 ) μ − δ 6 − μ for every integer $k\ge 1.
Proof. The highest root is dominant and long. Hence the integer 2 ( α , θ ) / ( θ , θ ) 2(\alpha,\theta)/(\theta,\theta) 2 ( α , θ ) / ( θ , θ ) is at least zero, and Cauchy–Schwarz bounds it by 2, with equality only at α = θ \alpha=\theta α = θ . Summing these levels over Δ + \Delta_+ Δ + gives 2 ⟨ ρ , θ ∨ ⟩ = 2 h ∨ − 2 2\langle\rho,\theta^\vee\rangle=2h^\vee-2 2 ⟨ ρ , θ ∨ ⟩ = 2 h ∨ − 2 . Subtracting the contribution 2 of θ \theta θ gives the asserted count at level 1.
Adding k θ k\theta k θ moves an atom by k μ k\mu k μ times its level. Level zero contributes nothing. At level 1, split the displacement into k k k successive steps of size μ \mu μ : the intermediate atoms cancel, leaving the translated copies of U g U_{\mathfrak g} U g . At level 2, the starting point is x θ = μ ( h ∨ − 1 ) = 6 − μ x_\theta=\mu(h^\vee-1)=6-\mu x θ = μ ( h ∨ − 1 ) = 6 − μ and the displacement is 2 k μ 2k\mu 2 k μ .
The level-one measure is particularly short on the exceptional series. Although the number of roots increases, most consecutive endpoints cancel.
Proposition 2.5. For the Lie algebras in the exceptional series, we have
U g = δ 4 + δ 5 − μ + δ 6 − μ − δ μ − δ 1 + μ − δ 2 U_{\mathfrak g}=\delta_4+\delta_{5-\mu}+\delta_{6-\mu}-\delta_\mu-\delta_{1+\mu}-\delta_2 U g = δ 4 + δ 5 − μ + δ 6 − μ − δ μ − δ 1 + μ − δ 2 with coincident atoms combined at each value of μ \mu μ .
Proof. List the starting points x α x_{\alpha} x α of the level-one shifts. For A 1 A_{1} A 1 there are none and the displayed expression cancels to zero. For G 2 G_{2} G 2 the list is 3 / 2 , 2 , 5 / 2 , 3 3/2, 2, 5/2, 3 3/2 , 2 , 5/2 , 3 , with step μ = 3 / 2 \mu= 3/2 μ = 3/2 . For the remaining types, the values of x α / μ x_{\alpha}/\mu x α / μ are given below; exponents denote multiplicities.
Table 3.
For example, at A 2 A_{2} A 2 the 2 starting points are both 2, so U g = 2 δ 4 − 2 δ 2 U_{\mathfrak g}=2\delta_{4}-2\delta_{2} U g = 2 δ 4 − 2 δ 2 , as claimed. In each other row, shifting the list by one and subtracting the original list leaves exactly the 6 endpoints in the statement. The lists can be generated from the Cartan matrices by successive root reflections; zabel.py performs this enumeration and the cancellations in exact rational arithmetic. □
Except at A 1 A_{1} A 1 , G 2 G_{2} G 2 , the lists are 3 progressions of step μ \mu μ , from μ \mu μ to 4 − μ 4-\mu 4 − μ , from 1 + μ 1+\mu 1 + μ to 5 − 2 μ 5-2\mu 5 − 2 μ , and from 2 to 6 − 2 μ 6-2\mu 6 − 2 μ . Their starts and the points just after their ends give the 6 surviving atoms. Translation now gives the Cartan formulas.
Theorem 2.6. For g \mathfrak g g in the exceptional series and k ≥ 1 k \ge1 k ≥ 1 , the Cartan dimension is
dim V k θ = 6 + ( 2 k − 1 ) μ 6 + ( k − 1 ) μ ∏ j = 1 k ( 4 + ( j − 1 ) μ ) ( 5 + ( j − 2 ) μ ) ( 6 + ( j − 1 ) μ ) j μ ( 1 + j μ ) ( 2 + ( j − 1 ) μ ) \dim V_{k\theta}=\frac{6+(2k-1)\mu}{6+(k-1)\mu}\prod_{j=1}^{k}\frac{(4+(j-1)\mu)(5+(j-2)\mu)(6+(j-1)\mu)}{j\mu(1+j\mu)(2+(j-1)\mu)} dim V k θ = 6 + ( k − 1 ) μ 6 + ( 2 k − 1 ) μ j = 1 ∏ k j μ ( 1 + j μ ) ( 2 + ( j − 1 ) μ ) ( 4 + ( j − 1 ) μ ) ( 5 + ( j − 2 ) μ ) ( 6 + ( j − 1 ) μ ) The corresponding signed measure is
L g ( k θ ) = ∑ j = 1 k ( δ 4 + ( j − 1 ) μ + δ 5 + ( j − 2 ) μ − δ j μ − δ 1 + j μ − δ 2 + ( j − 1 ) μ ) + ∑ j = 1 k − 1 δ 6 + ( j − 1 ) μ + δ 6 + ( 2 k − 1 ) μ L_{\mathfrak g}(k\theta)=\sum_{j=1}^{k}\left(\delta_{4+(j-1)\mu}+\delta_{5+(j-2)\mu}-\delta_{j\mu}-\delta_{1+j\mu}-\delta_{2+(j-1)\mu}\right)+\sum_{j=1}^{k-1}\delta_{6+(j-1)\mu}+\delta_{6+(2k-1)\mu} L g ( k θ ) = j = 1 ∑ k ( δ 4 + ( j − 1 ) μ + δ 5 + ( j − 2 ) μ − δ j μ − δ 1 + j μ − δ 2 + ( j − 1 ) μ ) + j = 1 ∑ k − 1 δ 6 + ( j − 1 ) μ + δ 6 + ( 2 k − 1 ) μ Its first moment is 2 k ( 6 − μ ) 2k(6-\mu) 2 k ( 6 − μ ) and its second moment is 12 k ( 6 + ( k − 1 ) μ ) 12k(6+(k-1)\mu) 12 k ( 6 + ( k − 1 ) μ ) . At k = 1 k=1 k = 1 the dimension formula is (2) .
Proof. Translate the 6 atoms of Proposition 2.5 by j μ j\mu j μ , for 0 ≤ j < k 0 \le j < k 0 ≤ j < k , and add the highest-root contribution from Lemma 2.4 . The positive atom δ 6 − μ \delta_{6-\mu} δ 6 − μ in the first translate cancels the negative highest-root atom. Reindexing the remaining terms gives the stated signed measure.
Its logarithmic integral is the logarithm of the product of the positive locations divided by the product of the negative locations, with multiplicities. Proposition 2.3 identifies this ratio with the dimension. To write it as the displayed product, include the missing factor 6 + ( k − 1 ) μ 6+(k-1)\mu 6 + ( k − 1 ) μ in the product and divide by the same factor outside it.
For the ordinary moments, use x θ = 6 − μ x_{\theta}=6-\mu x θ = 6 − μ and
24 ( k θ , ρ ) = 2 k ( 6 − μ ) , c k θ = k 2 h ∨ + k ( 6 − μ ) 6 24(k\theta,\rho)=2k(6-\mu), \qquad c_{k\theta}=\frac{k^{2}}{h^{\vee}}+\frac{k(6-\mu)}{6} 24 ( k θ , ρ ) = 2 k ( 6 − μ ) , c k θ = h ∨ k 2 + 6 k ( 6 − μ ) Proposition 2.3 gives the 2 formulas immediately. □
The product is the Cartan dimension formula of Landsberg and Manivel [33 ] ; the signed measure is the restriction of the Deligne–de Man interpolation [17 ] to the Cartan ray. The first values, checked independently by the Weyl dimension formula in zabel.py, are
Table 4.
For k = 1 k=1 k = 1 the entire signed measure reduces to
L g ( θ ) = δ 4 + δ 5 − μ + δ 6 + μ − δ μ − δ 1 + μ − δ 2 L_{\mathfrak{g}}(\theta)=\delta_{4}+\delta_{5-\mu}+\delta_{6+\mu}-\delta_{\mu}-\delta_{1+\mu}-\delta_{2} L g ( θ ) = δ 4 + δ 5 − μ + δ 6 + μ − δ μ − δ 1 + μ − δ 2
Its 6 locations are affine functions of μ \mu μ , and its second moment is always 72. This is the kind of uniform description that motivates a return to the graph question.
Indeed, E 6 E_{6} E 6 , E 7 E_{7} E 7 , E 8 E_{8} E 8 are simply laced, so h = h ∨ h=h^{\vee} h = h ∨ and their ternary indices satisfy l = h / 6 = 1 / μ l=h/6=1/\mu l = h /6 = 1/ μ . The equality identifies the grid parameters, but does not determine the root weights of Theorem 2.2 .
Question 2.7. Is there a uniform root-theoretic description of the circular laws of E 6 E_{6} E 6 , E 7 E_{7} E 7 , E 8 E_{8} E 8 , with their specified roots, at
μ ∈ { 1 / 2 , 1 / 3 , 1 / 5 } \mu\in\{1/2,1/3,1/5\} μ ∈ { 1/2 , 1/3 , 1/5 } or at least of the masses of their rooted laws? Can such a description extend to a natural family of measures along the whole exceptional series?
The desired construction should explain the weights and their dependence on the root, as the signed Cartan construction explains its affine atoms.
Deformed Fourier matrices, quantum groups
Throughout the remaining sections, X , Y X,Y X , Y are finite abelian groups of orders M , N ≥ 2 M,N\geq2 M , N ≥ 2 , written additively. We recall the quantum group construction and the crossed coproduct descriptions of [4 , 8 , 11 ] , leading to Theorem 3.12 and the word count of Theorem 3.14 . Commuting-square methods also give isolation criteria [36 ] , relative commutant calculations and intermediate subfactors [37 ] . Group-type descriptions appear in [13 ] , while [34 ] uses colored planar algebras and spectral criteria to study infinite depth.
Hadamard matrices and quantum groups
A compact quantum group is described by a unital C ∗ C^* C ∗ -algebra C ( G ) C(G) C ( G ) with a coassociative comultiplication and the usual cancellation conditions. Its Haar state h h h satisfies
( h ⊗ I d ) Δ ( a ) = ( I d ⊗ h ) Δ ( a ) = h ( a ) 1 (h\otimes Id)\Delta(a)=(Id\otimes h)\Delta(a)=h(a)1 ( h ⊗ I d ) Δ ( a ) = ( I d ⊗ h ) Δ ( a ) = h ( a ) 1
For a unitary representation U U U on a finite-dimensional space, the character is χ ( U ) = ( Tr ⊗ I d ) ( U ) \chi(U)=(\operatorname{Tr}\otimes Id)(U) χ ( U ) = ( Tr ⊗ I d ) ( U ) . The characters satisfy χ ( U ⊗ V ) = χ ( U ) χ ( V ) \chi(U\otimes V)=\chi(U)\chi(V) χ ( U ⊗ V ) = χ ( U ) χ ( V ) , and Haar averaging gives the orthogonal projection onto Fix ( U ) \operatorname{Fix}(U) Fix ( U ) . In particular,
h ( χ ( U ) n ) = dim Fix ( U ⊗ n ) h(\chi(U)^n)=\dim\operatorname{Fix}(U^{\otimes n}) h ( χ ( U ) n ) = dim Fix ( U ⊗ n )
We use the representation-theoretic conventions of [35 ] .
Definition 3.1. A complex Hadamard matrix of size k k k is a matrix H ∈ M k ( T ) H\in M_k(\mathbb{T}) H ∈ M k ( T ) whose rows are pairwise orthogonal. A magic unitary is a square matrix of projections whose entries in each row and each column sum to one. The universal algebra generated by a k × k k\times k k × k magic unitary is C ( S k + ) C(S_k^+) C ( S k + ) , with
Δ ( v i j ) = ∑ a v i a ⊗ v a j \Delta(v_{ij})=\sum_a v_{ia}\otimes v_{aj} Δ ( v ij ) = a ∑ v ia ⊗ v aj
For the rows H i H_i H i of H H H , put
ξ i j = 1 k ⋅ H i H j , p i j = Proj ( ξ i j ) \xi_{ij}=\frac{1}{\sqrt{k}}\cdot\frac{H_i}{H_j},\qquad p_{ij}=\operatorname{Proj}(\xi_{ij}) ξ ij = k 1 ⋅ H j H i , p ij = Proj ( ξ ij )
where the quotients are coordinatewise. The Hopf image G H G_H G H is the smallest compact quantum subgroup of S k + S_k^+ S k + through which the representation v i j ↦ p i j v_{ij}\mapsto p_{ij} v ij ↦ p ij factors.
Associated to H H H is a subfactor of index k k k , called Hadamard subfactor, which comes from the commuting square formed by the diagonal algebra of M k ( C ) M_k(\mathbb{C}) M k ( C ) and by its conjugate by H H H [29 , 31 ] . Its box spaces, and so its rooted law, can be read on G H G_H G H , as follows:
Proposition 3.2. The matrix ( p i j ) (p_{ij}) ( p ij ) is magic. If u u u is the fundamental representation of G H G_H G H , then the rooted law of the Hadamard subfactor is the Haar law of the positive main character
χ H = ∑ i u i i , c n = h ( χ H n ) = dim Fix ( u ⊗ n ) \chi_H=\sum_i u_{ii},\qquad c_n=h(\chi_H^n)=\dim\operatorname{Fix}(u^{\otimes n}) χ H = i ∑ u ii , c n = h ( χ H n ) = dim Fix ( u ⊗ n ) for every $n\geq 0.
Proof. For fixed j j j , the vectors ξ i j \xi_{ij} ξ ij are an orthonormal basis, by row orthogonality of H H H . For fixed i i i , the same follows by conjugating row orthogonality. This proves the magic relations. The identification of the Hadamard box spaces with the invariant tensors of the Hopf image is the construction of [5 ] . Haar averaging gives their dimensions. Positivity follows because every u i i u_{ii} u ii is a projection, and 0 ≤ χ H ≤ k 0\leq\chi_H\leq k 0 ≤ χ H ≤ k . □
A representation is inner faithful when its Hopf image is the whole quantum group. In the Fourier setting the crossed coproduct model reduces the computation to a subgroup N Q N_Q N Q of a free abelian lattice.
Definition 3.4. A Gram blowup of a rooted law at index M N MN M N is a compact group K K K , with Haar probability measure, and a continuous matrix-valued function Z : K → M M , N ( T ) Z:K\to M_{M,N}(\mathbb{T}) Z : K → M M , N ( T ) such that
μ = ( 1 − 1 N ) δ 0 + 1 N law ( Z Z ∗ ) \mu=\left(1-\frac{1}{N}\right)\delta_0+\frac{1}{N}\operatorname{law}(ZZ^*) μ = ( 1 − N 1 ) δ 0 + N 1 law ( Z Z ∗ ) The matrix law is taken with respect to Haar measure and the normalized trace M − 1 Tr M^{-1}\operatorname{Tr} M − 1 Tr .
The positive moments of this expression are ( M N ) − 1 ∫ K Tr ( ( Z Z ∗ ) n ) (MN)^{-1}\int_K\operatorname{Tr}((ZZ^*)^n) ( M N ) − 1 ∫ K Tr (( Z Z ∗ ) n ) . Its first moment is one because Tr ( Z Z ∗ ) = M N \operatorname{Tr}(ZZ^*)=MN Tr ( Z Z ∗ ) = M N . This viewpoint comes from [4 ] . The function algebra C ( K ) ⊗ M M ( C ) C(K)\otimes M_M(\mathbb{C}) C ( K ) ⊗ M M ( C ) carries the matrix variable and the state giving its law. The character can therefore be studied before its matrix spectral decomposition is pushed down to a scalar measure.
Diţă deformations and the generic Gram law
Choose a decomposition of X X X into cyclic groups and let F X F_X F X be the tensor product of the corresponding Fourier matrices F n = ( w j k ) j k F_n=(w^{jk})_{jk} F n = ( w j k ) j k , with w = e 2 π i / n w=e^{2\pi i/n} w = e 2 π i / n and j , k ∈ { 0 , … , n − 1 } j,k\in\{0,\ldots,n-1\} j , k ∈ { 0 , … , n − 1 } . By [4 Proposition 3.1 (2) and (3)] , F X F_X F X is the matrix of the Fourier transform of X X X and ( F X ) i j (F_X)_{ij} ( F X ) ij is a bicharacter of i , j ∈ X i,j\in X i , j ∈ X , which is symmetric and nondegenerate. The matrix F Y F_Y F Y is defined from a decomposition of Y Y Y into cyclic groups. For a matrix Q ∈ T X × Y Q\in\mathbb{T}^{X\times Y} Q ∈ T X × Y , the Diţă deformation [19 ] of F X ⊗ F Y F_X\otimes F_Y F X ⊗ F Y is the matrix H = F X ⊗ Q F Y H=F_X\otimes_QF_Y H = F X ⊗ Q F Y indexed by X × Y X\times Y X × Y with entries
H i a , j b = Q i b ( F X ) i j ( F Y ) a b , i , j ∈ X , a , b ∈ Y H_{ia,jb}=Q_{ib}(F_X)_{ij}(F_Y)_{ab},\qquad i,j\in X,\ a,b\in Y H ia , j b = Q ib ( F X ) ij ( F Y ) ab , i , j ∈ X , a , b ∈ Y
For ( i , a ) , ( k , c ) ∈ X × Y (i,a),(k,c)\in X\times Y ( i , a ) , ( k , c ) ∈ X × Y we have
∑ j ∈ X , b ∈ Y H i a , j b H k c , j b ‾ = ∑ b ∈ Y Q i b Q k b ‾ ( F Y ) a b ( F Y ) c b ‾ ∑ j ∈ X ( F X ) i j ( F X ) k j ‾ = M N δ i k δ a c \sum_{j\in X,b\in Y}H_{ia,jb}\overline{H_{kc,jb}}=\sum_{b\in Y}Q_{ib}\overline{Q_{kb}}(F_Y)_{ab}\overline{(F_Y)_{cb}}\sum_{j\in X}(F_X)_{ij}\overline{(F_X)_{kj}}=MN\delta_{ik}\delta_{ac} j ∈ X , b ∈ Y ∑ H ia , j b H k c , j b = b ∈ Y ∑ Q ib Q k b ( F Y ) ab ( F Y ) c b j ∈ X ∑ ( F X ) ij ( F X ) k j = M N δ ik δ a c
by the orthogonality of the rows of F X F_X F X and then of F Y F_Y F Y . Thus H H H is a complex Hadamard matrix of size M N MN M N , and it defines a Hadamard subfactor of index M N MN M N . If Δ \Delta Δ and Δ ′ \Delta' Δ ′ are diagonal unitary matrices indexed by X X X and Y Y Y , replacing Q Q Q by Δ Q Δ ′ \Delta Q\Delta' Δ Q Δ ′ multiplies each row of H H H and each column of H H H by a phase. This does not change the lines spanned by the coordinatewise quotients of the rows, hence it does not change the magic unitary of § 5.1 , the quantum group G H G_H G H and the rooted law. We may therefore assume that Q Q Q is dephased, that is Q 0 b = Q i 0 = 1 Q_{0b}=Q_{i0}=1 Q 0 b = Q i 0 = 1 for any i ∈ X i\in X i ∈ X and any b ∈ Y b\in Y b ∈ Y . A dephased matrix Q Q Q is called generic if its ( M − 1 ) ( N − 1 ) (M-1)(N-1) ( M − 1 ) ( N − 1 ) remaining entries are multiplicatively independent [4 Definition 4.3] .
Theorem 3.5 ([4]). Suppose that Q Q Q is generic. Let Z Z Z be an X × Y X\times Y X × Y random matrix with independent entries uniformly distributed on T \mathbb{T} T , and put B = Z Z ∗ B=ZZ^* B = Z Z ∗ . Then for any integer n ≥ 1 n\ge1 n ≥ 1 the n n n -th moment of the rooted law μ H \mu_H μ H of the Hadamard subfactor is
c n = 1 M N E ( Tr ( B n ) ) (3) c_n=\frac{1}{MN}\mathbb{E}\bigl(\operatorname{Tr}(B^n)\bigr) \tag*{(3)} c n = M N 1 E ( Tr ( B n ) ) (3) Equivalently, μ H = ( 1 − 1 N ) δ 0 + 1 N law ( B ) \mu_H=\left(1-\frac{1}{N}\right)\delta_0+\frac{1}{N}\operatorname{law}(B) μ H = ( 1 − N 1 ) δ 0 + N 1 law ( B ) , where law ( B ) \operatorname{law}(B) law ( B ) is the mean eigenvalue distribution of B B B for the normalized trace 1 M Tr \frac{1}{M}\operatorname{Tr} M 1 Tr .
Proof. By § 5.1 , the rooted law is the law of the main character of G H G_H G H for the Haar state. For generic Q Q Q this law is the measure of the statement by [4 Theorem 4.6 and Proposition 5.2] . The moments of order n ≥ 1 n\ge1 n ≥ 1 of this measure are 1 N ⋅ 1 M E ( Tr ( B n ) ) \frac{1}{N}\cdot\frac{1}{M}\mathbb{E}\bigl(\operatorname{Tr}(B^n)\bigr) N 1 ⋅ M 1 E ( Tr ( B n ) ) , which is (3) . □
Theorem 3.5 is also the case N Q = { 1 } N_Q=\{1\} N Q = { 1 } of Theorem 4.1 below. For 2 rows the matrix integral reduces to a planar random walk, see Proposition 5.4 below.
The crossed coproduct model
We recall the factorization of [4 Section 3] . The free wreath product Y ≀ ∗ X Y\wr_*X Y ≀ ∗ X of [4 Definition 3.4] , a variant of the construction of [10 ] , has the following function algebra. It is generated by a magic unitary v = ( v i j ) i , j ∈ X v=(v_{ij})_{i,j\in X} v = ( v ij ) i , j ∈ X whose entries depend only on i − j i-j i − j , and by magic unitaries u ( i ) = ( u a b ( i ) ) a , b ∈ Y u^{(i)}=(u^{(i)}_{ab})_{a,b\in Y} u ( i ) = ( u ab ( i ) ) a , b ∈ Y , i ∈ X i\in X i ∈ X , whose entries depend only on a − b a-b a − b , with the relations
u a b ( i ) v i j = v i j u a b ( i ) u^{(i)}_{ab}v_{ij}=v_{ij}u^{(i)}_{ab} u ab ( i ) v ij = v ij u ab ( i )
By [4 Lemma 3.5] , the relations on v v v and on each u ( i ) u^{(i)} u ( i ) are those of the regular magic unitaries of C ( X ) C(X) C ( X ) and C ( Y ) C(Y) C ( Y ) .
Let Y ∗ X Y^{*X} Y ∗ X be the free product of copies Y ( i ) Y^{(i)} Y ( i ) , i ∈ X i\in X i ∈ X , of Y Y Y , and denote by c ( i ) c^{(i)} c ( i ) the element c ∈ Y c\in Y c ∈ Y of the i i i -th copy. The group X X X acts on Y ∗ X Y^{*X} Y ∗ X by s ⋅ c ( i ) = c ( i + s ) s\cdot c^{(i)}=c^{(i+s)} s ⋅ c ( i ) = c ( i + s ) . For an action of X X X on a discrete group Γ \Gamma Γ , the crossed coproduct C ∗ ( Γ ) ⋊ C ( X ) C^*(\Gamma)\rtimes C(X) C ∗ ( Γ ) ⋊ C ( X ) is the algebra C ∗ ( Γ ) ⊗ C ( X ) C^*(\Gamma)\otimes C(X) C ∗ ( Γ ) ⊗ C ( X ) with the comultiplication [4 Definition 3.7]
Δ ( g ⊗ δ k ) = ∑ l ∈ X ( g ⊗ δ l ) ⊗ ( ( − l ) ⋅ g ⊗ δ k − l ) , g ∈ Γ , k ∈ X (4) \Delta(g\otimes\delta_k)=\sum_{l\in X}(g\otimes\delta_l)\otimes((-l)\cdot g\otimes\delta_{k-l}),\qquad g\in\Gamma,\ k\in X \tag*{(4)} Δ ( g ⊗ δ k ) = l ∈ X ∑ ( g ⊗ δ l ) ⊗ (( − l ) ⋅ g ⊗ δ k − l ) , g ∈ Γ , k ∈ X (4)
By [4 Lemma 3.8] , the Fourier transform of each copy of C ( Y ) C(Y) C ( Y ) gives an isomorphism C ( Y ≀ ∗ X ) ≃ C ∗ ( Y ∗ X ) ⋊ C ( X ) C(Y\wr_*X)\simeq C^*(Y^{*X})\rtimes C(X) C ( Y ≀ ∗ X ) ≃ C ∗ ( Y ∗ X ) ⋊ C ( X ) , under which v i j v_{ij} v ij corresponds to 1 ⊗ δ i − j 1\otimes\delta_{i-j} 1 ⊗ δ i − j and c ( i ) ⊗ 1 c^{(i)}\otimes1 c ( i ) ⊗ 1 corresponds to ∑ a ∈ Y ( F Y ) a c a u a 0 ( i ) \sum_{a\in Y}(F_Y)_{ac}a\,u^{(i)}_{a0} ∑ a ∈ Y ( F Y ) a c a u a 0 ( i ) .
On the Hilbert space C X × Y \mathbb{C}^{X\times Y} C X × Y with standard basis ( e j ⊗ e e ) j ∈ X , e ∈ Y (e_j\otimes e_e)_{j\in X,e\in Y} ( e j ⊗ e e ) j ∈ X , e ∈ Y we use the orthonormal basis
ξ k e = M − 1 2 ∑ j ∈ X ( F X ) j k e j ⊗ e e , k ∈ X , e ∈ Y \xi_{ke}=M^{-\frac12}\sum_{j\in X}(F_X)_{jk}e_j\otimes e_e,\qquad k\in X,\ e\in Y ξ k e = M − 2 1 j ∈ X ∑ ( F X ) j k e j ⊗ e e , k ∈ X , e ∈ Y
and the subspaces E k = span { ξ k e : e ∈ Y } E_k=\operatorname{span}\{\xi_{ke}:e\in Y\} E k = span { ξ k e : e ∈ Y } .
Proposition 3.6 ([4]). Let u u u be the magic unitary of H = F X ⊗ Q F Y H=F_X\otimes_QF_Y H = F X ⊗ Q F Y . The representation π \pi π of C ( S X × Y + ) C(S^+_{X\times Y}) C ( S X × Y + ) defined by u u u factors through C ( Y ≀ ∗ X ) ≃ C ∗ ( Y ∗ X ) ⋊ C ( X ) C(Y\wr_*X)\simeq C^*(Y^{*X})\rtimes C(X) C ( Y ≀ ∗ X ) ≃ C ∗ ( Y ∗ X ) ⋊ C ( X ) . The function f ∈ C ( X ) f\in C(X) f ∈ C ( X ) acts on E k E_k E k by the scalar f ( k ) f(k) f ( k ) , and
π ( c ( i ) ) ξ k e = Q i , e − c Q i − k , e Q i , e Q i − k , e − c ξ k , e − c , i , k ∈ X , c , e ∈ Y (5) \pi(c^{(i)})\xi_{ke}=
\frac{Q_{i,e-c}Q_{i-k,e}}{Q_{i,e}Q_{i-k,e-c}}\xi_{k,e-c},\qquad i,k\in X,\ c,e\in Y \tag*{(5)} π ( c ( i ) ) ξ k e = Q i , e Q i − k , e − c Q i , e − c Q i − k , e ξ k , e − c , i , k ∈ X , c , e ∈ Y (5) In particular the restriction of π \pi π to C ( X ) C(X) C ( X ) is faithful.
Proof. The factorization is [4 Proposition 3.6] , composed with the isomorphism of [4 Lemma 3.8] . The factorizing map is surjective, since v i j = ∑ a u i a , j b v_{ij}=\sum_a u_{ia,jb} v ij = ∑ a u ia , j b and u a b i = ∑ j u i a , j b u_{ab}^{i}=\sum_j u_{ia,jb} u ab i = ∑ j u ia , j b are images of sums of entries of the fundamental magic unitary. Formula (5) is [4 Lemma 3.9] , where the basis vectors are not normalized. Finally, v i j = ∑ a ∈ Y u i a , j b v_{ij}=\sum_{a\in Y}u_{ia,jb} v ij = ∑ a ∈ Y u ia , j b is the orthogonal projection onto E i − j E_{i-j} E i − j by the formula for W i a , j b ( ξ k e ) W_{ia,jb}(\xi_{ke}) W ia , j b ( ξ k e ) in the proof of [4 Lemma 3.9] , so that 1 ⊗ δ k 1\otimes\delta_k 1 ⊗ δ k acts as the orthogonal projection onto E k E_k E k .
By (5) , a word c 1 ( i 1 ) … c n ( i n ) c_1^{(i_1)}\dots c_n^{(i_n)} c 1 ( i 1 ) … c n ( i n ) maps ξ k e \xi_{ke} ξ k e to a multiple of ξ k , e − d \xi_{k,e-d} ξ k , e − d , where d = c 1 + ⋯ + c n d=c_1+\dots+c_n d = c 1 + ⋯ + c n is its degree. The degree defines a homomorphism deg : Y ∗ X → Y \operatorname{deg}:Y^{*X}\to Y deg : Y ∗ X → Y , and the elements of degree zero act diagonally in the basis ( ξ k e ) (\xi_{ke}) ( ξ k e ) . Following [4 Theorem 3.10] , let Γ X , Y \Gamma_{X,Y} Γ X , Y be the quotient of Y ∗ X Y^{*X} Y ∗ X by the commutators of elements of degree zero. This subgroup of commutators is stable under the action of X X X , so the representation π \pi π factors through C ∗ ( Γ X , Y ) ⋊ C ( X ) C^*(\Gamma_{X,Y})\rtimes C(X) C ∗ ( Γ X , Y ) ⋊ C ( X ) [4 Theorem 3.10] .
We write x i y d x^i y^d x i y d for the basis element ( i , d ) (i,d) ( i , d ) of the group ring Z [ X × Y ] \mathbb{Z}[X\times Y] Z [ X × Y ] , and I X ⊂ Z [ X ] I_X\subset\mathbb{Z}[X] I X ⊂ Z [ X ] , I Y ⊂ Z [ Y ] I_Y\subset\mathbb{Z}[Y] I Y ⊂ Z [ Y ] for the augmentation ideals. Thus I X I_X I X is free abelian with basis x i − 1 x^i-1 x i − 1 , i ≠ 0 i\ne0 i = 0 , and I Y I_Y I Y is free abelian with basis y c − 1 y^c-1 y c − 1 , c ≠ 0 c\ne0 c = 0 .
Lemma 3.7. Let T T T be the kernel of the degree map Γ X , Y → Y \Gamma_{X,Y}\to Y Γ X , Y → Y , and put t i c = ( − c ) ( 0 ) c ( i ) t_{ic}=(-c)^{(0)}c^{(i)} t i c = ( − c ) ( 0 ) c ( i ) for i ∈ X i\in X i ∈ X and c ∈ Y c\in Y c ∈ Y . The map c ↦ c ( 0 ) c\mapsto c^{(0)} c ↦ c ( 0 ) splits the degree map, so that Γ X , Y = T ⋊ Y \Gamma_{X,Y}=T\rtimes Y Γ X , Y = T ⋊ Y . The group T T T is abelian, and there exists an isomorphism
T → I X ⊗ I Y ⊂ Z [ X × Y ] , t i c ↦ ( x i − 1 ) ( y c − 1 ) (6) T\to I_X\otimes I_Y\subset\mathbb{Z}[X\times Y],\qquad t_{ic}\mapsto(x^i-1)(y^c-1) \tag*{(6)} T → I X ⊗ I Y ⊂ Z [ X × Y ] , t i c ↦ ( x i − 1 ) ( y c − 1 ) (6) under which conjugation by ( − d ) ( 0 ) (-d)^{(0)} ( − d ) ( 0 ) is the multiplication by y d y^d y d and the action of s ∈ X s\in X s ∈ X is the multiplication by x s x^s x s . In particular the elements t i c t_{ic} t i c with i ≠ 0 i\ne0 i = 0 and c ≠ 0 c\ne0 c = 0 form a basis of T T T .
Proof. The group T T T is abelian by definition of Γ X , Y \Gamma_{X,Y} Γ X , Y , and deg ( c ( 0 ) ) = c \deg(c^{(0)})=c deg ( c ( 0 ) ) = c . Since c ( i ) = c ( 0 ) t i c c^{(i)}=c^{(0)}t_{ic} c ( i ) = c ( 0 ) t i c , the relation c ( i ) d ( i ) = ( c + d ) ( i ) c^{(i)}d^{(i)}=(c+d)^{(i)} c ( i ) d ( i ) = ( c + d ) ( i ) becomes
( − d ) ( 0 ) t i c d ( 0 ) = t i , c + d t i d − 1 (7) (-d)^{(0)}t_{ic}d^{(0)}=t_{i,c+d}t_{id}^{-1} \tag*{(7)} ( − d ) ( 0 ) t i c d ( 0 ) = t i , c + d t i d − 1 (7)
The group Γ X , Y \Gamma_{X,Y} Γ X , Y is generated by the elements c ( 0 ) c^{(0)} c ( 0 ) and t i c t_{ic} t i c . By (7) , the conjugates of the elements t i c t_{ic} t i c by the elements of Y ( 0 ) Y^{(0)} Y ( 0 ) are products of elements t i c t_{ic} t i c . We deduce that T T T is generated by the t i c t_{ic} t i c . Note that t 0 c = t i 0 = 1 t_{0c}=t_{i0}=1 t 0 c = t i 0 = 1 .
Conversely, consider the semidirect product ( I X ⊗ I Y ) ⋊ Y (I_X\otimes I_Y)\rtimes Y ( I X ⊗ I Y ) ⋊ Y in which conjugation by − d -d − d is the multiplication by y d y^d y d , and put w i c = ( x i − 1 ) ( y c − 1 ) w_{ic}=(x^i-1)(y^c-1) w i c = ( x i − 1 ) ( y c − 1 ) . The identity
y d w i c + w i d = ( x i − 1 ) ( y c + d − y d ) + ( x i − 1 ) ( y d − 1 ) = w i , c + d y^d w_{ic}+w_{id}=(x^i-1)(y^{c+d}-y^d)+(x^i-1)(y^d-1)=w_{i,c+d} y d w i c + w i d = ( x i − 1 ) ( y c + d − y d ) + ( x i − 1 ) ( y d − 1 ) = w i , c + d
shows that c ↦ c w i c c\mapsto c w_{ic} c ↦ c w i c is a group homomorphism Y → ( I X ⊗ I Y ) ⋊ Y Y\to(I_X\otimes I_Y)\rtimes Y Y → ( I X ⊗ I Y ) ⋊ Y for each i ∈ X i\in X i ∈ X . These homomorphisms define a homomorphism on Y ∗ X Y^{*X} Y ∗ X . Its restriction to the elements of degree zero takes values in the abelian group I X ⊗ I Y I_X\otimes I_Y I X ⊗ I Y , hence it factors through Γ X , Y \Gamma_{X,Y} Γ X , Y . It sends t i c t_{ic} t i c to w i c w_{ic} w i c . Since the elements w i c w_{ic} w i c with i , c ≠ 0 i,c\ne0 i , c = 0 form a basis of I X ⊗ I Y I_X\otimes I_Y I X ⊗ I Y and generate the image of T T T , while the t i c t_{ic} t i c generate T T T , the restriction to T T T is an isomorphism, and (7) gives the description of the conjugation. Finally,
s ⋅ t i c = ( − c ) ( s ) c ( s + i ) = ( − c ) ( 0 ) t s , − c c ( 0 ) t s + i , c s\cdot t_{ic}=(-c)^{(s)}c^{(s+i)}=(-c)^{(0)}t_{s,-c}c^{(0)}t_{s+i,c} s ⋅ t i c = ( − c ) ( s ) c ( s + i ) = ( − c ) ( 0 ) t s , − c c ( 0 ) t s + i , c
which corresponds to y c w s , − c + w s + i , c = ( x s − 1 ) ( 1 − y c ) + ( x s + i − 1 ) ( y c − 1 ) = x s w i c y^c w_{s,-c}+w_{s+i,c}=(x^s-1)(1-y^c)+(x^{s+i}-1)(y^c-1)=x^s w_{ic} y c w s , − c + w s + i , c = ( x s − 1 ) ( 1 − y c ) + ( x s + i − 1 ) ( y c − 1 ) = x s w i c .
The group T T T is free abelian of rank ( M − 1 ) ( N − 1 ) (M-1)(N-1) ( M − 1 ) ( N − 1 ) , which is [4 Proposition 4.2] . The module structure (6) is also used in [8 Section 4.2] . We identify T T T with I X ⊗ I Y I_X\otimes I_Y I X ⊗ I Y through (6) and write its group law additively when we compute in $\mathbb{Z}[X\times Y]`.
The quotient determined by the parameter matrix
An element of Γ X , Y \Gamma_{X,Y} Γ X , Y can act by a different scalar on each subspace E k E_k E k . Since an element f ∈ C ( X ) f \in C(X) f ∈ C ( X ) acts on E k E_k E k by the scalar f ( k ) f(k) f ( k ) , such elements give candidate relations r ⊗ 1 = 1 ⊗ f r \otimes1 = 1 \otimes f r ⊗ 1 = 1 ⊗ f in the Hopf image. The following notion [11 Definition 2.1] selects the relations which are compatible with the Hopf algebra structure.
Definition 3.8. Let X X X act on a discrete group Γ \Gamma Γ . A quotient datum consists of an X X X -stable normal subgroup D ⊂ Γ D \subset\Gamma D ⊂ Γ and a group homomorphism Φ : D → C ( X , T ) \Phi: D \to C(X,\mathbb{T}) Φ : D → C ( X , T ) , r ↦ Φ r r \mapsto\Phi_r r ↦ Φ r , such that Φ g r g − 1 = Φ r \Phi_{grg^{-1}} = \Phi_r Φ g r g − 1 = Φ r for any g ∈ Γ g \in\Gamma g ∈ Γ and
Φ r ( l + h ) = Φ r ( l ) Φ ( − l ) ⋅ r ( h ) , l , h ∈ X , r ∈ D \Phi_r(l+h)=\Phi_r(l)\Phi_{(-l)\cdot r}(h), \qquad l,h\in X,\ r\in D Φ r ( l + h ) = Φ r ( l ) Φ ( − l ) ⋅ r ( h ) , l , h ∈ X , r ∈ D We denote by C [ Γ / D ] ⋊ Φ C ( X ) \mathbb{C}[\Gamma/D]\rtimes_{\Phi} C(X) C [ Γ/ D ] ⋊ Φ C ( X ) the Hopf algebra k [ Γ / D ] ⋊ Φ k X k[\Gamma/D]\rtimes_{\Phi} k^X k [ Γ/ D ] ⋊ Φ k X of [11 Proposition 2.4] , for k = C k=\mathbb{C} k = C and G = H = X G=H=X G = H = X .
The basic properties of this algebra, that we will need in what follows, are as follows:
Proposition 3.9. Let ( D , Φ ) (D,\Phi) ( D , Φ ) be a quotient datum for Γ \Gamma Γ .
C [ Γ / D ] ⋊ Φ C ( X ) \mathbb{C}[\Gamma/D]\rtimes_{\Phi} C(X) C [ Γ/ D ] ⋊ Φ C ( X ) is the quotient of C [ Γ ] ⋊ C ( X ) \mathbb{C}[\Gamma]\rtimes C(X) C [ Γ ] ⋊ C ( X ) by the ideal J J J generated by the elements r ⊗ 1 − 1 ⊗ Φ r r\otimes1-1\otimes\Phi_r r ⊗ 1 − 1 ⊗ Φ r , with r ∈ D r\in D r ∈ D , and it has a basis indexed by ( Γ / D ) × X (\Gamma/D)\times X ( Γ/ D ) × X .
C [ Γ / D ] ⋊ Φ C ( X ) \mathbb{C}[\Gamma/D]\rtimes_{\Phi} C(X) C [ Γ/ D ] ⋊ Φ C ( X ) is a compact Hopf ∗ * ∗ -algebra, with involution ( g ⊗ f ) ∗ = g − 1 ⊗ f ‾ (g\otimes f)^*=g^{-1}\otimes\overline{f} ( g ⊗ f ) ∗ = g − 1 ⊗ f .
C [ Γ / D ] ⋊ Φ C ( X ) \mathbb{C}[\Gamma/D]\rtimes_{\Phi} C(X) C [ Γ/ D ] ⋊ Φ C ( X ) embeds as a dense ∗ * ∗ -subalgebra of its enveloping C ∗ C^* C ∗ -algebra, denoted C ∗ ( Γ / D ) ⋊ Φ C ( X ) C^*(\Gamma/D)\rtimes_{\Phi} C(X) C ∗ ( Γ/ D ) ⋊ Φ C ( X ) , which is the quotient of C ∗ ( Γ ) ⋊ C ( X ) C^*(\Gamma)\rtimes C(X) C ∗ ( Γ ) ⋊ C ( X ) by the closed ideal generated by the elements r ⊗ 1 − 1 ⊗ Φ r r\otimes1-1\otimes\Phi_r r ⊗ 1 − 1 ⊗ Φ r , with r ∈ D r\in D r ∈ D .
Proof. (1) By [11 Proposition 2.4] , C [ Γ / D ] ⋊ Φ C ( X ) \mathbb{C}[\Gamma/D]\rtimes_{\Phi} C(X) C [ Γ/ D ] ⋊ Φ C ( X ) has a basis indexed by ( Γ / D ) × X (\Gamma/D)\times X ( Γ/ D ) × X , and there is a surjective Hopf algebra map q q q from C [ Γ ] ⋊ C ( X ) \mathbb{C}[\Gamma]\rtimes C(X) C [ Γ ] ⋊ C ( X ) onto it, with
q ( r ⊗ 1 ) = q ( 1 ⊗ Φ r ) q(r\otimes1)=q(1\otimes\Phi_r) q ( r ⊗ 1 ) = q ( 1 ⊗ Φ r )
for any r ∈ D r\in D r ∈ D . Thus J ⊂ ker q J\subset\ker q J ⊂ ker q . Conversely, if j j j is a section of Γ → Γ / D \Gamma\to\Gamma/D Γ → Γ/ D , then
g ⊗ δ h = ( g j ( g ‾ ) − 1 ⊗ 1 ) ( j ( g ‾ ) ⊗ δ h ) g\otimes\delta_h=(gj(\overline{g})^{-1}\otimes1)(j(\overline{g})\otimes\delta_h) g ⊗ δ h = ( g j ( g ) − 1 ⊗ 1 ) ( j ( g ) ⊗ δ h )
is congruent modulo J J J to a multiple of j ( g ‾ ) ⊗ δ h j(\overline{g})\otimes\delta_h j ( g ) ⊗ δ h . Thus the elements j ( c ) ⊗ δ h j(c)\otimes\delta_h j ( c ) ⊗ δ h , with c ∈ Γ / D c\in\Gamma/D c ∈ Γ/ D and h ∈ X h\in X h ∈ X , span the quotient by J J J , whereas their images under q q q are linearly independent, and we conclude that we have ker q = J \ker q=J ker q = J .
(2) The involution ( g ⊗ f ) ∗ = g − 1 ⊗ f ‾ (g\otimes f)^*=g^{-1}\otimes\overline{f} ( g ⊗ f ) ∗ = g − 1 ⊗ f of C [ Γ ] ⋊ C ( X ) \mathbb{C}[\Gamma]\rtimes C(X) C [ Γ ] ⋊ C ( X ) preserves the relations r ⊗ 1 = 1 ⊗ Φ r r\otimes1=1\otimes\Phi_r r ⊗ 1 = 1 ⊗ Φ r , since Φ r ‾ = Φ r − 1 \overline{\Phi_r}=\Phi_{r^{-1}} Φ r = Φ r − 1 . Hence C [ Γ / D ] ⋊ Φ C ( X ) \mathbb{C}[\Gamma/D]\rtimes_{\Phi} C(X) C [ Γ/ D ] ⋊ Φ C ( X ) is a Hopf ∗ * ∗ -algebra, and q q q is a map of Hopf ∗ * ∗ -algebras. The quotient is spanned by the images of coefficients of unitary representations, which remain unitary. It is therefore compact, giving the result.
(3) The Haar state of a compact Hopf algebra is faithful [18 Theorems 3.7 and 4.4] , so the GNS representation is injective, and this gives the embedding. As for the description of the enveloping C ∗ C^* C ∗ -algebra, this follows from (1).
Since the antipode of C ( S X × Y + ) C(S^+_{X\times Y}) C ( S X × Y + ) satisfies S 2 = I d S^2=Id S 2 = I d and Φ \Phi Φ takes values in T \mathbb{T} T , the Hopf images below can be computed on the Hopf ∗ * ∗ -algebras C [ Γ ] ⋊ C ( X ) \mathbb{C}[\Gamma]\rtimes C(X) C [ Γ ] ⋊ C ( X ) and C [ Γ / D ] ⋊ Φ C ( X ) \mathbb{C}[\Gamma/D]\rtimes_{\Phi} C(X) C [ Γ/ D ] ⋊ Φ C ( X ) . The criterion that we will use is as follows:
Proposition 3.10 ([11 ] ). Let ρ \rho ρ be a representation of C ∗ ( Γ ) ⋊ C ( X ) C^*(\Gamma)\rtimes C(X) C ∗ ( Γ ) ⋊ C ( X ) whose restriction to C ( X ) C(X) C ( X ) is faithful, and let D D D be the set of the elements r ∈ Γ r\in\Gamma r ∈ Γ such that, for some f ∈ C ( X ) f\in C(X) f ∈ C ( X ) ,
ρ ( r ⊗ 1 ) = ρ ( 1 ⊗ f ) \rho(r\otimes1)=\rho(1\otimes f) ρ ( r ⊗ 1 ) = ρ ( 1 ⊗ f ) Assume that D D D is X X X -stable, and carries a homomorphism Φ \Phi Φ with ρ ( r ⊗ 1 ) = ρ ( 1 ⊗ Φ r ) \rho(r\otimes1)=\rho(1\otimes\Phi_r) ρ ( r ⊗ 1 ) = ρ ( 1 ⊗ Φ r ) , which makes ( D , Φ ) (D,\Phi) ( D , Φ ) a quotient datum. Then the Hopf image of ρ \rho ρ is C ∗ ( Γ / D ) ⋊ Φ C ( X ) C^*(\Gamma/D)\rtimes_{\Phi} C(X) C ∗ ( Γ/ D ) ⋊ Φ C ( X ) .
Proof. This is [11 Corollary 4.3] . Indeed, the subgroup N N N there is defined by the condition ρ ( h ⋅ r ⊗ 1 ) = ρ ( 1 ⊗ f ) \rho(h\cdot r\otimes1)=\rho(1\otimes f) ρ ( h ⋅ r ⊗ 1 ) = ρ ( 1 ⊗ f ) for every h ∈ X h\in X h ∈ X , with f f f invertible, and it is equal to D D D . The condition for every h h h reduces to r ∈ D r\in D r ∈ D , since D D D is X X X -stable. As for f f f , this is automatically invertible, since ρ ( r ⊗ 1 ) \rho(r\otimes1) ρ ( r ⊗ 1 ) is invertible, and ρ ( 1 ⊗ δ k ) ≠ 0 \rho(1\otimes\delta_k)\ne0 ρ ( 1 ⊗ δ k ) = 0 for every k ∈ X k\in X k ∈ X , by faithfulness.
We apply this criterion to the representation π \pi π of C ∗ ( Γ X , Y ) ⋊ C ( X ) C^*(\Gamma_{X,Y}) \rtimes C(X) C ∗ ( Γ X , Y ) ⋊ C ( X ) of Proposition 3.6. The parameters are encoded by θ j d ∈ R / Z \theta_{jd} \in\mathbb{R}/\mathbb{Z} θ j d ∈ R / Z with e 2 π i θ j d = Q − j , d e^{2\pi i\theta_{jd}} = Q_{-j,d} e 2 π i θ j d = Q − j , d . For r = ∑ j , d r j d x j y d r = \sum_{j,d} r_{jd}x^j y^d r = ∑ j , d r j d x j y d in Z [ X × Y ] \mathbb{Z}[X \times Y] Z [ X × Y ] , define F r = r θ F_r = r\theta F r = r θ by convolution,
F r ( k , e ) = ∑ j ∈ X , d ∈ Y r j d θ k − j , e − d in R / Z , k ∈ X , e ∈ Y (8) F_r(k,e) = \sum_{j\in X,d\in Y} r_{jd}\theta_{k-j,e-d} \text{ in } \mathbb{R}/\mathbb{Z},\quad k\in X,\ e\in Y \tag*{(8)} F r ( k , e ) = j ∈ X , d ∈ Y ∑ r j d θ k − j , e − d in R / Z , k ∈ X , e ∈ Y (8)
Only integer multiples of the θ j d \theta_{jd} θ j d occur, so this definition requires no choice of logarithm. For any abelian group A A A , let S A ⊂ A X × Y S_A \subset A^{X\times Y} S A ⊂ A X × Y be the subgroup of the functions of the form F ( k , e ) = λ ( k ) + λ ′ ( e ) F(k,e)=\lambda(k)+\lambda'(e) F ( k , e ) = λ ( k ) + λ ′ ( e ) . A function F F F belongs to S A S_A S A if and only if
F ( k , e ) − F ( 0 , e ) − F ( k , 0 ) + F ( 0 , 0 ) = 0 , k ∈ X , e ∈ Y (9) F(k,e)-F(0,e)-F(k,0)+F(0,0)=0,\quad k\in X,\ e\in Y \tag*{(9)} F ( k , e ) − F ( 0 , e ) − F ( k , 0 ) + F ( 0 , 0 ) = 0 , k ∈ X , e ∈ Y (9)
Indeed, if (9) holds, one can take λ ( k ) = F ( k , 0 ) − F ( 0 , 0 ) \lambda(k)=F(k,0)-F(0,0) λ ( k ) = F ( k , 0 ) − F ( 0 , 0 ) and λ ′ ( e ) = F ( 0 , e ) \lambda'(e)=F(0,e) λ ′ ( e ) = F ( 0 , e ) , and the converse is clear. If X , Y X,Y X , Y are cyclic with generators corresponding to x , y x,y x , y , condition (9) is equivalent to ( x − 1 ) ( y − 1 ) F = 0 (x-1)(y-1)F=0 ( x − 1 ) ( y − 1 ) F = 0 , since summing the latter identity along the 2 cyclic factors gives (9) . In terms of these functions, the relations that we are looking for are as follows:
Definition 3.11. The relation subgroup of a dephased matrix Q ∈ T X × Y Q \in\mathbb{T}^{X\times Y} Q ∈ T X × Y is
N Q = { r ∈ I X ⊗ I Y : F r ∈ S R / Z } N_Q=\{r\in I_X\otimes I_Y:F_r\in S_{\mathbb{R}/\mathbb{Z}}\} N Q = { r ∈ I X ⊗ I Y : F r ∈ S R / Z } and for r ∈ N Q r\in N_Q r ∈ N Q we define a function Φ r : X → T \Phi_r:X\to\mathbb{T} Φ r : X → T by Φ r ( k ) = e 2 π i ( F r ( 0 , 0 ) − F r ( k , 0 ) ) \Phi_r(k)=e^{2\pi i(F_r(0,0)-F_r(k,0))} Φ r ( k ) = e 2 π i ( F r ( 0 , 0 ) − F r ( k , 0 )) .
With these notions in hand, the quantum group can be computed, as follows:
Theorem 3.12 ([8 ] ). For a dephased Q ∈ T X × Y Q \in\mathbb{T}^{X\times Y} Q ∈ T X × Y and H = F X ⊗ Q F Y H=F_X\otimes_Q F_Y H = F X ⊗ Q F Y , we have
C ( G H ) = C ∗ ( Γ X , Y / N Q ) ⋊ Φ C ( X ) C(G_H)=C^*(\Gamma_{X,Y}/N_Q)\rtimes_{\Phi} C(X) C ( G H ) = C ∗ ( Γ X , Y / N Q ) ⋊ Φ C ( X ) where ( N Q , Φ ) (N_Q,\Phi) ( N Q , Φ ) is a quotient datum for Γ X , Y \Gamma_{X,Y} Γ X , Y .
Proof. This is [8 Theorem 4.4] . We include here the proof, with all the details on the C ∗ C^* C ∗ -algebra side, the subsequent blowup construction being based on them.
We first compute the action of T T T . Let φ j d = θ − j , d \varphi_{jd}=\theta_{-j,d} φ j d = θ − j , d , so that Q j d = e 2 π i φ j d Q_{jd}=e^{2\pi i\varphi_{jd}} Q j d = e 2 π i φ j d and φ 0 d = 0 \varphi_{0d}=0 φ 0 d = 0 . Applying (5) first to c ( i ) c^{(i)} c ( i ) and then to $(-c)^{(0)}`, we see that t i c t_{ic} t i c acts on ξ k e \xi_{ke} ξ k e by the multiplication by e 2 π i V e^{2\pi iV} e 2 π iV , where
V = φ i , e − c − φ i , e + φ i − k , e − φ i − k , e − c + φ − k , e − c − φ − k , e V=\varphi_{i,e-c}-\varphi_{i,e}+\varphi_{i-k,e}-\varphi_{i-k,e-c}+\varphi_{-k,e-c}-\varphi_{-k,e} V = φ i , e − c − φ i , e + φ i − k , e − φ i − k , e − c + φ − k , e − c − φ − k , e
On the other hand, for r = ( x i − 1 ) ( y c − 1 ) = x i y c − x i − y c + 1 r=(x^i-1)(y^c-1)=x^i y^c-x^i-y^c+1 r = ( x i − 1 ) ( y c − 1 ) = x i y c − x i − y c + 1 , the definition (8) gives
F r ( k , e ) = φ i − k , e − c − φ i − k , e − φ − k , e − c + φ − k , e and F r ( 0 , e ) = φ i , e − c − φ i , e F_r(k,e)=\varphi_{i-k,e-c}-\varphi_{i-k,e}-\varphi_{-k,e-c}+\varphi_{-k,e}
\quad\text{and}\quad
F_r(0,e)=\varphi_{i,e-c}-\varphi_{i,e} F r ( k , e ) = φ i − k , e − c − φ i − k , e − φ − k , e − c + φ − k , e and F r ( 0 , e ) = φ i , e − c − φ i , e
Thus V = F r ( 0 , e ) − F r ( k , e ) V=F_r(0,e)-F_r(k,e) V = F r ( 0 , e ) − F r ( k , e ) . Both sides are additive in r r r , and the group law of T T T corresponds to the product of the diagonal operators. By Lemma 3.7, every r ∈ T r\in T r ∈ T therefore satisfies
π ( r ) ξ k e = e 2 π i ( F r ( 0 , e ) − F r ( k , e ) ) ξ k e , k ∈ X , e ∈ Y (10) \pi(r)\xi_{ke}=e^{2\pi i(F_r(0,e)-F_r(k,e))}\xi_{ke},\quad k\in X,\ e\in Y \tag*{(10)} π ( r ) ξ k e = e 2 π i ( F r ( 0 , e ) − F r ( k , e )) ξ k e , k ∈ X , e ∈ Y (10)
Now, we identify the set D D D of Proposition 3.10. By Proposition 3.6, the element 1 ⊗ f 1\otimes f 1 ⊗ f acts on E k E_k E k by f ( k ) f(k) f ( k ) . An element of nonzero degree d d d maps ξ k e \xi_{ke} ξ k e to a multiple of ξ k , e − d ≠ ξ k e \xi_{k,e-d}\ne\xi_{ke} ξ k , e − d = ξ k e , so it does not belong to D D D . By (10) , an element r ∈ T r\in T r ∈ T acts by a scalar on every E k E_k E k if and only if F r ( 0 , e ) − F r ( k , e ) F_r(0,e)-F_r(k,e) F r ( 0 , e ) − F r ( k , e ) does not depend on e e e for any k k k , that is, if and only if (9) holds for F r F_r F r . Hence D = N Q D=N_Q D = N Q , and putting e = 0 e=0 e = 0 shows that r ∈ N Q r\in N_Q r ∈ N Q acts on E k E_k E k by Φ r ( k ) \Phi_r(k) Φ r ( k ) .
We check that ( N Q , Φ ) (N_Q,\Phi) ( N Q , Φ ) is a quotient datum. For s ∈ X s\in X s ∈ X and d ∈ Y d\in Y d ∈ Y , the definition (8) gives F x s y d r ( k , e ) = F r ( k − s , e − d ) F_{x^s y^d r}(k,e)=F_r(k-s,e-d) F x s y d r ( k , e ) = F r ( k − s , e − d ) , and condition (9) is invariant under these translations. By Lemma 3.7, the multiplications by x s x^s x s and by y d y^d y d implement the action of X X X and the conjugation by the elements of Y ( 0 ) Y^{(0)} Y ( 0 ) , while the conjugation by the elements of the abelian group T T T is trivial. Hence N Q N_Q N Q is normal and X X X -stable.
The map r ↦ Φ r r \mapsto\Phi_r r ↦ Φ r is a homomorphism since r ↦ F r r \mapsto F_r r ↦ F r is additive. Every element of Γ X , Y \Gamma_{X,Y} Γ X , Y maps each subspace E k E_k E k onto itself, so that g r g − 1 grg^{-1} g r g − 1 acts on E k E_k E k by the same scalar as r r r , and Φ g r g − 1 = Φ r \Phi_{grg^{-1}}=\Phi_r Φ g r g − 1 = Φ r . Finally, since ( − l ) ⋅ r = x − l r (-l)\cdot r=x^{-l}r ( − l ) ⋅ r = x − l r and F x − l r ( h , 0 ) = F r ( h + l , 0 ) F_{x^{-l}r}(h,0)=F_r(h+l,0) F x − l r ( h , 0 ) = F r ( h + l , 0 ) , we have
Φ r ( l ) Φ ( − l ) ⋅ r ( h ) = e 2 π i ( F r ( 0 , 0 ) − F r ( l , 0 ) ) e 2 π i ( F r ( l , 0 ) − F r ( l + h , 0 ) ) = Φ r ( l + h ) \Phi_r(l)\Phi_{(-l)\cdot r}(h)=e^{2\pi i(F_r(0,0)-F_r(l,0))}e^{2\pi i(F_r(l,0)-F_r(l+h,0))}=\Phi_r(l+h) Φ r ( l ) Φ ( − l ) ⋅ r ( h ) = e 2 π i ( F r ( 0 , 0 ) − F r ( l , 0 )) e 2 π i ( F r ( l , 0 ) − F r ( l + h , 0 )) = Φ r ( l + h )
Thus Proposition 3.10 applies, since the restriction of π \pi π to C ( X ) C(X) C ( X ) is faithful by Proposition 3.6, and gives the result.
Regarding now the computation of N Q N_Q N Q , write Q j d = η j d ∏ s = 1 m γ s β s ( j , d ) Q_{jd}=\eta_{jd}\prod_{s=1}^{m}\gamma_s^{\beta_s(j,d)} Q j d = η j d ∏ s = 1 m γ s β s ( j , d ) , where the η j d \eta_{jd} η j d are roots of unity, β s ( j , d ) ∈ Z \beta_s(j,d)\in\mathbb{Z} β s ( j , d ) ∈ Z , and the images of γ 1 , … , γ m \gamma_1,\ldots,\gamma_m γ 1 , … , γ m form a basis of the quotient of the subgroup of T \mathbb{T} T generated by the entries of Q Q Q by its torsion subgroup. Such a decomposition exists since this subgroup is finitely generated, so that the quotient is free abelian. With this convention, we have:
Proposition 3.13 ([8 ] ). Let Q ∈ T X × Y Q\in\mathbb{T}^{X\times Y} Q ∈ T X × Y be dephased and let H = F X ⊗ Q F Y H=F_X\otimes_Q F_Y H = F X ⊗ Q F Y .
(1) We have N Q = { 1 } N_Q=\{1\} N Q = { 1 } if and only if, for every pair of nontrivial characters χ \chi χ of X X X and ψ \psi ψ of Y Y Y , there exists s s s such that
∑ j ∈ X , d ∈ Y β s ( j , d ) χ ( j ) ‾ ψ ( d ) ≠ 0 \sum_{j\in X,d\in Y}\beta_s(j,d)\overline{\chi(j)}\psi(d)\ne0 j ∈ X , d ∈ Y ∑ β s ( j , d ) χ ( j ) ψ ( d ) = 0 (2) If Q j d = e 2 π i a j d / L Q_{jd}=e^{2\pi i a_{jd}/L} Q j d = e 2 π i a j d / L with a j d ∈ Z L a_{jd}\in\mathbb{Z}_L a j d ∈ Z L for any j , d j,d j , d , then G H G_H G H is finite of order M N [ T : N Q ] MN[T:N_Q] M N [ T : N Q ] , and the index [ T : N Q ] [T:N_Q] [ T : N Q ] is the order of the image of the homomorphism
T ⟶ Z L X × Y / S Z L , r ⟼ r θ ^ m o d S Z L T\longrightarrow\mathbb{Z}_L^{X\times Y}/S\mathbb{Z}_L,\qquad r\longmapsto r\widehat{\theta}\bmod S\mathbb{Z}_L T ⟶ Z L X × Y / S Z L , r ⟼ r θ mod S Z L where θ ^ j d = a − j , d \widehat{\theta}_{jd}=a_{-j,d} θ j d = a − j , d and the product is the convolution.
Proof. This is part of [8 Theorem 4.4] , and we refer to that paper for the proof, which is based on the above description of N Q N_Q N Q .
Finally, here is the formula for the moments, which is our main tool in what follows:
Theorem 3.14. Let Q ∈ T X × Y Q\in\mathbb{T}^{X\times Y} Q ∈ T X × Y be dephased and let H = F X ⊗ Q F Y H=F_X\otimes_Q F_Y H = F X ⊗ Q F Y . For any n ≥ 1 n\ge1 n ≥ 1 , the n n n -th moment of μ H \mu_H μ H is
c n = 1 M # { ( ( i 1 , b 1 ) , … , ( i n , b n ) ) ∈ ( X × Y ) n : b 1 ( i 1 ) ⋯ b n ( i n ) ∈ N Q } (11) c_n=\frac{1}{M}\#\left\{((i_1,b_1),\ldots,(i_n,b_n))\in(X\times Y)^n:b_1^{(i_1)}\cdots b_n^{(i_n)}\in N_Q\right\} \tag*{(11)} c n = M 1 # { (( i 1 , b 1 ) , … , ( i n , b n )) ∈ ( X × Y ) n : b 1 ( i 1 ) ⋯ b n ( i n ) ∈ N Q } (11) In particular, for fixed X X X and Y Y Y the rooted law depends only on N Q N_Q N Q .
Proof. In the i i i -th copy of C ( Y ) C(Y) C ( Y ) , the diagonal entry u a a ( i ) u_{aa}^{(i)} u aa ( i ) is the indicator function of the identity of Y Y Y , which corresponds under the Fourier transform to N − 1 ∑ b ∈ Y b ( i ) N^{-1}\sum_{b\in Y}b^{(i)} N − 1 ∑ b ∈ Y b ( i ) . Since v i i v_{ii} v ii corresponds to 1 ⊗ δ 0 1\otimes\delta_0 1 ⊗ δ 0 , summing the M N MN M N diagonal entries u a a ( i ) v i i u_{aa}^{(i)}v_{ii} u aa ( i ) v ii of the fundamental magic unitary gives the main character
χ H = ( ∑ i ∈ X , b ∈ Y b ( i ) ) ⊗ δ 0 \chi_H=\left(\sum_{i\in X,b\in Y}b^{(i)}\right)\otimes\delta_0 χ H = i ∈ X , b ∈ Y ∑ b ( i ) ⊗ δ 0
Let h h h be the Haar state of C ( G H ) C(G_H) C ( G H ) . Compose evaluation at 0 ∈ X 0\in X 0 ∈ X with the group quotient to obtain the Hopf algebra map g ⊗ f ↦ f ( 0 ) g ‾ g\otimes f\mapsto f(0)\overline{g} g ⊗ f ↦ f ( 0 ) g , where g ‾ \overline{g} g denotes the class of g g g in Γ X , Y / N Q \Gamma_{X,Y}/N_Q Γ X , Y / N Q . For r ∈ N Q r\in N_Q r ∈ N Q we have r ‾ = 1 \overline{r}=1 r = 1 and Φ r ( 0 ) = 1 \Phi_r(0)=1 Φ r ( 0 ) = 1 , so this map respects the relations of Proposition 3.9 . Denote the induced map from C ( G H ) C(G_H) C ( G H ) to C ∗ ( Γ X , Y / N Q ) C^*(\Gamma_{X,Y}/N_Q) C ∗ ( Γ X , Y / N Q ) by e v 0 ev_0 e v 0 . Applying e v 0 ⊗ I d ev_0\otimes Id e v 0 ⊗ I d to the coproduct of g ⊗ δ 0 g\otimes\delta_0 g ⊗ δ 0 in (4) gives g ‾ ⊗ ( g ⊗ δ 0 ) \overline{g}\otimes(g\otimes\delta_0) g ⊗ ( g ⊗ δ 0 ) , and the invariance ( e v 0 ⊗ h ) Δ = h ( ⋅ ) 1 (ev_0\otimes h)\Delta=h(\cdot)1 ( e v 0 ⊗ h ) Δ = h ( ⋅ ) 1 then gives
h ( g ⊗ δ 0 ) g ‾ = h ( g ⊗ δ 0 ) 1 h(g\otimes\delta_0)\overline{g}=h(g\otimes\delta_0)1 h ( g ⊗ δ 0 ) g = h ( g ⊗ δ 0 ) 1
so that h ( g ⊗ δ 0 ) = 0 h(g\otimes\delta_0)=0 h ( g ⊗ δ 0 ) = 0 if g ‾ ≠ 1 \overline{g}\ne1 g = 1 . If g ‾ = 1 \overline{g}=1 g = 1 , then g ∈ N Q g\in N_Q g ∈ N Q and g ⊗ δ 0 = ( 1 ⊗ Φ g ) ( 1 ⊗ δ 0 ) = 1 ⊗ δ 0 g\otimes\delta_0=(1\otimes\Phi_g)(1\otimes\delta_0)=1\otimes\delta_0 g ⊗ δ 0 = ( 1 ⊗ Φ g ) ( 1 ⊗ δ 0 ) = 1 ⊗ δ 0 in C ( G H ) C(G_H) C ( G H ) . The restriction of h h h to the image of C ( X ) C(X) C ( X ) , which is isomorphic to C ( X ) C(X) C ( X ) by the faithfulness of π \pi π on C ( X ) C(X) C ( X ) , is the Haar state of C ( X ) C(X) C ( X ) . Hence h ( 1 ⊗ δ 0 ) = 1 M h(1\otimes\delta_0)=\frac{1}{M} h ( 1 ⊗ δ 0 ) = M 1 , and by expanding h ( χ H n ) h(\chi_H^n) h ( χ H n ) we obtain the formula in the statement.
Gram blowup, rigidity and transposition
We keep the notation of § 5 . In the spirit of [4 ] , we call blowup of the rooted law a formula which expresses it through the law of a positive matrix valued function on a compact group, as in Theorem 3.5 . We prove such a formula for every parameter matrix in Theorem 4.1 , and we compute the compact group explicitly from the entries of Q Q Q in Proposition 4.2 . The examples at indices 6, 8 and 9, discussed in § 7 and § 8 , are then direct computations of this group.
For z ∈ T z\in\mathbb{T} z ∈ T we denote by ⟨ z ⟩ \langle z\rangle ⟨ z ⟩ the closed subgroup of T \mathbb{T} T generated by z z z , which is finite cyclic if z z z is a root of unity, and equal to T \mathbb{T} T otherwise. Also, we use the letter ε \varepsilon ε for a random sign, with P ( ε = 1 ) = P ( ε = − 1 ) = 1 2 \mathbb{P}(\varepsilon=1)=\mathbb{P}(\varepsilon=-1)=\frac{1}{2} P ( ε = 1 ) = P ( ε = − 1 ) = 2 1 , independent of the other random variables. For M = 2 M=2 M = 2 or N = 2 N=2 N = 2 , the subgroup N Q N_Q N Q is also computed in [8 Theorems 4.5 and 4.6] , in agreement with the results below.
The Gram model for arbitrary parameters
Let Q Q Q be dephased. Put Γ Q = Γ X , Y / N Q \Gamma_Q=\Gamma_{X,Y}/N_Q Γ Q = Γ X , Y / N Q and T Q = T / N Q T_Q=T/N_Q T Q = T / N Q . For i ∈ X i\in X i ∈ X and j ∈ Y j\in Y j ∈ Y , we have t i , − j = j ( 0 ) ( − j ) ( i ) t_{i,-j}=j^{(0)}(-j)^{(i)} t i , − j = j ( 0 ) ( − j ) ( i ) , and the elements t i , − j t_{i,-j} t i , − j with i , j ≠ 0 i,j\ne0 i , j = 0 form a basis of T T T by Lemma 3.7 . Let T ^ Q \widehat{T}_Q T Q be the Pontryagin dual of the discrete abelian group T Q T_Q T Q , with its Haar probability measure. The map
T ^ Q ⟶ T X × Y , χ ⟼ Z ( χ ) = ( χ ( t i , − j ) ) i ∈ X , j ∈ Y \widehat{T}_Q\longrightarrow\mathbb{T}^{X\times Y},\qquad\chi\longmapsto Z(\chi)=\left(\chi(t_{i,-j})\right)_{i\in X,j\in Y} T Q ⟶ T X × Y , χ ⟼ Z ( χ ) = ( χ ( t i , − j ) ) i ∈ X , j ∈ Y
where χ ( t i , − j ) \chi(t_{i,-j}) χ ( t i , − j ) means the value of χ \chi χ on the image of t i , − j t_{i,-j} t i , − j in T Q T_Q T Q , is an injective continuous homomorphism, since these images generate T Q T_Q T Q . A character of T T T is determined by its values on the basis ( t i , − j ) i , j ≠ 0 (t_{i,-j})_{i,j\ne0} ( t i , − j ) i , j = 0 , which can be chosen arbitrarily in T \mathbb{T} T , and it factors through T Q T_Q T Q if and only if it is trivial on N Q N_Q N Q . Hence the image of this map is the closed subgroup
K Q = { Z ∈ T X × Y : Z 0 j = Z i 0 = 1 and ∏ i , j ≠ 0 Z i j m i j = 1 whenever ∑ i , j ≠ 0 m i j t i , − j ∈ N Q } (12) K_Q=\left\{Z\in\mathbb{T}^{X\times Y}:Z_{0j}=Z_{i0}=1\ \text{and}\ \prod_{i,j\ne0}Z_{ij}^{m_{ij}}=1\ \text{whenever}\ \sum_{i,j\ne0}m_{ij}t_{i,-j}\in N_Q\right\} \tag*{(12)} K Q = ⎩ ⎨ ⎧ Z ∈ T X × Y : Z 0 j = Z i 0 = 1 and i , j = 0 ∏ Z ij m ij = 1 whenever i , j = 0 ∑ m ij t i , − j ∈ N Q ⎭ ⎬ ⎫ (12)
and it carries the image of the Haar measure of T ^ Q \widehat{T}_Q T Q , which is its Haar measure. Deleting the first row and the first column identifies K Q K_Q K Q with a closed subgroup of T ( M − 1 ) ( N − 1 ) \mathbb{T}^{(M-1)(N-1)} T ( M − 1 ) ( N − 1 ) .
Theorem 4.1 (The Gram blowup for all parameters). Let Q ∈ T X × Y Q\in\mathbb{T}^{X\times Y} Q ∈ T X × Y be dephased and H = F X ⊗ Q F Y H=F_X\otimes_QF_Y H = F X ⊗ Q F Y . Then for any integer n ≥ 1 n\ge1 n ≥ 1 we have
c n = 1 M N ∫ K Q Tr ( ( Z Z ∗ ) n ) d Z (13) c_n=\frac{1}{MN}\int_{K_Q}\operatorname{Tr}\left((ZZ^*)^n\right)\,dZ \tag*{(13)} c n = M N 1 ∫ K Q Tr ( ( Z Z ∗ ) n ) d Z (13) Equivalently, the rooted law is
μ H = ( 1 − 1 N ) δ 0 + 1 N law ( Z Z ∗ ) \mu_H=\left(1-\frac{1}{N}\right)\delta_0+\frac{1}{N}\operatorname{law}(ZZ^*) μ H = ( 1 − N 1 ) δ 0 + N 1 law ( Z Z ∗ ) where Z Z Z is Haar distributed on K Q K_Q K Q and law ( Z Z ∗ ) \operatorname{law}(ZZ^*) law ( Z Z ∗ ) is the mean eigenvalue distribution of Z Z ∗ ZZ^* Z Z ∗ for the normalized trace 1 M Tr \frac{1}{M}\operatorname{Tr} M 1 Tr .
Proof. Let Y i Y_i Y i be the image of the i i i -th copy of Y Y Y in Γ Q \Gamma_Q Γ Q . Since N Q ⊂ T N_Q\subset T N Q ⊂ T , the degree map induces a homomorphism Γ Q → Y \Gamma_Q\to Y Γ Q → Y with kernel T Q T_Q T Q , which is an isomorphism on each Y i Y_i Y i . Consequently, each left coset of Y i Y_i Y i contains exactly one element of T Q T_Q T Q . We keep the coset spaces for the different i i i as separate copies, also when some of the subgroups Y i Y_i Y i coincide. Consider the operator
J : ℓ 2 ( Γ Q ) ⟶ ⨁ i ∈ X ℓ 2 ( Γ Q / Y i ) , J δ γ = ⨁ i ∈ X δ γ Y i J:\ell^2(\Gamma_Q)\longrightarrow\bigoplus_{i\in X}\ell^2(\Gamma_Q/Y_i),\qquad J\delta_\gamma=\bigoplus_{i\in X}\delta_{\gamma Y_i} J : ℓ 2 ( Γ Q ) ⟶ i ∈ X ⨁ ℓ 2 ( Γ Q / Y i ) , J δ γ = i ∈ X ⨁ δ γ Y i
The adjoint J ∗ J^* J ∗ sums over the elements of a coset. Hence J ∗ δ γ = ∑ i ∈ X , b ∈ Y δ γ b ( i ) J^*\delta_\gamma=\sum_{i\in X,b\in Y}\delta_{\gamma b^{(i)}} J ∗ δ γ = ∑ i ∈ X , b ∈ Y δ γ b ( i ) , where the letters b ( i ) b^{(i)} b ( i ) are those of (3.9). The coefficient ⟨ ( J ∗ J ) n δ 1 , δ 1 ⟩ \langle(J^*J)^n\delta_1,\delta_1\rangle ⟨( J ∗ J ) n δ 1 , δ 1 ⟩ is the number of words of length n n n in these letters whose product is equal to 1 in Γ Q \Gamma_Q Γ Q , that is, whose product in Γ X , Y \Gamma_{X,Y} Γ X , Y belongs to N Q N_Q N Q . By (11) , this number is M c n Mc_n M c n . Since J ∗ J J^*J J ∗ J commutes with the left translations of Γ Q \Gamma_Q Γ Q , every diagonal coefficient of ( J ∗ J ) n (J^*J)^n ( J ∗ J ) n is equal to M c n Mc_n M c n .
Since Γ Q = T Q ⋊ Y \Gamma_Q=T_Q\rtimes Y Γ Q = T Q ⋊ Y , every γ ∈ Γ Q \gamma\in\Gamma_Q γ ∈ Γ Q has a unique expression γ = u j ( 0 ) \gamma=uj^{(0)} γ = u j ( 0 ) with u ∈ T Q u\in T_Q u ∈ T Q and j ∈ Y j\in Y j ∈ Y . This gives an identification ℓ 2 ( Γ Q ) = ℓ 2 ( T Q ) ⊗ ℓ 2 ( Y ) \ell^2(\Gamma_Q)=\ell^2(T_Q)\otimes\ell^2(Y) ℓ 2 ( Γ Q ) = ℓ 2 ( T Q ) ⊗ ℓ 2 ( Y ) , and we identify ℓ 2 ( Γ Q / Y i ) \ell^2(\Gamma_Q/Y_i) ℓ 2 ( Γ Q / Y i ) with ℓ 2 ( T Q ) \ell^2(T_Q) ℓ 2 ( T Q ) by means of the representatives of degree zero. The coset of u j ( 0 ) uj^{(0)} u j ( 0 ) in Γ Q / Y i \Gamma_Q/Y_i Γ Q / Y i has the representative of degree zero u j ( 0 ) ( − j ) ( i ) = u t i , − j uj^{(0)}(-j)^{(i)}=ut_{i,-j} u j ( 0 ) ( − j ) ( i ) = u t i , − j . Thus the ( i , j ) (i,j) ( i , j ) entry of J J J is the translation by t i , − j t_{i,-j} t i , − j on ℓ 2 ( T Q ) \ell^2(T_Q) ℓ 2 ( T Q ) .
The Fourier transform ℓ 2 ( T Q ) → L 2 ( T Q ^ ) \ell^2(T_Q)\to L^2(\widehat{T_Q}) ℓ 2 ( T Q ) → L 2 ( T Q ) , δ u ↦ ( χ ↦ χ ( u ) ) \delta_u\mapsto(\chi\mapsto\chi(u)) δ u ↦ ( χ ↦ χ ( u )) , is unitary and transforms the translation by t t t into the multiplication by the function χ ↦ χ ( t ) \chi\mapsto\chi(t) χ ↦ χ ( t ) . Hence it transforms J J J into the multiplication by the matrix valued function χ ↦ Z ( χ ) \chi\mapsto Z(\chi) χ ↦ Z ( χ ) , and δ j ( 0 ) = δ 1 ⊗ δ j \delta_{j^{(0)}}=\delta_1\otimes\delta_j δ j ( 0 ) = δ 1 ⊗ δ j into the constant function 1 1 1 times δ j \delta_j δ j . We obtain
M c n = ⟨ ( J ∗ J ) n δ j ( 0 ) , δ j ( 0 ) ⟩ = ∫ T Q ^ ( ( Z ( χ ) ∗ Z ( χ ) ) n ) j j d χ , j ∈ Y Mc_n=\left\langle(J^*J)^n\delta_{j^{(0)}},\delta_{j^{(0)}}\right\rangle=\int_{\widehat{T_Q}}\left((Z(\chi)^*Z(\chi))^n\right)_{jj}\,d\chi,\qquad j\in Y M c n = ⟨ ( J ∗ J ) n δ j ( 0 ) , δ j ( 0 ) ⟩ = ∫ T Q ( ( Z ( χ ) ∗ Z ( χ ) ) n ) j j d χ , j ∈ Y
Summing over j ∈ Y j\in Y j ∈ Y gives
M N c n = ∫ T Q ^ Tr ( ( Z ∗ Z ) n ) d χ = ∫ K Q Tr ( ( Z Z ∗ ) n ) d Z MNc_n=\int_{\widehat{T_Q}}\operatorname{Tr}\left((Z^*Z)^n\right)\,d\chi=\int_{K_Q}\operatorname{Tr}\left((ZZ^*)^n\right)\,dZ M N c n = ∫ T Q Tr ( ( Z ∗ Z ) n ) d χ = ∫ K Q Tr ( ( Z Z ∗ ) n ) d Z
since Z ∗ Z Z^*Z Z ∗ Z and Z Z ∗ ZZ^* Z Z ∗ have the same nonzero eigenvalues with multiplicities. This proves (13) . Finally, Z Z ∗ ≥ 0 ZZ^*\ge0 Z Z ∗ ≥ 0 and Tr ( Z Z ∗ ) = M N \operatorname{Tr}(ZZ^*)=MN Tr ( Z Z ∗ ) = M N , so that the measure of the statement is a probability measure supported in [ 0 , M N ] [0,MN] [ 0 , M N ] . Its moments of order n ≥ 1 n\ge1 n ≥ 1 are the right-hand side of (13) . Recall that 2 probability measures with compact supports and the same moments coincide. □
The next result computes K Q K_Q K Q directly from the entries of Q Q Q .
Proposition 4.2 (Generators from the parameter matrix). For i , k ∈ X i,k\in X i , k ∈ X and e , j ∈ Y e,j\in Y e , j ∈ Y , put
R k ( i , e ) = Q i , e Q − k , e Q i − k , e Q 0 , e , g k , e ( i , j ) = R k ( i , e + j ) R k ( i , 0 ) R k ( i , e ) R k ( i , j ) (14) R_k(i,e)=\frac{Q_{i,e}Q_{-k,e}}{Q_{i-k,e}Q_{0,e}},\qquad g_{k,e}(i,j)=\frac{R_k(i,e+j)R_k(i,0)}{R_k(i,e)R_k(i,j)} \tag*{(14)} R k ( i , e ) = Q i − k , e Q 0 , e Q i , e Q − k , e , g k , e ( i , j ) = R k ( i , e ) R k ( i , j ) R k ( i , e + j ) R k ( i , 0 ) (14) Then K Q K_Q K Q is the closed subgroup of T X × Y \mathbb{T}^{X\times Y} T X × Y generated by the matrices g k , e g_{k,e} g k , e , k ∈ X k\in X k ∈ X , e ∈ Y e\in Y e ∈ Y . The same formula applies to a parameter matrix which is not dephased.
Proof. If Q Q Q is replaced by Δ Q Δ ′ \Delta Q\Delta' Δ Q Δ ′ with diagonal unitary matrices Δ , Δ ′ \Delta,\Delta' Δ , Δ ′ , each R k ( i , e ) R_k(i,e) R k ( i , e ) is multiplied by a factor which does not depend on e e e , and this factor cancels in g k , e g_{k,e} g k , e . We may therefore assume that Q Q Q is dephased. Applying (5) first to ( − j ) ( i ) (-j)^{(i)} ( − j ) ( i ) and then to j ( 0 ) j^{(0)} j ( 0 ) , we see that t i , − j = j ( 0 ) ( − j ) ( i ) t_{i,-j}=j^{(0)}(-j)^{(i)} t i , − j = j ( 0 ) ( − j ) ( i ) maps ξ k e \xi_{ke} ξ k e to
Q i , e + j Q i − k , e Q i , e Q i − k , e + j Q 0 , e Q − k , e + j Q 0 , e + j Q − k , e ξ k e = R k ( i , e + j ) R k ( i , e ) ξ k e \frac{Q_{i,e+j}Q_{i-k,e}}{Q_{i,e}Q_{i-k,e+j}}\frac{Q_{0,e}Q_{-k,e+j}}{Q_{0,e+j}Q_{-k,e}}\xi_{ke}=\frac{R_k(i,e+j)}{R_k(i,e)}\xi_{ke} Q i , e Q i − k , e + j Q i , e + j Q i − k , e Q 0 , e + j Q − k , e Q 0 , e Q − k , e + j ξ k e = R k ( i , e ) R k ( i , e + j ) ξ k e
Let ( m i j ) (m_{ij}) ( m ij ) be an integer matrix. By the proof of Theorem 3.12 , the element ∑ i , j m i j t i , − j \sum_{i,j}m_{ij}t_{i,-j} ∑ i , j m ij t i , − j of T T T belongs to N Q N_Q N Q if and only if it acts by a scalar on each subspace E k E_k E k . Dividing by the value at e = 0 e=0 e = 0 , this means that
∏ i ∈ X , j ∈ Y g k , e ( i , j ) m i j = 1 , k ∈ X , e ∈ Y \prod_{i\in X,j\in Y}g_{k,e}(i,j)^{m_{ij}}=1,\qquad k\in X,\ e\in Y i ∈ X , j ∈ Y ∏ g k , e ( i , j ) m ij = 1 , k ∈ X , e ∈ Y
Note that g k , e ( i , j ) = 1 g_{k,e}(i,j)=1 g k , e ( i , j ) = 1 if i = 0 i=0 i = 0 or j = 0 j=0 j = 0 . By (12) , K Q K_Q K Q is the subgroup of the matrices Z Z Z with first row and first column equal to one which are annihilated by the characters Z ↦ ∏ Z i j m i j Z\mapsto\prod Z_{ij}^{m_{ij}} Z ↦ ∏ Z ij m ij with ∑ m i j t i , − j ∈ N Q \sum m_{ij}t_{i,-j}\in N_Q ∑ m ij t i , − j ∈ N Q . We have just shown that these characters are exactly the characters which are trivial on the matrices g k , e g_{k,e} g k , e . By Pontryagin duality, a closed subgroup of a compact abelian group is the annihilator of its annihilator. Hence the closed subgroup generated by the g k , e g_{k,e} g k , e is K Q K_Q K Q . □
In terms of the second differences W i j = Q i + k , j + e Q i j / ( Q i + k , j Q i , j + e ) W_{ij}=Q_{i+k,j+e}Q_{ij}/(Q_{i+k,j}Q_{i,j+e}) W ij = Q i + k , j + e Q ij / ( Q i + k , j Q i , j + e ) of the matrix Q Q Q , the above formula shows that g − k , e − 1 g_{-k,e}^{-1} g − k , e − 1 is the dephased form ( W i j W 00 / W i 0 W 0 j ) i j (W_{ij}W_{00}/W_{i0}W_{0j})_{ij} ( W ij W 00 / W i 0 W 0 j ) ij of the matrix W W W , a fact which is checked by the program pantani.py too. This gives the description of K Q K_Q K Q in Theorem A.
If N Q = { 1 } N_Q = \{1\} N Q = { 1 } , then K Q K_Q K Q is the subgroup of all matrices with first row and first column equal to one, and Theorem 4.1 gives back Theorem 3.5 , since the eigenvalues of Z Z ∗ ZZ^* Z Z ∗ do not change when the rows and columns of Z Z Z are multiplied by phases. If Q = 1 Q = 1 Q = 1 , then K Q = { 1 } K_Q = \{1\} K Q = { 1 } , the matrix Z Z Z is the all-ones matrix and μ H = ( 1 − 1 M N ) δ 0 + 1 M N δ M N \mu_H = \left(1 - \frac{1}{MN}\right)\delta_0 + \frac{1}{MN}\delta_{MN} μ H = ( 1 − M N 1 ) δ 0 + M N 1 δ M N . If the entries of Q Q Q are roots of unity, then K Q K_Q K Q is finite and the integral in (13) is a uniform average over K Q K_Q K Q .
Degenerations
We denote by c n g e n c_n^{\mathrm{gen}} c n gen the moments of μ H \mu_H μ H for a generic parameter matrix. By Theorem 3.5 they depend only on M M M and N N N . The next result shows that the rooted law detects whether G H G_H G H is a proper quantum subgroup of the generic quantum group, that is, whether C ( G H ) C(G_H) C ( G H ) is a proper quotient of C ∗ ( Γ X , Y ) ⋊ C ( X ) C^*(\Gamma_{X,Y}) \rtimes C(X) C ∗ ( Γ X , Y ) ⋊ C ( X ) .
Theorem 4.3. Let Q ∈ T X × Y Q \in\mathbb{T}^{X \times Y} Q ∈ T X × Y be dephased and let H = F X ⊗ Q F Y H = F_X \otimes_Q F_Y H = F X ⊗ Q F Y . For any integer n ≥ 1 n \ge1 n ≥ 1 we have
c n − c n g e n = 1 M # { ( ( i 1 , b 1 ) , … , ( i n , b n ) ) ∈ ( X × Y ) n : b 1 ( i 1 ) ⋯ b n ( i n ) ∈ N Q − { 1 } } ≥ 0 (15) c_n - c_n^{\mathrm{gen}} = \frac{1}{M}\#\left\{((i_1,b_1),\ldots,(i_n,b_n)) \in(X \times Y)^n : b_1^{(i_1)} \cdots b_n^{(i_n)} \in N_Q - \{1\}\right\} \ge0 \tag*{(15)} c n − c n gen = M 1 # { (( i 1 , b 1 ) , … , ( i n , b n )) ∈ ( X × Y ) n : b 1 ( i 1 ) ⋯ b n ( i n ) ∈ N Q − { 1 } } ≥ 0 (15) If N Q ≠ { 1 } N_Q \ne\{1\} N Q = { 1 } , the smallest integer n n n such that c n > c n g e n c_n > c_n^{\mathrm{gen}} c n > c n gen is the smallest length of a nontrivial element of N Q N_Q N Q with respect to the generators b ( i ) b^{(i)} b ( i ) , i ∈ X i \in X i ∈ X , b ∈ Y − { 0 } b \in Y - \{0\} b ∈ Y − { 0 } , of Γ X , Y \Gamma_{X,Y} Γ X , Y .
Proof. A dephased matrix whose ( M − 1 ) ( N − 1 ) (M-1)(N-1) ( M − 1 ) ( N − 1 ) free entries are multiplicatively independent exists, and for such a matrix N Q = { 1 } N_Q = \{1\} N Q = { 1 } by Proposition 3.13 (1), applied with the γ s \gamma_s γ s equal to these entries. Applying (11) to this matrix and to Q Q Q , and subtracting, gives (15) .
For γ ∈ Γ X , Y \gamma\in\Gamma_{X,Y} γ ∈ Γ X , Y , let W n ( γ ) W_n(\gamma) W n ( γ ) be the number of words of length n n n in the letters b ( i ) b^{(i)} b ( i ) , ( i , b ) ∈ X × Y (i,b) \in X \times Y ( i , b ) ∈ X × Y , with product γ \gamma γ . Since the letter 0 ( i ) 0^{(i)} 0 ( i ) is the identity, W n ( γ ) > 0 W_n(\gamma) > 0 W n ( γ ) > 0 if and only if the length ∣ γ ∣ |\gamma| ∣ γ ∣ of γ \gamma γ with respect to the generators b ( i ) b^{(i)} b ( i ) , b ≠ 0 b \ne0 b = 0 , satisfies ∣ γ ∣ ≤ n |\gamma| \le n ∣ γ ∣ ≤ n . By (15) , we have
c n − c n g e n = 1 M ∑ γ ∈ N Q − { 1 } W n ( γ ) c_n - c_n^{\mathrm{gen}} = \frac{1}{M}\sum_{\gamma\in N_Q-\{1\}} W_n(\gamma) c n − c n gen = M 1 γ ∈ N Q − { 1 } ∑ W n ( γ )
which is positive if and only if N Q − { 1 } N_Q - \{1\} N Q − { 1 } contains an element of length at most n n n . This proves the last assertion. □
As a consequence, the rooted law detects the degenerations of the quantum group:
Theorem 4.4. Let Q ∈ T X × Y Q \in\mathbb{T}^{X \times Y} Q ∈ T X × Y be dephased and let H = F X ⊗ Q F Y H = F_X \otimes_Q F_Y H = F X ⊗ Q F Y . The following are equivalent:
(1) N Q = { 1 } N_Q = \{1\} N Q = { 1 } .
(2) The quotient map C ∗ ( Γ X , Y ) ⋊ C ( X ) → C ( G H ) C^*(\Gamma_{X,Y}) \rtimes C(X) \to C(G_H) C ∗ ( Γ X , Y ) ⋊ C ( X ) → C ( G H ) is an isomorphism.
(3) The rooted law μ H \mu_H μ H is the generic law of Theorem 3.5 .
(4) The box spaces of the Hadamard subfactor of H H H satisfy dim P n = c n g e n \dim P_n = c_n^{\mathrm{gen}} dim P n = c n gen for any n ≥ 0 n \ge0 n ≥ 0 .
Proof. The equivalence of (1) and (3) follows from Theorem 4.3 , since a probability measure with compact support is determined by its moments. Also, (3) and (4) are equivalent since dim P n = c n \dim P_n = c_n dim P n = c n , by Proposition 3.2 .
If N Q ≠ { 1 } N_Q \ne\{1\} N Q = { 1 } and r ∈ N Q − { 1 } r \in N_Q - \{1\} r ∈ N Q − { 1 } , the element r ⊗ 1 − 1 ⊗ Φ r r \otimes1 - 1 \otimes\Phi_r r ⊗ 1 − 1 ⊗ Φ r of the dense subalgebra C [ Γ X , Y ] ⋊ C ( X ) C[\Gamma_{X,Y}] \rtimes C(X) C [ Γ X , Y ] ⋊ C ( X ) of C ∗ ( Γ X , Y ) ⋊ C ( X ) C^*(\Gamma_{X,Y}) \rtimes C(X) C ∗ ( Γ X , Y ) ⋊ C ( X ) is nonzero, since r ≠ 1 r \ne1 r = 1 . By Proposition 3.9 , it lies in the kernel of the quotient map onto C ∗ ( Γ X , Y / N Q ) ⋊ Φ C ( X ) C^*(\Gamma_{X,Y}/N_Q) \rtimes_{\Phi} C(X) C ∗ ( Γ X , Y / N Q ) ⋊ Φ C ( X ) , which is C ( G H ) C(G_H) C ( G H ) by Theorem 3.12 . Conversely, if N Q = { 1 } N_Q = \{1\} N Q = { 1 } , the quotient map is the identity. This proves the equivalence of (1) and (2). □
For X = Z 3 X = \mathbb{Z}_3 X = Z 3 and Y Y Y of prime order, [11 Theorem 5.1] shows that the representation of C ∗ ( Γ X , Y ) ⋊ C ( X ) C^*(\Gamma_{X,Y}) \rtimes C(X) C ∗ ( Γ X , Y ) ⋊ C ( X ) is inner faithful as soon as one entry of Q Q Q is not a root of unity, that is N Q = { 1 } N_Q = \{1\} N Q = { 1 } , by Theorem 4.4 . Thus, in this case, the rooted law is either the generic one, or that of a finite quantum group. This fails for Y = Z 4 Y = \mathbb{Z}_4 Y = Z 4 , where intermediate cases appear, with phase groups which are infinite, but smaller than the generic one, see Proposition 6.2 . In Example 5.14 below the first difference occurs at n = 8 n = 8 n = 8 .
Remark 4.5. The results of this section can be checked on examples, as follows. For a root-of-unity matrix Q i j = e 2 π i a i j / L Q_{ij}=e^{2\pi ia_{ij}/L} Q ij = e 2 π i a ij / L , the exact verification uses 2 descriptions. The block action of Proposition 3.6 counts words modulo blockwise scalar phases. The generators of Proposition 4.2 give an integer matrix of phase exponents modulo L L L . If s 1 , … , s r s_1,\ldots,s_r s 1 , … , s r are its nonzero Smith factors, its image has order
∣ K Q ∣ = [ T : N Q ] = ∏ a = 1 r L gcd ( L , s a ) |K_Q|=[T:N_Q]=\prod_{a=1}^{r}\frac{L}{\gcd(L,s_a)} ∣ K Q ∣ = [ T : N Q ] = a = 1 ∏ r g cd( L , s a ) L
The equality follows by applying the invertible integer row and column operations to the map modulo L L L . Expanding a Gram trace then amounts to retaining the monomials whose character is trivial on all generators. The program wordgram.py compares these counts for the following inputs and their transposes, in agreement with Theorem 4.6 below. Here A = ( a i j ) i , j ≠ 0 A=(a_{ij})_{i,j\ne0} A = ( a ij ) i , j = 0 is the free part of the exponent matrix, and r r r is the highest checked moment. The first 4 positive moments are shown.
Table 1 (PDF p. 22).
For Z 2 2 \mathbb{Z}_2^2 Z 2 2 the elements are ordered as 00, 01, 10, 11. The same program checks the 3 rational atomic laws at index 6, the first 7 moments of the infinite-order index-9 slice, and the first exceptional moment of Proposition 6.3 for m = 1 , 2 , 3 , 4 m=1,2,3,4 m = 1 , 2 , 3 , 4 .
Transposition
The matrix H t H^t H t is obtained from F Y ⊗ Q t F X F_Y\otimes_{Q_t}F_X F Y ⊗ Q t F X by the same permutation ( i , a ) → ( a , i ) (i,a)\to(a,i) ( i , a ) → ( a , i ) of the rows and of the columns, since ( H t ) i a , j b = H j b , i a = ( Q t ) a j ( F Y ) a b ( F X ) i j (H^t)_{ia,jb}=H_{jb,ia}=(Q^t)_{aj}(F_Y)_{ab}(F_X)_{ij} ( H t ) ia , j b = H j b , ia = ( Q t ) aj ( F Y ) ab ( F X ) ij . By [8 Theorem 2.3] , for any complex Hadamard matrix H H H , the matrices H H H and H t H^t H t have the same rooted law. In the present setting this equality can be seen on the phase groups, which are transposes of each other. On the other hand the quantum groups themselves are different, as observed in [8 Section 4.3] for X = Z 2 X=\mathbb{Z}_2 X = Z 2 and Y = Z 4 Y=\mathbb{Z}_4 Y = Z 4 , where the numbers of characters are 32 and 64. Here is the general statement, for arbitrary finite abelian groups X , Y X,Y X , Y .
Theorem 4.6. Let Q ∈ T X × Y Q\in\mathbb{T}^{X\times Y} Q ∈ T X × Y be dephased.
(1) We have K Q t = { Z t : Z ∈ K Q } K_{Q^t}=\{Z^t:Z\in K_Q\} K Q t = { Z t : Z ∈ K Q } . In particular the Gram formula of Theorem 4.1 gives the same rooted law for F X ⊗ Q F Y F_X\otimes_QF_Y F X ⊗ Q F Y and for F Y ⊗ Q t F X F_Y\otimes_{Q^t}F_X F Y ⊗ Q t F X .
(2) If Q Q Q is generic, the set of characters of the ∗ \ast ∗ -algebra C ( G H ) \mathbb{C}(G_H) C ( G H ) of H = F X ⊗ Q F Y H=F_X\otimes_QF_Y H = F X ⊗ Q F Y has M N M M^NM M N M elements. In particular, if M ≠ N M\ne N M = N , the quantum groups of F X ⊗ Q F Y F_X\otimes_QF_Y F X ⊗ Q F Y and of F Y ⊗ Q t F X F_Y\otimes_{Q^t}F_X F Y ⊗ Q t F X are not isomorphic.
Proof. 1. For a , b ∈ X a,b\in X a , b ∈ X and c , d ∈ Y c,d\in Y c , d ∈ Y consider the multiplicative double difference
∂ Q ( a , b ; c , d ) = Q a + b , c + d Q a , c Q b , c Q a , d Q b , d Q a , c + d Q b , c + d Q a + b , c Q a + b , d \partial Q(a,b;c,d)=\frac{Q_{a+b,c+d}Q_{a,c}Q_{b,c}Q_{a,d}Q_{b,d}}{Q_{a,c+d}Q_{b,c+d}Q_{a+b,c}Q_{a+b,d}} ∂ Q ( a , b ; c , d ) = Q a , c + d Q b , c + d Q a + b , c Q a + b , d Q a + b , c + d Q a , c Q b , c Q a , d Q b , d
This expression is symmetric in ( a , b ) (a,b) ( a , b ) and in ( c , d ) (c,d) ( c , d ) , and satisfies ∂ Q t ( c , d ; a , b ) = ∂ Q ( a , b ; c , d ) \partial Q^t(c,d;a,b)=\partial Q(a,b;c,d) ∂ Q t ( c , d ; a , b ) = ∂ Q ( a , b ; c , d ) . Since Q Q Q is dephased, we have R k ( i , 0 ) = 1 R_k(i,0)=1 R k ( i , 0 ) = 1 and R k ( i , e ) = Q i , e Q − k , e Q i − k , e − 1 R_k(i,e)=Q_{i,e}Q_{-k,e}Q^{-1}_{i-k,e} R k ( i , e ) = Q i , e Q − k , e Q i − k , e − 1 in (14) , and a direct expansion, which is also checked by the program nant.py, gives
g k , e ( i , j ) = ∂ Q ( i , − k ; e , j ) − 1 , i , k ∈ X , e , j ∈ Y g_{k,e}(i,j)=\partial Q(i,-k;e,j)^{-1},\qquad i,k\in X,\ e,j\in Y g k , e ( i , j ) = ∂ Q ( i , − k ; e , j ) − 1 , i , k ∈ X , e , j ∈ Y
Let g e , k ′ g'_{e,k} g e , k ′ , e ∈ Y e\in Y e ∈ Y , k ∈ X k\in X k ∈ X , be the matrices (14) for the parameter matrix Q t ∈ T Y × X Q^t\in\mathbb{T}^{Y\times X} Q t ∈ T Y × X . For j ∈ Y j\in Y j ∈ Y and i ∈ X i\in X i ∈ X we obtain
g e , k ′ ( j , i ) = ∂ Q t ( j , − e ; k , i ) − 1 = ∂ Q ( k , i ; j , − e ) − 1 = ∂ Q ( i , k ; − e , j ) − 1 = g − k , − e ( i , j ) g'_{e,k}(j,i)=\partial Q^t(j,-e;k,i)^{-1}=\partial Q(k,i;j,-e)^{-1}=\partial Q(i,k;-e,j)^{-1}=g_{-k,-e}(i,j) g e , k ′ ( j , i ) = ∂ Q t ( j , − e ; k , i ) − 1 = ∂ Q ( k , i ; j , − e ) − 1 = ∂ Q ( i , k ; − e , j ) − 1 = g − k , − e ( i , j )
Thus the generators of Proposition 4.2 for Q t Q^{t} Q t are the transposes of the generators for Q Q Q , and K Q t = { Z t : Z ∈ K Q } K_{Q^{t}}=\{Z^{t}:Z\in K_{Q}\} K Q t = { Z t : Z ∈ K Q } . By Theorem 4.1, the moments of order n ≥ 1 n\geq1 n ≥ 1 of the rooted law of F Y ⊗ Q t F X F_{Y}\mathbin{\otimes_{Q^{t}}}F_{X} F Y ⊗ Q t F X are
1 M N ∫ K Q Tr ( ( Z t Z ‾ ) n ) d Z = 1 M N ∫ K Q Tr ( ( ( Z ∗ Z ) n ) t ) d Z = 1 M N ∫ K Q Tr ( ( Z Z ∗ ) n ) d Z \frac{1}{MN}\int_{K_{Q}}\operatorname{Tr}\left((Z^{t}\overline{Z})^{n}\right)dZ=\frac{1}{MN}\int_{K_{Q}}\operatorname{Tr}\left(((Z^{*}Z)^{n})^{t}\right)dZ=\frac{1}{MN}\int_{K_{Q}}\operatorname{Tr}\left((ZZ^{*})^{n}\right)dZ M N 1 ∫ K Q Tr ( ( Z t Z ) n ) d Z = M N 1 ∫ K Q Tr ( (( Z ∗ Z ) n ) t ) d Z = M N 1 ∫ K Q Tr ( ( Z Z ∗ ) n ) d Z
which are the moments of μ H \mu_{H} μ H . Both laws are supported in [ 0 , M N ] [0,MN] [ 0 , M N ] , hence they coincide.
If Q Q Q is generic, then N Q = { 1 } N_{Q}=\{1\} N Q = { 1 } by Proposition 3.13, and C ( G H ) = C ∗ ( Γ X , Y ) ⋊ C ( X ) C(G_{H})=C^{*}(\Gamma_{X,Y})\rtimes C(X) C ( G H ) = C ∗ ( Γ X , Y ) ⋊ C ( X ) contains the Hopf ∗ * ∗ -algebra C [ Γ X , Y ] ⋊ C ( X ) \mathbb{C}[\Gamma_{X,Y}]\rtimes C(X) C [ Γ X , Y ] ⋊ C ( X ) as a dense subalgebra, the product being that of the tensor product. A character of a tensor product of unital algebras is determined by its restrictions to the 2 factors, and any pair of characters of the factors defines a character, since the factors commute.
The ∗ * ∗ -characters of C ( X ) C(X) C ( X ) are the M M M evaluations at the points of X X X . As for the ∗ * ∗ -characters of C [ Γ X , Y ] \mathbb{C}[\Gamma_{X,Y}] C [ Γ X , Y ] , these are the homomorphisms Γ X , Y → T \Gamma_{X,Y}\to\mathbb{T} Γ X , Y → T , that is, the characters of the abelianization of Γ X , Y \Gamma_{X,Y} Γ X , Y . Now Γ X , Y \Gamma_{X,Y} Γ X , Y is the quotient of the free product Y ∗ X Y*X Y ∗ X by a subgroup of its commutator subgroup, so its abelianization is that of Y ∗ X Y*X Y ∗ X , namely the group Y × X Y\times X Y × X , of order N M N^{M} N M . Hence we have M N M MN^{M} M N M algebraic ∗ * ∗ -characters. Each of them extends to C ( G H ) C(G_{H}) C ( G H ) , by the universal property of the enveloping C ∗ C^{*} C ∗ -algebra, from Proposition 3.9, and density gives uniqueness.
For F Y ⊗ Q t F X F_{Y}\mathbin{\otimes_{Q^{t}}}F_{X} F Y ⊗ Q t F X we obtain N M N NM^{N} N M N characters. The equality M N M = N M N MN^{M}=NM^{N} M N M = N M N means
log N N − 1 = log M M − 1 \frac{\log N}{N-1}=\frac{\log M}{M-1} N − 1 log N = M − 1 log M
and the function t ↦ log t t − 1 t\mapsto\frac{\log t}{t-1} t ↦ t − 1 l o g t is strictly decreasing on ( 1 , ∞ ) (1,\infty) ( 1 , ∞ ) , since log t > 1 − 1 t \log t>1-\frac{1}{t} log t > 1 − t 1 there. Hence M = N M=N M = N . A compact quantum group isomorphism induces a bijection between the characters of the C ∗ C^{*} C ∗ -algebras, which proves the last assertion. □
The above characters, which are the points of the maximal classical subgroup of G H G_{H} G H , should not be confused with the one-dimensional representations of G H G_{H} G H , which correspond to the group-like elements of C ( G H ) C(G_{H}) C ( G H ) , such as the elements 1 ⊗ χ 1\otimes\chi 1 ⊗ χ , with χ \chi χ being a character of X X X . Summarizing, the rooted law detects the degenerations of the quantum group, by Theorem 4.4, but does not distinguish H H H from H t H^{t} H t .
Coverings, honeycomb lattice, index 6
We explain here the geometric meaning of the Gram formula, in terms of the abelian coverings of the complete bipartite graph, and then we discuss the case of the deformations with 2 rows, where the lattices which appear are well-known ones. At index 6 this leads to a complete description of the quantum groups, of their coset graphs, and of the rooted laws.
The covering graph
Let Q ∈ T X × Y Q\in\mathbb{T}^{X\times Y} Q ∈ T X × Y be dephased, and consider the operator J J J from the proof of Theorem 4.1. This is the incidence operator of the following bipartite graph B Q B_{Q} B Q . The white vertices are the elements of Γ Q \Gamma_{Q} Γ Q . The black vertices are the cosets γ Y i \gamma Y_{i} γ Y i , with γ ∈ Γ Q \gamma\in\Gamma_{Q} γ ∈ Γ Q and i ∈ X i\in X i ∈ X , the cosets coming from different indices i i i being kept as separate vertices, and we say that γ Y i \gamma Y_{i} γ Y i is of type i i i . The edges join each γ \gamma γ to the M M M cosets γ Y i \gamma Y_{i} γ Y i . Thus each white vertex has valence M M M , and each black vertex has valence N N N . Observe that the graph B Q B_{Q} B Q is finite precisely when the group Γ Q \Gamma_{Q} Γ Q is finite, which is the case when all the entries of the parameter matrix Q Q Q are roots of unity.
Let also K X , Y K_{X,Y} K X , Y be the complete bipartite graph having Y Y Y as set of white vertices, and X X X as set of black vertices. We orient its edges from white to black, so that its first homology group is the group of integer matrices m ∈ Z X × Y m\in\mathbb{Z}^{X\times Y} m ∈ Z X × Y whose sums on the rows and on the columns vanish. Recall that the first homology group of a connected graph is free abelian, of rank equal to the number of edges which are not in a spanning tree. Here this rank is M N − ( M + N − 1 ) = ( M − 1 ) ( N − 1 ) MN-(M+N-1)=(M-1)(N-1) M N − ( M + N − 1 ) = ( M − 1 ) ( N − 1 ) , which is the rank of the lattice T T T from Lemma 3.7. As we will see below, this is not a coincidence, and these 2 lattices can be in fact identified, in a natural way. Our main result here is as follows:
Theorem 5.1 (The covering graph). Let Q ∈ T X × Y Q \in\mathbb{T}^{X\times Y} Q ∈ T X × Y be dephased.
The group T Q T_Q T Q acts freely on B Q B_Q B Q , by left multiplication, and B Q / T Q = K X , Y B_Q/T_Q=K_{X,Y} B Q / T Q = K X , Y . Thus B Q B_Q B Q is a connected regular covering of K X , Y K_{X,Y} K X , Y , with group T Q T_Q T Q .
The map m ↦ ∑ i , j m i j x i y − j m \mapsto\sum_{i,j}m_{ij}x^i y^{-j} m ↦ ∑ i , j m ij x i y − j is an isomorphism H 1 ( K X , Y , Z ) ≃ I X ⊗ I Y H_1(K_{X,Y},\mathbb{Z})\simeq I_X\otimes I_Y H 1 ( K X , Y , Z ) ≃ I X ⊗ I Y , and under this isomorphism the covering B Q B_Q B Q corresponds to the subgroup N Q N_Q N Q . In particular, when N Q = { 1 } N_Q=\{1\} N Q = { 1 } , and so for generic Q Q Q , the graph B Q B_Q B Q is the maximal abelian covering of K X , Y K_{X,Y} K X , Y .
Proof. 1. The action on the white vertices is the left regular one, which is free. If t ∈ T Q t\in T_Q t ∈ T Q fixes a coset γ Y i \gamma Y_i γ Y i , then γ − 1 t γ \gamma^{-1}t\gamma γ − 1 t γ belongs to T Q ∩ Y i T_Q\cap Y_i T Q ∩ Y i , which is trivial, since the degree map is injective on Y i Y_i Y i and vanishes on T Q T_Q T Q . Thus the action is free. Since Γ Q = T Q ⋊ Y \Gamma_Q=T_Q\rtimes Y Γ Q = T Q ⋊ Y , the orbits of the white vertices are labeled by their degrees j ∈ Y j\in Y j ∈ Y , and since each coset of Y i Y_i Y i contains exactly one element of T Q T_Q T Q , there is one orbit of black vertices for each type i ∈ X i\in X i ∈ X . A white vertex of degree j j j is joined to exactly one black vertex of each type, so the quotient is K X , Y K_{X,Y} K X , Y . Finally, B Q B_Q B Q is connected, since γ \gamma γ and γ b ( i ) \gamma b^{(i)} γ b ( i ) are joined to γ Y i \gamma Y_i γ Y i , and the elements b ( i ) b^{(i)} b ( i ) generate Γ Q \Gamma_Q Γ Q .
The elements of I X ⊗ I Y I_X\otimes I_Y I X ⊗ I Y are the elements of Z [ X × Y ] \mathbb{Z}[X\times Y] Z [ X × Y ] whose coefficients have vanishing sums on the rows and on the columns, which gives the isomorphism. We identify the fiber of B Q B_Q B Q over a white vertex j j j with T Q T_Q T Q , via u ↦ u j ( 0 ) u\mapsto uj^{(0)} u ↦ u j ( 0 ) , and the fiber over a black vertex i i i with T Q T_Q T Q too, via u ↦ u Y i u\mapsto uY_i u ↦ u Y i . As explained in the proof of Theorem 4.1 , the white vertex u j ( 0 ) uj^{(0)} u j ( 0 ) is joined to the black vertex u t i , − j Y i ut_{i,-j}Y_i u t i , − j Y i . Thus the lift of the closed path j → i → j ′ → i ′ → j j\to i\to j'\to i'\to j j → i → j ′ → i ′ → j of K X , Y K_{X,Y} K X , Y multiplies the coordinate in T Q T_Q T Q by the image of the element
t i , − j t i , − j ′ − 1 t i ′ , − j ′ t i ′ , − j − 1 ⟼ ( x i − x i ′ ) ( y − j − y − j ′ ) t_{i,-j}t_{i,-j'}^{-1}t_{i',-j'}t_{i',-j}^{-1}\longmapsto(x^i-x^{i'})(y^{-j}-y^{-j'}) t i , − j t i , − j ′ − 1 t i ′ , − j ′ t i ′ , − j − 1 ⟼ ( x i − x i ′ ) ( y − j − y − j ′ )
where at right we have used the isomorphism of Lemma 3.7 . This is precisely the image of the 4-cycle under the isomorphism in the statement, and since the 4-cycles generate the homology, the monodromy map H 1 ( K X , Y , Z ) → T Q H_1(K_{X,Y},\mathbb{Z})\to T_Q H 1 ( K X , Y , Z ) → T Q of the covering is the quotient map I X ⊗ I Y → ( I X ⊗ I Y ) / N Q I_X\otimes I_Y\to(I_X\otimes I_Y)/N_Q I X ⊗ I Y → ( I X ⊗ I Y ) / N Q , whose kernel is N Q N_Q N Q . The coverings with abelian group correspond to the subgroups of the homology, the maximal one corresponding to the trivial subgroup, see [32 , 38 ] . □
In terms of walks on these graphs, we have the following result:
Proposition 5.2. The operator J ∗ J J^*J J ∗ J is M M M plus the adjacency operator of the Cayley graph of Γ Q \Gamma_Q Γ Q with respect to the M ( N − 1 ) M(N-1) M ( N − 1 ) generators b ( i ) b^{(i)} b ( i ) , with i ∈ X i\in X i ∈ X and b ∈ Y − { 0 } b\in Y-\{0\} b ∈ Y − { 0 } . Also, if w n w_n w n and w n ( i ) w_n^{(i)} w n ( i ) denote the numbers of closed walks of length 2 n 2n 2 n in B Q B_Q B Q based at a white vertex, and at a black vertex of type i i i , then
c n = w n M = 1 M N ∑ i ∈ X w n ( i ) c_n=\frac{w_n}{M}=\frac{1}{MN}\sum_{i\in X}w_n^{(i)} c n = M w n = M N 1 i ∈ X ∑ w n ( i ) for any $n\ge 1.
Proof. We have J ∗ J δ γ = ∑ i ∈ X , b ∈ Y δ γ b ( i ) J^*J\delta_\gamma=\sum_{i\in X,b\in Y}\delta_{\gamma b^{(i)}} J ∗ J δ γ = ∑ i ∈ X , b ∈ Y δ γ b ( i ) , and the M M M terms with b = 0 b=0 b = 0 give M δ γ M\delta_\gamma M δ γ . The formula c n = w n M c_n=\frac{w_n}{M} c n = M w n is the one in Theorem 3.14 , and the last formula follows from the proof of Theorem 4.1 , the diagonal entry of ( J J ∗ ) n (JJ^*)^n ( J J ∗ ) n at a black vertex of type i i i being ∫ K Q ( ( Z Z ∗ ) n ) i i d Z \int_{K_Q}((ZZ^*)^n)_{ii}\,dZ ∫ K Q (( Z Z ∗ ) n ) ii d Z . □
In terms of spectral measures, the first formula reads μ H = ( 1 − 1 M ) δ 0 + 1 M law ( J ∗ J ) \mu_H=(1-\frac{1}{M})\delta_0+\frac{1}{M}\operatorname{law}(J^*J) μ H = ( 1 − M 1 ) δ 0 + M 1 law ( J ∗ J ) , with the law being taken at a white vertex, while Theorem 4.1 involves J ∗ J J^*J J ∗ J , at the black vertices. Also, the graph B Q B_Q B Q is amenable, Γ Q \Gamma_Q Γ Q being an extension of an abelian group by a finite group, so the norm of J ∗ J J^*J J ∗ J is M N MN M N , which is the index, in agreement with the coamenability observation in [8 ] .
The phase group has a natural interpretation too. A matrix Z ∈ T X × Y Z\in\mathbb{T}^{X\times Y} Z ∈ T X × Y can be viewed as a connection on K X , Y K_{X,Y} K X , Y , with the group T T T as structure group, and the multiplications of the rows and columns by phases are the gauge transformations. The dephased matrices are then the gauge classes, which form the torus H 1 ( K X , Y , T ) = Hom ( I X ⊗ I Y , T ) H^{1}(K_{X,Y},\mathbb{T})=\operatorname{Hom}(I_{X}\otimes I_{Y},\mathbb{T}) H 1 ( K X , Y , T ) = Hom ( I X ⊗ I Y , T ) , the character associated to Z Z Z being the holonomy, given on the above 4-cycles by
Z i j Z i ′ j ′ Z i j ′ Z i ′ j \frac{Z_{ij}Z_{i'j'}}{Z_{ij'}Z_{i'j}} Z i j ′ Z i ′ j Z ij Z i ′ j ′
In this picture K Q K_Q K Q is the group of the gauge classes having trivial holonomy along the cycles which belong to N Q N_Q N Q , the matrix Z Z ∗ ZZ^* Z Z ∗ is the operator J J ∗ JJ^* J J ∗ of the complete bipartite graph, twisted by the connection Z Z Z , and Theorem 4.1 is the decomposition of J J ∗ JJ^* J J ∗ over the characters of the covering group, in the sense of the Floquet–Bloch theory [32 , 38 ] . Observe also that the generators of Proposition 4.2 are second differences of the gauge class of Q Q Q itself, with respect to the translations of X X X and of Y Y Y : with ∂ k \partial_k ∂ k and ∂ e \partial_e ∂ e denoting the corresponding multiplicative differences, g k , e g_{k,e} g k , e is the gauge class of ∂ − k ∂ e Q \partial_{-k}\partial_eQ ∂ − k ∂ e Q , up to inversion.
Deformations with 2 rows
For X = Z 2 X=\mathbb{Z}_2 X = Z 2 write the second row of the dephased matrix Q Q Q as ( q b ) b ∈ Y (q_b)_{b\in Y} ( q b ) b ∈ Y , with q 0 = 1 q_0=1 q 0 = 1 . For Z ∈ K Q Z\in K_Q Z ∈ K Q we write Z b = Z 1 b Z_b=Z_{1b} Z b = Z 1 b , so that Z 0 = 1 Z_0=1 Z 0 = 1 .
Corollary 5.3 (The blowup for 2 rows). Let H = F 2 ⊗ Q F Y H=F_2\otimes_Q F_Y H = F 2 ⊗ Q F Y . The group K Q ⊂ T Y K_Q\subset\mathbb{T}^Y K Q ⊂ T Y is the closed subgroup generated by the vectors
g s ( b ) = ( q 0 q s + b q s q b ) 2 , s , b ∈ Y g_s(b)=\left(\frac{q_0q_{s+b}}{q_sq_b}\right)^2,\qquad s,b\in Y g s ( b ) = ( q s q b q 0 q s + b ) 2 , s , b ∈ Y If ( Z b ) b ∈ Y (Z_b)_{b\in Y} ( Z b ) b ∈ Y is Haar distributed on K Q K_Q K Q , then
μ H = ( 1 − 1 N ) δ 0 + 1 N law ( N + ε ∣ ∑ b ∈ Y Z b ∣ ) \mu_H=\left(1-\frac{1}{N}\right)\delta_0+\frac{1}{N}\operatorname{law}\left(N+\varepsilon\left|\sum_{b\in Y}Z_b\right|\right) μ H = ( 1 − N 1 ) δ 0 + N 1 law ( N + ε b ∈ Y ∑ Z b ) where ε \varepsilon ε is an independent uniform sign.
Proof. Since − 1 = 1 -1=1 − 1 = 1 in Z 2 \mathbb{Z}_2 Z 2 , the elements of (14) are R 1 ( 1 , e ) = q e 2 R_1(1,e)=q_e^2 R 1 ( 1 , e ) = q e 2 and R k ( i , e ) = 1 R_k(i,e)=1 R k ( i , e ) = 1 if i = 0 i=0 i = 0 or k = 0 k=0 k = 0 . Hence the only nontrivial generators are g 1 , s ( 1 , b ) = g s ( b ) g_{1,s}(1,b)=g_s(b) g 1 , s ( 1 , b ) = g s ( b ) , since q 0 = 1 q_0=1 q 0 = 1 . The rows of Z Z Z are ( 1 ) b ∈ Y (1)_{b\in Y} ( 1 ) b ∈ Y and ( Z b ) b ∈ Y (Z_b)_{b\in Y} ( Z b ) b ∈ Y , so that
Z Z ∗ = ( N S ‾ S N ) , S = ∑ b ∈ Y Z b ZZ^*=\begin{pmatrix}N&\overline{S}\\S&N\end{pmatrix},\qquad S=\sum_{b\in Y}Z_b Z Z ∗ = ( N S S N ) , S = b ∈ Y ∑ Z b
Its eigenvalues are N ± ∣ S ∣ N\pm|S| N ± ∣ S ∣ , each with weight 1 2 \frac{1}{2} 2 1 for the normalized trace, and Theorem 4.1 gives the result. □
For a row which is not dephased, Proposition 4.2 shows that one may take q b = Q 1 b / Q 0 b q_b=Q_{1b}/Q_{0b} q b = Q 1 b / Q 0 b in the formula for g s ( b ) g_s(b) g s ( b ) , which does not change if all these ratios are multiplied by the same scalar.
The white vertices of B Q B_Q B Q have valence 2. Suppressing them gives the coset graph C Q C_Q C Q , with vertex sets Γ Q / Y 0 \Gamma_Q/Y_0 Γ Q / Y 0 and Γ Q / Y 1 \Gamma_Q/Y_1 Γ Q / Y 1 ; its edge γ \gamma γ joins γ Y 0 \gamma Y_0 γ Y 0 to γ Y 1 \gamma Y_1 γ Y 1 . Using the representatives of degree zero identifies both vertex sets with T Q T_Q T Q , and the left vertex u u u is joined to u t 1 , − b ut_{1,-b} u t 1 , − b on the right, for b ∈ Y b\in Y b ∈ Y . Thus C Q C_Q C Q is N N N -regular and, by Theorem 5.1 , is an abelian covering of the graph with 2 vertices and N N N edges. In the generic case we have:
Proposition 5.4. Let X = Z 2 X=\mathbb{Z}_2 X = Z 2 and let Q Q Q be generic. Let ζ b \zeta_b ζ b , b ∈ Y b\in Y b ∈ Y , be independent random variables uniformly distributed on T \mathbb{T} T , and let s = ∑ b ∈ Y ζ b s=\sum_{b\in Y}\zeta_b s = ∑ b ∈ Y ζ b . Then μ H = ( 1 − 1 N ) δ 0 + 1 N law ( N + ε ∣ s ∣ ) \mu_H=\left(1-\frac{1}{N}\right)\delta_0+\frac{1}{N}\operatorname{law}(N+\varepsilon|s|) μ H = ( 1 − N 1 ) δ 0 + N 1 law ( N + ε ∣ s ∣ ) , and
c n = 1 N ∑ j = 0 ⌊ n / 2 ⌋ ( n 2 j ) N n − 2 j W N ( 2 j ) , W N ( 2 j ) = E ∣ s ∣ 2 j = ∑ ( j b ) ∈ N Y ∑ b j b = j ( j ( j b ) b ∈ Y ) 2 (16) c_n=\frac{1}{N}\sum_{j=0}^{\lfloor n/2\rfloor}\binom{n}{2j}N^{n-2j}W_N(2j),\qquad W_N(2j)=\mathbb{E}|s|^{2j}=\sum_{\substack{(j_b)\in\mathbb{N}^Y\\ \sum_b j_b=j}}\binom{j}{(j_b)_{b\in Y}}^2 \tag*{(16)} c n = N 1 j = 0 ∑ ⌊ n /2 ⌋ ( 2 j n ) N n − 2 j W N ( 2 j ) , W N ( 2 j ) = E ∣ s ∣ 2 j = ( j b ) ∈ N Y ∑ b j b = j ∑ ( ( j b ) b ∈ Y j ) 2 (16) for any integer $n\ge 1.
Proof. By Theorem 3.5 , and since multiplying each column of Z Z Z by the conjugate of its first entry does not change Z Z ∗ ZZ^{*} Z Z ∗ , we can assume that the first row of Z Z Z is ( 1 , … , 1 ) (1,\ldots,1) ( 1 , … , 1 ) and that the second row consists of independent uniform phases ζ b \zeta_b ζ b . Hence
Z Z ∗ = ( N s ˉ s N ) ZZ^{*}=\begin{pmatrix}N&\bar{s}\\s&N\end{pmatrix} Z Z ∗ = ( N s s ˉ N )
whose eigenvalues are N ± ∣ s ∣ N\pm|s| N ± ∣ s ∣ . The normalized trace amounts to choosing the sign with equal probabilities, which gives the law. Expanding ( N + ϵ ∣ s ∣ ) n (N+\epsilon|s|)^n ( N + ϵ ∣ s ∣ ) n , the odd powers of ϵ \epsilon ϵ vanish after averaging over the sign, which gives the first formula in (16) .
Finally, ∣ s ∣ 2 j = ∑ ζ a 1 ⋯ ζ a j ζ ˉ b 1 ⋯ ζ ˉ b j |s|^{2j}=\sum\zeta_{a_1}\cdots\zeta_{a_j}\bar{\zeta}_{b_1}\cdots\bar{\zeta}_{b_j} ∣ s ∣ 2 j = ∑ ζ a 1 ⋯ ζ a j ζ ˉ b 1 ⋯ ζ ˉ b j , and the expectation of a term is one if the multisets { a 1 , … , a j } \{a_1,\ldots,a_j\} { a 1 , … , a j } and { b 1 , … , b j } \{b_1,\ldots,b_j\} { b 1 , … , b j } coincide and zero otherwise. Counting the pairs of words with the same content gives the last formula. □
The numbers W N ( 2 j ) W_N(2j) W N ( 2 j ) are the even moments of the length of the N N N -step planar random walk with unit steps [12 ] . For N = 3 N=3 N = 3 a multinomial coefficient with entries ( j − k , a , k − a ) (j-k,a,k-a) ( j − k , a , k − a ) is ( j k ) ( k a ) \binom{j}{k}\binom{k}{a} ( k j ) ( a k ) , and ∑ a ( k a ) 2 = ( 2 k k ) \sum_a\binom{k}{a}^2=\binom{2k}{k} ∑ a ( a k ) 2 = ( k 2 k ) . For N = 4 N=4 N = 4 we can proceed similarly, by splitting the 4 entries into 2 pairs, and we obtain
W 3 ( 2 j ) = ∑ k = 0 j ( j k ) 2 ( 2 k k ) , W 4 ( 2 j ) = ∑ k = 0 j ( j k ) 2 ( 2 k k ) ( 2 j − 2 k j − k ) W_3(2j)=\sum_{k=0}^{j}\binom{j}{k}^2\binom{2k}{k},\qquad W_4(2j)=\sum_{k=0}^{j}\binom{j}{k}^2\binom{2k}{k}\binom{2j-2k}{j-k} W 3 ( 2 j ) = k = 0 ∑ j ( k j ) 2 ( k 2 k ) , W 4 ( 2 j ) = k = 0 ∑ j ( k j ) 2 ( k 2 k ) ( j − k 2 j − 2 k )
Thus W 3 ( 2 j ) = 1 , 3 , 15 , 93 , 639 , … W_3(2j)=1,3,15,93,639,\ldots W 3 ( 2 j ) = 1 , 3 , 15 , 93 , 639 , … and for N = 4 N=4 N = 4 we obtain the Domb numbers 1 , 4 , 28 , 256 , 2716 , … 1,4,28,256,2716,\ldots 1 , 4 , 28 , 256 , 2716 , … . These numbers count walks on some well-known lattices, as follows:
Proposition 5.5. Let X = Z 2 X=\mathbb{Z}_2 X = Z 2 and let Q Q Q be generic. Then the coset graph C Q C_Q C Q is the maximal abelian covering of the graph with 2 vertices and N N N edges, the number of closed walks of length 2 j 2j 2 j at a vertex of C Q C_Q C Q is W N ( 2 j ) W_N(2j) W N ( 2 j ) , and for N = 2 , 3 , 4 N=2,3,4 N = 2 , 3 , 4 this graph is the line, the honeycomb lattice, and the diamond lattice.
Proof. The first assertion follows from Theorem 5.1 (2). The adjacency operator of C Q C_Q C Q , from the left vertices to the right ones, is the sum of the translations by the elements t 1 , − b t_{1,-b} t 1 , − b , which becomes ∑ b Z b \sum_b Z_b ∑ b Z b after Fourier transform, so the number of closed walks of length 2 j 2j 2 j is
∫ K Q ∣ ∑ b Z b ∣ 2 j d Z = W N ( 2 j ) \int_{K_Q}\left|\sum_b Z_b\right|^{2j}dZ=W_N(2j) ∫ K Q b ∑ Z b 2 j d Z = W N ( 2 j )
Finally, with T = Z N − 1 T=\mathbb{Z}^{N-1} T = Z N − 1 and with e b = t 1 , − b e_b=t_{1,-b} e b = t 1 , − b as basis, the left vertex u u u is joined to the right vertices u , u + e 1 , … , u + e N − 1 u,u+e_1,\ldots,u+e_{N-1} u , u + e 1 , … , u + e N − 1 , and for N = 2 , 3 , 4 N=2,3,4 N = 2 , 3 , 4 these are the standard descriptions of the line, of the honeycomb lattice, and of the diamond lattice, see [38 ] . □
For N = 3 N=3 N = 3 , so that the index is 6, the formula (16) gives c 2 = 4 c_2=4 c 2 = 4 , c 3 = 18 c_3=18 c 3 = 18 and c 4 = 1 3 ( 81 + 6 ⋅ 9 ⋅ 3 + 15 ) = 86 c_4=\frac{1}{3}(81+6\cdot9\cdot3+15)=86 c 4 = 3 1 ( 81 + 6 ⋅ 9 ⋅ 3 + 15 ) = 86 . For the trivial deformation Q = 1 Q=1 Q = 1 one obtains instead the moments 6 n − 1 6^{n-1} 6 n − 1 of the Fourier matrix of Z 6 \mathbb{Z}_6 Z 6 . The program jalabert.py compares the moments (16) with the word counts (11) , and with the numbers of closed walks on the honeycomb, kagome and diamond lattices.
At index 4 the graph with 2 vertices and 2 edges is a cycle, whose coverings are cycles too, and we recover a known formula. Take X = Y = Z 2 X=Y=\mathbb{Z}_2 X = Y = Z 2 and let q q q be the only free entry of Q Q Q . Then T = Z w T=\mathbb{Z}w T = Z w with w = ( x − 1 ) ( y − 1 ) w=(x-1)(y-1) w = ( x − 1 ) ( y − 1 ) , and Corollary 5.3 gives K Q = ⟨ q 4 ⟩ K_Q=\langle q^4\rangle K Q = ⟨ q 4 ⟩ . Thus N Q = { 1 } N_Q=\{1\} N Q = { 1 } if q q q has infinite order, and if q 4 q^4 q 4 has finite order l l l , then N Q = l Z w N_Q=l\mathbb{Z}w N Q = l Z w and dim C ( G H ) = 4 l \dim C(G_H)=4l dim C ( G H ) = 4 l .
Proposition 5.6. Let M = N = 2 M=N=2 M = N = 2 and let q q q be the free entry of the dephased matrix Q Q Q . If q 4 q^4 q 4 has finite order l l l , the rooted law is
μ H = 1 2 δ 0 + 1 2 σ ∗ d 2 l , σ ( u ) = ( u + u − 1 ) 2 (17) \mu_H=\frac{1}{2}\delta_0+\frac{1}{2}\sigma_{*}d_{2l},\qquad\sigma(u)=(u+u^{-1})^2 \tag*{(17)} μ H = 2 1 δ 0 + 2 1 σ ∗ d 2 l , σ ( u ) = ( u + u − 1 ) 2 (17) If q q q has infinite order, the same formula holds with the uniform measure on T \mathbb{T} T in place of d 2 l d_{2l} d 2 l .
Proof. By Corollary 5.3 we have μ H = 1 2 δ 0 + 1 2 law ( 2 + ε ∣ 1 + Z ∣ ) \mu_H = \frac{1}{2}\delta_0 + \frac{1}{2}\operatorname{law}(2+\varepsilon|1+Z|) μ H = 2 1 δ 0 + 2 1 law ( 2 + ε ∣1 + Z ∣ ) , with Z Z Z uniform on the l l l -th roots of unity. With Z = e 2 π i k / l Z=e^{2\pi ik/l} Z = e 2 π ik / l the 2 values of 2 + ε ∣ 1 + Z ∣ 2+\varepsilon|1+Z| 2 + ε ∣1 + Z ∣ are 2 ± 2 cos ( π k / l ) 2\pm2\cos(\pi k/l) 2 ± 2 cos ( π k / l ) , and these are the values of σ ( u ) = 2 + 2 cos ( π m / l ) \sigma(u)=2+2\cos(\pi m/l) σ ( u ) = 2 + 2 cos ( π m / l ) at u = e 2 π i m / ( 4 l ) u=e^{2\pi im/(4l)} u = e 2 π im / ( 4 l ) , for m = k m=k m = k and m = k + l m=k+l m = k + l modulo 2 l 2l 2 l . Since d 2 l d_{2l} d 2 l is the uniform measure on the 4 l 4l 4 l -th roots of unity, this gives the result. For q q q of infinite order the proof is similar. Here C Q C_Q C Q is a cycle of length 2 l 2l 2 l , with 2 parallel edges if l = 1 l=1 l = 1 , or a line. □
For finite l l l , the measure (5.2) is the squared law of D ~ 2 l + 2 \widetilde{D}_{2l+2} D 2 l + 2 at an extending vertex by the A , D A,D A , D formulas of § 2.2 . In particular, phases q q q of orders 3 and 12 give the same rooted law.
Let us go back now to the general case of 2 rows. In terms of quantum groups, the group Γ X , Y = I Y ⋊ Y \Gamma_{X,Y}=I_Y\rtimes Y Γ X , Y = I Y ⋊ Y appearing in the generic case is a crystallographic group, with Y Y Y acting on I Y ≃ Z N − 1 I_Y\simeq\mathbb{Z}^{N-1} I Y ≃ Z N − 1 by multiplication, and
C ( G H ) = C ∗ ( Γ X , Y ) ⋊ C ( Z 2 ) C(G_H)=C^*(\Gamma_{X,Y})\rtimes C(\mathbb{Z}_2) C ( G H ) = C ∗ ( Γ X , Y ) ⋊ C ( Z 2 )
For Y = Z 3 Y=\mathbb{Z}_3 Y = Z 3 this group is the wallpaper group p 3 p3 p 3 , generated by 2 rotations of order 3, namely a = 1 ( 0 ) a=1^{(0)} a = 1 ( 0 ) and b = 1 ( 1 ) b=1^{(1)} b = 1 ( 1 ) , with presentation a 3 = b 3 = ( a b ) 3 = 1 a^3=b^3=(ab)^3=1 a 3 = b 3 = ( ab ) 3 = 1 , and its Cayley graph with respect to a ± 1 , b ± 1 a^{\pm1},b^{\pm1} a ± 1 , b ± 1 is the kagome lattice, as explained in [2 ] . In terms of the rooted law, we have:
Theorem 5.7. Let H = F 2 ⊗ Q F 3 H=F_2\mathbin{\otimes_Q}F_3 H = F 2 ⊗ Q F 3 , with Q Q Q generic, or more generally with N Q = { 1 } N_Q=\{1\} N Q = { 1 } . Then
μ H = 1 2 δ 0 + 1 2 law ( 2 + A ) \mu_H=\frac{1}{2}\delta_0+\frac{1}{2}\operatorname{law}(2+A) μ H = 2 1 δ 0 + 2 1 law ( 2 + A ) where A A A is the adjacency operator of the kagome lattice, that is, of the Cayley graph of Γ X , Y \Gamma_{X,Y} Γ X , Y with respect to a ± 1 , b ± 1 a^{\pm1},b^{\pm1} a ± 1 , b ± 1 , and the law is taken at any vertex.
Proof. The elements of Γ X , Y \Gamma_{X,Y} Γ X , Y are the edges of the coset graph C Q C_Q C Q , which is the honeycomb lattice, by Proposition 5.5 . Now 2 edges γ ≠ γ ′ \gamma\ne\gamma' γ = γ ′ have a common vertex precisely when γ Y i = γ ′ Y i \gamma Y_i=\gamma'Y_i γ Y i = γ ′ Y i for some i i i , that is, when γ ′ = γ b ( i ) \gamma'=\gamma b^{(i)} γ ′ = γ b ( i ) with b ≠ 0 b\ne0 b = 0 . Thus the Cayley graph in the statement is the line graph of the honeycomb lattice, which is the kagome lattice, in agreement with [2 ] . The formula for μ H \mu_H μ H follows from Proposition 5.2. □
The honeycomb and kagome lattices are shown in Figure 2 . The vertices of the kagome lattice are the midpoints of the edges of the honeycomb lattice, and 2 such midpoints are joined when the corresponding edges have a common vertex.
Figure 2. The honeycomb lattice, and its line graph, the kagome lattice.
The kagome lattice is known to have a flat band, namely the eigenvalue − 2 -2 − 2 of A A A , of weight 1 3 \frac{1}{3} 3 1 . This comes from the identity 2 + A = J ∗ J 2+A=J^*J 2 + A = J ∗ J , the honeycomb lattice having 3 edges and 2 vertices in each cell, so that J ∗ J J^*J J ∗ J has a kernel of weight 1 3 \frac{1}{3} 3 1 . Via 1 2 + 1 2 ⋅ 1 3 = 2 3 \frac{1}{2}+\frac{1}{2}\cdot\frac{1}{3}=\frac{2}{3} 2 1 + 2 1 ⋅ 3 1 = 3 2 , this flat band is the atom 2 3 δ 0 \frac{2}{3}\delta_0 3 2 δ 0 of the formula in Proposition 5.4 .
The index 6
At index 6 we take Y = Z 3 Y=\mathbb{Z}_3 Y = Z 3 and write the dephased second row as ( 1 , p , q ) (1,p,q) ( 1 , p , q ) . For Z ∈ K Q Z\in K_Q Z ∈ K Q we write ( Z 1 , Z 2 ) (Z_1,Z_2) ( Z 1 , Z 2 ) for its free coordinates.
Theorem 5.8 (All parameters at index 6). Put α = p 2 \alpha=p^2 α = p 2 and β = q 2 \beta=q^2 β = q 2 . The group K Q K_Q K Q is the closed subgroup of T 2 \mathbb{T}^2 T 2 generated by
( β α − 2 , ( α β ) − 1 ) and ( ( α β ) − 1 , α β − 2 ) (\beta\alpha^{-2},(\alpha\beta)^{-1})\quad\text{and}\quad((\alpha\beta)^{-1},\alpha\beta^{-2}) ( β α − 2 , ( α β ) − 1 ) and (( α β ) − 1 , α β − 2 ) and the rooted law of F 2 ⊗ Q F 3 F_2\otimes_Q F_3 F 2 ⊗ Q F 3 is
μ H = 2 3 δ 0 + 1 3 law ( 3 + ε ∣ 1 + Z 1 + Z 2 ∣ ) \mu_H=\frac{2}{3}\delta_0+\frac{1}{3}\operatorname{law}(3+\varepsilon\lvert1+Z_1+Z_2\rvert) μ H = 3 2 δ 0 + 3 1 law ( 3 + ε ∣ 1 + Z 1 + Z 2 ∣) where ( Z 1 , Z 2 ) (Z_1,Z_2) ( Z 1 , Z 2 ) is Haar distributed on K Q K_Q K Q . If p p p or q q q has infinite order, then K Q = T 2 K_Q=\mathbb{T}^2 K Q = T 2 . If p p p and q q q are roots of unity, K Q K_Q K Q is the finite group generated by the 2 displayed elements.
Proof. The generators of Corollary 5.3 are g 0 = 1 g_0=1 g 0 = 1 , g 1 = ( q 2 p − 4 , p − 2 q − 2 ) g_1=(q^2p^{-4},p^{-2}q^{-2}) g 1 = ( q 2 p − 4 , p − 2 q − 2 ) and g 2 = ( p − 2 q − 2 , p 2 q − 4 ) g_2=(p^{-2}q^{-2},p^2q^{-4}) g 2 = ( p − 2 q − 2 , p 2 q − 4 ) , which are the displayed elements. The formula for μ H \mu_H μ H is Corollary 5.3. A character ( z 1 , z 2 ) ↦ z 1 h z 2 k (z_1,z_2)\mapsto z_1^h z_2^k ( z 1 , z 2 ) ↦ z 1 h z 2 k is trivial on K Q K_Q K Q if and only if
α − 2 h − k β h − k = 1 and α k − h β − h − 2 k = 1 \alpha^{-2h-k}\beta^{h-k}=1\quad\text{and}\quad\alpha^{k-h}\beta^{-h-2k}=1 α − 2 h − k β h − k = 1 and α k − h β − h − 2 k = 1
The matrix of exponents has determinant ( 2 h + k ) ( h + 2 k ) + ( h − k ) 2 = 3 ( h 2 + h k + k 2 ) (2h+k)(h+2k)+(h-k)^2=3(h^2+hk+k^2) ( 2 h + k ) ( h + 2 k ) + ( h − k ) 2 = 3 ( h 2 + hk + k 2 ) , which is positive for ( h , k ) ≠ ( 0 , 0 ) (h,k)\ne(0,0) ( h , k ) = ( 0 , 0 ) . Multiplying the 2 relations by the adjugate matrix, we see that a nonzero relation gives α 3 ( h 2 + h k + k 2 ) = β 3 ( h 2 + h k + k 2 ) = 1 \alpha^{3(h^2+hk+k^2)}=\beta^{3(h^2+hk+k^2)}=1 α 3 ( h 2 + hk + k 2 ) = β 3 ( h 2 + hk + k 2 ) = 1 , so that p p p and q q q are roots of unity. Hence if p p p or q q q has infinite order, no nontrivial character is trivial on K Q K_Q K Q , and K Q = T 2 K_Q=\mathbb{T}^2 K Q = T 2 . If p p p and q q q are roots of unity, the 2 generators have finite order and generate a finite group. □
The first assertion is the dual form of [8 Theorem 4.6] , where the group N Q N_Q N Q is computed, and where the ring of Eisenstein integers appears, in the computation of the order of G H G_H G H . If p p p has infinite order, the law is the generic law of Proposition 5.4 for every q q q , including dependent choices such as q = p 3 q=p^3 q = p 3 . This agrees with the case N = 3 N=3 N = 3 of [11 Theorem 5.1] .
Corollary 5.9 (The row ( 1 , 1 , q ) (1,1,q) ( 1 , 1 , q ) ). For p = 1 p=1 p = 1 , the random pair ( Z 1 , Z 2 ) (Z_1,Z_2) ( Z 1 , Z 2 ) of Theorem 5.8 has the law of ( U , U V ‾ ) (U,U\overline{V}) ( U , U V ) , where U U U and V V V are independent and Haar distributed on ⟨ q 2 ⟩ \langle q^2\rangle ⟨ q 2 ⟩ and on ⟨ q 6 ⟩ \langle q^6\rangle ⟨ q 6 ⟩ . If q 2 q^2 q 2 has finite order l l l , the group K Q K_Q K Q has l 2 / gcd ( l , 3 ) l^2/\gcd(l,3) l 2 / g cd( l , 3 ) elements.
Proof. With α = 1 \alpha=1 α = 1 the generators of Theorem 5.8 are ( β , β − 1 ) (\beta,\beta^{-1}) ( β , β − 1 ) and ( β − 1 , β − 2 ) (\beta^{-1},\beta^{-2}) ( β − 1 , β − 2 ) . The subgroup generated by them consists of the pairs ( β a − b , β − a − 2 b ) = ( U , U V ‾ ) (\beta^{a-b},\beta^{-a-2b})=(U,\overline{UV}) ( β a − b , β − a − 2 b ) = ( U , U V ) with U = β a − b U=\beta^{a-b} U = β a − b and V = β − 3 b V=\beta^{-3b} V = β − 3 b , a , b ∈ Z a,b\in\mathbb{Z} a , b ∈ Z . As ( a , b ) (a,b) ( a , b ) runs over Z 2 \mathbb{Z}^2 Z 2 , the pair ( U , V ) (U,V) ( U , V ) runs over { β u : u ∈ Z } × { β 3 v : v ∈ Z } \{\beta^u:u\in\mathbb{Z}\}\times\{\beta^{3v}:v\in\mathbb{Z}\} { β u : u ∈ Z } × { β 3 v : v ∈ Z } . The map ( u , v ) ↦ ( u , u v ‾ ) (u,v)\mapsto(u,u\overline{v}) ( u , v ) ↦ ( u , u v ) is an automorphism of the compact group T 2 \mathbb{T}^2 T 2 , so that K Q K_Q K Q is the image of ⟨ β ⟩ × ⟨ β 3 ⟩ \langle\beta\rangle\times\langle\beta^3\rangle ⟨ β ⟩ × ⟨ β 3 ⟩ and the Haar measures correspond. In the finite case, ⟨ β ⟩ \langle\beta\rangle ⟨ β ⟩ has l l l elements and ⟨ β 3 ⟩ \langle\beta^3\rangle ⟨ β 3 ⟩ has l / gcd ( l , 3 ) l/\gcd(l,3) l / g cd( l , 3 ) elements. □
We can now describe all the quantum groups at index 6. Let ω = e 2 π i / 3 \omega=e^{2\pi i/3} ω = e 2 π i /3 and ζ = 1 + ω = e π i / 3 \zeta=1+\omega=e^{\pi i/3} ζ = 1 + ω = e π i /3 , and let Z [ ω ] = Z ⊕ Z ζ \mathbb{Z}[\omega]=\mathbb{Z}\oplus\mathbb{Z}\zeta Z [ ω ] = Z ⊕ Z ζ be the ring of Eisenstein integers, whose norm is given by ∣ k + h ζ ∣ 2 = k 2 + k h + h 2 \lvert k+h\zeta\rvert^2=k^2+kh+h^2 ∣ k + h ζ ∣ 2 = k 2 + k h + h 2 . The honeycomb lattice of Proposition 5.5 has T 2 \mathbb{T}^2 T 2 as group of translations, and for a nonzero ideal I = ( b + c ζ ) I=(b+c\zeta) I = ( b + c ζ ) of Z [ ω ] \mathbb{Z}[\omega] Z [ ω ] the quotient of the hexagonal tessellation by the translations in I I I is the map { 6 , 3 } b , c \{6,3\}_{b,c} { 6 , 3 } b , c on the torus of Coxeter and Moser [15 ] , with b 2 + b c + c 2 b^2+bc+c^2 b 2 + b c + c 2 hexagonal faces. The units being the powers of ζ \zeta ζ , any nonzero ideal has a unique generator b + c ζ b+c\zeta b + c ζ with b ≥ 1 b\ge1 b ≥ 1 and c ≥ 0 c\ge0 c ≥ 0 .
Theorem 5.10. Let H = F 2 ⊗ Q F 3 H=F_2\otimes_Q F_3 H = F 2 ⊗ Q F 3 , with the dephased second row of Q Q Q being ( 1 , p , q ) (1,p,q) ( 1 , p , q ) , and put α = p 2 \alpha=p^2 α = p 2 , β = q 2 \beta=q^2 β = q 2 . Identify T \mathbb{T} T with Z [ ω ] \mathbb{Z}[\omega] Z [ ω ] , via t 11 ↦ 1 t_{11}\mapsto1 t 11 ↦ 1 and t 12 ↦ ζ t_{12}\mapsto\zeta t 12 ↦ ζ .
N Q N_Q N Q is an ideal of Z [ ω ] \mathbb{Z}[\omega] Z [ ω ] , which is zero precisely when p p p or q q q has infinite order.
Every ideal occurs. More precisely, for k + h ζ ≠ 0 k+h\zeta\ne0 k + h ζ = 0 , with norm n = k 2 + k h + h 2 n=k^2+kh+h^2 n = k 2 + k h + h 2 , the parameters
α = e − 2 π i ( h + 2 k ) / ( 3 n ) , β = e 2 π i ( h − k ) / ( 3 n ) \alpha=e^{-2\pi i(h+2k)/(3n)},\qquad\beta=e^{2\pi i(h-k)/(3n)} α = e − 2 π i ( h + 2 k ) / ( 3 n ) , β = e 2 π i ( h − k ) / ( 3 n ) give the ideal N Q = ( k + h ζ ) N_Q=(k+h\zeta) N Q = ( k + h ζ ) .
Proof. 1. By Lemma 3.7 the conjugation by ( − 1 ) ( 0 ) (-1)^{(0)} ( − 1 ) ( 0 ) is the multiplication by y y y on T = ( x − 1 ) I Y T=(x-1)I_Y T = ( x − 1 ) I Y . Since 1 + y + y 2 1+y+y^2 1 + y + y 2 acts by zero on I Y I_Y I Y , the group T T T is a module over Z [ y ] / ( 1 + y + y 2 ) = Z [ ω ] \mathbb{Z}[y]/(1+y+y^2)=\mathbb{Z}[\omega] Z [ y ] / ( 1 + y + y 2 ) = Z [ ω ] , which is free of rank 1, generated by t 11 = ( x − 1 ) ( y − 1 ) t_{11}=(x-1)(y-1) t 11 = ( x − 1 ) ( y − 1 ) , and we have t 12 = ( 1 + y ) t 11 t_{12}=(1+y)t_{11} t 12 = ( 1 + y ) t 11 , which corresponds to 1 + ω = ζ 1+\omega=\zeta 1 + ω = ζ . Now N Q N_Q N Q is a normal subgroup of Γ X , Y \Gamma_{X,Y} Γ X , Y , so it is stable under the multiplication by y y y , and so it is an ideal. The last assertion follows from Theorem 5.8 .
The free coordinates of Z ∈ K Q Z\in K_Q Z ∈ K Q are Z 1 = χ ( t 1 , − 1 ) = χ ( t 12 ) Z_1=\chi(t_{1,-1})=\chi(t_{12}) Z 1 = χ ( t 1 , − 1 ) = χ ( t 12 ) and Z 2 = χ ( t 1 , − 2 ) = χ ( t 11 ) Z_2=\chi(t_{1,-2})=\chi(t_{11}) Z 2 = χ ( t 1 , − 2 ) = χ ( t 11 ) , so by (12) the element k + h ζ k+h\zeta k + h ζ belongs to N Q N_Q N Q precisely when the character Z 1 k Z 2 h Z_1^k Z_2^h Z 1 k Z 2 h is trivial on K Q K_Q K Q . By the proof of Theorem 5.8 , with α = e 2 π i s \alpha=e^{2\pi i s} α = e 2 π i s and β = e 2 π i s ′ \beta=e^{2\pi i s'} β = e 2 π i s ′ , this happens when
A ( k + h ζ ) ( s s ′ ) ∈ Z 2 , A ( k + h ζ ) = ( − ( 2 h + k ) h − k k − h − ( h + 2 k ) ) A(k+h\zeta)\begin{pmatrix}s\\s'\end{pmatrix}\in\mathbb{Z}^2,\qquad A(k+h\zeta)=\begin{pmatrix}-(2h+k)&h-k\\k-h&-(h+2k)\end{pmatrix} A ( k + h ζ ) ( s s ′ ) ∈ Z 2 , A ( k + h ζ ) = ( − ( 2 h + k ) k − h h − k − ( h + 2 k ) )
The matrix A ( z ) A(z) A ( z ) is additive in z ∈ Z [ ω ] z\in\mathbb{Z}[\omega] z ∈ Z [ ω ] , and satisfies A ( ζ z ) = P A ( z ) A(\zeta z)=PA(z) A ( ζ z ) = P A ( z ) , with P = ( 1 − 1 1 0 ) P=\begin{pmatrix}1&-1\\1&0\end{pmatrix} P = ( 1 1 − 1 0 ) , as one checks on the formula. Since P 2 − P + 1 = 0 P^2-P+1=0 P 2 − P + 1 = 0 , we have A ( z ) = ι ( z ) A ( 1 ) A(z)=\iota(z)A(1) A ( z ) = ι ( z ) A ( 1 ) , where ι \iota ι is the embedding of the field Q ( ω ) \mathbb{Q}(\omega) Q ( ω ) into M 2 ( Q ) M_2(\mathbb{Q}) M 2 ( Q ) given by ι ( ζ ) = P \iota(\zeta)=P ι ( ζ ) = P .
Now let z 0 = k + h ζ ≠ 0 z_0=k+h\zeta\ne0 z 0 = k + h ζ = 0 . The matrix A ( z 0 ) A(z_0) A ( z 0 ) has determinant 3 n 3n 3 n , and the parameters in the statement are those given by ( s , s ′ ) t = A ( z 0 ) − 1 ( 1 , 0 ) t (s,s')^{\mathsf{t}}=A(z_0)^{-1}(1,0)^{\mathsf{t}} ( s , s ′ ) t = A ( z 0 ) − 1 ( 1 , 0 ) t . For this choice, an element z z z belongs to N Q N_Q N Q precisely when the vector ι ( z / z 0 ) ( 1 , 0 ) t \iota(z/z_0)(1,0)^{\mathsf{t}} ι ( z / z 0 ) ( 1 , 0 ) t has integer entries, and since ι ( k ′ + h ′ ζ ) ( 1 , 0 ) t = ( k ′ + h ′ , h ′ ) t \iota(k'+h'\zeta)(1,0)^{\mathsf{t}}=(k'+h',h')^{\mathsf{t}} ι ( k ′ + h ′ ζ ) ( 1 , 0 ) t = ( k ′ + h ′ , h ′ ) t , this happens precisely when z / z 0 ∈ Z [ ω ] z/z_0\in\mathbb{Z}[\omega] z / z 0 ∈ Z [ ω ] .
When the ideal is nonzero, the quantum group and its law can be described as follows:
Theorem 5.11. In the above setting, assume N Q = ( b + c ζ ) N_Q=(b+c\zeta) N Q = ( b + c ζ ) , with b ≥ 1 b\ge1 b ≥ 1 and c ≥ 0 c\ge0 c ≥ 0 , and let n = b 2 + b c + c 2 n=b^2+bc+c^2 n = b 2 + b c + c 2 . Then G H G_H G H is finite, of order 6 n 6n 6 n , the coset graph C Q C_Q C Q is the graph of the map { 6 , 3 } b , c \{6,3\}_{b,c} { 6 , 3 } b , c , with 2 n 2n 2 n vertices, and
μ H = 2 3 δ 0 + 1 6 n ∑ χ ( δ 3 + ∣ 1 + χ ( 1 ) + χ ( ζ ) ∣ + δ 3 − ∣ 1 + χ ( 1 ) + χ ( ζ ) ∣ ) \mu_H=\frac{2}{3}\delta_0+\frac{1}{6n}\sum_{\chi}\left(\delta_{3+\lvert1+\chi(1)+\chi(\zeta)\rvert}+\delta_{3-\lvert1+\chi(1)+\chi(\zeta)\rvert}\right) μ H = 3 2 δ 0 + 6 n 1 χ ∑ ( δ 3 + ∣ 1 + χ ( 1 ) + χ ( ζ )∣ + δ 3 − ∣ 1 + χ ( 1 ) + χ ( ζ )∣ ) with the sum being over the n n n characters χ \chi χ of the group Z [ ω ] / N Q \mathbb{Z}[\omega]/N_Q Z [ ω ] / N Q . Also, conjugate ideals give the same rooted law.
Proof. By Theorem 5.10 the parameters p , q p,q p , q are roots of unity, so G H G_H G H is finite, of order 6 [ T : N Q ] 6[T:N_Q] 6 [ T : N Q ] , by Proposition 3.13, and the index of an ideal is the norm of its generator. The coset graph is the quotient of the honeycomb lattice by the group of translations N Q N_Q N Q , as explained above, and the formula for μ H \mu_H μ H is the one in Theorem 5.8 , with ( Z 1 , Z 2 ) = ( χ ( ζ ) , χ ( 1 ) ) (Z_1,Z_2)=(\chi(\zeta),\chi(1)) ( Z 1 , Z 2 ) = ( χ ( ζ ) , χ ( 1 )) .
Regarding the last assertion, the conjugate of k + h ζ k+h\zeta k + h ζ is ( k + h ) − h ζ = ζ − 1 ( h + k ζ ) (k+h)-h\zeta=\zeta^{-1}(h+k\zeta) ( k + h ) − h ζ = ζ − 1 ( h + k ζ ) , so passing to the conjugate ideal amounts to exchanging Z 1 Z_1 Z 1 and Z 2 Z_2 Z 2 , and the number ∣ 1 + Z 1 + Z 2 ∣ \lvert1+Z_1+Z_2\rvert ∣ 1 + Z 1 + Z 2 ∣ is symmetric in Z 1 , Z 2 Z_1,Z_2 Z 1 , Z 2 .
The orders of the phase groups are therefore the numbers of the form b 2 + b c + c 2 b^2+bc+c^2 b 2 + b c + c 2 , namely 1 , 3 , 4 , 7 , 9 , 12 , 13 , 16 , 19 , 21 , … 1,3,4,7,9,12,13,16,19,21,\ldots 1 , 3 , 4 , 7 , 9 , 12 , 13 , 16 , 19 , 21 , … , and for the first values the graphs obtained are well-known ones. Here are the first 5 cases, with the graphs being identified by an isomorphism test, done by the program jalabert.py, which also checks the above 2 theorems, for the ideals of norm at most 60.
Example 5.12 (The complete bipartite graph and the cube). Take p = 1 p=1 p = 1 . At q = e 2 π i / 3 q=e^{2\pi i/3} q = e 2 π i /3 , the pair of Corollary 5.9 is ( U , U ‾ ) (U,\overline{U}) ( U , U ) with U 3 = 1 U^3=1 U 3 = 1 . Here T Q ≃ Z 3 T_Q\simeq\mathbb{Z}_3 T Q ≃ Z 3 , the ideal is ( 1 + ζ ) (1+\zeta) ( 1 + ζ ) , and the 3 right neighbors of a left vertex exhaust the right vertex set, which gives K 3 , 3 K_{3,3} K 3 , 3 . At q = i q=i q = i , the 2 coordinates are independent uniform signs. Here T Q ≃ Z 2 2 T_Q\simeq\mathbb{Z}_2^2 T Q ≃ Z 2 2 , the ideal is ( 2 ) (2) ( 2 ) , and the 3 translations omit one perfect matching from K 4 , 4 K_{4,4} K 4 , 4 , which gives the cube. In these 2 cases the rooted laws are
13 δ 0 + 4 δ 3 + δ 6 18 \frac{13\delta_0+4\delta_3+\delta_6}{18} 18 13 δ 0 + 4 δ 3 + δ 6
and
17 δ 0 + 3 δ 2 + 3 δ 4 + δ 6 24 \frac{17\delta_0+3\delta_2+3\delta_4+\delta_6}{24} 24 17 δ 0 + 3 δ 2 + 3 δ 4 + δ 6
Indeed, ∣ 1 + Z 1 + Z 2 ∣ \lvert1+Z_1+Z_2\rvert ∣ 1 + Z 1 + Z 2 ∣ takes the values 3 , 0 , 0 3,0,0 3 , 0 , 0 in the first case and 3 , 1 , 1 , 1 3,1,1,1 3 , 1 , 1 , 1 in the second. At q = ± 1 q=\pm1 q = ± 1 the group K Q K_Q K Q is trivial and the law is 5 δ 0 + δ 6 6 \frac{5\delta_0+\delta_6}{6} 6 5 δ 0 + δ 6 .
The next ideals are those of norm 7 7 7 , namely ( 2 + ζ ) (2+\zeta) ( 2 + ζ ) and its conjugate, which give the same graph and the same law, as follows:
Example 5.13 (The Heawood graph). Let η = e 2 π i / 7 \eta=e^{2\pi i/7} η = e 2 π i /7 and take ( p , q ) = ( η , η 3 ) (p,q)=(\eta,\eta^3) ( p , q ) = ( η , η 3 ) . The generators of Theorem 5.8 are ( η 2 , η 6 ) (\eta^2,\eta^6) ( η 2 , η 6 ) and ( η 2 , η 4 ) (\eta^2,\eta^4) ( η 2 , η 4 ) , which is the cube of the first one. Thus the random row is ( 1 , u , u 3 ) (1,u,u^3) ( 1 , u , u 3 ) with u u u uniform on the seventh roots of unity. The 6 6 6 differences of 2 2 2 distinct elements of { 0 , 1 , 3 } \{0,1,3\} { 0 , 1 , 3 } are the nonzero residues modulo 7 7 7 . Hence, for u ≠ 1 u\ne1 u = 1 , we have
∣ 1 + u + u 3 ∣ 2 = 3 + ∑ j = 1 6 u j = 2 \lvert1+u+u^3\rvert^2=3+\sum_{j=1}^{6}u^j=2 ∣ 1 + u + u 3 ∣ 2 = 3 + j = 1 ∑ 6 u j = 2 At u = 1 u=1 u = 1 the length is 3 3 3 , and Theorem 5.8 gives
μ H = 29 42 δ 0 + 1 7 ( δ 3 − 2 + δ 3 + 2 ) + 1 42 δ 6 \mu_H=\frac{29}{42}\delta_0+\frac{1}{7}\left(\delta_{3-\sqrt{2}}+\delta_{3+\sqrt{2}}\right)+\frac{1}{42}\delta_6 μ H = 42 29 δ 0 + 7 1 ( δ 3 − 2 + δ 3 + 2 ) + 42 1 δ 6 Here T Q ≃ Z 7 T_Q\simeq\mathbb{Z}_7 T Q ≃ Z 7 , the ideal has norm 7 7 7 , and the right neighbors of u u u are u u u , u + 1 u+1 u + 1 and u + 3 u+3 u + 3 . Since { 0 , 1 , 3 } \{0,1,3\} { 0 , 1 , 3 } is a perfect difference set modulo 7 7 7 , any 2 2 2 distinct points lie in exactly one translate of { 0 , 1 , 3 } \{0,1,3\} { 0 , 1 , 3 } . The 7 7 7 translates are the lines of the Fano plane, and the coset graph is its incidence graph, which is the Heawood graph, coming from the map { 6 , 3 } 2 , 1 \{6,3\}_{2,1} { 6 , 3 } 2 , 1 .
At norms 9 9 9 and 12 12 12 we have the ideals ( 3 ) (3) ( 3 ) and ( 2 + 2 ζ ) (2+2\zeta) ( 2 + 2 ζ ) , where the rooted law gets closer to the generic one:
Example 5.14 (The Pappus and Nauru graphs). For the ideal ( 3 ) (3) ( 3 ) the phase group consists of the pairs of cubic roots of unity, the length ∣ 1 + Z 1 + Z 2 ∣ \lvert1+Z_1+Z_2\rvert ∣ 1 + Z 1 + Z 2 ∣ takes the values 3 3 3 , 0 0 0 , 3 \sqrt{3} 3 with multiplicities 1 1 1 , 2 2 2 , 6 6 6 , and we obtain the Pappus graph, coming from the map { 6 , 3 } 3 , 0 \{6,3\}_{3,0} { 6 , 3 } 3 , 0 , and the law
μ H = 37 δ 0 + 4 δ 3 + δ 6 54 + 1 9 ( δ 3 − 3 + δ 3 + 3 ) \mu_H=\frac{37\delta_0+4\delta_3+\delta_6}{54}+\frac{1}{9}\left(\delta_{3-\sqrt{3}}+\delta_{3+\sqrt{3}}\right) μ H = 54 37 δ 0 + 4 δ 3 + δ 6 + 9 1 ( δ 3 − 3 + δ 3 + 3 ) Next, take p = 1 p=1 p = 1 and q = e 2 π i / 12 q=e^{2\pi i/12} q = e 2 π i /12 . In Corollary 5.9, U U U is uniform on the sixth roots of unity and V V V is a uniform sign. The length ∣ 1 + U + U V ‾ ∣ \lvert1+U+U\overline{V}\rvert ∣ 1 + U + U V ∣ takes the values 0 , 1 , 2 , 3 0,1,2,3 0 , 1 , 2 , 3 with multiplicities 2 , 3 , 6 , 1 2,3,6,1 2 , 3 , 6 , 1 among the 12 12 12 pairs. We obtain
μ H = 49 δ 0 + 6 δ 1 + 3 δ 2 + 4 δ 3 + 3 δ 4 + 6 δ 5 + δ 6 72 \mu_H=\frac{49\delta_0+6\delta_1+3\delta_2+4\delta_3+3\delta_4+6\delta_5+\delta_6}{72} μ H = 72 49 δ 0 + 6 δ 1 + 3 δ 2 + 4 δ 3 + 3 δ 4 + 6 δ 5 + δ 6 Here the ideal is ( 2 + 2 ζ ) (2+2\zeta) ( 2 + 2 ζ ) , and the coset graph is the Nauru graph, coming from the map { 6 , 3 } 2 , 2 \{6,3\}_{2,2} { 6 , 3 } 2 , 2 . The first 7 7 7 moments agree with the generic ones given by (16) . For n = 8 n=8 n = 8 this measure gives c 8 = 58986 c_8=58986 c 8 = 58986 , whereas c 8 g e n = 58974 c_8^{\mathrm{gen}}=58974 c 8 gen = 58974 . By Theorem 4.3 , the shortest nontrivial element of N Q N_Q N Q has length 8 8 8 . The moments of the 3 3 3 rational laws above, with denominators 18 18 18 , 24 24 24 and 72 72 72 , are computed by the program wordgram.py too, including the difference c 8 − c 8 g e n = 12 c_8-c_8^{\mathrm{gen}}=12 c 8 − c 8 gen = 12 .
By Theorem 5.11 the rooted law does not distinguish an ideal from its conjugate. We do not know if this is the only loss of information. The program jalabert.py shows that the rooted laws of the 243 243 243 ideals of norm at most 400 400 400 are distinct, up to conjugation.
The above results explain the numerical data in [2 ] , where the matrices F 2 ⊗ Q F 3 F_2\otimes_{\mathbb{Q}}F_3 F 2 ⊗ Q F 3 appear as limits of the Karlsson matrices, with second row ( 1 , z 1 , z 2 ) (1,z_1,z_2) ( 1 , z 1 , z 2 ) . The limit of order 24 24 24 found there has ( α , β ) = ( e 2 π i / 6 , e 2 π i / 3 ) (\alpha,\beta)=(e^{2\pi i/6},e^{2\pi i/3}) ( α , β ) = ( e 2 π i /6 , e 2 π i /3 ) , so the 2 2 2 generators of Theorem 5.8 are ( 1 , − 1 ) (1,-1) ( 1 , − 1 ) and ( − 1 , − 1 ) (-1,-1) ( − 1 , − 1 ) , and this is the case of the cube, with the ideal being ( 2 ) (2) ( 2 ) . Thus, by Example 5.12, we have
c n = 3 ⋅ 2 n + 3 ⋅ 4 n + 6 n 24 c_n=\frac{3\cdot2^n+3\cdot4^n+6^n}{24} c n = 24 3 ⋅ 2 n + 3 ⋅ 4 n + 6 n
which gives 1 , 4 , 18 , 88 , 456 , 2464 , 13728 1,4,18,88,456,2464,13728 1 , 4 , 18 , 88 , 456 , 2464 , 13728 , and by (1) the annular multiplicities at the levels 3 , … , 7 3,\ldots,7 3 , … , 7 are 1 , 10 , 29 , 114 , 419 1,10,29,114,419 1 , 10 , 29 , 114 , 419 , which are the numbers found there by floating point computations.
Similarly, for K 3 , 3 K_{3,3} K 3 , 3 we obtain c n = 1 18 ( 4 ⋅ 3 n + 6 n ) c_n=\frac{1}{18}(4\cdot3^n+6^n) c n = 18 1 ( 4 ⋅ 3 n + 6 n ) , starting with 1 , 4 , 18 , 90 1,4,18,90 1 , 4 , 18 , 90 , and annular multiplicities 1 , 12 , 39 , 152 , 559 1,12,39,152,559 1 , 12 , 39 , 152 , 559 , which are the numbers found there at the limits having c 4 = 90 c_4=90 c 4 = 90 . Finally, the limit with ( α , β ) = ( e 2 π i / 6 , e 4 π i / 3 ) (\alpha,\beta)=(e^{2\pi i/6},e^{4\pi i/3}) ( α , β ) = ( e 2 π i /6 , e 4 π i /3 ) considered there has a phase group of order 12, so the ideal is ( 2 + 2 ζ ) (2+2\zeta) ( 2 + 2 ζ ) , as for the Nauru graph in Example 5.14, and this is why this limit, of order 72, has the same invariants as the generic one up to the level 7, the annular multiplicities at the levels 3, . . . , 7 being 1, 8, 19, 66, 209 in both cases. These computations are done by jalabert.py too.
The generic law
In the remaining case, where the ideal is zero, the law is that of the honeycomb and kagome lattices, by Proposition 5.5 and Theorem 5.7, and it can be computed explicitly. Consider the complete elliptic integral of the first kind, with modulus k ∈ [ 0 , 1 ) k\in[0,1) k ∈ [ 0 , 1 ) ,
K ( k ) = ∫ 0 π / 2 d φ 1 − k 2 sin 2 φ K(k)=\int_{0}^{\pi/2}\frac{d\varphi}{\sqrt{1-k^2\sin^2\varphi}} K ( k ) = ∫ 0 π /2 1 − k 2 sin 2 φ d φ
Theorem 5.15. Let H = F 2 ⊗ Q F 3 H=F_2\otimes_{\mathbb{Q}}F_3 H = F 2 ⊗ Q F 3 , with p p p or q q q of infinite order. Then
μ H = 2 3 δ 0 + 1 6 p 3 ( ∣ x − 3 ∣ ) d x \mu_H=\frac{2}{3}\delta_0+\frac{1}{6}p_3(|x-3|)\,dx μ H = 3 2 δ 0 + 6 1 p 3 ( ∣ x − 3∣ ) d x on [ 0 , 6 ] [0,6] [ 0 , 6 ] , where p 3 p_3 p 3 is the density of the length of the 3-step planar random walk, given by
p 3 ( r ) = 4 r π 2 ( 1 + r ) 3 ( 3 − r ) K ( 16 r ( 1 + r ) 3 ( 3 − r ) ) , p 3 ( r ) = r π 2 K ( ( 1 + r ) 3 ( 3 − r ) 16 r ) p_3(r)=\frac{4r}{\pi^2\sqrt{(1+r)^3(3-r)}}K\left(\sqrt{\frac{16r}{(1+r)^3(3-r)}}\right),\qquad p_3(r)=\frac{\sqrt{r}}{\pi^2}K\left(\sqrt{\frac{(1+r)^3(3-r)}{16r}}\right) p 3 ( r ) = π 2 ( 1 + r ) 3 ( 3 − r ) 4 r K ( ( 1 + r ) 3 ( 3 − r ) 16 r ) , p 3 ( r ) = π 2 r K ( 16 r ( 1 + r ) 3 ( 3 − r ) ) for 0 < r < 1 0<r<1 0 < r < 1 , and for 1 < r < 3 1<r<3 1 < r < 3 . Thus the density of μ H \mu_H μ H on ( 0 , 6 ) (0,6) ( 0 , 6 ) is continuous, except for logarithmic singularities at x = 2 x=2 x = 2 and x = 4 x=4 x = 4 , it vanishes linearly at x = 3 x=3 x = 3 , and it tends to 3 12 π \frac{\sqrt{3}}{12\pi} 12 π 3 at the endpoints 0 and 6.
Proof. By Theorem 5.8 we have K Q = T 2 K_Q=\mathbb{T}^2 K Q = T 2 , and μ H = 2 3 δ 0 + 1 3 law ( 3 + ε ∣ S ∣ ) \mu_H=\frac{2}{3}\delta_0+\frac{1}{3}\operatorname{law}(3+\varepsilon|S|) μ H = 3 2 δ 0 + 3 1 law ( 3 + ε ∣ S ∣ ) with S = 1 + U + V S=1+U+V S = 1 + U + V , where U , V U,V U , V are independent and uniform on T \mathbb{T} T . Thus the density of μ H \mu_H μ H on ( 0 , 6 ) (0,6) ( 0 , 6 ) is 1 6 p 3 ( ∣ x − 3 ∣ ) \frac{1}{6}p_3(|x-3|) 6 1 p 3 ( ∣ x − 3∣ ) , where p 3 p_3 p 3 is the density of ∣ S ∣ |S| ∣ S ∣ . The number ∣ S ∣ |S| ∣ S ∣ is the length of a 3-step planar random walk with unit steps, and also the absolute value of the energy in the nearest neighbor model on the honeycomb lattice, and its density is known. The above formulas are the classical ones for the density of states of the honeycomb lattice, due to Hobson and Nierenberg [25 ] , see also [14 ] , and an equivalent form, due to Borwein, Straub, Wan and Zudilin [12 ] , is
p 3 ( r ) = 2 3 r π ( 3 + r 2 ) 2 2 F 1 ( 1 3 , 2 3 ; 1 ; r 2 ( 9 − r 2 ) 2 ( 3 + r 2 ) 3 ) p_3(r)=\frac{2\sqrt{3r}}{\pi(3+r^2)^2}\,{}_2F_1\left(\frac{1}{3},\frac{2}{3};1;\frac{r^2(9-r^2)^2}{(3+r^2)^3}\right) p 3 ( r ) = π ( 3 + r 2 ) 2 2 3 r 2 F 1 ( 3 1 , 3 2 ; 1 ; ( 3 + r 2 ) 3 r 2 ( 9 − r 2 ) 2 )
The 2 moduli in the statement are inverse to each other, and equal 1 at r = 1 r=1 r = 1 , with
1 − 16 r ( 1 + r ) 3 ( 3 − r ) = ( 1 − r ) 3 ( 3 + r ) ( 1 + r ) 3 ( 3 − r ) 1-\frac{16r}{(1+r)^3(3-r)}=\frac{(1-r)^3(3+r)}{(1+r)^3(3-r)} 1 − ( 1 + r ) 3 ( 3 − r ) 16 r = ( 1 + r ) 3 ( 3 − r ) ( 1 − r ) 3 ( 3 + r )
so the logarithmic singularity of K K K at k = 1 k=1 k = 1 gives a logarithmic singularity of p 3 p_3 p 3 at r = 1 r=1 r = 1 . At r = 0 r=0 r = 0 and r = 3 r=3 r = 3 the moduli vanish, and K ( 0 ) = π 2 K(0)=\frac{\pi}{2} K ( 0 ) = 2 π gives p 3 ( r ) ∼ 2 r π 3 p_3(r)\sim\frac{2r}{\pi\sqrt{3}} p 3 ( r ) ∼ π 3 2 r and p 3 ( 3 ) = 3 2 π p_3(3)=\frac{\sqrt{3}}{2\pi} p 3 ( 3 ) = 2 π 3 . The program jalabert.py checks numerically that the 2 forms of p 3 p_3 p 3 agree, and that the moments of p 3 p_3 p 3 and of μ H \mu_H μ H are the numbers W 3 ( 2 j ) W_3(2j) W 3 ( 2 j ) and c n c_n c n of Proposition 5.4. □
In the language of the honeycomb lattice, the point x = 3 x=3 x = 3 corresponds to the Dirac points, the singularities at x = 2 , 4 x=2,4 x = 2 , 4 are the van Hove singularities, and the atom at 0 is the flat band of the kagome lattice. Observe that the singularities are located at x = 2 x=2 x = 2 and x = 4 x=4 x = 4 , which are values of the Jones index. The above density makes the link with the theory at indices ≤ 4 \leq4 ≤ 4 , where the circular measures are given by trigonometric densities: at index 6 the trigonometric functions are replaced by elliptic ones.
Growth exponents, indices 8 and 9
We first find the asymptotic behavior of the moments c n c_n c n , for any parameter matrix, and then we discuss the deformations at indices 8 and 9, where new phenomena appear.
The growth of the moments
Let Q ∈ T X × Y Q \in\mathbb{T}^{X\times Y} Q ∈ T X × Y be dephased, and consider the following objects:
The dimension d = dim K Q d=\dim K_Q d = dim K Q , which equals ( M − 1 ) ( N − 1 ) − rank ( N Q ) (M-1)(N-1)-\operatorname{rank}(N_Q) ( M − 1 ) ( N − 1 ) − rank ( N Q ) .
The number κ \kappa κ of connected components of K Q K_Q K Q , which is the order of the torsion subgroup of T Q T_Q T Q .
The lattice Λ Q ∗ \Lambda_Q^* Λ Q ∗ of the integer matrices m = ( m i j ) i , j ≠ 0 m=(m_{ij})_{i,j\ne0} m = ( m ij ) i , j = 0 which are orthogonal to N Q N_Q N Q , in the sense that ∑ i , j m i j r i j = 0 \sum_{i,j}m_{ij}r_{ij}=0 ∑ i , j m ij r ij = 0 whenever ∑ i , j r i j t i , − j ∈ N Q \sum_{i,j}r_{ij}t_{i,-j}\in N_Q ∑ i , j r ij t i , − j ∈ N Q . This lattice has rank d d d .
The quadratic form q ( θ ) = ∑ i ∈ X , j ∈ Y ( θ i j − θ i ⋅ − θ ⋅ j + θ ⋅ ⋅ ) 2 q(\theta)=\sum_{i\in X,j\in Y}(\theta_{ij}-\theta_{i\cdot}-\theta_{\cdot j}+\theta_{\cdot\cdot})^2 q ( θ ) = ∑ i ∈ X , j ∈ Y ( θ ij − θ i ⋅ − θ ⋅ j + θ ⋅⋅ ) 2 on the real matrices θ ∈ R X × Y \theta\in\mathbb{R}^{X\times Y} θ ∈ R X × Y whose first row and column vanish, where θ i ⋅ \theta_{i\cdot} θ i ⋅ , θ ⋅ j \theta_{\cdot j} θ ⋅ j , θ ⋅ ⋅ \theta_{\cdot\cdot} θ ⋅⋅ are the averages on the rows, on the columns, and the total average. In terms of the free entries, this is the quadratic form with matrix ( 1 − 1 M I M ) ⊗ ( 1 − 1 N I N − 1 ) (1-\frac{1}{M}I_M)\otimes(1-\frac{1}{N}I_{N-1}) ( 1 − M 1 I M ) ⊗ ( 1 − N 1 I N − 1 ) , with I I I being the all-one matrices.
The determinant Δ Q \Delta_Q Δ Q of the Gram matrix of q q q , with respect to a basis of Λ Q ∗ \Lambda_Q^* Λ Q ∗ .
Theorem 6.1. For any dephased Q ∈ T X × Y Q\in\mathbb{T}^{X\times Y} Q ∈ T X × Y we have
c n ∼ C ( M N ) n n − d / 2 , C = 1 M N κ Δ Q ( M N 4 π ) d / 2 . c_n\sim C(MN)^n n^{-d/2},\qquad C=\frac{1}{MN\kappa\sqrt{\Delta_Q}}\left(\frac{MN}{4\pi}\right)^{d/2}. c n ∼ C ( M N ) n n − d /2 , C = M N κ Δ Q 1 ( 4 π M N ) d /2 . In particular, for generic Q Q Q we have
c n g e n ∼ M ( N − 1 ) / 2 N ( M − 1 ) / 2 M N ( M N 4 π n ) d / 2 ( M N ) n c_n^{\mathrm{gen}}\sim\frac{M^{(N-1)/2}N^{(M-1)/2}}{MN}\left(\frac{MN}{4\pi n}\right)^{d/2}(MN)^n c n gen ∼ M N M ( N − 1 ) /2 N ( M − 1 ) /2 ( 4 π n M N ) d /2 ( M N ) n as n → ∞ n\to\infty n → ∞ , with d = ( M − 1 ) ( N − 1 ) d=(M-1)(N-1) d = ( M − 1 ) ( N − 1 ) .
Proof. We use Theorem 4.1 . Since Tr ( Z Z ∗ ) = M N \operatorname{Tr}(ZZ^*)=MN Tr ( Z Z ∗ ) = M N , the largest eigenvalue λ ( Z ) \lambda(Z) λ ( Z ) of Z Z ∗ ZZ^* Z Z ∗ satisfies λ ( Z ) ≤ M N \lambda(Z)\le MN λ ( Z ) ≤ M N , with equality precisely when Z Z Z has rank 1 1 1 , which for a matrix with first row and column equal to 1 1 1 means Z = 1 Z=\mathbf{1} Z = 1 . The other eigenvalues have sum M N − λ ( Z ) MN-\lambda(Z) M N − λ ( Z ) , so
λ ( Z ) n ≤ Tr ( ( Z Z ∗ ) n ) ≤ λ ( Z ) n + ( M − 1 ) ( M N − λ ( Z ) ) n (18) \lambda(Z)^n\le\operatorname{Tr}((ZZ^*)^n)\le\lambda(Z)^n+(M-1)(MN-\lambda(Z))^n \tag*{(18)} λ ( Z ) n ≤ Tr (( Z Z ∗ ) n ) ≤ λ ( Z ) n + ( M − 1 ) ( M N − λ ( Z ) ) n (18)
We first study λ \lambda λ near Z = 1 Z=\mathbf{1} Z = 1 . Write Z = e i θ Z=e^{i\theta} Z = e i θ , entrywise, with θ \theta θ small, having vanishing first row and column, and let u ∈ C X u\in\mathbb{C}^X u ∈ C X be the normalized all-one vector, which is the eigenvector of Z Z ∗ ZZ^* Z Z ∗ at θ = 0 \theta=0 θ = 0 , the other eigenvalues being then 0 0 0 . The second order perturbation formula gives
λ ( Z ) = ⟨ Z Z ∗ u , u ⟩ + ∥ ( 1 − P ) B 1 u ∥ 2 M N + O ( ∣ θ ∣ 3 ) \lambda(Z)=\langle ZZ^*u,u\rangle+\frac{\lVert(1-P)B_1u\rVert^2}{MN}+O(\lvert\theta\rvert^3) λ ( Z ) = ⟨ Z Z ∗ u , u ⟩ + M N ∥( 1 − P ) B 1 u ∥ 2 + O (∣ θ ∣ 3 )
where P P P is the projection on u u u , and B 1 = i ( θ I t − I θ t ) B_1=i(\theta\mathbb{I}^{t}-\mathbb{I}\theta^t) B 1 = i ( θ I t − I θ t ) is the first order term of Z Z ∗ ZZ^* Z Z ∗ , with I \mathbb{I} I being the all-one M × N M\times N M × N matrix. With θ i ⋅ , θ ⋅ j , θ ⋅ ⋅ \theta_{i\cdot},\theta_{\cdot j},\theta_{\cdot\cdot} θ i ⋅ , θ ⋅ j , θ ⋅⋅ as above, we have
⟨ Z Z ∗ u , u ⟩ = 1 M ∑ j ∣ ∑ i Z i j ∣ 2 = M N − ∑ i , j ( θ i j − θ ⋅ j ) 2 + O ( ∣ θ ∣ 4 ) \langle ZZ^*u,u\rangle=\frac{1}{M}\sum_j\left\lvert\sum_i Z_{ij}\right\rvert^2=MN-\sum_{i,j}(\theta_{ij}-\theta_{\cdot j})^2+O(\lvert\theta\rvert^4) ⟨ Z Z ∗ u , u ⟩ = M 1 j ∑ i ∑ Z ij 2 = M N − i , j ∑ ( θ ij − θ ⋅ j ) 2 + O (∣ θ ∣ 4 )
and ∥ ( 1 − P ) B 1 u ∥ 2 = M N 2 ∑ i ( θ i ⋅ − θ ⋅ ⋅ ) 2 \lVert(1-P)B_1u\rVert^2=MN^2\sum_i(\theta_{i\cdot}-\theta_{\cdot\cdot})^2 ∥( 1 − P ) B 1 u ∥ 2 = M N 2 ∑ i ( θ i ⋅ − θ ⋅⋅ ) 2 . Since ∑ i , j ( θ i j − θ ⋅ j ) 2 − N ∑ i ( θ i ⋅ − θ ⋅ ⋅ ) 2 = q ( θ ) \sum_{i,j}(\theta_{ij}-\theta_{\cdot j})^2-N\sum_i(\theta_{i\cdot}-\theta_{\cdot\cdot})^2=q(\theta) ∑ i , j ( θ ij − θ ⋅ j ) 2 − N ∑ i ( θ i ⋅ − θ ⋅⋅ ) 2 = q ( θ ) , we obtain
λ ( Z ) = M N − q ( θ ) + O ( ∣ θ ∣ 3 ) \lambda(Z)=MN-q(\theta)+O(\lvert\theta\rvert^3) λ ( Z ) = M N − q ( θ ) + O (∣ θ ∣ 3 )
The form q q q is positive definite, because a matrix killed by the double centering is the sum of a function of i i i and of a function of j j j , and so vanishes, its first row and column being zero.
Now let V = Λ Q ∗ ⊗ R V=\Lambda_Q^*\otimes\mathbb{R} V = Λ Q ∗ ⊗ R , which is the space of the real matrices which are orthogonal to N Q N_Q N Q . The map θ → e i θ \theta\to e^{i\theta} θ → e i θ is a surjective morphism from V V V onto the connected component K Q ∘ K_Q^\circ K Q ∘ of the identity, with kernel 2 π Λ Q ∗ 2\pi\Lambda_Q^* 2 π Λ Q ∗ , and the Haar measure of K Q K_Q K Q , restricted to K Q ∘ K_Q^\circ K Q ∘ , corresponds to the Lebesgue measure of V / 2 π Λ Q ∗ V/2\pi\Lambda_Q^* V /2 π Λ Q ∗ , normalized as to have mass 1 κ \frac{1}{\kappa} κ 1 .
Fix a small ball B ⊂ V B\subset V B ⊂ V around 0 0 0 . Outside the image of B B B we have λ ( Z ) ≤ M N − ε \lambda(Z)\le MN-\varepsilon λ ( Z ) ≤ M N − ε with ε > 0 \varepsilon>0 ε > 0 , by compactness, and on the image of B B B we have M N − λ ( Z ) ≤ M N 2 MN-\lambda(Z)\le\frac{MN}{2} M N − λ ( Z ) ≤ 2 M N . By (18) , the contributions to M N c n MNc_n M N c n of the complement of the image of B B B , and of the second term of (18) on the image of B B B , are O ( ( M N − ε ) n ) O((MN-\varepsilon)^n) O (( M N − ε ) n ) and O ( ( M N / 2 ) n ) O((MN/2)^n) O (( M N /2 ) n ) . Thus, up to exponentially small terms,
M N c n ≃ ( M N ) n κ ⋅ v o l ( V / 2 π Λ Q ∗ ) ∫ B exp ( n log ( 1 − q ( θ ) + O ( ∣ θ ∣ 3 ) M N ) ) d θ MNc_n \simeq\frac{(MN)^n}{\kappa\cdot vol(V/2\pi\Lambda_Q^*)}\int_B \exp\left(n\log\left(1-\frac{q(\theta)+O(|\theta|^3)}{MN}\right)\right)\,d\theta M N c n ≃ κ ⋅ v o l ( V /2 π Λ Q ∗ ) ( M N ) n ∫ B exp ( n log ( 1 − M N q ( θ ) + O ( ∣ θ ∣ 3 ) ) ) d θ
and the Laplace method gives the equivalent
( M N ) n κ ⋅ v o l ( V / 2 π Λ Q ∗ ) ( π M N n ) d / 2 ⋅ 1 det ( q ∣ V ) = ( M N ) n κ Δ Q ( M N 4 π n ) d / 2 \frac{(MN)^n}{\kappa\cdot vol(V/2\pi\Lambda_Q^*)}\left(\frac{\pi MN}{n}\right)^{d/2}\cdot\frac{1}{\sqrt{\det(q|_V)}}=\frac{(MN)^n}{\kappa\sqrt{\Delta_Q}}\left(\frac{MN}{4\pi n}\right)^{d/2} κ ⋅ v o l ( V /2 π Λ Q ∗ ) ( M N ) n ( n π M N ) d /2 ⋅ det ( q ∣ V ) 1 = κ Δ Q ( M N ) n ( 4 π n M N ) d /2
since v o l ( V / 2 π Λ Q ∗ ) 2 det ( q ∣ V ) = ( 2 π ) 2 d Δ Q vol(V/2\pi\Lambda_Q^*)^2\det(q|_V)=(2\pi)^{2d}\Delta_Q v o l ( V /2 π Λ Q ∗ ) 2 det ( q ∣ V ) = ( 2 π ) 2 d Δ Q , for any choice of the Lebesgue measure on V V V . For generic Q Q Q we have Λ Q ∗ = Z ( M − 1 ) ( N − 1 ) \Lambda_Q^*=\mathbb{Z}^{(M-1)(N-1)} Λ Q ∗ = Z ( M − 1 ) ( N − 1 ) and κ = 1 \kappa=1 κ = 1 , and Δ Q \Delta_Q Δ Q is the determinant of the matrix in (4) above, which is M − ( N − 1 ) N − ( M − 1 ) M^{-(N-1)}N^{-(M-1)} M − ( N − 1 ) N − ( M − 1 ) , since det ( 1 − 1 M I M − 1 ) = 1 M \det(1-\frac{1}{M}\mathbb{I}_{M-1})=\frac{1}{M} det ( 1 − M 1 I M − 1 ) = M 1 .
The above result is a local limit theorem for the random walk on the group Γ Q \Gamma_Q Γ Q , which contains Z d \mathbb{Z}^d Z d as a subgroup of finite index. When K Q K_Q K Q is finite we have d = 0 d=0 d = 0 and Δ Q = 1 \Delta_Q=1 Δ Q = 1 , and we obtain c n ∼ ( M N ) n / ∣ G H ∣ c_n\sim(MN)^n/|G_H| c n ∼ ( M N ) n /∣ G H ∣ , which corresponds to the fact that the atom of μ H \mu_H μ H at M N MN M N has mass 1 / ∣ G H ∣ 1/|G_H| 1/∣ G H ∣ . In general, the theorem shows that the rooted law determines the number d d d , which is the corank of the lattice of relations N Q N_Q N Q , and also the number κ Δ Q \kappa\sqrt{\Delta_Q} κ Δ Q , which is a kind of volume. This completes Theorem 4.3 , which shows that the rooted law determines the length of the shortest relation.
The program zulle.py computes d d d , κ \kappa κ , Δ Q \Delta_Q Δ Q and C C C from the exponents of the entries of Q Q Q , in exact arithmetic, and compares the result with the moments, computed exactly for n n n up to 1600 when a closed formula is available, and by integration on a grid otherwise, as follows:
Table 6.
Here the parameters a , p , q a,p,q a , p , q have infinite order, and p , q p,q p , q are independent in the Klein case. At index 6 we obtain c 6 g e n ∼ 3 2 π 6 n c_6^{gen}\sim\frac{\sqrt{3}}{2\pi}6^n c 6 g e n ∼ 2 π 3 6 n , in agreement with Theorem 5.15 , the density of μ H \mu_H μ H at x = 6 x=6 x = 6 being 3 12 π \frac{\sqrt{3}}{12\pi} 12 π 3 . The non-generic matrices in the above table are those studied below.
The index 8
For Y = Z 4 Y=\mathbb{Z}_4 Y = Z 4 we write the dephased second row as ( 1 , a , b , c ) (1,a,b,c) ( 1 , a , b , c ) and we put
r = a c b , α = ( c a ) 2 , β = b 2 r=\frac{ac}{b},\qquad\alpha=\left(\frac{c}{a}\right)^2,\qquad\beta=b^2 r = b a c , α = ( a c ) 2 , β = b 2
In all cases Corollary 5.3 gives μ H = 3 4 δ 0 + 1 4 l a w ( 4 + ε ∣ S ∣ ) \mu_H=\frac{3}{4}\delta_0+\frac{1}{4}law(4+\varepsilon|S|) μ H = 4 3 δ 0 + 4 1 l a w ( 4 + ε ∣ S ∣ ) with S = 1 + Z 1 + Z 2 + Z 3 S=1+Z_1+Z_2+Z_3 S = 1 + Z 1 + Z 2 + Z 3 . If r r r , α \alpha α and β \beta β are roots of unity, then so are b b b , c a \frac{c}{a} a c and a c ac a c , hence c 2 = a c ⋅ c a c^2=ac\cdot\frac{c}{a} c 2 = a c ⋅ a c , and finally a a a , b b b and c c c . In that case K Q K_Q K Q is finite and given by Corollary 5.3 . Thus, when looking for the infinite phase groups, we can assume that one of the numbers r , α , β r,\alpha,\beta r , α , β has infinite order, or equivalently, that one of the numbers a , b , c a,b,c a , b , c has infinite order.
In the generic case the coset graph is the diamond lattice, by Proposition 5.5 . In general, the situation is more complicated than at index 6, because the group Y = Z 4 Y=\mathbb{Z}_4 Y = Z 4 is not of prime order, and the phase group can be infinite without being the whole torus T 3 \mathbb{T}^3 T 3 . In order to discuss this, let U , V , W U,V,W U , V , W be independent random variables with Haar distribution on T \mathbb{T} T . We have the following result, which is the dual form of the trichotomy in [8 Theorem 4.7] , where the groups N Q N_Q N Q are computed:
Proposition 6.2 (Cyclic phase groups). Assume that a a a , b b b or c c c has infinite order. Then exactly one of the following cases occurs, and the random row ( 1 , Z 1 , Z 2 , Z 3 ) (1,Z_1,Z_2,Z_3) ( 1 , Z 1 , Z 2 , Z 3 ) is given as follows.
If r r r has infinite order and α \alpha α or β \beta β has infinite order, the row is ( 1 , U , V , W ) (1,U,V,W) ( 1 , U , V , W ) .
If r r r is a root of unity, put m = ord ( r 4 ) m=\operatorname{ord}(r^4) m = ord ( r 4 ) . The row is ( 1 , U , E U , V ) (1,U,EU,V) ( 1 , U , E U , V ) , where E E E is uniform on the m m m -th roots of unity and independent of U U U , V V V .
If α \alpha α and β \beta β are roots of unity, the row is ( 1 , U A , B , U ) (1,UA,B,U) ( 1 , U A , B , U ) , where ( A , B ) (A,B) ( A , B ) is uniformly distributed on the finite group generated by ( α β , α β − 1 ) (\alpha\beta,\alpha\beta^{-1}) ( α β , α β − 1 ) and ( α β − 1 , α − 1 β − 1 ) (\alpha\beta^{-1},\alpha^{-1}\beta^{-1}) ( α β − 1 , α − 1 β − 1 ) and independent of U U U .
Proof. By the discussion before the proposition, r r r , α \alpha α and β \beta β are not all roots of unity. Thus the 3 cases are exhaustive, and they are mutually exclusive. The generators of Corollary 5.3 are g 0 = 1 g_0=1 g 0 = 1 and
g 1 = ( α r 2 , α β , 1 r 2 β ) , g 2 = ( α β , 1 β 2 , 1 α β ) , g 3 = ( 1 r 2 β , 1 α β , 1 r 2 α ) . g_1=\left(\frac{\alpha}{r^2},\frac{\alpha}{\beta},\frac{1}{r^2\beta}\right),\qquad
g_2=\left(\frac{\alpha}{\beta},\frac{1}{\beta^2},\frac{1}{\alpha\beta}\right),\qquad
g_3=\left(\frac{1}{r^2\beta},\frac{1}{\alpha\beta},\frac{1}{r^2\alpha}\right). g 1 = ( r 2 α , β α , r 2 β 1 ) , g 2 = ( β α , β 2 1 , α β 1 ) , g 3 = ( r 2 β 1 , α β 1 , r 2 α 1 ) .
where we used a 2 c 2 = r 2 β a^2c^2=r^2\beta a 2 c 2 = r 2 β and c 2 a − 2 = α c^2a^{-2}=\alpha c 2 a − 2 = α , so that b 2 a − 4 = α r − 2 b^2a^{-4}=\alpha r^{-2} b 2 a − 4 = α r − 2 , c 2 a − 2 b − 2 = α β − 1 c^2a^{-2}b^{-2}=\alpha\beta^{-1} c 2 a − 2 b − 2 = α β − 1 and a − 2 c − 2 = r − 2 β − 1 a^{-2}c^{-2}=r^{-2}\beta^{-1} a − 2 c − 2 = r − 2 β − 1 . For l = ( l 1 , l 2 , l 3 ) ∈ Z 3 l=(l_1,l_2,l_3)\in\mathbb{Z}^3 l = ( l 1 , l 2 , l 3 ) ∈ Z 3 , put P = l 1 − l 3 P=l_1-l_3 P = l 1 − l 3 and P ′ = l 1 + 2 l 2 + l 3 P'=l_1+2l_2+l_3 P ′ = l 1 + 2 l 2 + l 3 . A computation gives
g 2 l = α P β − P ′ , ( g 1 g 3 − 1 ) l = α P ′ β P , g 1 l = r − 2 ( l 1 + l 3 ) α l 1 + l 2 β − l 2 − l 3 (19) g_2^l=\alpha^P\beta^{-P'},\qquad(g_1g_3^{-1})^l=\alpha^{P'}\beta^P,\qquad g_1^l=r^{-2(l_1+l_3)}\alpha^{l_1+l_2}\beta^{-l_2-l_3} \tag*{(19)} g 2 l = α P β − P ′ , ( g 1 g 3 − 1 ) l = α P ′ β P , g 1 l = r − 2 ( l 1 + l 3 ) α l 1 + l 2 β − l 2 − l 3 (19)
where g l g^l g l denotes ∏ j g ( j ) l j \prod_jg(j)^{l_j} ∏ j g ( j ) l j . The character z → z l z\to z^l z → z l is trivial on K Q K_Q K Q if and only if these 3 numbers are equal to 1.
Assume that α \alpha α or β \beta β has infinite order. If ( P , P ′ ) ≠ ( 0 , 0 ) (P,P')\ne(0,0) ( P , P ′ ) = ( 0 , 0 ) , the first 2 relations give α P 2 + P ′ 2 = ( α P β − P ′ ) P ( α P ′ β P ) P ′ = 1 \alpha^{P^2+P'^2}=(\alpha^P\beta^{-P'})^P(\alpha^{P'}\beta^P)^{P'}=1 α P 2 + P ′2 = ( α P β − P ′ ) P ( α P ′ β P ) P ′ = 1 and β P 2 + P ′ 2 = ( α P β − P ′ ) − P ′ ( α P ′ β P ) P = 1 \beta^{P^2+P'^2}=(\alpha^P\beta^{-P'})^{-P'}(\alpha^{P'}\beta^P)^P=1 β P 2 + P ′2 = ( α P β − P ′ ) − P ′ ( α P ′ β P ) P = 1 , which is impossible. Thus P = P ′ = 0 P=P'=0 P = P ′ = 0 , that is l = l 1 ( 1 , − 1 , 1 ) l=l_1(1,-1,1) l = l 1 ( 1 , − 1 , 1 ) , and the third relation becomes r − 4 l 1 = 1 r^{-4l_1}=1 r − 4 l 1 = 1 . If r r r has infinite order, no nontrivial character is trivial on K Q K_Q K Q , hence K Q = T 3 K_Q=\mathbb{T}^3 K Q = T 3 , which is case 1. If r r r is a root of unity, the annihilator of K Q K_Q K Q is generated by m ( 1 , − 1 , 1 ) m(1,-1,1) m ( 1 , − 1 , 1 ) , so that K Q = { z : ( z 1 z 3 z 2 − 1 ) m = 1 } K_Q=\{z:(z_1z_3z_2^{-1})^m=1\} K Q = { z : ( z 1 z 3 z 2 − 1 ) m = 1 } . The map ( u , v , λ ) → ( u , λ u v , v ) (u,v,\lambda)\to(u,\lambda uv,v) ( u , v , λ ) → ( u , λ uv , v ) is an isomorphism from T 2 × μ m \mathbb{T}^2\times\mu_m T 2 × μ m onto this group, where μ m \mu_m μ m is the group of m m m -th roots of unity. This gives case 2.
Assume now that α \alpha α and β \beta β are roots of unity. Then r r r has infinite order. Since α l 1 + l 2 β − l 2 − l 3 \alpha^{l_1+l_2}\beta^{-l_2-l_3} α l 1 + l 2 β − l 2 − l 3 is a root of unity, the third relation forces l 1 + l 3 = 0 l_1+l_3=0 l 1 + l 3 = 0 . Write l = ( h , k , − h ) l=(h,k,-h) l = ( h , k , − h ) . The character z → z l z\to z^l z → z l is then z → ( z 1 z 3 − 1 ) h z 2 k z\to(z_1z_3^{-1})^hz_2^k z → ( z 1 z 3 − 1 ) h z 2 k , and by (19) it is trivial on K Q K_Q K Q if and only if
α 2 h β − 2 k = 1 , α 2 k β 2 h = 1 , α h + k β h − k = 1 \alpha^{2h}\beta^{-2k}=1,\qquad\alpha^{2k}\beta^{2h}=1,\qquad\alpha^{h+k}\beta^{h-k}=1 α 2 h β − 2 k = 1 , α 2 k β 2 h = 1 , α h + k β h − k = 1
The images of g 1 g_1 g 1 , g 2 g_2 g 2 and g 3 g_3 g 3 under the homomorphism z → ( z 1 z 3 − 1 , z 2 ) z\to(z_1z_3^{-1},z_2) z → ( z 1 z 3 − 1 , z 2 ) are
( α β , α β − 1 ) , ( α 2 , β − 2 ) , ( α β − 1 , α − 1 β − 1 ) (\alpha\beta,\alpha\beta^{-1}),\qquad(\alpha^2,\beta^{-2}),\qquad(\alpha\beta^{-1},\alpha^{-1}\beta^{-1}) ( α β , α β − 1 ) , ( α 2 , β − 2 ) , ( α β − 1 , α − 1 β − 1 )
and the second one is the product of the other 2. Since g 1 g 3 − 1 g_1g_3^{-1} g 1 g 3 − 1 , g 2 g_2 g 2 and g 1 g_1 g 1 generate the same group as g 1 g_1 g 1 , g 2 g_2 g 2 and g 3 g_3 g 3 , the 3 displayed conditions mean that the character ( A , B ) → A h B k (A,B)\to A^hB^k ( A , B ) → A h B k of T 2 \mathbb{T}^2 T 2 is trivial on the finite group K ′ K' K ′ generated by these images. Hence the annihilator of K Q K_Q K Q is the set of the vectors ( h , k , − h ) (h,k,-h) ( h , k , − h ) such that ( h , k ) (h,k) ( h , k ) annihilates K ′ K' K ′ . Taking annihilators again, we obtain K Q = { z ∈ T 3 : ( z 1 z 3 − 1 , z 2 ) ∈ K ′ } K_Q=\{z\in\mathbb{T}^3:(z_1z_3^{-1},z_2)\in K'\} K Q = { z ∈ T 3 : ( z 1 z 3 − 1 , z 2 ) ∈ K ′ } . The map ( u , A , B ) → ( u A , B , u ) (u,A,B)\to(uA,B,u) ( u , A , B ) → ( u A , B , u ) is an isomorphism from T × K ′ \mathbb{T}\times K' T × K ′ onto K Q K_Q K Q , which gives case 3. □
In (19) , the exponent vectors ( P , − P ′ ) (P,-P') ( P , − P ′ ) and ( P ′ , P ) (P',P) ( P ′ , P ) of ( α , β ) (\alpha,\beta) ( α , β ) are the rows of the matrix of the multiplication by the Gaussian integer P + i P ′ P+iP' P + i P ′ on Z [ i ] ≃ Z 2 \mathbb{Z}[i]\simeq\mathbb{Z}^2 Z [ i ] ≃ Z 2 . This reflects the decomposition of I Y ⊗ Q I_Y\otimes\mathbb{Q} I Y ⊗ Q according to the characters y → ± i y\to\pm i y → ± i and y → − 1 y\to-1 y → − 1 of Y Y Y , used in the proof of [8 Theorem 4.7] .
By Theorem 6.1 , in the 3 cases of Proposition 6.2 the moments c n c_n c n grow as 8 n n − 3 / 2 8^nn^{-3/2} 8 n n − 3/2 , as 8 n n − 1 8^nn^{-1} 8 n n − 1 , and as 8 n n − 1 / 2 8^nn^{-1/2} 8 n n − 1/2 , the number of connected components of the phase group being 1 1 1 , m m m , and the order of the finite group in case 3. In case 2 the law differs from the generic one, but the difference is seen quite late:
Proposition 6.3 (The first exceptional moment). We have
c n = c n g e n for 1 ≤ n < 4 m , c 4 m − c 4 m g e n = 1 2 ( 2 m m ) 2 c_n=c_n^{\mathrm{gen}}\quad\text{for }1\le n<4m,\qquad c_{4m}-c_{4m}^{\mathrm{gen}}=\frac{1}{2}\binom{2m}{m}^{2} c n = c n gen for 1 ≤ n < 4 m , c 4 m − c 4 m gen = 2 1 ( m 2 m ) 2 in case 2 of Proposition 6.2 .
Proof. In ∣ S ∣ 2 j |S|^{2j} ∣ S ∣ 2 j , each monomial comes from 2 words of length j j j in 1 , U , E U V , V 1,U,EUV,V 1 , U , E U V , V . Write κ , κ ′ \kappa,\kappa' κ , κ ′ for their contents and δ = κ − κ ′ \delta=\kappa-\kappa' δ = κ − κ ′ , so that ∑ i δ i = 0 \sum_i\delta_i=0 ∑ i δ i = 0 . Haar integration keeps the monomial exactly when δ 1 + δ 2 = δ 2 + δ 3 = 0 \delta_1+\delta_2=\delta_2+\delta_3=0 δ 1 + δ 2 = δ 2 + δ 3 = 0 and m m m divides δ 2 \delta_2 δ 2 . Together these conditions mean
δ ∈ m Z ( 1 , − 1 , 1 , − 1 ) \delta\in m\mathbb{Z}(1,-1,1,-1) δ ∈ m Z ( 1 , − 1 , 1 , − 1 )
whereas for generic parameters the expectation keeps exactly the pairs with δ = 0 \delta=0 δ = 0 .
The positive part and the negative part of δ = ± m ( 1 , − 1 , 1 , − 1 ) \delta=\pm m(1,-1,1,-1) δ = ± m ( 1 , − 1 , 1 , − 1 ) have total size 2 m 2m 2 m , so the first additional pairs occur for j = 2 m j=2m j = 2 m . In one orientation, the first word contains m m m copies of 1 1 1 and m m m copies of E U V EUV E U V , and the second word contains m m m copies of U U U and m m m copies of V V V . There are ( 2 m m ) 2 \binom{2m}{m}^{2} ( m 2 m ) 2 such pairs, and the same number in the other orientation.
Finally, in E ( 4 + ε ∣ S ∣ ) n \mathbb{E}(4+\varepsilon|S|)^n E ( 4 + ε ∣ S ∣ ) n only the even powers of ∣ S ∣ |S| ∣ S ∣ survive, and ∣ S ∣ 4 m |S|^{4m} ∣ S ∣ 4 m first occurs for n = 4 m n=4m n = 4 m , with coefficient one. The weight 1 4 \frac{1}{4} 4 1 of the second term of μ H \mu_H μ H gives the result. □
Every m ≥ 1 m\ge1 m ≥ 1 occurs, for instance with a = b a=b a = b of infinite order and c c c a primitive 4 m 4m 4 m -th root of unity. For m = 1 m=1 m = 1 we have S = ( 1 + U ) ( 1 + V ) S=(1+U)(1+V) S = ( 1 + U ) ( 1 + V ) , so that E ∣ S ∣ 2 j = ( 2 j j ) 2 \mathbb{E}|S|^{2j}=\binom{2j}{j}^{2} E ∣ S ∣ 2 j = ( j 2 j ) 2 by taking the constant terms in U U U and in V V V . This gives c 4 = 169 c_4=169 c 4 = 169 instead of the generic value 167, in agreement with [8 Section 4.3] . The program wordgram.py checks the formula of Proposition 6.3 for m = 1 , 2 , 3 , 4 m=1,2,3,4 m = 1 , 2 , 3 , 4 .
Example 6.4 (An atom at the middle of the spectrum). Let q q q have infinite order. For the row ( 1 , q , 1 , q ) (1,q,1,q) ( 1 , q , 1 , q ) we have α = β = 1 \alpha=\beta=1 α = β = 1 , so that K ′ K' K ′ is trivial in case 3 of Proposition 6.2 . The random row is ( 1 , U , 1 , U ) (1,U,1,U) ( 1 , U , 1 , U ) and S = 2 + 2 U S=2+2U S = 2 + 2 U . With t t t uniform on [ 0 , 2 π ] [0,2\pi] [ 0 , 2 π ] , the rooted law is
3 4 δ 0 + 1 4 law ( 4 + 4 cos t ) \frac{3}{4}\delta_0+\frac{1}{4}\operatorname{law}(4+4\cos t) 4 3 δ 0 + 4 1 law ( 4 + 4 cos t ) whose second moment is 6, whereas the generic second moment is 5. For the row ( 1 , q , i , q ) (1,q,i,q) ( 1 , q , i , q ) we have α = 1 \alpha=1 α = 1 and β = − 1 \beta=-1 β = − 1 , so that ( A , B ) (A,B) ( A , B ) is equally likely to be ( 1 , 1 ) (1,1) ( 1 , 1 ) or ( − 1 , − 1 ) (-1,-1) ( − 1 , − 1 ) . The corresponding sums are 2 + 2 U 2+2U 2 + 2 U and 0, and the rooted law is
3 4 δ 0 + 1 8 δ 4 + 1 8 law ( 4 + 4 cos t ) \frac{3}{4}\delta_0+\frac{1}{8}\delta_4+\frac{1}{8}\operatorname{law}(4+4\cos t) 4 3 δ 0 + 8 1 δ 4 + 8 1 law ( 4 + 4 cos t )
Here is now an example with Y = Z 2 2 Y=\mathbb{Z}_2^2 Y = Z 2 2 instead of Z 4 \mathbb{Z}_4 Z 4 , which is never generic:
Example 6.5 (A Klein four deformation). Take Y = Z 2 2 Y=\mathbb{Z}_2^2 Y = Z 2 2 and the dephased row ( 1 , p , q , p q ) (1,p,q,pq) ( 1 , p , q , pq ) in the order 00 , 10 , 01 , 11 00,10,01,11 00 , 10 , 01 , 11 . Corollary 5.3 gives
g 10 = ( 1 , p − 4 , 1 , p − 4 ) , g 01 = ( 1 , 1 , q − 4 , q − 4 ) , g 11 = g 10 g 01 g_{10}=(1,p^{-4},1,p^{-4}),\qquad g_{01}=(1,1,q^{-4},q^{-4}),\qquad g_{11}=g_{10}g_{01} g 10 = ( 1 , p − 4 , 1 , p − 4 ) , g 01 = ( 1 , 1 , q − 4 , q − 4 ) , g 11 = g 10 g 01 Hence the random row is ( 1 , U , V , U V ) (1,U,V,UV) ( 1 , U , V , U V ) , where U U U and V V V are independent and Haar distributed on ⟨ p 4 ⟩ \langle p^4\rangle ⟨ p 4 ⟩ and on ⟨ q 4 ⟩ \langle q^4\rangle ⟨ q 4 ⟩ . Its sum is ( 1 + U ) ( 1 + V ) (1+U)(1+V) ( 1 + U ) ( 1 + V ) . Even when p = q p=q p = q has infinite order, U U U and V V V are independent uniform circle variables, and the fourth moment is again 169. In particular this family is never generic, since Z 11 = Z 10 Z 01 Z_{11}=Z_{10}Z_{01} Z 11 = Z 10 Z 01 on K Q K_Q K Q .
More precisely, with u j = E ∣ 1 + U ∣ 2 j u_j=\mathbb{E}|1+U|^{2j} u j = E ∣1 + U ∣ 2 j and v j = E ∣ 1 + V ∣ 2 j v_j=\mathbb{E}|1+V|^{2j} v j = E ∣1 + V ∣ 2 j , Corollary 5.3 gives
c 2 = 16 + u 1 v 1 4 , c 3 = 64 + 12 u 1 v 1 4 , c 4 = 256 + 96 u 1 v 1 + u 2 v 2 4 c_2=\frac{16+u_1v_1}{4},\qquad c_3=\frac{64+12u_1v_1}{4},\qquad c_4=\frac{256+96u_1v_1+u_2v_2}{4} c 2 = 4 16 + u 1 v 1 , c 3 = 4 64 + 12 u 1 v 1 , c 4 = 4 256 + 96 u 1 v 1 + u 2 v 2 Here u 1 = 2 u_1=2 u 1 = 2 if p 4 ≠ 1 p^4\ne1 p 4 = 1 , and u 1 = 4 u_1=4 u 1 = 4 otherwise. In the first case E ( U ) = 0 \mathbb{E}(U)=0 E ( U ) = 0 and u 2 = 6 + 2 Re ( E ( U 2 ) ) ≥ 6 u_2=6+2\operatorname{Re}(\mathbb{E}(U^2))\ge6 u 2 = 6 + 2 Re ( E ( U 2 )) ≥ 6 , since E ( U 2 ) ∈ { 0 , 1 } \mathbb{E}(U^2)\in\{0,1\} E ( U 2 ) ∈ { 0 , 1 } ; similarly for V V V . Thus p 4 , q 4 ≠ 1 p^4,q^4\ne1 p 4 , q 4 = 1 give c 2 = 5 c_2=5 c 2 = 5 , c 3 = 28 c_3=28 c 3 = 28 , c 4 ≥ 169 c_4\ge169 c 4 ≥ 169 , with the first nongeneric moment at n = 4 n=4 n = 4 . Exactly one of p 4 , q 4 p^4,q^4 p 4 , q 4 equal to 1 gives c 2 = 6 c_2=6 c 2 = 6 , and both give c 2 = 8 c_2=8 c 2 = 8 . The script klein_moments.py checks the first 4 moments for finite cyclic and circle choices.
The index 9
We now take X = Y = Z 3 X=Y=\mathbb{Z}_3 X = Y = Z 3 . On one exceptional family the moments 1 , 5 , 31 , 213 1,5,31,213 1 , 5 , 31 , 213 were computed in [8 Section 4.3] , compared with 1 , 5 , 29 , 181 1,5,29,181 1 , 5 , 29 , 181 at a generic parameter. We compute here the whole measure, on the slice
Q = ( 1 1 1 1 q 1 1 1 q − 1 ) , q ∈ T Q=\begin{pmatrix}1&1&1\\1&q&1\\1&1&q^{-1}\end{pmatrix},\qquad q\in\mathbb{T} Q = 1 1 1 1 q 1 1 1 q − 1 , q ∈ T
The squared length of the 3-step walk of index 6 appears again.
Theorem 6.6 (The squared 3-step walk). For Q Q Q as above, put
P q = { ( u , v ) ∈ T 2 : v u − 2 ∈ ⟨ q 3 ⟩ , u v − 2 ∈ ⟨ q 3 ⟩ } P_q=\{(u,v)\in\mathbb{T}^2:vu^{-2}\in\langle q^3\rangle,\ uv^{-2}\in\langle q^3\rangle\} P q = {( u , v ) ∈ T 2 : v u − 2 ∈ ⟨ q 3 ⟩ , u v − 2 ∈ ⟨ q 3 ⟩} and let ( U , V ) (U,V) ( U , V ) be Haar distributed on P q P_q P q . Then
μ H = 2 3 δ 0 + 1 3 law ( ∣ 1 + U + V ∣ 2 ) \mu_H=\frac{2}{3}\delta_0+\frac{1}{3}\operatorname{law}(|1+U+V|^2) μ H = 3 2 δ 0 + 3 1 law ( ∣1 + U + V ∣ 2 ) If q 3 q^3 q 3 has finite order l l l , then P q P_q P q has 3 l 2 3l^2 3 l 2 elements. If q q q has infinite order, then P q = T 2 P_q=\mathbb{T}^2 P q = T 2 , we have
μ H = 2 3 δ 0 + 1 3 law ( 3 + A ) , \mu_H=\frac{2}{3}\delta_0+\frac{1}{3}\operatorname{law}(3+A), μ H = 3 2 δ 0 + 3 1 law ( 3 + A ) , where A A A is the adjacency operator of the triangular lattice, and for any integer n ≥ 1 n\geq1 n ≥ 1 ,
c n = 1 3 W 3 ( 2 n ) = 1 3 ∑ a + b + c = n a , b , c ≥ 0 ( n a , b , c ) 2 c_n=\frac{1}{3}W_3(2n)=\frac{1}{3}\sum_{\substack{a+b+c=n\\a,b,c\geq0}}\binom{n}{a,b,c}^{2} c n = 3 1 W 3 ( 2 n ) = 3 1 a + b + c = n a , b , c ≥ 0 ∑ ( a , b , c n ) 2 where a , b , c ≥ 0 a,b,c\geq0 a , b , c ≥ 0 .
Proof. We first compute K Q K_Q K Q . Write Q i j = q ν i j Q_{ij}=q^{\nu_{ij}} Q ij = q ν ij with ν 11 = 1 \nu_{11}=1 ν 11 = 1 , ν 22 = − 1 \nu_{22}=-1 ν 22 = − 1 and ν i j = 0 \nu_{ij}=0 ν ij = 0 otherwise. A direct computation from (14) shows that g k , e = 1 g_{k,e}=1 g k , e = 1 if k = 0 k=0 k = 0 or e = 0 e=0 e = 0 , and that, in the coordinates ( Z 11 , Z 12 , Z 21 , Z 22 ) (Z_{11},Z_{12},Z_{21},Z_{22}) ( Z 11 , Z 12 , Z 21 , Z 22 ) , the exponents of q q q in the remaining generators are
g 1 , 1 , g 2 , 2 : 3 ( − 1 , 0 , 0 , 1 ) , g 1 , 2 : 3 ( 0 , 1 , 1 , 1 ) , g 2 , 1 : − 3 ( 1 , 1 , 1 , 0 ) g_{1,1},g_{2,2}:3(-1,0,0,1),\qquad g_{1,2}:3(0,1,1,1),\qquad g_{2,1}:-3(1,1,1,0) g 1 , 1 , g 2 , 2 : 3 ( − 1 , 0 , 0 , 1 ) , g 1 , 2 : 3 ( 0 , 1 , 1 , 1 ) , g 2 , 1 : − 3 ( 1 , 1 , 1 , 0 )
The first vector is the sum of the other 2. Hence K Q K_Q K Q is the closed subgroup of the matrices
Z = ( 1 1 1 1 A A B 1 A B B ) , A , B ∈ ⟨ q 3 ⟩ Z=\begin{pmatrix}1&1&1\\1&A&AB\\1&AB&B\end{pmatrix},\qquad A,B\in\langle q^3\rangle Z = 1 1 1 1 A A B 1 A B B , A , B ∈ ⟨ q 3 ⟩
with ( A , B ) (A,B) ( A , B ) Haar distributed on ⟨ q 3 ⟩ 2 \langle q^3\rangle^2 ⟨ q 3 ⟩ 2 .
Consider the phase matrix
R = ( 1 U V U V 1 V 1 U ) R=\begin{pmatrix}1&U&V\\U&V&1\\V&1&U\end{pmatrix} R = 1 U V U V 1 V 1 U
Dividing its second and third columns by U U U and V V V , and then its second and third rows by U U U and V V V , gives the matrix Z Z Z above with A = V U − 2 A=VU^{-2} A = V U − 2 and B = U V − 2 B=UV^{-2} B = U V − 2 , since A B = ( U V ) − 1 AB=(UV)^{-1} A B = ( U V ) − 1 . The homomorphism ψ ( u , v ) = ( v u − 2 , u v − 2 ) \psi(u,v)=(vu^{-2},uv^{-2}) ψ ( u , v ) = ( v u − 2 , u v − 2 ) of T 2 \mathbb{T}^2 T 2 has exponent matrix of determinant 3. Hence it is surjective, with kernel { ( ω j , ω 2 j ) : j = 0 , 1 , 2 } \{(\omega^j,\omega^{2j}):j=0,1,2\} {( ω j , ω 2 j ) : j = 0 , 1 , 2 } , where ω = e 2 π i / 3 \omega=e^{2\pi i/3} ω = e 2 π i /3 . By definition P q = ψ − 1 ( ⟨ q 3 ⟩ 2 ) P_q=\psi^{-1}(\langle q^3\rangle^2) P q = ψ − 1 (⟨ q 3 ⟩ 2 ) , so that ψ \psi ψ restricts to a surjective homomorphism P q → ⟨ q 3 ⟩ 2 P_q\to\langle q^3\rangle^2 P q → ⟨ q 3 ⟩ 2 , which carries the Haar measure of P q P_q P q to the Haar measure of ⟨ q 3 ⟩ 2 \langle q^3\rangle^2 ⟨ q 3 ⟩ 2 .
Multiplying rows and columns by phases does not change the eigenvalues of R R ∗ RR^* R R ∗ . Exchanging the last 2 rows of R R R gives the circulant matrix with first row ( 1 , U , V ) (1,U,V) ( 1 , U , V ) , which is normal with eigenvalues 1 + ω j U + ω 2 j V 1+\omega^jU+\omega^{2j}V 1 + ω j U + ω 2 j V , j = 0 , 1 , 2 j=0,1,2 j = 0 , 1 , 2 . Thus the eigenvalues of Z Z ∗ ZZ^* Z Z ∗ are
∣ 1 + ω j U + ω 2 j V ∣ 2 , j = 0 , 1 , 2 |1+\omega^jU+\omega^{2j}V|^2,\qquad j=0,1,2 ∣1 + ω j U + ω 2 j V ∣ 2 , j = 0 , 1 , 2
The translation by ( ω , ω 2 ) (\omega,\omega^2) ( ω , ω 2 ) preserves the Haar measure of P q P_q P q , so the 3 eigenvalues have the same law. Theorem 4.1 gives the formula for μ H \mu_H μ H . If q 3 q^3 q 3 has order l l l , then ⟨ q 3 ⟩ 2 \langle q^3\rangle^2 ⟨ q 3 ⟩ 2 has l 2 l^2 l 2 elements and each fiber of ψ \psi ψ has 3 elements. If q q q has infinite order, then ⟨ q 3 ⟩ = T \langle q^3\rangle=\mathbb{T} ⟨ q 3 ⟩ = T and P q = T 2 P_q=\mathbb{T}^2 P q = T 2 , so that U U U and V V V are independent and uniform on T \mathbb{T} T . We have
∣ 1 + U + V ∣ 2 = 3 + U + U ‾ + V + V ‾ + U V ‾ + U ‾ V \lvert1+U+V\rvert^2=3+U+\overline{U}+V+\overline{V}+U\overline{V}+\overline{U}V ∣ 1 + U + V ∣ 2 = 3 + U + U + V + V + U V + U V
and the last 6 terms are the Fourier transform of the adjacency operator of the triangular lattice, which gives the formula with A A A . Finally, expand ( 1 + U + V ) n (1+U+V)^n ( 1 + U + V ) n and its conjugate. The expectation keeps the pairs of words with the same numbers of letters U U U and V V V , hence with the same content ( a , b , c ) (a,b,c) ( a , b , c ) , and each content contributes the square of its multinomial coefficient.
The first 7 values are c n = 1 , 5 , 31 , 213 , 1551 , 11723 , 90945 c_n=1,5,31,213,1551,11723,90945 c n = 1 , 5 , 31 , 213 , 1551 , 11723 , 90945 , and on this family the moments 1 , 5 , 31 , 213 1,5,31,213 1 , 5 , 31 , 213 were found in [8 ] . These 7 values are confirmed by the program wordgram.py. If q q q has infinite order, the shortest nontrivial element of N Q N_Q N Q has length 3 by Theorem 4.3 , since c 2 = 5 c_2=5 c 2 = 5 is the generic value and c 3 = 31 c_3=31 c 3 = 31 exceeds the generic value 29.
Also, Theorem 6.1 gives c n ∼ 3 4 π n 9 n c_n\sim\frac{\sqrt{3}}{4\pi n}9^n c n ∼ 4 π n 3 9 n , to be compared with the generic growth, which is in 9 n n − 2 9^n n^{-2} 9 n n − 2 . Observe that the triangular lattice is the lattice of the second neighbors on the honeycomb lattice, in agreement with the fact that the 3-step walk of the index 6 appears here through its squared length. The 3 lattices which appear at indices 6 and 9, namely the honeycomb, kagome and triangular lattices, are thus closely related.
Circulant families and Jacobi parameters
The circulant matrix used at index 9 extends to every square index. We construct a family with one parameter whose phase group has dimension N − 1 N-1 N − 1 , and whose law is the squared length of an N N N -step planar walk. We then express the first-relation theorem in the Hankel and Jacobi language of [9 ] , applying it both to this family and to the delayed exceptional moments at index 8.
A circulant family at square index
Let G G G be a finite abelian group of order N ≥ 2 N\ge2 N ≥ 2 , written additively, and let q ∈ T q\in\mathbb{T} q ∈ T . Consider
Q i j ( q ) = q 1 + δ i + j , 0 − δ i , 0 − δ j , 0 , H q = F G ⊗ Q ( q ) F G Q_{ij}^{(q)}=q^{1+\delta_{i+j,0}-\delta_{i,0}-\delta_{j,0}},\qquad H_q=F_G\otimes_{Q(q)}F_G Q ij ( q ) = q 1 + δ i + j , 0 − δ i , 0 − δ j , 0 , H q = F G ⊗ Q ( q ) F G
The first row and column of Q ( q ) Q^{(q)} Q ( q ) are 1. Its other entries are q 2 q^2 q 2 when i + j = 0 i+j=0 i + j = 0 , and q q q otherwise. This is the dephasing of the matrix C i j = q δ i + j , 0 C_{ij}=q^{\delta_{i+j,0}} C ij = q δ i + j , 0 .
Theorem 7.1. If q q q has infinite order, the phase group of H q H_q H q is the connected torus
K Q ( q ) = B G = { D ( z ) : z ∈ T G } , D ( z ) i j = z i + j z 0 z i z j , dim B G = N − 1 K_{Q(q)}=B_G=\{D(z):z\in\mathbb{T}^G\},\qquad D(z)_{ij}=\frac{z_{i+j}z_0}{z_i z_j},\qquad\dim B_G=N-1 K Q ( q ) = B G = { D ( z ) : z ∈ T G } , D ( z ) ij = z i z j z i + j z 0 , dim B G = N − 1 The rooted law is
μ H q = ( 1 − 1 N ) δ 0 + 1 N law ( ∣ 1 + U 1 + ⋯ + U N − 1 ∣ 2 ) \mu_{H_q}=\left(1-\frac{1}{N}\right)\delta_0+\frac{1}{N}\operatorname{law}\left(\lvert1+U_1+\cdots+U_{N-1}\rvert^2\right) μ H q = ( 1 − N 1 ) δ 0 + N 1 law ( ∣ 1 + U 1 + ⋯ + U N − 1 ∣ 2 ) where the U j U_j U j are independent uniform circle variables. In particular this law depends only on N N N , and not on q q q or on the abelian group structure of G G G .
Proof. The map D D D is a homomorphism for coordinatewise multiplication. Its kernel consists of the vectors z i = α χ ( i ) z_i=\alpha\chi(i) z i = α χ ( i ) , with α ∈ T \alpha\in\mathbb{T} α ∈ T and χ ∈ G ^ \chi\in\widehat{G} χ ∈ G : indeed D ( z ) = 1 D(z)=1 D ( z ) = 1 says that i ↦ z i / z 0 i\mapsto z_i/z_0 i ↦ z i / z 0 is a character. Thus B G B_G B G is a connected torus of dimension N − 1 N-1 N − 1 .
We compute the phase generators on the undephased matrix C C C , as permitted by Proposition 4.2 . Let a t , t ∈ G a_t,t\in G a t , t ∈ G , denote the coordinate vectors in R G \mathbb{R}^G R G , and put
v k , e = a − e + a k − a k − e − a 0 v_{k,e}=a_{-e}+a_k-a_{k-e}-a_0 v k , e = a − e + a k − a k − e − a 0
Substitution in the generator formula gives g k , e = D ( q v k , e ) g_{k,e}=D(q^{v_{k,e}}) g k , e = D ( q v k , e ) , where exponentiation is coordinatewise. Hence K Q ( q ) ⊂ B G K_{Q(q)}\subset B_G K Q ( q ) ⊂ B G . To prove the reverse inclusion, sum over k k k :
∑ k ∈ G v k , e = N ( a − e − a 0 ) \sum_{k\in G}v_{k,e}=N(a_{-e}-a_0) k ∈ G ∑ v k , e = N ( a − e − a 0 )
Therefore the products of the generators include D ( q N ( a t − a 0 ) ) D(q^{N(a_t-a_0)}) D ( q N ( a t − a 0 ) ) for every t ∈ G t\in G t ∈ G . Since q N q^N q N has infinite order, the closure of the subgroup generated by the vectors q N ( a t − a 0 ) q^{N(a_t-a_0)} q N ( a t − a 0 ) , with t ≠ 0 t\ne0 t = 0 , is
S G = { z ∈ T G : ∏ t ∈ G z t = 1 } . S_G=\left\{z\in\mathbb{T}^G:\prod_{t\in G}z_t=1\right\}. S G = { z ∈ T G : t ∈ G ∏ z t = 1 } .
Each coordinate other than the zeroth one can be varied independently along a dense circle, and the zeroth coordinate is the inverse of their product. Moreover D ( S G ) = B G D(S_G)=B_G D ( S G ) = B G , because multiplying any z z z by a common phase can make its product equal to 1 1 1 , without changing D ( z ) D(z) D ( z ) . This proves the phase-group assertion.
Push Haar measure on T G \mathbb{T}^G T G through D D D to obtain Haar measure on B G B_G B G . The matrices D ( z ) D(z) D ( z ) and R ( z ) = ( z i + j ) i j R(z)=(z_{i+j})_{ij} R ( z ) = ( z i + j ) ij differ by diagonal unitary row and column factors, so their Gram eigenvalues agree. Negating the row index turns R ( z ) R(z) R ( z ) into the convolution matrix ( z j − i ) i j (z_{j-i})_{ij} ( z j − i ) ij . Its Fourier eigenvectors give Gram eigenvalues
∣ ∑ t ∈ G z t χ ( t ) ∣ 2 , χ ∈ G ^ . \left|\sum_{t\in G}z_t\chi(t)\right|^2,\qquad\chi\in\widehat{G}. t ∈ G ∑ z t χ ( t ) 2 , χ ∈ G .
For independent Haar coordinates z t z_t z t , all these eigenvalues have the same distribution. Theorem 4.1 therefore gives the stated law, with N N N independent phases in the sum. Dividing them by z 0 z_0 z 0 leaves the modulus unchanged and makes the first phase equal to 1, giving the displayed version.
For G = Z 4 G=\mathbb{Z}_4 G = Z 4 , with the ordering 0 , 1 , 2 , 3 0,1,2,3 0 , 1 , 2 , 3 , the parameter matrix is
Q ( q ) = ( 1 1 1 1 1 q q q 2 1 q q 2 q 1 q 2 q q ) . Q^{(q)}=
\begin{pmatrix}
1 & 1 & 1 & 1\\
1 & q & q & q^2\\
1 & q & q^2 & q\\
1 & q^2 & q & q
\end{pmatrix}. Q ( q ) = 1 1 1 1 1 q q q 2 1 q q 2 q 1 q 2 q q .
It gives the law 3 4 δ 0 + 1 4 law ( ∣ 1 + U + V + W ∣ 2 ) \frac{3}{4}\delta_0+\frac{1}{4}\operatorname{law}(|1+U+V+W|^2) 4 3 δ 0 + 4 1 law ( ∣1 + U + V + W ∣ 2 ) at index 16. The same law is obtained with G = Z 2 2 G=\mathbb{Z}_2^2 G = Z 2 2 . At N = 3 N=3 N = 3 we recover the law of the infinite-order slice in § 8 , through a different parameter matrix. These assertions concern the laws, without asserting equivalence of the Hadamard matrices or isomorphism of their quantum groups.
The scalar law has a lattice interpretation, which extends the one found at index 9. For independent uniform phases z t z_t z t , with t ∈ G t\in G t ∈ G , we have
∣ ∑ t ∈ G z t ∣ 2 = N + ∑ s ≠ t z s z t ‾ . \left|\sum_{t\in G}z_t\right|^2=N+\sum_{s\ne t}z_s\overline{z_t}. t ∈ G ∑ z t 2 = N + s = t ∑ z s z t .
and the last N ( N − 1 ) N(N-1) N ( N − 1 ) terms are the Fourier transform of the adjacency operator A A A of the following graph Λ G \Lambda_G Λ G . The vertices are the vectors m ∈ Z G m\in\mathbb{Z}^G m ∈ Z G with ∑ t m t = 0 \sum_t m_t=0 ∑ t m t = 0 , and m m m is joined to the vectors m + a s − a t m+a_s-a_t m + a s − a t , with s ≠ t s\ne t s = t , where a t a_t a t are the coordinate vectors, as before. This is the root lattice of type A N − 1 A_{N-1} A N − 1 , with the roots as steps. Thus
μ H q = ( 1 − 1 N ) δ 0 + 1 N law ( N + A ) . \mu_{H_q}=\left(1-\frac{1}{N}\right)\delta_0+\frac{1}{N}\operatorname{law}(N+A). μ H q = ( 1 − N 1 ) δ 0 + N 1 law ( N + A ) .
with the law of A A A being taken at any vertex. At N = 3 N=3 N = 3 we recover the triangular lattice of § 8 , and at N = 4 N=4 N = 4 we obtain the face-centered cubic lattice, where each vertex has 12 neighbors. Observe also that Λ G \Lambda_G Λ G is the lattice of the second neighbors on the generic coset graph of Proposition 5.5 , which is the honeycomb lattice at N = 3 N=3 N = 3 , and the diamond lattice at N = 4 N=4 N = 4 .
Moments and growth
The scalar formula makes every moment a finite combinatorial sum. It also identifies the first relation which separates this family from the fully generic parameters.
Proposition 7.2. For the family of Theorem 7.1 , we have c 0 = 1 c_0=1 c 0 = 1 and
c n = 1 N W N ( 2 n ) = 1 N ∑ a 1 + ⋯ + a N = n ( n a 1 , … , a N ) 2 c_n=\frac{1}{N}W_N(2n)=\frac{1}{N}\sum_{a_1+\cdots+a_N=n}\binom{n}{a_1,\ldots,a_N}^{2} c n = N 1 W N ( 2 n ) = N 1 a 1 + ⋯ + a N = n ∑ ( a 1 , … , a N n ) 2 for n ≥ 1 n\ge1 n ≥ 1 , with a j ≥ 0 a_j\ge0 a j ≥ 0 . In particular,
c 1 = 1 , c 2 = 2 N − 1 , c 3 = 6 N 2 − 9 N + 4 c_1=1,\qquad c_2=2N-1,\qquad c_3=6N^2-9N+4 c 1 = 1 , c 2 = 2 N − 1 , c 3 = 6 N 2 − 9 N + 4 For N ≥ 3 N\ge3 N ≥ 3 the first nongeneric moment is c 3 c_3 c 3 , with defect ( N − 1 ) ( N − 2 ) (N-1)(N-2) ( N − 1 ) ( N − 2 ) , and the shortest nontrivial relation has length 3. At N = 2 N=2 N = 2 the law is generic.
Proof. Expand the n n n -th power of the sum of N N N independent phases and its conjugate. Integration keeps exactly the pairs of words with the same content ( a 1 , … , a N ) (a_1,\ldots,a_N) ( a 1 , … , a N ) , giving the squared multinomial sum. At degree 2 the contents have types ( 2 ) (2) ( 2 ) and ( 1 , 1 ) (1,1) ( 1 , 1 ) , and at degree 3 they have types ( 3 ) (3) ( 3 ) , ( 2 , 1 ) (2,1) ( 2 , 1 ) and ( 1 , 1 , 1 ) (1,1,1) ( 1 , 1 , 1 ) . The sums are
N + 4 ( N 2 ) = N ( 2 N − 1 ) , N + 9 N ( N − 1 ) + 36 ( N 3 ) = N ( 6 N 2 − 9 N + 4 ) N+4\binom{N}{2}=N(2N-1),\qquad N+9N(N-1)+36\binom{N}{3}=N(6N^2-9N+4) N + 4 ( 2 N ) = N ( 2 N − 1 ) , N + 9 N ( N − 1 ) + 36 ( 3 N ) = N ( 6 N 2 − 9 N + 4 ) Division by N N N gives the first moments.
For generic square parameters, the Gram model instead has independent matrix entries. A term in the third Gram trace survives when each entry phase has balanced exponents. Either all row indices coincide, all column indices coincide, or there are exactly 2 distinct rows and 2 distinct columns. The first 2 cases contribute N 4 N^4 N 4 each, with an overlap of N 2 N^2 N 2 terms. In the last case the singleton row has 3 possible positions, and the singleton column must occupy the opposite position, giving 3 N 2 ( N − 1 ) 2 3N^2(N-1)^2 3 N 2 ( N − 1 ) 2 terms. After division by N 2 N^2 N 2 we obtain
c 1 g e n = 1 , c 2 g e n = 2 N − 1 , c 3 g e n = 2 N 2 − 1 + 3 ( N − 1 ) 2 = 5 N 2 − 6 N + 2 c_1^{\mathrm{gen}}=1,\qquad c_2^{\mathrm{gen}}=2N-1,\qquad c_3^{\mathrm{gen}}=2N^2-1+3(N-1)^2=5N^2-6N+2 c 1 gen = 1 , c 2 gen = 2 N − 1 , c 3 gen = 2 N 2 − 1 + 3 ( N − 1 ) 2 = 5 N 2 − 6 N + 2 Thus the first defect is ( N − 1 ) ( N − 2 ) (N-1)(N-2) ( N − 1 ) ( N − 2 ) when N ≥ 3 N\ge3 N ≥ 3 , and Theorem 4.3 identifies its relation length. At N = 2 N=2 N = 2 , the torus B G B_G B G has the full dimension ( N − 1 ) 2 = 1 (N-1)^2=1 ( N − 1 ) 2 = 1 of the dephased phase torus, so the law is generic. □
By Proposition 5.5, the number N c n Nc_n N c n counts the closed walks of length 2 n 2n 2 n on the generic coset graph at index 2 N 2N 2 N . In other words, if ∣ S ∣ |S| ∣ S ∣ denotes the length of the N N N -step planar walk, the generic law at index 2 N 2N 2 N involves the variable N + ε ∣ S ∣ N+\varepsilon|S| N + ε ∣ S ∣ , while the present law at index N 2 N^2 N 2 involves ∣ S ∣ 2 |S|^2 ∣ S ∣ 2 . In terms of the density p N p_N p N of ∣ S ∣ |S| ∣ S ∣ , studied in [12 ] , the continuous part of μ H q \mu_{H_q} μ H q is 1 2 N x p N ( x ) d x \frac{1}{2N\sqrt{x}}p_N(\sqrt{x})\,dx 2 N x 1 p N ( x ) d x , on [ 0 , N 2 ] [0,N^2] [ 0 , N 2 ] .
At index 16 we obtain the Domb numbers divided by 4, namely c n = 1 , 7 , 64 , 679 , 7876 , 96784 c_n=1,7,64,679,7876,96784 c n = 1 , 7 , 64 , 679 , 7876 , 96784 for 1 ≤ n ≤ 6 1\le n\le6 1 ≤ n ≤ 6 . The program coppi.py checks the phase-generator identities on cyclic and noncyclic groups, and independently counts return words using the block action. These counts agree with the multinomial formula through degree 6 for N = 2 , 3 N=2,3 N = 2 , 3 , through degree 5 for both groups of order 4, and through degree 3 for N = 5 N=5 N = 5 . It also checks the generic third moments directly by balancing Gram monomials.
The phase-group dimension N − 1 N-1 N − 1 is smaller than the generic value ( N − 1 ) 2 (N-1)^2 ( N − 1 ) 2 when N ≥ 3 N\ge3 N ≥ 3 . We can compute the resulting growth constant directly from the scalar law.
Corollary 7.3. For the circulant family with q q q of infinite order, we have
c n ∼ N ( N − 2 ) / 2 2 N − 1 π ( N − 1 ) / 2 ( N 2 ) n n − ( N − 1 ) / 2 c_n\sim\frac{N^{(N-2)/2}}{2^{N-1}\pi^{(N-1)/2}}(N^2)^n n^{-(N-1)/2} c n ∼ 2 N − 1 π ( N − 1 ) /2 N ( N − 2 ) /2 ( N 2 ) n n − ( N − 1 ) /2 as n → ∞ n\to\infty n → ∞ . Thus the power of n n n agrees with Theorem 6.1 at d = N − 1 d=N-1 d = N − 1 .
Proof. Fix the zeroth phase to be 1 and write the others as e − i θ j e^{-\mathrm{i}\theta_j} e − i θ j . The unique maximum of the squared modulus, modulo 2 π 2\pi 2 π , occurs when all the phases are 1. Near this maximum,
∣ 1 + ∑ j = 1 N − 1 e i θ j ∣ 2 = N 2 − θ t ( N I d − I N − 1 ) θ + O ( ∣ θ ∣ 4 ) \left|1+\sum_{j=1}^{N-1}e^{\mathrm{i}\theta_j}\right|^2=N^2-\theta^{t}(N I_d-I_{N-1})\theta+O(|\theta|^4) 1 + j = 1 ∑ N − 1 e i θ j 2 = N 2 − θ t ( N I d − I N − 1 ) θ + O ( ∣ θ ∣ 4 )
The quadratic form has eigenvalue 1 on the all-one vector and eigenvalue N N N on its orthogonal complement, so its determinant is N N − 2 N^{N-2} N N − 2 . Outside any fixed neighborhood of the maximum, the contribution is exponentially smaller than ( N 2 ) n (N^2)^n ( N 2 ) n . Laplace integration with Haar measure d θ / ( 2 π ) N − 1 d\theta/(2\pi)^{N-1} d θ / ( 2 π ) N − 1 therefore gives
c n ∼ ( N 2 ) n N ( 2 π ) N − 1 ( π N 2 n ) ( N − 1 ) / 2 1 N ( N − 2 ) / 2 c_n\sim\frac{(N^2)^n}{N(2\pi)^{N-1}}\left(\frac{\pi N^2}{n}\right)^{(N-1)/2}\frac{1}{N^{(N-2)/2}} c n ∼ N ( 2 π ) N − 1 ( N 2 ) n ( n π N 2 ) ( N − 1 ) /2 N ( N − 2 ) /2 1
which simplifies to the stated constant. At N = 3 N=3 N = 3 it is 3 / ( 4 π ) \sqrt{3}/(4\pi) 3 / ( 4 π ) , agreeing with the index-9 computation, and at N = 4 N=4 N = 4 it is 1 / ( 2 π 3 / 2 ) 1/(2\pi^{3/2}) 1/ ( 2 π 3/2 ) . □
Comparing with Theorem 6.1 , where κ = 1 \kappa=1 κ = 1 since B G B_G B G is connected, we obtain Δ Q = N N − 4 \Delta_Q=N^{N-4} Δ Q = N N − 4 . The program zulle.py confirms this, from the exponents of the entries of Q ( q ) Q(q) Q ( q ) , for Z 3 , Z 4 , Z 2 2 , Z 5 , Z 6 Z_3,Z_4,Z_2^2,Z_5,Z_6 Z 3 , Z 4 , Z 2 2 , Z 5 , Z 6 .
The first Jacobi defect
The invariant-dimension viewpoint of [9 Sections 10 and 11] suggests expressing our moment comparisons through orthogonal polynomials. For a probability law with moments c n c_n c n , let p j p_j p j be its monic orthogonal polynomials and put
h j = ∫ p j ( x ) 2 d μ ( x ) , D k = det ( c i + j ) 0 ≤ i , j < k , D 0 = 1 h_j=\int p_j(x)^2\,d\mu(x),\qquad D_k=\det(c_{i+j})_{0\leq i,j<k},\qquad D_0=1 h j = ∫ p j ( x ) 2 d μ ( x ) , D k = det ( c i + j ) 0 ≤ i , j < k , D 0 = 1
As long as the relevant norms are positive, the monic recurrence and its coefficients are
x p j = p j + 1 + β j p j + λ j p j − 1 , β j = 1 h j ∫ x p j ( x ) 2 d μ ( x ) , λ j = h j h j − 1 xp_j=p_{j+1}+\beta_jp_j+\lambda_jp_{j-1},\qquad\beta_j=\frac{1}{h_j}\int xp_j(x)^2\,d\mu(x),\qquad\lambda_j=\frac{h_j}{h_{j-1}} x p j = p j + 1 + β j p j + λ j p j − 1 , β j = h j 1 ∫ x p j ( x ) 2 d μ ( x ) , λ j = h j − 1 h j
Here the last formula is for j ≥ 1 j\geq1 j ≥ 1 , while p 0 = 1 p_0=1 p 0 = 1 , p − 1 = 0 p_{-1}=0 p − 1 = 0 and λ 0 = 0 \lambda_0=0 λ 0 = 0 . Also h j = D j + 1 / D j h_j=D_{j+1}/D_j h j = D j + 1 / D j . In the symmetric Jacobi matrix the off-diagonal entries are λ j \sqrt{\lambda_j} λ j ; we use the monic coefficients λ j \lambda_j λ j throughout.
Proposition 7.4. Let 2 compactly supported probability laws first differ in moment degree L ≥ 2 L\geq2 L ≥ 2 , with δ = c L − c L 0 > 0 \delta=c_L-c_L^0>0 δ = c L − c L 0 > 0 , and suppose the reference law has infinite support. Their first changed Jacobi coefficient is
λ r − λ r 0 = δ h r − 1 0 ( L = 2 r ) , β r − β r 0 = δ h r 0 ( L = 2 r + 1 ) \lambda_r-\lambda_r^0=\frac{\delta}{h_{r-1}^0}\quad(L=2r),\qquad\beta_r-\beta_r^0=\frac{\delta}{h_r^0}\quad(L=2r+1) λ r − λ r 0 = h r − 1 0 δ ( L = 2 r ) , β r − β r 0 = h r 0 δ ( L = 2 r + 1 ) In the order β 0 , λ 1 , β 1 , λ 2 , … \beta_0,\lambda_1,\beta_1,\lambda_2,\ldots β 0 , λ 1 , β 1 , λ 2 , … , all preceding coefficients agree. In the even case we also have
D k = D k 0 ( k ≤ r ) , D r + 1 − D r + 1 0 = δ D r 0 D_k=D_k^0\quad(k\leq r),\qquad D_{r+1}-D_{r+1}^0=\delta D_r^0 D k = D k 0 ( k ≤ r ) , D r + 1 − D r + 1 0 = δ D r 0 so the first changed leading Hankel determinant is determined by the same defect.
Proof. The moments through degree 2 r − 1 2r-1 2 r − 1 determine p r p_r p r , since its coefficients solve the orthogonality equations against 1 , x , … , x r − 1 1,x,\ldots,x^{r-1} 1 , x , … , x r − 1 . Thus, for L = 2 r L=2r L = 2 r , both laws have the same monic p r p_r p r , and the difference of its squared norms is δ \delta δ , because p r 2 p_r^2 p r 2 is monic of degree 2 r 2r 2 r . All lower norms agree. We obtain λ r − λ r 0 = δ / h r − 1 0 \lambda_r-\lambda_r^0=\delta/h_{r-1}^0 λ r − λ r 0 = δ / h r − 1 0 , and the new norm is positive since h r = h r 0 + δ > 0 h_r=h_r^0+\delta>0 h r = h r 0 + δ > 0 . In the Hankel matrix of size r + 1 r+1 r + 1 , only the bottom-right entry changes, by δ \delta δ ; its cofactor is D r 0 D_r^0 D r 0 .
For L = 2 r + 1 L=2r+1 L = 2 r + 1 , the polynomial p r p_r p r and its norm h r h_r h r both agree with the reference ones. The polynomial x p r 2 xp_r^2 x p r 2 is monic of degree 2 r + 1 2r+1 2 r + 1 , so its integral changes by δ \delta δ . Division by h r 0 h_r^0 h r 0 gives the second formula. The preceding recurrence coefficients use only lower moments, proving the remaining assertion. □
For a nongeneric Fourier deformation, Theorem 4.3 makes L L L the shortest nontrivial relation length and makes δ \delta δ positive. The generic law has infinite support, as follows for instance from Theorem 6.1 with d = ( M − 1 ) ( N − 1 ) > 0 d=(M-1)(N-1)>0 d = ( M − 1 ) ( N − 1 ) > 0 . The proposition therefore gives a Jacobi form of the first-relation theorem: an even length first changes a coefficient λ r \lambda_r λ r , and an odd length first changes a coefficient β r \beta_r β r .
For the circulant family, Proposition 7.2 gives L = 3 L=3 L = 3 for N ≥ 3 N\geq3 N ≥ 3 . Since p 1 = x − 1 p_1=x-1 p 1 = x − 1 , we obtain
β 0 = 1 , λ 1 = 2 ( N − 1 ) , β 1 = 6 N − 7 2 , β 1 g e n = 5 ( N − 1 ) 2 \beta_0=1,\qquad\lambda_1=2(N-1),\qquad\beta_1=\frac{6N-7}{2},\qquad\beta_1^{\mathrm{gen}}=\frac{5(N-1)}{2} β 0 = 1 , λ 1 = 2 ( N − 1 ) , β 1 = 2 6 N − 7 , β 1 gen = 2 5 ( N − 1 )
In particular β 1 − β 1 g e n = ( N − 2 ) / 2 \beta_1-\beta_1^{\mathrm{gen}}=(N-2)/2 β 1 − β 1 gen = ( N − 2 ) /2 , so the first extra relations are visible at the first nontrivial diagonal coefficient.
The delayed index-8 family exhibits the even case. It also shows how far out in the Jacobi recurrence the first difference can occur.
Proposition 7.5. For the family of Proposition 6.3 , with m m m connected components, we have
D k = D k g e n ( k ≤ 2 m ) , D 2 m + 1 − D 2 m + 1 g e n = 1 2 ( 2 m m ) 2 D 2 m g e n D_k=D_k^{\mathrm{gen}}\quad(k\leq2m),\qquad D_{2m+1}-D_{2m+1}^{\mathrm{gen}}=\frac{1}{2}\binom{2m}{m}^{2}D_{2m}^{\mathrm{gen}} D k = D k gen ( k ≤ 2 m ) , D 2 m + 1 − D 2 m + 1 gen = 2 1 ( m 2 m ) 2 D 2 m gen The first changed Jacobi coefficient satisfies
λ 2 m − λ 2 m g e n = 1 2 ( 2 m m ) 2 D 2 m − 1 g e n D 2 m g e n \lambda_{2m}-\lambda_{2m}^{\mathrm{gen}}=\frac{1}{2}\binom{2m}{m}^{2}\frac{D_{2m-1}^{\mathrm{gen}}}{D_{2m}^{\mathrm{gen}}} λ 2 m − λ 2 m gen = 2 1 ( m 2 m ) 2 D 2 m gen D 2 m − 1 gen while β j = β j g e n \beta_j=\beta_j^{\mathrm{gen}} β j = β j gen for j ≤ 2 m − 1 j\leq2m-1 j ≤ 2 m − 1 and λ j = λ j g e n \lambda_j=\lambda_j^{\mathrm{gen}} λ j = λ j gen for j < 2 m j<2m j < 2 m .
Proof. The first moment defect is at degree 4 m 4m 4 m , with value 1 2 ( 2 m m ) 2 \frac{1}{2}\binom{2m}{m}^{2} 2 1 ( m 2 m ) 2 , by Proposition 6.3 . Apply Proposition 7.4 with r = 2 m r=2m r = 2 m and use h 2 m − 1 g e n = D 2 m g e n / D 2 m − 1 g e n h_{2m-1}^{\mathrm{gen}}=D_{2m}^{\mathrm{gen}}/D_{2m-1}^{\mathrm{gen}} h 2 m − 1 gen = D 2 m gen / D 2 m − 1 gen .
For m = 1 m=1 m = 1 , the moments through degree 3 are 1, 1, 5, 28 in both cases, while the fourth moments are 167 and 169. Hence
D 3 g e n = 39 , D 3 = 47 , λ 2 g e n = 39 16 , λ 2 = 47 16 D_3^{\mathrm{gen}}=39,\qquad D_3=47,\qquad\lambda_2^{\mathrm{gen}}=\frac{39}{16},\qquad\lambda_2=\frac{47}{16} D 3 gen = 39 , D 3 = 47 , λ 2 gen = 16 39 , λ 2 = 16 47
The program coppi.py verifies the determinant and Jacobi formulas for m = 1 , … , 5 m=1,\ldots,5 m = 1 , … , 5 , using exact character counts on T 2 \mathbb{T}^2 T 2 times the group of m m m -th roots of unity. Since m m m can be arbitrarily large, no fixed finite initial segment of moments, Hankel determinants or Jacobi parameters detects genericity uniformly at index 8. Here the comparison is between genuine positive subfactor laws; the long positive truncations without a full law in [9 ] concern a different obstruction.
Finite-depth laws with long generic truncations
The same question can be asked at every product index, with finite-depth laws in place of the index-8 family. For this subsection let X , Y X,Y X , Y have orders M , N ≥ 2 M,N\geq2 M , N ≥ 2 , and put
Q i j = q ( 1 − δ i , 0 ) ( 1 − δ j , 0 ) , H q = F X ⊗ Q F Y , d = ( M − 1 ) ( N − 1 ) Q_{ij}=q^{(1-\delta_{i,0})(1-\delta_{j,0})},\qquad H_q=F_X\otimes_Q F_Y,\qquad d=(M-1)(N-1) Q ij = q ( 1 − δ i , 0 ) ( 1 − δ j , 0 ) , H q = F X ⊗ Q F Y , d = ( M − 1 ) ( N − 1 )
Thus the first row and column of Q Q Q are 1 and every other entry is q q q . Here d d d denotes the dimension of the generic phase torus.
Theorem 7.6. Suppose that q q q has order l ≥ 2 l\geq2 l ≥ 2 and gcd ( l , M N ) = 1 \gcd(l,MN)=1 g cd( l , M N ) = 1 . The phase group is
K Q = { Z ∈ T X × Y : Z 0 j = Z i 0 = 1 , Z i j l = 1 } , ∣ K Q ∣ = l d K_Q=\{Z\in\mathbb{T}^{X\times Y}: Z_{0j}=Z_{i0}=1,\ Z_{ij}^{l}=1\},\qquad|K_Q|=l^d K Q = { Z ∈ T X × Y : Z 0 j = Z i 0 = 1 , Z ij l = 1 } , ∣ K Q ∣ = l d The subfactor has finite depth, and its moments satisfy
c n = c n g e n ( 0 ≤ n < 2 l ) , c 2 l − c 2 l g e n = d c_n=c_n^{\mathrm{gen}}\quad(0\leq n<2l),\qquad c_{2l}-c_{2l}^{\mathrm{gen}}=d c n = c n gen ( 0 ≤ n < 2 l ) , c 2 l − c 2 l gen = d with c n g e n c_n^{\mathrm{gen}} c n gen as in Theorem 3.5 . In particular the first extra relation has length 2 l 2l 2 l .
Proof. The matrix Q Q Q is the dephasing of C i j = q δ i , 0 δ j , 0 C_{ij}=q^{\delta_{i,0}\delta_{j,0}} C ij = q δ i , 0 δ j , 0 . Substitution in Proposition 4.2 gives, for nonzero i , j , k , e i,j,k,e i , j , k , e ,
g k , e ( i , j ) = q − ( 1 + δ i , k ) ( 1 + δ j , − e ) g_{k,e}(i,j)=q^{-(1+\delta_{i,k})(1+\delta_{j,-e})} g k , e ( i , j ) = q − ( 1 + δ i , k ) ( 1 + δ j , − e )
The generators with k = 0 k=0 k = 0 or e = 0 e=0 e = 0 are trivial. After reindexing e e e by − e -e − e , their exponent matrix is − A ⊗ B -A\otimes B − A ⊗ B , where
A = I d + I M − 1 , B = I d + I N − 1 , ∣ det ( − A ⊗ B ) ∣ = M N − 1 N M − 1 A=Id+\mathbb{I}_{M-1},\qquad B=Id+\mathbb{I}_{N-1},\qquad\lvert\det(-A\otimes B)\rvert=M^{N-1}N^{M-1} A = I d + I M − 1 , B = I d + I N − 1 , ∣ det ( − A ⊗ B )∣ = M N − 1 N M − 1
Here I \mathbb{I} I denotes the all-one matrix. Indeed A A A has eigenvalues M , 1 , … , 1 M,1,\ldots,1 M , 1 , … , 1 , and similarly for B B B . The determinant is invertible modulo l l l , so the generators fill the entire grid of l l l -th roots in the d d d free coordinates. Explicitly, we have
A − 1 = I d − 1 M I M − 1 , B − 1 = I d − 1 N I N − 1 A^{-1}=Id-\frac{1}{M}\mathbb{I}_{M-1},\qquad B^{-1}=Id-\frac{1}{N}\mathbb{I}_{N-1} A − 1 = I d − M 1 I M − 1 , B − 1 = I d − N 1 I N − 1
These formulas remain valid modulo l l l , with M − 1 , N − 1 M^{-1},N^{-1} M − 1 , N − 1 denoting their modular inverses. They allow any prescribed vector of free phase exponents to be expressed as a combination of the generator vectors.
The dual group T Q T_Q T Q therefore has l d l^d l d elements, and Γ Q = T Q ⋊ Y \Gamma_Q=T_Q\rtimes Y Γ Q = T Q ⋊ Y has N l d Nl^d N l d elements. The quotient description of Theorem 3.12 gives dim C ( G H q ) = M N l d \dim C(G_{H_q})=MNl^d dim C ( G H q ) = M N l d . There are only finitely many irreducible representations, so the associated Hadamard subfactor has finite depth.
Multiplying rows and columns by phases preserves Gram spectra. Hence we may compute the finite-grid integral using independent uniform l l l -th roots in all M N MN M N positions: dephasing this matrix pushes its uniform measure to Haar measure on K Q K_Q K Q . With i a ∈ X i_a\in X i a ∈ X , j a ∈ Y j_a\in Y j a ∈ Y and i n + 1 = i 1 i_{n+1}=i_1 i n + 1 = i 1 , expand
Tr ( ( Z Z ∗ ) n ) = ∑ i 1 , … , i n ∑ j 1 , … , j n ∏ a = 1 n Z i a , j a Z ‾ i a + 1 , j a \operatorname{Tr}\bigl((ZZ^*)^n\bigr)=\sum_{i_1,\ldots,i_n}\sum_{j_1,\ldots,j_n}\prod_{a=1}^{n}Z_{i_a,j_a}\overline{Z}_{i_{a+1},j_a} Tr ( ( Z Z ∗ ) n ) = i 1 , … , i n ∑ j 1 , … , j n ∑ a = 1 ∏ n Z i a , j a Z i a + 1 , j a
Let E = ( E i j ) E=(E_{ij}) E = ( E ij ) be the exponent matrix of a term. Every row sum and column sum of E E E is zero, and the sum of its positive entries is at most n n n . Generic integration keeps exactly E = 0 E=0 E = 0 , while finite-grid integration keeps exactly the matrices whose entries are divisible by l l l .
A nonzero such matrix has positive mass at least 2 l 2l 2 l . To see this, choose a positive entry. A negative entry in the same row forces a second positive entry in another row, since its column sum is zero. Both positive entries are at least l l l . Thus no extra term occurs for n < 2 l n<2l n < 2 l .
At n = 2 l n=2l n = 2 l , equality forces exactly 2 positive and 2 negative entries, equal to l l l and − l -l − l . The zero row and column sums place them at the corners of a rectangle. There is no cancellation between the positive and negative occurrences in the monomial, since the positive mass has already reached n n n . For distinct rows i , i ′ i,i' i , i ′ and columns j , j ′ j,j' j , j ′ , the extra monomials are therefore
( Z i j Z ‾ i ′ j Z i ′ j ′ Z ‾ i j ′ ) l \left(Z_{ij}\overline{Z}_{i'j}Z_{i'j'}\overline{Z}_{ij'}\right)^l ( Z ij Z i ′ j Z i ′ j ′ Z i j ′ ) l
and their conjugates. Once the initial row and column have been chosen, the next row must be the other row of the rectangle, and the next column must be the other column. Repeating this gives the whole cyclic sequence. Thus there are exactly 4 terms for each unordered pair of rows and unordered pair of columns. No extra factor l l l appears: shifting by a full period repeats the same index sequence in the trace expansion. Using the normalization in Theorem 4.1 , we obtain
c 2 l − c 2 l g e n = 4 M N ( M 2 ) ( N 2 ) = ( M − 1 ) ( N − 1 ) c_{2l}-c_{2l}^{\mathrm{gen}}=\frac{4}{MN}\binom{M}{2}\binom{N}{2}=(M-1)(N-1) c 2 l − c 2 l gen = M N 4 ( 2 M ) ( 2 N ) = ( M − 1 ) ( N − 1 )
The assertion about relation length now follows from Theorem 4.3 . □ \square □
The determinant calculation also shows that an infinite-order q q q in this same family gives the full generic phase torus. Indeed its exponent lattice has finite index in Z d \mathbb{Z}^d Z d , and the powers of q q q along any nonzero integer multiple of a coordinate axis are dense in the circle. The restriction on l l l in the theorem makes the finite case just as explicit.
In the covering picture of Theorem 5.1 , the finite case corresponds to N Q = l T N_Q = lT N Q = l T , which is the only subgroup of T T T with quotient isomorphic to Z l \mathbb{Z}_l Z l . Thus B Q B_Q B Q is the covering of K X , Y K_{X,Y} K X , Y associated to its homology with coefficients in Z l \mathbb{Z}_l Z l , and the extra closed walks found in the above proof are the 4-cycles of K X , Y K_{X,Y} K X , Y , traversed l l l times. There are M ( M − 1 ) ( N − 1 ) M(M-1)(N-1) M ( M − 1 ) ( N − 1 ) such walks based at a given white vertex, in agreement with the formula c n = w n / M c_n = w_n/M c n = w n / M of Proposition 5.2. As for the assumption on l l l , this cannot be dropped. At M = N = 2 M=N=2 M = N = 2 the above determinant is 4, we recover the group K Q = ⟨ q 4 ⟩ K_Q = \langle q^4\rangle K Q = ⟨ q 4 ⟩ found in § 7 , and for q q q of order 2 or 4 the law is the Fourier one. The program zulle.py checks the order l d l^d l d of the group K Q K_Q K Q in 7 cases, and this latter phenomenon as well.
Corollary 7.7. For the family of Theorem 7.6 , the first changed Jacobi coefficient and leading Hankel determinant satisfy
λ l − λ l g e n = d h l − 1 g e n , D l + 1 − D l + 1 g e n = d D l g e n \lambda_l-\lambda_l^{gen}=\frac{d}{h_{l-1}^{gen}}, \qquad D_{l+1}-D_{l+1}^{gen}=dD_l^{gen} λ l − λ l g e n = h l − 1 g e n d , D l + 1 − D l + 1 g e n = d D l g e n All preceding Jacobi coefficients agree, and D k = D k g e n D_k=D_k^{gen} D k = D k g e n for k ≤ l k\le l k ≤ l . As l → ∞ l\to\infty l → ∞ through orders coprime to M N MN M N , these finite-depth laws converge weakly to the generic law. At fixed X , Y X,Y X , Y , no finite initial segment of moments or Jacobi coefficients distinguishes finite depth from the generic infinite-depth case.
Proof. Apply Proposition 7.4 with L = 2 l L=2l L = 2 l and δ = d \delta=d δ = d . All the laws are supported on [ 0 , M N ] [0,MN] [ 0 , M N ] , and each fixed moment is eventually equal to its generic value. Polynomial approximation of continuous functions on this interval gives weak convergence. The generic law has infinite support by Theorem 6.1 , so its subfactor has infinite depth. Integers l l l coprime to M N MN M N can be arbitrarily large, proving the last assertion. □
For example, take X = Y = Z 3 X=Y=\mathbb{Z}_3 X = Y = Z 3 and q = − 1 q=-1 q = − 1 , so that l = 2 l=2 l = 2 and d = 4 d=4 d = 4 . We obtain
Q = ( 1 1 1 1 − 1 − 1 1 − 1 − 1 ) , ( c 1 , c 2 , c 3 , c 4 ) = ( 1 , 5 , 29 , 185 ) Q=\begin{pmatrix}1&1&1\\1&-1&-1\\1&-1&-1\end{pmatrix}, \qquad(c_1,c_2,c_3,c_4)=(1,5,29,185) Q = 1 1 1 1 − 1 − 1 1 − 1 − 1 , ( c 1 , c 2 , c 3 , c 4 ) = ( 1 , 5 , 29 , 185 )
Here ∣ K Q ∣ = 16 |K_Q|=16 ∣ K Q ∣ = 16 and dim C ( G H q ) = 144 \dim C(G_{H_q})=144 dim C ( G H q ) = 144 . The generic fourth moment is 181, and the corresponding Hankel and Jacobi values are
D 3 g e n = 48 , D 3 = 64 , λ 2 g e n = 3 , λ 2 = 4 D_3^{gen}=48,\qquad D_3=64,\qquad\lambda_2^{gen}=3,\qquad\lambda_2=4 D 3 g e n = 48 , D 3 = 64 , λ 2 g e n = 3 , λ 2 = 4
The program coppi.py checks the generator matrix on cyclic and noncyclic groups, the first moment and Jacobi defects for M = 2 M=2 M = 2 , 2 ≤ N ≤ 5 2\le N\le5 2 ≤ N ≤ 5 and coprime orders 2 ≤ l ≤ 7 2\le l\le7 2 ≤ l ≤ 7 , and 3-row examples by direct Gram counts. Independent block-action counts also verify the finite-grid laws, including the displayed index-9 example.