Model vocabulary — Comparing composed and single-commit counting laws
DefinitionAPFB07_two_ties_in_succession_Vocabularyapfapf-referencepullbacks-v46-2026-11
Data, predicates and immediate constructor helpers for this reviewed model. Its substantive results are published as separate proved theorem nodes.
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.
Supplied data and hypotheses
- Every parameter and hypothesis in the exact source declaration remains exposed; no author input is adopted.
Limits
This is conditional reference mathematics. The supplied model and its hypotheses are not adopted Foundation inputs, and this node does not establish K1, K3 or K4 closure.
Definition code
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
namespace APFB07.Ties
section
variable {Way Cfg : Type*} [DecidableEq Cfg]
/-- The number of ways that reach a final option. -/
def waysTo (W : Finset Way) (F : Way → Finset Cfg) (G : Cfg) : ℕ :=
(W.filter (fun w => G ∈ F w)).card
/-- Chances composed stage by stage: a way is taken with equal chance, then one of its final options
with equal chance. A candidate. -/
noncomputable def composedLaw (W : Finset Way) (F : Way → Finset Cfg) (G : Cfg) : ℝ :=
∑ w ∈ W, (1 / (W.card : ℝ)) * (if G ∈ F w then 1 / ((F w).card : ℝ) else 0)
/-- One commit: nothing is selected until a record is kept, and the final options are then equally
likely. A candidate. -/
noncomputable def oneCommitLaw (W : Finset Way) (F : Way → Finset Cfg) (G : Cfg) : ℝ :=
if G ∈ W.biUnion F then 1 / ((W.biUnion F).card : ℝ) else 0
end
/-! ### The smallest case: two ways, three final options, the middle one reached by both -/
/-- Way `false` leads to options 0 and 1; way `true` leads to options 1 and 2. -/
def exF : Bool → Finset (Fin 3)
| false => {0, 1}
| true => {1, 2}
end APFB07.Ties
Source
Theorems.Thm_APFB07_two_ties_in_succession; Pullbacks v46, SHA-256 5c518f2c5d0acaf7e21908d0256c1a8ddb7126dbe9e25de7c9b0c456c7bced3b. Theorems.Thm_APFB07_two_ties_in_succession; pullbacks v46; SHA-256 5c518f2c5d0acaf7e21908d0256c1a8ddb7126dbe9e25de7c9b0c456c7bced3b