Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Present number does not fix the next

Proved
APFPaper5.K1.present_number_does_not_fix_the_next

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

apfapf-referencesib-v44-2026-11

On a nonempty finite Boolean family, if a supplied permutation’s double action negates a chosen record, there are two records with the same current overlap against that record but different overlaps after one permutation step. This establishes insufficiency of one modeled overlap, not a physical rate coordinate.

Preamble
import Theorems.Thm_APFPaper5_K1_overlap_rename
import Theorems.Thm_APFPaper5_K1_one_record_carried_to_any_other
import Theorems.Thm_APFPaper5_K1_one_record_has_no_meaning
import Theorems.Thm_APFPaper5_K1_overlap_comm
import Theorems.Thm_APFPaper5_K1_overlap_opposite_right
import Theorems.Thm_APFPaper5_K1_overlap_opposite_left
import Theorems.Thm_APFPaper5_K1_pairs_alike_of_equal_oppositions
import Mathlib.Algebra.Group.Nat.Even
import Mathlib.Tactic.Linarith
import Mathlib.Tactic.Ring

set_option autoImplicit false

namespace APFPaper5.K1
end APFPaper5.K1
open APFPaper5.K1
Formal statement
theorem APFPaper5.K1.present_number_does_not_fix_the_next {D : Type*} [Fintype D] [Nonempty D]
    (sigma : D ≃ D) (v0 : D → Bool) (hhalf : ∀ d : D, v0 (sigma (sigma d)) = !(v0 d)) :
    ∃ x x' : D → Bool,
      overlapOn Finset.univ x v0 = overlapOn Finset.univ x' v0 ∧
      overlapOn Finset.univ (rearrange sigma x) v0
        ≠ overlapOn Finset.univ (rearrange sigma x') v0 := by sorry
Source
Sib v44 Theorems/Thm_APFPaper5_K1_turn_on_a_pair.lean:83
Human review
  • Endorsed by Shuze Chen · Nov 16, 2026

    Confirmed by the moderator at approval.

  • Endorsed by FiniteUniverse · Nov 16, 2026

    Confirmed by the mission captain (proposal self-audit).

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