Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Generator completeness of joint map extension

Proved
APFPaper5.K4.generator_completeness_of_joint_map_extension

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

apfapf-referencesib-v44-2026-11

Under the same explicit admitted-set closure and map hypotheses, with hroot and universal ExtendsToJointMap, every admitted map is generated. The extension premises and synchronized joint carrier remain supplied. No full K4 construction, physical CP theorem or independent derivation of no-flip from B03 alone is certified.

Preamble
import Definitions.Def_APFPaper5_K4_JointCarrier
import Theorems.Thm_APFPaper5_K4_jointFlip_recDiag
import Theorems.Thm_APFPaper5_K4_flipped_part_record_value
import Theorems.Thm_APFPaper5_K4_no_nonneg_flipped_part_record
import Theorems.Thm_APFPaper5_K4_rateFlip_does_not_extend
import Theorems.Thm_APFPaper5_K4_recDiag_jointQuarter
import Theorems.Thm_APFPaper5_K4_linear_of_additive_quarter_unseen
import Theorems.Thm_APFPaper5_K4_extendsToJoint_of_map
import Theorems.Thm_APFPaper5_K4_rateFlip_does_not_extend_as_map
import Theorems.Thm_APFPaper5_K3_built_has_inverse
import Theorems.Thm_APFPaper5_K3_generator_completeness_of_no_flip
import Mathlib.Tactic.Ring

set_option autoImplicit false
namespace APFPaper5.K4
end APFPaper5.K4
open APFPaper5.K4
open APFPaper5.K3
Formal statement
theorem APFPaper5.K4.generator_completeness_of_joint_map_extension
    (hroot : ∀ t : ℝ, 0 ≤ t → ∃ r : ℝ, 0 ≤ r ∧ r * r = t) (Adm : Set (Held2 → Held2))
    (hbuilt : ∀ U : Held2 → Held2, BuiltFromTurns U → U ∈ Adm)
    (hcomp : ∀ S ∈ Adm, ∀ T ∈ Adm, (fun h => S (T h)) ∈ Adm)
    (hadm : ∀ T ∈ Adm, AdditiveHomogeneous T ∧ PreservesTotalCost T ∧ CommonTurnUnseenAfter T)
    (hext : ∀ T ∈ Adm, ExtendsToJointMap T) : ∀ T ∈ Adm, BuiltFromTurns T := 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': '2213-2235,2722-2735'}, {'path': 'source/Theorems/Thm_APFPaper5_K4_completeness_from_composition.lean', 'sha256': '2c2eb3428821796ae7a6dd3cce30628f7030b81be51f90ff6993ed91af3dd91e', 'line': 70, 'declaration': 'APFPaper5.K4.generator_completeness_of_joint_map_extension'}]
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