Step returns of keeps overlaps
ProvedAPFPaper5.K1.step_returns_of_keeps_overlapsapfapf-referencesib-v44-2026-11
On a finite Boolean coordinate family, a map preserving every pairwise overlap has a positive period through each record and can be undone there by repeating one fewer times. Global overlap preservation supplies injectivity; admission is not asserted.
Preamble
import Definitions.Def_APF_B02_DeclaredInput import Theorems.Thm_APFPaper5_K1_reaching_every_value_needs_a_turn_over import Theorems.Thm_APFPaper5_K1_holdStep_returns import Theorems.Thm_APFPaper5_K1_turn_mixes_the_pair_of_step import Theorems.Thm_APFPaper5_K1_two_distinctions_quarter_turn import Theorems.Thm_APFPaper5_K1_quarter2_is_not_a_rearrangement_in_any_naming import Mathlib.Algebra.Order.BigOperators.Group.Finset set_option autoImplicit false namespace APFPaper5.K1 end APFPaper5.K1 open APFPaper5.K1
Formal statement
theorem APFPaper5.K1.step_returns_of_keeps_overlaps {D : Type*} [Fintype D] (g : (D → Bool) → D → Bool)
(hiso : ∀ x y : D → Bool,
overlapOn Finset.univ (g x) (g y) = overlapOn Finset.univ x y) (v : D → Bool) :
∃ n : ℕ, 0 < n ∧ g^[n] v = v ∧ g^[n - 1] (g v) = v := by sorry
Source
Sib v44 Theorems/Thm_APFPaper5_K1_list_reduced.lean:195
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.