Open MathsAll courses
Positive maps and finite-dimensional approximation · Prerequisite proofs · Sources and terms

Group MASAs and singular affine examples

Written by GPT-6.1 Sol (OpenAI), Ultra. Course exposition: CC0-1.0 to the extent of rights held. Earlier programme and human-source notices retain their own terms.

A subgroup determines a Fourier-support projection in its group von Neumann algebra. Infinite conjugacy orbits characterize maximal abelianness. For affine groups, malnormality gives finite exceptional sets, and trace-norm estimates turn that group geometry into a proof of singularity for every unitary normalizer. Double cosets and independent coefficient tests describe further features of the same examples.

The regular-group operator foundations prove the regular commutant, faithful normal trace, Fourier-support test and subgroup expectation directly. Its H03 proves separable predual for a countable group, and H04 proves that an infinite-dimensional tracial factor has type II1\mathrm{II}_1. The group trace and expectation require no ICC hypothesis; ICC enters only in the factor conclusion.

The freely readable comparison is Sinclair–Smith, The Pukánszky invariant for masas in group von Neumann factors, Example 5.1, manuscript pp.15–17. Its rational affine groups satisfy a finite-set condition used there to invoke a stronger singularity criterion. The complete mixing and normalizer argument below proves ordinary singularity for every countably infinite field and every infinite dilation subgroup. For the group trace, regular commutation and trace expectation, see Anantharaman–Popa, An introduction to II₁ factors, §1.3.1, Lemma 1.3.4 through Proposition 1.3.9, and Theorem 9.1.2 with Remark 9.1.3. Their exact local constructions are linked in the foundations paragraph above.

1. Fourier coefficients and subgroup expectations

Let GG be a countable discrete group with identity ee. Our conventions are

λgδt=δgt,ρgδt=δtg−1,M=L(G)=λ(G)′′.(1)\lambda_g\delta_t=\delta_{gt},\qquad \rho_g\delta_t=\delta_{tg^{-1}},\qquad M=L(G)=\lambda(G)''. \tag{1}

Both are representations, and their operators commute. The vector δe\delta_e is cyclic for each. It is therefore separating for MM, and

τ(x)=⟨δe,xδe⟩(2)\tau(x)=\langle\delta_e,x\delta_e\rangle \tag{2}

is faithful and normal. The direct matrix calculation in G01 proves traciality for all bounded operators of MM. Inner products are linear in the second variable.

For x∈Mx\in M, define

x^(g)=τ(λg∗x),xδe=∑g∈Gx^(g)δg,∥x∥22=∑g∣x^(g)∣2.(3)\widehat x(g)=\tau(\lambda_g^*x),\qquad x\delta_e=\sum_{g\in G}\widehat x(g)\delta_g, \qquad \|x\|_2^2=\sum_g|\widehat x(g)|^2. \tag{3}

These are Hilbert-space expansions, not assertions of operator-norm Fourier convergence. In particular, τ(x∗y)=⟨xδe,yδe⟩\tau(x^*y)=\langle x\delta_e,y\delta_e\rangle, so trace Cauchy–Schwarz follows from Hilbert-space Cauchy–Schwarz.

For a subgroup HH, write A=L(H)⊂MA=L(H)\subset M. The subgroup compression proved in G04 gives the trace expectation EAE_A. On trace vectors it is the orthogonal projection onto Aδe‾=ℓ2(H)\overline{A\delta_e}=\ell^2(H). Consequently

EA(x)^(g)=1H(g)x^(g).(4)\widehat{E_A(x)}(g)=1_H(g)\widehat x(g). \tag{4}

In particular, a bounded operator of MM whose coefficients vanish outside HH lies in AA: it has the same vector at δe\delta_e as EA(x)E_A(x), and that vector determines the operator.

If every nonidentity conjugacy class of GG is infinite, a central operator has coefficients constant on those classes. Square summability kills all coefficients except the identity coefficient. Thus MM is a factor. For infinite GG, its group unitaries are an infinite orthonormal family in L2(M,τ)L^2(M,\tau), so the finite factor is infinite dimensional and has type II1\mathrm{II}_1.

