Foliation groupoids and their cyclic homology (Q5929055)

From MaRDI portal
scientific article; zbMATH DE number 1588064
Language Label Description Also known as
English
Foliation groupoids and their cyclic homology
scientific article; zbMATH DE number 1588064

    Statements

    Foliation groupoids and their cyclic homology (English)
    0 references
    0 references
    0 references
    22 July 2002
    0 references
    A groupoid \(G\) is a small category in which every arrow is invertible. The tangent spaces of \(s^{-1}(x)\) at \(1_x\), \(s\) being the source map relative to \(G\), constitute a bundle \({\mathfrak g}\) over the set of objects \(G_0\) of \(G\) and the differential of the target map relative to \(G\) induces a map of vector bundles \( \alpha: {\mathfrak g} \rightarrow TG_0\) called the anchor map of \(G\). The paper is devoted to prove two results. First, one gives three equivalent statements for a smooth groupoid \(G\) which are: (1) \(G\) is Morita equivalent to a smooth étale groupoid. (2) The Lie algebroid \({\mathfrak g}\) of \(G\) has an injective anchor map. (3) All isotropy Lie groups of \(G\) are discrete. Notice that since Lie algebroids with injective anchor map are exactly foliations, the above result asserts that a Lie groupoid is equivalent to an étale one exactly when it integrates a foliation. For this reason, the authors call these groupoids foliation groupoids. Finally, the second result of the paper states that equivalent foliation groupoids have isomorphic Hochschild, cyclic and periodic cyclic homology groups. The proof provides explicit isomorphisms.
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    Lie groupoid
    0 references
    étale groupoid
    0 references
    foliation groupoid
    0 references
    cyclic homology of a groupoid
    0 references
    anchor map
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references