The support-space realization of a lifted walk commutes with shore swap
ProvedAbelianTargets.supportLiftPath_swaparxiv-2609-39824-positive
Let be a simple graph on a finite set , and choose with for every . Realize the bipartite double cover in the support space
Let , and let be the support-space path obtained by realizing the lift of a graph walk from sheet . Then
Preamble
import Definitions.Def_AT260939824_Actions
import Definitions.Def_AT260939824_DoubleCoverLifts
import Definitions.Def_AT260939824_DoubleCoverSupport
import Definitions.Def_AT260939824_Probability
import Definitions.Def_AT260939824_ReducedWalks
import Definitions.Def_AT260939824_Rounding
import Definitions.Def_AT260939824_SupportGeometry
import Definitions.Def_AT260939824_SupportModel
import Definitions.Def_AT260939824_SupportPathClasses
import Definitions.Def_AT260939824_TopologicalWalks
import Init
import Lean.Elab.Tactic.Omega
import Mathlib.Algebra.Group.Action.Basic
import Mathlib.Algebra.Order.BigOperators.Group.Finset
import Mathlib.Algebra.Ring.Parity
import Mathlib.AlgebraicTopology.FundamentalGroupoid.Basic
import Mathlib.Combinatorics.SimpleGraph.Basic
import Mathlib.Combinatorics.SimpleGraph.Bipartite
import Mathlib.Combinatorics.SimpleGraph.Maps
import Mathlib.Combinatorics.SimpleGraph.Walk.Maps
import Mathlib.Data.Finset.Max
import Mathlib.Data.Fintype.Card
import Mathlib.Data.Real.Basic
import Mathlib.Data.ZMod.Basic
import Mathlib.GroupTheory.OrderOfElement
import Mathlib.Tactic.FunProp
import Mathlib.Tactic.Linarith
import Mathlib.Tactic.NormNum
import Mathlib.Topology.Algebra.MulAction
import Mathlib.Topology.Compactness.Compact
import Mathlib.Topology.Constructions
import Mathlib.Topology.Homotopy.Path
import Mathlib.Topology.Instances.Real.Lemmas
import Mathlib.Topology.MetricSpace.Basic
import Mathlib.Topology.MetricSpace.Isometry
import Mathlib.Topology.MetricSpace.Polish
import Mathlib.Topology.MetricSpace.Pseudo.Pi
import Mathlib.Topology.Path
import Mathlib.Topology.Separation.Basic
import Mathlib.Topology.Separation.Profinite
import Mathlib.Topology.UniformSpace.HeineCantor
import Mathlib.Topology.UnitInterval
set_option autoImplicit false
/-!
# Binary lifts of graph walks
Walks lift to the bipartite double cover with the sheet determined by their
length parity. This is the combinatorial covering step in Lemma 6.2.
-/
namespace AbelianTargets
end AbelianTargets
open AbelianTargets
variable {V : Type*} (H : SimpleGraph V)
variable [Fintype V] (s : V → V) (hs : ∀ v, H.Adj v (s v))
set_option backward.isDefEq.respectTransparency false
Formal statement
theorem AbelianTargets.supportLiftPath_swap {a b : V} (p : H.Walk a b) (σ : Bool) (t : unitInterval) :
SupportPair.swap H (supportLiftPath H s hs p σ t) = supportLiftPath H s hs p (!σ) t := by sorry
Source
Ruijun Wang, Continuous graph homomorphisms of higher dimensional abelian group actions, arXiv:2609.39824v1 (30 September 2026), Sections 6–7, especially Lemma 6.2 and Proposition 7.1; https://arxiv.org/html/2609.39824v1. Formalization-specific helper: AbelianTargets/DoubleCoverLifts.lean, lines 213–227; SHA256 4311ba9768820c9fa97996e3bf22ab1083a0785c1abf4704e0e9ae338e35fa1f.