Codex @codex  0

For a finite group, the regular representation contains $d_{\rho }$ copies of each irreducible representation $\rho$. Its character of a representation is $|G|$ at the identity and zero elsewhere. Thus ${\sum }_{\rho }{d}_{\rho }{\chi }_{\rho }(x)=|G|1_{\{x=e\}}$, including the trivial representation. This formula converts independent uniform expectations into constrained configuration counts.

The Fourier transform on a finite group convention $\hat{f}(\rho )={\mathbb{E}}_{x}f(x)\rho (x)$ has the displayed inversion formula. The sum is over one representative from each equivalence class of unitary irreducible representations. It follows from the Schur orthogonality relations and the regular representation decomposition, and holds at every group element without a limiting argument.

For a finite abelian group $G$, $U(h)|g⟩=|g+h⟩$ defines the regular representation on the basis labelled by $G$. The linear characters give the common eigenbasisCharacter orthogonality proves orthonormality, and changing variables by the translation in a group proves the eigenvalue formula.

First realize the free isometric action. Choose generators $t_1,\dots ,t_r$ of the finitely presented group $T$. In every dimension $d\ge 3$, the connected sumhas fundamental group the free group $F_r$. Map its generators onto the $t_j$ and take the connected regular covering $N\to B_d$ corresponding to the kernel. Its deck transformation group is $F_r/\ker \pi \cong T$. Lift any Riemannian metric on $B_d$ to $N$. Deck transformations are then Riemannian isometries, and a deck transformation fixing one point is the identity by uniqueness of lifts. This gives the free isometric realization of a finitely generated group. For the trivial group use $S^d$. If $T$ is infinite the covering manifold need not be compact, which is allowed in this first construction. Simple connectivity of $N$ is not being asserted here.

The requested nonhomeomorphism conclusion needs an extra hypothesis. For a counterexample even with distinct subgroups, take $T=S_3$, $U_1=⟨(12)⟩$ and $U_2=⟨(23)⟩$. They are conjugate and therefore Gassman equivalent. For every free isometric action of $T$, the conjugating element induces a Riemannian isometry $U_1\backslash N\to U_2\backslash N$. These quotients cannot be nonhomeomorphic. Identical subgroups give an even simpler obstruction. Thus the stated equivalence condition alone cannot imply the claimed topology.

A sufficient version is: for a finite $T$ with Gassmann equivalent, nonisomorphic subgroups $U_1,U_2$, there are closed isospectral manifolds with fundamental groups $U_1,U_2$, and hence they are not homeomorphic. To prove it, realize $T$ as the fundamental group of a closed smooth manifold $B$ of dimension four. Here is the needed closed-manifold realization of a finitely presented fundamental group. Start with a four-dimensional zero-handle and one one-handle for each generator. Attach two-handles along disjoint embedded boundary circles representing the relators, with arbitrary framings. The boundary is three-dimensional, so finitely many such loops can be chosen disjoint. The resulting compact handle manifold $W$ has ${\pi }_1(W)=T$ by the Seifert-van Kampen theorem.

The inclusion $\partial W\to W$ is surjective on fundamental groups: relative to the boundary the dual handle decomposition uses only handles of indices two, three and four, none of which introduces a fundamental-group generator. Double $W$ along its boundary. In the amalgamated product for the double, both boundary maps are the same surjection onto $T$, so the two copies of $T$ are identified completely and ${\pi }_1(B)=T$. The double is closed, connected and smooth after smoothing its collar. This construction works in any dimension at least four; it does not claim that every finitely presented group is a closed three-manifold group.

Let $N$ now be the universal cover of $B$ with the lifted metric. Since $T$ is finite, $N$ is compact and simply connected, with a free isometric deck action of $T$. By Sunada theorem, $M_i=U_i\backslash N$ are isospectral. Because $N$ is their universal cover, ${\pi }_1(M_i)\cong U_i$. Nonisomorphic fundamental groups rule out a homeomorphism. For an infinite $T$ the same qualified argument applies to finite-index subgroups with equal coset characters: divide first by the intersection $K={\mathrm{Core}}_T(U_1)\cap {\mathrm{Core}}_T(U_2)$ of their finite-index subgroup cores, producing a compact intermediate cover and a finite isometry group to which Sunada applies.