2. The subgroup-orbit MASA criterion

Theorem 2.1. For an abelian subgroup H⊂GH\subset G, L(H)L(H) is maximal abelian in L(G)L(G) if and only if

{hgh−1:h∈H} is infinite for every g∉H.(5)\{hgh^{-1}:h\in H\}\text{ is infinite for every }g\notin H. \tag{5}

The theorem does not require that GG be ICC.

Proof. If x∈A′∩Mx\in A'\cap M, the equality λhxλh∗=x\lambda_hx\lambda_h^*=x makes its coefficients constant on the HH-conjugacy orbits. Under (5), (3) forces x^(g)=0\widehat x(g)=0 outside HH. Equation (4) gives x∈Ax\in A. Since AA is abelian, this is the MASA property.

Conversely suppose the orbit O\mathcal O of some g∉Hg\notin H is finite. The operator

s=∑t∈Oλt(6)s=\sum_{t\in\mathcal O}\lambda_t \tag{6}

commutes with every λh\lambda_h, because conjugation permutes its summands. It is nonzero, since sδes\delta_e is a nonzero finite sum of distinct basis vectors. None of those basis vectors belongs to ℓ2(H)\ell^2(H): if hgh−1∈Hhgh^{-1}\in H, then g∈Hg\in H. Hence s∉As\notin A, and AA is not maximal abelian. □\square

In an infinite group, this criterion immediately excludes finite abelian subgroups from being MASAs. Every orbit of a finite subgroup is finite, and the group has an element outside that subgroup.

3. Affine groups and malnormal dilations

Let KK be a countably infinite field and H⊂K×H\subset K^\times an infinite multiplicative subgroup. Use the same letter for its embedded dilation subgroup, and put

G=K⋊H={(a,b):a∈H, b∈K},(a,b)(c,d)=(ac,b+ad),H={(a,0):a∈H}.(7)G=K\rtimes H=\{(a,b):a\in H,\ b\in K\}, \qquad (a,b)(c,d)=(ac,b+ad), \qquad H=\{(a,0):a\in H\}. \tag{7}

The element (a,b)(a,b) represents the affine map t↦at+bt\mapsto at+b. Its inverse is (a−1,−a−1b)(a^{-1},-a^{-1}b).

Proposition 3.1. This group is ICC, and its dilation algebra A=L(H)A=L(H) is a MASA in the separable II1\mathrm{II}_1 factor L(G)L(G). Moreover,

hgk−1=g,g∉H, h,k∈H⟹h=k=e.(8)h g k^{-1}=g,\quad g\notin H,\ h,k\in H \quad\Longrightarrow\quad h=k=e. \tag{8}

Proof. Conjugation by a translation gives

(1,c)(a,b)(1,c)−1=(a,b+(1−a)c).(9)(1,c)(a,b)(1,c)^{-1}=(a,b+(1-a)c). \tag{9}

If a≠1a\ne1, this yields infinitely many conjugates as cc varies in KK. For a nonidentity translation (1,b)(1,b), conjugating by dilations gives (1,hb)(1,hb), h∈Hh\in H, an infinite set because b≠0b\ne0. This proves ICC.

For any g=(a,b)∉Hg=(a,b)\notin H, we have b≠0b\ne0, and its HH-conjugacy orbit contains all (a,hb)(a,hb). Theorem 2.1 gives the MASA conclusion. H03 proves separable predual from countability.

Finally, write h=(s,0)h=(s,0), k=(t,0)k=(t,0). The left side of (8) is (sa/t,sb)(sa/t,sb). Equality with (a,b)(a,b), with b≠0b\ne0, forces s=1s=1 and then t=1t=1. This is the malnormality condition H∩gHg−1={e}H\cap gHg^{-1}=\{e\}. □\square

The full affine group is the case H=K×H=K^\times. Keeping an arbitrary infinite dilation subgroup will also give all the finite multiplicities constructed in the field-tower lesson.

Singularity from malnormal mixing

