Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Translation-covariant separated integer cuts

Definition
AT260939824_CovariantCuts

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

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

For earlier cuts E⊆ZE\subseteq\mathbb ZE⊆Z and origin aaa, relative cuts are E−aE-aE−a. Under P≥1P\ge1P≥1, L≥32PL\ge32PL≥32P, and ∣E∣≤2P|E|\le2P∣E∣≤2P, a fixed selected offset determines a cut in [a,a+L][a,a+L][a,a+L] separated from EEE by more than ⌊L/(16P)⌋\lfloor L/(16P)\rfloor⌊L/(16P)⌋. Translation of both origin and earlier cuts translates the selected cut by the same amount.

This makes cut choices compatible with changing the origin of a lattice orbit.

Definition code
import Definitions.Def_AT260939824_AtlasCuts
import Init
import Mathlib.Algebra.Order.BigOperators.Group.Finset
import Mathlib.Data.Finset.Union
import Mathlib.Data.Int.Interval
import Mathlib.Tactic.Linarith
import Mathlib.Tactic.Ring

set_option autoImplicit false

/-!
# Translation-covariant local cut selection

Offsets depend only on the earlier cuts relative to the candidate
interval's left endpoint. Thus the choice commutes literally with
translation, even though its noncomputable finite choice need not be
continuous on a larger unrelated space of cut configurations.
-/

namespace AbelianTargets

noncomputable section

def relativeCuts (a : ℤ) (earlier : Finset ℤ) : Finset ℤ :=
  earlier.image (fun b => b-a)

@[simp] theorem relativeCuts_card (a : ℤ) (earlier : Finset ℤ) :
    (relativeCuts a earlier).card = earlier.card := by
  apply Finset.card_image_of_injective
  intro x y h
  dsimp at h
  omega

def selectedOffset {P L : ℕ} (hP : 1 ≤ P) (hL : 32*P ≤ L)
    (earlier : Finset ℤ) (hcard : earlier.card ≤ 2*P) : ℤ :=
  Classical.choose (exists_separated_cut hP hL 0 earlier hcard)

theorem selectedOffset_spec {P L : ℕ} (hP : 1 ≤ P) (hL : 32*P ≤ L)
    (earlier : Finset ℤ) (hcard : earlier.card ≤ 2*P) :
    0 ≤ selectedOffset hP hL earlier hcard ∧
      selectedOffset hP hL earlier hcard ≤ L ∧
      ∀ b ∈ earlier,((L/(16*P) : ℕ) : ℤ) < |selectedOffset hP hL earlier hcard-b| := by
  simpa only [selectedOffset,zero_add] using Classical.choose_spec (exists_separated_cut hP hL 0 earlier hcard)

def selectedCut {P L : ℕ} (hP : 1 ≤ P) (hL : 32*P ≤ L)
    (a : ℤ) (earlier : Finset ℤ) (hcard : earlier.card ≤ 2*P) : ℤ :=
  a + selectedOffset hP hL (relativeCuts a earlier) (by simpa using hcard)

theorem selectedCut_spec {P L : ℕ} (hP : 1 ≤ P) (hL : 32*P ≤ L)
    (a : ℤ) (earlier : Finset ℤ) (hcard : earlier.card ≤ 2*P) :
    a ≤ selectedCut hP hL a earlier hcard ∧
      selectedCut hP hL a earlier hcard ≤ a+L ∧
      ∀ b ∈ earlier,((L/(16*P) : ℕ) : ℤ) < |selectedCut hP hL a earlier hcard-b| := by
  obtain ⟨hlo,hhi,hsep⟩ := selectedOffset_spec hP hL (relativeCuts a earlier)
    (by simpa using hcard)
  refine ⟨by unfold selectedCut; omega,by unfold selectedCut; omega,?_⟩
  intro b hb
  have h := hsep (b-a) (Finset.mem_image.mpr ⟨b,hb,rfl⟩)
  have he : selectedCut hP hL a earlier hcard-b =
      selectedOffset hP hL (relativeCuts a earlier) (by simpa using hcard)-(b-a) := by
    unfold selectedCut
    ring
  rw [he]
  exact h

def translatedCuts (s : ℤ) (earlier : Finset ℤ) : Finset ℤ :=
  earlier.image (fun b => b+s)

@[simp] theorem translatedCuts_card (s : ℤ) (earlier : Finset ℤ) :
    (translatedCuts s earlier).card = earlier.card := by
  apply Finset.card_image_of_injective
  intro x y h
  dsimp at h
  omega

theorem relativeCuts_translated (a s : ℤ) (earlier : Finset ℤ) :
    relativeCuts (a+s) (translatedCuts s earlier) = relativeCuts a earlier := by
  unfold relativeCuts translatedCuts
  rw [Finset.image_image]
  congr 1
  funext b
  dsimp
  ring

/-- The local cut choice commutes exactly with integer translation. -/
theorem selectedCut_translated {P L : ℕ} (hP : 1 ≤ P) (hL : 32*P ≤ L)
    (a s : ℤ) (earlier : Finset ℤ) (hcard : earlier.card ≤ 2*P) :
    selectedCut hP hL (a+s) (translatedCuts s earlier) (by simpa using hcard) =
      selectedCut hP hL a earlier hcard+s := by
  unfold selectedCut
  simp only [relativeCuts_translated]
  ring

end

end AbelianTargets
Source
Ruijun Wang, Continuous graph homomorphisms of higher dimensional abelian group actions, arXiv:2609.39824v1 (2026), Section(s) 3; 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/CovariantCuts.lean, selected declaration lines 16-17, 19-24, 26-28, 30-35, 37-39, 41-56, 58-59, 61-66, 68-75, 77-84; SHA-256 b16643e199820247a625d3dd2974bc9dd1958823ae3951f045d3e623896b905b. 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