laws agree without recombination
ProvedAPFB07.Ties.laws_agree_without_recombinationapfapf-referencepullbacks-v46-2026-11
Result: laws agree without recombination. All parameters and hypotheses are retained in the declaration below.
theorem laws_agree_without_recombination (W : Finset Way) (F : Way → Finset Cfg) (n : ℕ)
(hfan : ∀ w ∈ W, (F w).card = n)
(hdis : ∀ w ∈ W, ∀ v ∈ W, w ≠ v → Disjoint (F w) (F v)) (G : Cfg) (hG : G ∈ W.biUnion F) :
composedLaw W F G = oneCommitLaw W F G
Module context and limits: The two finite counting laws are supplied definitions. Equal branch fan sizes and disjoint outcomes suffice for agreement; unequal route multiplicities force disagreement under the stated nonemptiness assumptions. Recombination alone is not proved necessary or sufficient for disagreement, despite the broader draft title. No physical law, phase, superposition, or Born rule is selected.
Source scope parameters:
variable {Way Cfg : Type*} [DecidableEq Cfg]
Public reference result; this record does not establish Foundation admission, physical K1–K4 closure, a forced transfer or Born-rule derivation.
Preamble
import Definitions.Def_APFB07_two_ties_in_succession_Vocabulary import Theorems.Thm_APFB07_Ties_unit_cost_eq_iff import Theorems.Thm_APFB07_Ties_unit_cost_lt_iff import Theorems.Thm_APFB07_Ties_isMinimum_iff_fewest import Theorems.Thm_APFB07_Ties_coupled_tie_iff import Theorems.Thm_APFB07_Ties_coupled_lt_iff import Theorems.Thm_APFB07_Ties_uncoupled_tie_iff import Theorems.Thm_APFB07_Ties_equally_shared_tie import Theorems.Thm_APFB07_Ties_more_shared_side_cheaper import Theorems.Thm_APFB07_Ties_tie_cases_count import Mathlib.Algebra.BigOperators.Ring.Finset import Mathlib.Tactic.Ring import Mathlib.Tactic.Linarith import Mathlib.Tactic.NormNum set_option autoImplicit false universe apfNative_u_1 apfNative_u_2
Formal statement
theorem APFB07.Ties.laws_agree_without_recombination :
∀ {Way : Type apfNative_u_1} {Cfg : Type apfNative_u_2} [inst : DecidableEq.{apfNative_u_2 + 1} Cfg]
(W : Finset.{apfNative_u_1} Way) (F : Way → Finset.{apfNative_u_2} Cfg) (n : Nat)
(hfan :
∀ (w : Way),
@Membership.mem.{apfNative_u_1, apfNative_u_1} Way (Finset.{apfNative_u_1} Way)
(@SetLike.instMembership.{apfNative_u_1, apfNative_u_1} (Finset.{apfNative_u_1} Way) Way
(@Finset.instSetLike.{apfNative_u_1} Way))
W w →
@Eq.{1} Nat (@Finset.card.{apfNative_u_2} Cfg (F w)) n)
(hdis :
∀ (w : Way),
@Membership.mem.{apfNative_u_1, apfNative_u_1} Way (Finset.{apfNative_u_1} Way)
(@SetLike.instMembership.{apfNative_u_1, apfNative_u_1} (Finset.{apfNative_u_1} Way) Way
(@Finset.instSetLike.{apfNative_u_1} Way))
W w →
∀ (v : Way),
@Membership.mem.{apfNative_u_1, apfNative_u_1} Way (Finset.{apfNative_u_1} Way)
(@SetLike.instMembership.{apfNative_u_1, apfNative_u_1} (Finset.{apfNative_u_1} Way) Way
(@Finset.instSetLike.{apfNative_u_1} Way))
W v →
@Ne.{apfNative_u_1 + 1} Way w v →
@Disjoint.{apfNative_u_2} (Finset.{apfNative_u_2} Cfg) (@Finset.instPartialOrder.{apfNative_u_2} Cfg)
(@Finset.instOrderBot.{apfNative_u_2} Cfg) (F w) (F v))
(G : Cfg)
(hG :
@Membership.mem.{apfNative_u_2, apfNative_u_2} Cfg (Finset.{apfNative_u_2} Cfg)
(@SetLike.instMembership.{apfNative_u_2, apfNative_u_2} (Finset.{apfNative_u_2} Cfg) Cfg
(@Finset.instSetLike.{apfNative_u_2} Cfg))
(@Finset.biUnion.{apfNative_u_1, apfNative_u_2} Way Cfg inst W F) G),
@Eq.{1} Real (@APFB07.Ties.composedLaw.{apfNative_u_1, apfNative_u_2} Way Cfg inst W F G)
(@APFB07.Ties.oneCommitLaw.{apfNative_u_1, apfNative_u_2} Way Cfg inst W F G) := by sorry
Source
['Theorems.Thm_APFB07_two_ties_in_succession:142; pullbacks v46; source SHA-256 5c518f2c5d0acaf7e21908d0256c1a8ddb7126dbe9e25de7c9b0c456c7bced3b']