通用包络交通空间中的刚性结构
Rigid structures in the universal enveloping traffic space
摘要：
对于任何迹非交换概率空间$(\mathcal{A}, φ)$，Cébron、Dahlqvist和Male表明，人们总是可以构造一个扩展迹的包围交通空间$(\mathcal{G}(\mathcal{A}), τ_φ)$。这种构造提供了一个泛对象，允许人们在一般情况下诉诸交通概率框架，优先考虑对其结构的理解。本文证明了$(\mathcal{G}(\mathcal{A}), τ_φ)$允许一个标准自由积分解$\mathcal{A} * \mathcal{A}^\intercal * Θ(\mathcal{G}(\mathcal{A}))$ .特别地，$\mathcal{A}^\intercal$是$\mathcal{A}$的反同构副本，并且直到退化，$Θ(\mathcal{G}(\mathcal{A}))$是由高斯随机变量生成的具有由图形操作对角化的协方差结构的交换代数。如果$(\mathcal{A}, φ)$本身是一个自由产品，那么我们描述这个附加结构如何提升为$(\mathcal{G}(\mathcal{A}), τ_φ)$。在这里，我们发现自由独立性和经典独立性之间的联系与通常的方向相反。退化，我们进一步表明，$(\mathcal{G}(\mathcal{A}), τ_φ)$是由树状图操作跨越。最后，我们将我们的结果应用于大（可能相关）随机矩阵的研究。我们的分析依赖于仙人掌图的组合数学和由此产生的仙人掌累积量对应。
英文摘要：
For any tracial non-commutative probability space $(\mathcal{A}, φ)$, Cébron, Dahlqvist, and Male showed that one can always construct an enveloping traffic space $(\mathcal{G}(\mathcal{A}), τ_φ)$ that extends the trace. This construction provides a universal object that allows one to appeal to the traffic probability framework in generic situations, prioritizing an understanding of its structure. In this article, we prove that $(\mathcal{G}(\mathcal{A}), τ_φ)$ admits a canonical free product decomposition $\mathcal{A} * \mathcal{A}^\intercal * Θ(\mathcal{G}(\mathcal{A}))$. In particular, $\mathcal{A}^\intercal$ is an anti-isomorphic copy of $\mathcal{A}$, and $Θ(\mathcal{G}(\mathcal{A}))$ is, up to degeneracy, a commutative algebra generated by Gaussian random variables with a covariance structure diagonalized by the graph operations. If $(\mathcal{A}, φ)$ itself is a free product, then we describe how this additional structure lifts into $(\mathcal{G}(\mathcal{A}), τ_φ)$. Here, we find a connection between free independence and classical independence opposite the usual direction. Up to degeneracy, we further show that $(\mathcal{G}(\mathcal{A}), τ_φ)$ is spanned by tree-like graph operations. Finally, we apply our results to the study of large (possibly dependent) random matrices. Our analysis relies on the combinatorics of cactus graphs and the resulting cactus-cumulant correspondence.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
