Accumulating independent sets preserves independence
ProvedAbelianTargets.markerAccumulation_independentarxiv-2609-39824-positive
Let be a simple graph on an arbitrary set , and let be independent vertex sets. For , define its neighbor set . Define
Then is independent in for every . No topology or covering assumption is required.
Preamble
import Definitions.Def_AT260939824_ClopenMarkers
import Init
import Mathlib.Combinatorics.SimpleGraph.Basic
import Mathlib.Order.Monotone.Basic
import Mathlib.Topology.Clopen
set_option autoImplicit false
/-!
# A clopen maximal independent set from a countable clopen independent cover
This is the maximal-independent-set part of Lemma 3.1 of
arXiv:2609.39824. The graph-neighbor operator is assumed to preserve clopen
sets, as happens for graphs generated by finitely many homeomorphisms.
The existence of the countable independent cover is a separate input.
-/
namespace AbelianTargets
end AbelianTargets
open AbelianTargets
universe u
variable {X : Type u} (G : SimpleGraph X)
variable {G}
Formal statement
theorem AbelianTargets.markerAccumulation_independent (C : ℕ → Set X)
(hindep : ∀ n, GraphIndependent G (C n)) (n : ℕ) :
GraphIndependent G (markerAccumulation G C n) := by sorry
Source
Ruijun Wang, Continuous graph homomorphisms of higher dimensional abelian group actions, arXiv:2609.39824v1 (30 September 2026), Sections 2–7, supporting construction for Proposition 7.1; https://arxiv.org/html/2609.39824v1. Formalization-specific helper: AbelianTargets/ClopenMarkers.lean, lines 55–71; SHA256 7555b61d55257a699bdb418732869ed00680e5f483d1794d31b47ef023996b17.