Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Metric and face bounds after appending an edge

Definition
AT260939824_AppendedEdgeRows

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

arxiv-2609-39824arxiv-2609-39824-positivecombinatoricslean-formalizationtopology

Let vertices be realized by ι:V→E\iota:V\to Eι:V→E in a normed real space, with allowable finite faces represented by convex subsets of a target set SSS. A valid vertex row ending at ppp can be appended by a face edge {p,q}\{p,q\}{p,q}. The accompanying row and seam estimates retain the face-edge diameter bound Δ\DeltaΔ.

These lemmas provide the compatibility data for changing a row's moving endpoint without leaving its geometric carrier.

Definition code
import Definitions.Def_AT260939824_Actions
import Definitions.Def_AT260939824_BottomEdgeSplice
import Definitions.Def_AT260939824_CanonicalRows
import Definitions.Def_AT260939824_CarrierCellRealization
import Definitions.Def_AT260939824_CarrierFanMoves
import Definitions.Def_AT260939824_CarrierGeometry
import Definitions.Def_AT260939824_CompressedWords
import Definitions.Def_AT260939824_DigitPathRealization
import Definitions.Def_AT260939824_EndpointCorrection
import Definitions.Def_AT260939824_FixedRowRealization
import Definitions.Def_AT260939824_FixedSlotInterpolation
import Definitions.Def_AT260939824_IntervalCarriers
import Definitions.Def_AT260939824_JointCarrierRows
import Definitions.Def_AT260939824_PaddedRowCoordinates
import Definitions.Def_AT260939824_Probability
import Definitions.Def_AT260939824_RectangleHalfGluing
import Definitions.Def_AT260939824_RelativePathContraction
import Definitions.Def_AT260939824_Rounding
import Definitions.Def_AT260939824_RowSlotScaling
import Definitions.Def_AT260939824_RowValidity
import Definitions.Def_AT260939824_SupportGeometry
import Definitions.Def_AT260939824_SupportModel
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.Action.Basic
import Mathlib.Algebra.Group.Conj
import Mathlib.Algebra.Order.BigOperators.Group.Finset
import Mathlib.Analysis.Convex.Basic
import Mathlib.Analysis.Normed.Affine.AddTorsor
import Mathlib.Analysis.Normed.Module.RCLike.Real
import Mathlib.Combinatorics.SimpleGraph.Basic
import Mathlib.Combinatorics.SimpleGraph.Maps
import Mathlib.Combinatorics.SimpleGraph.Walk.Maps
import Mathlib.Data.Finset.Max
import Mathlib.Data.Finset.Powerset
import Mathlib.Data.Finset.Prod
import Mathlib.Data.Finset.Union
import Mathlib.Data.Fintype.Card
import Mathlib.Data.Int.Interval
import Mathlib.Data.List.Basic
import Mathlib.Data.List.Chain
import Mathlib.Data.Nat.Log
import Mathlib.Data.Real.Basic
import Mathlib.Tactic.FunProp
import Mathlib.Tactic.Linarith
import Mathlib.Tactic.NormNum
import Mathlib.Tactic.Positivity
import Mathlib.Tactic.Ring
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.Lipschitz
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

/-! The concrete row data used in the first half of a bottom-edge splice. -/

namespace AbelianTargets
open scoped NNReal
noncomputable section

variable {V E : Type*} [DecidableEq V] [NormedAddCommGroup E] [NormedSpace ℝ E]
variable {Face : Finset V → Prop}

theorem ValidRow.append_endpoint {w : List V} {p q : V} (h : ValidRow Face w)
    (hz : w.getLast? = some p) (hf : Face {p,q}) (hd : FaceDownward Face) :
    ValidRow Face (w++[q]) := by
  constructor
  · apply h.chain.append (.singleton q)
    intro a ha b hb
    have ha' : a = p := (by simpa only [hz,Option.mem_some_iff] using ha : p=a).symm
    have hb' : b = q := (by simpa only [List.head?_cons,Option.mem_some_iff] using hb : q=b).symm
    simpa only [ha',hb'] using hf
  · intro v hv
    simp only [List.mem_append,List.mem_singleton] at hv
    obtain hv | rfl := hv
    · exact h.vertices _ hv
    · exact hd hf (by intro a ha; have he := Finset.mem_singleton.mp ha; subst a; simp)

namespace FixedSlots

theorem listRow_edges (ι : V → E) {w : List V} {p : V}
    (hv : ValidRow Face w) (hz : w.getLast? = some p) (Δ : ℝ≥0)
    (hedge : ∀ a b, Face {a,b} → dist (ι a) (ι b) ≤ Δ) (j : ℕ) :
    dist (listRow ι p w j) (listRow ι p w (j+1)) ≤ Δ := by
  by_cases hj : j+1 < w.length
  · exact hedge _ _ (hv.edge_getD p j hj)
  · have h₀ := list_getD_terminal hz j (by omega)
    have h₁ := list_getD_terminal hz (j+1) (by omega)
    simp only [listRow,h₀,h₁,dist_self]
    exact Δ.property

theorem appended_seam_mem {F : Set E} (ι : V → E) {w : List V} {p q : V}
    (hz : w.getLast? = some p) (n : ℕ) (hF : Convex ℝ F)
    (hp : ι p ∈ F) (hq : ι q ∈ F) (j : ℕ) (hj : w.length-1 ≤ j) :
    appendRowEndpoint (listRow ι q (w++[q])) n (mix (ι p) (ι q) halfPoint) j ∈ F := by
  unfold appendRowEndpoint
  split
  · unfold listRow
    rw [getD_append_endpoint w p q]
    split
    · rw [list_getD_terminal hz j hj]
      exact hp
    · exact hq
  · exact mix_mem hF hp hq halfPoint

