Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Reading after map needs own record

Proved
APFPaper5.K3.reading_after_map_needs_own_record

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

apfapf-referencesib-v44-2026-11

Assume the held records depend only on plainAfterTurn, a map exposes a common turn, and the supplied distinction family exactly expresses post-map profile equality with sufficient record families. Some such distinction requires a record outside the held union. These theorems conclude record non-inclusion, not economic elimination or physical B05 support novelty. Required records, hsound, availability of a smaller configuration and original A2 binding are not supplied here.

Preamble
import Definitions.Def_APFPaper5_K4_TwoSheets
import Theorems.Thm_APFPaper5_K1_needs_own_record_of_separates
import Theorems.Thm_APFPaper5_K1_recordModel_supportNovel_of_needs_own_record
import Theorems.Thm_APFPaper5_K1_recordModel_economy_of_separation
import Theorems.Thm_APFPaper5_K3_firstOrder_of_two_directions
import Theorems.Thm_APFPaper5_K3_two_directions_needed
import Theorems.Thm_APFPaper5_K3_seen_common_turn_splits_an_object
import Theorems.Thm_APFPaper5_K4_two_sheets_separate_more
import Mathlib.Tactic.Linarith
import Mathlib.Tactic.NormNum

set_option autoImplicit false

namespace APFPaper5.K3
end APFPaper5.K3
open APFPaper5.K3
open APFPaper5.K1

universe u v
variable {ι : Type u} {Rec : Type v} [DecidableEq Rec]
Formal statement
theorem APFPaper5.K3.reading_after_map_needs_own_record {Val : Type*} (fam : ι → Finset Rec)
    (reads : Rec → Held2 → Val) (verdict : ι → Held2 → Prop) (S : Finset ι)
    (hS : ∀ r ∈ S.biUnion fam, ∀ x y : Held2, plainAfterTurn x = plainAfterTurn y →
      reads r x = reads r y)
    (T : Held2 → Held2) (hseen : ¬ CommonTurnUnseenAfter T)
    (dAfter : (ℝ × ℝ × (ℝ × ℝ × ℝ) → Prop) → ι)
    (hverdict : ∀ (Q : ℝ × ℝ × (ℝ × ℝ × ℝ) → Prop) (h : Held2),
      verdict (dAfter Q) h ↔ plainAfterTurn (T h) = Q)
    (hsound : ∀ (Q : ℝ × ℝ × (ℝ × ℝ × ℝ) → Prop) (x y : Held2),
      (∀ r ∈ fam (dAfter Q), reads r x = reads r y) →
        (verdict (dAfter Q) x ↔ verdict (dAfter Q) y)) :
    ∃ Q : ℝ × ℝ × (ℝ × ℝ × ℝ) → Prop, ¬ fam (dAfter Q) ⊆ S.biUnion fam := by sorry
Source
[{'path': 'Papers/Paper 05 - Quantum Structure - Hilbert Space and Born Rule/Paper_5_Quantum_Structure_Hilbert_Born_Supplement_v7.33.tex', 'locator': '1621-1650,2221-2235'}, {'path': 'source/Theorems/Thm_APFPaper5_K3_economy_instances.lean', 'sha256': '7e56a14b89897b37466d576ab71f614813db6c286f91ed745fc263f35b349fb9', 'line': 39, 'declaration': 'APFPaper5.K3.reading_after_map_needs_own_record'}]
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