Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Discrete opposition reachability exceeds conjugated permutations

Proved
APFPaper5.K1.reaching_every_value_needs_a_turn_over

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

apfapf-referencesib-v44-2026-11

On a nonempty finite Boolean coordinate family, assume that from every pair of records an admitted map can produce every possible opposition count. Then some admitted map at some record differs from every coordinate permutation conjugated by any fixed side naming. This is a discrete parity obstruction, not real-interval continuity or a classification of all holds.

Preamble
import Theorems.Thm_APFPaper5_K1_pairSign_same
import Theorems.Thm_APFPaper5_K1_pairSign_rearrange_one
import Theorems.Thm_APFPaper5_K1_pairSign_rename_one
import Theorems.Thm_APFPaper5_K1_pairSign_rearrange_any_naming
import Theorems.Thm_APFPaper5_K1_other_parity_not_reached_by_rearranging
import Theorems.Thm_APFPaper5_K1_turning_one_over_is_not_a_double_step
import Theorems.Thm_APFPaper5_K1_every_number_of_oppositions_occurs
import Theorems.Thm_APFPaper5_K1_every_relation_between_potential_states
import Theorems.Thm_APFB02_form_allows_tied_distinctions
import Mathlib.Algebra.BigOperators.Fin

set_option autoImplicit false

namespace APFPaper5.K1
end APFPaper5.K1
open APFPaper5.K1
Formal statement
theorem APFPaper5.K1.reaching_every_value_needs_a_turn_over {D : Type*} [Fintype D] [DecidableEq D]
    [Nonempty D] (Adm : Set ((D → Bool) → D → Bool))
    (hreach : ∀ (v w : D → Bool) (T : Finset D),
      ∃ g ∈ Adm, opposeOn Finset.univ v (g w) = (T.card : ℝ)) :
    ∃ g ∈ Adm, ∃ w : D → Bool, ∀ (f : D → Bool) (sigma : D ≃ D),
      rename f (rearrange sigma (rename f w)) ≠ g w := by sorry
Source
Sib v44 Theorems/Thm_APFPaper5_K1_hold_turns_one_over.lean:60
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