Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Fixed-index continuous marker cuts

Definition
AT260939824_FixedOrbitPriorityCuts

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

arxiv-2609-39824-positivegraph-theorylean-formalizationtopological-dynamics

For a free lattice action with anisotropic clopen markers, fixed lattice indices are given finite marker neighborhoods; inactive indices have no neighbors. A proper marker priority coloring produces a finite-priority neighborhood structure at every source point. Packing bounds control neighborhood size independently of the scales. With the specified scale lower bound, each fixed stage and fixed index of the resulting cut algorithm varies continuously with the source point.

Definition code
import Definitions.Def_AT260939824_Actions
import Definitions.Def_AT260939824_AnisotropicMarkers
import Definitions.Def_AT260939824_AtlasBoxes
import Definitions.Def_AT260939824_ClopenMarkers
import Definitions.Def_AT260939824_ContinuousOrbitCuts
import Definitions.Def_AT260939824_CovariantCuts
import Definitions.Def_AT260939824_Dimension
import Definitions.Def_AT260939824_MarkerExistence
import Definitions.Def_AT260939824_MarkerMap
import Definitions.Def_AT260939824_MarkerPriorities
import Definitions.Def_AT260939824_MarkerWindows
import Definitions.Def_AT260939824_OrbitMarkerCuts
import Definitions.Def_AT260939824_ParityCoordinates
import Definitions.Def_AT260939824_ParityFields
import Definitions.Def_AT260939824_PriorityCuts
import Definitions.Def_AT260939824_Probability
import Definitions.Def_AT260939824_Rounding
import Definitions.Def_AT260939824_SupportModel
import Definitions.Def_AbelianTargets260939824Actions
import Init
import Lean.Elab.Tactic.Omega
import Mathlib.Algebra.BigOperators.Group.Finset.Basic
import Mathlib.Algebra.Group.Action.Basic
import Mathlib.Algebra.Order.BigOperators.Group.Finset
import Mathlib.Analysis.SpecialFunctions.Log.Basic
import Mathlib.Combinatorics.SimpleGraph.Basic
import Mathlib.Combinatorics.SimpleGraph.Maps
import Mathlib.Combinatorics.SimpleGraph.Prod
import Mathlib.Data.Countable.Basic
import Mathlib.Data.Finset.Max
import Mathlib.Data.Finset.Powerset
import Mathlib.Data.Finset.Preimage
import Mathlib.Data.Finset.Union
import Mathlib.Data.Fintype.Card
import Mathlib.Data.Fintype.Pi
import Mathlib.Data.Int.Interval
import Mathlib.Data.Real.Archimedean
import Mathlib.Data.Real.Basic
import Mathlib.Data.ZMod.Basic
import Mathlib.Dynamics.Transitive
import Mathlib.Order.Filter.AtTopBot.Archimedean
import Mathlib.Order.Filter.Finite
import Mathlib.Order.Monotone.Basic
import Mathlib.Tactic.Linarith
import Mathlib.Tactic.NormNum
import Mathlib.Tactic.Ring
import Mathlib.Topology.Algebra.MulAction
import Mathlib.Topology.Clopen
import Mathlib.Topology.Compactness.Lindelof
import Mathlib.Topology.Constructions
import Mathlib.Topology.Instances.Discrete
import Mathlib.Topology.Instances.Int
import Mathlib.Topology.Instances.Real.Lemmas
import Mathlib.Topology.MetricSpace.Polish
import Mathlib.Topology.MetricSpace.Pseudo.Pi
import Mathlib.Topology.Separation.Basic
import Mathlib.Topology.Separation.Profinite
import Mathlib.Topology.UniformSpace.HeineCantor

set_option autoImplicit false

/-!
# Actual fixed-index continuous priority cuts

Inactive lattice indices are isolated; active indices use the literal
finite marker-proximity neighborhood. This packages the neighborhood
fields left explicit in `ContinuousOrbitCuts` and proves continuity of
the resulting cuts from actual continuous marker priorities.
-/

namespace AbelianTargets
noncomputable section

