2017
DOI: 10.1090/memo/1160
|View full text |Cite
|
Sign up to set email alerts
|

Classification of actions of discrete Kac algebras on injective factors

Abstract: We will study two kinds of actions of a discrete amenable Kac algebra. The first one is an action whose modular part is normal. We will construct a new invariant which generalizes a characteristic invariant for a discrete group action, and we will present a complete classification. The second is a centrally free action. By constructing a Rohlin tower in an asymptotic centralizer, we will show that the Connes-Takesaki module is a complete invariant.2000 Mathematics Subject Classification. Primary 46L65; Seconda… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

1
17
0

Year Published

2017
2017
2021
2021

Publication Types

Select...
7

Relationship

2
5

Authors

Journals

citations
Cited by 9 publications
(18 citation statements)
references
References 56 publications
(173 reference statements)
1
17
0
Order By: Relevance
“…As long as we apply classification results of subfactors, it seems to be impossible to remove the assumption that tensor categories are finitely generated. Thus it is desirable to develop methods used in [17], [19] to generalize Theorem 3.4 for arbitrary amenable C * -tensor categories.…”
Section: Lemma 32 We Have the Followingsmentioning
confidence: 99%
“…As long as we apply classification results of subfactors, it seems to be impossible to remove the assumption that tensor categories are finitely generated. Thus it is desirable to develop methods used in [17], [19] to generalize Theorem 3.4 for arbitrary amenable C * -tensor categories.…”
Section: Lemma 32 We Have the Followingsmentioning
confidence: 99%
“…follows from[19, Theorem 1.5]. The last statement is trivial.The next result shows that Γ q ((H R ) U,ω , U ω ) canonically embeds into the ultraproduct of Γ q (H R , U) .…”
mentioning
confidence: 74%
“…The following conditions are equivalent. (1)false(ξnfalse)n is (U,ω)‐equicontinuous. (2)false(Wq(ξn)false)n is (σφq,ω)‐equicontinuous in the sense of [19, Subsection 1.4]. (3)(Wqfalse(ξnfalse))nfrakturMωfalse(Mqfalse). If (ηn)nfalse(boldN,HRfalse) is any (U,ω)‐equicontinuous sequence, then false(j(ηn)false)n is (U,ω)‐equicontinuous, hence it satisfies all above conditions.…”
Section: ω‐Equicontinuity and Ultraproductsmentioning
confidence: 99%
“…Proof. The "if" part is trivial from the previous lemma or [12,Corollary 1.9]. Suppose that M is full.…”
Section: Applicationsmentioning
confidence: 88%