Inductive LS cocategory and localisation (Q1942241): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
m rollbackEdits.php mass rollback
Tag: Rollback
Property / OpenAlex ID
 
Property / OpenAlex ID: W2024871656 / rank
Normal rank
 

Revision as of 17:58, 21 March 2024

scientific article
Language Label Description Also known as
English
Inductive LS cocategory and localisation
scientific article

    Statements

    Inductive LS cocategory and localisation (English)
    0 references
    0 references
    0 references
    18 March 2013
    0 references
    Let \(X[p]\) denote the \(p\)-localization and \(X[0]\) the rationalization of a space \(X\). Theorem 1. Let \(X\) be a finite-type 1-connected \(CW\)-complex. Then \(\mathrm{cat} X\leq \sup_p\{\mathrm{cat} X[p]\}+\mathrm{cat} X[0]\). The weaker inequality \(\mathrm{cat} X\leq 2\sup_p\{\mathrm{cat} X[p]\}\) was known before. The concept of cocategory, \(\mathrm{cocat} X\) is Eckman-Hilton dual to the notion of category and was introduced by \textit{T. Ganea} [Proc. Lond. Math. Soc. (3) 10, 623--639 (1960; Zbl 0101.15802)]. We have the following Theorem 2. Let \(X\) be a finite-type nilpotent \(CW\)-complex. Then \(\mathrm{cocat} X\leq \sup_p\{\mathrm{cocat} X[p]\}+\mathrm{cocat} X[0]\).
    0 references
    0 references
    0 references
    0 references
    0 references
    cocategory
    0 references
    localization
    0 references
    nilpotent space
    0 references