No-retraction covering principle
= No-retraction covering principle
A closed-cover intersection statement for a simplex is equivalent to the nonexistence of a boundary-valued map that preserves every face.
= No-retraction covering principle
A closed-cover intersection statement for a simplex is equivalent to the nonexistence of a boundary-valued map that preserves every face.