A bottom-edge splice has a finite joint Lipschitz bound
ProvedAbelianTargets.FixedSlots.BottomSpliceData.family_joint_lipschitzLet be a real normed vector space, , , , and . Consider bottom-splice data consisting of a left row of vertices from to , source and target rows of vertices from to , and an endpoint-fixed homotopy between their affine row paths. Assume all left-row and seam-row edges have length at most , where the seam row appends to the source row; each corresponding pair of row edges lies in a convex subset of ; corresponding row vertices have a common finite distance bound; and lie in a convex subset of ; takes values in , has path-time Lipschitz bound , and has some finite joint Lipschitz bound. The splice family uses the affine interpolation from the left row to the seam row in its first half and the corrected carry of , with endpoint , in its second half. With the maximum metric on , there exists such that
import Definitions.Def_AT260939824_BottomEdgeSplice
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_RectangleHalfGluing
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
/-! The complete moving-endpoint family across one bottom edge. -/
namespace AbelianTargets.FixedSlots
end AbelianTargets.FixedSlots
open AbelianTargets
open AbelianTargets.FixedSlots
open scoped NNReal
variable {E : Type*} [NormedAddCommGroup E] [NormedSpace ℝ E]
namespace AbelianTargets.FixedSlots.BottomSpliceData
end AbelianTargets.FixedSlots.BottomSpliceData
open AbelianTargets
open AbelianTargets.FixedSlots
open AbelianTargets.FixedSlots.BottomSpliceData
variable {n : ℕ} {base p q : E} {S : Set E} {Δ : ℝ≥0}
variable (D : BottomSpliceData n base p q S Δ)
theorem AbelianTargets.FixedSlots.BottomSpliceData.family_joint_lipschitz : ∃ J : ℝ≥0, LipschitzWith J D.family := by sorry