Papers
Topics
Authors
Recent
Search
2000 character limit reached

Generalized Connes-Chern characters in KK-theory with an application to weak invariants of topological insulators

Published 28 Jun 2016 in math.OA, cond-mat.dis-nn, math-ph, math.KT, and math.MP | (1606.08897v2)

Abstract: We use constructive bounded Kasparov K-theory to investigate the numerical invariants stemming from the internal Kasparov products $K_i(\mathcal A) \times KKi(\mathcal A, \mathcal B) \rightarrow K_0(\mathcal B) \rightarrow \mathbb R$, $i=0,1$, where the last morphism is provided by a tracial state. For the class of properly defined finitely-summable Kasparov $(\mathcal A,\mathcal B)$-cycles, the invariants are given by the pairing of K-theory of $\mathcal B$ with an element of the periodic cyclic cohomology of $\mathcal B$, which we call the generalized Connes-Chern character. When $\mathcal A$ is a twisted crossed product of $\mathcal B$ by $\mathbb Zk$, $\mathcal A = \mathcal B \rtimes_\xi\theta \mathbb Zk$, we derive a local formula for the character corresponding to the fundamental class of a properly defined Dirac cycle. Furthermore, when $\mathcal B = C(\Omega) \rtimes_{\xi'}{\phi} \mathbb Zj$, with $C(\Omega)$ the algebra of continuous functions over a disorder configuration space, we show that the numerical invariants are connected to the weak topological invariants of the complex classes of topological insulators, defined in the physics literature. The end products are generalized index theorems for these weak invariants, which enable us to predict the range of the invariants and to identify regimes of strong disorder in which the invariants remain stable. The latter will be reported in a subsequent publication.

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.