Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Time-speed bound after reserving one moving-endpoint slot

Proved
AbelianTargets.FixedSlots.correctedCarry_path_time_lipschitz

by username · Oct 19, 2026 · Mathlib c5ea003 (Lean v4.30.0)

analysisarxiv-2609-39824-positivehomotopylipschitz

Let EEE be a real normed vector space, n∈Nn\in\mathbb Nn∈N, Δ≥0\Delta\ge0Δ≥0, F:[0,1]2→EF:[0,1]^2\to EF:[0,1]2→E, q∈Eq\in Eq∈E, and e:[0,1]→Ee:[0,1]\to Ee:[0,1]→E. Assume each path u↦F(r,u)u\mapsto F(r,u)u↦F(r,u) is Δ(n+1)\Delta(n+1)Δ(n+1)-Lipschitz, and

F(r,1)=q,∥q−e(r)∥≤Δ(r∈[0,1]).F(r,1)=q,\qquad \|q-e(r)\|\le\Delta\quad(r\in[0,1]).F(r,1)=q,∥q−e(r)∥≤Δ(r∈[0,1]).

Put an=(n+1)/(n+2)a_n=(n+1)/(n+2)an​=(n+1)/(n+2) and define

Cn(r,u)={F ⁣(r,n+2n+1u),u≤an,(1−t)q+t e(r),t=(n+2)u−(n+1),u>an.C_n(r,u)= \begin{cases} F\!\left(r,\dfrac{n+2}{n+1}u\right),&u\le a_n,\\ (1-t)q+t\,e(r),\quad t=(n+2)u-(n+1),&u>a_n. \end{cases}Cn​(r,u)=⎩⎨⎧​F(r,n+1n+2​u),(1−t)q+te(r),t=(n+2)u−(n+1),​u≤an​,u>an​.​

For every fixed rrr, the corrected path satisfies

∥Cn(r,u)−Cn(r,v)∥≤Δ(n+2)∣u−v∣.\|C_n(r,u)-C_n(r,v)\|\le\Delta(n+2)|u-v|.∥Cn​(r,u)−Cn​(r,v)∥≤Δ(n+2)∣u−v∣.

No regularity in the parameter rrr is required for this time-direction estimate.

Preamble
import Definitions.Def_AT260939824_CarrierCellRealization
import Definitions.Def_AT260939824_CarrierFanMoves
import Definitions.Def_AT260939824_CompressedWords
import Definitions.Def_AT260939824_DigitPathRealization
import Definitions.Def_AT260939824_EndpointCorrection
import Definitions.Def_AT260939824_FixedSlotInterpolation
import Definitions.Def_AT260939824_IntervalCarriers
import Definitions.Def_AT260939824_RelativePathContraction
import Definitions.Def_AT260939824_VariableRowFamilies
import Definitions.Def_AT260939824_WordPathHelpers
import Init
import Lean.Elab.Tactic.Omega
import Mathlib.Algebra.BigOperators.Group.List.Basic
import Mathlib.Algebra.Group.Conj
import Mathlib.Analysis.Convex.Basic
import Mathlib.Analysis.Normed.Affine.AddTorsor
import Mathlib.Analysis.Normed.Module.RCLike.Real
import Mathlib.Combinatorics.SimpleGraph.Maps
import Mathlib.Combinatorics.SimpleGraph.Walk.Maps
import Mathlib.Data.Finset.Prod
import Mathlib.Data.Finset.Union
import Mathlib.Data.Int.Interval
import Mathlib.Data.List.Basic
import Mathlib.Data.List.Chain
import Mathlib.Data.Nat.Log
import Mathlib.Tactic.FunProp
import Mathlib.Tactic.Linarith
import Mathlib.Tactic.Positivity
import Mathlib.Tactic.Ring
import Mathlib.Topology.Homotopy.Path
import Mathlib.Topology.MetricSpace.Lipschitz

set_option autoImplicit false

/-! Reserving the final path slot for a continuously moving endpoint. -/
namespace AbelianTargets.FixedSlots
end AbelianTargets.FixedSlots
open AbelianTargets
open AbelianTargets.FixedSlots
open scoped NNReal
variable {E : Type*} [NormedAddCommGroup E] [NormedSpace ℝ E]

Formal statement
theorem AbelianTargets.FixedSlots.correctedCarry_path_time_lipschitz (n : ℕ) (F : unitInterval × unitInterval → E)
    (q : E) (e : unitInterval → E) (Δ : ℝ≥0)
    (hF : ∀ r, LipschitzWith (Δ*(n+1)) (fun u : unitInterval => F (r,u)))
    (htarget : ∀ r, F (r,1) = q) (he : ∀ r, dist q (e r) ≤ Δ) (r : unitInterval) :
    LipschitzWith (Δ*(n+2)) (fun u : unitInterval => correctedCarry n F q e (r,u)) := by sorry
Source
Ruijun Wang, Continuous graph homomorphisms of higher dimensional abelian group actions, arXiv:2609.39824v1 (30 September 2026), Sections 2.5 and 4, fixed-slot moving-endpoint interpolation supporting Lemma 4.1; https://arxiv.org/html/2609.39824v1#S4. Auxiliary formalization result in original module AbelianTargets/EndpointCorrection.lean, authoritative declaration span lines 70-93, SHA-256 4096bae3a1eb6f9b5b92f3830f6071b8e6b16056e7f967981a805acf388d07e1. Frozen original source is local; no public repository URL or commit was available.

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me