Alphabeta Math
LemmaStatement: Literature-sourcedProof: Literature-sourcedPipeline-generatedprecheck pass
How statement and proof provenance work

The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.

  • Literature-sourced: the exact statement appears in a cited source; only wording and notation differ.
  • AI-adapted: a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
  • AI-generated: a genuinely novel statement formulated by AI, with no source for the claim itself.

These labels describe origin, not correctness: citations and verification chips remain separate evidence.

A smooth local diffeomorphism lifts canonically to the orientation double cover

Statement

Let M be a connected smooth n-manifold, π:M~→M its orientation double cover with deck transformation τ (The orientation double cover is canonically oriented and preserves closedness) and let f:M→M be a local diffeomorphism (Diffeomorphisms and local diffeomorphisms of manifolds), so that Dfx:TxM→Tf(x)M is an isomorphism for every x (The differential of a smooth map, The smooth inverse function theorem on manifolds). Then f~(x,ox):=(f(x), Dfx(ox)),f~′:=τ∘f~, define smooth maps M~→M~ with π∘f~=π∘f~′=f∘π, τ∘f~=f~∘τ and τ∘f~′=f~′∘τ; when M is nonorientable these are exactly the two lifts of f∘π through π (the total space M~ is then connected). If f is a diffeomorphism, so are f~ and f~′. The construction is canonical, i.e. it involves no choices.

Facts & Assumptions

Given: A connected smooth n-manifold M, its orientation double cover (M~,π,τ) and a local diffeomorphism f:M→M.

[F1]

M~={(x,ox)} is the set of rays ox in det⁡TxM, with π(x,ox)=x, τ(x,ox)=(x,−ox); over a chart (U,φ) of M the two sheets SU,φ±={(x,± sU,φ+(x)):x∈U} are charts with φ∘π as coordinate map, and π is a two-sheeted covering map (The orientation double cover is canonically oriented and preserves closedness).

[F2]

A local diffeomorphism is a smooth map that is a diffeomorphism from a neighbourhood of each point onto an open set, equivalently a smooth immersion of the same dimension; its differential is everywhere invertible, and an invertible linear map carries rays in the determinant line to rays (Diffeomorphisms and local diffeomorphisms of manifolds, The smooth inverse function theorem on manifolds, The differential of a smooth map, Oriented smooth manifolds and oriented charts).

Proof

1.1givenF1F2

The formula defines maps and the covering and commutation identities. For (x,ox)∈M~ the differential Dfx is an isomorphism by [F2], so Dfx(ox) is a ray in det⁡Tf(x)M and f~(x,ox):=(f(x),Dfx(ox)) is a point of M~; the inverse linear map sends the opposite ray to the opposite ray, so Dfx(−ox)=−Dfx(ox) and hence τf~=f~τ and τf~′=f~′τ from τ2=id. The identities π∘f~=π∘f~′=f∘π are the definitions, using [F1].

2.1step 1.1F1F2

Smoothness in the sheet charts. Let (U,φ) be a chart of M and (V,ψ) a chart of M with f(U)⊆V; write F^:=ψ∘f∘φ−1 on φ(U), so det⁡DF^u≠0 for all u by [F2] and u↦det⁡DF^u is continuous with locally constant sign. In the sheet charts of [F1] the point (x,sU,φ+(x)) is carried by f~ to the point whose ray is Dfx(sU,φ+(x))=dψf(x)−1(DF^φ(x)(standard ray)), which equals sign⁡det⁡DF^φ(x)⋅sV,ψ+(f(x)); hence the coordinate expression of f~ is (u,ϵ)↦(F^(u),sign⁡det⁡DF^u⋅ϵ), smooth because F^ is smooth and the sign is locally constant on φ(U). The expression for τf~ differs only by the locally constant factor −1 on the second coordinate, so f~′ is smooth too.

2.2step 1.1F1

Uniqueness of the two lifts. Suppose M is nonorientable, so that M~ is connected by [F1]; then π is a two-sheeted covering with connected total space and deck group {id,τ}. Let g:M~→M~ satisfy π∘g=f∘π. Then g and f~ both lift the map f∘π through π, so their difference is measured by a deck transformation: at each point, g(p)=f~(p) or g(p)=τf~(p), and continuity on the connected M~ makes the choice constant; hence g=f~ or g=τf~=f~′. The two are distinct because τ has no fixed point on M~, while f~′=f~ would force τ to fix every point of the nonempty set f~(M~).

3.1step 2.1step 1.1given∎

Diffeomorphisms lift to diffeomorphisms. If f is a diffeomorphism with inverse f−1, form f−1~ by the same construction, using the invertible differentials D(f−1)f(x)=(Dfx)−1 that follow from the chain rule for f−1∘f=idM (The chain rule for differentials of smooth maps); then f−1~∘f~(x,ox)=(x,(Dfx)−1(Dfx(ox)))=(x,ox) and likewise in the other order, so f~ is a bijection with smooth inverse f−1~ by step 2.1, hence a diffeomorphism; so is f~′=τ∘f~. The construction uses only the given map, its differential and the cover, so it is canonical.

Remarks

  • Local diffeomorphism is exactly the hypothesis under which the formula is defined. If Dfx is singular then Dfx(ox) is the zero element of det⁡Tf(x)M, not a ray, so (f(x),Dfx(ox)) is not a point of M~. Moreover a general smooth self-map of a nonorientable closed manifold need not lift to the orientation double cover at all: for M=RP2×S1 and f collapsing the first factor to a point while wrapping the second factor once around the projective line, the induced map on π1 sends the kernel of the orientation character outside that kernel, so the lifting criterion (Lifting criterion for maps from path-connected locally path-connected spaces) gives no lift. The transfer items on this page therefore carry the existence of a lift as an explicit hypothesis.
  • The orientable case. If M is nonempty and orientable, M~=M×Z/2 is disconnected and the formula produces only two of the four continuous lifts of f∘π; the mixed lifts that act by f~ on one component and τf~ on the other are never used, and the nonorientable case of the Lefschetz–Hopf formula is the only place where uniqueness of the two lifts is invoked. For M=∅, the orientation cover is empty and f∘π has exactly one lift; the two displayed formulas coincide with the unique empty map.

Depends on

Used by

Dependency tree · two levels

37 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.

Sources