Explore BrainMass
Share

Covering Maps : Let q: X->Y and r:Y->Z be covering maps; let p=(r(q(x))). Show if r^(-1)(z) is finite for each z in Z, p is a covering map.

This content was STOLEN from BrainMass.com - View the original, and get the already-completed solution here!

Let q: X->Y and r:Y->Z be covering maps; let p=(r(q(x))). Show if r^(-1)(z) is finite for each z in Z, p is a covering map.

© BrainMass Inc. brainmass.com October 24, 2018, 7:41 pm ad1c9bdddf
https://brainmass.com/math/finite-element-method/covering-maps-investigated-75956

Solution Preview

r o q is continuous and onto, as both these properties are preserved by
compositions. So only the "evenly covered bit" needs to be checked.
So fix z in Z. It has a neighbourhood U_z such that U_z is evenly covered
by finitely many open sets V_1,...,V_n and r, where r^-1(z) = {y_1,...,y_n}
and each y_i is in V_i. Each V_i is mapped ...

Solution Summary

Covering maps are investigated. The solution is detailed and well presented.

$2.19