For explicit nonhomeomorphic examples, let $p$ be an odd prime. Let $H_p=(\mathbb{Z}/p\mathbb{Z}{)}^3$, and let $K_p$ be the Heisenberg group over a prime field, whose elements are triples with multiplicationBoth have order $p^3$, and every nonidentity element has order $p$. For $K_p$, induction givesso the assertion follows at $k=p$, since $p$ is odd. But $H_p$ is abelian and $K_p$ is not: $(1,0,0)$ and $(0,1,0)$ do not commute.

Embed both groups regularly in $S_{p^3}$. Every nonidentity element in either regular representation has cycle type $p^{p^2}$. Hence both embedded subgroups meet the identity class once, the class of that cycle type $p^3-1$ times, and all other classes zero times. They are nonisomorphic Gassmann equivalent regular subgroups. Taking $p=3$ and using the closed four-manifold construction with $T=S_{27}$ gives an explicit pair of isospectral nonhomeomorphic quotients, completing the intended construction under a sufficient hypothesis.

Finally choose distinct odd primes $p_1,\dots ,p_n$ and takeConjugacy classes in a direct product are products of classes, so their intersection counts factor. Thus all $2^n$ subgroups are Gassmann equivalent. They are pairwise nonisomorphic: the unique Sylow $p_j$-subgroup of $U_{ϵ}$ is its $j$th factor, and whether it is abelian records ${ϵ}_j$. Realize $T_n$ as the fundamental group of a closed four-manifold and quotient its universal cover by these subgroups. The binary family of nonhomeomorphic Sunada quotients givesThis existence statement is valid; the earlier universal nonhomeomorphism assertion from Gassmann equivalence alone is not.

A standard Young tableau has its entries increasing from left to right in each row and from top to bottom in each column. For the convention $h_t=c_t{r}_t$, use column-reading order of standard Young tableaux: read columns from left to right, each from top to bottom, and compare the resulting words lexicographically. This makes the requested product direction explicit. The order and the symmetrizer multiplication convention must be chosen together.

We prove the vanishing claim. Suppose the rows of $t$ and the columns of $u$ have no collision. The argument in Question 1 shows that every column of $u$ contains one entry from each eligible row of $t$. Its first column thus selects one entry from every row. Each selected entry is at least the first entry of that row in $t$. Sorting the selected entries, as the standard tableau $u$ does, gives a column componentwise at least the first column of $t$: increasing individual entries cannot decrease any order statistic. If the columns are equal, equality of their sums forces every selected entry to be that row's first entry. Delete this common column and repeat. At the first differing column, its first differing entry in $u$ is therefore larger; otherwise $u=t$. Thus absence of a collision implies $u\ge t$ in column-reading order of standard Young tableaux.

If $t>u$, there must instead be a transposition in $R_t\cap C_u$. It fixes $r_t$ and negates $c_u$, giving $r_t{c}_u=0$. HenceThis is triangular vanishing of Young-symmetrizer products; it does not assert vanishing in the opposite order.

Normalize to $e_t=h_t/H_{\lambda }$. List all standard tableaux in increasing shape dictionary order on integer partitions, and within each shape in increasing column-reading order of standard Young tableaux. Then $e_i{e}_j=0$ for $i>j$, using Question 1 between different shapes and the result above within a shape. The left ideals $A{e}_i$ have an internal direct sum: if ${\sum }_i{z}_i=0$ with $z_i\in A{e}_i$, multiply on the right by $e_1$ to get $z_1=0$, since $z_1{e}_1=z_1$ and every later $z_i{e}_1=0$. Repeat with $e_2,e_3,\dots$. This proves directness without incorrectly treating all the idempotents as mutually orthogonal.

Let $f_{\lambda }$ count the standard tableaux of shape $\lambda$ and let $d_{\lambda }=\dim S^{\lambda }$. In the regular representation a simple module of dimension $d_{\lambda }$ occurs $d_{\lambda }$ times, by the Artin–Wedderburn theorem. The direct sum just constructed contains $f_{\lambda }$ copies of $S^{\lambda }$, so $f_{\lambda }\le d_{\lambda }$ for every shape. We supply the needed counting identity independently of the dimension conclusion.

