weak amenability of fourier algebras and spectral
play

Weak amenability of Fourier algebras and spectral synthesis of the - PowerPoint PPT Presentation

Weak amenability of Fourier algebras and spectral synthesis of the antidiagonal Nico Spronk (U. Waterloo) Joint work with Hun Hee Lee (Seoul National U.) Jean Ludwig (U. Lorraine Metz) Ebrahim Samei (U. Saskatchewan) Workshop on Recent


  1. Weak amenability of Fourier algebras and spectral synthesis of the antidiagonal Nico Spronk (U. Waterloo) Joint work with Hun Hee Lee (Seoul National U.) Jean Ludwig (U. Lorraine – Metz) Ebrahim Samei (U. Saskatchewan) Workshop on Recent Developments in Quantum Groups, Operator Algebras and Applications U. Ottawa February 5, 2015

  2. � ��� � ��� � �� Group and Fourier algebras G – locally compact group, m l , m r – left/right Haar measures L 1 ( G ) – group algebra, convolution product – predual of commutative ( L ∞ ( G ) , Γ , m l , m r ) A ( G ) – Fourier algebra, pointwise product in C 0 ( G ) – predual of co-commutative ( VN ( G ) , � Γ , ˆ m ) Generalized Pontryagin duality diagram: L ∞ ( G ) VN ( G ) � ◗◗◗◗◗◗◗◗◗◗◗◗◗ ♠ ♠ ♠ ♠ ♠ dual space ♠ dual space ♠ ♠ ♠ ♠ � � ♠ ♠ L 1 ( G ) A ( G ) A ( G ) ∼ = L 1 ( � In particular, G abelian ⇒ G ).

  3. Amenability A – Banach algebra, M –Banach A -bimodule H 1 ( A , M ) = { D ∈ B ( A , M ) : D ( ab ) = D ( a ) b + aD ( b ) } { a �→ ax − xa : x ∈ M} Definition [Johnson,‘73] A amenable if H 1 ( A , M ∗ ) = { 0 } , ∀ M ∗ – dual A -bimodule L 1 ( G ) Banach bimodules � bounded G -bimodules. Theorem [Johnson,‘73 &‘72] (i) L 1 ( G ) amenable ⇔ G amenable. (ii) A amenable ⇔ A admits b.a.d. (averaging net) Bounded approximate diagonal (b.a.d.): ( d α ) ⊂ A ˆ ⊗A mult( d α ) a → a and a ⊗ 1 · d α − d α · 1 ⊗ a → 0 .

  4. Weak amenability Theorem [Singer-Wermer ‘55] A commutative & semisimple ⇒ H 1 ( A , A ) = { 0 } . Definition [Bade-Curtis-Dales ‘87] A commutative. A weakly amenable if H 1 ( A , S ) = 0, ∀ symmetric bimodule S . Proposition [Bade-Curtis-Dales ‘87] A commutative. A weakly amenable ⇔ H 1 ( A , A ∗ ) = { 0 } . Theorem [Johnson, ‘91] H 1 ( L 1 ( G ) , L 1 ( G ) ∗ ) = { 0 } , i.e. L 1 ( G ) always “weakly amenable”.

  5. Weak amenability, operator (weak) amenability of A ( G ) Theorem [Johnson, ‘94] A ( SO (3)) not weakly amenable! Motivated completely bounded versions: Operator amenability: H 1 cb ( A ( G ) , M ∗ ) = { 0 } ∀ c.b. A ( G )-bimod. Operator weak amenability: H 1 cb ( A ( G ) , VN ( G )) = { 0 } All L 1 ( G ) results automatically completely bounded. Theorem [Ruan ‘95] A ( G ) operator amenable ⇔ G amenable. Theorem [S. ‘02, Samei ‘05] A ( G ) always operator weakly amenable

  6. When does weak amenability fail for A ( G )? Theorem [Forrest-Runde ‘05] (i) A ( G ) amenable ⇔ G virtually abelian. (ii) connected component G e abelian ⇒ A ( G ) w.a. Basic Observation Let H ≤ G be closed. (i) [McMullen ‘72, Herz ‘73, et al ] A ( G ) | H = A ( H ). (ii) [Bade-Curtis-Dales ‘87] A ( H ) not w.a. ⇒ A ( G ) not w.a. either. Hence, problem of w.a. for A ( G ) reduces to connected groups. The following connected groups known not to have w.a. A ( G ): • non-abelian compact [Forrest-Samei-S. ‘09] (after [Plymen ‘94]); • ax + b (hence non-compact semi-simple Lie), and reduced Heisenberg H r [Choi-Ghandehari ‘14]; • Heisenberg [Choi-Ghandehari ‘15]. Technique: use a Lie derivative to show H 1 ( A ( G ) , VN ( G )) � = { 0 } .

  7. Spectral and local synthesis A c ( G ) = { u ∈ A ( G ) : supp u compact } , A c ( G ) = A ( G ). A ( G ) regular: separation of compact sets form closed sets E ⊂ G closed. Define ideals I G ( E ) = { u ∈ A ( G ) : u | E = 0 } J G ( E ) = { u ∈ A c ( G ) : u | E = 0 } I 0 G ( E ) = { u ∈ A c ( G ) : supp u ∩ E = ∅ } so I 0 G ( E ) ⊆ J G ( E ) ⊆ I G ( E ) . Then E is of • spectral synthesis if I 0 G ( E ) = I G ( E ); • local synthesis (l.s.) if I 0 G ( E ) = J G ( E ). Concepts coincide if A ( G ) admits approximate identity. E.g. G has approximation property of Haagerup-Kraus.

  8. The role of spectral and local synthesis Proposition [Herz ‘73, Singer-Wermer ‘55] { e } spec’l synthesis ⇒ I G ( { e } ) 2 = I G ( { e } ) ⇔ H 1 ( A ( G ) , C ) = { 0 } . A ( G ) ♯ – unitization, m ♯ : A ( G ) ♯ ˆ ⊗ A ( G ) ♯ → A ( G ) ♯ , m : A ( G )ˆ ⊗ A ( G ) → A ( G ) multiplications Theorem [Grønbæk ‘89] A ( G ) w.a. ⇔ (ker m ) 2 = A ( G ) ⊗ A ( G ) · ker m ♯ Theorem [Forrest-Samei-S. ‘05] G SIN-group A ( G ) w.a. ⇔ ˇ ∆ G = { ( g , g − 1 ) : g ∈ G } loc. syn. for G × G Note: In [S. ‘02, Samei ‘05] spectral synthesis of ∆ G = { ( g , g ) : g ∈ G } for G × G ([Herz ‘73]) is used to show operator w.a. of A ( G ).

  9. Our main new idea [LLSS] Theorem G connected Lie group. A ( G ) w.a. ⇒ ˇ ∆ G = { ( g , g − 1 ) : g ∈ G } loc. syn. for G × G . Ideas: • [ A c ( G ) × A c ( G )] ∩ J G × G ( ˇ ∆ G ) = J G × G ( ˇ ∆ G ). • Use [Grønbæk ‘89] and calculations to show ∆ G ) m = J G × G ( ˇ J G × G ( ˇ ∆ G ) • [Park-Samei ‘09] (after [Ludwig-Turowska ‘09]) show that J G × G ( ˇ ∆ G ) is of local “weak” synthesis, whence of l.s. Warning: result quantitative, based on dim G . Theorem (i) H ≤ G connected, ˇ ∆ G l.s. for G × G ⇒ ˇ ∆ H l.s. for H × H (ii) Λ ⊳ G discrete, ˇ ∆ G l.s. for G × G ⇔ ˇ ∆ G / Λ l.s. G / Λ × G / Λ

  10. Five (classes of) groups to check Proposition (folklore) Each non-abelian Lie algebra g contains one of su (2) = � X , Y , Z : [ X , Y ] = 2 Z , [ Y , Z ] = 2 X , [ Z , X ] = 2 Y � f = � X , Y : [ X , Y ] = Y � e = � T , X 1 , X 2 : [ T , X 1 ] = X 2 , [ X 2 , T ] = X 1 , [ X 1 , X 2 ] = 0 � g θ = � T , X 1 , X 2 : [ T , X 1 ] = X 1 − θ X 2 , [ T , X 2 ] = θ X 1 + X 2 , [ X 1 , X 2 ] = 0 � , ( θ > 0) h = � X , Y , Z : [ X , Y ] = Z , [ Y , Z ] = 0 = [ X , Z ] � Hence every simply connected Lie group contains one of SU (2), F (affine motion), � E (2) (Euclidean motion, simply connected cover), G θ (Gr´ elaud), or H (Heisenberg).

  11. Basic strategy Goal: If G one of the five groups above, show that G × G ( ˇ ∆ G ) � J G × G ( ˇ I 0 ∆ G ) . Hence we find S in VN ( G ) for which S ⊥ I 0 G × G ( ˇ ∆ G ) but S �⊥ J G × G ( ˇ ∆ G ) . ( ♥ ) Proposition Suppose G is a connected Lie group, and there are X in g and v in L 1 ( G ) such that � ∂ ( X , 0) u ( g , g − 1 ) v ( g ) dg S X , v ∈ VN ( G × G ) , � S X , v , u � = G for u ∈ C ∞ c ( G ), then S X , v satisfies ( ♥ ). Remark: easier to show linear funct’l is bdd., than an operator.

  12. Basic strategy (continued) For each of our five basic groups pick a Lie derivative: • any, if su (2); • X ∈ n where g = n ⋊ a , if g = e , f , g θ ; • Z ∈ z (centre), if g = h . This is never a Lie derivative in a “quotient” direction. We work in the situation with easiest Plancherel for L 2 ( G ): • E (2) (1-parameter direct interval) and H r (almost atomic); • SU (2), F (atomic); G θ (1-parameter direct intergal). We have ad-hoc choices for v in L 1 ( G ), e.g. v = 1 for SU (2).

  13. The main result Theorem G connected Lie group. TFAE: (a) G abelian; (b) A ( G ) w.a.; and (c) ˇ ∆ G l.s. for G × G Corollary If G is locally compact, and contains non-abelian closed, connected, Lie subgroup, then A ( G ) not w.a. In particular, if G is Lie, A ( G ) w.a. ⇔ G e is abelian. Question: Does every non-abelian connected l.c. group contain a non-abelian closed, connected, Lie subgroup?

  14. A sufficient condition ... [Gleason, Yamambe, Montgomery-Zippin ‘50s] G connected ⇒ G pro-Lie: G = lim − N ց{ e } G / N , G / N Lie. ← [Hoffman-Morris ‘07] G connected, pro-Lie (l.c.) ∞ � G (0) = G , G ( n ) = [ G ( n − 1) , G ( n − 1) ] and G ( ∞ ) = G ( n ) . n =1 G is pro-solvable if G ( ∞ ) = { e } . Otherwise, � i ∈ I S i → G ( ∞ ) → � i ∈ I S i / Z ( S i ), S i semi-simple Lie. Proposition G not pro-solvable ⇒ G contains connected semi-simple Lie group. Question: Does a non-abelian (l.c.) pro-solvable G always contain a closed non-abelian connected Lie H ?

  15. ... which reduces us to “easy” cases “Big” reduced Heisenberg group [Cheng-Forrest-S. ‘13]: r = ( R × R ap ) ⋊R , ( y , ζ, x )( y ′ , ζ ′ , x ′ ) = ( y + y ′ , ζζ ′ η ( xy ′ ) , x + x ′ ) H where η : R → T R , η ( t ) = ( e iyt ) y ∈ R and R ap = η ( R ). Fact: the only non-trivial closed connected Lie subgroups are R × { 1 } × { 0 } and { 0 } × { 1 } × R . Questions r ) w.a.? (i) Is A ( H (ii) If G is l.c., non-abelian pro-solvable and connected, can A ( G ) be w.a.? Answer to (ii) will complete the characterization of w.a. for A ( G ).

  16. Thank-you! – Merci beaucoup!

Download Presentation
Download Policy: The content available on the website is offered to you 'AS IS' for your personal information and use only. It cannot be commercialized, licensed, or distributed on other websites without prior consent from the author. To download a presentation, simply click this link. If you encounter any difficulties during the download process, it's possible that the publisher has removed the file from their server.

Recommend


More recommend