Free functions with symmetry

In 1936, Margarete C. Wolf showed that the ring of symmetric free polynomials in two or more variables is isomorphic to the ring of free polynomials in infinitely many variables. We show that Wolf’s theorem is a special case of a general theory of the ring of invariant free polynomials: every ring of invariant free polynomials is isomorphic to a free polynomial ring. Furthermore, we show that this isomorphism extends to the free functional calculus as a norm-preserving isomorphism of function spaces on a domain known as the row ball. We give explicit constructions of the ring of invariant free polynomials in terms of representation theory and develop a rudimentary theory of their structures. Specifically, we obtain a generating function for the number of basis elements of a given degree and explicit formulas for good bases in the abelian case.


Introduction
A symmetric free polynomial in the letters x 1 , . . . , x d is a free polynomial p over C which satisfies p(x 1 , . . . , for all permutations σ of {1, . . . , d}. For example, p(x 1 , x 2 ) = x 1 + x 2 + 7x 1 x 1 + 7x 2 x 2 + 3x 1 x 2 + 3x 2 x 1 is a symmetric free polynomial in two variables. Classically, Wolf proved the following theorem about the structure of the ring of symmetric free polynomials [22]. Theorem 1.1 (Wolf) The symmetric free polynomials over C in d ≥ 2 variables is isomorphic to the ring of free polynomials in infinitely many variables.
More recently, free symmetric polynomials have been investigated by numerous authors [5,7,11], and some deep connections with representation theory are now known.
We are concerned with the ring of invariant free polynomials. Let G be a group. Let π : G → U d be a unitary representation. That is, π is a homomorphism from the group G to the group of d × d unitary matrices over C. An invariant free polynomial with respect to π is a free polynomial p ∈ C x 1 , . . . , x d which satisfies for all σ in G. (Here, the action of the d × d matrices π(σ ) on (x 1 , . . . , x d ) is given by matrix multiplication. That is, for example, if U = a b c d , we define the action of U on (x 1 , x 2 ) to be given by the formula U (x 1 , x 2 ) = (ax 1 +bx 2 , cx 1 + dx 2 ).) Notably, the invariant free polynomials form a ring (also, in fact, an algebra over C) called the ring of invariant free polynomials. We note to the reader that the ring of invariant free polynomials is best understood as an algebra, but for historical reasons, we use the term ring in analogy with the classical nomenclature of the ring of invariants (also ring of invariant polynomials), which dates back to Hilbert.
For example, the symmetric free polynomials in d variables are obtained in the special case where G = S d is a symmetric group, and we define π : S d → U d to be the representation satisfying π(σ )e i = e σ (i) , where e i is the ith elementary basis vector for C d .
We now define the domains on which we intend to execute the function theory of invariant free polynomials. Fix an infinite dimensional separable Hilbert space H. There is only one infinite dimensional separable Hilbert space up to isomorphism [9], so what follows will be independent of the exact choice. Let be an index set. Let C be the set of (X λ ) λ∈ , sequences of elements in B(H) indexed by , such that λ∈ X λ X * λ < 1, where A < B means that B − A is strictly positive definite (that is, B − A is positive semidefinite and has spectrum disjoint from 0) and A ≤ B means that B − A is positive semidefinite. Here the sum λ∈ X λ X * λ is required to be absolutely convergent in the weak operator topology and have λ∈ X λ X * λ < 1, or equivalently, there is an ε > 0 such that for every finite ⊂ , Some authors refer to C as the row ball, or the set of row contractions [14,18]. Given a free polynomial p in the letters (x λ ) λ∈ and a point X = (X λ ) λ∈ ∈ C , we form p(X ) via the formula We define a basis for R to be an indexed set (u λ ) λ∈ of free polynomials which generate R as an algebra, which is minimal in the sense that there is no such that the set (u λ ) λ∈ generates R as an algebra. We note that any basis for R is finite or countably infinite, since R has finite or countable dimension as a vector space as it is a subspace of C x 1 , . . . , x d , and the minimality condition implies that the (u λ ) λ∈ are linearly independent.
We prove the following theorem.
satisfies the following properties: • The map takes C d to C .
• Furthermore, for p in the ring of invariant free polynomials for π, there exists a unique free polynomialp such that p =p • .
Namely, the map takingp to p is an isomorphism of rings from the free algebra C x λ λ∈ to the ring of invariant free polynomials. Theorem 1.2 follows from Theorems 4.2 and 6.5. We note that a similar result was obtained for free functions on the domain for symmetric free functions in two variables by Agler and Young [4].
In general, the basis in Theorem 1.2 is hard to compute. However, the number of elements of a certain degree is computed in Sect. 7.1. An explicit basis can be obtained if G is abelian, which we discuss in Sect. 7.2.

Some examples
We now give some concrete examples of what our main result says. First, we give an analogous theorem to that obtained in Agler and Young for symmetric free functions in two variables [4].

Proposition 1.3 Let
The map satisfies the following properties: • takes C 2 to C N . • For any free polynomial p such that there exists a unique free polynomialp such that p =p • .
Another simple example concerns the ring of even functions in two variables, that is, the ring of free polynomials in two variables f satisfying the identity Here the group G in Theorem 1.2 is the cyclic group with two elements, Z 2 = {0, 1}, and the representation π is given by

Proposition 1.4 Let
The map satisfies the following properties: • takes C 2 to C 4 . • For any free polynomial p such that there exists a unique free polynomialp such that p =p • .
We discuss Proposition 1.4 in detail in Sect. 2. Here we see a concrete trade-off between the number of variables and degree in the optimization of a free polynomial: finding the supremum norm of a polynomial in 4 variables of degree d on C 4 is the same as finding the supremum norm of an even polynomial in 2 variables of degree 2d on C 2 .
Both Proposition 1.3 and Proposition 1.4 follow from our basis construction in the abelian case given in Theorem 7.4.

Geometry
Although the image of the map in Theorem 1.2 may have high codimension, in the sense that it is far from being literally surjective, the functionp is completely determined by p and has the same norm. We view this as an analogue of the celebrated work of Agler and M c Carthy on norm preserving extensions of functions on varieties to whole domains [1,2]. Additionally, since p totally determinesp, the dimension of the Zariski closure of the image of a free polynomial map can apparently go up, in contrast with the commutative case [12]. Exploiting the aforementioned phenomenon is a critical step in the theory of change of variables for free polynomials and their generalizations, the free functions, which had been thought to be extremely rigid [13].
To prove Theorem 1.2, we develop a Hilbert space geometric theory of the ring of invariant free functions. As a consequence of the geometric structure, the ring of free invariant polynomials is always free (but perhaps infinitely generated), in contrast with the Chevalley-Shepard-Todd Theorem in the commutative case, in which freeness depends on the structure of G [8,21].

Free analysis
A free function on C is a function from C to B(H) which is the uniform limit of free polynomials on the sets r C . We let H (C ) denote the algebra of free functions on C . The

Banach algebra of bounded free functions H
We note that there are many equivalent characterizations of a free function, such as [3,14,15,18].
We can reinterpret Theorem 1.2 as an isomorphism of function algebras analogous to Wolf's theorem. Let H ∞ π (C d ) be the Banach algebra of bounded invariant free functions for π on C d .

Corollary 1.5 There is a countable set such that
is such an isomorphism. The map is injective and surjective since it is already since it is an isomorphism on the level of formal power series, which uniquely define a free function [15].

Example: an even free function in two variables
To begin, we discuss a simple nontrivial example of a free ring of invariants. We will now explain what our main result, Theorem 1.2, says about a specific even free polynomial in two variables.
We say a free polynomial p ∈ C x 1 , x 2 is even if We note that the even free functions form an algebra. Consider the even free polynomial as a map on the domain C 2 .
We first note that it is clearly not a coincidence that p has no odd degree terms. Furthermore, if we let we get that Thus, We are interested in the analytical properties ofp and .
We will show the remarkable fact that Let X ∈ C 2 . That is, Since we get that Thus, We will now show a curious equality: Since p is a free polynomial and is thus continuous on the closure Define operators X 1 and X 2 with the following block structure First, That is, whereJ denotes some matrix tuple which is irrelevant to our aims. So, Namely, Thus, To see that

The space of free polynomials as an inner product space
We now seek to understand the geometry of free polynomials as a Hilbert space.
Definition 3. 1 We define H 2 d to be the Hilbert space of free formal power series in d variables whose sequence of coefficients is an element of 2 with an inner product given by the inner product of the coefficients. We define [H 2 d ] n to be the subspace of homogeneous free polynomials of degree n. For a free polynomial f in d variables, we define M f to be the operator on H 2 d satisfying M f g = f g.
The following lemma describes a grading structure on H 2 d .

Lemma 3.2 (Grading lemma)
Let p, q be homogenous free polynomials of degree n and r, s be homogenous free polynomials of degree m. Then, pr, qs = p, q r, s .
Proof It suffices to show that the claim holds for monomials Let u 1 , . . . , u k be an orthonormal basis for V and v 1 , . . . , v k be an orthonormal basis for V. Then, Proof It is sufficient to note that the equality of as outer products since u i and v i give orthonomal bases for the same space, and we are done.

Superorthogonality
We can now define superorthogonality. We will later see that the ring of invariant free polynomials is itself superorthogonal.
The goal of this section is to prove that a general version of Theorem 1.2 is true for superorthogonal algebras.

Theorem 4.2 Let
A be a superorthogonal algebra. Let (u λ ) λ∈ be a superorthogonal basis. The map on C d defined by the formula (X ) = (u λ (X )) λ∈ satisfies the following properties: • The map takes C d to C . • Furthermore, for p ∈ A , there exists a unique free polynomialp such that p =p • .
Namely, the map takingp to p is an isomorphism of rings from the free algebra C x λ λ∈ to A. We now show that superorthogonal algebras are necessarily free.

Lemma 4.3 A superorthogonal algebra A is isomorphic to a free algebra in perhaps infinitely many variables. Specifically, the map
Proof It is enough to show that for any two distinct products n i=1 u λ i and m j=1 u κ j of the same degree as free polynomials in since then the words in u λ are linearly independent. Since the words are distinct, there is a p such that λ i = κ i for all i < p and λ p = κ p . So, Note that n i= p u λ i ∈ u λ p H 2 d and m j= p u κ j ∈ u κ p H 2 d which implies that the two products are orthogonal since u λ p and u κ p are superorthogonal and thus the desired inner product is 0.
We now show that the superorthogonal basis maps C d into C . has ran ⊆ C , that is

Lemma 4.4 Let
We call the superorthogonal basis map.
Let I be the left ideal generated by A\C1 in C x 1 , . . . , x d , that is, the span of the elements of the form ab where a ∈ A\{1} and b ∈ C x 1 , . . . , x d .
To show that λ∈ u λ (X )u λ (X ) * < 1, we will show by induction that where w i,n form an orthonormal basis for Note that for n = 1, Inequality (4.1) becomes which holds by Lemma 3.3 since the set of u λ of degree one combined with the set of w i,1 must form a basis for [H 2 d ] 1 . Now suppose that Inequality (4.1) holds for n. That is, We will now show that it holds for n + 1. Since Note that any u λ of degree n + 1 must be in the subspace (  Similarly to our example for even functions (Sect. 2), given a U ∈ C we would like to find an X ∈ C d such that there is some projection P so that Pp( (X ))P =p(U ) (4.2) and thus that p(X ) ≥ p(U ) .

Lemma 4.5 Let
Let Since the algebra A is a joint invariant subspace for all the M u λ , we get that with respect to the decomposition, where J λ and K λ are some operators which will be irrelevant to this discussion. The Frazho-Popescu dilation theorem [10,17] states that for any U ∈ C , there is a projectionP such that for any free polynomial q, Thus, there is indeed an X and a projection as desired in (4.2), namely, taking X = (M x 1 ⊗ I, . . . , M x d ⊗ I ) and the projection as constructed above. Thus, for every U ∈ C there exists an X ∈ C d such that and so To see that we note that (X ) ∈ C by Lemma 4.4. Now Theorem 4.2 follows immediately.

Example: free functions in three variables invariant under the natural action of the cyclic group with three elements
We now show how to construct a superorthonormal basis for the ring of free polynomials in three variables which are invariant under the natural action of the free group. That is, we want to understand free functions which satisfy the identity and show that they form a superorthogonal algebra. Let σ denote a generator of the cyclic group with three elements. Define the action of σ on free functions in three variables by With this notation we are trying to understand functions such that Let ω be a nontrivial third root of unity. Consider the following three linear polynomials: Clearly, the function u 0 is fixed by the natural action of the cyclic group with three elements. However, That is, they are eigenfunctions of the action σ on free polynomials in three variables. In fact, any product of the u i will be an eigenfunction of the action of σ. For example, Thus, it can be observed that j u i j is in the ring of invariant free polynomials under the action of the cyclic group with three elements if and only if j i j ≡ 3 0, and furthermore that products satisfying this condition span the algebra of free polynomials in three variables which are fixed by the natural action of the cyclic group with three elements.
So, if we choose products N j=1 u i j such that j i j ≡ 3 0, which are primitive in that no partial product n j=1 u i j is in the ring of invariant free polynomials, we will obtain a basis for our algebra. To show that this basis is superorthogonal, it is enough to show that any two distinct products N j=1 u i j , N j=1 u k j are orthogonal. However, by the grading lemma, Since the two products were assumed to be not equal, the orthogonality of the u i implies that at least one of the u i j , u k j = 0, so we are done.
For the action of a general group, an explicit construction of a superorthogonal basis for the ring of invariants is more difficult. However, the existence of such a basis can be established using some basic representation theory which we do in the next section. Later, we will return to the issue of an explicit construction for specific classes of groups for which the problem is tractable.

The ring of invariant free polynomials is superorthogonal
In order to derive Theorem 1.2 from Theorem 4.2, it is sufficient to show that the ring of invariant free polynomials is superorthogonal. Definition 6.1 Let π be a unitary representation of a group G. Let π n denote the induced action of π on [H 2 d ] n . We make the identification that π 1 = π.
Let p ∈ [H 2 d ] n and q ∈ [H 2 d ] m . Note that π n+m · pq = (π n · p)(π m · q), which translates to the following formal observation by the grading lemma.

Observation 6.2 Let π be a unitary representation of a group G. Then,
π n ⊗ π m = π n+m with the identification made in the grading lemma.
Observation 6.2 implies that the action on homogeneous polynomials of degree n is determined by the action on homogeneous polynomials of degree 1.

Corollary 6.3 Let π be a unitary representation of a group G. Then,
π n = π ⊗n with the identification made in the grading lemma.
The following technical lemma gives key information about projections of invariant polynomials onto ideals. π be a unitary representation of a  Proof Without loss of generality, we can assume q is homogeneous and of degree greater than or equal to n. Let w k be a basis for

Lemma 6.4 Let
Simplifying, Since π is unitary each (π · w k ) is still orthogonal to h. Thus, we conclude that v = π · v, and we are done.
We can now prove that the ring of invariant free polynomials is superorthogonal by constructing a basis for it. Theorem 6.5 Let G be a group. Let π : G → U d be a group representation. The ring of invariant free polynomials for π is superorthogonal.
d ] i denote the set of polynomials in the ring of invariants of degree n which are orthogonal to all polynomials generated by the polynomials in the ring of invariants of lower positive degree. Let for each i let u i,k be an orthogonal basis for V i . We claim that these u i,k form a superorthogonal basis.
Let P h be as in Lemma 6.4. To show superorthogonality, it is enough, by definition, to show that, for any free polynomial v, which simplifies via the grading lemma to By Lemma 6.4, we get that u i,k v is invariant, so v is invariant. Since u i,k v is a product of invariants of strictly lower degree, we get that v must be 0 by the definition of V i . So, we are done.
7 Structure of the superorthogonal basis for the ring of invariants

Counting
We now calculate the number of elements in any superorthonormal basis for the ring of invariant free polynomials of a given degree in terms of generating functions. The main result of this section is as follows.
Theorem 7.1 Let π be a unitary representation of a compact topological group G and χ = tr π be the character corresponding to π. Let C G be a set of representatives for the conjugacy classes of G. Let f n be dimension of invariant homogeneous free polynomials of degree n. Let g n be the number of free polynomials of degree n in some superorthogonal basis for the ring of invariant free polynomials of π. Then, where μ denotes the normalized Haar measure on G, and If G is finite, where #C τ denotes the number of elements in the conjugacy class of τ and Namely, the number of generators of a given degree is independent of the choice of superorthogonal basis.
We prove Theorem 7.1 in Sect. 7.1.1. For example, consider symmetric functions in three variables. That is, take the group S 3 acting on C 3 via the representation π(σ )e i = e σ (i) . According to Theorem 7.1, the necessary information can be conveniently compiled in the following table.
where F n denotes the nth Fibonacci number.
Thus, in general, with the help of computer algebra software, it is a simple exercise to calculate the number of free polynomials of degree n in some superorthogonal basis for the ring of invariant free polynomials of π.

The proof of Theorem 7.1
Let f n be the dimension of invariant homogeneous free polynomials of degree n. Let g n be the number of free polynomials of degree n in some superorthogonal basis for the ring of invariant free polynomials of π. Let Proof It can be shown using enumerative combinatorics that Thus, Calculating g from f gives that In order to calculate f n , we use character theory (see Serre [20,Chapter 2]). Let ρ be a representation for G. For each σ ∈ G, put χ ρ (g) = tr(ρ(σ )). χ ρ is the character of ρ. Let φ 1 , φ 2 be functions from G into C. The scalar product ·, · is defined by We make the identification χ = χ π .
Proof By Lemma 6.3, the action of π on homogenous polynomials is given by π ⊗n .
Otherwise, it must be orthogonal to the ring of invariant free polynomials.
So, any invariant free polynomial is in the span of the v J ∈ B, which are themselves invariant homogeneous free polynomials.
To show thatB is superorthogonal, note for any two distinct words, v K , v L = 0 by the grading lemma, which implies the claim.
So, the calculation of a superorthogonal basis for the ring of invariants of a finite abelian group is tractable in general.
The superorthogonal basis given in Theorem 7.4 also implies that off of some variety, the ring of invariant functions is finitely generated. So, there are finitely many invariant free rational functions such that any invariant free polynomial can be written in terms of them, in spite of the fact that the ring of invariant free polynomials is not itself finitely generated. Similar phenomena occur in real algebraic geometry, such as the fact that positive polynomials cannot be written as sums of squares of polynomials [16], but can be written as sums of squares of rational functions, i.e. Artin's resolution of Hilbert's seventeenth problem [6]. So, H is of finite index in F d and is thus finitely generated, which then implies that the ring is finitely generated.

Example: ad hoc methods for symmetric functions in three variables
We now turn our attention to symmetric functions in three variables. Let u 0 , u 1 , u −1 be as in Sect. 5 and let (b n ) n∈N be the constructed superorthogonal basis for cyclic free polynomials in 3 variables, where we fix b 0 = u 0 .
We recall that each b n is of the form b n = k u i k such that k i k ≡ 3 0. So, τ · b n = bñ for someñ, since τ · k u i k = k u −i k , and so For n = 0, let c 0 0 = u 0 . Note that each c 0 n is a symmetric free polynomial and that the product of an even number of c 1 n is also symmetric. In fact, τ · c 0 n = c 0 n , and τ · c 1 n = −c 1 n . Set Now, B is a superorthogonal basis for the symmetric free polynomials in three variables. The elements of B of degree 4 and less are given in the following table.