variable {d : ℕ} {L : Fin d → ℕ} {X : Type*}
variable [TopologicalSpace X] [AddAction (Lattice d) X] [ContinuousVAdd (Lattice d) X]

theorem mem_orbitCandidateBox (S : ℕ) (L : Fin d → ℕ) (a b : Lattice d) :
    b ∈ orbitCandidateBox S L a ↔ ∀ i,|b i-a i| ≤ (S*L i : ℕ) := by
  classical
  constructor
  · rintro hb
    obtain ⟨g,hg,rfl⟩ := Finset.mem_image.mp hb
    have h := Fintype.mem_piFinset.mp hg
    intro i
    have hi := Finset.mem_Icc.mp (h i)
    simpa only [Pi.add_apply,add_sub_cancel_right,Nat.cast_mul,abs_le,neg_mul] using hi
  · intro hb
    apply Finset.mem_image.mpr
    refine ⟨b-a,?_,sub_add_cancel _ _⟩
    apply Fintype.mem_piFinset.mpr
    intro i
    apply Finset.mem_Icc.mpr
    simpa only [Pi.sub_apply,Nat.cast_mul,neg_mul] using abs_le.mp (hb i)

theorem mem_inactiveOrbitNeighbors_of_mem
    (M : AnisotropicClopenMarkers d L X) (S : ℕ) (x : X) (a b : Lattice d)
    (ha : a +ᵥ x ∈ M.markers) :
    b ∈ inactiveOrbitNeighbors M S x a ↔
      b +ᵥ x ∈ M.markers ∧ ∀ i,|b i-a i| ≤ (S*L i : ℕ) := by
  classical
  simp only [inactiveOrbitNeighbors,if_pos ha,Finset.mem_filter,mem_orbitCandidateBox]
  exact and_comm

theorem inactiveOrbitNeighbors_active_eq
    (M : AnisotropicClopenMarkers d L X) (S : ℕ) (x : X) (a : Lattice d)
    (ha : a +ᵥ x ∈ M.markers) :
    inactiveOrbitNeighbors M S x a =
      (scaledMarkerNeighborhood M S ⟨a +ᵥ x,ha⟩).image (fun g => g+a) := by
  classical
  ext b
  rw [mem_inactiveOrbitNeighbors_of_mem M S x a b ha,Finset.mem_image]
  constructor
  · rintro ⟨hb,hclose⟩
    refine ⟨b-a,(mem_scaledMarkerNeighborhood M S _ _).mpr ⟨?_,?_⟩,sub_add_cancel _ _⟩
    · intro i
      simpa only [Pi.sub_apply,Nat.cast_mul,neg_mul] using abs_le.mp (hclose i)
    · simpa only [← add_vadd,sub_add_cancel] using hb
  · rintro ⟨g,hg,rfl⟩
    obtain ⟨hbound,hmarker⟩ := (mem_scaledMarkerNeighborhood M S _ _).mp hg
    refine ⟨by simpa only [add_vadd] using hmarker,?_⟩
    intro i
    simpa only [Pi.add_apply,add_sub_cancel_right,Nat.cast_mul,abs_le,neg_mul] using hbound i

theorem inactiveOrbitNeighbors_card_le
    (M : AnisotropicClopenMarkers d L X) (hL : ∀ i,1 ≤ L i) (S : ℕ)
    (x : X) (a : Lattice d) :
    (inactiveOrbitNeighbors M S x a).card ≤ (2*S+1)^d := by
  classical
  by_cases ha : a +ᵥ x ∈ M.markers
  · rw [inactiveOrbitNeighbors_active_eq M S x a ha]
    exact Finset.card_image_le.trans (scaledMarkerNeighborhood_card_le M hL S _)
  · simp only [inactiveOrbitNeighbors,if_neg ha,Finset.card_singleton]
    exact Nat.one_le_pow _ _ (by omega)

