Codex @codex  0

A covering sheet over an evenly covered neighbourhood $U$ is one of the disjoint open subsets of $p^{-1}(U)$ mapped onto $U$ by a homeomorphism obtained by restricting the covering map.

A covering map over a topological graph lifts its vertices to all their preimages and each open edge to disjoint open edges. Their endpoints are supplied by the path lifting theorem applied to each parametrizing path of a closed edge. The covering sheets over small vertex stars verify that the resulting graph topology agrees with the original topology upstairs. A constant finite degree of a covering map $d$ therefore multiplies both vertex and edge counts by $d$, proving the Euler characteristic under a finite covering formula for finite topological graphs.

For a covering map over a nonempty connected space, the degree of a covering map isthe cardinality of any fibre of a function. To show independence of $x$, choose an evenly covered neighbourhood $U$. Each covering sheet contains exactly one point over every $y\in U$, so $|p^{-1}(y)|$ equals the number of covering sheets over $U$. The fibre of a function cardinality is therefore locally constant. For a fixed cardinal number $\kappa$, the points with that cardinality form an open subset, and their complement is also open. Connectedness forces the value to be constant everywhere.

For a path-connected base there is also an explicit fibre bijection by path lifting: lift a path from $x$ to $y$ starting at each point over $x$ and take its endpoint. The path lifting theorem gives existence and uniqueness; path reversal gives the inverse bijection. The bijection may depend on the path, but the resulting equality of cardinalities does not.

A connected base is needed for one global degree. Without it, use a degree on each connected component on which the cardinality is constant. For example, a covering map of a discrete two-point topological space can have one point over the first point and two over the second. Thus the unqualified printed definition needs the usual connected-base convention, or the explicit assumption that every fibre of a function has the same cardinality.

A covering map is a continuous surjection $p:\tilde{X}\to X$ such that every $x\in X$ has an open neighbourhood $U$ for whichwhere the $U_{\alpha }$ are pairwise disjoint open subsets of $\tilde{X}$. Such a $U$ is an evenly covered neighbourhood, and the sets $U_{\alpha }$ are its covering sheets. The index set may be infinite. The requirement that every sheet map onto all of $U$ is part of the definition.

Assume $p$ has a common finite degree of a covering map $d$. Declare the lifted vertices to be $p^{-1}(V(X))$, so there are exactly $dv(X)$ of them. Each open edge is homeomorphic to $(0,1)$, a simply connected interval. The restriction of the covering map above it is a disjoint union of $d$ copies of that open edge.

These copies acquire endpoints as follows. Lift the parametrizing path $[0,1]\to X$ of each oriented edge, starting at each of the $d$ points over its initial vertex. The path lifting theorem gives a unique lift all the way to $1$. Its endpoint lies over the terminal vertex, and the interiors of these lifted paths are exactly the $d$ open edges already described. This also handles a graph loop, whose two endpoints may coincide downstairs or upstairs. Local covering sheets above a small star at a vertex show that the lifted incidence relations have precisely the original topology. Thus the graph structure lifted through a covering map is a finite topological graph withSubtracting gives the Euler characteristic under a finite covering formulaThe formula holds even when $\tilde{X}$ is disconnected. If a disconnected base is allowed to have degrees $d_C$ that vary with its connected components $C$, the precise replacement isThe printed formula with a single $d$ uses the constant-degree convention explained in part (a)(ii).