@lapxo/obligations 0.4.4 → 0.4.6

package/vectors/laws/m1-offdiag-limit.lean.json

@@ -0,0 +1,166 @@
+{
+  "id": "m1-offdiag-limit",
+  "block": "m1-offdiag",
+  "claim": "M1-offdiagonal-full-generator-probability-limit",
+  "generalDiagonal": {
+    "status": "open",
+    "actualCLTProved": false
+  },
+  "m1Boundary": {
+    "model": "binary-M1-ancestor-first-fixed-quota@1",
+    "finiteIdentityOnly": false,
+    "offdiagLimitProved": true,
+    "allLatentScoresOffdiagRequired": true,
+    "diagonalLimitProved": false,
+    "actualCalibrationCertified": false,
+    "publicM1APIImplemented": false,
+    "originalThreeCards": "open"
+  },
+  "proof": {
+    "files": [
+      {
+        "path": "proofs/m1-046-offdiag/M0Bridge.lean",
+        "sha256": "sha256:b438b2961b93c62787275e158a90b534a400de8646a0552b099863fa5227c21e"
+      },
+      {
+        "path": "proofs/m1-046-offdiag/M0Diagonal046.lean",
+        "sha256": "sha256:c0403d40e1c6849045bf70eab2854eeac28a2464783e06ce03f2f36e33c2146c"
+      },
+      {
+        "path": "proofs/m1-046-offdiag/M0Moments046.lean",
+        "sha256": "sha256:06780115a2b44a77a9be72673350332b77045489dba7ff081beecd48b8d51a73"
+      },
+      {
+        "path": "proofs/m1-046-offdiag/M1Bridge046.lean",
+        "sha256": "sha256:a21ac1dedb07af4f28752238edd564293967d8177b75979feead44f01f347b9c"
+      },
+      {
+        "path": "proofs/m1-046-offdiag/M1Offdiag046.lean",
+        "sha256": "sha256:faf6ef0b27049ff4cb89db0e216102239b8bb3f29a76e2a66442fb7c9b6ccd2b"
+      },
+      {
+        "path": "proofs/m1-046-offdiag/Obligations045/M0Limit.lean",
+        "sha256": "sha256:aedc88b8ba4edf884cacec78da82eef29187ded0199d44674466425af1585b8c"
+      },
+      {
+        "path": "proofs/m1-046-offdiag/Obligations045/M0Offdiag.lean",
+        "sha256": "sha256:af8a95d00cd0956acaec06deeebe7156dccf156b698408275c3e710f58c1c1e8"
+      },
+      {
+        "path": "proofs/m1-046-offdiag/lake-manifest.json",
+        "sha256": "sha256:fc8b4ba4b08bbcadf736bc8bcf803b5fdedfebafb57dec61ce0106e99964285d"
+      },
+      {
+        "path": "proofs/m1-046-offdiag/lakefile.toml",
+        "sha256": "sha256:1853d377780647756b113f9b077ea95cde54c98fb5e570902c736ab5799f5af9"
+      },
+      {
+        "path": "proofs/m1-046-offdiag/lean-toolchain",
+        "sha256": "sha256:55e97be96000b5e9e290c9e74482e5e317861499a5540353ce845471bded8cea"
+      }
+    ],
+    "mathlib": "c44e0c8ee63ca166450922a373c7409c5d26b00b",
+    "auditedTheorems": [
+      "Obligations046.M1Offdiag.q_bounds",
+      "Obligations046.M1Offdiag.mean_ratio_limit",
+      "Obligations046.M1Offdiag.variance_le",
+      "Obligations046.M1Offdiag.loss_left_bound",
+      "Obligations046.M1Offdiag.loss_right_bound",
+      "Obligations046.M1Offdiag.weights_nonneg",
+      "Obligations046.M1Offdiag.weights_sum",
+      "Obligations046.M1Offdiag.conditional_member_error",
+      "Obligations046.M1Offdiag.centered_second",
+      "Obligations046.M1Offdiag.conditional_gap_bound",
+      "Obligations046.M1Offdiag.tail_bound_limit",
+      "Obligations046.M1Offdiag.conditional_offdiag_limit",
+      "Obligations046.M1Offdiag.implementation_offdiag_limit",
+      "Obligations046.M1Offdiag.generator_offdiag_limit",
+      "Obligations046.M1Offdiag.example_offdiag",
+      "Obligations046.M1Offdiag.example_generator_limit"
+    ],
+    "allowedAxioms": [
+      "propext",
+      "Classical.choice",
+      "Quot.sound"
+    ]
+  },
+  "samples": {
+    "inputs": [
+      "contracts/m1-subcauses.json",
+      "contracts/m1-offdiag-limit.json",
+      "samples/laws/m1-offdiag-limit/yes/sample.json",
+      "samples/laws/m1-offdiag-limit/no/sample.json",
+      "vectors/laws/policy.json"
+    ],
+    "digests": {
+      "contracts/m1-subcauses.json": "sha256:8213a6cc3a5ca80a6adb594b9d8f28504c9566200a6d585f675585db2c8d45cc",
+      "contracts/m1-offdiag-limit.json": "sha256:80ccec0916db5da35fbff2284aa739cb64bd22f8d7eaa308a43e5d44c4e68177",
+      "samples/laws/m1-offdiag-limit/yes/sample.json": "sha256:235ff6999c346055c4e22207e5a2dfdc4633ba016e6d29fe264f2758664b3864",
+      "samples/laws/m1-offdiag-limit/no/sample.json": "sha256:813962d712a8cda54caa9fec008abf826730e1eb9ac628a4a56d6ab2619d52dc",
+      "vectors/laws/policy.json": "sha256:e941ce8cd86f0ec31621fa6b4deef9685dc1fead283f4b2fe22a8a58e3d5d939"
+    }
+  },
+  "capturePolicy": {
+    "timeoutMs": 25000,
+    "responseBytes": 65536
+  },
+  "execution": {
+    "profile": "lean-kernel@1",
+    "project": "proofs/m1-046-offdiag",
+    "toolchain": "leanprover/lean4:v4.19.0",
+    "compilerIdentity": "6caaee842e94",
+    "targets": [
+      "M1Offdiag046"
+    ],
+    "sources": [
+      "M1Offdiag046.lean"
+    ],
+    "auditImports": [
+      "M1Offdiag046"
+    ],
+    "identityInputs": [
+      "proofs/m1-046-offdiag/M0Bridge.lean",
+      "proofs/m1-046-offdiag/M0Diagonal046.lean",
+      "proofs/m1-046-offdiag/M0Moments046.lean",
+      "proofs/m1-046-offdiag/M1Bridge046.lean",
+      "proofs/m1-046-offdiag/M1Offdiag046.lean",
+      "proofs/m1-046-offdiag/Obligations045/M0Limit.lean",
+      "proofs/m1-046-offdiag/Obligations045/M0Offdiag.lean",
+      "proofs/m1-046-offdiag/lake-manifest.json",
+      "proofs/m1-046-offdiag/lakefile.toml",
+      "proofs/m1-046-offdiag/lean-toolchain",
+      "vectors/laws/m1-offdiag-limit.lean.json",
+      "contracts/m1-subcauses.json",
+      "contracts/m1-offdiag-limit.json",
+      "samples/laws/m1-offdiag-limit/yes/sample.json",
+      "samples/laws/m1-offdiag-limit/no/sample.json",
+      "vectors/laws/policy.json"
+    ],
+    "negative": {
+      "name": "diagonal-denominator-omitted",
+      "source": "import M1Bridge046\nimport M0Moments046\n\nopen scoped BigOperators\nopen Filter Topology MeasureTheory ProbabilityTheory\nnoncomputable section\nopen Classical Obligations046.M1Bridge Obligations046.Bridge\nnamespace Obligations046.M1Offdiag\n\n/-- Actual finite conditional mean and variance; no convergence premise. -/\ndef mean (M : Model) (A : Ancestors M) (B : Leaves M) (N : \u2115) : \u211d :=\n  \u2211 i : Fin M.base.K, (sizes M N i : \u211d)*q M A B i\ndef variance (M : Model) (A : Ancestors M) (B : Leaves M) (N : \u2115) : \u211d :=\n  \u2211 i : Fin M.base.K, (sizes M N i : \u211d)*q M A B i*(1-q M A B i)\ndef score (M : Model) (A : Ancestors M) (B : Leaves M) : \u211d :=\n  \u2211 i : Fin M.base.K, M.base.w i*q M A B i\n\ntheorem q_bounds (M : Model) (A : Ancestors M) (B : Leaves M) (i : Fin M.base.K) :\n    0 \u2264 q M A B i \u2227 q M A B i \u2264 1 := by\n  have hn (e : Fin 4) : 0 \u2264 branchMass M.base.p M.base.c M.c2 e :=\n    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 e\n  have ht : 0 \u2264 \u2211 e : Fin 4, if branchBit (A (M.parent i)) (B i) e = true\n      then branchMass M.base.p M.base.c M.c2 e else 0 := by\n    apply Finset.sum_nonneg\n    intro e _\n    split_ifs\n    \u00b7 exact hn e\n    \u00b7 exact le_rfl\n  have hf : 0 \u2264 \u2211 e : Fin 4, if branchBit (A (M.parent i)) (B i) e = false\n      then branchMass M.base.p M.base.c M.c2 e else 0 := by\n    apply Finset.sum_nonneg\n    intro e _\n    split_ifs\n    \u00b7 exact hn e\n    \u00b7 exact le_rfl\n  rw [branch_bit_fiber] at ht hf\n  change 0 \u2264 q M A B i at ht\n  change 0 \u2264 1-q M A B i at hf\n  exact \u27e8ht, by linarith\u27e9\n\ntheorem mean_ratio_limit (M : Model) (A : Ancestors M) (B : Leaves M) :\n    Tendsto (fun N : \u2115 => mean M A B N/(N:\u211d)) atTop (\ud835\udcdd (score M A B)) := by\n  have h := tendsto_finset_sum Finset.univ (fun (i : Fin M.base.K) _ =>\n    (Obligations045.M0.allocation_ratio M.base i).mul_const (q M A B i))\n  convert h using 1\n  funext N\n  simp only [mean, score, Finset.sum_div, div_mul_eq_mul_div]\n\ntheorem variance_le (M : Model) (A : Ancestors M) (B : Leaves M) (N : \u2115) :\n    variance M A B N \u2264 (N:\u211d)/4 := by\n  have hs : \u2211 i : Fin M.base.K, (sizes M N i : \u211d) = (N:\u211d) := by\n    exact_mod_cast (by simpa only [Fin.sum_univ_eq_sum_range] using\n      Obligations045.M0.allocation_sum M.base N)\n  calc\n    _ \u2264 \u2211 i : Fin M.base.K, (sizes M N i : \u211d)*(1/4) := by\n      apply Finset.sum_le_sum\n      intro i _\n      have h : q M A B i*(1-q M A B i) \u2264 1/4 := by\n        nlinarith [sq_nonneg (q M A B i-1/2)]\n      simpa only [mul_assoc] using mul_le_mul_of_nonneg_left h (Nat.cast_nonneg (sizes M N i))\n    _ = _ := by rw [\u2190 Finset.sum_mul, hs]; ring\n\n/-- Off-diagonal loss is locally constant; only a squared deviation can change it. -/\ntheorem loss_left_bound (x m eps : \u211d) (he : 0 < eps) (hm : m+eps \u2264 1/2) :\n    |Obligations045.M0.limitingLoss x-1| \u2264 (x-m)^2/eps^2 := by\n  by_cases hx : x < (1:\u211d)/2\n  \u00b7 simp only [Obligations045.M0.limitingLoss, if_pos hx, sub_self, abs_zero]\n    positivity\n  \u00b7 have hx' : (1:\u211d)/2 \u2264 x := le_of_not_gt hx\n    have hd : eps^2 \u2264 (x-m)^2 := by\n      nlinarith [sq_nonneg (x-m-eps)]\n    have hu : (1:\u211d) \u2264 (x-m)^2/eps^2 := by\n      exact (le_div_iff\u2080 (sq_pos_of_pos he)).mpr (by simpa using hd)\n    have hb : |Obligations045.M0.limitingLoss x-1| \u2264 1 := by\n      unfold Obligations045.M0.limitingLoss\n      split_ifs <;> norm_num [abs_div]\n    exact hb.trans hu\n\ntheorem loss_right_bound (x m eps : \u211d) (he : 0 < eps) (hm : 1/2 \u2264 m-eps) :\n    |Obligations045.M0.limitingLoss x| \u2264 (x-m)^2/eps^2 := by\n  by_cases hx : (1:\u211d)/2 < x\n  \u00b7 have hn : \u00ac x < (1:\u211d)/2 := not_lt.mpr hx.le\n    simp only [Obligations045.M0.limitingLoss, if_neg hn, if_neg (Ne.symm hx.ne), abs_zero]\n    positivity\n  \u00b7 have hx' : x \u2264 (1:\u211d)/2 := le_of_not_gt hx\n    have hd : eps^2 \u2264 (x-m)^2 := by\n      nlinarith [sq_nonneg (m-x-eps)]\n    have hu : (1:\u211d) \u2264 (x-m)^2/eps^2 := by\n      exact (le_div_iff\u2080 (sq_pos_of_pos he)).mpr (by simpa using hd)\n    have hb : |Obligations045.M0.limitingLoss x| \u2264 1 := by\n      unfold Obligations045.M0.limitingLoss\n      split_ifs <;> norm_num [abs_div]\n    exact hb.trans hu\n\nabbrev members (M : Model) (N : \u2115) := World (sizes M N)\ndef weights (M : Model) (A : Ancestors M) (B : Leaves M) (N : \u2115)\n    (x : members M N) := jointMass (sizes M N) (q M A B) x\n\ntheorem weights_nonneg (M : Model) (A : Ancestors M) (B : Leaves M) (N : \u2115)\n    (x : members M N) : 0 \u2264 weights M A B N x := by\n  unfold weights jointMass\n  exact Finset.prod_nonneg (fun i _ => mass_nonneg _ (q_bounds M A B i).1\n    (q_bounds M A B i).2 (x i))\n\ntheorem weights_sum (M : Model) (A : Ancestors M) (B : Leaves M) (N : \u2115) :\n    \u2211 x : members M N, weights M A B N x = 1 := jointMass_sum _ _\n\ntheorem conditional_member_error (M : Model) (A : Ancestors M) (B : Leaves M) (N : \u2115) :\n    binomialError M N A B = \u2211 x : members M N, weights M A B N x*\n      Obligations045.M0.fairLoss (correctCount x) N := by\n  symm\n  simpa only [weights, binomialError, correctCount, count] using\n    joint_count_pushforward (sizes M N) (q M A B)\n      (fun k => Obligations045.M0.fairLoss (\u2211 i, (k i : \u2115)) N)\n\ntheorem centered_second (M : Model) (A : Ancestors M) (B : Leaves M) (N : \u2115) :\n    (\u2211 x : members M N, weights M A B N x*((correctCount x:\u211d)-mean M A B N)^2) =\n      variance M A B N := by\n  have h := Obligations046.Moments.member_total_centered_second (sizes M N) (q M A B)\n    (fun i => (q_bounds M A B i).1) (fun i => (q_bounds M A B i).2)\n  rw [memberLaw_expectation] at h\n  exact h\n\n/-- A direct finite Chebyshev bound. The test function is bounded POINTWISE; no\nindependence between pair scores, ambient process, CLT or limit is assumed. -/\ntheorem conditional_gap_bound (M : Model) (A : Ancestors M) (B : Leaves M) (N : \u2115)\n    (hN : 0 < N) (eps target : \u211d) (he : 0 < eps)\n    (hpoint : \u2200 x : \u211d, |Obligations045.M0.limitingLoss x-target| \u2264\n      (x-mean M A B N/(N:\u211d))^2/eps^2) :\n    |binomialError M N A B-target| \u2264 1/(4*(N:\u211d)*eps^2) := by\n  have hn : (0:\u211d) < N := by exact_mod_cast hN\n  have hd : 0 < (N:\u211d)^2*eps^2 := by positivity\n  have hnorm := weights_sum M A B N\n  have hrew : binomialError M N A B-target =\n      \u2211 x : members M N, weights M A B N x*(Obligations045.M0.fairLoss (correctCount x) N-target) := by\n    rw [conditional_member_error]\n    simp only [mul_sub, Finset.sum_sub_distrib, \u2190 Finset.sum_mul, hnorm, one_mul]\n  rw [hrew]\n  calc\n    _ \u2264 \u2211 x : members M N, |weights M A B N x*\n        (Obligations045.M0.fairLoss (correctCount x) N-target)| := Finset.abs_sum_le_sum_abs _ _\n    _ = \u2211 x : members M N, weights M A B N x*\n        |Obligations045.M0.fairLoss (correctCount x) N-target| := by\n      apply Finset.sum_congr rfl\n      intro x _\n      rw [abs_mul, abs_of_nonneg (weights_nonneg M A B N x)]\n    _ \u2264 \u2211 x : members M N, weights M A B N x*\n        (((correctCount x:\u211d)-mean M A B N)^2/((N:\u211d)^2*eps^2)) := by\n      apply Finset.sum_le_sum\n      intro x _\n      apply mul_le_mul_of_nonneg_left _ (weights_nonneg M A B N x)\n      rw [fair_loss_average_bridge _ _ hN]\n      have h := hpoint ((correctCount x:\u211d)/(N:\u211d))\n      convert h using 1\n      field_simp\n    _ = variance M A B N/((N:\u211d)^2*eps^2) := by\n      simp_rw [\u2190 mul_div_assoc]\n      rw [\u2190 Finset.sum_div, centered_second]\n    _ \u2264 ((N:\u211d)/4)/((N:\u211d)^2*eps^2) :=\n      div_le_div_of_nonneg_right (variance_le M A B N) hd.le\n    _ = _ := by field_simp; ring\n\n/-- This positive O(1/N) bound tends to zero with epsilon FIXED. -/\ntheorem tail_bound_limit (eps : \u211d) :\n    Tendsto (fun N : \u2115 => 1/(4*(N:\u211d)*eps^2)) atTop (\ud835\udcdd 0) := by\n  have h : Tendsto (fun N : \u2115 => (1:\u211d)/(N:\u211d)) atTop (\ud835\udcdd 0) :=\n    tendsto_const_nhds.div_atTop tendsto_natCast_atTop_atTop\n  have heq : (fun N : \u2115 => 1/(4*(N:\u211d)*eps^2)) =\n      (fun N : \u2115 => ((1:\u211d)/(N:\u211d))/(4*eps^2)) := by funext N; ring\n  rw [heq]\n  simpa using h.div_const (4*eps^2)\n\n/-- New finite M1 conditional probability limit, derived from quota convergence\nand the finite generator/binomial law; no convergence premise or ambient iid oracle. -/\ntheorem conditional_offdiag_limit (M : Model) (A : Ancestors M) (B : Leaves M)\n    (hoff : score M A B \u2260 (1:\u211d)/2) :\n    Tendsto (fun N : \u2115 => binomialError M N A B) atTop\n      (\ud835\udcdd (Obligations045.M0.limitingLoss (score M A B))) := by\n  by_cases hs : score M A B < (1:\u211d)/2\n  \u00b7 let eps : \u211d := (1/2-score M A B)/2\n    have he : 0 < eps := by dsimp [eps]; linarith\n    have hm : \u2200\u1da0 N in atTop, mean M A B N/(N:\u211d)+eps \u2264 (1:\u211d)/2 := by\n      have h := (mean_ratio_limit M A B).eventually\n        (Iio_mem_nhds (show score M A B < (1:\u211d)/2-eps by dsimp [eps]; linarith))\n      filter_upwards [h] with N hN\n      linarith\n    have hb : \u2200\u1da0 N in atTop, |binomialError M N A B-1| \u2264 1/(4*(N:\u211d)*eps^2) := by\n      filter_upwards [hm, eventually_ge_atTop 1] with N hm hN\n      exact conditional_gap_bound M A B N (by omega) eps 1 he\n        (fun x => loss_left_bound x _ eps he hm)\n    have h := squeeze_zero' (Eventually.of_forall (fun N => abs_nonneg (binomialError M N A B-1))) hb\n      (tail_bound_limit eps)\n    rw [Obligations045.M0.limitingLoss, if_pos hs]\n    exact (tendsto_iff_norm_sub_tendsto_zero).mpr (by simpa only [Real.norm_eq_abs] using h)\n  \u00b7 have hs' : (1:\u211d)/2 < score M A B := lt_of_le_of_ne (le_of_not_gt hs) (Ne.symm hoff)\n    let eps : \u211d := (score M A B-1/2)/2\n    have he : 0 < eps := by dsimp [eps]; linarith\n    have hm : \u2200\u1da0 N in atTop, (1:\u211d)/2 \u2264 mean M A B N/(N:\u211d)-eps := by\n      have h := (mean_ratio_limit M A B).eventually\n        (Ioi_mem_nhds (show (1:\u211d)/2+eps < score M A B by dsimp [eps]; linarith))\n      filter_upwards [h] with N hN\n      linarith\n    have hb : \u2200\u1da0 N in atTop, |binomialError M N A B| \u2264 1/(4*(N:\u211d)*eps^2) := by\n      filter_upwards [hm, eventually_ge_atTop 1] with N hm hN\n      simpa only [sub_zero] using conditional_gap_bound M A B N (by omega) eps 0 he\n        (fun x => by simpa only [sub_zero] using loss_right_bound x _ eps he hm)\n    have h := squeeze_zero' (Eventually.of_forall (fun N => abs_nonneg (binomialError M N A B))) hb\n      (tail_bound_limit eps)\n    rw [Obligations045.M0.limitingLoss, if_neg hs, if_neg hoff]\n    exact (tendsto_iff_norm_sub_tendsto_zero).mpr (by simpa only [Real.norm_eq_abs, sub_zero] using h)\n\ndef thresholdFunctional (M : Model) : \u211d :=\n  \u2211 A : Ancestors M, \u2211 B : Leaves M,\n    latentMass M A B * Obligations045.M0.limitingLoss (score M A B)\n\n/-- All latent configurations are positive mass forp in(1/2,1). No diagonal\nconfiguration is silently discarded or called a fork. -/\ntheorem implementation_offdiag_limit (M : Model)\n    (hoff : \u2200 (A : Ancestors M) (B : Leaves M), score M A B \u2260 (1:\u211d)/2) :\n    Tendsto (implementationError M) atTop (\ud835\udcdd (thresholdFunctional M)) := by\n  unfold implementationError thresholdFunctional\n  apply tendsto_finset_sum\n  intro A _\n  apply tendsto_finset_sum\n  intro B _\n  exact tendsto_const_nhds.mul (conditional_offdiag_limit M A B (hoff A B))\n\n/-- Limit of the ACTUAL full generator probabilities via the admitted exact bridge. -/\ntheorem generator_offdiag_limit (M : Model)\n    (hoff : \u2200 (A : Ancestors M) (B : Leaves M), score M A B \u2260 (1:\u211d)/2) :\n    Tendsto (fun N : \u2115 => \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      atTop (\ud835\udcdd (thresholdFunctional M)) := by\n  simpa only [full_generator_error_bridge] using implementation_offdiag_limit M hoff\n\n/-- The existing exact shared-parent example: genuinely nonzero rates on both levels. -/\ndef exampleModel : Model where\n  base := {\n    K := 2\n    K_pos := by norm_num\n    p := 2/3\n    c := 1/2\n    p_half := by norm_num\n    p_lt_one := by norm_num\n    c_nonneg := by norm_num\n    c_lt_one := by norm_num\n    w := fun _ => 1/2\n    w_nonneg := fun _ => by norm_num\n    weights_sum := by norm_num [Finset.sum_range_succ] }\n  ancestors := 1\n  parent := fun _ => 0\n  c2 := 1/2\n  c2_nonneg := by norm_num\n  c2_lt_one := by norm_num\n\ntheorem example_offdiag (A : Ancestors exampleModel) (B : Leaves exampleModel) :\n    score exampleModel A B \u2260 (1:\u211d)/2 := by\n  change (\u2211 i : Fin 2, (1/2:\u211d)*success (2/3) (1/2) (1/2) (A (0:Fin 1)) (B i)) \u2260 1/2\n  cases ha : A (0:Fin 1) <;> cases hb : B (0:Fin 2) <;> cases hc : B (1:Fin 2) <;>\n    norm_num [success, Fin.sum_univ_succ, ha, hb, hc]\n\ntheorem example_generator_limit :\n    Tendsto (fun N : \u2115 => \u222b x, Obligations045.M0.fairLoss\n      (\u2211 i, (primitiveCounts exampleModel N x.1.1 x.1.2 x.2 i : \u2115)) N\n      \u2202(fullLaw exampleModel N).toMeasure)\n      atTop (\ud835\udcdd (thresholdFunctional exampleModel)) :=\n  generator_offdiag_limit exampleModel example_offdiag\n\nend Obligations046.M1Offdiag\n\nopen Obligations046.M1Offdiag\nexample : |Obligations045.M0.limitingLoss 0-Obligations045.M0.limitingLoss (1/2)| \u2264 ((0:\u211d)-1/2)^2/(1/2-1/2)^2 := by norm_num [Obligations045.M0.limitingLoss, abs_div, Fintype.sum_bool, Obligations046.M1Bridge.bernMass]\n",
+      "exitCode": 1,
+      "cause": [
+        "unsolved goals"
+      ]
+    },
+    "extraNegatives": [
+      {
+        "name": "mean-margin-omitted",
+        "source": "import M1Bridge046\nimport M0Moments046\n\nopen scoped BigOperators\nopen Filter Topology MeasureTheory ProbabilityTheory\nnoncomputable section\nopen Classical Obligations046.M1Bridge Obligations046.Bridge\nnamespace Obligations046.M1Offdiag\n\n/-- Actual finite conditional mean and variance; no convergence premise. -/\ndef mean (M : Model) (A : Ancestors M) (B : Leaves M) (N : \u2115) : \u211d :=\n  \u2211 i : Fin M.base.K, (sizes M N i : \u211d)*q M A B i\ndef variance (M : Model) (A : Ancestors M) (B : Leaves M) (N : \u2115) : \u211d :=\n  \u2211 i : Fin M.base.K, (sizes M N i : \u211d)*q M A B i*(1-q M A B i)\ndef score (M : Model) (A : Ancestors M) (B : Leaves M) : \u211d :=\n  \u2211 i : Fin M.base.K, M.base.w i*q M A B i\n\ntheorem q_bounds (M : Model) (A : Ancestors M) (B : Leaves M) (i : Fin M.base.K) :\n    0 \u2264 q M A B i \u2227 q M A B i \u2264 1 := by\n  have hn (e : Fin 4) : 0 \u2264 branchMass M.base.p M.base.c M.c2 e :=\n    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 e\n  have ht : 0 \u2264 \u2211 e : Fin 4, if branchBit (A (M.parent i)) (B i) e = true\n      then branchMass M.base.p M.base.c M.c2 e else 0 := by\n    apply Finset.sum_nonneg\n    intro e _\n    split_ifs\n    \u00b7 exact hn e\n    \u00b7 exact le_rfl\n  have hf : 0 \u2264 \u2211 e : Fin 4, if branchBit (A (M.parent i)) (B i) e = false\n      then branchMass M.base.p M.base.c M.c2 e else 0 := by\n    apply Finset.sum_nonneg\n    intro e _\n    split_ifs\n    \u00b7 exact hn e\n    \u00b7 exact le_rfl\n  rw [branch_bit_fiber] at ht hf\n  change 0 \u2264 q M A B i at ht\n  change 0 \u2264 1-q M A B i at hf\n  exact \u27e8ht, by linarith\u27e9\n\ntheorem mean_ratio_limit (M : Model) (A : Ancestors M) (B : Leaves M) :\n    Tendsto (fun N : \u2115 => mean M A B N/(N:\u211d)) atTop (\ud835\udcdd (score M A B)) := by\n  have h := tendsto_finset_sum Finset.univ (fun (i : Fin M.base.K) _ =>\n    (Obligations045.M0.allocation_ratio M.base i).mul_const (q M A B i))\n  convert h using 1\n  funext N\n  simp only [mean, score, Finset.sum_div, div_mul_eq_mul_div]\n\ntheorem variance_le (M : Model) (A : Ancestors M) (B : Leaves M) (N : \u2115) :\n    variance M A B N \u2264 (N:\u211d)/4 := by\n  have hs : \u2211 i : Fin M.base.K, (sizes M N i : \u211d) = (N:\u211d) := by\n    exact_mod_cast (by simpa only [Fin.sum_univ_eq_sum_range] using\n      Obligations045.M0.allocation_sum M.base N)\n  calc\n    _ \u2264 \u2211 i : Fin M.base.K, (sizes M N i : \u211d)*(1/4) := by\n      apply Finset.sum_le_sum\n      intro i _\n      have h : q M A B i*(1-q M A B i) \u2264 1/4 := by\n        nlinarith [sq_nonneg (q M A B i-1/2)]\n      simpa only [mul_assoc] using mul_le_mul_of_nonneg_left h (Nat.cast_nonneg (sizes M N i))\n    _ = _ := by rw [\u2190 Finset.sum_mul, hs]; ring\n\n/-- Off-diagonal loss is locally constant; only a squared deviation can change it. -/\ntheorem loss_left_bound (x m eps : \u211d) (he : 0 < eps) (hm : m+eps \u2264 1/2) :\n    |Obligations045.M0.limitingLoss x-1| \u2264 (x-m)^2/eps^2 := by\n  by_cases hx : x < (1:\u211d)/2\n  \u00b7 simp only [Obligations045.M0.limitingLoss, if_pos hx, sub_self, abs_zero]\n    positivity\n  \u00b7 have hx' : (1:\u211d)/2 \u2264 x := le_of_not_gt hx\n    have hd : eps^2 \u2264 (x-m)^2 := by\n      nlinarith [sq_nonneg (x-m-eps)]\n    have hu : (1:\u211d) \u2264 (x-m)^2/eps^2 := by\n      exact (le_div_iff\u2080 (sq_pos_of_pos he)).mpr (by simpa using hd)\n    have hb : |Obligations045.M0.limitingLoss x-1| \u2264 1 := by\n      unfold Obligations045.M0.limitingLoss\n      split_ifs <;> norm_num [abs_div]\n    exact hb.trans hu\n\ntheorem loss_right_bound (x m eps : \u211d) (he : 0 < eps) (hm : 1/2 \u2264 m-eps) :\n    |Obligations045.M0.limitingLoss x| \u2264 (x-m)^2/eps^2 := by\n  by_cases hx : (1:\u211d)/2 < x\n  \u00b7 have hn : \u00ac x < (1:\u211d)/2 := not_lt.mpr hx.le\n    simp only [Obligations045.M0.limitingLoss, if_neg hn, if_neg (Ne.symm hx.ne), abs_zero]\n    positivity\n  \u00b7 have hx' : x \u2264 (1:\u211d)/2 := le_of_not_gt hx\n    have hd : eps^2 \u2264 (x-m)^2 := by\n      nlinarith [sq_nonneg (m-x-eps)]\n    have hu : (1:\u211d) \u2264 (x-m)^2/eps^2 := by\n      exact (le_div_iff\u2080 (sq_pos_of_pos he)).mpr (by simpa using hd)\n    have hb : |Obligations045.M0.limitingLoss x| \u2264 1 := by\n      unfold Obligations045.M0.limitingLoss\n      split_ifs <;> norm_num [abs_div]\n    exact hb.trans hu\n\nabbrev members (M : Model) (N : \u2115) := World (sizes M N)\ndef weights (M : Model) (A : Ancestors M) (B : Leaves M) (N : \u2115)\n    (x : members M N) := jointMass (sizes M N) (q M A B) x\n\ntheorem weights_nonneg (M : Model) (A : Ancestors M) (B : Leaves M) (N : \u2115)\n    (x : members M N) : 0 \u2264 weights M A B N x := by\n  unfold weights jointMass\n  exact Finset.prod_nonneg (fun i _ => mass_nonneg _ (q_bounds M A B i).1\n    (q_bounds M A B i).2 (x i))\n\ntheorem weights_sum (M : Model) (A : Ancestors M) (B : Leaves M) (N : \u2115) :\n    \u2211 x : members M N, weights M A B N x = 1 := jointMass_sum _ _\n\ntheorem conditional_member_error (M : Model) (A : Ancestors M) (B : Leaves M) (N : \u2115) :\n    binomialError M N A B = \u2211 x : members M N, weights M A B N x*\n      Obligations045.M0.fairLoss (correctCount x) N := by\n  symm\n  simpa only [weights, binomialError, correctCount, count] using\n    joint_count_pushforward (sizes M N) (q M A B)\n      (fun k => Obligations045.M0.fairLoss (\u2211 i, (k i : \u2115)) N)\n\ntheorem centered_second (M : Model) (A : Ancestors M) (B : Leaves M) (N : \u2115) :\n    (\u2211 x : members M N, weights M A B N x*((correctCount x:\u211d)-mean M A B N)^2) =\n      variance M A B N := by\n  have h := Obligations046.Moments.member_total_centered_second (sizes M N) (q M A B)\n    (fun i => (q_bounds M A B i).1) (fun i => (q_bounds M A B i).2)\n  rw [memberLaw_expectation] at h\n  exact h\n\n/-- A direct finite Chebyshev bound. The test function is bounded POINTWISE; no\nindependence between pair scores, ambient process, CLT or limit is assumed. -/\ntheorem conditional_gap_bound (M : Model) (A : Ancestors M) (B : Leaves M) (N : \u2115)\n    (hN : 0 < N) (eps target : \u211d) (he : 0 < eps)\n    (hpoint : \u2200 x : \u211d, |Obligations045.M0.limitingLoss x-target| \u2264\n      (x-mean M A B N/(N:\u211d))^2/eps^2) :\n    |binomialError M N A B-target| \u2264 1/(4*(N:\u211d)*eps^2) := by\n  have hn : (0:\u211d) < N := by exact_mod_cast hN\n  have hd : 0 < (N:\u211d)^2*eps^2 := by positivity\n  have hnorm := weights_sum M A B N\n  have hrew : binomialError M N A B-target =\n      \u2211 x : members M N, weights M A B N x*(Obligations045.M0.fairLoss (correctCount x) N-target) := by\n    rw [conditional_member_error]\n    simp only [mul_sub, Finset.sum_sub_distrib, \u2190 Finset.sum_mul, hnorm, one_mul]\n  rw [hrew]\n  calc\n    _ \u2264 \u2211 x : members M N, |weights M A B N x*\n        (Obligations045.M0.fairLoss (correctCount x) N-target)| := Finset.abs_sum_le_sum_abs _ _\n    _ = \u2211 x : members M N, weights M A B N x*\n        |Obligations045.M0.fairLoss (correctCount x) N-target| := by\n      apply Finset.sum_congr rfl\n      intro x _\n      rw [abs_mul, abs_of_nonneg (weights_nonneg M A B N x)]\n    _ \u2264 \u2211 x : members M N, weights M A B N x*\n        (((correctCount x:\u211d)-mean M A B N)^2/((N:\u211d)^2*eps^2)) := by\n      apply Finset.sum_le_sum\n      intro x _\n      apply mul_le_mul_of_nonneg_left _ (weights_nonneg M A B N x)\n      rw [fair_loss_average_bridge _ _ hN]\n      have h := hpoint ((correctCount x:\u211d)/(N:\u211d))\n      convert h using 1\n      field_simp\n    _ = variance M A B N/((N:\u211d)^2*eps^2) := by\n      simp_rw [\u2190 mul_div_assoc]\n      rw [\u2190 Finset.sum_div, centered_second]\n    _ \u2264 ((N:\u211d)/4)/((N:\u211d)^2*eps^2) :=\n      div_le_div_of_nonneg_right (variance_le M A B N) hd.le\n    _ = _ := by field_simp; ring\n\n/-- This positive O(1/N) bound tends to zero with epsilon FIXED. -/\ntheorem tail_bound_limit (eps : \u211d) :\n    Tendsto (fun N : \u2115 => 1/(4*(N:\u211d)*eps^2)) atTop (\ud835\udcdd 0) := by\n  have h : Tendsto (fun N : \u2115 => (1:\u211d)/(N:\u211d)) atTop (\ud835\udcdd 0) :=\n    tendsto_const_nhds.div_atTop tendsto_natCast_atTop_atTop\n  have heq : (fun N : \u2115 => 1/(4*(N:\u211d)*eps^2)) =\n      (fun N : \u2115 => ((1:\u211d)/(N:\u211d))/(4*eps^2)) := by funext N; ring\n  rw [heq]\n  simpa using h.div_const (4*eps^2)\n\n/-- New finite M1 conditional probability limit, derived from quota convergence\nand the finite generator/binomial law; no convergence premise or ambient iid oracle. -/\ntheorem conditional_offdiag_limit (M : Model) (A : Ancestors M) (B : Leaves M)\n    (hoff : score M A B \u2260 (1:\u211d)/2) :\n    Tendsto (fun N : \u2115 => binomialError M N A B) atTop\n      (\ud835\udcdd (Obligations045.M0.limitingLoss (score M A B))) := by\n  by_cases hs : score M A B < (1:\u211d)/2\n  \u00b7 let eps : \u211d := (1/2-score M A B)/2\n    have he : 0 < eps := by dsimp [eps]; linarith\n    have hm : \u2200\u1da0 N in atTop, mean M A B N/(N:\u211d)+eps \u2264 (1:\u211d)/2 := by\n      have h := (mean_ratio_limit M A B).eventually\n        (Iio_mem_nhds (show score M A B < (1:\u211d)/2-eps by dsimp [eps]; linarith))\n      filter_upwards [h] with N hN\n      linarith\n    have hb : \u2200\u1da0 N in atTop, |binomialError M N A B-1| \u2264 1/(4*(N:\u211d)*eps^2) := by\n      filter_upwards [hm, eventually_ge_atTop 1] with N hm hN\n      exact conditional_gap_bound M A B N (by omega) eps 1 he\n        (fun x => loss_left_bound x _ eps he hm)\n    have h := squeeze_zero' (Eventually.of_forall (fun N => abs_nonneg (binomialError M N A B-1))) hb\n      (tail_bound_limit eps)\n    rw [Obligations045.M0.limitingLoss, if_pos hs]\n    exact (tendsto_iff_norm_sub_tendsto_zero).mpr (by simpa only [Real.norm_eq_abs] using h)\n  \u00b7 have hs' : (1:\u211d)/2 < score M A B := lt_of_le_of_ne (le_of_not_gt hs) (Ne.symm hoff)\n    let eps : \u211d := (score M A B-1/2)/2\n    have he : 0 < eps := by dsimp [eps]; linarith\n    have hm : \u2200\u1da0 N in atTop, (1:\u211d)/2 \u2264 mean M A B N/(N:\u211d)-eps := by\n      have h := (mean_ratio_limit M A B).eventually\n        (Ioi_mem_nhds (show (1:\u211d)/2+eps < score M A B by dsimp [eps]; linarith))\n      filter_upwards [h] with N hN\n      linarith\n    have hb : \u2200\u1da0 N in atTop, |binomialError M N A B| \u2264 1/(4*(N:\u211d)*eps^2) := by\n      filter_upwards [hm, eventually_ge_atTop 1] with N hm hN\n      simpa only [sub_zero] using conditional_gap_bound M A B N (by omega) eps 0 he\n        (fun x => by simpa only [sub_zero] using loss_right_bound x _ eps he hm)\n    have h := squeeze_zero' (Eventually.of_forall (fun N => abs_nonneg (binomialError M N A B))) hb\n      (tail_bound_limit eps)\n    rw [Obligations045.M0.limitingLoss, if_neg hs, if_neg hoff]\n    exact (tendsto_iff_norm_sub_tendsto_zero).mpr (by simpa only [Real.norm_eq_abs, sub_zero] using h)\n\ndef thresholdFunctional (M : Model) : \u211d :=\n  \u2211 A : Ancestors M, \u2211 B : Leaves M,\n    latentMass M A B * Obligations045.M0.limitingLoss (score M A B)\n\n/-- All latent configurations are positive mass forp in(1/2,1). No diagonal\nconfiguration is silently discarded or called a fork. -/\ntheorem implementation_offdiag_limit (M : Model)\n    (hoff : \u2200 (A : Ancestors M) (B : Leaves M), score M A B \u2260 (1:\u211d)/2) :\n    Tendsto (implementationError M) atTop (\ud835\udcdd (thresholdFunctional M)) := by\n  unfold implementationError thresholdFunctional\n  apply tendsto_finset_sum\n  intro A _\n  apply tendsto_finset_sum\n  intro B _\n  exact tendsto_const_nhds.mul (conditional_offdiag_limit M A B (hoff A B))\n\n/-- Limit of the ACTUAL full generator probabilities via the admitted exact bridge. -/\ntheorem generator_offdiag_limit (M : Model)\n    (hoff : \u2200 (A : Ancestors M) (B : Leaves M), score M A B \u2260 (1:\u211d)/2) :\n    Tendsto (fun N : \u2115 => \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      atTop (\ud835\udcdd (thresholdFunctional M)) := by\n  simpa only [full_generator_error_bridge] using implementation_offdiag_limit M hoff\n\n/-- The existing exact shared-parent example: genuinely nonzero rates on both levels. -/\ndef exampleModel : Model where\n  base := {\n    K := 2\n    K_pos := by norm_num\n    p := 2/3\n    c := 1/2\n    p_half := by norm_num\n    p_lt_one := by norm_num\n    c_nonneg := by norm_num\n    c_lt_one := by norm_num\n    w := fun _ => 1/2\n    w_nonneg := fun _ => by norm_num\n    weights_sum := by norm_num [Finset.sum_range_succ] }\n  ancestors := 1\n  parent := fun _ => 0\n  c2 := 1/2\n  c2_nonneg := by norm_num\n  c2_lt_one := by norm_num\n\ntheorem example_offdiag (A : Ancestors exampleModel) (B : Leaves exampleModel) :\n    score exampleModel A B \u2260 (1:\u211d)/2 := by\n  change (\u2211 i : Fin 2, (1/2:\u211d)*success (2/3) (1/2) (1/2) (A (0:Fin 1)) (B i)) \u2260 1/2\n  cases ha : A (0:Fin 1) <;> cases hb : B (0:Fin 2) <;> cases hc : B (1:Fin 2) <;>\n    norm_num [success, Fin.sum_univ_succ, ha, hb, hc]\n\ntheorem example_generator_limit :\n    Tendsto (fun N : \u2115 => \u222b x, Obligations045.M0.fairLoss\n      (\u2211 i, (primitiveCounts exampleModel N x.1.1 x.1.2 x.2 i : \u2115)) N\n      \u2202(fullLaw exampleModel N).toMeasure)\n      atTop (\ud835\udcdd (thresholdFunctional exampleModel)) :=\n  generator_offdiag_limit exampleModel example_offdiag\n\nend Obligations046.M1Offdiag\n\nopen Obligations046.M1Offdiag\nexample : |Obligations045.M0.limitingLoss 1-1| \u2264 ((1:\u211d)-1)^2/(1/4)^2 := by norm_num [Obligations045.M0.limitingLoss, abs_div, Fintype.sum_bool, Obligations046.M1Bridge.bernMass]\n",
+        "exitCode": 1,
+        "cause": [
+          "unsolved goals"
+        ]
+      },
+      {
+        "name": "shared-selectors-as-independent",
+        "source": "import M1Bridge046\nimport M0Moments046\n\nopen scoped BigOperators\nopen Filter Topology MeasureTheory ProbabilityTheory\nnoncomputable section\nopen Classical Obligations046.M1Bridge Obligations046.Bridge\nnamespace Obligations046.M1Offdiag\n\n/-- Actual finite conditional mean and variance; no convergence premise. -/\ndef mean (M : Model) (A : Ancestors M) (B : Leaves M) (N : \u2115) : \u211d :=\n  \u2211 i : Fin M.base.K, (sizes M N i : \u211d)*q M A B i\ndef variance (M : Model) (A : Ancestors M) (B : Leaves M) (N : \u2115) : \u211d :=\n  \u2211 i : Fin M.base.K, (sizes M N i : \u211d)*q M A B i*(1-q M A B i)\ndef score (M : Model) (A : Ancestors M) (B : Leaves M) : \u211d :=\n  \u2211 i : Fin M.base.K, M.base.w i*q M A B i\n\ntheorem q_bounds (M : Model) (A : Ancestors M) (B : Leaves M) (i : Fin M.base.K) :\n    0 \u2264 q M A B i \u2227 q M A B i \u2264 1 := by\n  have hn (e : Fin 4) : 0 \u2264 branchMass M.base.p M.base.c M.c2 e :=\n    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 e\n  have ht : 0 \u2264 \u2211 e : Fin 4, if branchBit (A (M.parent i)) (B i) e = true\n      then branchMass M.base.p M.base.c M.c2 e else 0 := by\n    apply Finset.sum_nonneg\n    intro e _\n    split_ifs\n    \u00b7 exact hn e\n    \u00b7 exact le_rfl\n  have hf : 0 \u2264 \u2211 e : Fin 4, if branchBit (A (M.parent i)) (B i) e = false\n      then branchMass M.base.p M.base.c M.c2 e else 0 := by\n    apply Finset.sum_nonneg\n    intro e _\n    split_ifs\n    \u00b7 exact hn e\n    \u00b7 exact le_rfl\n  rw [branch_bit_fiber] at ht hf\n  change 0 \u2264 q M A B i at ht\n  change 0 \u2264 1-q M A B i at hf\n  exact \u27e8ht, by linarith\u27e9\n\ntheorem mean_ratio_limit (M : Model) (A : Ancestors M) (B : Leaves M) :\n    Tendsto (fun N : \u2115 => mean M A B N/(N:\u211d)) atTop (\ud835\udcdd (score M A B)) := by\n  have h := tendsto_finset_sum Finset.univ (fun (i : Fin M.base.K) _ =>\n    (Obligations045.M0.allocation_ratio M.base i).mul_const (q M A B i))\n  convert h using 1\n  funext N\n  simp only [mean, score, Finset.sum_div, div_mul_eq_mul_div]\n\ntheorem variance_le (M : Model) (A : Ancestors M) (B : Leaves M) (N : \u2115) :\n    variance M A B N \u2264 (N:\u211d)/4 := by\n  have hs : \u2211 i : Fin M.base.K, (sizes M N i : \u211d) = (N:\u211d) := by\n    exact_mod_cast (by simpa only [Fin.sum_univ_eq_sum_range] using\n      Obligations045.M0.allocation_sum M.base N)\n  calc\n    _ \u2264 \u2211 i : Fin M.base.K, (sizes M N i : \u211d)*(1/4) := by\n      apply Finset.sum_le_sum\n      intro i _\n      have h : q M A B i*(1-q M A B i) \u2264 1/4 := by\n        nlinarith [sq_nonneg (q M A B i-1/2)]\n      simpa only [mul_assoc] using mul_le_mul_of_nonneg_left h (Nat.cast_nonneg (sizes M N i))\n    _ = _ := by rw [\u2190 Finset.sum_mul, hs]; ring\n\n/-- Off-diagonal loss is locally constant; only a squared deviation can change it. -/\ntheorem loss_left_bound (x m eps : \u211d) (he : 0 < eps) (hm : m+eps \u2264 1/2) :\n    |Obligations045.M0.limitingLoss x-1| \u2264 (x-m)^2/eps^2 := by\n  by_cases hx : x < (1:\u211d)/2\n  \u00b7 simp only [Obligations045.M0.limitingLoss, if_pos hx, sub_self, abs_zero]\n    positivity\n  \u00b7 have hx' : (1:\u211d)/2 \u2264 x := le_of_not_gt hx\n    have hd : eps^2 \u2264 (x-m)^2 := by\n      nlinarith [sq_nonneg (x-m-eps)]\n    have hu : (1:\u211d) \u2264 (x-m)^2/eps^2 := by\n      exact (le_div_iff\u2080 (sq_pos_of_pos he)).mpr (by simpa using hd)\n    have hb : |Obligations045.M0.limitingLoss x-1| \u2264 1 := by\n      unfold Obligations045.M0.limitingLoss\n      split_ifs <;> norm_num [abs_div]\n    exact hb.trans hu\n\ntheorem loss_right_bound (x m eps : \u211d) (he : 0 < eps) (hm : 1/2 \u2264 m-eps) :\n    |Obligations045.M0.limitingLoss x| \u2264 (x-m)^2/eps^2 := by\n  by_cases hx : (1:\u211d)/2 < x\n  \u00b7 have hn : \u00ac x < (1:\u211d)/2 := not_lt.mpr hx.le\n    simp only [Obligations045.M0.limitingLoss, if_neg hn, if_neg (Ne.symm hx.ne), abs_zero]\n    positivity\n  \u00b7 have hx' : x \u2264 (1:\u211d)/2 := le_of_not_gt hx\n    have hd : eps^2 \u2264 (x-m)^2 := by\n      nlinarith [sq_nonneg (m-x-eps)]\n    have hu : (1:\u211d) \u2264 (x-m)^2/eps^2 := by\n      exact (le_div_iff\u2080 (sq_pos_of_pos he)).mpr (by simpa using hd)\n    have hb : |Obligations045.M0.limitingLoss x| \u2264 1 := by\n      unfold Obligations045.M0.limitingLoss\n      split_ifs <;> norm_num [abs_div]\n    exact hb.trans hu\n\nabbrev members (M : Model) (N : \u2115) := World (sizes M N)\ndef weights (M : Model) (A : Ancestors M) (B : Leaves M) (N : \u2115)\n    (x : members M N) := jointMass (sizes M N) (q M A B) x\n\ntheorem weights_nonneg (M : Model) (A : Ancestors M) (B : Leaves M) (N : \u2115)\n    (x : members M N) : 0 \u2264 weights M A B N x := by\n  unfold weights jointMass\n  exact Finset.prod_nonneg (fun i _ => mass_nonneg _ (q_bounds M A B i).1\n    (q_bounds M A B i).2 (x i))\n\ntheorem weights_sum (M : Model) (A : Ancestors M) (B : Leaves M) (N : \u2115) :\n    \u2211 x : members M N, weights M A B N x = 1 := jointMass_sum _ _\n\ntheorem conditional_member_error (M : Model) (A : Ancestors M) (B : Leaves M) (N : \u2115) :\n    binomialError M N A B = \u2211 x : members M N, weights M A B N x*\n      Obligations045.M0.fairLoss (correctCount x) N := by\n  symm\n  simpa only [weights, binomialError, correctCount, count] using\n    joint_count_pushforward (sizes M N) (q M A B)\n      (fun k => Obligations045.M0.fairLoss (\u2211 i, (k i : \u2115)) N)\n\ntheorem centered_second (M : Model) (A : Ancestors M) (B : Leaves M) (N : \u2115) :\n    (\u2211 x : members M N, weights M A B N x*((correctCount x:\u211d)-mean M A B N)^2) =\n      variance M A B N := by\n  have h := Obligations046.Moments.member_total_centered_second (sizes M N) (q M A B)\n    (fun i => (q_bounds M A B i).1) (fun i => (q_bounds M A B i).2)\n  rw [memberLaw_expectation] at h\n  exact h\n\n/-- A direct finite Chebyshev bound. The test function is bounded POINTWISE; no\nindependence between pair scores, ambient process, CLT or limit is assumed. -/\ntheorem conditional_gap_bound (M : Model) (A : Ancestors M) (B : Leaves M) (N : \u2115)\n    (hN : 0 < N) (eps target : \u211d) (he : 0 < eps)\n    (hpoint : \u2200 x : \u211d, |Obligations045.M0.limitingLoss x-target| \u2264\n      (x-mean M A B N/(N:\u211d))^2/eps^2) :\n    |binomialError M N A B-target| \u2264 1/(4*(N:\u211d)*eps^2) := by\n  have hn : (0:\u211d) < N := by exact_mod_cast hN\n  have hd : 0 < (N:\u211d)^2*eps^2 := by positivity\n  have hnorm := weights_sum M A B N\n  have hrew : binomialError M N A B-target =\n      \u2211 x : members M N, weights M A B N x*(Obligations045.M0.fairLoss (correctCount x) N-target) := by\n    rw [conditional_member_error]\n    simp only [mul_sub, Finset.sum_sub_distrib, \u2190 Finset.sum_mul, hnorm, one_mul]\n  rw [hrew]\n  calc\n    _ \u2264 \u2211 x : members M N, |weights M A B N x*\n        (Obligations045.M0.fairLoss (correctCount x) N-target)| := Finset.abs_sum_le_sum_abs _ _\n    _ = \u2211 x : members M N, weights M A B N x*\n        |Obligations045.M0.fairLoss (correctCount x) N-target| := by\n      apply Finset.sum_congr rfl\n      intro x _\n      rw [abs_mul, abs_of_nonneg (weights_nonneg M A B N x)]\n    _ \u2264 \u2211 x : members M N, weights M A B N x*\n        (((correctCount x:\u211d)-mean M A B N)^2/((N:\u211d)^2*eps^2)) := by\n      apply Finset.sum_le_sum\n      intro x _\n      apply mul_le_mul_of_nonneg_left _ (weights_nonneg M A B N x)\n      rw [fair_loss_average_bridge _ _ hN]\n      have h := hpoint ((correctCount x:\u211d)/(N:\u211d))\n      convert h using 1\n      field_simp\n    _ = variance M A B N/((N:\u211d)^2*eps^2) := by\n      simp_rw [\u2190 mul_div_assoc]\n      rw [\u2190 Finset.sum_div, centered_second]\n    _ \u2264 ((N:\u211d)/4)/((N:\u211d)^2*eps^2) :=\n      div_le_div_of_nonneg_right (variance_le M A B N) hd.le\n    _ = _ := by field_simp; ring\n\n/-- This positive O(1/N) bound tends to zero with epsilon FIXED. -/\ntheorem tail_bound_limit (eps : \u211d) :\n    Tendsto (fun N : \u2115 => 1/(4*(N:\u211d)*eps^2)) atTop (\ud835\udcdd 0) := by\n  have h : Tendsto (fun N : \u2115 => (1:\u211d)/(N:\u211d)) atTop (\ud835\udcdd 0) :=\n    tendsto_const_nhds.div_atTop tendsto_natCast_atTop_atTop\n  have heq : (fun N : \u2115 => 1/(4*(N:\u211d)*eps^2)) =\n      (fun N : \u2115 => ((1:\u211d)/(N:\u211d))/(4*eps^2)) := by funext N; ring\n  rw [heq]\n  simpa using h.div_const (4*eps^2)\n\n/-- New finite M1 conditional probability limit, derived from quota convergence\nand the finite generator/binomial law; no convergence premise or ambient iid oracle. -/\ntheorem conditional_offdiag_limit (M : Model) (A : Ancestors M) (B : Leaves M)\n    (hoff : score M A B \u2260 (1:\u211d)/2) :\n    Tendsto (fun N : \u2115 => binomialError M N A B) atTop\n      (\ud835\udcdd (Obligations045.M0.limitingLoss (score M A B))) := by\n  by_cases hs : score M A B < (1:\u211d)/2\n  \u00b7 let eps : \u211d := (1/2-score M A B)/2\n    have he : 0 < eps := by dsimp [eps]; linarith\n    have hm : \u2200\u1da0 N in atTop, mean M A B N/(N:\u211d)+eps \u2264 (1:\u211d)/2 := by\n      have h := (mean_ratio_limit M A B).eventually\n        (Iio_mem_nhds (show score M A B < (1:\u211d)/2-eps by dsimp [eps]; linarith))\n      filter_upwards [h] with N hN\n      linarith\n    have hb : \u2200\u1da0 N in atTop, |binomialError M N A B-1| \u2264 1/(4*(N:\u211d)*eps^2) := by\n      filter_upwards [hm, eventually_ge_atTop 1] with N hm hN\n      exact conditional_gap_bound M A B N (by omega) eps 1 he\n        (fun x => loss_left_bound x _ eps he hm)\n    have h := squeeze_zero' (Eventually.of_forall (fun N => abs_nonneg (binomialError M N A B-1))) hb\n      (tail_bound_limit eps)\n    rw [Obligations045.M0.limitingLoss, if_pos hs]\n    exact (tendsto_iff_norm_sub_tendsto_zero).mpr (by simpa only [Real.norm_eq_abs] using h)\n  \u00b7 have hs' : (1:\u211d)/2 < score M A B := lt_of_le_of_ne (le_of_not_gt hs) (Ne.symm hoff)\n    let eps : \u211d := (score M A B-1/2)/2\n    have he : 0 < eps := by dsimp [eps]; linarith\n    have hm : \u2200\u1da0 N in atTop, (1:\u211d)/2 \u2264 mean M A B N/(N:\u211d)-eps := by\n      have h := (mean_ratio_limit M A B).eventually\n        (Ioi_mem_nhds (show (1:\u211d)/2+eps < score M A B by dsimp [eps]; linarith))\n      filter_upwards [h] with N hN\n      linarith\n    have hb : \u2200\u1da0 N in atTop, |binomialError M N A B| \u2264 1/(4*(N:\u211d)*eps^2) := by\n      filter_upwards [hm, eventually_ge_atTop 1] with N hm hN\n      simpa only [sub_zero] using conditional_gap_bound M A B N (by omega) eps 0 he\n        (fun x => by simpa only [sub_zero] using loss_right_bound x _ eps he hm)\n    have h := squeeze_zero' (Eventually.of_forall (fun N => abs_nonneg (binomialError M N A B))) hb\n      (tail_bound_limit eps)\n    rw [Obligations045.M0.limitingLoss, if_neg hs, if_neg hoff]\n    exact (tendsto_iff_norm_sub_tendsto_zero).mpr (by simpa only [Real.norm_eq_abs, sub_zero] using h)\n\ndef thresholdFunctional (M : Model) : \u211d :=\n  \u2211 A : Ancestors M, \u2211 B : Leaves M,\n    latentMass M A B * Obligations045.M0.limitingLoss (score M A B)\n\n/-- All latent configurations are positive mass forp in(1/2,1). No diagonal\nconfiguration is silently discarded or called a fork. -/\ntheorem implementation_offdiag_limit (M : Model)\n    (hoff : \u2200 (A : Ancestors M) (B : Leaves M), score M A B \u2260 (1:\u211d)/2) :\n    Tendsto (implementationError M) atTop (\ud835\udcdd (thresholdFunctional M)) := by\n  unfold implementationError thresholdFunctional\n  apply tendsto_finset_sum\n  intro A _\n  apply tendsto_finset_sum\n  intro B _\n  exact tendsto_const_nhds.mul (conditional_offdiag_limit M A B (hoff A B))\n\n/-- Limit of the ACTUAL full generator probabilities via the admitted exact bridge. -/\ntheorem generator_offdiag_limit (M : Model)\n    (hoff : \u2200 (A : Ancestors M) (B : Leaves M), score M A B \u2260 (1:\u211d)/2) :\n    Tendsto (fun N : \u2115 => \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      atTop (\ud835\udcdd (thresholdFunctional M)) := by\n  simpa only [full_generator_error_bridge] using implementation_offdiag_limit M hoff\n\n/-- The existing exact shared-parent example: genuinely nonzero rates on both levels. -/\ndef exampleModel : Model where\n  base := {\n    K := 2\n    K_pos := by norm_num\n    p := 2/3\n    c := 1/2\n    p_half := by norm_num\n    p_lt_one := by norm_num\n    c_nonneg := by norm_num\n    c_lt_one := by norm_num\n    w := fun _ => 1/2\n    w_nonneg := fun _ => by norm_num\n    weights_sum := by norm_num [Finset.sum_range_succ] }\n  ancestors := 1\n  parent := fun _ => 0\n  c2 := 1/2\n  c2_nonneg := by norm_num\n  c2_lt_one := by norm_num\n\ntheorem example_offdiag (A : Ancestors exampleModel) (B : Leaves exampleModel) :\n    score exampleModel A B \u2260 (1:\u211d)/2 := by\n  change (\u2211 i : Fin 2, (1/2:\u211d)*success (2/3) (1/2) (1/2) (A (0:Fin 1)) (B i)) \u2260 1/2\n  cases ha : A (0:Fin 1) <;> cases hb : B (0:Fin 2) <;> cases hc : B (1:Fin 2) <;>\n    norm_num [success, Fin.sum_univ_succ, ha, hb, hc]\n\ntheorem example_generator_limit :\n    Tendsto (fun N : \u2115 => \u222b x, Obligations045.M0.fairLoss\n      (\u2211 i, (primitiveCounts exampleModel N x.1.1 x.1.2 x.2 i : \u2115)) N\n      \u2202(fullLaw exampleModel N).toMeasure)\n      atTop (\ud835\udcdd (thresholdFunctional exampleModel)) :=\n  generator_offdiag_limit exampleModel example_offdiag\n\nend Obligations046.M1Offdiag\n\nopen Obligations046.M1Offdiag\nexample : (\u2211 z : Bool, Obligations046.M1Bridge.bernMass (1/2) z*((if z then (2:\u211d) else 0)-1)^2) \u2264 (2:\u211d)/4 := by norm_num [Obligations045.M0.limitingLoss, abs_div, Fintype.sum_bool, Obligations046.M1Bridge.bernMass]\n",
+        "exitCode": 1,
+        "cause": [
+          "unsolved goals"
+        ]
+      }
+    ]
+  }
+}

