Book a Demo!
CoCalc Logo Icon
StoreFeaturesDocsShareSupportNewsAboutPoliciesSign UpSign In
gmcninch-tufts
GitHub Repository: gmcninch-tufts/2024-Sp-Math190
Path: blob/main/course-contents/2024-02-07--notes-RT--functions.md
908 views
---
title: Representations and the symmetric group date: 2024-02-07
---

\newcommand{\trivial}{\mathbf{1}}

Irreducible representations of finite abelian groups

Let AA be a finite abelian group, written additively.

We set A^=Hom(A,C×)\widehat A = \operatorname{Hom}(A,\mathbb{C}^\times) for the set of all group homomorphisms AC×A \to \mathbb{C}^\times. We can make A^\widehat A into a group by declaring for ϕ,ψA^\phi,\psi \in \widehat A that ϕψ:AC×\phi\cdot \psi :A \to \mathbb{C}^\times is the mapping aϕ(a)ψ(a)a \mapsto \phi(a)\psi(a).

Proposition: : A^\widehat A is an abelian group, and A^A\widehat A \simeq A.

Sketch: : When A=Z/nZA = \mathbb{Z}/n\mathbb{Z} is cyclic let ζ=exp(2πi/n)\zeta = \exp(2 \pi i /n) be primitive nnth root of unity.

For $j \in \mathbb{Z}/n\mathbb{Z}$, define $\phi_j \in \widehat {\mathbb{Z}/n\mathbb{Z}}$ by $$\phi_j(i + n \mathbb{Z}_) = \zeta^{ij}.$$ One checks that $j \mapsto \phi_j$ defines an isomorphism of groups $$\mathbb{Z}/n\mathbb{Z} \to \widehat {\mathbb{Z}/n\mathbb{Z}}.$$ Now the Proposition follows by using that $$\widehat{A \times B} \simeq \widehat{A} \times \widehat{B}$$ for abelian group $A$ and $B$.

Observe that elements of A^\widehat A determine 1-dimensional representations, which are necessarily irreducible. Since a 1-dimensional representation coincides with its trace, our results on the characters of irreducible representations imply that the functions C\mathbb{C}-valued functions A^\widehat{A} form an orthonormal basis for C[A]\mathbb{C}[A].

Let us write A^={ϕ1,ϕ2,,ϕn}\widehat{A} = \{\phi_1,\phi_2,\cdots,\phi_n\} where n=An = |A|.

Given a function f:ACf: A \to \mathbb{C}, i.e. an element fC[A]f \in \mathbb{C}[A], we may write f=i=1nf,ϕiϕi.f = \sum_{i=1}^n \langle f,\phi_i \rangle \phi_i.

The Fourier transform of ff is the function f^:A^C\widehat{f}:\widehat{A} \to \mathbb{C} given by f^(ϕ)=f,ϕ.\widehat{f}(\phi) = \langle f, \phi \rangle.

Remark: : When A=Z/nZA = \mathbb{Z}/n\mathbb{Z}, one often views the values f(i)f(i) for i+nZi + n\mathbb{Z} as samples of some periodic function of (say) a real variable tt, viewed as time.

In that case, the domain of $\widehat{f}$ is viewed as *frequency*.

Remark: : In any event, for abelian AA we have two natural bases for C[A]\mathbb{C}[A]: the functions δa\delta_a for aAa \in A, and the functions A^\widehat{A}.

How to study C[G]\mathbb{C}[G] for non-abelian GG?

Idea: the matrix coefficients of linear representations define functions on GG. If ρ:GGL(V)\rho:G \to \operatorname{GL}(V) is a linear representation, let b1,,bnb_1,\dots,b_n be a basis of VV and let b1,,bnb_1^\vee,\cdots,b_n^\vee be the dual basis.

For 1i,jn1 \le i,j \le n we get a function ρi,j:GC\rho_{i,j}:G \to \mathbb{C} by the rule ρi,j(g)=bi(ρ(g)bj).\rho_{i,j}(g) = b_i^\vee(\rho(g)b_j).

Claim: : Let LL be an irreducible representation and let C[G](L)\mathbb{C}[G]_{(L)} be the isotypic component of the regular representation. Then the functions ρi,j\rho_{i,j} provide a basis for C[G](L)\mathbb{C}[G]_{(L)} where ρ\rho defines the irreducible representation dual to LL.

We omit the proof, and refer the reader e.g.[@jamesRepresentationsCharactersGroups2001] for the notion of the *dual* of a representation. But recall that we know that $[\mathbb{C}[G]_{(L)}:L] = \dim L$ so that $\dim \mathbb{C}[G]_{(L)} = (\dim L)^2 = \dim \operatorname{End}(L).$

Irreducible representations of the symmetric group

Recall that two elements σ,τSn\sigma,\tau \in S_n are conjugate     \iff they have the same cycle structure. We state this in the following form:

Lemma: : Conjugacy classes in SnS_n are in bijection with partitions λn\lambda \vdash n.

For example, there are 55 partitions of 44; they are λ=(1,1,1,1)\lambda = (1,1,1,1), λ=(2,2)\lambda = (2,2), λ=(2,1,1)\lambda = (2,1,1), λ=(3,1)\lambda = (3,1), and λ=(4)\lambda=(4).

