@lapxo/obligations 0.4.5 → 0.4.6

package/vectors/laws/m0-diagonal-symmetric.lean.json

@@ -0,0 +1,188 @@
+{
+  "id": "m0-diagonal-symmetric",
+  "claim": "diagonal-prerequisites-and-conditional-transfer",
+  "status": "kernel-proved conditional statement; unsigned native reader preparation",
+  "proof": {
+    "files": [
+      {
+        "path": "proofs/m0-046-diagonal/BridgeNegatives.lean",
+        "sha256": "sha256:956afd1cfe87eaf2c6586822541a3ede6cc285f8659d27d88228f5534e1c640b"
+      },
+      {
+        "path": "proofs/m0-046-diagonal/M0Bridge.lean",
+        "sha256": "sha256:b438b2961b93c62787275e158a90b534a400de8646a0552b099863fa5227c21e"
+      },
+      {
+        "path": "proofs/m0-046-diagonal/M0Diagonal046.lean",
+        "sha256": "sha256:c0403d40e1c6849045bf70eab2854eeac28a2464783e06ce03f2f36e33c2146c"
+      },
+      {
+        "path": "proofs/m0-046-diagonal/M0Lindeberg046.lean",
+        "sha256": "sha256:de5477cdde114064f3d272ede95490483040fc857399181c376c285c02411da8"
+      },
+      {
+        "path": "proofs/m0-046-diagonal/M0Moments046.lean",
+        "sha256": "sha256:06780115a2b44a77a9be72673350332b77045489dba7ff081beecd48b8d51a73"
+      },
+      {
+        "path": "proofs/m0-046-diagonal/M0Threshold046.lean",
+        "sha256": "sha256:861cd13ecd4b7f37a1bc00362b4fdc213cefdcf380171947a14463b0bc465a9e"
+      },
+      {
+        "path": "proofs/m0-046-diagonal/Obligations045.lean",
+        "sha256": "sha256:be4956a2720d696e5456ad108543945c6f65f1986126513f10edcd4f1841bced"
+      },
+      {
+        "path": "proofs/m0-046-diagonal/Obligations045/ConsensusGrid.lean",
+        "sha256": "sha256:b26a1b68522e881e446a47f4c84cd8b569a1c48f085a5c9a9d03abdeecafacce"
+      },
+      {
+        "path": "proofs/m0-046-diagonal/Obligations045/M0Coincidence.lean",
+        "sha256": "sha256:e870a43e435f4b4b52f28f44dd7391c40704faa41febd272434d2e56b2bd6771"
+      },
+      {
+        "path": "proofs/m0-046-diagonal/Obligations045/M0Diagonal.lean",
+        "sha256": "sha256:4d83f047fc5e199f46b2cc28dfe77b006a7dd408f0f14ed54afb5e21315148e2"
+      },
+      {
+        "path": "proofs/m0-046-diagonal/Obligations045/M0Limit.lean",
+        "sha256": "sha256:aedc88b8ba4edf884cacec78da82eef29187ded0199d44674466425af1585b8c"
+      },
+      {
+        "path": "proofs/m0-046-diagonal/Obligations045/M0Offdiag.lean",
+        "sha256": "sha256:af8a95d00cd0956acaec06deeebe7156dccf156b698408275c3e710f58c1c1e8"
+      },
+      {
+        "path": "proofs/m0-046-diagonal/lake-manifest.json",
+        "sha256": "sha256:fc8b4ba4b08bbcadf736bc8bcf803b5fdedfebafb57dec61ce0106e99964285d"
+      },
+      {
+        "path": "proofs/m0-046-diagonal/lakefile.toml",
+        "sha256": "sha256:9738f8737965b3383db30a9c7bd7c5c7b24526e59794cf1d3ecf71b5d0827b92"
+      },
+      {
+        "path": "proofs/m0-046-diagonal/lean-toolchain",
+        "sha256": "sha256:55e97be96000b5e9e290c9e74482e5e317861499a5540353ce845471bded8cea"
+      }
+    ],
+    "mathlib": "c44e0c8ee63ca166450922a373c7409c5d26b00b",
+    "auditedTheorems": [
+      "Obligations046.Diagonal.weights_fin_sum",
+      "Obligations046.Diagonal.variance_lower_pos",
+      "Obligations046.Diagonal.bernoulli_variance_lower",
+      "Obligations046.Diagonal.variance_rate_pos",
+      "Obligations046.Diagonal.finite_variance_lower",
+      "Obligations046.Diagonal.mean_rounding_bound",
+      "Obligations046.Diagonal.diagonal_mean_bound",
+      "Obligations046.Diagonal.variance_rate_limit",
+      "Obligations046.Diagonal.variance_atTop",
+      "Obligations046.Diagonal.diagonal_drift_squared_limit",
+      "Obligations046.Diagonal.complement_involutive",
+      "Obligations046.Diagonal.unbiased_mass_complement",
+      "Obligations046.Diagonal.unbiased_joint_complement",
+      "Obligations046.Diagonal.count_complement",
+      "Obligations046.Diagonal.fair_loss_reflection",
+      "Obligations046.Diagonal.unbiased_conditional_exact",
+      "Obligations046.Diagonal.floor_limit_diag_unbiased",
+      "Obligations046.Diagonal.deterministic_quota_even",
+      "Obligations046.Diagonal.deterministic_quota_odd",
+      "Obligations046.Diagonal.heterogeneous_diagonal",
+      "Obligations046.Diagonal.heterogeneous_not_unbiased"
+    ],
+    "allowedAxioms": [
+      "Classical.choice",
+      "Quot.sound",
+      "propext"
+    ]
+  },
+  "samples": {
+    "inputs": [
+      "contracts/m0-diagonal-conditional.json",
+      "samples/laws/m0-diagonal-conditional/yes/sample.json",
+      "samples/laws/m0-diagonal-conditional/no/sample.json",
+      "vectors/laws/policy.json"
+    ],
+    "digests": {
+      "contracts/m0-diagonal-conditional.json": "sha256:e8644b4508965b6187dbf210cdced97ba14c4f1e748dac68fe9bb3e078e528a7",
+      "samples/laws/m0-diagonal-conditional/yes/sample.json": "sha256:769f0bbdc8ab13fffff841ea1121d8348885d65f64fb719528aa5a2a1e219078",
+      "samples/laws/m0-diagonal-conditional/no/sample.json": "sha256:68ff10d4e29c311760aca786dd85362d6dcc62c893ca715882485d38ef77025e",
+      "vectors/laws/policy.json": "sha256:e941ce8cd86f0ec31621fa6b4deef9685dc1fead283f4b2fe22a8a58e3d5d939"
+    }
+  },
+  "capturePolicy": {
+    "timeoutMs": 25000,
+    "responseBytes": 65536
+  },
+  "execution": {
+    "profile": "lean-kernel@1",
+    "project": "proofs/m0-046-diagonal",
+    "identityInputs": [
+      "proofs/m0-046-diagonal/BridgeNegatives.lean",
+      "proofs/m0-046-diagonal/M0Bridge.lean",
+      "proofs/m0-046-diagonal/M0Diagonal046.lean",
+      "proofs/m0-046-diagonal/M0Lindeberg046.lean",
+      "proofs/m0-046-diagonal/M0Moments046.lean",
+      "proofs/m0-046-diagonal/M0Threshold046.lean",
+      "proofs/m0-046-diagonal/Obligations045.lean",
+      "proofs/m0-046-diagonal/Obligations045/ConsensusGrid.lean",
+      "proofs/m0-046-diagonal/Obligations045/M0Coincidence.lean",
+      "proofs/m0-046-diagonal/Obligations045/M0Diagonal.lean",
+      "proofs/m0-046-diagonal/Obligations045/M0Limit.lean",
+      "proofs/m0-046-diagonal/Obligations045/M0Offdiag.lean",
+      "proofs/m0-046-diagonal/lake-manifest.json",
+      "proofs/m0-046-diagonal/lakefile.toml",
+      "proofs/m0-046-diagonal/lean-toolchain",
+      "vectors/laws/m0-diagonal-symmetric.lean.json",
+      "contracts/m0-diagonal-conditional.json",
+      "samples/laws/m0-diagonal-conditional/yes/sample.json",
+      "samples/laws/m0-diagonal-conditional/no/sample.json",
+      "vectors/laws/policy.json"
+    ],
+    "toolchain": "leanprover/lean4:v4.19.0",
+    "compilerIdentity": "6caaee842e94",
+    "targets": [
+      "M0Diagonal046"
+    ],
+    "sources": [
+      "M0Diagonal046.lean"
+    ],
+    "auditImports": [
+      "M0Diagonal046"
+    ],
+    "negative": {
+      "name": "score-is-not-unbiased",
+      "source": "import M0Diagonal046\nopen Obligations045.M0 Obligations046.Diagonal Filter Topology\nnoncomputable section\nexample : Tendsto (fun N => conditionalError heterogeneous N heterogeneousA) atTop (\ud835\udcdd ((1:\u211d)/2)) := by\n  exact floor_limit_diag_unbiased heterogeneous heterogeneousA heterogeneous_diagonal\n",
+      "exitCode": 1,
+      "cause": [
+        "type mismatch"
+      ]
+    },
+    "extraNegatives": [
+      {
+        "name": "boundary-is-not-domain",
+        "source": "import M0Diagonal046\nopen Obligations045.M0\nnoncomputable section\nexample : (1:\u211d) < 1 := by norm_num\n",
+        "exitCode": 1,
+        "cause": [
+          "unsolved goals"
+        ]
+      }
+    ]
+  },
+  "boundary": {
+    "productLaw": "raw individual joint Bernoulli law, never assumed binomial counts",
+    "finiteRepresentation": "all N, fair ties",
+    "average": "N>0; zero handled separately",
+    "offdiag": "all inherited sampling/measurability hypotheses and no score=1/2",
+    "generalDiagonal": false,
+    "cEqualsOne": false,
+    "originIndependenceClaimed": false,
+    "admitted": false,
+    "rootReceipts": false,
+    "releaseReady": false
+  },
+  "generalDiagonal": {
+    "status": "open",
+    "actualCLTProved": false
+  },
+  "block": "symmetric"
+}

