@lapxo/obligations 0.4.4 → 0.4.6

package/vectors/laws/m1-generator-binomial.lean.json

@@ -0,0 +1,162 @@
+{
+  "id": "m1-generator-binomial",
+  "block": "m1-bridge",
+  "claim": "finite-M1-primitive-generator-binomial-identity",
+  "generalDiagonal": {
+    "status": "open",
+    "actualCLTProved": false
+  },
+  "m1Boundary": {
+    "model": "binary-M1-ancestor-first-fixed-quota@1",
+    "finiteIdentityOnly": true,
+    "offdiagLimitProved": false,
+    "diagonalLimitProved": false,
+    "actualCalibrationCertified": false,
+    "publicM1APIImplemented": false,
+    "originalThreeCards": "open"
+  },
+  "proof": {
+    "files": [
+      {
+        "path": "proofs/m1-046-bridge/M0Bridge.lean",
+        "sha256": "sha256:b438b2961b93c62787275e158a90b534a400de8646a0552b099863fa5227c21e"
+      },
+      {
+        "path": "proofs/m1-046-bridge/M1Bridge046.lean",
+        "sha256": "sha256:a21ac1dedb07af4f28752238edd564293967d8177b75979feead44f01f347b9c"
+      },
+      {
+        "path": "proofs/m1-046-bridge/Obligations045/M0Limit.lean",
+        "sha256": "sha256:aedc88b8ba4edf884cacec78da82eef29187ded0199d44674466425af1585b8c"
+      },
+      {
+        "path": "proofs/m1-046-bridge/Obligations045/M0Offdiag.lean",
+        "sha256": "sha256:af8a95d00cd0956acaec06deeebe7156dccf156b698408275c3e710f58c1c1e8"
+      },
+      {
+        "path": "proofs/m1-046-bridge/lake-manifest.json",
+        "sha256": "sha256:fc8b4ba4b08bbcadf736bc8bcf803b5fdedfebafb57dec61ce0106e99964285d"
+      },
+      {
+        "path": "proofs/m1-046-bridge/lakefile.toml",
+        "sha256": "sha256:8a10d2a45af4798c40a903cedc12a03634851fc683c4557fe6711de297b3dc42"
+      },
+      {
+        "path": "proofs/m1-046-bridge/lean-toolchain",
+        "sha256": "sha256:55e97be96000b5e9e290c9e74482e5e317861499a5540353ce845471bded8cea"
+      }
+    ],
+    "mathlib": "c44e0c8ee63ca166450922a373c7409c5d26b00b",
+    "auditedTheorems": [
+      "Obligations046.M1Bridge.branch_normalized",
+      "Obligations046.M1Bridge.branch_nonneg",
+      "Obligations046.M1Bridge.branch_bit_fiber",
+      "Obligations046.M1Bridge.selector_to_member",
+      "Obligations046.M1Bridge.selector_count_fiber",
+      "Obligations046.M1Bridge.rawMass_normalized",
+      "Obligations046.M1Bridge.rawMass_nonneg",
+      "Obligations046.M1Bridge.generator_to_binomial",
+      "Obligations046.M1Bridge.conditional_error_bridge",
+      "Obligations046.M1Bridge.primitive_branch_fiber",
+      "Obligations046.M1Bridge.primitive_normalized",
+      "Obligations046.M1Bridge.primitive_output_is_sequential",
+      "Obligations046.M1Bridge.primitive_member_pushforward",
+      "Obligations046.M1Bridge.primitive_count_fiber",
+      "Obligations046.M1Bridge.primitive_generator_to_binomial",
+      "Obligations046.M1Bridge.bern_nonneg",
+      "Obligations046.M1Bridge.primitive_joint_nonneg",
+      "Obligations046.M1Bridge.primitive_joint_normalized",
+      "Obligations046.M1Bridge.primitive_law_count_expectation",
+      "Obligations046.M1Bridge.primitive_law_count_probability",
+      "Obligations046.M1Bridge.primitive_law_error_bridge",
+      "Obligations046.M1Bridge.latent_normalized",
+      "Obligations046.M1Bridge.mixture_error_bridge",
+      "Obligations046.M1Bridge.zero_ancestor_reduction",
+      "Obligations046.M1Bridge.latent_nonneg",
+      "Obligations046.M1Bridge.fullMass_nonneg",
+      "Obligations046.M1Bridge.fullMass_normalized",
+      "Obligations046.M1Bridge.full_generator_error_bridge"
+    ],
+    "allowedAxioms": [
+      "propext",
+      "Classical.choice",
+      "Quot.sound"
+    ]
+  },
+  "samples": {
+    "inputs": [
+      "contracts/m1-subcauses.json",
+      "contracts/m1-generator-binomial.json",
+      "samples/laws/m1-generator-binomial/yes/sample.json",
+      "samples/laws/m1-generator-binomial/no/sample.json",
+      "vectors/laws/policy.json"
+    ],
+    "digests": {
+      "contracts/m1-subcauses.json": "sha256:8213a6cc3a5ca80a6adb594b9d8f28504c9566200a6d585f675585db2c8d45cc",
+      "contracts/m1-generator-binomial.json": "sha256:83f87903740a1c804d311700a229abf1f2f6a0c7ab1b8378d831dae77337f760",
+      "samples/laws/m1-generator-binomial/yes/sample.json": "sha256:6995cc280bd1fdec157eff9e08eebbddb1c15f328235e4937c2d693cf4648088",
+      "samples/laws/m1-generator-binomial/no/sample.json": "sha256:365a933ff20e6736f0d5742608cdc4b7f49d4d12135d8f2be3b4a1aebc1d749e",
+      "vectors/laws/policy.json": "sha256:e941ce8cd86f0ec31621fa6b4deef9685dc1fead283f4b2fe22a8a58e3d5d939"
+    }
+  },
+  "capturePolicy": {
+    "timeoutMs": 25000,
+    "responseBytes": 65536
+  },
+  "execution": {
+    "profile": "lean-kernel@1",
+    "project": "proofs/m1-046-bridge",
+    "toolchain": "leanprover/lean4:v4.19.0",
+    "compilerIdentity": "6caaee842e94",
+    "targets": [
+      "M1Bridge046"
+    ],
+    "sources": [
+      "M1Bridge046.lean"
+    ],
+    "auditImports": [
+      "M1Bridge046"
+    ],
+    "identityInputs": [
+      "proofs/m1-046-bridge/M0Bridge.lean",
+      "proofs/m1-046-bridge/M1Bridge046.lean",
+      "proofs/m1-046-bridge/Obligations045/M0Limit.lean",
+      "proofs/m1-046-bridge/Obligations045/M0Offdiag.lean",
+      "proofs/m1-046-bridge/lake-manifest.json",
+      "proofs/m1-046-bridge/lakefile.toml",
+      "proofs/m1-046-bridge/lean-toolchain",
+      "vectors/laws/m1-generator-binomial.lean.json",
+      "contracts/m1-subcauses.json",
+      "contracts/m1-generator-binomial.json",
+      "samples/laws/m1-generator-binomial/yes/sample.json",
+      "samples/laws/m1-generator-binomial/no/sample.json",
+      "vectors/laws/policy.json"
+    ],
+    "negative": {
+      "name": "unconditional-child-rate",
+      "source": "import M0Bridge\n\nopen scoped BigOperators\nopen MeasureTheory ProbabilityTheory\nnoncomputable section\nopen Classical\nnamespace Obligations046.M1Bridge\nopen Obligations046.Bridge\n\n/-- Four EXCLUSIVE outcomes of the sequential ancestor-first generator.\nFresh success/failure are distinct elementary outcomes, not a count-law premise. -/\ndef branchMass (p c1 c2 : \u211d) (e : Fin 4) : \u211d :=\n  if e = 0 then c1 else if e = 1 then (1-c1)*c2\n  else if e = 2 then (1-c1)*(1-c2)*p else (1-c1)*(1-c2)*(1-p)\ndef branchBit (A B : Bool) (e : Fin 4) : Bool :=\n  if e = 0 then A else if e = 1 then B else decide (e = 2)\ndef success (p c1 c2 : \u211d) (A B : Bool) : \u211d :=\n  c1*(if A then 1 else 0)+(1-c1)*c2*(if B then 1 else 0)+(1-c1)*(1-c2)*p\n\ntheorem branch_normalized (p c1 c2 : \u211d) : \u2211 e : Fin 4, branchMass p c1 c2 e = 1 := by\n  simp [Fin.sum_univ_succ, branchMass]\n  ring\n\ntheorem branch_nonneg (p c1 c2 : \u211d) (hp : 0 \u2264 p) (hp1 : p \u2264 1)\n    (hc1 : 0 \u2264 c1) (hc1' : c1 \u2264 1) (hc2 : 0 \u2264 c2) (hc2' : c2 \u2264 1)\n    (e : Fin 4) : 0 \u2264 branchMass p c1 c2 e := by\n  have h1 : 0 \u2264 1-c1 := sub_nonneg.mpr hc1'\n  have h2 : 0 \u2264 1-c2 := sub_nonneg.mpr hc2'\n  have h3 : 0 \u2264 1-p := sub_nonneg.mpr hp1\n  unfold branchMass\n  split_ifs <;> positivity\n\ntheorem branch_bit_fiber (p c1 c2 : \u211d) (A B z : Bool) :\n    (\u2211 e : Fin 4, if branchBit A B e = z then branchMass p c1 c2 e else 0) =\n      if z then success p c1 c2 A B else 1-success p c1 c2 A B := by\n  cases A <;> cases B <;> cases z <;>\n    simp [Fin.sum_univ_succ, branchBit, branchMass, success] <;> ring\n\n/-- Bijection between raw named binary member outcomes and subsets, independent of probabilities. -/\ndef subsetBits (n : \u2115) : Finset (Fin n) \u2243 (Fin n \u2192 Bool) where\n  toFun s j := decide (j \u2208 s)\n  invFun z := Finset.univ.filter (fun j => z j)\n  left_inv s := by ext j; simp\n  right_inv z := by funext j; simp\n\ndef memberSubset {n : \u2115} (A B : Bool) (x : Fin n \u2192 Fin 4) : Finset (Fin n) :=\n  Finset.univ.filter (fun j => branchBit A B (x j))\n\ntheorem selector_to_member (p c1 c2 : \u211d) (A B : Bool) (n : \u2115)\n    (f : Finset (Fin n) \u2192 \u211d) :\n    (\u2211 x : Fin n \u2192 Fin 4, (\u220f j, branchMass p c1 c2 (x j))*f (memberSubset A B x)) =\n      \u2211 s : Finset (Fin n), mass (success p c1 c2 A B) s*f s := by\n  have h := product_pushforward (fun (_j : Fin n) e => branchMass p c1 c2 e)\n    (fun _ e => branchBit A B e) (fun z => f ((subsetBits n).symm z))\n  simp only [branch_bit_fiber] at h\n  change _ = _ at h\n  calc\n    _ = \u2211 z : Fin n \u2192 Bool,\n        (\u220f j, if z j then success p c1 c2 A B else 1-success p c1 c2 A B)*\n          f ((subsetBits n).symm z) := by simpa [memberSubset, subsetBits] using h\n    _ = \u2211 s : Finset (Fin n), mass (success p c1 c2 A B) s*f s := by\n      rw [\u2190 (subsetBits n).sum_comp]\n      apply Finset.sum_congr rfl\n      intro s _\n      simp only [Equiv.symm_apply_apply]\n      rw [mass_eq_individual_product]\n      simp [subsetBits]\n\n/-- Push forward literal independent selectors to every joint lineage COUNT event. -/\ntheorem selector_count_fiber (p c1 c2 : \u211d) (A B : Bool) (n : \u2115) (k : Fin (n+1)) :\n    (\u2211 x : Fin n \u2192 Fin 4,\n      if count (memberSubset A B x) = k then \u220f j, branchMass p c1 c2 (x j) else 0) =\n      binMass (success p c1 c2 A B) n k := by\n  have h := selector_to_member p c1 c2 A B n (fun s => if count s = k then 1 else 0)\n  simpa only [mul_ite, mul_one, mul_zero, count_fiber_mass] using h\n\n/-- p and weights/quota domain are exactly the existing M0 domain; c is c1 here.\nThe additional conditional child rate and named parent map are new model parameters. -/\nstructure Model where\n  base : Obligations045.M0.Domain\n  ancestors : \u2115\n  parent : Fin base.K \u2192 Fin ancestors\n  c2 : \u211d\n  c2_nonneg : 0 \u2264 c2\n  c2_lt_one : c2 < 1\n\nabbrev sizes (M : Model) (N : \u2115) (i : Fin M.base.K) :=\n  Obligations045.M0.allocation M.base.w N i\nabbrev Ancestors (M : Model) := Fin M.ancestors \u2192 Bool\nabbrev Leaves (M : Model) := Fin M.base.K \u2192 Bool\nabbrev Raw (M : Model) (N : \u2115) := \u2200 i : Fin M.base.K, Fin (sizes M N i) \u2192 Fin 4\n\ndef q (M : Model) (A : Ancestors M) (B : Leaves M) (i : Fin M.base.K) : \u211d :=\n  success M.base.p M.base.c M.c2 (A (M.parent i)) (B i)\ndef rawMass (M : Model) (N : \u2115) (x : Raw M N) : \u211d :=\n  \u220f i, \u220f j, branchMass M.base.p M.base.c M.c2 (x i j)\ndef counts (M : Model) (N : \u2115) (A : Ancestors M) (B : Leaves M) (x : Raw M N) :=\n  fun i => count (memberSubset (A (M.parent i)) (B i) (x i))\n\ntheorem rawMass_normalized (M : Model) (N : \u2115) : \u2211 x : Raw M N, rawMass M N x = 1 := by\n  calc\n    _ = \u220f i : Fin M.base.K, \u2211 x : Fin (sizes M N i) \u2192 Fin 4,\n        \u220f j, branchMass M.base.p M.base.c M.c2 (x j) :=\n      (Fintype.prod_sum (fun i (x : Fin (sizes M N i) \u2192 Fin 4) =>\n        \u220f j, branchMass M.base.p M.base.c M.c2 (x j))).symm\n    _ = 1 := by\n      apply Finset.prod_eq_one\n      intro i _\n      rw [\u2190 Fintype.prod_sum (fun (_j : Fin (sizes M N i)) e => branchMass M.base.p M.base.c M.c2 e)]\n      simp only [branch_normalized, Finset.prod_const_one]\n\ntheorem rawMass_nonneg (M : Model) (N : \u2115) (x : Raw M N) : 0 \u2264 rawMass M N x := by\n  apply Finset.prod_nonneg\n  intro i _\n  apply Finset.prod_nonneg\n  intro j _\n  exact branch_nonneg _ _ _ (by linarith [M.base.p_half]) M.base.p_lt_one.le\n    M.base.c_nonneg M.base.c_lt_one.le M.c2_nonneg M.c2_lt_one.le _\n\n/-- Full finite expectation bridge: no binomial count premise, limit premise or CLT. -/\ntheorem generator_to_binomial (M : Model) (N : \u2115) (A : Ancestors M) (B : Leaves M)\n    (f : (\u2200 i : Fin M.base.K, Fin (sizes M N i+1)) \u2192 \u211d) :\n    (\u2211 x : Raw M N, rawMass M N x*f (counts M N A B x)) =\n      \u2211 k : \u2200 i : Fin M.base.K, Fin (sizes M N i+1),\n        (\u220f i, binMass (q M A B i) (sizes M N i) (k i))*f k := by\n  have h := product_pushforward\n    (fun i (x : Fin (sizes M N i) \u2192 Fin 4) => \u220f j, branchMass M.base.p M.base.c M.c2 (x j))\n    (fun i x => count (memberSubset (A (M.parent i)) (B i) x)) f\n  simpa only [selector_count_fiber, q, rawMass, counts] using h\n\ndef rawError (M : Model) (N : \u2115) (A : Ancestors M) (B : Leaves M) : \u211d :=\n  \u2211 x : Raw M N, rawMass M N x *\n    Obligations045.M0.fairLoss (\u2211 i, (counts M N A B x i : \u2115)) N\n\ndef binomialError (M : Model) (N : \u2115) (A : Ancestors M) (B : Leaves M) : \u211d :=\n  \u2211 k : \u2200 i : Fin M.base.K, Fin (sizes M N i+1),\n    (\u220f i, binMass (q M A B i) (sizes M N i) (k i))*\n      Obligations045.M0.fairLoss (\u2211 i, (k i : \u2115)) N\n\ntheorem conditional_error_bridge (M : Model) (N : \u2115) (A : Ancestors M) (B : Leaves M) :\n    rawError M N A B = binomialError M N A B :=\n  by\n    simpa only [rawError, binomialError] using generator_to_binomial M N A B\n      (fun k => Obligations045.M0.fairLoss (\u2211 i, (k i : \u2115)) N)\n\n/-- Primitive jointly independent ancestor-selector, child-selector and fresh-vote bits.\nUnused primitive draws are retained in the world and summed out, not conditioned away. -/\nabbrev Primitive := Bool \u00d7 Bool \u00d7 Bool\ndef bernMass (r : \u211d) (b : Bool) : \u211d := if b then r else 1-r\ndef primitiveMass (p c1 c2 : \u211d) (t : Primitive) : \u211d :=\n  bernMass c1 t.1 * bernMass c2 t.2.1 * bernMass p t.2.2\ndef primitiveBranch (t : Primitive) : Fin 4 :=\n  if t.1 then 0 else if t.2.1 then 1 else if t.2.2 then 2 else 3\n\ntheorem primitive_branch_fiber (p c1 c2 : \u211d) (e : Fin 4) :\n    (\u2211 t : Primitive, if primitiveBranch t = e then primitiveMass p c1 c2 t else 0) =\n      branchMass p c1 c2 e := by\n  fin_cases e <;>\n    simp [Fintype.sum_prod_type, Fintype.sum_bool, primitiveBranch, primitiveMass, bernMass, branchMass] <;> ring\n\ntheorem primitive_normalized (p c1 c2 : \u211d) : \u2211 t : Primitive, primitiveMass p c1 c2 t = 1 := by\n  simp [Fintype.sum_prod_type, Fintype.sum_bool, primitiveMass, bernMass]\n  ring\n\ntheorem primitive_output_is_sequential (A B : Bool) (t : Primitive) :\n    branchBit A B (primitiveBranch t) =\n      if t.1 then A else if t.2.1 then B else t.2.2 := by\n  rcases t with \u27e8u,v,f\u27e9\n  cases u <;> cases v <;> cases f <;> rfl\n\ntheorem primitive_member_pushforward (p c1 c2 : \u211d) (n : \u2115)\n    (f : (Fin n \u2192 Fin 4) \u2192 \u211d) :\n    (\u2211 t : Fin n \u2192 Primitive, (\u220f j, primitiveMass p c1 c2 (t j))*\n      f (fun j => primitiveBranch (t j))) =\n      \u2211 x : Fin n \u2192 Fin 4, (\u220f j, branchMass p c1 c2 (x j))*f x := by\n  simpa only [primitive_branch_fiber] using product_pushforward\n    (fun (_j : Fin n) t => primitiveMass p c1 c2 t) (fun _ => primitiveBranch) f\n\ntheorem primitive_count_fiber (p c1 c2 : \u211d) (A B : Bool) (n : \u2115) (k : Fin (n+1)) :\n    (\u2211 t : Fin n \u2192 Primitive,\n      if count (memberSubset A B (fun j => primitiveBranch (t j))) = k\n      then \u220f j, primitiveMass p c1 c2 (t j) else 0) =\n      binMass (success p c1 c2 A B) n k := by\n  have h := primitive_member_pushforward p c1 c2 n\n    (fun x => if count (memberSubset A B x) = k then 1 else 0)\n  simpa only [mul_ite, mul_one, mul_zero, selector_count_fiber] using h\n\nabbrev PrimitiveWorld (M : Model) (N : \u2115) :=\n  \u2200 i : Fin M.base.K, Fin (sizes M N i) \u2192 Primitive\ndef primitiveJointMass (M : Model) (N : \u2115) (x : PrimitiveWorld M N) : \u211d :=\n  \u220f i, \u220f j, primitiveMass M.base.p M.base.c M.c2 (x i j)\ndef primitiveCounts (M : Model) (N : \u2115) (A : Ancestors M) (B : Leaves M)\n    (x : PrimitiveWorld M N) :=\n  fun i => count (memberSubset (A (M.parent i)) (B i) (fun j => primitiveBranch (x i j)))\n\n/-- The main bridge begins with the THREE INDEPENDENT PRIMITIVE BITS per named member,\nnot assumed Bernoulli output bits or an assumed binomial count distribution. -/\ntheorem primitive_generator_to_binomial (M : Model) (N : \u2115) (A : Ancestors M) (B : Leaves M)\n    (f : (\u2200 i : Fin M.base.K, Fin (sizes M N i+1)) \u2192 \u211d) :\n    (\u2211 x : PrimitiveWorld M N, primitiveJointMass M N x*f (primitiveCounts M N A B x)) =\n      \u2211 k : \u2200 i : Fin M.base.K, Fin (sizes M N i+1),\n        (\u220f i, binMass (q M A B i) (sizes M N i) (k i))*f k := by\n  have h := product_pushforward\n    (fun i (x : Fin (sizes M N i) \u2192 Primitive) => \u220f j, primitiveMass M.base.p M.base.c M.c2 (x j))\n    (fun i x => count (memberSubset (A (M.parent i)) (B i) (fun j => primitiveBranch (x j)))) f\n  simpa only [primitive_count_fiber, primitiveJointMass, primitiveCounts, q] using h\n\ntheorem bern_nonneg (r : \u211d) (hr : 0 \u2264 r) (hr1 : r \u2264 1) (b : Bool) :\n    0 \u2264 bernMass r b := by\n  cases b <;> simp only [bernMass, Bool.false_eq_true, ite_false, ite_true]\n  \u00b7 exact sub_nonneg.mpr hr1\n  \u00b7 exact hr\n\ntheorem primitive_joint_nonneg (M : Model) (N : \u2115) (x : PrimitiveWorld M N) :\n    0 \u2264 primitiveJointMass M N x := by\n  apply Finset.prod_nonneg\n  intro i _\n  apply Finset.prod_nonneg\n  intro j _\n  exact mul_nonneg\n    (mul_nonneg (bern_nonneg _ M.base.c_nonneg M.base.c_lt_one.le _)\n      (bern_nonneg _ M.c2_nonneg M.c2_lt_one.le _))\n    (bern_nonneg _ (by linarith [M.base.p_half]) M.base.p_lt_one.le _)\n\ntheorem primitive_joint_normalized (M : Model) (N : \u2115) :\n    \u2211 x : PrimitiveWorld M N, primitiveJointMass M N x = 1 := by\n  calc\n    _ = \u220f i : Fin M.base.K, \u2211 x : Fin (sizes M N i) \u2192 Primitive,\n        \u220f j, primitiveMass M.base.p M.base.c M.c2 (x j) :=\n      (Fintype.prod_sum (fun i (x : Fin (sizes M N i) \u2192 Primitive) =>\n        \u220f j, primitiveMass M.base.p M.base.c M.c2 (x j))).symm\n    _ = 1 := by\n      apply Finset.prod_eq_one\n      intro i _\n      rw [\u2190 Fintype.prod_sum (fun (_j : Fin (sizes M N i)) t => primitiveMass M.base.p M.base.c M.c2 t)]\n      simp only [primitive_normalized, Finset.prod_const_one]\n\ninstance primitiveMeasurableSpace (M : Model) (N : \u2115) :\n    MeasurableSpace (PrimitiveWorld M N) := \u22a4\ninstance primitiveDiscreteMeasurable (M : Model) (N : \u2115) :\n    DiscreteMeasurableSpace (PrimitiveWorld M N) := \u27e8fun _ => trivial\u27e9\n\n/-- Genuine finite PMF on independent primitive bits; no binomial premise. -/\ndef primitiveLaw (M : Model) (N : \u2115) : PMF (PrimitiveWorld M N) :=\n  PMF.ofFintype (fun x => ENNReal.ofReal (primitiveJointMass M N x)) (by\n    rw [\u2190 ENNReal.ofReal_sum_of_nonneg]\n    \u00b7 simp [primitive_joint_normalized]\n    \u00b7 intro x _\n      exact primitive_joint_nonneg M N x)\n\ntheorem primitive_law_count_expectation (M : Model) (N : \u2115)\n    (A : Ancestors M) (B : Leaves M)\n    (f : (\u2200 i : Fin M.base.K, Fin (sizes M N i+1)) \u2192 \u211d) :\n    (\u222b x, f (primitiveCounts M N A B x) \u2202(primitiveLaw M N).toMeasure) =\n      \u2211 k : \u2200 i : Fin M.base.K, Fin (sizes M N i+1),\n        (\u220f i, binMass (q M A B i) (sizes M N i) (k i))*f k := by\n  rw [PMF.integral_eq_sum]\n  calc\n    _ = \u2211 x : PrimitiveWorld M N,\n        primitiveJointMass M N x*f (primitiveCounts M N A B x) := by\n      apply Finset.sum_congr rfl\n      intro x _\n      simp only [primitiveLaw, PMF.ofFintype_apply, smul_eq_mul]\n      rw [ENNReal.toReal_ofReal (primitive_joint_nonneg M N x)]\n    _ = _ := primitive_generator_to_binomial M N A B f\n\ntheorem primitive_law_count_probability (M : Model) (N : \u2115)\n    (A : Ancestors M) (B : Leaves M) (k : \u2200 i : Fin M.base.K, Fin (sizes M N i+1)) :\n    (\u222b x, if primitiveCounts M N A B x = k then (1:\u211d) else 0\n      \u2202(primitiveLaw M N).toMeasure) = \u220f i, binMass (q M A B i) (sizes M N i) (k i) := by\n  simpa using primitive_law_count_expectation M N A B (fun z => if z = k then (1:\u211d) else 0)\n\ntheorem primitive_law_error_bridge (M : Model) (N : \u2115) (A : Ancestors M) (B : Leaves M) :\n    (\u222b x, Obligations045.M0.fairLoss (\u2211 i, (primitiveCounts M N A B x i : \u2115)) N\n      \u2202(primitiveLaw M N).toMeasure) = binomialError M N A B :=\n  by\n    simpa only [binomialError] using primitive_law_count_expectation M N A B\n      (fun k => Obligations045.M0.fairLoss (\u2211 i, (k i : \u2115)) N)\n\ndef latentMass (M : Model) (A : Ancestors M) (B : Leaves M) : \u211d :=\n  (\u220f g, bernMass M.base.p (A g))*(\u220f i, bernMass M.base.p (B i))\n\ntheorem latent_normalized (M : Model) :\n    \u2211 A : Ancestors M, \u2211 B : Leaves M, latentMass M A B = 1 := by\n  have ha : (\u2211 A : Ancestors M, \u220f g, bernMass M.base.p (A g)) = 1 := by\n    rw [\u2190 Fintype.prod_sum]\n    simp [Fintype.sum_bool, bernMass]\n  have hb : (\u2211 B : Leaves M, \u220f i, bernMass M.base.p (B i)) = 1 := by\n    rw [\u2190 Fintype.prod_sum]\n    simp [Fintype.sum_bool, bernMass]\n  simp only [latentMass, \u2190 Finset.mul_sum, hb, mul_one, ha]\n\ntheorem mixture_error_bridge (M : Model) (N : \u2115) :\n    (\u2211 A : Ancestors M, \u2211 B : Leaves M, latentMass M A B *\n      \u222b x, Obligations045.M0.fairLoss (\u2211 i, (primitiveCounts M N A B x i : \u2115)) N\n        \u2202(primitiveLaw M N).toMeasure) =\n      \u2211 A : Ancestors M, \u2211 B : Leaves M, latentMass M A B * binomialError M N A B := by\n  simp only [primitive_law_error_bridge]\n\n/-- Pure algebraic reduction only; no new limit or uncertainty certificate. -/\ntheorem zero_ancestor_reduction (M : Model) (A : Ancestors M) (B : Leaves M)\n    (hc : M.base.c = 0) (i : Fin M.base.K) :\n    q M A B i = (1-M.c2)*M.base.p + if B i then M.c2 else 0 := by\n  cases h : B i <;> simp [q, success, hc, h, add_comm]\n\ntheorem latent_nonneg (M : Model) (A : Ancestors M) (B : Leaves M) :\n    0 \u2264 latentMass M A B := by\n  apply mul_nonneg <;> apply Finset.prod_nonneg <;> intro i _ <;>\n    exact bern_nonneg _ (by linarith [M.base.p_half]) M.base.p_lt_one.le _\n\nabbrev FullWorld (M : Model) (N : \u2115) := (Ancestors M \u00d7 Leaves M) \u00d7 PrimitiveWorld M N\ndef fullMass (M : Model) (N : \u2115) (x : FullWorld M N) : \u211d :=\n  latentMass M x.1.1 x.1.2 * primitiveJointMass M N x.2\n\ntheorem fullMass_nonneg (M : Model) (N : \u2115) (x : FullWorld M N) : 0 \u2264 fullMass M N x :=\n  mul_nonneg (latent_nonneg M _ _) (primitive_joint_nonneg M N _)\n\ntheorem fullMass_normalized (M : Model) (N : \u2115) : \u2211 x : FullWorld M N, fullMass M N x = 1 := by\n  simp only [Fintype.sum_prod_type, fullMass, \u2190 Finset.mul_sum,\n    primitive_joint_normalized, mul_one, latent_normalized]\n\ninstance fullMeasurableSpace (M : Model) (N : \u2115) : MeasurableSpace (FullWorld M N) := \u22a4\ninstance fullDiscreteMeasurable (M : Model) (N : \u2115) :\n    DiscreteMeasurableSpace (FullWorld M N) := \u27e8fun _ => trivial\u27e9\n\n/-- The COMPLETE finite generative law includes jointly independent latent bits\nand all independent selector/fresh primitive draws. -/\ndef fullLaw (M : Model) (N : \u2115) : PMF (FullWorld M N) :=\n  PMF.ofFintype (fun x => ENNReal.ofReal (fullMass M N x)) (by\n    rw [\u2190 ENNReal.ofReal_sum_of_nonneg]\n    \u00b7 simp [fullMass_normalized]\n    \u00b7 intro x _\n      exact fullMass_nonneg M N x)\n\ndef implementationError (M : Model) (N : \u2115) : \u211d :=\n  \u2211 A : Ancestors M, \u2211 B : Leaves M, latentMass M A B * binomialError M N A B\n\n/-- Complete generator\u2013implementation bridge for every finiteN. No count distribution,\nerror convergence, causal identification or oracle-free calibration is assumed. -/\ntheorem full_generator_error_bridge (M : Model) (N : \u2115) :\n    (\u222b x, Obligations045.M0.fairLoss\n      (\u2211 i, (primitiveCounts M N x.1.1 x.1.2 x.2 i : \u2115)) N \u2202(fullLaw M N).toMeasure) =\n      implementationError M N := by\n  rw [PMF.integral_eq_sum]\n  have hp (x : FullWorld M N) : ((fullLaw M N) x).toReal = fullMass M N x := by\n    simp only [fullLaw, PMF.ofFintype_apply]\n    exact ENNReal.toReal_ofReal (fullMass_nonneg M N x)\n  simp_rw [smul_eq_mul, hp]\n  simp only [Fintype.sum_prod_type, implementationError, fullMass, mul_assoc]\n  apply Finset.sum_congr rfl\n  intro A _\n  apply Finset.sum_congr rfl\n  intro B _\n  rw [\u2190 Finset.mul_sum]\n  congr 1\n  simpa only [binomialError] using primitive_generator_to_binomial M N A B\n    (fun k => Obligations045.M0.fairLoss (\u2211 i, (k i : \u2115)) N)\n\nend Obligations046.M1Bridge\n\nopen Obligations046.M1Bridge\nexample : success (2/3) (1/2) (1/2) false true = (1/2:\u211d) := by norm_num [success, branchMass]\n",
+      "exitCode": 1,
+      "cause": [
+        "unsolved goals"
+      ]
+    },
+    "extraNegatives": [
+      {
+        "name": "priority-erased",
+        "source": "import M0Bridge\n\nopen scoped BigOperators\nopen MeasureTheory ProbabilityTheory\nnoncomputable section\nopen Classical\nnamespace Obligations046.M1Bridge\nopen Obligations046.Bridge\n\n/-- Four EXCLUSIVE outcomes of the sequential ancestor-first generator.\nFresh success/failure are distinct elementary outcomes, not a count-law premise. -/\ndef branchMass (p c1 c2 : \u211d) (e : Fin 4) : \u211d :=\n  if e = 0 then c1 else if e = 1 then (1-c1)*c2\n  else if e = 2 then (1-c1)*(1-c2)*p else (1-c1)*(1-c2)*(1-p)\ndef branchBit (A B : Bool) (e : Fin 4) : Bool :=\n  if e = 0 then A else if e = 1 then B else decide (e = 2)\ndef success (p c1 c2 : \u211d) (A B : Bool) : \u211d :=\n  c1*(if A then 1 else 0)+(1-c1)*c2*(if B then 1 else 0)+(1-c1)*(1-c2)*p\n\ntheorem branch_normalized (p c1 c2 : \u211d) : \u2211 e : Fin 4, branchMass p c1 c2 e = 1 := by\n  simp [Fin.sum_univ_succ, branchMass]\n  ring\n\ntheorem branch_nonneg (p c1 c2 : \u211d) (hp : 0 \u2264 p) (hp1 : p \u2264 1)\n    (hc1 : 0 \u2264 c1) (hc1' : c1 \u2264 1) (hc2 : 0 \u2264 c2) (hc2' : c2 \u2264 1)\n    (e : Fin 4) : 0 \u2264 branchMass p c1 c2 e := by\n  have h1 : 0 \u2264 1-c1 := sub_nonneg.mpr hc1'\n  have h2 : 0 \u2264 1-c2 := sub_nonneg.mpr hc2'\n  have h3 : 0 \u2264 1-p := sub_nonneg.mpr hp1\n  unfold branchMass\n  split_ifs <;> positivity\n\ntheorem branch_bit_fiber (p c1 c2 : \u211d) (A B z : Bool) :\n    (\u2211 e : Fin 4, if branchBit A B e = z then branchMass p c1 c2 e else 0) =\n      if z then success p c1 c2 A B else 1-success p c1 c2 A B := by\n  cases A <;> cases B <;> cases z <;>\n    simp [Fin.sum_univ_succ, branchBit, branchMass, success] <;> ring\n\n/-- Bijection between raw named binary member outcomes and subsets, independent of probabilities. -/\ndef subsetBits (n : \u2115) : Finset (Fin n) \u2243 (Fin n \u2192 Bool) where\n  toFun s j := decide (j \u2208 s)\n  invFun z := Finset.univ.filter (fun j => z j)\n  left_inv s := by ext j; simp\n  right_inv z := by funext j; simp\n\ndef memberSubset {n : \u2115} (A B : Bool) (x : Fin n \u2192 Fin 4) : Finset (Fin n) :=\n  Finset.univ.filter (fun j => branchBit A B (x j))\n\ntheorem selector_to_member (p c1 c2 : \u211d) (A B : Bool) (n : \u2115)\n    (f : Finset (Fin n) \u2192 \u211d) :\n    (\u2211 x : Fin n \u2192 Fin 4, (\u220f j, branchMass p c1 c2 (x j))*f (memberSubset A B x)) =\n      \u2211 s : Finset (Fin n), mass (success p c1 c2 A B) s*f s := by\n  have h := product_pushforward (fun (_j : Fin n) e => branchMass p c1 c2 e)\n    (fun _ e => branchBit A B e) (fun z => f ((subsetBits n).symm z))\n  simp only [branch_bit_fiber] at h\n  change _ = _ at h\n  calc\n    _ = \u2211 z : Fin n \u2192 Bool,\n        (\u220f j, if z j then success p c1 c2 A B else 1-success p c1 c2 A B)*\n          f ((subsetBits n).symm z) := by simpa [memberSubset, subsetBits] using h\n    _ = \u2211 s : Finset (Fin n), mass (success p c1 c2 A B) s*f s := by\n      rw [\u2190 (subsetBits n).sum_comp]\n      apply Finset.sum_congr rfl\n      intro s _\n      simp only [Equiv.symm_apply_apply]\n      rw [mass_eq_individual_product]\n      simp [subsetBits]\n\n/-- Push forward literal independent selectors to every joint lineage COUNT event. -/\ntheorem selector_count_fiber (p c1 c2 : \u211d) (A B : Bool) (n : \u2115) (k : Fin (n+1)) :\n    (\u2211 x : Fin n \u2192 Fin 4,\n      if count (memberSubset A B x) = k then \u220f j, branchMass p c1 c2 (x j) else 0) =\n      binMass (success p c1 c2 A B) n k := by\n  have h := selector_to_member p c1 c2 A B n (fun s => if count s = k then 1 else 0)\n  simpa only [mul_ite, mul_one, mul_zero, count_fiber_mass] using h\n\n/-- p and weights/quota domain are exactly the existing M0 domain; c is c1 here.\nThe additional conditional child rate and named parent map are new model parameters. -/\nstructure Model where\n  base : Obligations045.M0.Domain\n  ancestors : \u2115\n  parent : Fin base.K \u2192 Fin ancestors\n  c2 : \u211d\n  c2_nonneg : 0 \u2264 c2\n  c2_lt_one : c2 < 1\n\nabbrev sizes (M : Model) (N : \u2115) (i : Fin M.base.K) :=\n  Obligations045.M0.allocation M.base.w N i\nabbrev Ancestors (M : Model) := Fin M.ancestors \u2192 Bool\nabbrev Leaves (M : Model) := Fin M.base.K \u2192 Bool\nabbrev Raw (M : Model) (N : \u2115) := \u2200 i : Fin M.base.K, Fin (sizes M N i) \u2192 Fin 4\n\ndef q (M : Model) (A : Ancestors M) (B : Leaves M) (i : Fin M.base.K) : \u211d :=\n  success M.base.p M.base.c M.c2 (A (M.parent i)) (B i)\ndef rawMass (M : Model) (N : \u2115) (x : Raw M N) : \u211d :=\n  \u220f i, \u220f j, branchMass M.base.p M.base.c M.c2 (x i j)\ndef counts (M : Model) (N : \u2115) (A : Ancestors M) (B : Leaves M) (x : Raw M N) :=\n  fun i => count (memberSubset (A (M.parent i)) (B i) (x i))\n\ntheorem rawMass_normalized (M : Model) (N : \u2115) : \u2211 x : Raw M N, rawMass M N x = 1 := by\n  calc\n    _ = \u220f i : Fin M.base.K, \u2211 x : Fin (sizes M N i) \u2192 Fin 4,\n        \u220f j, branchMass M.base.p M.base.c M.c2 (x j) :=\n      (Fintype.prod_sum (fun i (x : Fin (sizes M N i) \u2192 Fin 4) =>\n        \u220f j, branchMass M.base.p M.base.c M.c2 (x j))).symm\n    _ = 1 := by\n      apply Finset.prod_eq_one\n      intro i _\n      rw [\u2190 Fintype.prod_sum (fun (_j : Fin (sizes M N i)) e => branchMass M.base.p M.base.c M.c2 e)]\n      simp only [branch_normalized, Finset.prod_const_one]\n\ntheorem rawMass_nonneg (M : Model) (N : \u2115) (x : Raw M N) : 0 \u2264 rawMass M N x := by\n  apply Finset.prod_nonneg\n  intro i _\n  apply Finset.prod_nonneg\n  intro j _\n  exact branch_nonneg _ _ _ (by linarith [M.base.p_half]) M.base.p_lt_one.le\n    M.base.c_nonneg M.base.c_lt_one.le M.c2_nonneg M.c2_lt_one.le _\n\n/-- Full finite expectation bridge: no binomial count premise, limit premise or CLT. -/\ntheorem generator_to_binomial (M : Model) (N : \u2115) (A : Ancestors M) (B : Leaves M)\n    (f : (\u2200 i : Fin M.base.K, Fin (sizes M N i+1)) \u2192 \u211d) :\n    (\u2211 x : Raw M N, rawMass M N x*f (counts M N A B x)) =\n      \u2211 k : \u2200 i : Fin M.base.K, Fin (sizes M N i+1),\n        (\u220f i, binMass (q M A B i) (sizes M N i) (k i))*f k := by\n  have h := product_pushforward\n    (fun i (x : Fin (sizes M N i) \u2192 Fin 4) => \u220f j, branchMass M.base.p M.base.c M.c2 (x j))\n    (fun i x => count (memberSubset (A (M.parent i)) (B i) x)) f\n  simpa only [selector_count_fiber, q, rawMass, counts] using h\n\ndef rawError (M : Model) (N : \u2115) (A : Ancestors M) (B : Leaves M) : \u211d :=\n  \u2211 x : Raw M N, rawMass M N x *\n    Obligations045.M0.fairLoss (\u2211 i, (counts M N A B x i : \u2115)) N\n\ndef binomialError (M : Model) (N : \u2115) (A : Ancestors M) (B : Leaves M) : \u211d :=\n  \u2211 k : \u2200 i : Fin M.base.K, Fin (sizes M N i+1),\n    (\u220f i, binMass (q M A B i) (sizes M N i) (k i))*\n      Obligations045.M0.fairLoss (\u2211 i, (k i : \u2115)) N\n\ntheorem conditional_error_bridge (M : Model) (N : \u2115) (A : Ancestors M) (B : Leaves M) :\n    rawError M N A B = binomialError M N A B :=\n  by\n    simpa only [rawError, binomialError] using generator_to_binomial M N A B\n      (fun k => Obligations045.M0.fairLoss (\u2211 i, (k i : \u2115)) N)\n\n/-- Primitive jointly independent ancestor-selector, child-selector and fresh-vote bits.\nUnused primitive draws are retained in the world and summed out, not conditioned away. -/\nabbrev Primitive := Bool \u00d7 Bool \u00d7 Bool\ndef bernMass (r : \u211d) (b : Bool) : \u211d := if b then r else 1-r\ndef primitiveMass (p c1 c2 : \u211d) (t : Primitive) : \u211d :=\n  bernMass c1 t.1 * bernMass c2 t.2.1 * bernMass p t.2.2\ndef primitiveBranch (t : Primitive) : Fin 4 :=\n  if t.1 then 0 else if t.2.1 then 1 else if t.2.2 then 2 else 3\n\ntheorem primitive_branch_fiber (p c1 c2 : \u211d) (e : Fin 4) :\n    (\u2211 t : Primitive, if primitiveBranch t = e then primitiveMass p c1 c2 t else 0) =\n      branchMass p c1 c2 e := by\n  fin_cases e <;>\n    simp [Fintype.sum_prod_type, Fintype.sum_bool, primitiveBranch, primitiveMass, bernMass, branchMass] <;> ring\n\ntheorem primitive_normalized (p c1 c2 : \u211d) : \u2211 t : Primitive, primitiveMass p c1 c2 t = 1 := by\n  simp [Fintype.sum_prod_type, Fintype.sum_bool, primitiveMass, bernMass]\n  ring\n\ntheorem primitive_output_is_sequential (A B : Bool) (t : Primitive) :\n    branchBit A B (primitiveBranch t) =\n      if t.1 then A else if t.2.1 then B else t.2.2 := by\n  rcases t with \u27e8u,v,f\u27e9\n  cases u <;> cases v <;> cases f <;> rfl\n\ntheorem primitive_member_pushforward (p c1 c2 : \u211d) (n : \u2115)\n    (f : (Fin n \u2192 Fin 4) \u2192 \u211d) :\n    (\u2211 t : Fin n \u2192 Primitive, (\u220f j, primitiveMass p c1 c2 (t j))*\n      f (fun j => primitiveBranch (t j))) =\n      \u2211 x : Fin n \u2192 Fin 4, (\u220f j, branchMass p c1 c2 (x j))*f x := by\n  simpa only [primitive_branch_fiber] using product_pushforward\n    (fun (_j : Fin n) t => primitiveMass p c1 c2 t) (fun _ => primitiveBranch) f\n\ntheorem primitive_count_fiber (p c1 c2 : \u211d) (A B : Bool) (n : \u2115) (k : Fin (n+1)) :\n    (\u2211 t : Fin n \u2192 Primitive,\n      if count (memberSubset A B (fun j => primitiveBranch (t j))) = k\n      then \u220f j, primitiveMass p c1 c2 (t j) else 0) =\n      binMass (success p c1 c2 A B) n k := by\n  have h := primitive_member_pushforward p c1 c2 n\n    (fun x => if count (memberSubset A B x) = k then 1 else 0)\n  simpa only [mul_ite, mul_one, mul_zero, selector_count_fiber] using h\n\nabbrev PrimitiveWorld (M : Model) (N : \u2115) :=\n  \u2200 i : Fin M.base.K, Fin (sizes M N i) \u2192 Primitive\ndef primitiveJointMass (M : Model) (N : \u2115) (x : PrimitiveWorld M N) : \u211d :=\n  \u220f i, \u220f j, primitiveMass M.base.p M.base.c M.c2 (x i j)\ndef primitiveCounts (M : Model) (N : \u2115) (A : Ancestors M) (B : Leaves M)\n    (x : PrimitiveWorld M N) :=\n  fun i => count (memberSubset (A (M.parent i)) (B i) (fun j => primitiveBranch (x i j)))\n\n/-- The main bridge begins with the THREE INDEPENDENT PRIMITIVE BITS per named member,\nnot assumed Bernoulli output bits or an assumed binomial count distribution. -/\ntheorem primitive_generator_to_binomial (M : Model) (N : \u2115) (A : Ancestors M) (B : Leaves M)\n    (f : (\u2200 i : Fin M.base.K, Fin (sizes M N i+1)) \u2192 \u211d) :\n    (\u2211 x : PrimitiveWorld M N, primitiveJointMass M N x*f (primitiveCounts M N A B x)) =\n      \u2211 k : \u2200 i : Fin M.base.K, Fin (sizes M N i+1),\n        (\u220f i, binMass (q M A B i) (sizes M N i) (k i))*f k := by\n  have h := product_pushforward\n    (fun i (x : Fin (sizes M N i) \u2192 Primitive) => \u220f j, primitiveMass M.base.p M.base.c M.c2 (x j))\n    (fun i x => count (memberSubset (A (M.parent i)) (B i) (fun j => primitiveBranch (x j)))) f\n  simpa only [primitive_count_fiber, primitiveJointMass, primitiveCounts, q] using h\n\ntheorem bern_nonneg (r : \u211d) (hr : 0 \u2264 r) (hr1 : r \u2264 1) (b : Bool) :\n    0 \u2264 bernMass r b := by\n  cases b <;> simp only [bernMass, Bool.false_eq_true, ite_false, ite_true]\n  \u00b7 exact sub_nonneg.mpr hr1\n  \u00b7 exact hr\n\ntheorem primitive_joint_nonneg (M : Model) (N : \u2115) (x : PrimitiveWorld M N) :\n    0 \u2264 primitiveJointMass M N x := by\n  apply Finset.prod_nonneg\n  intro i _\n  apply Finset.prod_nonneg\n  intro j _\n  exact mul_nonneg\n    (mul_nonneg (bern_nonneg _ M.base.c_nonneg M.base.c_lt_one.le _)\n      (bern_nonneg _ M.c2_nonneg M.c2_lt_one.le _))\n    (bern_nonneg _ (by linarith [M.base.p_half]) M.base.p_lt_one.le _)\n\ntheorem primitive_joint_normalized (M : Model) (N : \u2115) :\n    \u2211 x : PrimitiveWorld M N, primitiveJointMass M N x = 1 := by\n  calc\n    _ = \u220f i : Fin M.base.K, \u2211 x : Fin (sizes M N i) \u2192 Primitive,\n        \u220f j, primitiveMass M.base.p M.base.c M.c2 (x j) :=\n      (Fintype.prod_sum (fun i (x : Fin (sizes M N i) \u2192 Primitive) =>\n        \u220f j, primitiveMass M.base.p M.base.c M.c2 (x j))).symm\n    _ = 1 := by\n      apply Finset.prod_eq_one\n      intro i _\n      rw [\u2190 Fintype.prod_sum (fun (_j : Fin (sizes M N i)) t => primitiveMass M.base.p M.base.c M.c2 t)]\n      simp only [primitive_normalized, Finset.prod_const_one]\n\ninstance primitiveMeasurableSpace (M : Model) (N : \u2115) :\n    MeasurableSpace (PrimitiveWorld M N) := \u22a4\ninstance primitiveDiscreteMeasurable (M : Model) (N : \u2115) :\n    DiscreteMeasurableSpace (PrimitiveWorld M N) := \u27e8fun _ => trivial\u27e9\n\n/-- Genuine finite PMF on independent primitive bits; no binomial premise. -/\ndef primitiveLaw (M : Model) (N : \u2115) : PMF (PrimitiveWorld M N) :=\n  PMF.ofFintype (fun x => ENNReal.ofReal (primitiveJointMass M N x)) (by\n    rw [\u2190 ENNReal.ofReal_sum_of_nonneg]\n    \u00b7 simp [primitive_joint_normalized]\n    \u00b7 intro x _\n      exact primitive_joint_nonneg M N x)\n\ntheorem primitive_law_count_expectation (M : Model) (N : \u2115)\n    (A : Ancestors M) (B : Leaves M)\n    (f : (\u2200 i : Fin M.base.K, Fin (sizes M N i+1)) \u2192 \u211d) :\n    (\u222b x, f (primitiveCounts M N A B x) \u2202(primitiveLaw M N).toMeasure) =\n      \u2211 k : \u2200 i : Fin M.base.K, Fin (sizes M N i+1),\n        (\u220f i, binMass (q M A B i) (sizes M N i) (k i))*f k := by\n  rw [PMF.integral_eq_sum]\n  calc\n    _ = \u2211 x : PrimitiveWorld M N,\n        primitiveJointMass M N x*f (primitiveCounts M N A B x) := by\n      apply Finset.sum_congr rfl\n      intro x _\n      simp only [primitiveLaw, PMF.ofFintype_apply, smul_eq_mul]\n      rw [ENNReal.toReal_ofReal (primitive_joint_nonneg M N x)]\n    _ = _ := primitive_generator_to_binomial M N A B f\n\ntheorem primitive_law_count_probability (M : Model) (N : \u2115)\n    (A : Ancestors M) (B : Leaves M) (k : \u2200 i : Fin M.base.K, Fin (sizes M N i+1)) :\n    (\u222b x, if primitiveCounts M N A B x = k then (1:\u211d) else 0\n      \u2202(primitiveLaw M N).toMeasure) = \u220f i, binMass (q M A B i) (sizes M N i) (k i) := by\n  simpa using primitive_law_count_expectation M N A B (fun z => if z = k then (1:\u211d) else 0)\n\ntheorem primitive_law_error_bridge (M : Model) (N : \u2115) (A : Ancestors M) (B : Leaves M) :\n    (\u222b x, Obligations045.M0.fairLoss (\u2211 i, (primitiveCounts M N A B x i : \u2115)) N\n      \u2202(primitiveLaw M N).toMeasure) = binomialError M N A B :=\n  by\n    simpa only [binomialError] using primitive_law_count_expectation M N A B\n      (fun k => Obligations045.M0.fairLoss (\u2211 i, (k i : \u2115)) N)\n\ndef latentMass (M : Model) (A : Ancestors M) (B : Leaves M) : \u211d :=\n  (\u220f g, bernMass M.base.p (A g))*(\u220f i, bernMass M.base.p (B i))\n\ntheorem latent_normalized (M : Model) :\n    \u2211 A : Ancestors M, \u2211 B : Leaves M, latentMass M A B = 1 := by\n  have ha : (\u2211 A : Ancestors M, \u220f g, bernMass M.base.p (A g)) = 1 := by\n    rw [\u2190 Fintype.prod_sum]\n    simp [Fintype.sum_bool, bernMass]\n  have hb : (\u2211 B : Leaves M, \u220f i, bernMass M.base.p (B i)) = 1 := by\n    rw [\u2190 Fintype.prod_sum]\n    simp [Fintype.sum_bool, bernMass]\n  simp only [latentMass, \u2190 Finset.mul_sum, hb, mul_one, ha]\n\ntheorem mixture_error_bridge (M : Model) (N : \u2115) :\n    (\u2211 A : Ancestors M, \u2211 B : Leaves M, latentMass M A B *\n      \u222b x, Obligations045.M0.fairLoss (\u2211 i, (primitiveCounts M N A B x i : \u2115)) N\n        \u2202(primitiveLaw M N).toMeasure) =\n      \u2211 A : Ancestors M, \u2211 B : Leaves M, latentMass M A B * binomialError M N A B := by\n  simp only [primitive_law_error_bridge]\n\n/-- Pure algebraic reduction only; no new limit or uncertainty certificate. -/\ntheorem zero_ancestor_reduction (M : Model) (A : Ancestors M) (B : Leaves M)\n    (hc : M.base.c = 0) (i : Fin M.base.K) :\n    q M A B i = (1-M.c2)*M.base.p + if B i then M.c2 else 0 := by\n  cases h : B i <;> simp [q, success, hc, h, add_comm]\n\ntheorem latent_nonneg (M : Model) (A : Ancestors M) (B : Leaves M) :\n    0 \u2264 latentMass M A B := by\n  apply mul_nonneg <;> apply Finset.prod_nonneg <;> intro i _ <;>\n    exact bern_nonneg _ (by linarith [M.base.p_half]) M.base.p_lt_one.le _\n\nabbrev FullWorld (M : Model) (N : \u2115) := (Ancestors M \u00d7 Leaves M) \u00d7 PrimitiveWorld M N\ndef fullMass (M : Model) (N : \u2115) (x : FullWorld M N) : \u211d :=\n  latentMass M x.1.1 x.1.2 * primitiveJointMass M N x.2\n\ntheorem fullMass_nonneg (M : Model) (N : \u2115) (x : FullWorld M N) : 0 \u2264 fullMass M N x :=\n  mul_nonneg (latent_nonneg M _ _) (primitive_joint_nonneg M N _)\n\ntheorem fullMass_normalized (M : Model) (N : \u2115) : \u2211 x : FullWorld M N, fullMass M N x = 1 := by\n  simp only [Fintype.sum_prod_type, fullMass, \u2190 Finset.mul_sum,\n    primitive_joint_normalized, mul_one, latent_normalized]\n\ninstance fullMeasurableSpace (M : Model) (N : \u2115) : MeasurableSpace (FullWorld M N) := \u22a4\ninstance fullDiscreteMeasurable (M : Model) (N : \u2115) :\n    DiscreteMeasurableSpace (FullWorld M N) := \u27e8fun _ => trivial\u27e9\n\n/-- The COMPLETE finite generative law includes jointly independent latent bits\nand all independent selector/fresh primitive draws. -/\ndef fullLaw (M : Model) (N : \u2115) : PMF (FullWorld M N) :=\n  PMF.ofFintype (fun x => ENNReal.ofReal (fullMass M N x)) (by\n    rw [\u2190 ENNReal.ofReal_sum_of_nonneg]\n    \u00b7 simp [fullMass_normalized]\n    \u00b7 intro x _\n      exact fullMass_nonneg M N x)\n\ndef implementationError (M : Model) (N : \u2115) : \u211d :=\n  \u2211 A : Ancestors M, \u2211 B : Leaves M, latentMass M A B * binomialError M N A B\n\n/-- Complete generator\u2013implementation bridge for every finiteN. No count distribution,\nerror convergence, causal identification or oracle-free calibration is assumed. -/\ntheorem full_generator_error_bridge (M : Model) (N : \u2115) :\n    (\u222b x, Obligations045.M0.fairLoss\n      (\u2211 i, (primitiveCounts M N x.1.1 x.1.2 x.2 i : \u2115)) N \u2202(fullLaw M N).toMeasure) =\n      implementationError M N := by\n  rw [PMF.integral_eq_sum]\n  have hp (x : FullWorld M N) : ((fullLaw M N) x).toReal = fullMass M N x := by\n    simp only [fullLaw, PMF.ofFintype_apply]\n    exact ENNReal.toReal_ofReal (fullMass_nonneg M N x)\n  simp_rw [smul_eq_mul, hp]\n  simp only [Fintype.sum_prod_type, implementationError, fullMass, mul_assoc]\n  apply Finset.sum_congr rfl\n  intro A _\n  apply Finset.sum_congr rfl\n  intro B _\n  rw [\u2190 Finset.mul_sum]\n  congr 1\n  simpa only [binomialError] using primitive_generator_to_binomial M N A B\n    (fun k => Obligations045.M0.fairLoss (\u2211 i, (k i : \u2115)) N)\n\nend Obligations046.M1Bridge\n\nopen Obligations046.M1Bridge\nexample : success (2/3) (1/2) (1/2) false true = (2/3:\u211d) := by norm_num [success, branchMass]\n",
+        "exitCode": 1,
+        "cause": [
+          "unsolved goals"
+        ]
+      },
+      {
+        "name": "shared-selector-as-independent",
+        "source": "import M0Bridge\n\nopen scoped BigOperators\nopen MeasureTheory ProbabilityTheory\nnoncomputable section\nopen Classical\nnamespace Obligations046.M1Bridge\nopen Obligations046.Bridge\n\n/-- Four EXCLUSIVE outcomes of the sequential ancestor-first generator.\nFresh success/failure are distinct elementary outcomes, not a count-law premise. -/\ndef branchMass (p c1 c2 : \u211d) (e : Fin 4) : \u211d :=\n  if e = 0 then c1 else if e = 1 then (1-c1)*c2\n  else if e = 2 then (1-c1)*(1-c2)*p else (1-c1)*(1-c2)*(1-p)\ndef branchBit (A B : Bool) (e : Fin 4) : Bool :=\n  if e = 0 then A else if e = 1 then B else decide (e = 2)\ndef success (p c1 c2 : \u211d) (A B : Bool) : \u211d :=\n  c1*(if A then 1 else 0)+(1-c1)*c2*(if B then 1 else 0)+(1-c1)*(1-c2)*p\n\ntheorem branch_normalized (p c1 c2 : \u211d) : \u2211 e : Fin 4, branchMass p c1 c2 e = 1 := by\n  simp [Fin.sum_univ_succ, branchMass]\n  ring\n\ntheorem branch_nonneg (p c1 c2 : \u211d) (hp : 0 \u2264 p) (hp1 : p \u2264 1)\n    (hc1 : 0 \u2264 c1) (hc1' : c1 \u2264 1) (hc2 : 0 \u2264 c2) (hc2' : c2 \u2264 1)\n    (e : Fin 4) : 0 \u2264 branchMass p c1 c2 e := by\n  have h1 : 0 \u2264 1-c1 := sub_nonneg.mpr hc1'\n  have h2 : 0 \u2264 1-c2 := sub_nonneg.mpr hc2'\n  have h3 : 0 \u2264 1-p := sub_nonneg.mpr hp1\n  unfold branchMass\n  split_ifs <;> positivity\n\ntheorem branch_bit_fiber (p c1 c2 : \u211d) (A B z : Bool) :\n    (\u2211 e : Fin 4, if branchBit A B e = z then branchMass p c1 c2 e else 0) =\n      if z then success p c1 c2 A B else 1-success p c1 c2 A B := by\n  cases A <;> cases B <;> cases z <;>\n    simp [Fin.sum_univ_succ, branchBit, branchMass, success] <;> ring\n\n/-- Bijection between raw named binary member outcomes and subsets, independent of probabilities. -/\ndef subsetBits (n : \u2115) : Finset (Fin n) \u2243 (Fin n \u2192 Bool) where\n  toFun s j := decide (j \u2208 s)\n  invFun z := Finset.univ.filter (fun j => z j)\n  left_inv s := by ext j; simp\n  right_inv z := by funext j; simp\n\ndef memberSubset {n : \u2115} (A B : Bool) (x : Fin n \u2192 Fin 4) : Finset (Fin n) :=\n  Finset.univ.filter (fun j => branchBit A B (x j))\n\ntheorem selector_to_member (p c1 c2 : \u211d) (A B : Bool) (n : \u2115)\n    (f : Finset (Fin n) \u2192 \u211d) :\n    (\u2211 x : Fin n \u2192 Fin 4, (\u220f j, branchMass p c1 c2 (x j))*f (memberSubset A B x)) =\n      \u2211 s : Finset (Fin n), mass (success p c1 c2 A B) s*f s := by\n  have h := product_pushforward (fun (_j : Fin n) e => branchMass p c1 c2 e)\n    (fun _ e => branchBit A B e) (fun z => f ((subsetBits n).symm z))\n  simp only [branch_bit_fiber] at h\n  change _ = _ at h\n  calc\n    _ = \u2211 z : Fin n \u2192 Bool,\n        (\u220f j, if z j then success p c1 c2 A B else 1-success p c1 c2 A B)*\n          f ((subsetBits n).symm z) := by simpa [memberSubset, subsetBits] using h\n    _ = \u2211 s : Finset (Fin n), mass (success p c1 c2 A B) s*f s := by\n      rw [\u2190 (subsetBits n).sum_comp]\n      apply Finset.sum_congr rfl\n      intro s _\n      simp only [Equiv.symm_apply_apply]\n      rw [mass_eq_individual_product]\n      simp [subsetBits]\n\n/-- Push forward literal independent selectors to every joint lineage COUNT event. -/\ntheorem selector_count_fiber (p c1 c2 : \u211d) (A B : Bool) (n : \u2115) (k : Fin (n+1)) :\n    (\u2211 x : Fin n \u2192 Fin 4,\n      if count (memberSubset A B x) = k then \u220f j, branchMass p c1 c2 (x j) else 0) =\n      binMass (success p c1 c2 A B) n k := by\n  have h := selector_to_member p c1 c2 A B n (fun s => if count s = k then 1 else 0)\n  simpa only [mul_ite, mul_one, mul_zero, count_fiber_mass] using h\n\n/-- p and weights/quota domain are exactly the existing M0 domain; c is c1 here.\nThe additional conditional child rate and named parent map are new model parameters. -/\nstructure Model where\n  base : Obligations045.M0.Domain\n  ancestors : \u2115\n  parent : Fin base.K \u2192 Fin ancestors\n  c2 : \u211d\n  c2_nonneg : 0 \u2264 c2\n  c2_lt_one : c2 < 1\n\nabbrev sizes (M : Model) (N : \u2115) (i : Fin M.base.K) :=\n  Obligations045.M0.allocation M.base.w N i\nabbrev Ancestors (M : Model) := Fin M.ancestors \u2192 Bool\nabbrev Leaves (M : Model) := Fin M.base.K \u2192 Bool\nabbrev Raw (M : Model) (N : \u2115) := \u2200 i : Fin M.base.K, Fin (sizes M N i) \u2192 Fin 4\n\ndef q (M : Model) (A : Ancestors M) (B : Leaves M) (i : Fin M.base.K) : \u211d :=\n  success M.base.p M.base.c M.c2 (A (M.parent i)) (B i)\ndef rawMass (M : Model) (N : \u2115) (x : Raw M N) : \u211d :=\n  \u220f i, \u220f j, branchMass M.base.p M.base.c M.c2 (x i j)\ndef counts (M : Model) (N : \u2115) (A : Ancestors M) (B : Leaves M) (x : Raw M N) :=\n  fun i => count (memberSubset (A (M.parent i)) (B i) (x i))\n\ntheorem rawMass_normalized (M : Model) (N : \u2115) : \u2211 x : Raw M N, rawMass M N x = 1 := by\n  calc\n    _ = \u220f i : Fin M.base.K, \u2211 x : Fin (sizes M N i) \u2192 Fin 4,\n        \u220f j, branchMass M.base.p M.base.c M.c2 (x j) :=\n      (Fintype.prod_sum (fun i (x : Fin (sizes M N i) \u2192 Fin 4) =>\n        \u220f j, branchMass M.base.p M.base.c M.c2 (x j))).symm\n    _ = 1 := by\n      apply Finset.prod_eq_one\n      intro i _\n      rw [\u2190 Fintype.prod_sum (fun (_j : Fin (sizes M N i)) e => branchMass M.base.p M.base.c M.c2 e)]\n      simp only [branch_normalized, Finset.prod_const_one]\n\ntheorem rawMass_nonneg (M : Model) (N : \u2115) (x : Raw M N) : 0 \u2264 rawMass M N x := by\n  apply Finset.prod_nonneg\n  intro i _\n  apply Finset.prod_nonneg\n  intro j _\n  exact branch_nonneg _ _ _ (by linarith [M.base.p_half]) M.base.p_lt_one.le\n    M.base.c_nonneg M.base.c_lt_one.le M.c2_nonneg M.c2_lt_one.le _\n\n/-- Full finite expectation bridge: no binomial count premise, limit premise or CLT. -/\ntheorem generator_to_binomial (M : Model) (N : \u2115) (A : Ancestors M) (B : Leaves M)\n    (f : (\u2200 i : Fin M.base.K, Fin (sizes M N i+1)) \u2192 \u211d) :\n    (\u2211 x : Raw M N, rawMass M N x*f (counts M N A B x)) =\n      \u2211 k : \u2200 i : Fin M.base.K, Fin (sizes M N i+1),\n        (\u220f i, binMass (q M A B i) (sizes M N i) (k i))*f k := by\n  have h := product_pushforward\n    (fun i (x : Fin (sizes M N i) \u2192 Fin 4) => \u220f j, branchMass M.base.p M.base.c M.c2 (x j))\n    (fun i x => count (memberSubset (A (M.parent i)) (B i) x)) f\n  simpa only [selector_count_fiber, q, rawMass, counts] using h\n\ndef rawError (M : Model) (N : \u2115) (A : Ancestors M) (B : Leaves M) : \u211d :=\n  \u2211 x : Raw M N, rawMass M N x *\n    Obligations045.M0.fairLoss (\u2211 i, (counts M N A B x i : \u2115)) N\n\ndef binomialError (M : Model) (N : \u2115) (A : Ancestors M) (B : Leaves M) : \u211d :=\n  \u2211 k : \u2200 i : Fin M.base.K, Fin (sizes M N i+1),\n    (\u220f i, binMass (q M A B i) (sizes M N i) (k i))*\n      Obligations045.M0.fairLoss (\u2211 i, (k i : \u2115)) N\n\ntheorem conditional_error_bridge (M : Model) (N : \u2115) (A : Ancestors M) (B : Leaves M) :\n    rawError M N A B = binomialError M N A B :=\n  by\n    simpa only [rawError, binomialError] using generator_to_binomial M N A B\n      (fun k => Obligations045.M0.fairLoss (\u2211 i, (k i : \u2115)) N)\n\n/-- Primitive jointly independent ancestor-selector, child-selector and fresh-vote bits.\nUnused primitive draws are retained in the world and summed out, not conditioned away. -/\nabbrev Primitive := Bool \u00d7 Bool \u00d7 Bool\ndef bernMass (r : \u211d) (b : Bool) : \u211d := if b then r else 1-r\ndef primitiveMass (p c1 c2 : \u211d) (t : Primitive) : \u211d :=\n  bernMass c1 t.1 * bernMass c2 t.2.1 * bernMass p t.2.2\ndef primitiveBranch (t : Primitive) : Fin 4 :=\n  if t.1 then 0 else if t.2.1 then 1 else if t.2.2 then 2 else 3\n\ntheorem primitive_branch_fiber (p c1 c2 : \u211d) (e : Fin 4) :\n    (\u2211 t : Primitive, if primitiveBranch t = e then primitiveMass p c1 c2 t else 0) =\n      branchMass p c1 c2 e := by\n  fin_cases e <;>\n    simp [Fintype.sum_prod_type, Fintype.sum_bool, primitiveBranch, primitiveMass, bernMass, branchMass] <;> ring\n\ntheorem primitive_normalized (p c1 c2 : \u211d) : \u2211 t : Primitive, primitiveMass p c1 c2 t = 1 := by\n  simp [Fintype.sum_prod_type, Fintype.sum_bool, primitiveMass, bernMass]\n  ring\n\ntheorem primitive_output_is_sequential (A B : Bool) (t : Primitive) :\n    branchBit A B (primitiveBranch t) =\n      if t.1 then A else if t.2.1 then B else t.2.2 := by\n  rcases t with \u27e8u,v,f\u27e9\n  cases u <;> cases v <;> cases f <;> rfl\n\ntheorem primitive_member_pushforward (p c1 c2 : \u211d) (n : \u2115)\n    (f : (Fin n \u2192 Fin 4) \u2192 \u211d) :\n    (\u2211 t : Fin n \u2192 Primitive, (\u220f j, primitiveMass p c1 c2 (t j))*\n      f (fun j => primitiveBranch (t j))) =\n      \u2211 x : Fin n \u2192 Fin 4, (\u220f j, branchMass p c1 c2 (x j))*f x := by\n  simpa only [primitive_branch_fiber] using product_pushforward\n    (fun (_j : Fin n) t => primitiveMass p c1 c2 t) (fun _ => primitiveBranch) f\n\ntheorem primitive_count_fiber (p c1 c2 : \u211d) (A B : Bool) (n : \u2115) (k : Fin (n+1)) :\n    (\u2211 t : Fin n \u2192 Primitive,\n      if count (memberSubset A B (fun j => primitiveBranch (t j))) = k\n      then \u220f j, primitiveMass p c1 c2 (t j) else 0) =\n      binMass (success p c1 c2 A B) n k := by\n  have h := primitive_member_pushforward p c1 c2 n\n    (fun x => if count (memberSubset A B x) = k then 1 else 0)\n  simpa only [mul_ite, mul_one, mul_zero, selector_count_fiber] using h\n\nabbrev PrimitiveWorld (M : Model) (N : \u2115) :=\n  \u2200 i : Fin M.base.K, Fin (sizes M N i) \u2192 Primitive\ndef primitiveJointMass (M : Model) (N : \u2115) (x : PrimitiveWorld M N) : \u211d :=\n  \u220f i, \u220f j, primitiveMass M.base.p M.base.c M.c2 (x i j)\ndef primitiveCounts (M : Model) (N : \u2115) (A : Ancestors M) (B : Leaves M)\n    (x : PrimitiveWorld M N) :=\n  fun i => count (memberSubset (A (M.parent i)) (B i) (fun j => primitiveBranch (x i j)))\n\n/-- The main bridge begins with the THREE INDEPENDENT PRIMITIVE BITS per named member,\nnot assumed Bernoulli output bits or an assumed binomial count distribution. -/\ntheorem primitive_generator_to_binomial (M : Model) (N : \u2115) (A : Ancestors M) (B : Leaves M)\n    (f : (\u2200 i : Fin M.base.K, Fin (sizes M N i+1)) \u2192 \u211d) :\n    (\u2211 x : PrimitiveWorld M N, primitiveJointMass M N x*f (primitiveCounts M N A B x)) =\n      \u2211 k : \u2200 i : Fin M.base.K, Fin (sizes M N i+1),\n        (\u220f i, binMass (q M A B i) (sizes M N i) (k i))*f k := by\n  have h := product_pushforward\n    (fun i (x : Fin (sizes M N i) \u2192 Primitive) => \u220f j, primitiveMass M.base.p M.base.c M.c2 (x j))\n    (fun i x => count (memberSubset (A (M.parent i)) (B i) (fun j => primitiveBranch (x j)))) f\n  simpa only [primitive_count_fiber, primitiveJointMass, primitiveCounts, q] using h\n\ntheorem bern_nonneg (r : \u211d) (hr : 0 \u2264 r) (hr1 : r \u2264 1) (b : Bool) :\n    0 \u2264 bernMass r b := by\n  cases b <;> simp only [bernMass, Bool.false_eq_true, ite_false, ite_true]\n  \u00b7 exact sub_nonneg.mpr hr1\n  \u00b7 exact hr\n\ntheorem primitive_joint_nonneg (M : Model) (N : \u2115) (x : PrimitiveWorld M N) :\n    0 \u2264 primitiveJointMass M N x := by\n  apply Finset.prod_nonneg\n  intro i _\n  apply Finset.prod_nonneg\n  intro j _\n  exact mul_nonneg\n    (mul_nonneg (bern_nonneg _ M.base.c_nonneg M.base.c_lt_one.le _)\n      (bern_nonneg _ M.c2_nonneg M.c2_lt_one.le _))\n    (bern_nonneg _ (by linarith [M.base.p_half]) M.base.p_lt_one.le _)\n\ntheorem primitive_joint_normalized (M : Model) (N : \u2115) :\n    \u2211 x : PrimitiveWorld M N, primitiveJointMass M N x = 1 := by\n  calc\n    _ = \u220f i : Fin M.base.K, \u2211 x : Fin (sizes M N i) \u2192 Primitive,\n        \u220f j, primitiveMass M.base.p M.base.c M.c2 (x j) :=\n      (Fintype.prod_sum (fun i (x : Fin (sizes M N i) \u2192 Primitive) =>\n        \u220f j, primitiveMass M.base.p M.base.c M.c2 (x j))).symm\n    _ = 1 := by\n      apply Finset.prod_eq_one\n      intro i _\n      rw [\u2190 Fintype.prod_sum (fun (_j : Fin (sizes M N i)) t => primitiveMass M.base.p M.base.c M.c2 t)]\n      simp only [primitive_normalized, Finset.prod_const_one]\n\ninstance primitiveMeasurableSpace (M : Model) (N : \u2115) :\n    MeasurableSpace (PrimitiveWorld M N) := \u22a4\ninstance primitiveDiscreteMeasurable (M : Model) (N : \u2115) :\n    DiscreteMeasurableSpace (PrimitiveWorld M N) := \u27e8fun _ => trivial\u27e9\n\n/-- Genuine finite PMF on independent primitive bits; no binomial premise. -/\ndef primitiveLaw (M : Model) (N : \u2115) : PMF (PrimitiveWorld M N) :=\n  PMF.ofFintype (fun x => ENNReal.ofReal (primitiveJointMass M N x)) (by\n    rw [\u2190 ENNReal.ofReal_sum_of_nonneg]\n    \u00b7 simp [primitive_joint_normalized]\n    \u00b7 intro x _\n      exact primitive_joint_nonneg M N x)\n\ntheorem primitive_law_count_expectation (M : Model) (N : \u2115)\n    (A : Ancestors M) (B : Leaves M)\n    (f : (\u2200 i : Fin M.base.K, Fin (sizes M N i+1)) \u2192 \u211d) :\n    (\u222b x, f (primitiveCounts M N A B x) \u2202(primitiveLaw M N).toMeasure) =\n      \u2211 k : \u2200 i : Fin M.base.K, Fin (sizes M N i+1),\n        (\u220f i, binMass (q M A B i) (sizes M N i) (k i))*f k := by\n  rw [PMF.integral_eq_sum]\n  calc\n    _ = \u2211 x : PrimitiveWorld M N,\n        primitiveJointMass M N x*f (primitiveCounts M N A B x) := by\n      apply Finset.sum_congr rfl\n      intro x _\n      simp only [primitiveLaw, PMF.ofFintype_apply, smul_eq_mul]\n      rw [ENNReal.toReal_ofReal (primitive_joint_nonneg M N x)]\n    _ = _ := primitive_generator_to_binomial M N A B f\n\ntheorem primitive_law_count_probability (M : Model) (N : \u2115)\n    (A : Ancestors M) (B : Leaves M) (k : \u2200 i : Fin M.base.K, Fin (sizes M N i+1)) :\n    (\u222b x, if primitiveCounts M N A B x = k then (1:\u211d) else 0\n      \u2202(primitiveLaw M N).toMeasure) = \u220f i, binMass (q M A B i) (sizes M N i) (k i) := by\n  simpa using primitive_law_count_expectation M N A B (fun z => if z = k then (1:\u211d) else 0)\n\ntheorem primitive_law_error_bridge (M : Model) (N : \u2115) (A : Ancestors M) (B : Leaves M) :\n    (\u222b x, Obligations045.M0.fairLoss (\u2211 i, (primitiveCounts M N A B x i : \u2115)) N\n      \u2202(primitiveLaw M N).toMeasure) = binomialError M N A B :=\n  by\n    simpa only [binomialError] using primitive_law_count_expectation M N A B\n      (fun k => Obligations045.M0.fairLoss (\u2211 i, (k i : \u2115)) N)\n\ndef latentMass (M : Model) (A : Ancestors M) (B : Leaves M) : \u211d :=\n  (\u220f g, bernMass M.base.p (A g))*(\u220f i, bernMass M.base.p (B i))\n\ntheorem latent_normalized (M : Model) :\n    \u2211 A : Ancestors M, \u2211 B : Leaves M, latentMass M A B = 1 := by\n  have ha : (\u2211 A : Ancestors M, \u220f g, bernMass M.base.p (A g)) = 1 := by\n    rw [\u2190 Fintype.prod_sum]\n    simp [Fintype.sum_bool, bernMass]\n  have hb : (\u2211 B : Leaves M, \u220f i, bernMass M.base.p (B i)) = 1 := by\n    rw [\u2190 Fintype.prod_sum]\n    simp [Fintype.sum_bool, bernMass]\n  simp only [latentMass, \u2190 Finset.mul_sum, hb, mul_one, ha]\n\ntheorem mixture_error_bridge (M : Model) (N : \u2115) :\n    (\u2211 A : Ancestors M, \u2211 B : Leaves M, latentMass M A B *\n      \u222b x, Obligations045.M0.fairLoss (\u2211 i, (primitiveCounts M N A B x i : \u2115)) N\n        \u2202(primitiveLaw M N).toMeasure) =\n      \u2211 A : Ancestors M, \u2211 B : Leaves M, latentMass M A B * binomialError M N A B := by\n  simp only [primitive_law_error_bridge]\n\n/-- Pure algebraic reduction only; no new limit or uncertainty certificate. -/\ntheorem zero_ancestor_reduction (M : Model) (A : Ancestors M) (B : Leaves M)\n    (hc : M.base.c = 0) (i : Fin M.base.K) :\n    q M A B i = (1-M.c2)*M.base.p + if B i then M.c2 else 0 := by\n  cases h : B i <;> simp [q, success, hc, h, add_comm]\n\ntheorem latent_nonneg (M : Model) (A : Ancestors M) (B : Leaves M) :\n    0 \u2264 latentMass M A B := by\n  apply mul_nonneg <;> apply Finset.prod_nonneg <;> intro i _ <;>\n    exact bern_nonneg _ (by linarith [M.base.p_half]) M.base.p_lt_one.le _\n\nabbrev FullWorld (M : Model) (N : \u2115) := (Ancestors M \u00d7 Leaves M) \u00d7 PrimitiveWorld M N\ndef fullMass (M : Model) (N : \u2115) (x : FullWorld M N) : \u211d :=\n  latentMass M x.1.1 x.1.2 * primitiveJointMass M N x.2\n\ntheorem fullMass_nonneg (M : Model) (N : \u2115) (x : FullWorld M N) : 0 \u2264 fullMass M N x :=\n  mul_nonneg (latent_nonneg M _ _) (primitive_joint_nonneg M N _)\n\ntheorem fullMass_normalized (M : Model) (N : \u2115) : \u2211 x : FullWorld M N, fullMass M N x = 1 := by\n  simp only [Fintype.sum_prod_type, fullMass, \u2190 Finset.mul_sum,\n    primitive_joint_normalized, mul_one, latent_normalized]\n\ninstance fullMeasurableSpace (M : Model) (N : \u2115) : MeasurableSpace (FullWorld M N) := \u22a4\ninstance fullDiscreteMeasurable (M : Model) (N : \u2115) :\n    DiscreteMeasurableSpace (FullWorld M N) := \u27e8fun _ => trivial\u27e9\n\n/-- The COMPLETE finite generative law includes jointly independent latent bits\nand all independent selector/fresh primitive draws. -/\ndef fullLaw (M : Model) (N : \u2115) : PMF (FullWorld M N) :=\n  PMF.ofFintype (fun x => ENNReal.ofReal (fullMass M N x)) (by\n    rw [\u2190 ENNReal.ofReal_sum_of_nonneg]\n    \u00b7 simp [fullMass_normalized]\n    \u00b7 intro x _\n      exact fullMass_nonneg M N x)\n\ndef implementationError (M : Model) (N : \u2115) : \u211d :=\n  \u2211 A : Ancestors M, \u2211 B : Leaves M, latentMass M A B * binomialError M N A B\n\n/-- Complete generator\u2013implementation bridge for every finiteN. No count distribution,\nerror convergence, causal identification or oracle-free calibration is assumed. -/\ntheorem full_generator_error_bridge (M : Model) (N : \u2115) :\n    (\u222b x, Obligations045.M0.fairLoss\n      (\u2211 i, (primitiveCounts M N x.1.1 x.1.2 x.2 i : \u2115)) N \u2202(fullLaw M N).toMeasure) =\n      implementationError M N := by\n  rw [PMF.integral_eq_sum]\n  have hp (x : FullWorld M N) : ((fullLaw M N) x).toReal = fullMass M N x := by\n    simp only [fullLaw, PMF.ofFintype_apply]\n    exact ENNReal.toReal_ofReal (fullMass_nonneg M N x)\n  simp_rw [smul_eq_mul, hp]\n  simp only [Fintype.sum_prod_type, implementationError, fullMass, mul_assoc]\n  apply Finset.sum_congr rfl\n  intro A _\n  apply Finset.sum_congr rfl\n  intro B _\n  rw [\u2190 Finset.mul_sum]\n  congr 1\n  simpa only [binomialError] using primitive_generator_to_binomial M N A B\n    (fun k => Obligations045.M0.fairLoss (\u2211 i, (k i : \u2115)) N)\n\nend Obligations046.M1Bridge\n\nopen Obligations046.M1Bridge\nexample : branchMass (2/3) (1/2) (1/2) 0 * branchMass (2/3) (1/2) (1/2) 0 = (1/2:\u211d) := by norm_num [success, branchMass]\n",
+        "exitCode": 1,
+        "cause": [
+          "unsolved goals"
+        ]
+      }
+    ]
+  }
+}