A MASA A⊂MA\subset M is singular if every unitary uu satisfying uAu∗=AuAu^*=A belongs to AA.

Theorem 5.1. The affine dilation MASA of Proposition 3.1 is singular for every infinite H⊂K×H\subset K^\times.

Proof. We use the infinite abelian subgroup HH and its malnormality from Proposition 3.1. The subgroup expectation EAE_A is the bounded normal trace expectation of (4). It deletes the Fourier coefficients outside HH and is an orthogonal projection in trace 22-norm.

First fix s,t∈G∖Hs,t\in G\setminus H. There is at most one h∈Hh\in H with sht∈Hsht\in H. Indeed, if sh1tsh_1t and sh2tsh_2t both belong to HH, then

sh1h2−1s−1=(sh1t)(sh2t)−1∈H. s h_1h_2^{-1}s^{-1} =(sh_1t)(sh_2t)^{-1}\in H.

Thus h1h2−1∈H∩s−1Hs={e}h_1h_2^{-1}\in H\cap s^{-1}Hs=\{e\}, and h1=h2h_1=h_2. For finite sets S,T⊂G∖HS,T\subset G\setminus H, at most ∣S∣∣T∣|S||T| elements of HH can satisfy any of the conditions sht∈Hsht\in H. Consequently, for Fourier polynomials x0,y0x_0,y_0 supported respectively in S,TS,T,

EA(x0λhy0)=0outside a finite subset of H.(GM1) E_A(x_0\lambda_h y_0)=0 \quad\text{outside a finite subset of }H. \tag{GM1}

This is a statement about the whole expected operator, not just one of its coefficients.

We extend it to arbitrary bounded x,y∈Mx,y\in M with EA(x)=EA(y)=0E_A(x)=E_A(y)=0. Given η>0\eta>0, choose a finite Fourier polynomial y0y_0, supported outside HH, with

∥y−y0∥2<η2(1+∥x∥). \|y-y_0\|_2<\frac{\eta}{2(1+\|x\|)}.

Such polynomials exist by (3); the coefficients on HH vanish. The chosen polynomial is bounded, since its operator norm is at most the finite sum of the absolute values of its coefficients. After choosing it, choose another finite Fourier polynomial x0x_0, also supported outside HH, with

∥x−x0∥2<η2(1+∥y0∥). \|x-x_0\|_2<\frac{\eta}{2(1+\|y_0\|)}.

The order of these choices matters: no common operator-norm bound on the Fourier polynomials is needed.

The trace gives ∥ab∥2≤∥a∥∥b∥2\|ab\|_2\le\|a\|\|b\|_2 and ∥ab∥2≤∥a∥2∥b∥\|ab\|_2\le\|a\|_2\|b\|. The first follows from a∗a≤∥a∥21a^*a\le\|a\|^2 1 inside τ(b∗a∗ab)\tau(b^*a^*ab); the second follows by traciality from bb∗≤∥b∥21bb^*\le\|b\|^2 1. Using these estimates, unitary invariance of the 22-norm and contractivity of EAE_A in that norm gives, for every h∈Hh\in H,

∥EA(xλhy−x0λhy0)∥2≤∥x∥∥y−y0∥2+∥x−x0∥2∥y0∥<η.(GM2)\begin{aligned} \|E_A(x\lambda_h y-x_0\lambda_h y_0)\|_2 &\le \|x\|\|y-y_0\|_2 +\|x-x_0\|_2\|y_0\|\\ &<\eta. \end{aligned} \tag{GM2}

Combining (GM1) and (GM2) proves

∥EA(xλhy)∥2⟶0(h∈H, h⟶∞),(GM3) \|E_A(x\lambda_h y)\|_2\longrightarrow0 \qquad(h\in H,\ h\longrightarrow\infty), \tag{GM3}

where the limit means that every positive error bound holds outside a finite subset of HH. Infinitude of HH ensures that those complements are nonempty.

Now let u∈Mu\in M be a unitary with uAu∗=AuAu^*=A. Put

b=EA(u),a=u−b. b=E_A(u),\qquad a=u-b.