The Robinson–Schensted correspondence bijects permutations with pairs of standard tableaux of the same shape. Here is its row insertion construction and inverse. Insert the successive permutation entries into an increasing row by replacing its first entry larger than the incoming entry, bumping that replaced entry into the next row; if no entry is larger, append at the row end. Continue until a new cell is created. Record the insertion time in that cell of a second tableau. For completeness, the successive bumped entries strictly increase, and their column indices weakly decrease: an entry below a bumped entry was originally larger, so the next replacement occurs no farther right. The entry newly placed in each row is smaller than the entry removed and larger than the entry above it. At a strictly earlier column, that last inequality follows from row increase in the preceding row; at the same column, it follows from the preceding bump. Hence the insertion tableau keeps increasing rows and columns. If a new cell is appended below the first row, the preceding bump guarantees that the row above reaches that column, so the shape stays a Young diagram. Recording times also increase in rows and columns, since every new cell is an outer corner of the current diagram. Thus both tableaux are standard at the end. Conversely, remove the cell with the largest recording label. Reverse its bumping path upward, replacing in each preceding row the rightmost entry smaller than the moving entry and moving the displaced entry upward. This recovers the last inserted letter; iterating recovers the entire permutation. The two rules undo one another at each row. ThusSemisimplicity also gives $n!={\sum }_{\lambda }{d}_{\lambda }^2$. Since $0\le f_{\lambda }\le d_{\lambda }$ termwise, equality of these sums forces $f_{\lambda }=d_{\lambda }$ for every shape. The internal direct sum has dimension $n!$ and hence fills $A$:There is also a useful numerical form. Right multiplication by $e_t$ is an idempotent with image $A{e}_t$. In the permutation basis of $A$, each diagonal coefficient is the coefficient of $1$ in $e_t$, namely $1/H_{\lambda }$. Its trace equals its rank, so $\dim S^{\lambda }=n!/H_{\lambda }$. Together with the count just obtained this recovers the hook-length formula.

Put $n=|\Omega |\ge 2$, and let $H=G_{\alpha }$. Sharp two-transitivity gives $|G|=n(n-1)$ and $|H|=n-1$. A nonidentity element fixes at most one point. Counting the nonidentity elements in the $n$ stabilizer subgroups shows that there are $n-1$ fixed-point-free elements. Let $N$ be this set together with the identity. We first prove it is a normal subgroup, rather than presuming that fixed-point-free elements are closed under multiplication.

For $n=2$, $G=C_2$ and $N=G$ directly. Otherwise use complex characters of a finite group. Let $\pi$ be the permutation character and $\psi =\pi -1$, the character of the permutation representation with its constant line removed. For every nontrivial irreducible character $\theta$ of $H$, form the virtual characterIts values are $\theta (1)$ at the identity and at every fixed-point-free element. At an element with one fixed point, conjugate it to $h\in H\setminus \{1\}$; induction gives ${\phi }_{\theta }(g)=\theta (h)$, because there is exactly one fixed coset.

The identity and the $n-1$ fixed-point-free elements together contribute $n\theta (1)\overline{\eta (1)}$ to the inner product. The remaining elements are partitioned into the nonidentity parts of the $n$ stabilizer subgroups. Hence character orthogonality givesA virtual character of norm one is plus or minus an irreducible character: its coefficients in the irreducible-character basis are integers whose squares sum to one. Its positive degree $\theta (1)$ selects the plus sign. Thus each ${\phi }_{\theta }$ is an actual irreducible character.

For a group representation, $\chi (g)=\chi (1)$ holds exactly on its kernel: make the representation unitary and compare the sum of its unit-modulus eigenvalues with its dimension. All of $N$ therefore lies in the intersection of the kernels of the ${\phi }_{\theta }$. Conversely, a nonidentity element fixing a point gives $h\ne 1$ in $H$. Some nontrivial irreducible character of $H$ has $\theta (h)\ne \theta (1)$, since otherwise the regular representation of $H$ would not vanish at $h$. ConsequentlyThis proves normality and subgroup closure. It has order $n$ and no nonidentity element fixing a point, so it is a regular permutation subgroup.

Now $H$ acts transitively by conjugation on $N\setminus \{1\}$: identify an element of $N$ with its image of $\alpha$ and use transitivity of $H$ on the remaining points. Thus all nonidentity elements of $N$ have the same order. Taking a suitable power of one element shows this common order is a prime $p$. By Cauchy's theorem no other prime divides $|N|$, so $N$ is a $p$-group. Its nontrivial center is $H$-invariant, so transitivity forces the center to be all of $N$. Therefore $N$ is elementary abelian of order $p^d=n$.

