Computations in rational sectional category (Q888714): Difference between revisions

The \(n^{th}\) topological complexity of a space \(X\), \(TC_n(X)\) defined by Farber, is the sectional category of the diagonal map \(\Delta : X\to X^n\). To approximate \(TC_n(X)\), Carrasquel gives first new upper bounds for the rational sectional category of a map \(f\), i.e. for the sectional category of its rationalization. Denote by \(\varphi : (A,d)\to (B,d)\) a surjective Sullivan model of \(f\) and by \(K\) its kernel. Then for each integer \(n\), denote by \(\rho_n\) the projection \((A,d)\to (A/K^n,d)\). The integer \(sc(f)\) is the first integer \(n\) such that \(\rho_n\) admits a homotopy retraction. Then Carrasquel proves that secat \((f_0)\leq sc(f)\). The text contains also the computation of the rational topological complexity of some specific spaces. In particular for a formal space we have \(TC_n(X_0) \geq TC_2(X_0) + (n-2) \text{cat}(X_0)\), where \(X_0\) denotes the rationalization of \(X\).