Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Boolean records jointly satisfy side realization and finite-resolution clauses

Proved
APFB02.reread_clause_stands_with_told_apart

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

apfapf-referencesib-v58-2026-11

On the supplied state type D → Bool with equality as Cont, proves EveryCombinationHeld, ToldApart and ContinuityAtResolution at tolerance 1/card D for pairTurns. The continuity component concerns pairs of records. This model conjunction is not a physical realization of the original inputs.

Preamble
import Definitions.Def_APFB02_ToldApart
import Theorems.Thm_APFPaper5_K1_states_onto_alignments
import Theorems.Thm_APFPaper5_K1_card_states_ge
import Theorems.Thm_APFPaper5_K1_states_are_the_alignments
import Theorems.Thm_APFPaper5_K1_card_states_eq
import Theorems.Thm_APFPaper5_K1_relation_takes_every_value
import Theorems.Thm_APFPaper5_K1_two_distinctions_four_states
import Theorems.Thm_APFPaper5_K1_quarter_turn_on_the_states_of_two_distinctions
import Theorems.Thm_APFPaper5_K1_count_value_near
import Theorems.Thm_APFPaper5_K1_records_range_at_resolution
import Theorems.Thm_APFPaper5_K1_records_turns_reach_at_resolution
import Theorems.Thm_APFPaper5_K1_pairTurns_lose_nothing
import Theorems.Thm_APFPaper5_K1_records_meet_continuity_at_resolution
import Theorems.Thm_APFPaper5_K1_records_meet_continuity_to_any_fineness
import Theorems.Thm_APFPaper5_K1_records_move_at_resolution
import Theorems.Thm_APFPaper5_K1_resolution_floor_of_capacity

set_option autoImplicit false
namespace APFB02
end APFB02
open APFB02
open APFPaper5.K1 APFPaper5.K3
Formal statement
theorem APFB02.reread_clause_stands_with_told_apart (D : Type*) [Fintype D] [DecidableEq D]
    [Nonempty D] :
    EveryCombinationHeld (fun (d : D) (x : D → Bool) => x d) ∧
    ToldApart (fun (x q : D → Bool) => x = q) (fun (d : D) (x : D → Bool) => x d) ∧
    ContinuityAtResolution (relOfPair (D := D)) (-1) 1 (1 / (Fintype.card D : ℝ))
      (pairTurns D) := by sorry
Source
[{'path': 'source/Theorems/Thm_APFB02_relation_ranges_at_resolution.lean', 'sha256': '19fd3286a2ff6af799b1c2f1f704203001bc0ee01b168c096c4245755332f19a', 'line': 55, 'declaration': 'APFB02.reread_clause_stands_with_told_apart'}, {'path': 'Papers/Paper 05 - Quantum Structure - Hilbert Space and Born Rule/Paper_5_Quantum_Structure_Hilbert_Born_Supplement_v7.33.tex', 'locator': '2966-3077;3559-3564;3670-3674', 'role': 'Scope boundaries: original readout obligations and finite-resolution versus continuum.'}, {'path': 'APF Reference Docs/APF Reconstruction Spine/FOUNDATION_INPUTS.json', 'revision': '2026-11-14.1', 'role': 'B02 amended finite side realization; B03/B04/B05 unchanged; not certification of supplied source instantiation.'}]
Human review
  • Endorsed by Shuze Chen · Nov 18, 2026

    Confirmed by the moderator at approval.

  • Endorsed by FiniteUniverse · Nov 18, 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