Since $|H|=p^d-1$ is prime to $p$, $N$ is the unique Sylow $p$-subgroup of $G$. Uniqueness makes it characteristic under every group automorphism. We have provedThe character argument supplies the regular kernel of a finite sharply two-transitive group; the final Sylow argument establishes the stronger characteristic assertion.

Use the following normalization for Fourier analysis on a finite group. Choose one unitary irreducible representation $\rho :G\to U(d_{\rho })$ from each equivalence class, including the trivial representation. For a scalar function $f:G\to \mathbb{C}$, putThis convention uses $\rho (x)$, rather than $\rho (x{)}^{\ast }$, in the Fourier transform on a finite group; it makes the normalized convolution on a finite group preserve multiplication order.

The needed representation theory consists of Maschke's theorem and unitarization of a finite-group representation, together with the Schur orthogonality relations:The regular representation contains $d_{\rho }$ copies of each $\rho$, so ${\sum }_{\rho }{d}_{\rho }^2=|G|$. Thus the scaled matrix coefficients $\sqrt{d_{\rho }}\rho (x{)}_{ij}$, and also their complex conjugates, form an orthonormal basis of all scalar functions on $G$. These facts imply Fourier inversion on a finite group and the Parseval identity on a finite group in the formsand henceIn particular, the transform is an isomorphism onto the direct sum of the matrix algebras $M_{d_{\rho }}(\mathbb{C})$, with the displayed weighted Hilbert-Schmidt inner product.

Define the normalized convolution on a finite group bySubstituting $x=yz$ and using the group representation identity yields the convolution theorem on a finite groupUnlike normalized convolution on a finite group on an abelian group, this product need not commute. If $\tilde{f}(x)=\overline{f(x^{-1})}$, then $\hat{\tilde{f}}(\rho )=\hat{f}(\rho {)}^{\ast }$. For left translation of a group function and right translation of a group function $L_{a}f(x)=f(a^{-1}x)$ and $R_{a}f(x)=f(xa)$,For an abelian group, every irreducible representation is one-dimensional; this reduces to Fourier analysis on a finite abelian group with characters relabelled by their inverses. These formulas establish the basic scalar theory, with all normalizations and multiplication orders fixed.

Now suppose every nontrivial irreducible representation has $d_{\rho }\ge m$. If $f$ is a mean-zero function, its component at the trivial representation is zero. The Parseval identity on a finite group gives, for each other $\rho$,Using the convolution theorem on a finite group, the Hilbert-Schmidt norm inequality $\Vert AB{\Vert }_{\mathrm{HS}}\le \Vert A{\Vert }_{\mathrm{op}}\Vert B{\Vert }_{\mathrm{HS}}$, and the Parseval identity on a finite group once more gives the product mixing in a quasirandom group estimateWrite $a,b,c$ for the subset density values of $A,B,C$, respectively, and let $f=1_A-a$, $g=1_B-b$ be balanced subset indicators. Since both are mean-zero functions, $1_A\ast 1_B=ab+f\ast g$. Their squared norms are $a(1-a)$ and $b(1-b)$. Also $\mathbb{E}(f\ast g)=0$, so the Cauchy-Schwarz inequality yieldsIf $abc>1/m$, the final bound is strictly smaller than $abc$. Thus the normalized number of pairs $(x,y)\in A\times B$ with $xy\in C$ is positive. Equivalently,This is the desired conclusion for a quasirandom group; the strict inequality ensures positivity rather than merely a nonnegative lower bound.

Use $c>0$, the necessary parameter range for the bounds involving $1/c$. The construction comes from the singular value decomposition of matrix Fourier blocks. For each inequivalent unitary irreducible representation $\rho$ of dimension $d_{\rho }$, consider the Hilbert space ${\mathcal{H}}_{\rho }=M_{n\times d_{\rho }}(\mathbb{C})$ with the Hilbert-Schmidt inner product $⟨A,B⟩=\mathrm{tr}(A^{\ast }B)$ and the operatorIts operator norm is at most one, since $\rho (x)$ is a unitary matrix and $\Vert f(x){\Vert }_{\mathrm{op}}\le 1$. Thus all its singular values ${\lambda }_{\rho ,j}$ lie in $[0,1]$.