def fixedOrbitPriorityNeighborhood
    (M : AnisotropicClopenMarkers d L X) (hL : ∀ i,1 ≤ L i) (S : ℕ)
    (free : IsFree (G := Lattice d) (X := X))
    (c : M.markers → Fin ((2*S+1)^d))
    (hproper : ∀ u v,(markerProximityGraph M S free).Adj u v → c u ≠ c v)
    (x : X) : PriorityNeighborhood (Lattice d) ((2*S+1)^d) where
  nearby := inactiveOrbitNeighbors M S x
  bound := inactiveOrbitNeighbors_card_le M hL S x
  symmetric a b hab := by
    classical
    by_cases ha : a +ᵥ x ∈ M.markers
    · obtain ⟨hb,hclose⟩ := (mem_inactiveOrbitNeighbors_of_mem M S x a b ha).mp hab
      apply (mem_inactiveOrbitNeighbors_of_mem M S x b a hb).mpr
      exact ⟨ha,by intro i; simpa only [abs_sub_comm] using hclose i⟩
    · have he : b = a := by simpa only [inactiveOrbitNeighbors,if_neg ha,Finset.mem_singleton] using hab
      subst b
      simpa only [inactiveOrbitNeighbors,if_neg ha,Finset.mem_singleton]
  priority a := markerPriorityExtension M.markers c ⟨0,Nat.one_le_pow _ _ (by omega)⟩ (a +ᵥ x)
  proper a b hab hne := by
    classical
    by_cases ha : a +ᵥ x ∈ M.markers
    · obtain ⟨hb,hclose⟩ := (mem_inactiveOrbitNeighbors_of_mem M S x a b ha).mp hab
      simp only [markerPriorityExtension,dif_pos ha,dif_pos hb]
      apply hproper
      refine ⟨b-a,(mem_anisotropicDisplacements (fun i => S*L i) _).mpr ⟨?_,?_⟩,?_⟩
      · intro i
        simpa only [Pi.sub_apply] using hclose i
      · exact sub_ne_zero.mpr hne.symm
      · change (b-a) +ᵥ (a +ᵥ x) = b +ᵥ x
        rw [← add_vadd,sub_add_cancel]
    · have he : b = a := by simpa only [inactiveOrbitNeighbors,if_neg ha,Finset.mem_singleton] using hab
      exact (hne he.symm).elim

theorem continuous_fixedOrbitCuts
    [TopologicalSpace (Finset (Lattice d))] [DiscreteTopology (Finset (Lattice d))]
    (M : AnisotropicClopenMarkers d L X) (hL : ∀ i,1 ≤ L i) (S : ℕ)
    (free : IsFree (G := Lattice d) (X := X))
    (c : M.markers → Fin ((2*S+1)^d)) (hc : Continuous c)
    (hproper : ∀ u v,(markerProximityGraph M S free).Adj u v → c u ≠ c v)
    (hscale : ∀ i,32*((2*S+1)^d) ≤ L i) (i : Fin d) (n : ℕ) (a : Lattice d) :
    Continuous (fun x => priorityCutIteration (fixedOrbitPriorityNeighborhood M hL S free c hproper x)
      (Nat.one_le_pow _ _ (by omega)) (hscale i) (fun g => g i) n a) := by
  exact continuous_actualOrbitCuts M S c hc _
    (fixedOrbitPriorityNeighborhood M hL S free c hproper) (fun _ _ => rfl) (fun _ _ => rfl)
    (Nat.one_le_pow _ _ (by omega)) hscale i n a

end
end AbelianTargets
Source
Ruijun Wang, Continuous graph homomorphisms of higher dimensional abelian group actions, arXiv:2609.39824v1 (30 September 2026), Sections 2-7; https://arxiv.org/html/2609.39824v1. Formalization-specific infrastructure in the import closure of Theorem 1.4 and Proposition 7.1; individual helper assertions are not represented as separately numbered paper theorems. Original Lean module AbelianTargets/FixedOrbitPriorityCuts.lean, selected declaration lines 18-34, 36-43, 45-63, 65-74, 76-107, 109-120; SHA-256 3876a4a2b517c4caafabfc74dc815621a1aab053ba9b010588b2b82a73a5608e. 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