Search arXiv⌕ Search

arXiv · 0704.1987

Pure inductive limit state and Kolmogorov's property

Abstract

Let $(\clb,λ_t,ψ)$ be a $C^*$-dynamical system where $(λ_t: t \in \IT_+)$ be a semigroup of injective endomorphism and $ψ$ be an $(λ_t)$ invariant state on the $C^*$ subalgebra $\clb$ and $\IT_+$ is either non-negative integers or real numbers. The central aim of this exposition is to find a useful criteria for the inductive limit state $\clb \raro^{λ_t} \clb$ canonically associated with $ψ$ to be pure. We achieve this by exploring the minimal weak forward and backward Markov processes associated with the Markov semigroup on the corner von-Neumann algebra of the support projection of the state $ψ$ to prove that Kolmogorov's property [Mo2] of the Markov semigroup is a sufficient condition for the inductive state to be pure. As an application of this criteria we find a sufficient condition for a translation invariant factor state on a one dimensional quantum spin chain to be pure. This criteria in a sense complements criteria obtained in [BJKW,Mo2] as we could go beyond lattice symmetric states.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Anilesh Mohari. 2007-04-16. Pure inductive limit state and Kolmogorov's property. https://arxiv.org/abs/0704.1987

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

The Hao-Ng isomorphism theorem for reduced crossed products

We prove the Hao-Ng isomorphism for reduced crossed products by locally compact Hausdorff groups. More precisely, for a non-degenerate $\mathrm{C}^*$-correspondence $X$ and a generalized gauge action $G \curvearrowright X$ by a locally compact Hausdorff group $G$, we prove the commutation ${\mathcal{O}}_{X\rtimes_rG}\cong {\mathcal{O}}_X\rtimes_rG$ of the reduced crossed product with the Cuntz-Pimsner C*-algebra construction. Our proof shows how such commutations with reduced crossed products can follow from more general principles in non-self-adjoint crossed product theory.

math.OA↗

Operator Norm Bounds for Multi-leg Matrix Tensors and Applications to Random Matrix Theory

We study the extremal values of multi-leg traces of matrix tensors under operator norm constraints. A graphical representation gives upper and lower bounds expressed as powers of the common tensor-factor dimension. The lower bounds are attained by matrices that permute tensor factors and are exact within this family. We prove the bounds first for two tensor factors and then for an arbitrary number. Leaving some indices uncontracted produces matrices for which we obtain both moment and operator norm bounds; a single choice of coefficient matrices attains the lower bounds for every positive integer moment. We also obtain exact scalar and operator norm maxima in special cases with sufficiently many tensor factors sharing the same cyclic contraction. As an application, the operator norm bounds yield a uniform comparison between Ginibre products and their free circular counterparts with growing matrix coefficients.

math.OA↗

On ultraproduct approximations and property (T) factors

We introduce a framework allowing for key aspects of deformation/rigidity theory to be used in the study of continuous model theory of II$_1$ factors. Using this framework, we solve several well-known open problems in the area. For example, we show that the group von Neumann algebras $L(\operatorname{SL}_3(\mathbb Z))$ and $L \mathbb F_2$ are not elementarily equivalent, and we show that the group von Neumann algebra $L\mathbb F_2$ is not pseudomatricial. We also show a Bass-Serre type strong rigidity result in the setting of ultraproducts to provide an infinite family of pairwise non-elementarily equivalent full factors, each of which embeds into an ultraproduct of the hyperfinite II$_1$ factor. Building on previous work of Boutonnet, Chifan and Ioana, we also provide a continuum of pairwise non-elementarily equivalent full factors, which can be taken to be group von Neumann algebras.

math.OA↗