Conditional overlap levels and return along a hold history
ProvedAPFB02.occupant_history_of_one_moveapfapf-referencesib-v66-pullbacks-v22-2026-11
For finite readings, NothingDrawn, StillHeldAfter, a one-opposition initial move and an m-step opposite record imply one-opposition successive moves, every overlap level before m, a flipped second half, record return at 2m and card(D) at most m.
Publication scope: Expose Fintype D, NothingDrawn, StillHeldAfter, hone and hopp, and ToldApart for occupant_is_back. No motion or opposite-reaching premise is derived; profile return is not raw-state equality.
Preamble
import Definitions.Def_APFB02_ToldApart import Theorems.Thm_APFB02_rearranged_of_nothing_drawn import Theorems.Thm_APFB02_hold_keeps_every_relation import Theorems.Thm_APFB02_hold_erases_nothing import Theorems.Thm_APFB02_still_held_after_of_rearranged import Theorems.Thm_APFB02_still_held_after_of_onto import Theorems.Thm_APFB02_nothing_drawn_of_keeps_relations import Theorems.Thm_APFB02_keeps_every_relation_iff import Theorems.Thm_APFPaper5_K1_walk_needs_steps import Theorems.Thm_APFPaper5_K1_walk_hits_every_level import Theorems.Thm_APFPaper5_K1_holdStep_iterate_opposite import Theorems.Thm_APFPaper5_K1_history_takes_every_value import Theorems.Thm_APFPaper5_K1_reaching_the_opposite_takes_card_steps import Theorems.Thm_APFPaper5_K1_history_second_half import Theorems.Thm_APFPaper5_K1_history_back_half_overlap import Theorems.Thm_APFPaper5_K1_history_returns import Theorems.Thm_APFPaper5_K1_two_steps_not_back_of_reaches_opposite set_option autoImplicit false namespace APFB02 end APFB02 open APFB02 open APFPaper5.K1
Formal statement
theorem APFB02.occupant_history_of_one_move {X D : Type*} [Fintype D] [DecidableEq D]
(reads : D → X → Bool) (h : X → X) (hdrawn : NothingDrawn reads h)
(hafter : StillHeldAfter reads h) (x0 : X)
(hone : overlapOn Finset.univ (fun d => reads d x0) (fun d => reads d (h x0))
= ((Finset.univ : Finset D).card : ℝ) - 2)
(m : ℕ) (hopp : ∀ d : D, reads d (h^[m] x0) = !(reads d x0)) :
(∀ k : ℕ, overlapOn Finset.univ (fun d => reads d (h^[k] x0))
(fun d => reads d (h^[k + 1] x0)) = ((Finset.univ : Finset D).card : ℝ) - 2) ∧
(∀ j : ℕ, j ≤ (Finset.univ : Finset D).card → ∃ k : ℕ, k ≤ m ∧
overlapOn Finset.univ (fun d => reads d x0) (fun d => reads d (h^[k] x0))
= ((Finset.univ : Finset D).card : ℝ) - 2 * (j : ℝ)) ∧
(∀ (k : ℕ) (d : D), reads d (h^[k + m] x0) = !(reads d (h^[k] x0))) ∧
(∀ d : D, reads d (h^[m + m] x0) = reads d x0) ∧
(Finset.univ : Finset D).card ≤ m := by sorry
Source
['C:/Users/brook/My Drive/__APF Library/Artifacts_2026-11-15_session/astra/sib_v66_publication/source/Theorems/Thm_APFB02_occupant_history.lean:50 (source SHA256 e1d8521d9aa9d723460ff4669d20762e2ae9d568de5c39f2ac74e274a40abbb3; APFB02.occupant_history_of_one_move)', 'C:/Users/brook/My Drive/__APF Library/Artifacts_2026-11-15_session/astra/sib_v66_publication/reviews/rv2_v66_v22_review.json (SHA256 365ce42aeeada41fa76b7443fe2b5af6017c7fdeb2bb28169266b6dbba622948; modules[Theorems.Thm_APFB02_occupant_history].declarations[APFB02.occupant_history_of_one_move])']