A step-by-two walk visits each intermediate lattice level
ProvedAPFPaper5.K1.walk_hits_every_levelapfapf-referencesib-v66-pullbacks-v22-2026-11
If a walk with increments plus or minus two reaches at most its starting value minus 2j by time m, it equals that level at some time at most m.
Publication scope: Expose finite D, signed-permutation form, hone and hm. Reaching the opposite and actual motion are assumptions; no shortest path or physical admission is proved. The arithmetic sequence lemmas retain their step-by-two assumptions.
Preamble
import Definitions.Def_APFPaper5_K1_MovesAtOccupant import Theorems.Thm_APFPaper5_K1_one_away_at_one_moment_is_one_away_always import Theorems.Thm_APFPaper5_K1_two_steps_not_back_always import Theorems.Thm_APFPaper5_K1_relation_moves_one_opposition_a_step import Theorems.Thm_APFPaper5_K1_way_back_retraces import Theorems.Thm_APFPaper5_K1_moving_every_record_stays_near import Theorems.Thm_APFPaper5_K1_moving_every_record_never_reaches_the_opposite import Theorems.Thm_APFPaper5_K1_allSidesHeld_of_turning_over import Theorems.Thm_APFPaper5_K1_pair_number_is_function_of_oppositions import Theorems.Thm_APFPaper5_K1_additive_count_number_is_linear import Theorems.Thm_APFPaper5_K1_step_returns_of_keeps_overlaps set_option autoImplicit false namespace APFPaper5.K1 end APFPaper5.K1 open APFPaper5 open APFPaper5.K1
Formal statement
theorem APFPaper5.K1.walk_hits_every_level (r : ℕ → ℝ)
(hstep : ∀ k : ℕ, r (k + 1) = r k + 2 ∨ r (k + 1) = r k - 2) (m j : ℕ)
(hm : r m ≤ r 0 - 2 * (j : ℝ)) :
∃ k : ℕ, k ≤ m ∧ r k = r 0 - 2 * (j : ℝ) := by sorry
Source
['C:/Users/brook/My Drive/__APF Library/Artifacts_2026-11-15_session/astra/sib_v66_publication/source/Theorems/Thm_APFPaper5_K1_occupant_history.lean:47 (source SHA256 6191ee9d13166a11c5bc00bb82ea6585a6dbaf9e803b1eb2b13c5fa4b6c340f1; APFPaper5.K1.walk_hits_every_level)', '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_APFPaper5_K1_occupant_history].declarations[APFPaper5.K1.walk_hits_every_level])']