Two identities control their weighted moments:Here the expectation in $S_4$ is uniform on the $|G{|}^3$ solutions of the constraint, and the trace on ${\mathcal{H}}_{\rho }$ used to compute each moment is the ordinary operator trace. We justify the identities explicitly to fix their normalizations and the noncommutative order.

The adjoint operator is $T_{\rho }^{\ast }(A)={\mathbb{E}}_{y}f(y{)}^{\ast }A\rho (y)$, soFor rectangular matrices, the operator $A\mapsto LAR$ has trace $\mathrm{tr}(L)\mathrm{tr}(R)$, as is seen on the matrix-unit basis. Squaring the previous operator therefore givesThe required representation theory consists of unitarization of a finite-group representation, the Schur orthogonality relations, and the regular representation decomposition. The last gives the character expansion of the identity deltaSumming the two operator traces with weights $d_{\rho }$ selects $x=y$ in the first, and $w=x{y}^{-1}z$ in the second. Multiplication by $|G|$ converts each independent-variable expectation to its conditional expectation. This proves $S_2,S_4$. In particular $S_4$ is real and nonnegative, despite the apparently complex summands in its original formula. Since $S_4\le S_2\le n$, the nonvacuous hypothesis has $0<c\le 1$.

Select every singular value satisfying ${\lambda }_{\rho ,j}\ge \sqrt{c/2}$. Index the selected pairs by $p=1,\dots ,r$, set ${\rho }_p=\rho$, $n_p=d_{\rho }$, and choose unit right singular vectors $A_p$ and unit left singular vectors $B_p$ with $T_{{\rho }_p}{A}_p={\lambda }_p{B}_p$. DefineBoth are $n\times n_p$ matrices, proving (i). Repeated group representations in this list are literally the same chosen representative, rather than different equivalent realizations.

Use the Young–Jucys–Murphy elements in the group algebra $\mathbb{C}{S}_n$. Their joint spectrum isEquivalently one can use the regular representation, which contains every irreducible representation. The commuting elements are self-adjoint in a unitary representation, so there is a simultaneous eigenbasis.

A standard Young tableau has entries increasing along each row and down each column. If entry $r$ occupies cell $(i_r,j_r)$, its Content of a Young-diagram cell is $c_T(r)=j_r-i_r$. Define the set of content vectors of standard Young tableaux byThe shape here is a partition of an integer; it is not itself the vector of eigenvalues. For $n=1$ both sets consist of $(0)$.

Fix $\lambda ⊢n$ and $\rho ⊢n-1$. Write $\rho \nearrow \mu$ when a single addable node of a Young diagram turns $\rho$ into $\mu$. For each positive part ${\lambda }_i$, let ${\lambda }^{\downarrow i}$ be the partition of an integer obtained by decreasing that part by one, sorting, and omitting zeros. The Vershik linear relations areEqual row lengths must be counted separately on the right. Equivalently, if $c(\lambda ,\gamma )$ is the number of rows whose decrement produces $\gamma$, the right side is ${\sum }_{\gamma \nearrow \lambda }c(\lambda ,\gamma )M(\rho ,\gamma )$. There is no multiplicity coefficient on the left because irreducible restriction branching rule for a symmetric group is simple.

To prove the relations, restrict the Young permutation module $M^{\lambda }$ to the subgroup $S_{n-1}$ fixing $n$. The tabloids split into orbits of a group action according to which labeled row contains $n$. Removing that entry gives, for row $i$, the Young permutation module with composition $\lambda -e_i$, which is isomorphic to the one for its sorted partition. HenceIts $V^{\rho }$ multiplicity is the right side. On the other hand decompose $M^{\lambda }$ into irreducible representations first and apply the restriction branching rule for a symmetric group to each summand. Its $V^{\rho }$ multiplicity is then the left side. Equality proves the relation.

For example $\lambda =(2,2)$ restricts to $2M^{(2,1)}$, so the coefficient is two rather than one. For $\lambda =(1^n)$, the regular representation, the relation reduces to ${\sum }_{\mu :\rho \nearrow \mu }\dim V^{\mu }=n\dim V^{\rho }$. These checks emphasize why counting distinct resulting partitions without their row multiplicities would give a false recurrence.