Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Cube-boundary bounds from coordinate-face estimates

Definition
AT260939824_CubeFaceCoordinateBounds

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

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

Let D,CjD,C_jD,Cj​ be nonnegative constants, and let fff map the maximum-norm unit sphere in Rι\mathbb R^\iotaRι into a pseudometric space, with image diameter at most DDD. If changing only coordinate jjj within a fixed face changes the image distance by at most CjC_jCj​ times that coordinate change, then

Lip⁡(f)≤2∑j∈ιCj+D.\operatorname{Lip}(f)\le2\sum_{j\in\iota}C_j+D.Lip(f)≤2j∈ι∑​Cj​+D.

Coordinate-hybrid points remain on their common face. This interface combines coordinatewise boundary bounds while retaining the finite coordinate type explicitly.

Definition code
import Definitions.Def_AT260939824_ControlledCone
import Definitions.Def_AT260939824_CubeBoundaryGluing
import Definitions.Def_AT260939824_RelativePathContraction
import Init
import Mathlib.Analysis.Normed.Group.Constructions
import Mathlib.Analysis.Normed.Module.Basic
import Mathlib.Tactic.FieldSimp
import Mathlib.Tactic.FunProp
import Mathlib.Tactic.Linarith
import Mathlib.Tactic.Ring
import Mathlib.Topology.ContinuousMap.Compact
import Mathlib.Topology.Homotopy.Path
import Mathlib.Topology.MetricSpace.Lipschitz

set_option autoImplicit false

/-! Coordinate telescoping on a fixed face of a finite maximum-norm cube. -/
namespace AbelianTargets
open scoped BigOperators NNReal
noncomputable section

def cubeFaceHybrid {ι : Type*} [Fintype ι] [DecidableEq ι]
    (x y : ConeSphere (ι → ℝ)) (j : ι) (hj : |x.1 j|=1) (he : x.1 j=y.1 j)
    (s : Finset ι) : ConeSphere (ι → ℝ) :=
  ⟨fun k => if k∈s then y.1 k else x.1 k,by
    apply le_antisymm
    · apply (pi_norm_le_iff_of_nonneg (by norm_num : (0 : ℝ)≤1)).mpr
      intro k
      by_cases hk : k∈s
      · simpa only [hk,if_true,Real.norm_eq_abs] using coneSphere_coordinate_bound y k
      · simpa only [hk,if_false,Real.norm_eq_abs] using coneSphere_coordinate_bound x k
    · have hh := norm_le_pi_norm (fun k => if k∈s then y.1 k else x.1 k) j
      by_cases hjs : j∈s
      · simpa only [hjs,if_true,Real.norm_eq_abs,←he,hj] using hh
      · simpa only [hjs,if_false,Real.norm_eq_abs,hj] using hh⟩

theorem cubeFaceHybrid_extreme {ι : Type*} [Fintype ι] [DecidableEq ι]
    (x y : ConeSphere (ι → ℝ)) (j : ι) (hj : |x.1 j|=1) (he : x.1 j=y.1 j) (s : Finset ι) :
    (cubeFaceHybrid x y j hj he s).1 j=x.1 j := by
  simp only [cubeFaceHybrid]
  split_ifs
  · exact he.symm
  · rfl

theorem cubeFace_dist_le_sum {ι Z : Type*} [Fintype ι] [PseudoMetricSpace Z]
    (f : ConeSphere (ι → ℝ)→Z) (C : ι→ℝ≥0)
    (hcoord : ∀ j k (x y : ConeSphere (ι → ℝ)),|x.1 j|=1→x.1 j=y.1 j→
      (∀ l,l≠k→x.1 l=y.1 l)→dist (f x) (f y)≤C k*|x.1 k-y.1 k|)
    (j : ι) (x y : ConeSphere (ι → ℝ)) (hj : |x.1 j|=1) (he : x.1 j=y.1 j) :
    dist (f x) (f y)≤∑ k,(C k : ℝ)*|x.1 k-y.1 k| := by
  classical
  have h : ∀ s : Finset ι,dist (f x) (f (cubeFaceHybrid x y j hj he s))≤
      ∑ k∈s,(C k : ℝ)*|x.1 k-y.1 k| := by
    intro s
    induction s using Finset.induction_on with
    | empty =>
      have hz : cubeFaceHybrid x y j hj he ∅=x := by apply Subtype.ext; funext k; simp [cubeFaceHybrid]
      simp [hz]
    | @insert k s hks ih =>
      have h₁ := cubeFaceHybrid_extreme x y j hj he s
      have h₂ := cubeFaceHybrid_extreme x y j hj he (insert k s)
      have hh := hcoord j k (cubeFaceHybrid x y j hj he s) (cubeFaceHybrid x y j hj he (insert k s))
        (by rw [h₁];exact hj) (h₁.trans h₂.symm) (fun l hl => by
          simp [cubeFaceHybrid,Finset.mem_insert,hl])
      simp only [cubeFaceHybrid,hks,if_false,Finset.mem_insert_self,if_true] at hh
      calc
        _ ≤ dist (f x) (f (cubeFaceHybrid x y j hj he s))+
            dist (f (cubeFaceHybrid x y j hj he s)) (f (cubeFaceHybrid x y j hj he (insert k s))) := dist_triangle _ _ _
        _ ≤ (∑ l∈s,(C l : ℝ)*|x.1 l-y.1 l|)+(C k : ℝ)*|x.1 k-y.1 k| := add_le_add ih hh
        _ = _ := by rw [Finset.sum_insert hks];ring
  have hh := h Finset.univ
  have hy : cubeFaceHybrid x y j hj he Finset.univ=y := by apply Subtype.ext;funext k;simp [cubeFaceHybrid]
  simpa only [hy] using hh

theorem lipschitz_cubeBoundary_of_coordinate_faces {ι Z : Type*} [Fintype ι] [PseudoMetricSpace Z]
    (f : ConeSphere (ι → ℝ)→Z) (C : ι→ℝ≥0) (D : ℝ≥0)
    (hdiam : ∀ x y,dist (f x) (f y)≤D)
    (hcoord : ∀ j k (x y : ConeSphere (ι → ℝ)),|x.1 j|=1→x.1 j=y.1 j→
      (∀ l,l≠k→x.1 l=y.1 l)→dist (f x) (f y)≤C k*|x.1 k-y.1 k|) :
    LipschitzWith (2*(∑ k,C k)+D) f := by
  apply lipschitz_cubeBoundary_of_faces f (∑ k,C k) D hdiam
  intro j x y hj he
  calc
    _ ≤ ∑ k,(C k : ℝ)*|x.1 k-y.1 k| := cubeFace_dist_le_sum f C hcoord j x y hj he
    _ ≤ ∑ k,(C k : ℝ)*dist x y := Finset.sum_le_sum (fun k hk =>
      mul_le_mul_of_nonneg_left (dist_le_pi_dist x.1 y.1 k) (C k).2)
    _ = _ := by rw [←Finset.sum_mul];simp

end
end AbelianTargets
Source
Ruijun Wang, Continuous graph homomorphisms of higher dimensional abelian group actions, arXiv:2609.39824v1 (2026), Section(s) 5; 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/CubeFaceCoordinateBounds.lean, selected declaration lines 8-21, 23-29, 31-59, 61-73; SHA-256 e36c27f92d7d3a2c6349ee3100409fc07ff3677bb2078a667a5d46a1b926c6be. 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