Then EA(a)=0E_A(a)=0, EA(a∗)=0E_A(a^*)=0, and ∥b∥≤1\|b\|\le1. For h∈Hh\in H, the normalizer identity puts uλhu∗u\lambda_hu^* in AA. Expanding u=b+au=b+a, bimodularity kills the two mixed terms:

uλhu∗=EA(uλhu∗)=bλhb∗+EA(aλha∗)=∣b∣2λh+EA(aλha∗).(GM4)\begin{aligned} u\lambda_hu^* &=E_A(u\lambda_hu^*)\\ &=b\lambda_hb^*+E_A(a\lambda_h a^*)\\ &=|b|^2\lambda_h+E_A(a\lambda_h a^*). \end{aligned} \tag{GM4}

The last equality uses the abelianness of AA. Equation (GM3) makes the last term tend to zero in 22-norm. The left side is unitary and has 22-norm one, whereas

∥∣b∣2λh∥2=∥b∗b∥2≤∥b∥∥b∥2≤∥b∥2. \||b|^2\lambda_h\|_2 =\|b^*b\|_2 \le\|b\|\|b\|_2 \le\|b\|_2.

It follows that 1≤∥b∥21\le\|b\|_2. Orthogonal projection contractivity gives the reverse inequality. The Pythagorean identity now yields

∥u−b∥22=∥u∥22−∥b∥22=0. \|u-b\|_2^2=\|u\|_2^2-\|b\|_2^2=0.

Faithfulness of the trace gives u=b∈Au=b\in A, proving singularity. □\square

The argument controls every unitary of L(G)L(G) that normalizes AA. The group calculation supplies the finite exceptional sets; the two successive Fourier approximations supply the bounded-operator limit. No classification, amenability, hyperfiniteness or stronger singularity criterion is used.

Double cosets of the affine action

Proposition 6.1. If [K×:H]=n[K^\times:H]=n, the double-coset set H\G/HH\backslash G/H has n+1n+1 elements: one is HH, and the others are indexed by K×/HK^\times/H.

Proof. Left and right dilation multiplication sends

(a,b)⟼(sa/t,sb),s,t∈H.(20)(a,b)\longmapsto(sa/t,sb),\qquad s,t\in H. \tag{20}

If b=0b=0, the element belongs to HH. If b≠0b\ne0, the multiplicative coset bHbH is unchanged. Conversely, for b′=sbb'=sb with s∈Hs\in H, choose t=sa/a′∈Ht=sa/a'\in H to carry (a,b)(a,b) to (a′,b′)(a',b'). Thus bHbH completely identifies the double coset. □\square

The number nn will become the homogeneous type I multiplicity of the left/right MASA commutant on the orthogonal complement of L2(A)L^2(A). The next lesson proves this and its invariance under isomorphisms of the ambient factors.

Independent finite-support coefficient tests

For finite-support functions, convolution and involution are

(x∗y)(r)=∑st=rx(s)y(t),x∗(s)=x(s−1)‾.(10)(x*y)(r)=\sum_{st=r}x(s)y(t),\qquad x^*(s)=\overline{x(s^{-1})}. \tag{10}

Thus λ(x∗)=λ(x)∗\lambda(x^*)=\lambda(x)^*. The complex conjugate in (10) is essential: it makes the adjoint coefficient products squared absolute values. The same involution appears in Anantharaman–Popa, Proposition 1.3.5, printed p. 7; this is the printed source referred to in Exercise 5.

Lemma 4.1. Let xx be supported by a finite set B⊂GB\subset G. Suppose g0,g1∈Gg_0,g_1\in G have the property

r−1g1r′=g1,r,r′∈Bg0−1⟹r=r′.(11)r^{-1}g_1r'=g_1,\quad r,r'\in Bg_0^{-1} \quad\Longrightarrow\quad r=r'. \tag{11}

Then the following coefficient is a nonnegative real number and satisfies

∣x(g0)∣2≤(x∗∗δg1∗x)(g0−1g1g0).(12)|x(g_0)|^2\le (x^**\delta_{g_1}*x)(g_0^{-1}g_1g_0). \tag{12}

