Algorithmic solvability of the lifting-extension problem (Q2358826): Difference between revisions
From MaRDI portal
Latest revision as of 23:29, 13 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Algorithmic solvability of the lifting-extension problem |
scientific article |
Statements
Algorithmic solvability of the lifting-extension problem (English)
0 references
16 June 2017
0 references
The extension problem is the following one: Given a map \(f:A\to Y\) and an inclusion \(i:A\to X\), find an \(l:X\to Y\) such that \(l|A = f\). Then \(l\) is an extension of \(f\). The lifting problem is the following one: Given a map \(g:X\to B\) and an onto map \(\psi:Y\to B\), find an \(l:X\to Y\) such that \(\psi \circ l =g\). Then \(l\) is a lifting of \(g\). If \(g\circ i = \psi\circ f\), then the simultaneous existence of \(l\) represents a solution to the extension-lifting problem. Let \(A\), \(X\), \(Y\) and \(B\) be finite simplicial complexes equipped with a free simplicial action of a finite group \(G\); let \(A\) be an equivariant subcomplex of \(X\) and let \(f\), \(g\) be equivariant simplicial maps, \(\psi\) an equivariant fibration, \(g\circ i = \psi\circ f. \) Assume that \(Y\) is \(d\)-connected, \(d\geq 1\) and \(\operatorname{dim}X\leq 2d+1.\) The authors prove that there is an algorithm that decides the existence of a continuous equivariant map \(X\to Y.\) If such a map exists and \(\operatorname{dim}X\leq 2d\), then the obtained algorithm computes the set \([X,Y]\) of all equivariant homotopy classes of equivariant continuous maps \(X\to Y.\) In order to prove this result the authors generalize the extension-lifting problem and use a series of different structures including Moore-Postnikov towers.
0 references
equivariant
0 references
homotopy classes
0 references
lifting-extension problem
0 references
equivariant fiberwise
0 references
algorithmic computation
0 references
embeddability
0 references
Moore-Postnikov tower
0 references
simplicial complexes
0 references
0 references