Every Circle Loop Translates All Logarithm Sheets by One Common Integer
ProvedMonodromy.Logarithm.transport_translationFor every continuous loop γ in the circle based at 1 and every integer k, let n_γ be the integer label of the exponential-covering transport of sheet 0 along γ, where sheet k is the real lift coordinate 2πk. Then transporting sheet k along γ gives sheet(k+n_γ). Thus the same loop displacement applies to all integer sheets, including negative k.
Statement dependencies: Monodromy.Logarithm.Memory, Monodromy.Logarithm.integers, Monodromy.Logarithm.sheet, Monodromy.Transport.Fiber, Monodromy.Transport.transport.
Original proof dependencies: Monodromy.Logarithm.Memory, Monodromy.Logarithm.integers, Monodromy.Logarithm.sheet, Monodromy.Transport.Fiber, Monodromy.Transport.mapFiber, Monodromy.Transport.transport, Monodromy.Transport.transport_naturality.
Statement elaboration dependencies: Monodromy.Logarithm.Memory, Monodromy.Logarithm.integers, Monodromy.Logarithm.sheet, Monodromy.Transport.Fiber, Monodromy.Transport.transport.
Proof elaboration dependencies: Monodromy.Logarithm.Memory, Monodromy.Logarithm.integers, Monodromy.Logarithm.sheet, Monodromy.Transport.Fiber, Monodromy.Transport.mapFiber, Monodromy.Transport.transport, Monodromy.Transport.transport_naturality.
module public import Definitions.Def_Monodromy_Logarithm public import Lean.Elab.Tactic.Omega public import Mathlib.Analysis.Analytic.Constructions public import Mathlib.Analysis.Complex.CoveringMap public import Mathlib.Analysis.Real.Pi.Bounds public import Mathlib.Analysis.SpecialFunctions.Complex.Circle public import Mathlib.Logic.Function.Conjugate public import Mathlib.Tactic.FunProp public import Mathlib.Tactic.Linarith public import Mathlib.Tactic.Ring public import Mathlib.Topology.Homotopy.Lifting @[expose] public section open Monodromy open Monodromy.Logarithm open unitInterval
theorem Monodromy.Logarithm.transport_translation (γ : Path (1 : Circle) 1) (k : ℤ) :
Transport.transport Circle.isCoveringMap_exp γ (sheet k) =
sheet (k + integers.symm
(Transport.transport Circle.isCoveringMap_exp γ (sheet 0))) := by sorry
Read-back
What the Lean code literally says, in plain math · OpenAI Codex (independent agent)
For every continuous loop based at and every integer , transport through the covering , , starting at ends at , where is the unique integer such that transport along the same loop starting at ends at . Here the fiber is the set of real numbers projecting to , its specified integer parametrization sends to , and its inverse is used to obtain from the transported zero sheet; transport is the endpoint action of the actual continuous covering-space lift, expressed via the path's endpoint-fixed homotopy class. No restriction on the integer or the loop's differentiability, winding sign or simplicity is assumed, so negative sheets and constant loops are included. The formula compares these two transports for the same loop and does not impose an independent integer parameter for its winding.
Confirmed by the mission captain (proposal self-audit).