theorem appended_rows_charts (ι : V → E) {S : Set E} {Δ : ℝ≥0}
    (hc : FaceCharts Face ι S Δ) {w : List V} {p q : V}
    (hv : ValidRow Face w) (hz : w.getLast? = some p) (hf : Face {p,q})
    (n : ℕ) (hlen : w.length ≤ n+1) :
    ∀ j ≤ n+1, ∃ F : Set E, Convex ℝ F ∧ F ⊆ S ∧
      listRow ι p w j ∈ F ∧ listRow ι p w (j+1) ∈ F ∧
      appendRowEndpoint (listRow ι q (w++[q])) n (mix (ι p) (ι q) halfPoint) j ∈ F ∧
      appendRowEndpoint (listRow ι q (w++[q])) n (mix (ι p) (ι q) halfPoint) (j+1) ∈ F := by
  intro j hj
  by_cases hj' : j+1 < w.length
  · obtain ⟨F,hconv,hsub,hm⟩ := hc.chart _ (hv.edge_getD p j hj')
    have h₀ : appendRowEndpoint (listRow ι q (w++[q])) n
        (mix (ι p) (ι q) halfPoint) j = listRow ι p w j := by
      simp only [appendRowEndpoint,if_pos (show j ≤ n+1 by omega),listRow,
        getD_append_endpoint w p q,if_pos (show j < w.length by omega)]
    have h₁ : appendRowEndpoint (listRow ι q (w++[q])) n
        (mix (ι p) (ι q) halfPoint) (j+1) = listRow ι p w (j+1) := by
      simp only [appendRowEndpoint,if_pos (show j+1 ≤ n+1 by omega),listRow,
        getD_append_endpoint w p q,if_pos hj']
    refine ⟨F,hconv,hsub,hm _ (by simp),hm _ (by simp),?_,?_⟩
    · rw [h₀]; exact hm _ (by simp)
    · rw [h₁]; exact hm _ (by simp)
  · obtain ⟨F,hconv,hsub,hm⟩ := hc.chart _ hf
    have hp := hm p (by simp)
    have hq := hm q (by simp)
    refine ⟨F,hconv,hsub,?_,?_,appended_seam_mem ι hz n hconv hp hq j (by omega),
      appended_seam_mem ι hz n hconv hp hq (j+1) (by omega)⟩
    · simpa only [listRow,list_getD_terminal hz j (by omega)] using hp
    · simpa only [listRow,list_getD_terminal hz (j+1) (by omega)] using hp

theorem appended_seam_edges (ι : V → E) {S : Set E} {Δ : ℝ≥0}
    (hc : FaceCharts Face ι S Δ) {w : List V} {p q : V}
    (hv : ValidRow Face w) (hz : w.getLast? = some p) (hf : Face {p,q})
    (n : ℕ) (hlen : w.length ≤ n+1) : ∀ j ≤ n+1,
    dist (appendRowEndpoint (listRow ι q (w++[q])) n (mix (ι p) (ι q) halfPoint) j)
      (appendRowEndpoint (listRow ι q (w++[q])) n (mix (ι p) (ι q) halfPoint) (j+1)) ≤ Δ := by
  intro j hj
  by_cases hj' : j ≤ n
  · simp only [appendRowEndpoint,if_pos (show j ≤ n+1 by omega),
      if_pos (show j+1 ≤ n+1 by omega)]
    apply listRow_edges ι (hv.append_endpoint hz hf hc.downward) (by simp) Δ hc.edge_bound
  · have he : j = n+1 := by omega
    subst j
    simp only [appendRowEndpoint,if_pos (le_refl (n+1)),
      if_neg (show ¬n+1+1 ≤ n+1 by omega),listRow,getD_append_endpoint w p q,
      if_neg (show ¬n+1 < w.length by omega)]
    have h := (mix_lipschitz (ι p) (ι q) Δ (hc.edge_bound p q hf)).dist_le_mul 1 halfPoint
    rw [mix_one] at h
    exact h.trans (mul_le_of_le_one_right Δ.property (interval_dist_le_one _ _))

theorem appended_rows_corresponding_bound (ι : V → E) (C : ℝ≥0)
    (hC : ∀ a b, dist (ι a) (ι b) ≤ C) (w : List V) (p q : V) (n : ℕ) :
    ∀ j ≤ n+2, dist (listRow ι p w j)
      (appendRowEndpoint (listRow ι q (w++[q])) n (mix (ι p) (ι q) halfPoint) j) ≤ C := by
  intro j hj
  unfold appendRowEndpoint listRow
  split
  · exact hC _ _
  · have h := mix_dist_le_of_le (hC (w.getD j p) p) (hC (w.getD j p) q) halfPoint
    simpa only [mix_self] using h

end FixedSlots
end
end AbelianTargets
Source
Ruijun Wang, Continuous graph homomorphisms of higher dimensional abelian group actions, arXiv:2609.39824v1 (2026), Section(s) 4; https://arxiv.org/abs/2609.39824v1. This item is auxiliary infrastructure of the accompanying formalization, not a claim that each implementation definition is separately numbered in the paper. Original Lean module AbelianTargets/AppendedEdgeRows.lean, selected declaration lines 13-26, 30-39, 41-53, 55-83, 85-103, 105-114; SHA-256 06586fbeafbd040896871a1504c8a3267568ed11a4aba2f827b2cc70e8e8cd3f. Selected spans are from the final generated manifest. The original source snapshot 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