Proof. Expand the right side as

∑s,t∈Bs−1g1t=g0−1g1g0x(s)‾x(t).(13)\sum_{\substack{s,t\in B\\s^{-1}g_1t=g_0^{-1}g_1g_0}} \overline{x(s)}x(t). \tag{13}

Putting r=sg0−1r=sg_0^{-1}, r′=tg0−1r'=tg_0^{-1} turns the constraint into (11). Hence every surviving pair has s=ts=t, and every surviving term is ∣x(s)∣2|x(s)|^2. The pair s=t=g0s=t=g_0 survives if g0∈Bg_0\in B. If it does not, x(g0)=0x(g_0)=0, and the same nonnegativity proves the inequality. □\square

Lemma 4.2. In the affine group (7), for every finite B⊂GB\subset G and g0∉Hg_0\notin H, there is g1∈Hg_1\in H such that

g0−1g1g0∉H,r−1g1r′=g1 (r,r′∈B)⟹r=r′.(14)g_0^{-1}g_1g_0\notin H, \qquad r^{-1}g_1r'=g_1\ (r,r'\in B)\Longrightarrow r=r'. \tag{14}

Proof. Write g1=(t,0)g_1=(t,0). For r=(a,b)r=(a,b), r′=(a′,b′)r'=(a',b'), the equation in (14) is equivalent to g1r′=rg1g_1r'=rg_1, hence to

a′=a,tb′=b.(15)a'=a,\qquad tb'=b. \tag{15}

For a distinct pair with a′=aa'=a, either it has no solution in K×K^\times, or it excludes just one value of tt. Only finitely many values are excluded by all pairs in BB.

If g0=(a0,b0)g_0=(a_0,b_0), b0≠0b_0\ne0, then

g0−1(t,0)g0=(t,a0−1(t−1)b0).(16)g_0^{-1}(t,0)g_0=(t,a_0^{-1}(t-1)b_0). \tag{16}

It lies outside HH whenever t≠1t\ne1. The infinite subgroup HH contains a value avoiding 11 and the finitely many pair exclusions. □\square

To use Lemma 4.1, apply Lemma 4.2 to Bg0−1Bg_0^{-1}. This translated support, rather than BB itself, is exactly the support required in (11).

7. Exercises with complete solutions

Exercise 1. Why does (4) characterize membership in L(H)L(H) for bounded operators, rather than merely describe a subspace of ℓ2(G)\ell^2(G)?

Solution. The trace expectation produces a bounded element EA(x)∈AE_A(x)\in A, with its vector equal to the orthogonal projection of xδex\delta_e. If the latter is already supported on HH, then (x−EA(x))δe=0(x-E_A(x))\delta_e=0. The vector δe\delta_e is separating for MM, so x=EA(x)x=E_A(x). The existence of a vector supported on HH alone would not assert boundedness of its convolution operator; the argument starts with x∈Mx\in M.

Exercise 2. Let GG be abelian and H⊊GH\subsetneq G. Use Theorem 2.1 to decide whether L(H)L(H) is a MASA in L(G)L(G).

Solution. Every subgroup conjugacy orbit is a singleton. Any g∉Hg\notin H violates (5), and λg\lambda_g is a commuting operator outside L(H)L(H). Hence the subalgebra is not maximal abelian. This agrees with the fact that the entire ambient algebra is abelian.

Exercise 3. For K=QK=\mathbb Q, compute the conjugates of (2,3)(2,3) by translations and of (1,3)(1,3) by nonzero rational dilations.

Solution. Formula (9) gives (2,3−c)(2,3-c) for c∈Qc\in\mathbb Q, all distinct. Dilation conjugation gives (1,3h)(1,3h), h∈Q×h\in\mathbb Q^\times, also all distinct. These verify the two ICC cases separately.

Exercise 4. Derive the malnormality statement (8) directly from the affine multiplication law.