package/vectors/laws/m1-offdiag-limit.native-capture.json

@@ -0,0 +1,260 @@
+{
+  "archiveApproval": false,
+  "candidatePublicationCorrectionCovered": false,
+  "captures": [
+    {
+      "elapsedMs": 312.200917,
+      "expected": "fact",
+      "name": "orchard-projection",
+      "passed": true,
+      "requestSHA256": "sha256:ac3baa4cd5cd1f8b3f1ff55e492c9c661bd2f042ec3d9a4355f312854b04eea0",
+      "result": {
+        "kind": "fact",
+        "lines": [
+          "bound-lock/1 at=receipt:1 form=alphabet measure=reads role=reads scope=publication/evidence/m1-offdiag-limit value=proofs/m1-046-offdiag/M0Bridge.lean|proofs/m1-046-offdiag/M0Diagonal046.lean|proofs/m1-046-offdiag/M0Moments046.lean|proofs/m1-046-offdiag/M1Bridge046.lean|proofs/m1-046-offdiag/M1Offdiag046.lean|proofs/m1-046-offdiag/Obligations045/M0Limit.lean|proofs/m1-046-offdiag/Obligations045/M0Offdiag.lean|proofs/m1-046-offdiag/lake-manifest.json|proofs/m1-046-offdiag/lakefile.toml|proofs/m1-046-offdiag/lean-toolchain|vectors/laws/m1-offdiag-limit.lean.json|contracts/m1-subcauses.json|contracts/m1-offdiag-limit.json|samples/laws/m1-offdiag-limit/yes/sample.json|samples/laws/m1-offdiag-limit/no/sample.json|vectors/laws/policy.json"
+        ],
+        "protocol": "bound-lock/1"
+      }
+    },
+    {
+      "elapsedMs": 24620.799792,
+      "expected": "fact",
+      "name": "orchard-read",
+      "passed": true,
+      "requestSHA256": "sha256:420b0daf0fd44ea7c44dbc6fb07b275863c7b85af9d7ca0c7b41d64feddd25c5",
+      "result": {
+        "claims": [
+          {
+            "bound": {
+              "hi": 0,
+              "kind": "interval",
+              "lo": 0
+            },
+            "measure": "count",
+            "role": "writes",
+            "scope": "publication/evidence/m1-offdiag-limit"
+          },
+          {
+            "bound": {
+              "kind": "enumerated",
+              "values": [
+                "sha256:ea7a981fdd9f33b976ac6371549c7a5172e15e0c14394a08b2f542c2c0be3e2e"
+              ]
+            },
+            "measure": "digest",
+            "role": "writes",
+            "scope": "publication/evidence/m1-offdiag-limit/verification"
+          }
+        ],
+        "kind": "fact",
+        "protocol": "bound-lock/1"
+      }
+    },
+    {
+      "elapsedMs": 175.32708300000013,
+      "expected": "refuse",
+      "name": "orchard-missing-input",
+      "passed": true,
+      "requestSHA256": "sha256:84afff1031e64474744fa43abcdbcd39469038dfcb09e4ad553c5f066c386cdb",
+      "result": {
+        "kind": "refuse",
+        "protocol": "bound-lock/1",
+        "why": "Error: REFUSE\u00b7semilattice missing-input proofs/m1-046-offdiag/M1Offdiag046.lean"
+      }
+    },
+    {
+      "elapsedMs": 159.21141599999828,
+      "expected": "refuse",
+      "name": "orchard-handed-source-differs",
+      "passed": true,
+      "requestSHA256": "sha256:3745a48af677fe0a9b288ee42b6c0944cb6bc487f4889dafda3e2f95d17b63c9",
+      "result": {
+        "kind": "refuse",
+        "protocol": "bound-lock/1",
+        "why": "Error: REFUSE\u00b7semilattice fixture-source-differs proofs/m1-046-offdiag/M1Offdiag046.lean"
+      }
+    },
+    {
+      "elapsedMs": 158.54312500000015,
+      "expected": "refuse",
+      "name": "orchard-overstated-M1-offdiag",
+      "passed": true,
+      "requestSHA256": "sha256:b521ae35f6ed58911fbab0386c37b525e6422e7223e575eab4f5ec37da14a2f6",
+      "result": {
+        "kind": "refuse",
+        "protocol": "bound-lock/1",
+        "why": "Error: REFUSE\u00b7semilattice overstated-M1-offdiag"
+      }
+    },
+    {
+      "elapsedMs": 182.27337500000067,
+      "expected": "fact",
+      "name": "catalog-projection",
+      "passed": true,
+      "requestSHA256": "sha256:ac3baa4cd5cd1f8b3f1ff55e492c9c661bd2f042ec3d9a4355f312854b04eea0",
+      "result": {
+        "kind": "fact",
+        "lines": [
+          "bound-lock/1 at=receipt:1 form=alphabet measure=reads role=reads scope=publication/evidence/m1-offdiag-limit value=proofs/m1-046-offdiag/M0Bridge.lean|proofs/m1-046-offdiag/M0Diagonal046.lean|proofs/m1-046-offdiag/M0Moments046.lean|proofs/m1-046-offdiag/M1Bridge046.lean|proofs/m1-046-offdiag/M1Offdiag046.lean|proofs/m1-046-offdiag/Obligations045/M0Limit.lean|proofs/m1-046-offdiag/Obligations045/M0Offdiag.lean|proofs/m1-046-offdiag/lake-manifest.json|proofs/m1-046-offdiag/lakefile.toml|proofs/m1-046-offdiag/lean-toolchain|vectors/laws/m1-offdiag-limit.lean.json|contracts/m1-subcauses.json|contracts/m1-offdiag-limit.json|samples/laws/m1-offdiag-limit/yes/sample.json|samples/laws/m1-offdiag-limit/no/sample.json|vectors/laws/policy.json"
+        ],
+        "protocol": "bound-lock/1"
+      }
+    },
+    {
+      "elapsedMs": 15418.176583999997,
+      "expected": "fact",
+      "name": "catalog-read",
+      "passed": true,
+      "requestSHA256": "sha256:420b0daf0fd44ea7c44dbc6fb07b275863c7b85af9d7ca0c7b41d64feddd25c5",
+      "result": {
+        "claims": [
+          {
+            "bound": {
+              "hi": 0,
+              "kind": "interval",
+              "lo": 0
+            },
+            "measure": "count",
+            "role": "writes",
+            "scope": "publication/evidence/m1-offdiag-limit"
+          },
+          {
+            "bound": {
+              "kind": "enumerated",
+              "values": [
+                "sha256:ea7a981fdd9f33b976ac6371549c7a5172e15e0c14394a08b2f542c2c0be3e2e"
+              ]
+            },
+            "measure": "digest",
+            "role": "writes",
+            "scope": "publication/evidence/m1-offdiag-limit/verification"
+          }
+        ],
+        "kind": "fact",
+        "protocol": "bound-lock/1"
+      }
+    },
+    {
+      "elapsedMs": 222.87250000000495,
+      "expected": "refuse",
+      "name": "catalog-missing-input",
+      "passed": true,
+      "requestSHA256": "sha256:84afff1031e64474744fa43abcdbcd39469038dfcb09e4ad553c5f066c386cdb",
+      "result": {
+        "kind": "refuse",
+        "protocol": "bound-lock/1",
+        "why": "Error: REFUSE\u00b7semilattice missing-input proofs/m1-046-offdiag/M1Offdiag046.lean"
+      }
+    },
+    {
+      "elapsedMs": 181.9406250000029,
+      "expected": "refuse",
+      "name": "catalog-handed-source-differs",
+      "passed": true,
+      "requestSHA256": "sha256:3745a48af677fe0a9b288ee42b6c0944cb6bc487f4889dafda3e2f95d17b63c9",
+      "result": {
+        "kind": "refuse",
+        "protocol": "bound-lock/1",
+        "why": "Error: REFUSE\u00b7semilattice fixture-source-differs proofs/m1-046-offdiag/M1Offdiag046.lean"
+      }
+    },
+    {
+      "elapsedMs": 191.3113749999975,
+      "expected": "refuse",
+      "name": "catalog-overstated-M1-offdiag",
+      "passed": true,
+      "requestSHA256": "sha256:b521ae35f6ed58911fbab0386c37b525e6422e7223e575eab4f5ec37da14a2f6",
+      "result": {
+        "kind": "refuse",
+        "protocol": "bound-lock/1",
+        "why": "Error: REFUSE\u00b7semilattice overstated-M1-offdiag"
+      }
+    }
+  ],
+  "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-offdiag/M0Bridge.lean",
+      "sha256": "sha256:b438b2961b93c62787275e158a90b534a400de8646a0552b099863fa5227c21e"
+    },
+    {
+      "bytes": 10587,
+      "path": "proofs/m1-046-offdiag/M0Diagonal046.lean",
+      "sha256": "sha256:c0403d40e1c6849045bf70eab2854eeac28a2464783e06ce03f2f36e33c2146c"
+    },
+    {
+      "bytes": 12023,
+      "path": "proofs/m1-046-offdiag/M0Moments046.lean",
+      "sha256": "sha256:06780115a2b44a77a9be72673350332b77045489dba7ff081beecd48b8d51a73"
+    },
+    {
+      "bytes": 17502,
+      "path": "proofs/m1-046-offdiag/M1Bridge046.lean",
+      "sha256": "sha256:a21ac1dedb07af4f28752238edd564293967d8177b75979feead44f01f347b9c"
+    },
+    {
+      "bytes": 12823,
+      "path": "proofs/m1-046-offdiag/M1Offdiag046.lean",
+      "sha256": "sha256:faf6ef0b27049ff4cb89db0e216102239b8bb3f29a76e2a66442fb7c9b6ccd2b"
+    },
+    {
+      "bytes": 5762,
+      "path": "proofs/m1-046-offdiag/Obligations045/M0Limit.lean",
+      "sha256": "sha256:aedc88b8ba4edf884cacec78da82eef29187ded0199d44674466425af1585b8c"
+    },
+    {
+      "bytes": 8801,
+      "path": "proofs/m1-046-offdiag/Obligations045/M0Offdiag.lean",
+      "sha256": "sha256:af8a95d00cd0956acaec06deeebe7156dccf156b698408275c3e710f58c1c1e8"
+    },
+    {
+      "bytes": 3526,
+      "path": "proofs/m1-046-offdiag/lake-manifest.json",
+      "sha256": "sha256:fc8b4ba4b08bbcadf736bc8bcf803b5fdedfebafb57dec61ce0106e99964285d"
+    },
+    {
+      "bytes": 549,
+      "path": "proofs/m1-046-offdiag/lakefile.toml",
+      "sha256": "sha256:1853d377780647756b113f9b077ea95cde54c98fb5e570902c736ab5799f5af9"
+    },
+    {
+      "bytes": 25,
+      "path": "proofs/m1-046-offdiag/lean-toolchain",
+      "sha256": "sha256:55e97be96000b5e9e290c9e74482e5e317861499a5540353ce845471bded8cea"
+    },
+    {
+      "bytes": 47656,
+      "path": "vectors/laws/m1-offdiag-limit.lean.json",
+      "sha256": "sha256:8074c90962613d8dccdde37f1657377191cd12df1da4e2c297936f897ea8dde3"
+    },
+    {
+      "bytes": 6036,
+      "path": "contracts/m1-subcauses.json",
+      "sha256": "sha256:8213a6cc3a5ca80a6adb594b9d8f28504c9566200a6d585f675585db2c8d45cc"
+    },
+    {
+      "bytes": 3480,
+      "path": "contracts/m1-offdiag-limit.json",
+      "sha256": "sha256:80ccec0916db5da35fbff2284aa739cb64bd22f8d7eaa308a43e5d44c4e68177"
+    },
+    {
+      "bytes": 1662,
+      "path": "samples/laws/m1-offdiag-limit/yes/sample.json",
+      "sha256": "sha256:235ff6999c346055c4e22207e5a2dfdc4633ba016e6d29fe264f2758664b3864"
+    },
+    {
+      "bytes": 653,
+      "path": "samples/laws/m1-offdiag-limit/no/sample.json",
+      "sha256": "sha256:813962d712a8cda54caa9fec008abf826730e1eb9ac628a4a56d6ab2619d52dc"
+    },
+    {
+      "bytes": 2761,
+      "path": "vectors/laws/policy.json",
+      "sha256": "sha256:e941ce8cd86f0ec31621fa6b4deef9685dc1fead283f4b2fe22a8a58e3d5d939"
+    }
+  ]
+}