As a consequence, we know:

Proposition: : Isomorphism classes of irreducible representations of SnS_n on complex vector spaces are in bijection with partitions λn\lambda \vdash n.

Here is a quick overview of some facts about the representations of SnS_n, without proofs:

In fact, for each partition λn\lambda \vdash n, there is a construction of an irreducible representation VλV_\lambda for SnS_n. To begin the construction, associate with λ\lambda the subgroup Sλ=Sλ1×Sλ2××SλrS_\lambda = S_{\lambda_1} \times S_{\lambda_2} \times \cdots \times S_{\lambda_r} let Ωλ=Sn/Sλ\Omega_\lambda = S_n / S_\lambda be the set of left cosets of SλS_\lambda in SnS_n.

Thus Ωλ\Omega_\lambda is a set on which the symmetric group SnS_n acts, and we may consider the permutation representation C[Ωλ]\mathbb{C}[\Omega_\lambda], and for brevity we write Mλ=C[Ωλ]M^\lambda = \mathbb{C}[\Omega_\lambda].

One defines the dominance ordering on partitions of nn by the rule λμ\lambda \trianglelefteq \mu if and only if for each \ell i=1λii=1μi.\sum_{i=1}^\ell \lambda_i \le \sum_{i=1}^\ell \mu_i.

There is a labeling of irreducible representations of SnS_n by partition; let us write SλS^\lambda for the irreducible representation corresponding to λ\lambda. It is known as a Specht representation.

Theorem: : [Mλ:Sλ]=1[M^\lambda:S^\lambda] =1 and [Mλ:Sμ]>0    λμ[M^\lambda:S^\mu] > 0 \implies \lambda \trianglelefteq \mu.

As stated, the Theorem appears to depend on our knowledge of the irreducible representations, but in fact it gives us a way to define them.

For a fixed λ\lambda, consider all homomorphisms of SnS_n-representations $$M^\mu \to M^\lambda \quad \text{ for $\lambda \trianglelefteq \muParseError: KaTeX parse error: Expected 'EOF', got '}' at position 1: }̲;letswrite lets write R^\lambda \subset M^\lambda$ for the sum of the image of all of these homomorphisms.

The Theorem implies that Mλ/Rλ=SλM^\lambda / R^\lambda = S^\lambda is irreducible.

Here are some special cases:

  • if λ=(n)\lambda = (n) then ParseError: KaTeX parse error: Undefined control sequence: \trivial at position 25: … = S^\lambda = \̲t̲r̲i̲v̲i̲a̲l̲ is the trivial representation.

  • if λ=(1,1,,1)\lambda = (1,1,\cdots,1) them Sλ=sgnS^\lambda = \operatorname{sgn} is the (1-dimensional) sign representation.

  • if λ=(n1,1)\lambda = (n-1,1) then MλM^\lambda is the permutation representation C[{1,2,,n}]\mathbb{C}[\{1,2,\cdots,n\}], and ParseError: KaTeX parse error: Undefined control sequence: \trivial at position 30: …\lambda \oplus \̲t̲r̲i̲v̲i̲a̲l̲ so that dimSλ=n1\dim S^\lambda = n-1.

    Observe that indeed (n1,1)(n)(n-1,1) \trianglelefteq (n).

  • when n=3n=3, we saw previously that S3S_3 has 3 irreducible representations. They can be described as

    • ParseError: KaTeX parse error: Undefined control sequence: \trivial at position 11: S^{(3)} = \̲t̲r̲i̲v̲i̲a̲l̲ the trivial representation

    • S(1,1,1)=sgnS^{(1,1,1)} = \operatorname{sgn} the sign representation

    • S(2,1)S^{(2,1)}, an irreducible representation of dimension 2

Rank preferences

I want to describe in brief the ideas investigated in [@diaconisGeneralizationSpectralAnalysis1989], which amounts as an application of representation theory on the symmetric group to statistics.

First, an example

Suppose we were to ask people to rank their preferred ice cream flavors from the following ordered list:

  • [ pistachio, chocolate, strawberry, vanilla, neopolitan ]

Numbering the flavors [ 0, 1, 2, 3, 4 ] in order, we can represent an individual's preference using a permutation σS5\sigma \in S_5.

For example the preference list

  • [ neopolitan, strawberry, chocolate, vanilla, pistachio ]

corresponds to the product of transposition (04)(12)(04)(12).

So our survey data amounts to a list of elements σ1,σ2,,σNS5\sigma_1,\sigma_2,\dots,\sigma_N \in S_5.

Ranking in more generality

In general, nn will denote the number of items to be ranked, and we assume given a list of ranking data: Σ:σ1,σ2,,σm\Sigma: \sigma_1, \sigma_2, \cdots, \sigma_m

The main statistic of interest is the frequency function f=fΣ:SnCf = f_\Sigma:S_n \to \mathbb{C} given for σSn\sigma \in S_n by the rule f(σ)=#{σiσ=σi}f(\sigma) = \#\{\sigma_i \mid \sigma = \sigma_i\}.

Idea: View ff as a vector in the regular representation C[Sn]\mathbb{C}[S_n]. We want to understand how ff decomposes in some natural descriptions of C[Sn]\mathbb{C}[S_n].

Bibliography

::: {.refs} :::