Commuting Squares and Relative Entropy for Two Subfactors
β Scribed by Y. Watatani; J. Wierzbicki
- Publisher
- Elsevier Science
- Year
- 1995
- Tongue
- English
- Weight
- 366 KB
- Volume
- 133
- Category
- Article
- ISSN
- 0022-1236
No coin nor oath required. For personal study only.
β¦ Synopsis
We compute Connes-StΓΆrmer relative entropy (H(M \mid N)) for two subfactors (M) and (N) of a type (\mathrm{II}_{1}) factor without assuming (N \subset M). If they form a commuting square, then we have (H(M \mid N)=H(M \mid M \cap N)). If their commutants form a commuting square, then we have (H(M \mid N)=H(M \vee N \mid N)). 1995 Academic Press. Inc.
π SIMILAR VOLUMES
In this paper, we derive some upper bounds for the relative entropy D(p 11 q) of two probability distribution and apply them to mutual information and entropy mapping. To achieve this, we use an inequality for the logarithm function, (2.3) below, and some classical inequalities such as the Kantorovi
To test a possible relation between topological entropy and Arnold complexity, and to provide a nontrivial examples of rational dynamical zeta functions, we introduce a two-parameter family of discrete birational mappings of two complex variables. We conjecture rational expressions with integer coef