2006
DOI: 10.1515/crelle.2006.077
|View full text |Cite
|
Sign up to set email alerts
|

Khintchine type inequalities for reduced free products and applications

Abstract: We prove Khintchine type inequalities for words of a fixed length in a reduced free product of C * -algebras (or von Neumann algebras). These inequalities imply that the natural projection from a reduced free product onto the subspace generated by the words of a fixed length d is completely bounded with norm depending linearly on d. We then apply these results to various approximation properties on reduced free products. As a first application, we give a quick proof of Dykema's theorem on the stability of exac… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

2
87
0

Year Published

2009
2009
2023
2023

Publication Types

Select...
8

Relationship

0
8

Authors

Journals

citations
Cited by 50 publications
(89 citation statements)
references
References 25 publications
(42 reference statements)
2
87
0
Order By: Relevance
“…We could also prove the backward implication of the above theorem using Lemma 7.25 and the equivalence of conditions (i) and (iii) in Theorem 7.18. Indeed, let [35] that weak amenability (with the Cowling-Haagerup constant equal 1) is preserved under taking free products of discrete quantum groups, extending a result of E. Ricard and Q. Xu for discrete groups [66].…”
Section: Thementioning
confidence: 94%
“…We could also prove the backward implication of the above theorem using Lemma 7.25 and the equivalence of conditions (i) and (iii) in Theorem 7.18. Indeed, let [35] that weak amenability (with the Cowling-Haagerup constant equal 1) is preserved under taking free products of discrete quantum groups, extending a result of E. Ricard and Q. Xu for discrete groups [66].…”
Section: Thementioning
confidence: 94%
“…We can now sketch the proof of the next theorem, inspired by Ricard and Xu's proof in [23], Proof sketch. If A and B are weakly amenable, then we have two sequences consisting of finitely supported completely bounded functions {f n A } and {f n B } which go to the identity and whose cb-norms go to one as n goes to infinity.…”
Section: The Completely Bounded Casementioning
confidence: 99%
“…Let K 1 be the Sidon constant for E and K 2 that for F. By Remark 3.2, we may assume that 1 / ∈ E and 1 / ∈ F. Now for any x ∈ Pol E (G 1 * G 2 ) and y ∈ Pol F (G 1 * G 2 ), we have h 1 (x) = 0, h 2 (y) = 0, and x and y are free. Then it is well known and easy to see from the construction of reduced free products that max{ x ∞ , y ∞ } ≤ x + y ∞ (see [Voi98,Jun05,RX06] for more information on the norm estimates related to freeness). Hence…”
Section: Sidon Setsmentioning
confidence: 99%