package/vectors/laws/m0-diagonal-threshold.lean.json

@@ -0,0 +1,199 @@
+{
+  "id": "m0-diagonal-threshold",
+  "claim": "diagonal-prerequisites-and-conditional-transfer",
+  "status": "kernel-proved conditional statement; unsigned native reader preparation",
+  "proof": {
+    "files": [
+      {
+        "path": "proofs/m0-046-diagonal/BridgeNegatives.lean",
+        "sha256": "sha256:956afd1cfe87eaf2c6586822541a3ede6cc285f8659d27d88228f5534e1c640b"
+      },
+      {
+        "path": "proofs/m0-046-diagonal/M0Bridge.lean",
+        "sha256": "sha256:b438b2961b93c62787275e158a90b534a400de8646a0552b099863fa5227c21e"
+      },
+      {
+        "path": "proofs/m0-046-diagonal/M0Diagonal046.lean",
+        "sha256": "sha256:c0403d40e1c6849045bf70eab2854eeac28a2464783e06ce03f2f36e33c2146c"
+      },
+      {
+        "path": "proofs/m0-046-diagonal/M0Lindeberg046.lean",
+        "sha256": "sha256:de5477cdde114064f3d272ede95490483040fc857399181c376c285c02411da8"
+      },
+      {
+        "path": "proofs/m0-046-diagonal/M0Moments046.lean",
+        "sha256": "sha256:06780115a2b44a77a9be72673350332b77045489dba7ff081beecd48b8d51a73"
+      },
+      {
+        "path": "proofs/m0-046-diagonal/M0Threshold046.lean",
+        "sha256": "sha256:861cd13ecd4b7f37a1bc00362b4fdc213cefdcf380171947a14463b0bc465a9e"
+      },
+      {
+        "path": "proofs/m0-046-diagonal/Obligations045.lean",
+        "sha256": "sha256:be4956a2720d696e5456ad108543945c6f65f1986126513f10edcd4f1841bced"
+      },
+      {
+        "path": "proofs/m0-046-diagonal/Obligations045/ConsensusGrid.lean",
+        "sha256": "sha256:b26a1b68522e881e446a47f4c84cd8b569a1c48f085a5c9a9d03abdeecafacce"
+      },
+      {
+        "path": "proofs/m0-046-diagonal/Obligations045/M0Coincidence.lean",
+        "sha256": "sha256:e870a43e435f4b4b52f28f44dd7391c40704faa41febd272434d2e56b2bd6771"
+      },
+      {
+        "path": "proofs/m0-046-diagonal/Obligations045/M0Diagonal.lean",
+        "sha256": "sha256:4d83f047fc5e199f46b2cc28dfe77b006a7dd408f0f14ed54afb5e21315148e2"
+      },
+      {
+        "path": "proofs/m0-046-diagonal/Obligations045/M0Limit.lean",
+        "sha256": "sha256:aedc88b8ba4edf884cacec78da82eef29187ded0199d44674466425af1585b8c"
+      },
+      {
+        "path": "proofs/m0-046-diagonal/Obligations045/M0Offdiag.lean",
+        "sha256": "sha256:af8a95d00cd0956acaec06deeebe7156dccf156b698408275c3e710f58c1c1e8"
+      },
+      {
+        "path": "proofs/m0-046-diagonal/lake-manifest.json",
+        "sha256": "sha256:fc8b4ba4b08bbcadf736bc8bcf803b5fdedfebafb57dec61ce0106e99964285d"
+      },
+      {
+        "path": "proofs/m0-046-diagonal/lakefile.toml",
+        "sha256": "sha256:9738f8737965b3383db30a9c7bd7c5c7b24526e59794cf1d3ecf71b5d0827b92"
+      },
+      {
+        "path": "proofs/m0-046-diagonal/lean-toolchain",
+        "sha256": "sha256:55e97be96000b5e9e290c9e74482e5e317861499a5540353ce845471bded8cea"
+      }
+    ],
+    "mathlib": "c44e0c8ee63ca166450922a373c7409c5d26b00b",
+    "auditedTheorems": [
+      "Obligations046.Threshold.moving_cut_sandwich",
+      "Obligations046.Threshold.sigma_pos",
+      "Obligations046.Threshold.threshold_limit",
+      "Obligations046.Threshold.fair_loss_bounds",
+      "Obligations046.Threshold.lower_cut_pointwise",
+      "Obligations046.Threshold.upper_cut_pointwise",
+      "Obligations046.Threshold.cdf_finite",
+      "Obligations046.Threshold.error_finite",
+      "Obligations046.Threshold.joint_nonneg",
+      "Obligations046.Threshold.lower_cut",
+      "Obligations046.Threshold.upper_cut",
+      "Obligations046.Threshold.diagonal_transfer_of_fixed_cut_limits",
+      "Obligations046.Threshold.cdf_mono",
+      "Obligations046.Threshold.strict_lower_cut",
+      "Obligations046.Threshold.strict_upper_cut",
+      "Obligations046.Threshold.threshold_cdf_limits_of_fixed_cut_limits",
+      "Obligations046.Threshold.standardized_eq_threshold",
+      "Obligations046.Threshold.weak_strict_indicator_difference",
+      "Obligations046.Threshold.tie_mass_difference",
+      "Obligations046.Threshold.tie_limit_of_fixed_cut_limits",
+      "Obligations046.Threshold.floor_limit_diag_of_fixed_cut_limits",
+      "Obligations046.Threshold.above_limit",
+      "Obligations046.Threshold.above_loss_zero",
+      "Obligations046.Threshold.lgn_alone_does_not_give_half"
+    ],
+    "allowedAxioms": [
+      "Classical.choice",
+      "Quot.sound",
+      "propext"
+    ]
+  },
+  "samples": {
+    "inputs": [
+      "contracts/m0-diagonal-conditional.json",
+      "samples/laws/m0-diagonal-conditional/yes/sample.json",
+      "samples/laws/m0-diagonal-conditional/no/sample.json",
+      "vectors/laws/policy.json"
+    ],
+    "digests": {
+      "contracts/m0-diagonal-conditional.json": "sha256:e8644b4508965b6187dbf210cdced97ba14c4f1e748dac68fe9bb3e078e528a7",
+      "samples/laws/m0-diagonal-conditional/yes/sample.json": "sha256:769f0bbdc8ab13fffff841ea1121d8348885d65f64fb719528aa5a2a1e219078",
+      "samples/laws/m0-diagonal-conditional/no/sample.json": "sha256:68ff10d4e29c311760aca786dd85362d6dcc62c893ca715882485d38ef77025e",
+      "vectors/laws/policy.json": "sha256:e941ce8cd86f0ec31621fa6b4deef9685dc1fead283f4b2fe22a8a58e3d5d939"
+    }
+  },
+  "capturePolicy": {
+    "timeoutMs": 25000,
+    "responseBytes": 65536
+  },
+  "execution": {
+    "profile": "lean-kernel@1",
+    "project": "proofs/m0-046-diagonal",
+    "identityInputs": [
+      "proofs/m0-046-diagonal/BridgeNegatives.lean",
+      "proofs/m0-046-diagonal/M0Bridge.lean",
+      "proofs/m0-046-diagonal/M0Diagonal046.lean",
+      "proofs/m0-046-diagonal/M0Lindeberg046.lean",
+      "proofs/m0-046-diagonal/M0Moments046.lean",
+      "proofs/m0-046-diagonal/M0Threshold046.lean",
+      "proofs/m0-046-diagonal/Obligations045.lean",
+      "proofs/m0-046-diagonal/Obligations045/ConsensusGrid.lean",
+      "proofs/m0-046-diagonal/Obligations045/M0Coincidence.lean",
+      "proofs/m0-046-diagonal/Obligations045/M0Diagonal.lean",
+      "proofs/m0-046-diagonal/Obligations045/M0Limit.lean",
+      "proofs/m0-046-diagonal/Obligations045/M0Offdiag.lean",
+      "proofs/m0-046-diagonal/lake-manifest.json",
+      "proofs/m0-046-diagonal/lakefile.toml",
+      "proofs/m0-046-diagonal/lean-toolchain",
+      "vectors/laws/m0-diagonal-threshold.lean.json",
+      "contracts/m0-diagonal-conditional.json",
+      "samples/laws/m0-diagonal-conditional/yes/sample.json",
+      "samples/laws/m0-diagonal-conditional/no/sample.json",
+      "vectors/laws/policy.json"
+    ],
+    "toolchain": "leanprover/lean4:v4.19.0",
+    "compilerIdentity": "6caaee842e94",
+    "targets": [
+      "M0Threshold046"
+    ],
+    "sources": [
+      "M0Threshold046.lean"
+    ],
+    "auditImports": [
+      "M0Threshold046"
+    ],
+    "negative": {
+      "name": "omit-fixed-cut-limits",
+      "source": "import M0Threshold046\nopen Obligations045.M0 Obligations046.Threshold Filter Topology\nnoncomputable section\nexample (M : Domain) (a : Fin M.K \u2192 Bool) (hdiag : score M a = (1:\u211d)/2)\n    (F : \u211d \u2192 \u211d) (hF : ContinuousAt F 0) (hF0 : F 0 = (1:\u211d)/2) :\n    Tendsto (fun N => conditionalError M N a) atTop (\ud835\udcdd ((1:\u211d)/2)) := by\n  apply floor_limit_diag_of_fixed_cut_limits M a hdiag F hF hF0\n",
+      "exitCode": 1,
+      "cause": [
+        "unsolved goals"
+      ]
+    },
+    "extraNegatives": [
+      {
+        "name": "omit-limit-continuity",
+        "source": "import M0Threshold046\nopen Obligations045.M0 Obligations046.Threshold Filter Topology\nnoncomputable section\nexample (M : Domain) (a : Fin M.K \u2192 Bool) (hdiag : score M a = (1:\u211d)/2)\n    (F : \u211d \u2192 \u211d) (hF0 : F 0 = (1:\u211d)/2)\n    (hCLT : \u2200 z, Tendsto (fun N => cdf M a N z) atTop (\ud835\udcdd (F z))) :\n    Tendsto (fun N => conditionalError M N a) atTop (\ud835\udcdd ((1:\u211d)/2)) := by\n  apply floor_limit_diag_of_fixed_cut_limits M a hdiag F ?_ hF0 hCLT\n",
+        "exitCode": 1,
+        "cause": [
+          "unsolved goals"
+        ]
+      },
+      {
+        "name": "lgn-is-not-majority-limit",
+        "source": "import M0Threshold046\nopen Obligations045.M0 Obligations046.Threshold Filter Topology\nnoncomputable section\nexample : Tendsto (fun N => limitingLoss (above N)) atTop (\ud835\udcdd ((1:\u211d)/2)) := by\n  exact above_limit\n",
+        "exitCode": 1,
+        "cause": [
+          "type mismatch"
+        ]
+      }
+    ]
+  },
+  "boundary": {
+    "productLaw": "raw individual joint Bernoulli law, never assumed binomial counts",
+    "finiteRepresentation": "all N, fair ties",
+    "average": "N>0; zero handled separately",
+    "offdiag": "all inherited sampling/measurability hypotheses and no score=1/2",
+    "generalDiagonal": false,
+    "cEqualsOne": false,
+    "originIndependenceClaimed": false,
+    "admitted": false,
+    "rootReceipts": false,
+    "releaseReady": false
+  },
+  "generalDiagonal": {
+    "status": "open",
+    "actualCLTProved": false
+  },
+  "block": "threshold"
+}