package/vectors/laws/model-collapse-1a.json

@@ -0,0 +1,12 @@
+{
+  "classification": "protocol-status fixture only, not experimental result",
+  "id": "experiment1a-protocol-boundaries@1",
+  "nativeReceipt": false,
+  "negative": "No empirical/causal result can be inferred from metadata or finite falling curve",
+  "policy": "policy.json",
+  "positive": "No licensed dataset or execution -> unmeasured",
+  "protocol": {
+    "path": "protocols/model-collapse-1a.json",
+    "sha256": "sha256:7b8e16cbc8dff5d1654b8bb3710dd619810dde74ad8bb3a70b92dec377af736f"
+  }
+}

package/vectors/laws/projection-chain.json

@@ -0,0 +1,61 @@
+{
+  "atoms": [
+    "a",
+    "b",
+    "c",
+    "d"
+  ],
+  "chainEnumeration": "g is every partition of the image blocks of f",
+  "id": "projection-chain-bounded@1",
+  "negative": {
+    "Y": [
+      0,
+      0,
+      1,
+      1
+    ],
+    "Z": [
+      0,
+      1,
+      0,
+      1
+    ],
+    "conditionalBits": [
+      1,
+      1,
+      1
+    ],
+    "prior": [
+      1,
+      1,
+      1,
+      1
+    ]
+  },
+  "partitionEnumeration": "restricted growth strings length4, starting0",
+  "policy": "policy.json",
+  "positive": {
+    "f": [
+      0,
+      0,
+      1,
+      1
+    ],
+    "g": [
+      0,
+      0
+    ],
+    "lossBits": [
+      1,
+      1,
+      2
+    ],
+    "prior": [
+      1,
+      1,
+      1,
+      1
+    ]
+  },
+  "priorNumeratorTotal": 4
+}