Solution. For g=(a,b)g=(a,b), b≠0b\ne0, and h=(s,0)h=(s,0), k=(t,0)k=(t,0), we obtain hgk−1=(sa/t,sb)hgk^{-1}=(sa/t,sb). Equality forces (s−1)b=0(s-1)b=0, so s=1s=1. The first coordinate then gives a/t=aa/t=a, hence t=1t=1. This uses only the field property and the fact that a,b≠0a,b\ne0.

Exercise 5. Explain why omitting conjugation from the involution in (10) destroys the squared-coefficient estimate, even for a support with one element.

Solution. Take x=iδg0x=i\delta_{g_0}. The correct involution produces (−i)i=1(-i)i=1 in the coefficient at g0−1g1g0g_0^{-1}g_1g_0. Without conjugation, the product would be i2=−1i^2=-1, which cannot bound ∣x(g0)∣2=1|x(g_0)|^2=1 from above as in (12). The printed source uses the conjugated involution.

Exercise 6. In the rational affine group, let B={(1,1),(1,2),(2,0)}B=\{(1,1),(1,2),(2,0)\}. Find the forbidden dilation parameters coming from distinct-pair collisions in (15), and choose an admissible parameter with t≠1t\ne1.

Solution. Only the two elements with first coordinate 11 can collide. Their ordered pairs exclude t=1/2t=1/2 and t=2t=2. The element with first coordinate 22 has no distinct partner with that first coordinate. Thus t=3t=3 avoids those values and 11. For any g0∉Hg_0\notin H, (16) then lies outside HH.

Here the stated parameter 33 is available in the full rational affine group, H=Q×H=\mathbb Q^\times. For an arbitrary dilation subgroup containing this support, its element (2,0)(2,0) forces 2∈H2\in H, hence 4∈H4\in H. The parameter t=4t=4 then avoids the same three forbidden values and supplies an admissible choice even when 3∉H3\notin H.

Exercise 7. Check the first bound in (18) for the term τ(v∗xB∗w(u−xB))\tau(v^*x_B^*w(u-x_B)).

Solution. Write the term as τ((xBv)∗w(u−xB))\tau((x_Bv)^*w(u-x_B)). Cauchy–Schwarz bounds it by ∥xBv∥2∥w(u−xB)∥2=∥xB∥2δB\|x_Bv\|_2\|w(u-x_B)\|_2=\|x_B\|_2\delta_B. For the other term, cyclicity gives τ((u−xB)∗wuv∗)\tau((u-x_B)^*wu v^*), bounded by δB∥u∥2\delta_B\|u\|_2. Both equalities use unitary invariance of the trace norm.

Exercise 8. Fix a unitary normalizer uu and g0∉Hg_0\notin H. For each finite Fourier truncation xBx_B from (17), choose g1g_1 by Lemma 4.2 for Bg0−1Bg_0^{-1}. Prove that these choices may vary with BB, while their coefficient estimates still force u^(g0)=0\widehat u(g_0)=0.

Solution. Put r0=g0−1g1g0∉Hr_0=g_0^{-1}g_1g_0\notin H. The inverse normalizer relation gives u∗λg1u∈Au^*\lambda_{g_1}u\in A, so its r0r_0-coefficient is zero. Lemma 4.1 and the uniform estimate (18), with v=λr0v=\lambda_{r_0} and w=λg1w=\lambda_{g_1}, give

∣u^(g0)∣2≤xB∗λg1xB^(r0)≤2∥u−xB∥2.(19) |\widehat u(g_0)|^2 \le\widehat{x_B^*\lambda_{g_1}x_B}(r_0) \le 2\|u-x_B\|_2. \tag{19}

The middle coefficient is real and nonnegative. The first inequality retains the fixed g0g_0-coefficient because g0∈Bg_0\in B; the second is uniform in both group unitaries, even when they change with the truncation. Fourier square summability makes the final bound tend to zero. This proves the claimed vanishing without choosing one parameter that works for every support.

Exercise 9. For the full affine group over a countably infinite field, compute the double-coset count and the normalizer algebra of its dilation MASA.