package/vectors/laws/m0-identification.lean.json

@@ -0,0 +1,136 @@
+{
+  "id": "m0-identification",
+  "block": "identification",
+  "claim": "conditional-uniform-population-identification",
+  "generalDiagonal": {
+    "status": "open",
+    "actualCLTProved": false
+  },
+  "identificationBoundary": {
+    "family": "uniform-known-p-population@1",
+    "nonuniformIdentified": false,
+    "finiteSampleGuarantee": false,
+    "originalThreeCards": "open"
+  },
+  "proof": {
+    "files": [
+      {
+        "path": "proofs/m0-046-identification/M0Identification046.lean",
+        "sha256": "sha256:f77a6b3fe02655ad26b18c403bf9b23367788e9bdd0191817bdcf311f3799f30"
+      },
+      {
+        "path": "proofs/m0-046-identification/Obligations045/M0Coincidence.lean",
+        "sha256": "sha256:e870a43e435f4b4b52f28f44dd7391c40704faa41febd272434d2e56b2bd6771"
+      },
+      {
+        "path": "proofs/m0-046-identification/lake-manifest.json",
+        "sha256": "sha256:fc8b4ba4b08bbcadf736bc8bcf803b5fdedfebafb57dec61ce0106e99964285d"
+      },
+      {
+        "path": "proofs/m0-046-identification/lakefile.toml",
+        "sha256": "sha256:f79ba6f5e48427aaa5bf5e6bfd5574bbfbb8a479b5b30aa95ecbda868debaa3c"
+      },
+      {
+        "path": "proofs/m0-046-identification/lean-toolchain",
+        "sha256": "sha256:55e97be96000b5e9e290c9e74482e5e317861499a5540353ce845471bded8cea"
+      }
+    ],
+    "mathlib": "c44e0c8ee63ca166450922a373c7409c5d26b00b",
+    "auditedTheorems": [
+      "Obligations046.M0Identification.expect_quartic",
+      "Obligations046.M0Identification.fourth_coincidence",
+      "Obligations046.M0Identification.uniform_fourth_strict",
+      "Obligations046.M0Identification.uniform_pair_fourth_injective",
+      "Obligations046.M0Identification.recover_uniform_parameters",
+      "Obligations046.M0Identification.uniform_cK_injective",
+      "Obligations046.M0Identification.nonuniform_normalized",
+      "Obligations046.M0Identification.nonuniform_power_collision",
+      "Obligations046.M0Identification.nonuniform_same_pair_fourth",
+      "Obligations046.M0Identification.nonuniform_distinct_parameters",
+      "Obligations046.M0Identification.nonuniform_actual_fourth_collision",
+      "Obligations046.M0Identification.uniform_normalized",
+      "Obligations046.M0Identification.uniform_powers",
+      "Obligations046.M0Identification.uniform_population_pair",
+      "Obligations046.M0Identification.uniform_population_fourth",
+      "Obligations046.M0Identification.uniform_population_identification",
+      "Obligations046.M0Identification.unknown_p_alias",
+      "Obligations046.M0Identification.zero_c_alias"
+    ],
+    "allowedAxioms": [
+      "propext",
+      "Classical.choice",
+      "Quot.sound"
+    ]
+  },
+  "samples": {
+    "inputs": [
+      "contracts/m0-moment-identification.json",
+      "samples/laws/m0-moment-identification/yes/sample.json",
+      "samples/laws/m0-moment-identification/no/sample.json",
+      "vectors/laws/policy.json"
+    ],
+    "digests": {
+      "contracts/m0-moment-identification.json": "sha256:d8fcf6214714a6d5a6d47291aa1bbd874ea3b4f778bcceef0e9982335caa359b",
+      "samples/laws/m0-moment-identification/yes/sample.json": "sha256:602257498a1cef389ee0edf21f33b5ca78db9c792a5dc93b6316ba0c08f31d04",
+      "samples/laws/m0-moment-identification/no/sample.json": "sha256:72b1eaea2ae316acc87f5a3eb231c60dee0950abad2c20643fe2578b8e1235d3",
+      "vectors/laws/policy.json": "sha256:e941ce8cd86f0ec31621fa6b4deef9685dc1fead283f4b2fe22a8a58e3d5d939"
+    }
+  },
+  "capturePolicy": {
+    "timeoutMs": 25000,
+    "responseBytes": 65536
+  },
+  "execution": {
+    "profile": "lean-kernel@1",
+    "project": "proofs/m0-046-identification",
+    "toolchain": "leanprover/lean4:v4.19.0",
+    "compilerIdentity": "6caaee842e94",
+    "targets": [
+      "M0Identification046"
+    ],
+    "sources": [
+      "M0Identification046.lean"
+    ],
+    "auditImports": [
+      "M0Identification046"
+    ],
+    "identityInputs": [
+      "proofs/m0-046-identification/M0Identification046.lean",
+      "proofs/m0-046-identification/Obligations045/M0Coincidence.lean",
+      "proofs/m0-046-identification/lake-manifest.json",
+      "proofs/m0-046-identification/lakefile.toml",
+      "proofs/m0-046-identification/lean-toolchain",
+      "vectors/laws/m0-identification.lean.json",
+      "contracts/m0-moment-identification.json",
+      "samples/laws/m0-moment-identification/yes/sample.json",
+      "samples/laws/m0-moment-identification/no/sample.json",
+      "vectors/laws/policy.json"
+    ],
+    "negative": {
+      "name": "nonuniform-as-uniform",
+      "source": "import Obligations045.M0Coincidence\nimport Mathlib.Tactic.Linarith\nimport Mathlib.Tactic.FieldSimp\nimport Mathlib.Tactic.Positivity\n\nnoncomputable section\nnamespace Obligations046.M0Identification\nopen Obligations045.M0Coincidence\n\ndef powers (ws : List \u211d) (k : \u2115) : \u211d := (ws.map (fun w => w^k)).sum\n\ndef m1 (p : \u211d) (ws : List \u211d) := p*ws.sum\ndef m2 (p : \u211d) (ws : List \u211d) := p^2*ws.sum^2+p*(1-p)*powers ws 2\ndef m3 (p : \u211d) (ws : List \u211d) := p^3*ws.sum^3+3*p^2*(1-p)*ws.sum*powers ws 2+p*(1-p)*(1-2*p)*powers ws 3\ndef m4 (p : \u211d) (ws : List \u211d) := p^4*ws.sum^4+6*p^3*(1-p)*ws.sum^2*powers ws 2+3*(p*(1-p))^2*(powers ws 2)^2+4*p^2*(1-p)*(1-2*p)*ws.sum*powers ws 3+p*(1-p)*(1-6*p*(1-p))*powers ws 4\n\ntheorem expect_quartic (p : \u211d) (ws : List \u211d) (a b d e f : \u211d) :\n    expect p ws (fun x => a*x^4+b*x^3+d*x^2+e*x+f) =\n    a*m4 p ws+b*m3 p ws+d*m2 p ws+e*m1 p ws+f := by\n  induction ws generalizing a b d e f with\n  | nil => simp [expect, m1, m2, m3, m4, powers]\n  | cons w ws ih =>\n    have hf : (fun x : \u211d => a*(w+x)^4+b*(w+x)^3+d*(w+x)^2+e*(w+x)+f) =\n        (fun x => a*x^4+(4*a*w+b)*x^3+(6*a*w^2+3*b*w+d)*x^2+\n          (4*a*w^3+3*b*w^2+2*d*w+e)*x+(a*w^4+b*w^3+d*w^2+e*w+f)) := by\n      funext x\n      ring\n    simp only [expect, hf]\n    rw [ih, ih]\n    simp only [m1, m2, m3, m4, List.sum_cons, powers, List.map_cons]\n    ring\n\ndef r2 (p B : \u211d) := p^2+(1-p)^2+2*p*(1-p)*B\ndef r4 (p B C E : \u211d) := p^4+(1-p)^4+6*(p^2+(1-p)^2)*p*(1-p)*B-\n    4*p*(1-p)*(1-2*p)^2*C+6*(p*(1-p))^2*B^2+2*p*(1-p)*(1-6*p*(1-p))*E\n\ntheorem fourth_coincidence (p c : \u211d) (ws : List \u211d) (hw : ws.sum = 1) :\n    expect p ws (fun x => ((1-c)*p+c*x)^4+(1-((1-c)*p+c*x))^4) =\n    r4 p (c^2*powers ws 2) (c^3*powers ws 3) (c^4*powers ws 4) := by\n  have hf : (fun x : \u211d => ((1-c)*p+c*x)^4+(1-((1-c)*p+c*x))^4) =\n      (fun x => (2*c^4)*x^4+(4*c^3*(2*(1-c)*p-1))*x^3+\n       (6*c^2*(((1-c)*p)^2+(1-(1-c)*p)^2))*x^2+\n       (4*c*(((1-c)*p)^3-(1-(1-c)*p)^3))*x+\n       (((1-c)*p)^4+(1-(1-c)*p)^4)) := by\n    funext x\n    ring\n  rw [hf, expect_quartic]\n  simp only [m1, m2, m3, m4, hw, r4]\n  ring\n\ndef uniformR4 (p B x : \u211d) := r4 p B (B*x) (B*x^2)\n\ntheorem uniform_fourth_strict (p B x y : \u211d) (hp : 0 < p) (hp1 : p < 1)\n    (hB : 0 < B) (hx : 0 < x) (hy : x < y) (hy1 : y \u2264 1) :\n    uniformR4 p B y < uniformR4 p B x := by\n  have ha : 0 < p*(1-p) := mul_pos hp (sub_pos.mpr hp1)\n  have hs : 0 < x+y := by linarith\n  have hs2 : x+y \u2264 2 := by linarith\n  have hd : 0 \u2264 (1-2*p)^2 := sq_nonneg _\n  have hn : (1-6*p*(1-p))*(x+y)-2*(1-2*p)^2 < 0 := by\n    by_cases h : 0 \u2264 1-6*p*(1-p)\n    \u00b7 have hh := mul_le_mul_of_nonneg_left hs2 h\n      nlinarith [sq_nonneg (1-2*p)]\n    \u00b7 have hh : (1-6*p*(1-p))*(x+y) < 0 := mul_neg_of_neg_of_pos (lt_of_not_ge h) hs\n      nlinarith\n  have hf : uniformR4 p B y-uniformR4 p B x =\n      2*p*(1-p)*B*(y-x)*((1-6*p*(1-p))*(x+y)-2*(1-2*p)^2) := by\n    unfold uniformR4 r4\n    ring\n  have hp1' : 0 < 1-p := sub_pos.mpr hp1\n  have hgap : 0 < y-x := sub_pos.mpr hy\n  have hpos : 0 < 2*p*(1-p)*B*(y-x) := by positivity\n  have := mul_neg_of_pos_of_neg hpos hn\n  linarith\n\ntheorem uniform_pair_fourth_injective (p B\u2081 B\u2082 x\u2081 x\u2082 : \u211d)\n    (hp : 0 < p) (hp1 : p < 1) (hB\u2081 : 0 < B\u2081) (hB\u2082 : 0 < B\u2082)\n    (hx\u2081 : 0 < x\u2081) (hx\u2082 : 0 < x\u2082) (hx\u20811 : x\u2081 \u2264 1) (hx\u20821 : x\u2082 \u2264 1)\n    (h2 : r2 p B\u2081 = r2 p B\u2082)\n    (h4 : uniformR4 p B\u2081 x\u2081 = uniformR4 p B\u2082 x\u2082) : B\u2081 = B\u2082 \u2227 x\u2081 = x\u2082 := by\n  have ha : 0 < p*(1-p) := mul_pos hp (sub_pos.mpr hp1)\n  have hB : B\u2081 = B\u2082 := by unfold r2 at h2; nlinarith\n  subst B\u2082\n  refine \u27e8rfl, ?_\u27e9\n  rcases lt_trichotomy x\u2081 x\u2082 with h|h|h\n  \u00b7 have := uniform_fourth_strict p B\u2081 x\u2081 x\u2082 hp hp1 hB\u2081 hx\u2081 h hx\u20821\n    linarith\n  \u00b7 exact h\n  \u00b7 have := uniform_fourth_strict p B\u2081 x\u2082 x\u2081 hp hp1 hB\u2081 hx\u2082 h hx\u20811\n    linarith\n\n-- Recovery is algebraic only after the explicitly uniform moment model has been justified.\ntheorem recover_uniform_parameters (B x c K : \u211d) (hx : x \u2260 0)\n    (hB : B = c*x) (hK : c = K*x) : c = B/x \u2227 K = B/x^2 := by\n  constructor\n  \u00b7 apply (eq_div_iff hx).mpr\n    nlinarith\n  \u00b7 apply (eq_div_iff (pow_ne_zero 2 hx)).mpr\n    nlinarith [hB, congrArg (fun t : \u211d => t*x) hK]\n\ntheorem uniform_cK_injective (p c\u2081 c\u2082 K\u2081 K\u2082 : \u211d)\n    (hp : 0 < p) (hp1 : p < 1) (hc\u2081 : 0 < c\u2081) (hc\u2082 : 0 < c\u2082)\n    (hc\u20811 : c\u2081 \u2264 1) (hc\u20821 : c\u2082 \u2264 1) (hK\u2081 : 1 \u2264 K\u2081) (hK\u2082 : 1 \u2264 K\u2082)\n    (h2 : r2 p (c\u2081^2/K\u2081) = r2 p (c\u2082^2/K\u2082))\n    (h4 : r4 p (c\u2081^2/K\u2081) (c\u2081^3/K\u2081^2) (c\u2081^4/K\u2081^3) =\n          r4 p (c\u2082^2/K\u2082) (c\u2082^3/K\u2082^2) (c\u2082^4/K\u2082^3)) : c\u2081 = c\u2082 \u2227 K\u2081 = K\u2082 := by\n  have hK\u20810 : 0 < K\u2081 := by linarith\n  have hK\u20820 : 0 < K\u2082 := by linarith\n  have hf (c K : \u211d) : r4 p (c^2/K) (c^3/K^2) (c^4/K^3) =\n      uniformR4 p (c^2/K) (c/K) := by simp only [uniformR4, r4]; ring\n  rw [hf, hf] at h4\n  have h := uniform_pair_fourth_injective p (c\u2081^2/K\u2081) (c\u2082^2/K\u2082) (c\u2081/K\u2081) (c\u2082/K\u2082)\n    hp hp1 (by positivity) (by positivity) (by positivity) (by positivity)\n    ((div_le_one hK\u20810).mpr (by linarith)) ((div_le_one hK\u20820).mpr (by linarith)) h2 h4\n  have rec (c K : \u211d) (hc : 0 < c) (hK : 0 < K) :\n      c = (c^2/K)/(c/K) \u2227 K = (c^2/K)/(c/K)^2 := by\n    have hb : c^2/K = c*(c/K) := by ring\n    have hk : c = K*(c/K) := by field_simp [ne_of_gt hK]\n    exact recover_uniform_parameters (c^2/K) (c/K) c K (ne_of_gt (div_pos hc hK)) hb hk\n  have h\u2081 := rec c\u2081 K\u2081 hc\u2081 hK\u20810\n  have h\u2082 := rec c\u2082 K\u2082 hc\u2082 hK\u20820\n  constructor\n  \u00b7 rw [h\u2081.1, h\u2082.1, h.1, h.2]\n  \u00b7 rw [h\u2081.2, h\u2082.2, h.1, h.2]\n\ndef weightsA : List \u211d := List.replicate 36 (1/42) ++ List.replicate 3 (1/21)\ndef weightsB : List \u211d := List.replicate 48 (1/96) ++ List.replicate 16 (1/32)\n\ntheorem nonuniform_normalized : weightsA.sum = 1 \u2227 weightsB.sum = 1 := by\n  norm_num [weightsA, weightsB, List.sum_replicate]\n\ntheorem nonuniform_power_collision :\n    (7/10:\u211d)^2*powers weightsA 2 = (4/5:\u211d)^2*powers weightsB 2 \u2227\n    (7/10:\u211d)^3*powers weightsA 3 = (4/5:\u211d)^3*powers weightsB 3 \u2227\n    (7/10:\u211d)^4*powers weightsA 4 = (4/5:\u211d)^4*powers weightsB 4 := by\n  norm_num [powers, weightsA, weightsB, List.sum_replicate]\n\ntheorem nonuniform_same_pair_fourth (p : \u211d) :\n    r2 p ((7/10)^2*powers weightsA 2) = r2 p ((4/5)^2*powers weightsB 2) \u2227\n    r4 p ((7/10)^2*powers weightsA 2) ((7/10)^3*powers weightsA 3) ((7/10)^4*powers weightsA 4) =\n    r4 p ((4/5)^2*powers weightsB 2) ((4/5)^3*powers weightsB 3) ((4/5)^4*powers weightsB 4) := by\n  obtain \u27e8h2,h3,h4\u27e9 := nonuniform_power_collision\n  exact \u27e8congrArg (r2 p) h2, by rw [h2,h3,h4]\u27e9\n\ntheorem nonuniform_distinct_parameters :\n    (7/10:\u211d) \u2260 4/5 \u2227 (1:\u211d)/powers weightsA 2 = 147/4 \u2227\n    (1:\u211d)/powers weightsB 2 = 48 := by\n  norm_num [powers, weightsA, weightsB, List.sum_replicate]\n\n-- Population expectations themselves coincide, not just invented summaries.\ntheorem nonuniform_actual_fourth_collision (p : \u211d) :\n    expect p weightsA (fun x => ((1-(7/10))*p+(7/10)*x)^4+(1-((1-(7/10))*p+(7/10)*x))^4) =\n    expect p weightsB (fun x => ((1-(4/5))*p+(4/5)*x)^4+(1-((1-(4/5))*p+(4/5)*x))^4) := by\n  rw [fourth_coincidence p (7/10) weightsA nonuniform_normalized.1,\n      fourth_coincidence p (4/5) weightsB nonuniform_normalized.2]\n  exact (nonuniform_same_pair_fourth p).2\n\n\ndef uniformWeights (n : \u2115) : List \u211d := List.replicate n (1/(n:\u211d))\n\ntheorem uniform_normalized (n : \u2115) (hn : 0 < n) : (uniformWeights n).sum = 1 := by\n  have hn0 : (n:\u211d) \u2260 0 := by exact_mod_cast (Nat.ne_of_gt hn)\n  simp [uniformWeights, List.sum_replicate, hn0]\n\ntheorem uniform_powers (n k : \u2115) : powers (uniformWeights n) k = (n:\u211d)*(1/(n:\u211d))^k := by\n  simp [powers, uniformWeights, List.sum_replicate]\n\ntheorem uniform_population_pair (p c : \u211d) (n : \u2115) (hn : 0 < n) :\n    expect p (uniformWeights n) (fun x => ((1-c)*p+c*x)^2+(1-((1-c)*p+c*x))^2) =\n    r2 p (c^2/(n:\u211d)) := by\n  rw [pair_coincidence p c (uniformWeights n) (uniform_normalized n hn)]\n  change p^2+(1-p)^2+2*c^2*p*(1-p)*powers (uniformWeights n) 2 = _\n  rw [uniform_powers]\n  unfold r2\n  have hn0 : (n:\u211d) \u2260 0 := by exact_mod_cast (Nat.ne_of_gt hn)\n  field_simp\n  ring\n\ntheorem uniform_population_fourth (p c : \u211d) (n : \u2115) (hn : 0 < n) :\n    expect p (uniformWeights n) (fun x => ((1-c)*p+c*x)^4+(1-((1-c)*p+c*x))^4) =\n    r4 p (c^2/(n:\u211d)) (c^3/(n:\u211d)^2) (c^4/(n:\u211d)^3) := by\n  rw [fourth_coincidence p c (uniformWeights n) (uniform_normalized n hn)]\n  rw [uniform_powers, uniform_powers, uniform_powers]\n  have hn0 : (n:\u211d) \u2260 0 := by exact_mod_cast (Nat.ne_of_gt hn)\n  congr 1 <;> field_simp <;> ring\n\n\ntheorem uniform_population_identification (p c\u2081 c\u2082 : \u211d) (n\u2081 n\u2082 : \u2115)\n    (hp : 0 < p) (hp1 : p < 1) (hc\u2081 : 0 < c\u2081) (hc\u2082 : 0 < c\u2082)\n    (hc\u20811 : c\u2081 \u2264 1) (hc\u20821 : c\u2082 \u2264 1) (hn\u2081 : 0 < n\u2081) (hn\u2082 : 0 < n\u2082)\n    (h2 : expect p (uniformWeights n\u2081) (fun x => ((1-c\u2081)*p+c\u2081*x)^2+(1-((1-c\u2081)*p+c\u2081*x))^2) =\n          expect p (uniformWeights n\u2082) (fun x => ((1-c\u2082)*p+c\u2082*x)^2+(1-((1-c\u2082)*p+c\u2082*x))^2))\n    (h4 : expect p (uniformWeights n\u2081) (fun x => ((1-c\u2081)*p+c\u2081*x)^4+(1-((1-c\u2081)*p+c\u2081*x))^4) =\n          expect p (uniformWeights n\u2082) (fun x => ((1-c\u2082)*p+c\u2082*x)^4+(1-((1-c\u2082)*p+c\u2082*x))^4)) :\n    c\u2081 = c\u2082 \u2227 n\u2081 = n\u2082 := by\n  rw [uniform_population_pair p c\u2081 n\u2081 hn\u2081, uniform_population_pair p c\u2082 n\u2082 hn\u2082] at h2\n  rw [uniform_population_fourth p c\u2081 n\u2081 hn\u2081, uniform_population_fourth p c\u2082 n\u2082 hn\u2082] at h4\n  have h := uniform_cK_injective p c\u2081 c\u2082 (n\u2081:\u211d) (n\u2082:\u211d) hp hp1 hc\u2081 hc\u2082 hc\u20811 hc\u20821\n    (by exact_mod_cast hn\u2081) (by exact_mod_cast hn\u2082) h2 h4\n  exact \u27e8h.1, by exact_mod_cast h.2\u27e9\n\ntheorem unknown_p_alias (p : \u211d) : r2 p 1 = 1 \u2227 r4 p 1 1 1 = 1 := by\n  constructor <;> simp only [r2, r4] <;> ring\n\ntheorem zero_c_alias (p : \u211d) : r2 p 0 = p^2+(1-p)^2 \u2227\n    r4 p 0 0 0 = p^4+(1-p)^4 := by\n  constructor <;> simp only [r2, r4] <;> ring\n\nend Obligations046.M0Identification\n\nopen Obligations046.M0Identification\nexample : (r2 (3/4) ((7/10)^2*powers weightsA 2) = r2 (3/4) ((4/5)^2*powers weightsB 2) \u2227\n r4 (3/4) ((7/10)^2*powers weightsA 2) ((7/10)^3*powers weightsA 3) ((7/10)^4*powers weightsA 4) =\n r4 (3/4) ((4/5)^2*powers weightsB 2) ((4/5)^3*powers weightsB 3) ((4/5)^4*powers weightsB 4)) \u2192 (7/10:\u211d) = 4/5 := by\n norm_num [r2,r4,powers,weightsA,weightsB,List.sum_replicate]\n",
+      "exitCode": 1,
+      "cause": [
+        "unsolved goals"
+      ]
+    },
+    "extraNegatives": [
+      {
+        "name": "unknown-p-as-known",
+        "source": "import Obligations045.M0Coincidence\nimport Mathlib.Tactic.Linarith\nimport Mathlib.Tactic.FieldSimp\nimport Mathlib.Tactic.Positivity\n\nnoncomputable section\nnamespace Obligations046.M0Identification\nopen Obligations045.M0Coincidence\n\ndef powers (ws : List \u211d) (k : \u2115) : \u211d := (ws.map (fun w => w^k)).sum\n\ndef m1 (p : \u211d) (ws : List \u211d) := p*ws.sum\ndef m2 (p : \u211d) (ws : List \u211d) := p^2*ws.sum^2+p*(1-p)*powers ws 2\ndef m3 (p : \u211d) (ws : List \u211d) := p^3*ws.sum^3+3*p^2*(1-p)*ws.sum*powers ws 2+p*(1-p)*(1-2*p)*powers ws 3\ndef m4 (p : \u211d) (ws : List \u211d) := p^4*ws.sum^4+6*p^3*(1-p)*ws.sum^2*powers ws 2+3*(p*(1-p))^2*(powers ws 2)^2+4*p^2*(1-p)*(1-2*p)*ws.sum*powers ws 3+p*(1-p)*(1-6*p*(1-p))*powers ws 4\n\ntheorem expect_quartic (p : \u211d) (ws : List \u211d) (a b d e f : \u211d) :\n    expect p ws (fun x => a*x^4+b*x^3+d*x^2+e*x+f) =\n    a*m4 p ws+b*m3 p ws+d*m2 p ws+e*m1 p ws+f := by\n  induction ws generalizing a b d e f with\n  | nil => simp [expect, m1, m2, m3, m4, powers]\n  | cons w ws ih =>\n    have hf : (fun x : \u211d => a*(w+x)^4+b*(w+x)^3+d*(w+x)^2+e*(w+x)+f) =\n        (fun x => a*x^4+(4*a*w+b)*x^3+(6*a*w^2+3*b*w+d)*x^2+\n          (4*a*w^3+3*b*w^2+2*d*w+e)*x+(a*w^4+b*w^3+d*w^2+e*w+f)) := by\n      funext x\n      ring\n    simp only [expect, hf]\n    rw [ih, ih]\n    simp only [m1, m2, m3, m4, List.sum_cons, powers, List.map_cons]\n    ring\n\ndef r2 (p B : \u211d) := p^2+(1-p)^2+2*p*(1-p)*B\ndef r4 (p B C E : \u211d) := p^4+(1-p)^4+6*(p^2+(1-p)^2)*p*(1-p)*B-\n    4*p*(1-p)*(1-2*p)^2*C+6*(p*(1-p))^2*B^2+2*p*(1-p)*(1-6*p*(1-p))*E\n\ntheorem fourth_coincidence (p c : \u211d) (ws : List \u211d) (hw : ws.sum = 1) :\n    expect p ws (fun x => ((1-c)*p+c*x)^4+(1-((1-c)*p+c*x))^4) =\n    r4 p (c^2*powers ws 2) (c^3*powers ws 3) (c^4*powers ws 4) := by\n  have hf : (fun x : \u211d => ((1-c)*p+c*x)^4+(1-((1-c)*p+c*x))^4) =\n      (fun x => (2*c^4)*x^4+(4*c^3*(2*(1-c)*p-1))*x^3+\n       (6*c^2*(((1-c)*p)^2+(1-(1-c)*p)^2))*x^2+\n       (4*c*(((1-c)*p)^3-(1-(1-c)*p)^3))*x+\n       (((1-c)*p)^4+(1-(1-c)*p)^4)) := by\n    funext x\n    ring\n  rw [hf, expect_quartic]\n  simp only [m1, m2, m3, m4, hw, r4]\n  ring\n\ndef uniformR4 (p B x : \u211d) := r4 p B (B*x) (B*x^2)\n\ntheorem uniform_fourth_strict (p B x y : \u211d) (hp : 0 < p) (hp1 : p < 1)\n    (hB : 0 < B) (hx : 0 < x) (hy : x < y) (hy1 : y \u2264 1) :\n    uniformR4 p B y < uniformR4 p B x := by\n  have ha : 0 < p*(1-p) := mul_pos hp (sub_pos.mpr hp1)\n  have hs : 0 < x+y := by linarith\n  have hs2 : x+y \u2264 2 := by linarith\n  have hd : 0 \u2264 (1-2*p)^2 := sq_nonneg _\n  have hn : (1-6*p*(1-p))*(x+y)-2*(1-2*p)^2 < 0 := by\n    by_cases h : 0 \u2264 1-6*p*(1-p)\n    \u00b7 have hh := mul_le_mul_of_nonneg_left hs2 h\n      nlinarith [sq_nonneg (1-2*p)]\n    \u00b7 have hh : (1-6*p*(1-p))*(x+y) < 0 := mul_neg_of_neg_of_pos (lt_of_not_ge h) hs\n      nlinarith\n  have hf : uniformR4 p B y-uniformR4 p B x =\n      2*p*(1-p)*B*(y-x)*((1-6*p*(1-p))*(x+y)-2*(1-2*p)^2) := by\n    unfold uniformR4 r4\n    ring\n  have hp1' : 0 < 1-p := sub_pos.mpr hp1\n  have hgap : 0 < y-x := sub_pos.mpr hy\n  have hpos : 0 < 2*p*(1-p)*B*(y-x) := by positivity\n  have := mul_neg_of_pos_of_neg hpos hn\n  linarith\n\ntheorem uniform_pair_fourth_injective (p B\u2081 B\u2082 x\u2081 x\u2082 : \u211d)\n    (hp : 0 < p) (hp1 : p < 1) (hB\u2081 : 0 < B\u2081) (hB\u2082 : 0 < B\u2082)\n    (hx\u2081 : 0 < x\u2081) (hx\u2082 : 0 < x\u2082) (hx\u20811 : x\u2081 \u2264 1) (hx\u20821 : x\u2082 \u2264 1)\n    (h2 : r2 p B\u2081 = r2 p B\u2082)\n    (h4 : uniformR4 p B\u2081 x\u2081 = uniformR4 p B\u2082 x\u2082) : B\u2081 = B\u2082 \u2227 x\u2081 = x\u2082 := by\n  have ha : 0 < p*(1-p) := mul_pos hp (sub_pos.mpr hp1)\n  have hB : B\u2081 = B\u2082 := by unfold r2 at h2; nlinarith\n  subst B\u2082\n  refine \u27e8rfl, ?_\u27e9\n  rcases lt_trichotomy x\u2081 x\u2082 with h|h|h\n  \u00b7 have := uniform_fourth_strict p B\u2081 x\u2081 x\u2082 hp hp1 hB\u2081 hx\u2081 h hx\u20821\n    linarith\n  \u00b7 exact h\n  \u00b7 have := uniform_fourth_strict p B\u2081 x\u2082 x\u2081 hp hp1 hB\u2081 hx\u2082 h hx\u20811\n    linarith\n\n-- Recovery is algebraic only after the explicitly uniform moment model has been justified.\ntheorem recover_uniform_parameters (B x c K : \u211d) (hx : x \u2260 0)\n    (hB : B = c*x) (hK : c = K*x) : c = B/x \u2227 K = B/x^2 := by\n  constructor\n  \u00b7 apply (eq_div_iff hx).mpr\n    nlinarith\n  \u00b7 apply (eq_div_iff (pow_ne_zero 2 hx)).mpr\n    nlinarith [hB, congrArg (fun t : \u211d => t*x) hK]\n\ntheorem uniform_cK_injective (p c\u2081 c\u2082 K\u2081 K\u2082 : \u211d)\n    (hp : 0 < p) (hp1 : p < 1) (hc\u2081 : 0 < c\u2081) (hc\u2082 : 0 < c\u2082)\n    (hc\u20811 : c\u2081 \u2264 1) (hc\u20821 : c\u2082 \u2264 1) (hK\u2081 : 1 \u2264 K\u2081) (hK\u2082 : 1 \u2264 K\u2082)\n    (h2 : r2 p (c\u2081^2/K\u2081) = r2 p (c\u2082^2/K\u2082))\n    (h4 : r4 p (c\u2081^2/K\u2081) (c\u2081^3/K\u2081^2) (c\u2081^4/K\u2081^3) =\n          r4 p (c\u2082^2/K\u2082) (c\u2082^3/K\u2082^2) (c\u2082^4/K\u2082^3)) : c\u2081 = c\u2082 \u2227 K\u2081 = K\u2082 := by\n  have hK\u20810 : 0 < K\u2081 := by linarith\n  have hK\u20820 : 0 < K\u2082 := by linarith\n  have hf (c K : \u211d) : r4 p (c^2/K) (c^3/K^2) (c^4/K^3) =\n      uniformR4 p (c^2/K) (c/K) := by simp only [uniformR4, r4]; ring\n  rw [hf, hf] at h4\n  have h := uniform_pair_fourth_injective p (c\u2081^2/K\u2081) (c\u2082^2/K\u2082) (c\u2081/K\u2081) (c\u2082/K\u2082)\n    hp hp1 (by positivity) (by positivity) (by positivity) (by positivity)\n    ((div_le_one hK\u20810).mpr (by linarith)) ((div_le_one hK\u20820).mpr (by linarith)) h2 h4\n  have rec (c K : \u211d) (hc : 0 < c) (hK : 0 < K) :\n      c = (c^2/K)/(c/K) \u2227 K = (c^2/K)/(c/K)^2 := by\n    have hb : c^2/K = c*(c/K) := by ring\n    have hk : c = K*(c/K) := by field_simp [ne_of_gt hK]\n    exact recover_uniform_parameters (c^2/K) (c/K) c K (ne_of_gt (div_pos hc hK)) hb hk\n  have h\u2081 := rec c\u2081 K\u2081 hc\u2081 hK\u20810\n  have h\u2082 := rec c\u2082 K\u2082 hc\u2082 hK\u20820\n  constructor\n  \u00b7 rw [h\u2081.1, h\u2082.1, h.1, h.2]\n  \u00b7 rw [h\u2081.2, h\u2082.2, h.1, h.2]\n\ndef weightsA : List \u211d := List.replicate 36 (1/42) ++ List.replicate 3 (1/21)\ndef weightsB : List \u211d := List.replicate 48 (1/96) ++ List.replicate 16 (1/32)\n\ntheorem nonuniform_normalized : weightsA.sum = 1 \u2227 weightsB.sum = 1 := by\n  norm_num [weightsA, weightsB, List.sum_replicate]\n\ntheorem nonuniform_power_collision :\n    (7/10:\u211d)^2*powers weightsA 2 = (4/5:\u211d)^2*powers weightsB 2 \u2227\n    (7/10:\u211d)^3*powers weightsA 3 = (4/5:\u211d)^3*powers weightsB 3 \u2227\n    (7/10:\u211d)^4*powers weightsA 4 = (4/5:\u211d)^4*powers weightsB 4 := by\n  norm_num [powers, weightsA, weightsB, List.sum_replicate]\n\ntheorem nonuniform_same_pair_fourth (p : \u211d) :\n    r2 p ((7/10)^2*powers weightsA 2) = r2 p ((4/5)^2*powers weightsB 2) \u2227\n    r4 p ((7/10)^2*powers weightsA 2) ((7/10)^3*powers weightsA 3) ((7/10)^4*powers weightsA 4) =\n    r4 p ((4/5)^2*powers weightsB 2) ((4/5)^3*powers weightsB 3) ((4/5)^4*powers weightsB 4) := by\n  obtain \u27e8h2,h3,h4\u27e9 := nonuniform_power_collision\n  exact \u27e8congrArg (r2 p) h2, by rw [h2,h3,h4]\u27e9\n\ntheorem nonuniform_distinct_parameters :\n    (7/10:\u211d) \u2260 4/5 \u2227 (1:\u211d)/powers weightsA 2 = 147/4 \u2227\n    (1:\u211d)/powers weightsB 2 = 48 := by\n  norm_num [powers, weightsA, weightsB, List.sum_replicate]\n\n-- Population expectations themselves coincide, not just invented summaries.\ntheorem nonuniform_actual_fourth_collision (p : \u211d) :\n    expect p weightsA (fun x => ((1-(7/10))*p+(7/10)*x)^4+(1-((1-(7/10))*p+(7/10)*x))^4) =\n    expect p weightsB (fun x => ((1-(4/5))*p+(4/5)*x)^4+(1-((1-(4/5))*p+(4/5)*x))^4) := by\n  rw [fourth_coincidence p (7/10) weightsA nonuniform_normalized.1,\n      fourth_coincidence p (4/5) weightsB nonuniform_normalized.2]\n  exact (nonuniform_same_pair_fourth p).2\n\n\ndef uniformWeights (n : \u2115) : List \u211d := List.replicate n (1/(n:\u211d))\n\ntheorem uniform_normalized (n : \u2115) (hn : 0 < n) : (uniformWeights n).sum = 1 := by\n  have hn0 : (n:\u211d) \u2260 0 := by exact_mod_cast (Nat.ne_of_gt hn)\n  simp [uniformWeights, List.sum_replicate, hn0]\n\ntheorem uniform_powers (n k : \u2115) : powers (uniformWeights n) k = (n:\u211d)*(1/(n:\u211d))^k := by\n  simp [powers, uniformWeights, List.sum_replicate]\n\ntheorem uniform_population_pair (p c : \u211d) (n : \u2115) (hn : 0 < n) :\n    expect p (uniformWeights n) (fun x => ((1-c)*p+c*x)^2+(1-((1-c)*p+c*x))^2) =\n    r2 p (c^2/(n:\u211d)) := by\n  rw [pair_coincidence p c (uniformWeights n) (uniform_normalized n hn)]\n  change p^2+(1-p)^2+2*c^2*p*(1-p)*powers (uniformWeights n) 2 = _\n  rw [uniform_powers]\n  unfold r2\n  have hn0 : (n:\u211d) \u2260 0 := by exact_mod_cast (Nat.ne_of_gt hn)\n  field_simp\n  ring\n\ntheorem uniform_population_fourth (p c : \u211d) (n : \u2115) (hn : 0 < n) :\n    expect p (uniformWeights n) (fun x => ((1-c)*p+c*x)^4+(1-((1-c)*p+c*x))^4) =\n    r4 p (c^2/(n:\u211d)) (c^3/(n:\u211d)^2) (c^4/(n:\u211d)^3) := by\n  rw [fourth_coincidence p c (uniformWeights n) (uniform_normalized n hn)]\n  rw [uniform_powers, uniform_powers, uniform_powers]\n  have hn0 : (n:\u211d) \u2260 0 := by exact_mod_cast (Nat.ne_of_gt hn)\n  congr 1 <;> field_simp <;> ring\n\n\ntheorem uniform_population_identification (p c\u2081 c\u2082 : \u211d) (n\u2081 n\u2082 : \u2115)\n    (hp : 0 < p) (hp1 : p < 1) (hc\u2081 : 0 < c\u2081) (hc\u2082 : 0 < c\u2082)\n    (hc\u20811 : c\u2081 \u2264 1) (hc\u20821 : c\u2082 \u2264 1) (hn\u2081 : 0 < n\u2081) (hn\u2082 : 0 < n\u2082)\n    (h2 : expect p (uniformWeights n\u2081) (fun x => ((1-c\u2081)*p+c\u2081*x)^2+(1-((1-c\u2081)*p+c\u2081*x))^2) =\n          expect p (uniformWeights n\u2082) (fun x => ((1-c\u2082)*p+c\u2082*x)^2+(1-((1-c\u2082)*p+c\u2082*x))^2))\n    (h4 : expect p (uniformWeights n\u2081) (fun x => ((1-c\u2081)*p+c\u2081*x)^4+(1-((1-c\u2081)*p+c\u2081*x))^4) =\n          expect p (uniformWeights n\u2082) (fun x => ((1-c\u2082)*p+c\u2082*x)^4+(1-((1-c\u2082)*p+c\u2082*x))^4)) :\n    c\u2081 = c\u2082 \u2227 n\u2081 = n\u2082 := by\n  rw [uniform_population_pair p c\u2081 n\u2081 hn\u2081, uniform_population_pair p c\u2082 n\u2082 hn\u2082] at h2\n  rw [uniform_population_fourth p c\u2081 n\u2081 hn\u2081, uniform_population_fourth p c\u2082 n\u2082 hn\u2082] at h4\n  have h := uniform_cK_injective p c\u2081 c\u2082 (n\u2081:\u211d) (n\u2082:\u211d) hp hp1 hc\u2081 hc\u2082 hc\u20811 hc\u20821\n    (by exact_mod_cast hn\u2081) (by exact_mod_cast hn\u2082) h2 h4\n  exact \u27e8h.1, by exact_mod_cast h.2\u27e9\n\ntheorem unknown_p_alias (p : \u211d) : r2 p 1 = 1 \u2227 r4 p 1 1 1 = 1 := by\n  constructor <;> simp only [r2, r4] <;> ring\n\ntheorem zero_c_alias (p : \u211d) : r2 p 0 = p^2+(1-p)^2 \u2227\n    r4 p 0 0 0 = p^4+(1-p)^4 := by\n  constructor <;> simp only [r2, r4] <;> ring\n\nend Obligations046.M0Identification\n\nopen Obligations046.M0Identification\nexample : (r2 (2/3) 1 = r2 (3/4) 1 \u2227 r4 (2/3) 1 1 1 = r4 (3/4) 1 1 1) \u2192 (2/3:\u211d) = 3/4 := by\n norm_num [r2,r4]\n",
+        "exitCode": 1,
+        "cause": [
+          "unsolved goals"
+        ]
+      },
+      {
+        "name": "zero-c-as-identifiable",
+        "source": "import Obligations045.M0Coincidence\nimport Mathlib.Tactic.Linarith\nimport Mathlib.Tactic.FieldSimp\nimport Mathlib.Tactic.Positivity\n\nnoncomputable section\nnamespace Obligations046.M0Identification\nopen Obligations045.M0Coincidence\n\ndef powers (ws : List \u211d) (k : \u2115) : \u211d := (ws.map (fun w => w^k)).sum\n\ndef m1 (p : \u211d) (ws : List \u211d) := p*ws.sum\ndef m2 (p : \u211d) (ws : List \u211d) := p^2*ws.sum^2+p*(1-p)*powers ws 2\ndef m3 (p : \u211d) (ws : List \u211d) := p^3*ws.sum^3+3*p^2*(1-p)*ws.sum*powers ws 2+p*(1-p)*(1-2*p)*powers ws 3\ndef m4 (p : \u211d) (ws : List \u211d) := p^4*ws.sum^4+6*p^3*(1-p)*ws.sum^2*powers ws 2+3*(p*(1-p))^2*(powers ws 2)^2+4*p^2*(1-p)*(1-2*p)*ws.sum*powers ws 3+p*(1-p)*(1-6*p*(1-p))*powers ws 4\n\ntheorem expect_quartic (p : \u211d) (ws : List \u211d) (a b d e f : \u211d) :\n    expect p ws (fun x => a*x^4+b*x^3+d*x^2+e*x+f) =\n    a*m4 p ws+b*m3 p ws+d*m2 p ws+e*m1 p ws+f := by\n  induction ws generalizing a b d e f with\n  | nil => simp [expect, m1, m2, m3, m4, powers]\n  | cons w ws ih =>\n    have hf : (fun x : \u211d => a*(w+x)^4+b*(w+x)^3+d*(w+x)^2+e*(w+x)+f) =\n        (fun x => a*x^4+(4*a*w+b)*x^3+(6*a*w^2+3*b*w+d)*x^2+\n          (4*a*w^3+3*b*w^2+2*d*w+e)*x+(a*w^4+b*w^3+d*w^2+e*w+f)) := by\n      funext x\n      ring\n    simp only [expect, hf]\n    rw [ih, ih]\n    simp only [m1, m2, m3, m4, List.sum_cons, powers, List.map_cons]\n    ring\n\ndef r2 (p B : \u211d) := p^2+(1-p)^2+2*p*(1-p)*B\ndef r4 (p B C E : \u211d) := p^4+(1-p)^4+6*(p^2+(1-p)^2)*p*(1-p)*B-\n    4*p*(1-p)*(1-2*p)^2*C+6*(p*(1-p))^2*B^2+2*p*(1-p)*(1-6*p*(1-p))*E\n\ntheorem fourth_coincidence (p c : \u211d) (ws : List \u211d) (hw : ws.sum = 1) :\n    expect p ws (fun x => ((1-c)*p+c*x)^4+(1-((1-c)*p+c*x))^4) =\n    r4 p (c^2*powers ws 2) (c^3*powers ws 3) (c^4*powers ws 4) := by\n  have hf : (fun x : \u211d => ((1-c)*p+c*x)^4+(1-((1-c)*p+c*x))^4) =\n      (fun x => (2*c^4)*x^4+(4*c^3*(2*(1-c)*p-1))*x^3+\n       (6*c^2*(((1-c)*p)^2+(1-(1-c)*p)^2))*x^2+\n       (4*c*(((1-c)*p)^3-(1-(1-c)*p)^3))*x+\n       (((1-c)*p)^4+(1-(1-c)*p)^4)) := by\n    funext x\n    ring\n  rw [hf, expect_quartic]\n  simp only [m1, m2, m3, m4, hw, r4]\n  ring\n\ndef uniformR4 (p B x : \u211d) := r4 p B (B*x) (B*x^2)\n\ntheorem uniform_fourth_strict (p B x y : \u211d) (hp : 0 < p) (hp1 : p < 1)\n    (hB : 0 < B) (hx : 0 < x) (hy : x < y) (hy1 : y \u2264 1) :\n    uniformR4 p B y < uniformR4 p B x := by\n  have ha : 0 < p*(1-p) := mul_pos hp (sub_pos.mpr hp1)\n  have hs : 0 < x+y := by linarith\n  have hs2 : x+y \u2264 2 := by linarith\n  have hd : 0 \u2264 (1-2*p)^2 := sq_nonneg _\n  have hn : (1-6*p*(1-p))*(x+y)-2*(1-2*p)^2 < 0 := by\n    by_cases h : 0 \u2264 1-6*p*(1-p)\n    \u00b7 have hh := mul_le_mul_of_nonneg_left hs2 h\n      nlinarith [sq_nonneg (1-2*p)]\n    \u00b7 have hh : (1-6*p*(1-p))*(x+y) < 0 := mul_neg_of_neg_of_pos (lt_of_not_ge h) hs\n      nlinarith\n  have hf : uniformR4 p B y-uniformR4 p B x =\n      2*p*(1-p)*B*(y-x)*((1-6*p*(1-p))*(x+y)-2*(1-2*p)^2) := by\n    unfold uniformR4 r4\n    ring\n  have hp1' : 0 < 1-p := sub_pos.mpr hp1\n  have hgap : 0 < y-x := sub_pos.mpr hy\n  have hpos : 0 < 2*p*(1-p)*B*(y-x) := by positivity\n  have := mul_neg_of_pos_of_neg hpos hn\n  linarith\n\ntheorem uniform_pair_fourth_injective (p B\u2081 B\u2082 x\u2081 x\u2082 : \u211d)\n    (hp : 0 < p) (hp1 : p < 1) (hB\u2081 : 0 < B\u2081) (hB\u2082 : 0 < B\u2082)\n    (hx\u2081 : 0 < x\u2081) (hx\u2082 : 0 < x\u2082) (hx\u20811 : x\u2081 \u2264 1) (hx\u20821 : x\u2082 \u2264 1)\n    (h2 : r2 p B\u2081 = r2 p B\u2082)\n    (h4 : uniformR4 p B\u2081 x\u2081 = uniformR4 p B\u2082 x\u2082) : B\u2081 = B\u2082 \u2227 x\u2081 = x\u2082 := by\n  have ha : 0 < p*(1-p) := mul_pos hp (sub_pos.mpr hp1)\n  have hB : B\u2081 = B\u2082 := by unfold r2 at h2; nlinarith\n  subst B\u2082\n  refine \u27e8rfl, ?_\u27e9\n  rcases lt_trichotomy x\u2081 x\u2082 with h|h|h\n  \u00b7 have := uniform_fourth_strict p B\u2081 x\u2081 x\u2082 hp hp1 hB\u2081 hx\u2081 h hx\u20821\n    linarith\n  \u00b7 exact h\n  \u00b7 have := uniform_fourth_strict p B\u2081 x\u2082 x\u2081 hp hp1 hB\u2081 hx\u2082 h hx\u20811\n    linarith\n\n-- Recovery is algebraic only after the explicitly uniform moment model has been justified.\ntheorem recover_uniform_parameters (B x c K : \u211d) (hx : x \u2260 0)\n    (hB : B = c*x) (hK : c = K*x) : c = B/x \u2227 K = B/x^2 := by\n  constructor\n  \u00b7 apply (eq_div_iff hx).mpr\n    nlinarith\n  \u00b7 apply (eq_div_iff (pow_ne_zero 2 hx)).mpr\n    nlinarith [hB, congrArg (fun t : \u211d => t*x) hK]\n\ntheorem uniform_cK_injective (p c\u2081 c\u2082 K\u2081 K\u2082 : \u211d)\n    (hp : 0 < p) (hp1 : p < 1) (hc\u2081 : 0 < c\u2081) (hc\u2082 : 0 < c\u2082)\n    (hc\u20811 : c\u2081 \u2264 1) (hc\u20821 : c\u2082 \u2264 1) (hK\u2081 : 1 \u2264 K\u2081) (hK\u2082 : 1 \u2264 K\u2082)\n    (h2 : r2 p (c\u2081^2/K\u2081) = r2 p (c\u2082^2/K\u2082))\n    (h4 : r4 p (c\u2081^2/K\u2081) (c\u2081^3/K\u2081^2) (c\u2081^4/K\u2081^3) =\n          r4 p (c\u2082^2/K\u2082) (c\u2082^3/K\u2082^2) (c\u2082^4/K\u2082^3)) : c\u2081 = c\u2082 \u2227 K\u2081 = K\u2082 := by\n  have hK\u20810 : 0 < K\u2081 := by linarith\n  have hK\u20820 : 0 < K\u2082 := by linarith\n  have hf (c K : \u211d) : r4 p (c^2/K) (c^3/K^2) (c^4/K^3) =\n      uniformR4 p (c^2/K) (c/K) := by simp only [uniformR4, r4]; ring\n  rw [hf, hf] at h4\n  have h := uniform_pair_fourth_injective p (c\u2081^2/K\u2081) (c\u2082^2/K\u2082) (c\u2081/K\u2081) (c\u2082/K\u2082)\n    hp hp1 (by positivity) (by positivity) (by positivity) (by positivity)\n    ((div_le_one hK\u20810).mpr (by linarith)) ((div_le_one hK\u20820).mpr (by linarith)) h2 h4\n  have rec (c K : \u211d) (hc : 0 < c) (hK : 0 < K) :\n      c = (c^2/K)/(c/K) \u2227 K = (c^2/K)/(c/K)^2 := by\n    have hb : c^2/K = c*(c/K) := by ring\n    have hk : c = K*(c/K) := by field_simp [ne_of_gt hK]\n    exact recover_uniform_parameters (c^2/K) (c/K) c K (ne_of_gt (div_pos hc hK)) hb hk\n  have h\u2081 := rec c\u2081 K\u2081 hc\u2081 hK\u20810\n  have h\u2082 := rec c\u2082 K\u2082 hc\u2082 hK\u20820\n  constructor\n  \u00b7 rw [h\u2081.1, h\u2082.1, h.1, h.2]\n  \u00b7 rw [h\u2081.2, h\u2082.2, h.1, h.2]\n\ndef weightsA : List \u211d := List.replicate 36 (1/42) ++ List.replicate 3 (1/21)\ndef weightsB : List \u211d := List.replicate 48 (1/96) ++ List.replicate 16 (1/32)\n\ntheorem nonuniform_normalized : weightsA.sum = 1 \u2227 weightsB.sum = 1 := by\n  norm_num [weightsA, weightsB, List.sum_replicate]\n\ntheorem nonuniform_power_collision :\n    (7/10:\u211d)^2*powers weightsA 2 = (4/5:\u211d)^2*powers weightsB 2 \u2227\n    (7/10:\u211d)^3*powers weightsA 3 = (4/5:\u211d)^3*powers weightsB 3 \u2227\n    (7/10:\u211d)^4*powers weightsA 4 = (4/5:\u211d)^4*powers weightsB 4 := by\n  norm_num [powers, weightsA, weightsB, List.sum_replicate]\n\ntheorem nonuniform_same_pair_fourth (p : \u211d) :\n    r2 p ((7/10)^2*powers weightsA 2) = r2 p ((4/5)^2*powers weightsB 2) \u2227\n    r4 p ((7/10)^2*powers weightsA 2) ((7/10)^3*powers weightsA 3) ((7/10)^4*powers weightsA 4) =\n    r4 p ((4/5)^2*powers weightsB 2) ((4/5)^3*powers weightsB 3) ((4/5)^4*powers weightsB 4) := by\n  obtain \u27e8h2,h3,h4\u27e9 := nonuniform_power_collision\n  exact \u27e8congrArg (r2 p) h2, by rw [h2,h3,h4]\u27e9\n\ntheorem nonuniform_distinct_parameters :\n    (7/10:\u211d) \u2260 4/5 \u2227 (1:\u211d)/powers weightsA 2 = 147/4 \u2227\n    (1:\u211d)/powers weightsB 2 = 48 := by\n  norm_num [powers, weightsA, weightsB, List.sum_replicate]\n\n-- Population expectations themselves coincide, not just invented summaries.\ntheorem nonuniform_actual_fourth_collision (p : \u211d) :\n    expect p weightsA (fun x => ((1-(7/10))*p+(7/10)*x)^4+(1-((1-(7/10))*p+(7/10)*x))^4) =\n    expect p weightsB (fun x => ((1-(4/5))*p+(4/5)*x)^4+(1-((1-(4/5))*p+(4/5)*x))^4) := by\n  rw [fourth_coincidence p (7/10) weightsA nonuniform_normalized.1,\n      fourth_coincidence p (4/5) weightsB nonuniform_normalized.2]\n  exact (nonuniform_same_pair_fourth p).2\n\n\ndef uniformWeights (n : \u2115) : List \u211d := List.replicate n (1/(n:\u211d))\n\ntheorem uniform_normalized (n : \u2115) (hn : 0 < n) : (uniformWeights n).sum = 1 := by\n  have hn0 : (n:\u211d) \u2260 0 := by exact_mod_cast (Nat.ne_of_gt hn)\n  simp [uniformWeights, List.sum_replicate, hn0]\n\ntheorem uniform_powers (n k : \u2115) : powers (uniformWeights n) k = (n:\u211d)*(1/(n:\u211d))^k := by\n  simp [powers, uniformWeights, List.sum_replicate]\n\ntheorem uniform_population_pair (p c : \u211d) (n : \u2115) (hn : 0 < n) :\n    expect p (uniformWeights n) (fun x => ((1-c)*p+c*x)^2+(1-((1-c)*p+c*x))^2) =\n    r2 p (c^2/(n:\u211d)) := by\n  rw [pair_coincidence p c (uniformWeights n) (uniform_normalized n hn)]\n  change p^2+(1-p)^2+2*c^2*p*(1-p)*powers (uniformWeights n) 2 = _\n  rw [uniform_powers]\n  unfold r2\n  have hn0 : (n:\u211d) \u2260 0 := by exact_mod_cast (Nat.ne_of_gt hn)\n  field_simp\n  ring\n\ntheorem uniform_population_fourth (p c : \u211d) (n : \u2115) (hn : 0 < n) :\n    expect p (uniformWeights n) (fun x => ((1-c)*p+c*x)^4+(1-((1-c)*p+c*x))^4) =\n    r4 p (c^2/(n:\u211d)) (c^3/(n:\u211d)^2) (c^4/(n:\u211d)^3) := by\n  rw [fourth_coincidence p c (uniformWeights n) (uniform_normalized n hn)]\n  rw [uniform_powers, uniform_powers, uniform_powers]\n  have hn0 : (n:\u211d) \u2260 0 := by exact_mod_cast (Nat.ne_of_gt hn)\n  congr 1 <;> field_simp <;> ring\n\n\ntheorem uniform_population_identification (p c\u2081 c\u2082 : \u211d) (n\u2081 n\u2082 : \u2115)\n    (hp : 0 < p) (hp1 : p < 1) (hc\u2081 : 0 < c\u2081) (hc\u2082 : 0 < c\u2082)\n    (hc\u20811 : c\u2081 \u2264 1) (hc\u20821 : c\u2082 \u2264 1) (hn\u2081 : 0 < n\u2081) (hn\u2082 : 0 < n\u2082)\n    (h2 : expect p (uniformWeights n\u2081) (fun x => ((1-c\u2081)*p+c\u2081*x)^2+(1-((1-c\u2081)*p+c\u2081*x))^2) =\n          expect p (uniformWeights n\u2082) (fun x => ((1-c\u2082)*p+c\u2082*x)^2+(1-((1-c\u2082)*p+c\u2082*x))^2))\n    (h4 : expect p (uniformWeights n\u2081) (fun x => ((1-c\u2081)*p+c\u2081*x)^4+(1-((1-c\u2081)*p+c\u2081*x))^4) =\n          expect p (uniformWeights n\u2082) (fun x => ((1-c\u2082)*p+c\u2082*x)^4+(1-((1-c\u2082)*p+c\u2082*x))^4)) :\n    c\u2081 = c\u2082 \u2227 n\u2081 = n\u2082 := by\n  rw [uniform_population_pair p c\u2081 n\u2081 hn\u2081, uniform_population_pair p c\u2082 n\u2082 hn\u2082] at h2\n  rw [uniform_population_fourth p c\u2081 n\u2081 hn\u2081, uniform_population_fourth p c\u2082 n\u2082 hn\u2082] at h4\n  have h := uniform_cK_injective p c\u2081 c\u2082 (n\u2081:\u211d) (n\u2082:\u211d) hp hp1 hc\u2081 hc\u2082 hc\u20811 hc\u20821\n    (by exact_mod_cast hn\u2081) (by exact_mod_cast hn\u2082) h2 h4\n  exact \u27e8h.1, by exact_mod_cast h.2\u27e9\n\ntheorem unknown_p_alias (p : \u211d) : r2 p 1 = 1 \u2227 r4 p 1 1 1 = 1 := by\n  constructor <;> simp only [r2, r4] <;> ring\n\ntheorem zero_c_alias (p : \u211d) : r2 p 0 = p^2+(1-p)^2 \u2227\n    r4 p 0 0 0 = p^4+(1-p)^4 := by\n  constructor <;> simp only [r2, r4] <;> ring\n\nend Obligations046.M0Identification\n\nopen Obligations046.M0Identification\nexample : (r2 (3/4) 0 = r2 (3/4) 0 \u2227 r4 (3/4) 0 0 0 = r4 (3/4) 0 0 0) \u2192 (2:\u211d) = 3 := by\n norm_num [r2,r4]\n",
+        "exitCode": 1,
+        "cause": [
+          "unsolved goals"
+        ]
+      }
+    ]
+  }
+}