Continuous Covering Maps Commute with Path Transport
ProvedMonodromy.Transport.transport_naturalityLet E,E′,X be topological spaces, p:E→X and q:E′→X covering maps, and h:E→E′ continuous with q∘h=p. For any x,y∈X, continuous path γ from x to y, and e∈p⁻¹({x}), transporting h(e) along γ in q’s covering equals h applied to the transport of e along γ in p’s covering. Both sides are points of q⁻¹({y}).
Statement dependencies: Monodromy.Transport.Fiber, Monodromy.Transport.mapFiber, Monodromy.Transport.transport.
Original proof dependencies: Monodromy.Transport.Fiber, Monodromy.Transport.continuous_lift_exists, Monodromy.Transport.mapFiber, Monodromy.Transport.transport, Monodromy.Transport.transport_eq_actual_lift.
Statement elaboration dependencies: Monodromy.Transport.Fiber, Monodromy.Transport.mapFiber, Monodromy.Transport.transport.
Proof elaboration dependencies: Monodromy.Transport.Fiber, Monodromy.Transport.continuous_lift_exists, Monodromy.Transport.mapFiber, Monodromy.Transport.transport, Monodromy.Transport.transport_eq_actual_lift.
module
public import Definitions.Def_Monodromy_Covering
public import Mathlib.Logic.Function.Conjugate
public import Mathlib.Tactic.FunProp
public import Mathlib.Topology.Homotopy.Lifting
@[expose] public section
open Monodromy
open Monodromy.Transport
open unitInterval
universe u v w
variable {E : Type u} {X : Type v}
variable [TopologicalSpace E] [TopologicalSpace X]
variable {p : E → X}
variable {E' : Type w} [TopologicalSpace E'] {q : E' → X}
theorem Monodromy.Transport.transport_naturality (cov : IsCoveringMap p) (cov' : IsCoveringMap q)
(h : C(E, E')) (square : q ∘ h = p) {x y : X}
(γ : Path x y) (e : Fiber p x) :
transport cov' γ (mapFiber h square e) =
mapFiber h square (transport cov γ e) := by sorry
Read-back
What the Lean code literally says, in plain math · OpenAI Codex (independent agent)
For arbitrary universe levels , arbitrary topological spaces of universe , of universe , and of universe , arbitrary functions and that are covering maps, and any continuous map satisfying , the following holds for all , every continuous path from to , and every point with : transport along through of equals applied to transport of along through , as elements of the fiber . The fibers mean the subspaces consisting of points mapping to the indicated basepoint, and transport is the endpoint action supplied by the actual continuous covering-space path lift, equivalently covering monodromy on the endpoint-preserving homotopy class of . No bijectivity of , nonempty-fiber assumption beyond the supplied , or restriction to loops is required; constant paths and empty ambient spaces to the extent permitted by the point arguments are included.
Confirmed by the mission captain (proposal self-audit).