Solution. Here H=K×H=K^\times has index 11, so Proposition 6.1 gives exactly two double cosets, HH and the set of elements with nonzero translation coordinate. Theorem 5.1 says every unitary normalizer lies in AA. Conversely every unitary of the abelian algebra AA normalizes it, and those unitaries generate AA. Hence the normalizer algebra is AA, not a factor.

Exercise 10. Suppose H⊂K×H\subset K^\times has finite index in an infinite field. Prove that HH is infinite, and identify which parts of the arguments require finite index.

Solution. If HH were finite, its finitely many cosets would make K×K^\times finite, contrary to infinitude of KK. ICC, malnormality, the MASA criterion and singularity use only that HH is infinite. Finite index enters solely to make the double-coset count a prescribed finite number n+1n+1. The same proof works with an infinite double-coset count when the index is infinite.

References

Lajos Pukánszky, On Maximal Abelian Subrings of Factors of Type II₁, Canadian Journal of Mathematics 12 (1960), 289–296. Lemma 3, p. 293, uses the affine conjugation and finite excluded-parameter mechanism; Lemmas 4–5, pp. 293–296, connect regular product representations and multiplicative index to double cosets.

Allan M. Sinclair and Roger R. Smith, The Pukánszky invariant for masas in group von Neumann factors, author-hosted manuscript of the 2005 Illinois Journal of Mathematics article, 49, 325–343. Example 5.1, manuscript pp. 15–17, gives the rational affine construction, trivial off-subgroup stabilizers and double-coset count. Its singularity route invokes a stronger externally cited criterion. The malnormal-mixing proof above writes out finite exceptional sets, two successive bounded Fourier approximations and the subgroup-expectation normalizer calculation, proving ordinary singularity at the stated general field hypotheses.

Sorin Popa, Orthogonal pairs of subalgebras in finite factors, INCREST preprint 89/1981, October 1981. Lemma 1.3 and the opening of §2, printed pp. 2–3 (PDF pp. 6–7), prove normalizer confinement using orthogonality for malnormal subgroups. Theorem 2.1, printed pp. 3–4, is a subfactor construction that uses the rational full affine group as an auxiliary group.

Claire Anantharaman and Sorin Popa, An introduction to II1 factors, author-hosted draft. §1.3.1, printed pp. 6–9 (PDF pp. 12–15), develops the group trace, convolution adjoint, regular commutation and ICC criterion; Theorem 9.1.2 and Remark 9.1.3, printed p. 140 (PDF p. 146), prove the trace expectation and its orthogonal-projection interpretation. The subgroup-orbit criterion and the extension to arbitrary infinite dilation subgroups are proved above in full.

Bounded subgroup operators and normalizers

The subgroup algebra in (4) is the actual algebra on ℓ2(G)\ell^2(G), not just a copy of its Hilbert space. G03 identifies it through the right-coset amplification

ιH(b)=⨁HtUtbUt∗,Utδh=δht.\iota_H(b)=\bigoplus_{Ht}U_t bU_t^*, \qquad U_t\delta_h=\delta_{ht}.

Every block has norm ∥b∥\|b\|, and restricting to the identity coset gives the reverse norm inequality. Thus this amplification is an isometric unital star homomorphism. The full block-commutant calculation in G03 identifies its range with λG(H)′′\lambda_G(H)''. In G04, compression of x∈L(G)x\in L(G) to ℓ2(H)\ell^2(H) commutes with the right regular representation of HH; G00 puts that compression in L(H)L(H). Amplifying it gives the bounded operator EA(x)E_A(x), with EA(x)δe=PHxδeE_A(x)\delta_e=P_Hx\delta_e. Compression and amplification preserve positivity at every matrix level. Their series-vector pullbacks prove ultraweak continuity, and the identity vector proves trace preservation and faithfulness. These complete arguments establish the expectation used in (4) without the general positive-cone theorem for arbitrary finite subalgebras.

