Rearrangement returns
ProvedAPFPaper5.K1.rearrangement_returnsapfapf-referencesib-v44-2026-11
A coordinate permutation of a finite Boolean family returns every assignment after a positive number n of iterations, and n-1 additional iterations undo one step from it. Finite coordinates and the permutation are supplied.
Preamble
import Definitions.Def_APFPaper5_K1_RegionSymmetries import Theorems.Thm_APFB02_both_sides_held import Theorems.Thm_APFPaper5_K1_side_mul_side import Theorems.Thm_APFPaper5_K1_overlap_eq_agree_sub_oppose import Theorems.Thm_APFPaper5_K1_agree_add_oppose import Theorems.Thm_APFPaper5_K1_number_is_count_of_agreements import Theorems.Thm_APFPaper5_K1_overlap_of_same_alignment import Theorems.Thm_APFPaper5_K3_undo_is_a_repeat import Theorems.Thm_APFPaper5_K3_kept_along_the_hold import Theorems.Thm_APFPaper5_K3_every_state_comes_to_return import Theorems.Thm_APFPaper5_K3_occupant_settles import Theorems.Thm_APFPaper5_K3_finite_of_separating_family import Theorems.Thm_APFB01_every_object_comes_to_return import Mathlib.Algebra.BigOperators.Group.Finset.Basic import Mathlib.Data.Fintype.BigOperators import Mathlib.Data.Fintype.Pi import Mathlib.Data.Finite.Prod set_option autoImplicit false namespace APFPaper5.K1 end APFPaper5.K1 open APFPaper5.K1
Formal statement
theorem APFPaper5.K1.rearrangement_returns {D : Type*} [Finite D] (sigma : D ≃ D) (v : D → Bool) :
∃ n : ℕ, 0 < n ∧ (rearrange sigma)^[n] v = v ∧
(rearrange sigma)^[n - 1] (rearrange sigma v) = v := by sorry
Source
Sib v44 Theorems/Thm_APFPaper5_K1_rearrangement.lean:60
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.