package/vectors/laws/m1-generator-binomial.native-capture.json

@@ -0,0 +1,245 @@
+{
+  "archiveApproval": false,
+  "candidatePublicationCorrectionCovered": false,
+  "captures": [
+    {
+      "elapsedMs": 154.70891700000004,
+      "expected": "fact",
+      "name": "orchard-projection",
+      "passed": true,
+      "requestSHA256": "sha256:ffaabefb7b80eca37f2379c2567f31574a682e9ab4e538e59f4e0a2483fdac47",
+      "result": {
+        "kind": "fact",
+        "lines": [
+          "bound-lock/1 at=receipt:1 form=alphabet measure=reads role=reads scope=publication/evidence/m1-generator-binomial value=proofs/m1-046-bridge/M0Bridge.lean|proofs/m1-046-bridge/M1Bridge046.lean|proofs/m1-046-bridge/Obligations045/M0Limit.lean|proofs/m1-046-bridge/Obligations045/M0Offdiag.lean|proofs/m1-046-bridge/lake-manifest.json|proofs/m1-046-bridge/lakefile.toml|proofs/m1-046-bridge/lean-toolchain|vectors/laws/m1-generator-binomial.lean.json|contracts/m1-subcauses.json|contracts/m1-generator-binomial.json|samples/laws/m1-generator-binomial/yes/sample.json|samples/laws/m1-generator-binomial/no/sample.json|vectors/laws/policy.json"
+        ],
+        "protocol": "bound-lock/1"
+      }
+    },
+    {
+      "elapsedMs": 18715.492125,
+      "expected": "fact",
+      "name": "orchard-read",
+      "passed": true,
+      "requestSHA256": "sha256:045c54b5e835faadebc1f24bdc910854a809c728b9d027d9a5c063ac97b44225",
+      "result": {
+        "claims": [
+          {
+            "bound": {
+              "hi": 0,
+              "kind": "interval",
+              "lo": 0
+            },
+            "measure": "count",
+            "role": "writes",
+            "scope": "publication/evidence/m1-generator-binomial"
+          },
+          {
+            "bound": {
+              "kind": "enumerated",
+              "values": [
+                "sha256:0e12cd99729a0fd845942f252bce19cb792b1ccf93da52e9c9b505c006c5a55a"
+              ]
+            },
+            "measure": "digest",
+            "role": "writes",
+            "scope": "publication/evidence/m1-generator-binomial/verification"
+          }
+        ],
+        "kind": "fact",
+        "protocol": "bound-lock/1"
+      }
+    },
+    {
+      "elapsedMs": 175.34216699999888,
+      "expected": "refuse",
+      "name": "orchard-missing-input",
+      "passed": true,
+      "requestSHA256": "sha256:8066fab3d88b690a2e7cd3a2ff79bb8e4bded84411b4966e04e7acdd222dba3d",
+      "result": {
+        "kind": "refuse",
+        "protocol": "bound-lock/1",
+        "why": "Error: REFUSE\u00b7semilattice missing-input proofs/m1-046-bridge/M1Bridge046.lean"
+      }
+    },
+    {
+      "elapsedMs": 154.9879170000022,
+      "expected": "refuse",
+      "name": "orchard-handed-source-differs",
+      "passed": true,
+      "requestSHA256": "sha256:14105c042af91228454b839a810bede3f3d053a0ddc7448fd4a36f0178e2df6a",
+      "result": {
+        "kind": "refuse",
+        "protocol": "bound-lock/1",
+        "why": "Error: REFUSE\u00b7semilattice fixture-source-differs proofs/m1-046-bridge/M1Bridge046.lean"
+      }
+    },
+    {
+      "elapsedMs": 157.64770800000042,
+      "expected": "refuse",
+      "name": "orchard-overstated-M1",
+      "passed": true,
+      "requestSHA256": "sha256:a29bf60bb51385a6a797f2f2d619ac1e3c6e6bc6f5f1cd364a369f9811d614b1",
+      "result": {
+        "kind": "refuse",
+        "protocol": "bound-lock/1",
+        "why": "Error: REFUSE\u00b7semilattice overstated-M1"
+      }
+    },
+    {
+      "elapsedMs": 184.67229099999895,
+      "expected": "fact",
+      "name": "catalog-projection",
+      "passed": true,
+      "requestSHA256": "sha256:ffaabefb7b80eca37f2379c2567f31574a682e9ab4e538e59f4e0a2483fdac47",
+      "result": {
+        "kind": "fact",
+        "lines": [
+          "bound-lock/1 at=receipt:1 form=alphabet measure=reads role=reads scope=publication/evidence/m1-generator-binomial value=proofs/m1-046-bridge/M0Bridge.lean|proofs/m1-046-bridge/M1Bridge046.lean|proofs/m1-046-bridge/Obligations045/M0Limit.lean|proofs/m1-046-bridge/Obligations045/M0Offdiag.lean|proofs/m1-046-bridge/lake-manifest.json|proofs/m1-046-bridge/lakefile.toml|proofs/m1-046-bridge/lean-toolchain|vectors/laws/m1-generator-binomial.lean.json|contracts/m1-subcauses.json|contracts/m1-generator-binomial.json|samples/laws/m1-generator-binomial/yes/sample.json|samples/laws/m1-generator-binomial/no/sample.json|vectors/laws/policy.json"
+        ],
+        "protocol": "bound-lock/1"
+      }
+    },
+    {
+      "elapsedMs": 16733.765333,
+      "expected": "fact",
+      "name": "catalog-read",
+      "passed": true,
+      "requestSHA256": "sha256:045c54b5e835faadebc1f24bdc910854a809c728b9d027d9a5c063ac97b44225",
+      "result": {
+        "claims": [
+          {
+            "bound": {
+              "hi": 0,
+              "kind": "interval",
+              "lo": 0
+            },
+            "measure": "count",
+            "role": "writes",
+            "scope": "publication/evidence/m1-generator-binomial"
+          },
+          {
+            "bound": {
+              "kind": "enumerated",
+              "values": [
+                "sha256:0e12cd99729a0fd845942f252bce19cb792b1ccf93da52e9c9b505c006c5a55a"
+              ]
+            },
+            "measure": "digest",
+            "role": "writes",
+            "scope": "publication/evidence/m1-generator-binomial/verification"
+          }
+        ],
+        "kind": "fact",
+        "protocol": "bound-lock/1"
+      }
+    },
+    {
+      "elapsedMs": 189.97716600000422,
+      "expected": "refuse",
+      "name": "catalog-missing-input",
+      "passed": true,
+      "requestSHA256": "sha256:8066fab3d88b690a2e7cd3a2ff79bb8e4bded84411b4966e04e7acdd222dba3d",
+      "result": {
+        "kind": "refuse",
+        "protocol": "bound-lock/1",
+        "why": "Error: REFUSE\u00b7semilattice missing-input proofs/m1-046-bridge/M1Bridge046.lean"
+      }
+    },
+    {
+      "elapsedMs": 184.8552090000012,
+      "expected": "refuse",
+      "name": "catalog-handed-source-differs",
+      "passed": true,
+      "requestSHA256": "sha256:14105c042af91228454b839a810bede3f3d053a0ddc7448fd4a36f0178e2df6a",
+      "result": {
+        "kind": "refuse",
+        "protocol": "bound-lock/1",
+        "why": "Error: REFUSE\u00b7semilattice fixture-source-differs proofs/m1-046-bridge/M1Bridge046.lean"
+      }
+    },
+    {
+      "elapsedMs": 182.30975000000035,
+      "expected": "refuse",
+      "name": "catalog-overstated-M1",
+      "passed": true,
+      "requestSHA256": "sha256:a29bf60bb51385a6a797f2f2d619ac1e3c6e6bc6f5f1cd364a369f9811d614b1",
+      "result": {
+        "kind": "refuse",
+        "protocol": "bound-lock/1",
+        "why": "Error: REFUSE\u00b7semilattice overstated-M1"
+      }
+    }
+  ],
+  "classification": "retained actual host responses; exact historical input identities only",
+  "format": "native-reading-capture@1",
+  "ownerAdmitted": true,
+  "sameOrigin": true,
+  "sourceInputDigests": [
+    {
+      "bytes": 14408,
+      "path": "proofs/m1-046-bridge/M0Bridge.lean",
+      "sha256": "sha256:b438b2961b93c62787275e158a90b534a400de8646a0552b099863fa5227c21e"
+    },
+    {
+      "bytes": 17502,
+      "path": "proofs/m1-046-bridge/M1Bridge046.lean",
+      "sha256": "sha256:a21ac1dedb07af4f28752238edd564293967d8177b75979feead44f01f347b9c"
+    },
+    {
+      "bytes": 5762,
+      "path": "proofs/m1-046-bridge/Obligations045/M0Limit.lean",
+      "sha256": "sha256:aedc88b8ba4edf884cacec78da82eef29187ded0199d44674466425af1585b8c"
+    },
+    {
+      "bytes": 8801,
+      "path": "proofs/m1-046-bridge/Obligations045/M0Offdiag.lean",
+      "sha256": "sha256:af8a95d00cd0956acaec06deeebe7156dccf156b698408275c3e710f58c1c1e8"
+    },
+    {
+      "bytes": 3526,
+      "path": "proofs/m1-046-bridge/lake-manifest.json",
+      "sha256": "sha256:fc8b4ba4b08bbcadf736bc8bcf803b5fdedfebafb57dec61ce0106e99964285d"
+    },
+    {
+      "bytes": 513,
+      "path": "proofs/m1-046-bridge/lakefile.toml",
+      "sha256": "sha256:8a10d2a45af4798c40a903cedc12a03634851fc683c4557fe6711de297b3dc42"
+    },
+    {
+      "bytes": 25,
+      "path": "proofs/m1-046-bridge/lean-toolchain",
+      "sha256": "sha256:55e97be96000b5e9e290c9e74482e5e317861499a5540353ce845471bded8cea"
+    },
+    {
+      "bytes": 62159,
+      "path": "vectors/laws/m1-generator-binomial.lean.json",
+      "sha256": "sha256:f66a742aef32b80c1258a1147d37f305cd29afdf045426bed1438ae215be1da3"
+    },
+    {
+      "bytes": 6036,
+      "path": "contracts/m1-subcauses.json",
+      "sha256": "sha256:8213a6cc3a5ca80a6adb594b9d8f28504c9566200a6d585f675585db2c8d45cc"
+    },
+    {
+      "bytes": 2490,
+      "path": "contracts/m1-generator-binomial.json",
+      "sha256": "sha256:83f87903740a1c804d311700a229abf1f2f6a0c7ab1b8378d831dae77337f760"
+    },
+    {
+      "bytes": 5440,
+      "path": "samples/laws/m1-generator-binomial/yes/sample.json",
+      "sha256": "sha256:6995cc280bd1fdec157eff9e08eebbddb1c15f328235e4937c2d693cf4648088"
+    },
+    {
+      "bytes": 710,
+      "path": "samples/laws/m1-generator-binomial/no/sample.json",
+      "sha256": "sha256:365a933ff20e6736f0d5742608cdc4b7f49d4d12135d8f2be3b4a1aebc1d749e"
+    },
+    {
+      "bytes": 2761,
+      "path": "vectors/laws/policy.json",
+      "sha256": "sha256:e941ce8cd86f0ec31621fa6b4deef9685dc1fead283f4b2fe22a8a58e3d5d939"
+    }
+  ]
+}