- The paper establishes completely bounded Lp-boundedness for Hilbert transforms when the graph has uniformly bounded links and vertex algebras have uniformly bounded finite dimensions.
- It replaces the failed classical Cotlar identity with a generalized identity above the graph-dependent length threshold 3N, then combines it with Haagerup-type inequalities to obtain bounds for all 1<p<∞.
- The results apply to graph products of finite groups, right-angled Hecke von Neumann algebras, and compact quantum groups, while providing new positive cases of Ozawa’s compactness problem.
This paper develops the theory of Hilbert transforms on graph products of finite von Neumann algebras, establishing their Lp-boundedness for 1<p<∞ under a Haagerup-type inequality, and applies the results to Ozawa's compactness problem (2607.00194). The work extends the free-product theory of Mei and Ricard (Wand et al., 2016) to a setting that simultaneously generalizes free products and tensor products, where the key technical obstruction is that reduced operators no longer have uniquely determined initial syllables due to commutation relations.
Let Γ=(VΓ,EΓ) be a simplicial graph and (Ms,φs)s∈VΓ finite von Neumann algebras with normal faithful tracial states. The graph product MΓ is again finite, since the graph product state is tracial by a result of Młotkowski. Reduced operators a=a1⋯an (with ai∈Msi∘ and s1⋯sn a reduced word of the right-angled Coxeter group WΓ) span a dense ∗-subalgebra, and the length 1<p<∞0 is well defined.
Because of braid relations, a reduced operator may admit several equivalent reduced expressions, so the initial syllable is not intrinsic. The authors therefore distinguish two families of 1<p<∞1-orthogonal projections: 1<p<∞2, projecting onto reduced operators whose every equivalent reduced expression begins with 1<p<∞3, and 1<p<∞4 for cliques 1<p<∞5, projecting onto operators whose maximal clique prefix 1<p<∞6 has type 1<p<∞7. The Hilbert transform is then
1<p<∞8
with an adjoint-flipped variant 1<p<∞9. A second family Γ=(VΓ,EΓ)0, depending on the first Γ=(VΓ,EΓ)1 blocks, partitions operators of length at least Γ=(VΓ,EΓ)2 according to their length-Γ=(VΓ,EΓ)3 prefix, with a residual class Γ=(VΓ,EΓ)4. When Γ=(VΓ,EΓ)5 has no edges, Γ=(VΓ,EΓ)6 reduces to the Mei–Ricard free Hilbert transform.
Failure of the Cotlar identity and the generalized version
The Cotlar identity Γ=(VΓ,EΓ)7 underlying the classical proof of Γ=(VΓ,EΓ)8-boundedness fails in general for graph products. The paper gives an explicit counterexample: with reduced operators of types Γ=(VΓ,EΓ)9 and (Ms,φs)s∈VΓ0 over a path (Ms,φs)s∈VΓ1–(Ms,φs)s∈VΓ2–(Ms,φs)s∈VΓ3–(Ms,φs)s∈VΓ4, the coefficient identity at the level of (Ms,φs)s∈VΓ5 requires (Ms,φs)s∈VΓ6, which fails for generic signs. The obstruction is precisely the non-uniqueness of reduced expressions.
The repair is a generalized Cotlar identity, valid only after projecting onto operators of length exceeding (Ms,φs)s∈VΓ7, where (Ms,φs)s∈VΓ8 bounds (Ms,φs)s∈VΓ9 over MΓ0 (condition (Fi)):
MΓ1
The proof rests on a factorization lemma for products of reduced operators (an operator-algebraic analogue of a result of Ciobanu–Holt–Rees): writing MΓ2 and MΓ3, the commutative core MΓ4 has length at most MΓ5 under (Fi), so whenever the product has length MΓ6, one of the outer factors has length MΓ7, forcing the maximal clique prefix to be determined by that factor alone and the identity to hold. For graph products of groups, a simpler direct proof via the group-theoretic lemma yields the identity for group elements MΓ8 with MΓ9. When a=a1⋯an0 has no edges (a=a1⋯an1), this recovers the Mei–Ricard Cotlar identity exactly.
Boundedness and the Haagerup-type inequality
The abstract bootstrap theorem is clean: any a=a1⋯an2-bounded a=a1⋯an3 satisfying the generalized Cotlar identity with respect to a=a1⋯an4 is bounded on a=a1⋯an5 for all a=a1⋯an6, provided a=a1⋯an7 extends boundedly from a=a1⋯an8 to a=a1⋯an9. The proof runs the Cotlar recursion from ai∈Msi∘0 to ai∈Msi∘1 and concludes by duality and interpolation, with an explicit bound ai∈Msi∘2 at each doubling step.
The remaining hypothesis is characterized in three equivalent ways: ai∈Msi∘3 is ultracontractive; ai∈Msi∘4 is a graph product of finite-dimensional algebras with ai∈Msi∘5; and ai∈Msi∘6 satisfies a Haagerup-type inequality, i.e., each homogeneous projection ai∈Msi∘7 is bounded from ai∈Msi∘8 to ai∈Msi∘9 with polynomial dependence on s1⋯sn0. The implication (ii)s1⋯sn1(iii) is proved via a length-additivity lemma (s1⋯sn2 forces s1⋯sn3) and a Cauchy–Schwarz argument yielding complete boundedness of s1⋯sn4 with polynomial cb-norm. This equivalence is a strengthening of Caspers–Klisse–Larsen's Khintchine-based proof of the Haagerup inequality for graph product Hecke algebras, and it avoids Khintchine inequalities entirely. Consequently:
- Theorem B: under (Fi) and the uniform finite-dimensionality condition, s1⋯sn5 and s1⋯sn6 are bounded on s1⋯sn7 for all s1⋯sn8, with completely bounded versions also holding.
- Theorem C: the block-dependent transforms s1⋯sn9 and WΓ0 satisfy the generalized Cotlar identity modulo WΓ1 and are WΓ2-bounded.
A corollary gives Khintchine-type estimates for the families WΓ3 in the mixed column-row norm of Pisier's noncommutative vector-valued WΓ4-spaces.
Classes of examples
The framework covers three notable families. Graph products of finite groups WΓ5 with WΓ6: here the Haagerup-type inequality coincides with property (RD) of WΓ7 with respect to the block length, and the paper's equivalence shows (RD) for the block length holds exactly when the vertex groups are finite with uniformly bounded orders. Right-angled Hecke von Neumann algebras WΓ8 for arbitrary multiparameters WΓ9: the paper proves the polynomial estimate ∗0 for graphs satisfying (Fi), extending the finite-graph result of Caspers–Klisse–Larsen and giving a Khintchine-free proof. Graph products of compact quantum groups of Kac type: under (RD) assumptions on the vertex duals and clique duals, the three formulations (matrix-coefficient estimates, Fourier-side (RD), and the ∗1-estimate) are shown equivalent, again yielding ∗2-bounded Hilbert transforms.
Application to Ozawa's compactness problem
Ozawa asked whether, for ∗3, the commutator of ∗4 with the projection ∗5 onto words ending in a fixed ∗6 maps the unit ball to an ∗7-compact set. The paper answers this affirmatively in two new settings: for graph products of finite groups satisfying the uniform cardinality bound, and for right-angled Hecke von Neumann algebras. The key commutator estimate is that ∗8 and ∗9 have finite rank, vanishing on all 1<p<∞00 with 1<p<∞01 (respectively 1<p<∞02); finiteness of the low-length part uses finiteness of the vertex groups. Combined with Hölder's inequality and Theorem C, this yields that 1<p<∞03 maps the unit ball of 1<p<∞04 (or 1<p<∞05) into a compact subset of 1<p<∞06 for every 1<p<∞07 in the 1<p<∞08-space, 1<p<∞09. Since graph products of finite groups over non-affine irreducible Coxeter systems are ICC, and certain right-angled Hecke von Neumann algebras are 1<p<∞10 factors by Garncarek's factoriality criterion, this produces new instances of Ozawa's phenomenon beyond free group factors.
Limitations and open questions
Several hypotheses constrain the scope of the results. The graph must satisfy (Fi), i.e., uniformly bounded vertex degrees; the paper does not treat graphs with unbounded links. The boundedness theorem requires finite-dimensionality of the vertex algebras with uniformly bounded dimensions, which the equivalence shows is not merely technical but necessary for the ultracontractivity route—though the authors note the free-product case (1<p<∞11) requires no such assumption. The theory is developed for tracial (finite) von Neumann algebras; the authors state that the arguments should extend to type III with suitable modifications, but this is carried out only in remark form. Finally, the generalized Cotlar identity holds only above a length threshold 1<p<∞12 (or 1<p<∞13), and the paper leaves open the question of whether an unconditional identity, or a threshold-free argument via other means, is possible in the presence of commutation relations.
Conclusion
The paper establishes that Hilbert transforms on graph products of finite von Neumann algebras are 1<p<∞14-bounded for 1<p<∞15, provided the graph has uniformly bounded links and the vertex algebras are finite-dimensional of uniformly bounded dimension. The two structural innovations—a generalized Cotlar identity valid above a graph-determined length threshold, and the equivalence between ultracontractivity of the low-length projection and a Haagerup-type inequality—are of independent interest and give a new, Khintchine-free route to rapid decay for graph products. The resulting positive answers to Ozawa's compactness problem for graph products of finite groups and right-angled Hecke von Neumann algebras extend the known examples from free group factors to a substantially broader class of 1<p<∞16 factors.