For an abelian subgroup, AA really is abelian under the double-commutant definition. Put S=λ(H)S=\lambda(H). Commutativity gives S⊂S′S\subset S', hence S′′⊂S′S''\subset S'. If x,y∈S′′x,y\in S'', then x∈S′x\in S' and yy commutes with every element of S′S'. Therefore xy=yxxy=yx. Also an operator commuting with SS commutes with all of S′′S'': it belongs to S′S', whose elements commute with S′′S'' by definition. This justifies both directions of the orbit argument without assuming an operator-norm Fourier approximation. G01 supplies the trace for all bounded operators, G02 supplies the square-summable coefficients, and H03 and H04 supply respectively the separable predual and the infinite-dimensional finite-factor classification used in Proposition 3.1.

The finite exclusions in Lemma 4.2 work in every characteristic. For an ordered distinct pair (a,b),(a′,b′)(a,b),(a',b'), different first coordinates give no collision. With equal first coordinates, b′=0b'=0 permits a collision only if b=0b=0, which would make the pair equal; if b′≠0b'\ne0, the only possible parameter is t=b/b′t=b/b'. There are at most ∣B∣(∣B∣−1)|B|(|B|-1) parameters from distinct ordered pairs. Removing those and 11 from the infinite set HH leaves an admissible parameter. The same argument applies to the finite translated set Bg0−1Bg_0^{-1}. It uses no ordering of the field, no assumption of characteristic zero and no finite-index hypothesis.

The independent coefficient tests use the following uniform trace estimate. For a unitary uu, choose finite sets BB exhausting GG, and put

xB=∑s∈Bu^(s)λs,δB=∥u−xB∥2⟶0,∥xB∥2≤1.(17) x_B=\sum_{s\in B}\widehat u(s)\lambda_s,\qquad \delta_B=\|u-x_B\|_2\longrightarrow0,\qquad \|x_B\|_2\le1. \tag{17}

Each xBx_B is bounded because ∥xB∥≤∑s∈B∣u^(s)∣<∞\|x_B\|\le\sum_{s\in B}|\widehat u(s)|<\infty. No common bound on these operator norms is used. For arbitrary group unitaries v,wv,w,

∣τ(v∗(u∗wu−xB∗wxB))∣≤δB(∥u∥2+∥xB∥2)≤2δB.(18) \left|\tau\bigl(v^*(u^*wu-x_B^*wx_B)\bigr)\right| \le\delta_B(\|u\|_2+\|x_B\|_2) \le2\delta_B. \tag{18}

To prove it, expand the difference as (u−xB)∗wu+xB∗w(u−xB)(u-x_B)^*wu+x_B^*w(u-x_B). Cyclicity turns the first trace term into the Hilbert pairing of u−xBu-x_B with wuv∗wuv^*, whose 22-norm is ∥u∥2\|u\|_2. The second trace term is exactly

τ((xBv)∗w(u−xB)), \tau\bigl((x_Bv)^*w(u-x_B)\bigr),

whose absolute value is at most ∥xB∥2δB\|x_B\|_2\delta_B. Trace Cauchy–Schwarz and unitary invariance give both estimates independently of v,wv,w. The inverse normalizer relation used in Exercise 8 follows by multiplying uAu∗=AuAu^*=A by u∗u^* and uu, giving u∗Au=Au^*Au=A. Thus this coefficient argument has all its bounded-operator and norm inputs even when the selected group elements vary.

Finally the unitaries of AA generate AA. If h=h∗∈Ah=h^*\in A is a contraction, continuous functional calculus gives v=h+i(1−h2)1/2∈Av=h+i(1-h^2)^{1/2}\in A. Its two factors commute, so vv∗=v∗v=1vv^*=v^*v=1, and h=(v+v∗)/2h=(v+v^*)/2. Scaling and taking real and imaginary parts expresses every element as a linear combination of unitaries. Theorem 5.1 therefore makes the entire normalizer algebra equal to AA, as used in Exercise 9. The double-coset calculation has no hidden finiteness requirement: (a,b)(a,b), with a∈Ha\in H, is carried to (1,b)(1,b) by taking s=1,t=as=1,t=a in (20). Nonzero representatives are consequently classified exactly by bHbH, for finite or infinite multiplicative index.