Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

A one-opposition history reaching the opposite visits every overlap level

Proved
APFPaper5.K1.history_takes_every_value

by FiniteUniverse · Nov 15, 2026 · Mathlib 0df444a (Lean v4.33.1)

apfapf-referencesib-v66-pullbacks-v22-2026-11

For a finite signed permutation, a one-opposition first move and an opposite record at time m ensure that every overlap level n-2j, for j at most n, occurs by time 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.history_takes_every_value {D : Type*} [Fintype D] [DecidableEq D] (f : D → Bool)
    (sigma : D ≃ D) (v0 : D → Bool) (hone : MovesOneAwayAt (holdStep f sigma) v0) (m : ℕ)
    (hm : (holdStep f sigma)^[m] v0 = opposite v0) (j : ℕ)
    (hj : j ≤ (Finset.univ : Finset D).card) :
    ∃ k : ℕ, k ≤ m ∧ overlapOn Finset.univ v0 ((holdStep f sigma)^[k] v0)
      = ((Finset.univ : Finset D).card : ℝ) - 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:93 (source SHA256 6191ee9d13166a11c5bc00bb82ea6585a6dbaf9e803b1eb2b13c5fa4b6c340f1; APFPaper5.K1.history_takes_every_value)', '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.history_takes_every_value])']

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me