diff --git a/docs/ci-verification.md b/docs/ci-verification.md index 63ba3e9aa8..52b62d0481 100644 --- a/docs/ci-verification.md +++ b/docs/ci-verification.md @@ -1,8 +1,25 @@ # CI verification -## Current selected-family replay: #6030 +## Current selected-family replay: #7000 with #7001 The [selected record](../certificates/selected-result.json) binds conditional +κ = 0.00363005817 to the [application review](research/pr-intake-evidence/pr7000-application/PROOF-REVIEW.md), +[validation receipts](research/pr-intake-evidence/pr7000-application/VALIDATION.json), +and [explicit source closure](../certificates/frontier7000-source.json). +`make frontier7000-verify` follows that exact-source selected replay. The review +reuses eleven authenticated preceding executions and records seven fresh serial +application, scalar and complete native-catalogue executions. The earlier +monolithic timeout is retained separately and is not completed coverage. +Consult the receipts for exact commands, source heads and limits. + +The five inherited framework assumptions remain. No complete uniform word, +literal multiplier execution, independent human proof or formal-kernel proof +is asserted. Routine research submissions do not need to rerun this +selected-family replay. The sections below preserve historical checkpoints. + +## Historical selected-family replay: #6030 + +The [historical checkpoint](../certificates/checkpoints/frontier6030.json) binds conditional κ = 0.003125804 to the [proof review](research/pr-intake-evidence/pr6030-audit/PROOF-REVIEW.md), [validation receipts](research/pr-intake-evidence/pr6030-audit/VALIDATION.json), and [explicit source closure](../certificates/frontier6030-source.json). diff --git a/research/historical-selected-replay-gap/README.md b/research/historical-selected-replay-gap/README.md index 55d8cc3b49..36d9a873ca 100644 --- a/research/historical-selected-replay-gap/README.md +++ b/research/historical-selected-replay-gap/README.md @@ -69,7 +69,11 @@ python3 -B scripts/research_package.py --package research/historical-selected-re The direct command prints `PASS_HISTORICAL_SELECTED_REPLAY_GAP`. A registered replay prints `PASS_REGISTERED_RESEARCH_PACKAGE`. Both require Git history -containing the two inspected commits. +containing the two inspected commits and the source and manifest objects at +`2485805a6d47f36ea83ddde6327d453ac82d44dc`. The verifier uses a temporary +sparse checkout of that commit, checks the declared source digests there, and +uses its planner and manifest inventory. The recorded rejections and selection +therefore remain reproducible after later changes to the live Makefile or CI guide. ## Open next questions diff --git a/research/historical-selected-replay-gap/SOURCES.json b/research/historical-selected-replay-gap/SOURCES.json index c1010eec95..62bb8b3950 100644 --- a/research/historical-selected-replay-gap/SOURCES.json +++ b/research/historical-selected-replay-gap/SOURCES.json @@ -4,13 +4,13 @@ "files": [ { "path": "Makefile", - "usage": "input", + "usage": "provenance", "git_blob": "0d683a06b9e7ee162496108ce9a7c5d2ee94fccf", "sha256": "4f2d4f2dcd15139ec82658a975f85ed300897385f85799218539f4c8d60567da" }, { "path": "certificates/partial-swap-network.json", - "usage": "input", + "usage": "provenance", "git_blob": "eccafa830c16170c36faf93045ddf1f638f7bcd4", "sha256": "4c0b9d37e1034b2076e30a70f8e514416298c462d9ee98bc87fe6556b14df786" }, @@ -22,7 +22,7 @@ }, { "path": "docs/ci-verification.md", - "usage": "input", + "usage": "provenance", "git_blob": "63ba3e9aa8bdc5e942b56e34244b92b16f854085", "sha256": "c7d3027e9ad8bcbff68f07aa9576b30fb2f3c76c44d876d40c7fdbf4a3e2228a" }, @@ -34,163 +34,163 @@ }, { "path": "research/clifford-state-performance/SOURCE.json", - "usage": "input", + "usage": "provenance", "git_blob": "6f98a0061a5104dfab82c9e806f819b41811f684", "sha256": "396d0f08df24952248140d5c65c51b8c902ef1c580892ff7ea182890530f67ee" }, { "path": "research/community-batch1047-audit/CONTENT-COVERAGE.json", - "usage": "input", + "usage": "provenance", "git_blob": "5e0f92af463ec12c5e1dcc3effd44081a88af647", "sha256": "07a9daeaf2bda308a92e9a4684f13d5fc766c7772d74801fceb7f4599fdab226" }, { "path": "research/community-batch1099-audit/CONTENT-COVERAGE.json", - "usage": "input", + "usage": "provenance", "git_blob": "9e13266bf85e627f1b7dc225e9530ea69fd2c7f0", "sha256": "421e1211fb1897c45621dc6801c276e53f2e6f335583c9c9049e535f87c0a3b1" }, { "path": "research/community-batch932-audit/CONTENT-COVERAGE.json", - "usage": "input", + "usage": "provenance", "git_blob": "cc4d03eb59b9ab3f952735f7e88ff18c2d15d7af", "sha256": "184629cac91a5cfaca50330a88596008b824221433867dcf8117539c913c284a" }, { "path": "research/community-batch970-audit/CONTENT-COVERAGE.json", - "usage": "input", + "usage": "provenance", "git_blob": "8b9f4111badf7de5d97684799560b55110e9da79", "sha256": "23188ed920e38a54006cb883e181585620821c63bf7e8b5e05d32719417cc37e" }, { "path": "research/community-frontier741-audit/CONTENT-COVERAGE.json", - "usage": "input", + "usage": "provenance", "git_blob": "a5300d4e7a5381a3f443fc54c768ca6f0f236d68", "sha256": "3c820fb30e1b4d9bcfc6a7ab524375e5b2abd66b940af2c509146104f0bcd79c" }, { "path": "research/community-frontier890-audit/CONTENT-COVERAGE.json", - "usage": "input", + "usage": "provenance", "git_blob": "d7ff6d777b01d69b6ce84caf25d3b7e4a4d2f211", "sha256": "6b185a9902652f893f3ebd8ada92d2f11b6de6533a9a4d11718a8a4496101128" }, { "path": "research/community-hyperplane599-audit/SOURCE.json", - "usage": "input", + "usage": "provenance", "git_blob": "546f37d326d10a99910ae8f908e71ef768524d98", "sha256": "65099d764bfcc39bda5e4d9966783611b094c3522dbdd1435cd498d657a8ef8e" }, { "path": "research/community-k492-audit/SOURCE.json", - "usage": "input", + "usage": "provenance", "git_blob": "e538481e4cb16ed936d3195f2dfb5b5a9ca0a76b", "sha256": "2c0f4fa5bc150d05658af2e7c54c4d2c337dd52b7efd3d69530ae73bcbdf452a" }, { "path": "research/community-reconciliation92-audit/MANIFEST.json", - "usage": "input", + "usage": "provenance", "git_blob": "2a2e93685173d5f13cbb5abe740f5d90352e0228", "sha256": "5f501f3c118131e7d069f30ad77186eb2ad6961f9680a0ef105f4514ed41808a" }, { "path": "research/partial-swap-digest/baseline.py", - "usage": "input", + "usage": "provenance", "git_blob": "a2f0190704db83bd8ef48e46e723c49b925804fe", "sha256": "81e9af92cdf38243a540cdcff2062778e449467848d444da37a9553c12ca4c34" }, { "path": "research/r420-two-sided-basis/SOURCES.json", - "usage": "input", + "usage": "provenance", "git_blob": "5d718e11e62f4bcadecf1e02d6b61f87dbe190b0", "sha256": "d9810b0d139c5a1211fd2c1f0d142187cc1fca30026e1e7bc4f9ecfacf1596d1" }, { "path": "research/skip-clones/SOURCE.json", - "usage": "input", + "usage": "provenance", "git_blob": "8d1bb3b9c8189e35e5d8bfdfa632d7473e8be0d5", "sha256": "0b68e63e35a97ce6b0cdb6e291b88ebaa8f2dd4afb70b2498f10ee89428258dc" }, { "path": "research/split-skip/SOURCE.json", - "usage": "input", + "usage": "provenance", "git_blob": "2ab610b6ea2edd2865fda793ef2168b0c76afb4f", "sha256": "7c2b4646a3ecfef6f881da5c43e4bd0fa9a4d1b00548b8ab458d897e16735134" }, { "path": "scripts/historical-ci-inputs/Makefile", - "usage": "input", + "usage": "provenance", "git_blob": "aff68409021c9d401a6f8013b9dfd7dbcc30f2a8", "sha256": "ea8830dd79da493e2d75baf753d733ff7efbcf2b4794afe41fae0ac8f3055646" }, { "path": "scripts/historical-ci-inputs/ledger-batch932-run_isolated_tests.py", - "usage": "input", + "usage": "provenance", "git_blob": "65db599ab0b1dea0312c4ca048e0bd0f44c3736f", "sha256": "96ea543e6c707424afe247e77bd86c82152f90fc76a0773c4232145da5cdf8d1" }, { "path": "scripts/historical-ci-inputs/ledger-batch932-test_isolated_test_runner.py", - "usage": "input", + "usage": "provenance", "git_blob": "34820a8f24678f918f4d0e7a35380d8013fc3495", "sha256": "628391b6abfbc8674ceec1751867a4392f2cc0b5b66886243e139af86cf355ac" }, { "path": "scripts/historical-ci-inputs/ledger-batch970-verify_selected_result.py", - "usage": "input", + "usage": "provenance", "git_blob": "c755b76e0d44ba4917aa94440ebe54daefce5b2a", "sha256": "d7fd929726b326aeeaf0a3996475adec88eee9aac09ae0bebeeaa0bc1fc8f199" }, { "path": "scripts/historical-ci-inputs/ledger-frontier741-ci-verification.md", - "usage": "input", + "usage": "provenance", "git_blob": "7f3c012504187917a728b9fe87043f0fc8cd006a", "sha256": "a854022e0e1d5d4db4d60e586be3ea56005013ef14a1fc06d02bc06e8529c4b0" }, { "path": "scripts/historical-ci-inputs/partial-swap-context.json", - "usage": "input", + "usage": "provenance", "git_blob": "ad65114886bf34a4fd27e79f3be502389e689faa", "sha256": "833a9642f33aeab2ffea17ec9c6b82e0a953f90192b2c82e10bef21538dccba9" }, { "path": "scripts/historical-ci-inputs/partial-swap-network.json", - "usage": "input", + "usage": "provenance", "git_blob": "52075f2463f60af5e16571347f24274fce73a1ea", "sha256": "f3c4be597b2f2136da4ae2cc80c7454f63c90aa01f84e5b8131cee4dd55de815" }, { "path": "scripts/partial_swap/shared.py", - "usage": "input", + "usage": "provenance", "git_blob": "44a0e454c70f9c4b98e258b8443612e6a119904b", "sha256": "5a0646a50b9f3e8ea55168620a78e8853b0ab810517cefc8cfb8696aedee278a" }, { "path": "scripts/replay_historical_check.py", - "usage": "input", + "usage": "provenance", "git_blob": "1e92fff2782970ef71378f594f2350d245a4db26", "sha256": "5467619c78183d3adc82b0cb55af28e5c1a01fca2b0588677816244b53e2bafd" }, { "path": "scripts/research_package.py", - "usage": "input", + "usage": "provenance", "git_blob": "091b4c8f58bac9a9580d76025b887dc5c873d05f", "sha256": "e1256016e7f51827d04fa2179255989f639ae1d97afaa9c16265f85a0c6abd70" }, { "path": "scripts/run_isolated_tests.py", - "usage": "input", + "usage": "provenance", "git_blob": "a96ab35b315ce492e7fbbfd6c5ae211aa066b541", "sha256": "49eb56dd0fc0d8d8ffdb209970a7adf2176223580646f575d5c22e59543b381c" }, { "path": "scripts/verify_selected_result.py", - "usage": "input", + "usage": "provenance", "git_blob": "6882a4700e410dec569b51ae2eaf1a19cc019195", "sha256": "d6b305eac5b9bdb8172c469ad30a1655a60fa0aceac8b1bf610e1b73f51babd8" }, { "path": "tests/test_isolated_test_runner.py", - "usage": "input", + "usage": "provenance", "git_blob": "343b24abf6719b81805eba5a84c74e57634c8288", "sha256": "3a5470d0b139828b90e19bf9583ddeafcd69f8e34f2824664eb3a2958a52e34d" } diff --git a/research/historical-selected-replay-gap/VERIFY.json b/research/historical-selected-replay-gap/VERIFY.json index 98553e72ed..ab7efa3471 100644 --- a/research/historical-selected-replay-gap/VERIFY.json +++ b/research/historical-selected-replay-gap/VERIFY.json @@ -4,36 +4,7 @@ "python": "3.12", "requirements": [], "inputs": [ - "Makefile", - "certificates/partial-swap-network.json", - "docs/ci-verification.md", - "research/clifford-state-performance/SOURCE.json", - "research/community-batch1047-audit/CONTENT-COVERAGE.json", - "research/community-batch1099-audit/CONTENT-COVERAGE.json", - "research/community-batch932-audit/CONTENT-COVERAGE.json", - "research/community-batch970-audit/CONTENT-COVERAGE.json", - "research/community-frontier741-audit/CONTENT-COVERAGE.json", - "research/community-frontier890-audit/CONTENT-COVERAGE.json", - "research/community-hyperplane599-audit/SOURCE.json", - "research/community-k492-audit/SOURCE.json", - "research/community-reconciliation92-audit/MANIFEST.json", - "research/partial-swap-digest/baseline.py", - "research/r420-two-sided-basis/SOURCES.json", - "research/skip-clones/SOURCE.json", - "research/split-skip/SOURCE.json", - "scripts/historical-ci-inputs/Makefile", - "scripts/historical-ci-inputs/ledger-batch932-run_isolated_tests.py", - "scripts/historical-ci-inputs/ledger-batch932-test_isolated_test_runner.py", - "scripts/historical-ci-inputs/ledger-batch970-verify_selected_result.py", - "scripts/historical-ci-inputs/ledger-frontier741-ci-verification.md", - "scripts/historical-ci-inputs/partial-swap-context.json", - "scripts/historical-ci-inputs/partial-swap-network.json", - "scripts/partial_swap/shared.py", - "scripts/replay_historical_check.py", - "scripts/research_package.py", - "scripts/run_isolated_tests.py", - "scripts/verify_selected_result.py", - "tests/test_isolated_test_runner.py" + "scripts/research_package.py" ], "commands": [ { diff --git a/research/historical-selected-replay-gap/verify.py b/research/historical-selected-replay-gap/verify.py index 83b995941a..9d266c5a4e 100644 --- a/research/historical-selected-replay-gap/verify.py +++ b/research/historical-selected-replay-gap/verify.py @@ -6,8 +6,10 @@ """ import hashlib import importlib.util +import json import subprocess import sys +import tempfile from pathlib import Path ROOT = Path(__file__).resolve().parents[2] @@ -61,31 +63,47 @@ def require(ok, message): raise SystemExit(message) -def load_checker(): - path = ROOT / "scripts/replay_historical_check.py" - spec = importlib.util.spec_from_file_location("historical_selected_replay_gap_checker", path) +def load_module(path): + spec = importlib.util.spec_from_file_location(path.stem, path) module = importlib.util.module_from_spec(spec) spec.loader.exec_module(module) return module +def checkout_snapshot(snapshot, sources, runner, env): + paths = [runner.canonical_relative_path(row["path"]) for row in sources["files"]] + git = ["git", "-c", "maintenance.auto=false", "-c", "gc.auto=0", + "-c", "core.autocrlf=false"] + subprocess.run([*git, "clone", "--quiet", "--shared", "--no-tags", "--no-checkout", + "--", str(ROOT), str(snapshot)], cwd=ROOT, env=env, check=True) + subprocess.run([*git, "update-ref", "--no-deref", "HEAD", INSPECTED], + cwd=snapshot, env=env, check=True) + # The pinned planner reads omitted manifests from the sparse HEAD/index. + patterns = "".join(f"/{path.as_posix()}\n" for path in paths) + subprocess.run([*git, "sparse-checkout", "set", "--no-cone", "--stdin"], + cwd=snapshot, env=env, input=patterns.encode("utf-8"), check=True) + subprocess.run([*git, "read-tree", "-mu", "HEAD"], cwd=snapshot, env=env, check=True) + for path, row in zip(paths, sources["files"], strict=True): + require(hashlib.sha256((snapshot / path).read_bytes()).hexdigest() == row["sha256"], + "historical checkout source digest changed: " + path.as_posix()) + + def entries(checker): for name, config in checker.CONFIG.items(): for entry in [config, *config.get("additional_inputs", [])]: yield name, entry -def reject(checker, entry): +def reject(root, checker, entry): try: - checker.authenticated_input(ROOT, entry) + checker.authenticated_input(root, entry) except ValueError as exc: return str(exc) raise SystemExit("historical input was admitted: " + entry["path"]) -def main(): - require(not sys.flags.optimize, "assertions must stay enabled") - checker = load_checker() +def check_snapshot(root, env): + checker = load_module(root / "scripts/replay_historical_check.py") selected = [entry for name, entry in entries(checker) if name == "tooling-ledger" and entry["path"] == SELECTED_PATH] require(len(selected) == 1, "selected-result checker overlay is not unique") @@ -94,7 +112,7 @@ def main(): require(entry["accepted_live_sha256"] == [SELECTED_ACCEPTED], "accepted selected-checker successors changed") frozen = (checker.INPUTS / entry["input"]).read_bytes() - live = (ROOT / SELECTED_PATH).read_bytes() + live = (root / SELECTED_PATH).read_bytes() require(hashlib.sha256(frozen).hexdigest() == SELECTED_PIN, "frozen selected checker bytes changed") require(hashlib.sha256(live).hexdigest() == SELECTED_LIVE, "live selected checker digest changed") require(SELECTED_LIVE not in (SELECTED_PIN, SELECTED_ACCEPTED), "live checker was already admitted") @@ -102,7 +120,7 @@ def main(): # live successor, not a broken comparison. require(SELECTED_PIN in (SELECTED_PIN, *entry["accepted_live_sha256"]), "pin membership control failed") - require(reject(checker, entry) == REJECTIONS[SELECTED_PATH][1], + require(reject(root, checker, entry) == REJECTIONS[SELECTED_PATH][1], "selected checker rejection text changed") counts = {path: 0 for path in REJECTIONS} @@ -110,7 +128,7 @@ def main(): for _name, item in entries(checker): if item["path"] not in REJECTIONS: continue - message = reject(checker, item) + message = reject(root, checker, item) counts[item["path"]] += 1 messages.setdefault(item["path"], message) for path, (count, message) in REJECTIONS.items(): @@ -118,20 +136,31 @@ def main(): require(messages[path] == message, "rejection text changed for " + path) require(sum(counts.values()) == 19, "rejection total changed") ci = [item for _name, item in entries(checker) if item["path"] == CI_PATH] - require(len(ci) == 1 and hashlib.sha256((ROOT / CI_PATH).read_bytes()).hexdigest() == CI_LIVE, + require(len(ci) == 1 and hashlib.sha256((root / CI_PATH).read_bytes()).hexdigest() == CI_LIVE, "selected CI note digest changed") diff = subprocess.check_output( - ["git", "diff", "--name-only", PARENT, INSPECTED], cwd=ROOT, text=True) + ["git", "diff", "--name-only", PARENT, INSPECTED], cwd=root, env=env, text=True) changed = sorted(name for name in diff.splitlines() if name) require(changed == CHANGED, "inspected commit diff changed") - sys.path.insert(0, str(ROOT / "scripts")) - from research_package import plan_details - details = plan_details(ROOT, set(changed)) + planner = load_module(root / "scripts/research_package.py") + details = planner.plan_details(root, set(changed)) require([row["package"] for row in details] == PLAN_PACKAGES, "helper plan selection changed") matched = {name for row in details for names in row["causes"].values() for name in names} require(sorted(set(changed) - matched) == UNMATCHED, "unmatched plan paths changed") - require(plan_details(ROOT, set()) == [], "empty change set selected a package") + require(planner.plan_details(root, set()) == [], "empty change set selected a package") + + +def main(): + require(not sys.flags.optimize, "assertions must stay enabled") + sources = json.loads(Path(__file__).with_name("SOURCES.json").read_bytes()) + require(sources["base_commit"] == INSPECTED, "historical checkout base changed") + runner = load_module(ROOT / "scripts/research_package.py") + env = runner.git_source_env() + with tempfile.TemporaryDirectory(prefix="historical-selected-replay-") as temporary: + snapshot = Path(temporary) / "snapshot" + checkout_snapshot(snapshot, sources, runner, env) + check_snapshot(snapshot, env) print("PASS_HISTORICAL_SELECTED_REPLAY_GAP") print("selected_checker_live=" + SELECTED_LIVE) print("rejections=19 distinct_paths=7 plan_packages=9") diff --git a/research/independent-four-guard-positive/PROOF.md b/research/independent-four-guard-positive/PROOF.md new file mode 100644 index 0000000000..26d1e59072 --- /dev/null +++ b/research/independent-four-guard-positive/PROOF.md @@ -0,0 +1,201 @@ +# Four independent full guards are strictly above their product + +Let K be a finite field of order q, let m >= 4, and put d = m-1. Fix a +nonzero column u and four linearly independent rows v_i with v_i u = 1. +For a uniform G in GL_m(K), let E_i mean that every leading principal minor +of orders 1 through m-1 of G(I-u v_i)G^-1 is nonzero. + +**Theorem.** If p = Pr(E_i), then + +```text +Pr(E_1 and E_2 and E_3 and E_4) > p^4 +``` + +for every q and m in this domain. This is a four-event statement. It does +not assert association of every subfamily of an arbitrary dependent tuple. + +The new steps below are the explicit four-dimensional subspace +classification, its closed formula, and the all-field four-event sign. +SHIN09-git's #6710 supplies the general subspace counting law and the +enlarged-space method used for triples. Those are cited premises, not new +results or executable dependencies. + +## An explicit formula + +Define + +```text +A = q + (q-1)^2 +W = q^4 + (q-1)^5 +D = (q^(d+1)-1) q^d (q^d-1)(q^d-q)(q^d-q^2) +B_s = q^2 + (q-1)^2 (q+1-s), s = 2,3,4 +H_s = (q-1)^(4-s) [(q-1)^s + (-1)^s(q-1)] / q +C_s = q^3 + (q-1) H_s + +(a_2,a_3,a_4) = (7, 6(q-2), (q-2)(q-3)) +(b_2,b_3,b_4) = (6, 4(q-2), q^2-3q+3). +``` + +Then the exact joint law is + +```text +J_4 = (q-1) [W^d - sum_s b_s C_s^d + + q sum_s a_s B_s^d - q^3 A^d] / D. +``` + +To derive it, apply #6710's law to S = K^4 and t = (1,1,1,1). +For a subspace L containing t, that law uses + +```text +h(L) = #{x in L : every coordinate of x is nonzero} +lambda(L) = q^dim(L) + (q-1) h(L) +mu(L,K^4) = (-1)^c q^(c(c-1)/2), c = 4-dim(L). +``` + +In dimension one, L = , h = q-1, and mu = -q^3. In dimension four, +h = (q-1)^4 and mu = 1. + +A two-dimensional L is spanned by t and a nonconstant vector x. Let s +be the number of distinct coordinates of x. Replacing x by ax+bt, with +a nonzero, preserves s and gives exactly q(q-1) representatives of the +same L. The number of ordered four-tuples using exactly s distinct field +values is S(4,s) q(q-1)...(q-s+1). Since the three relevant Stirling numbers +are 7, 6, 1, division gives a_s as above. Counting x_0+t_0 x with all +coordinates nonzero gives h = (q-1)(q+1-s). Thus lambda = B_s and mu = q. +When s > q the corresponding a_s is zero, so no nonexistent class enters. + +A three-dimensional L is a hyperplane a dot x = 0, where a dot t = 0. +Its normal is unique up to nonzero scale. If its support has size s, the +number of full-support vectors in L is H_s. Indeed, after scaling the +s constrained coordinates, the number of nonzero s-tuples summing to zero +is + +```text +Z_s = [(q-1)^s + (-1)^s(q-1)] / q. +``` + +This follows from Z_1 = 0 and Z_(s+1) = (q-1)^s - Z_s: choose the first +s entries, and the last nonzero entry is forced precisely when their sum +is nonzero. There are binom(4,s) Z_s/(q-1) normal lines of support s. +For s = 2,3,4 these are exactly b_s. Thus lambda = C_s and mu = -1. +These classes exhaust both projective planes of size q^2+q+1 in the +subspace interval. Substitution proves the formula over every finite field. + +## A sufficient tail inequality + +Write Q = q^d, t_1 = 1-1/q+1/q^2, and + +```text +c = (1-1/q)/(1-q^(-m)), p = c t_1^d. +``` + +Sample u' uniformly among the nonzero columns. Conditional on u', sample +four normalized rows independently and uniformly from v u' = 1. This +affine hyperplane has Q points. Let I be the event that the four rows +are independent. Normalization makes linear independence equivalent to +affine independence, so + +```text +P_I = (1-1/Q)(1-q/Q)(1-q^2/Q), +1-P_I <= (1+q+q^2)/Q. +``` + +Conditioning on I gives the uniform independent-four tuple orbit by +#6710's equal-fiber argument. + +Let z(u') be the conditional single-guard pass probability. Its mean is p. +It vanishes unless the last coordinate u'_m is nonzero. To see this, +the rank-one determinant identity gives the order-j minor as +1-sum_(a<=j) u'_a v_a. If u'_m = 0, the order-d minor is zero by +v u' = 1. The last-coordinate event has probability c. +Conditional Jensen therefore gives + +```text +T = E[z^4] >= p^4/c^3. +``` + +Since the joint event outside I has probability at most 1-P_I, +P_I J_4 >= T-(1-P_I). It is sufficient for J_4 > p^4 that + +```text +p^4 (c^-3 - 1) > 1-P_I. +``` + +Now c^-1 = 1+q^-1+...+q^-d, so c^-3-1 >= 3/q. +Also c > 1-1/q. Hence the following exact rational inequality suffices: + +```text +L(q,d) = (3/q)(1-1/q)^4 (q t_1^4)^d > q^2+q+1. (1) +``` + +For q >= 4, t_1 >= 3/4 and q(3/4)^4 > 1. For q = 3, +q t_1^4 = 2401/2187 > 1. Thus a successful tail threshold persists +as d increases for every q >= 3. + +## Uniform large-field coverage and the finite remainder + +For q >= 25, at d = 3, + +```text +L(q,3) = 3q^2(1-1/q)^4 t_1^12 + > 3q^2(1-1/q)^16 + >= 3q^2 - 48q + > q^2 + q + 1. +``` + +The middle step is Bernoulli's inequality. The last difference is +2q^2-49q-1, positive at q=25 and strictly increasing thereafter. +This covers every d >= 3 at every field order q >= 25. + +For q=2, the event u' supported on the last coordinate passes all four +guards and has probability b = c 2^-d. Since c < 1 and +(3/4)^4 < 1/2, we have p^4 = c^4(3/4)^(4d) < b. + +The remaining finite field orders and exact thresholds in (1) are: + +| q | first d_0 >= 3 satisfying (1) | dimensions 3 <= d < d_0 | +| ---: | ---: | ---: | +| 3 | 45 | 42 | +| 4 | 9 | 6 | +| 5 | 6 | 3 | +| 7 | 4 | 1 | +| 8 | 4 | 1 | +| 9 | 4 | 1 | +| 11 | 4 | 1 | +| 13 | 4 | 1 | +| 16 | 3 | 0 | +| 17 | 3 | 0 | +| 19 | 3 | 0 | +| 23 | 3 | 0 | + +The verifier checks (1) at each d_0 and evaluates the closed formula +against p^4 with exact rational arithmetic in each of the 56 remaining +cases. It prints every exact ratio, which is strictly greater than one. +Together with the analytic bounds, these finite comparisons prove the sign +in all dimensions and over every finite field. No numerical approximation +or assumption about unenumerated exceptions enters the argument. + +## Separate finite corroboration of the formula + +The verifier explicitly enumerates all two- and three-dimensional +subspaces in the above interval over F_2, F_3, F_4, F_5 and F_7 and checks +both class multiplicities and every h(L). F_4 uses x^2+x+1, rather than +arithmetic modulo four. + +A second computation treats the first new ambient dimension m=4 over +F_2, F_3, F_4 and F_5. Conditional on u'_m != 0 and exactly j zero +coordinates among its first three entries, an invertible triangular +coordinate change makes the allowed rows the box +K^j times (K without zero)^(3-j). The coordinate change preserves +affine independence. The number of such u' is +(q-1) binom(3,j)(q-1)^(3-j). + +To count ordered affine bases of a box, enumerate every unordered triple +of points. A noncollinear triple defines one affine plane. Each point +outside that plane is a valid fourth point, and each unordered triple +has six orderings. This counts exactly the ordered affinely independent +quadruples, without using the subspace formula. Weight the four box counts +by the image-column multiplicities and divide by +(q^4-1) q^3(q^3-1)(q^3-q)(q^3-q^2). The resulting fractions agree with +the formula. These are new bounded checks, not replays of a predecessor's +scientific suite. diff --git a/research/independent-four-guard-positive/README.md b/research/independent-four-guard-positive/README.md new file mode 100644 index 0000000000..38eb66488c --- /dev/null +++ b/research/independent-four-guard-positive/README.md @@ -0,0 +1,91 @@ +# Four independent full guards beat their product over every finite field + +This contribution was produced by Nick Petalas. Apache-2.0. + +Claim type: scoped written counting proof with exact finite corroboration. +For every finite field K, every m >= 4, every nonzero column u and four +independent rows v_i normalized by v_i u = 1, a uniform complete GL_m(K) +header passes all proper leading-minor guards of I-u v_i with probability +strictly greater than the product of the four individual probabilities. + +[PROOF.md](PROOF.md) gives an explicit eight-term exponential formula for +the joint law and proves the sign. A uniform analytic bound covers all +field orders at least 25. Exact tail thresholds cover the remaining field +orders after 56 rational comparisons. The binary case follows directly +from the last-coordinate event. + +This resolves the four-covector case of Open next question 1 in +[SHIN09-git's #6710](https://github.com/CrocSwap/integer-mult-bounds/pull/6710). +That package's general subspace law and independent-triple sampling method +are credited premises. The new four-dimensional classification, closed +formula and all-field four-event sign are the contribution here. ToikY's +#6701 and #6703 supply the binary-family and pair-correlation precedents. +Nick Petalas's #4227 and #4807 supply earlier marginal and pair laws. +The retained Ryanson Jonathan, Cinna Davis, source527, commdata2338 and +Jose Manuel BIT/normalizer/compiler lineage keeps its predecessor credit. +The binary and ternary signs are already covered by #6710. The uniform +four-row theorem extends that coverage to every field. No predecessor +executable is imported or replayed. + +## Reproduce + +From the repository root, using CPython 3.12 and the standard library: + +```sh +/Users/nick/git/integer-mult-bounds/.venv/bin/python3.12 -I -W error -B research/independent-four-guard-positive/verify.py +/Users/nick/git/integer-mult-bounds/.venv/bin/python3.12 -I -O -W error -B research/independent-four-guard-positive/verify.py +/Users/nick/git/integer-mult-bounds/.venv/bin/python3.12 -B scripts/research_package.py --package research/independent-four-guard-positive +/Users/nick/git/integer-mult-bounds/.venv/bin/python3.12 -B scripts/check_research_commit.py --package research/independent-four-guard-positive --check-source-history +``` + +Other machines can substitute their CPython 3.12 interpreter path. The +standalone verifier needs no Git, network or predecessor package. It writes +no artifacts and prints a generated receipt with the SHA256 of all six +package files, followed by `PASS_INDEPENDENT_FOUR_GUARD_POSITIVE`. + +The finite check includes all 56 exceptional sign comparisons, all 258 +two- and three-dimensional subspaces in the declared interval over fields +of orders 2, 3, 4, 5 and 7, and a separate affine-plane count of ordered +four-point bases in 16 boxes over fields of orders 2, 3, 4 and 5 at m=4. +It checks four altered Mobius terms, distinguishes the independence guess, +and rejects four out-of-domain formula inputs. Every reported comparison +and box count is computed. The written proof supplies the universal scope. + +The verifier uses bounded loops, no recursion and functions below 60 lines. +Its largest box has 125 points and 317,750 unordered triples; its largest +stratum check has 57 normal lines and at most 1,296 full-support vectors +per line. CPython dynamic allocation and integer arithmetic are explicit +managed-runtime deviations from fixed allocation. Live collections are +bounded by these fixed domains. Both registered modes treat warnings as +errors and keep explicit checks enabled under optimization. + +## Scope and remaining obligations + +Only independent normalized covectors and uniform complete general-linear +headers are covered. Dependent families can have a different sign. This +does not price or construct a physical header producer, caller, selection, +dispatch, dirty restoration, stock or precision. The complete recursive +invoice and all selected framework assumptions remain open. No new kappa, +supplier admission, selected-frontier change or complete multiplication +theorem is claimed. Independent human and formal proof-kernel review are +unclaimed. Selected cold replay, Lean and Docker were not run. + +The formal-interface-lemma card's scope is changed to this explicitly open +local counting problem. The source pin identifies the question and cited +theorems. Those files are historical provenance, not runtime inputs. +The broader overlap helper reported incomplete sparse local-note coverage; +the target was separately searched in canonical main and live PR bodies. +Its closed-PR API scan timed out. A direct author/date/reference query +found #6793, which cites #6710 as background but studies paid monomial +header costs, rather than the full-GL four-event question here. + +## Open next questions + +1. Do five or more independent normalized covectors beat their product in + every dimension? Start with five rows and classify the intermediate + subspaces through the all-ones vector. Their full-support counts need + more data than the two four-dimensional classifications used here. +2. Can an actual BIT caller use the four-event count with a fully paid + uniform complete-header producer? First pin its request tuple and + header distribution. Selection, emission, dispatch, restoration, + precision, storage and the full signed bill are unresolved. diff --git a/research/independent-four-guard-positive/SOURCES.json b/research/independent-four-guard-positive/SOURCES.json new file mode 100644 index 0000000000..820780b113 --- /dev/null +++ b/research/independent-four-guard-positive/SOURCES.json @@ -0,0 +1,36 @@ +{ + "schema_version": 1, + "base_commit": "e54523517d0f03e58352e647c403a5af3e525a57", + "files": [ + { + "path": "certificates/selected-result.json", + "usage": "provenance", + "git_blob": "75d77b328ea02ded535e7f23aee5b1e55d0bb1a8", + "sha256": "154c3d30455d778fd3343b6b4851f0fa4665f0f7625b0adb3675e2bafbbf6bf1" + }, + { + "path": "docs/research/agent-task-catalog.json", + "usage": "provenance", + "git_blob": "3404fbdd5e7529a0674eef26114b5071e4586cec", + "sha256": "ead6cdc9d0af6d58e8a49744d8ec8c7c15e13d2ba93c276c434bcf9b51b93a81" + }, + { + "path": "research/common-image-guard-pencils/PROOF.md", + "usage": "provenance", + "git_blob": "e67bc62fc5efa61b2a184ea176c64861906b71a1", + "sha256": "befa92a531d4fc42bb235d78294d92bcea6feb1bb9f5f7c71daf0d6fef21e36d" + }, + { + "path": "research/common-image-guard-pencils/README.md", + "usage": "provenance", + "git_blob": "0a040368a1b6674d491321e22154c69abc5a3b40", + "sha256": "79a4c4476cd5da844b1c1604474a4e09dcf6470b42ee1d81f466998c45d1af97" + }, + { + "path": "research/common-image-guard-pencils/TRIPLES.md", + "usage": "provenance", + "git_blob": "d84835704ea510b6693d654277943a94e5d87a56", + "sha256": "770723e2dc12bfc87e161ca2f7d1541ec4fce0c6b4cf97b0291e0aae6cb577ce" + } + ] +} diff --git a/research/independent-four-guard-positive/TASK.json b/research/independent-four-guard-positive/TASK.json new file mode 100644 index 0000000000..75b3091d18 --- /dev/null +++ b/research/independent-four-guard-positive/TASK.json @@ -0,0 +1,101 @@ +{ + "schema_version": 1, + "task_id": "formal-interface-lemma", + "priority_revision": 8, + "base_commit": "e54523517d0f03e58352e647c403a5af3e525a57", + "original_card": { + "id": "formal-interface-lemma", + "question": "Can one uncovered interface implication be formalized with exact caller and certificate bindings?", + "starting_points": [ + "docs/research/research-family-status.md", + "certificates/selected-result.json", + "research/gate-operand-parity-lean/README.md", + "research/staged544-certified-endpoint/README.md", + "research/unconditional-batched-crt/README.md" + ], + "methods": [ + "Formalize a missing boundary lemma identified by the selected review.", + "Audit a formal theorem-to-certificate binding independently." + ], + "acceptance_gate": "State the exact formalized proposition and remaining assumptions; avoid duplicate arithmetic formalizations already present.", + "first_step": { + "command": [ + "python3", + "-B", + "scripts/research_selected_baseline.py" + ], + "expected": "PASS_RESEARCH_BASELINE_BINDINGS_ONLY", + "inspect": "Resolve the current selected review, separate complex/ordinary BIT/admitted BIT/outer budgets, and compare the card against live handoffs before starting. Historical ceilings require exact source/model equivalence.", + "scope": "Source-binding orientation only; not a scientific replay or all-size proof. Materialize selected inputs if this checkout is sparse." + }, + "first_experiment": "Write one missing statement with quantified hypotheses, actual caller and existing coverage. A compact-switch lemma is a candidate only after its mathematical contract is reviewed. Establish a bounded proof plan before a separately budgeted proof-assistant build; do not rerun large Lean jobs as orientation.", + "bottleneck_link": "A missing interface proof can reduce the conditional gap even if it does not change kappa.", + "allowed_variations": [ + "Narrow to one formal lemma or one theorem-to-certificate binding." + ], + "scope_change_triggers": [ + "Formalizing already-covered arithmetic and claiming the full multiplication theorem." + ], + "overlap_terms": [ + "hyperplane end", + "formal interface", + "Lean binding", + "3807", + "3857", + "4100", + "gate-operand-parity-lean", + "staged544-certified-endpoint", + "unconditional-batched-crt" + ], + "existing_checks": [ + { + "scope": "PR #3807: scoped gate-operand parity formalization.", + "evidence": "research/gate-operand-parity-lean/README.md", + "remaining": "Exact theorem-to-caller binding and genuinely uncovered interface lemmas.", + "status": "author-checked", + "source_commit": "4c3530f42a6abcc48e7a6bcffd6c901911dc8269", + "selected_record_sha256": "bb2eaa58647b353f88d0aec2eafb9d30df1be53589231b23e12ceef3e4bad129" + }, + { + "scope": "PR #3857: certified real-power moment/endpoint arithmetic.", + "evidence": "research/staged544-certified-endpoint/README.md", + "remaining": "Uniform algorithmic implications, not another endpoint digit.", + "status": "author-checked", + "source_commit": "ef4315b8caa605e47a2515004845eb2d2ed71a86", + "selected_record_sha256": "bb2eaa58647b353f88d0aec2eafb9d30df1be53589231b23e12ceef3e4bad129" + }, + { + "scope": "PR #4100: compact-switch formalization proposed as future validation.", + "evidence": "research/unconditional-batched-crt/README.md", + "remaining": "Audit the statement and assumptions before a formal proof campaign.", + "status": "author-checked", + "source_commit": "337d04939571a637aeab54a0f58f54fde811663a", + "selected_record_sha256": "bb2eaa58647b353f88d0aec2eafb9d30df1be53589231b23e12ceef3e4bad129" + } + ] + }, + "scope_status": "changed", + "actual_scope": "Strict four-way positive correlation for independent normalized common-image full guards over every finite field and every m >= 4.", + "scope_change_reason": "Original side result answering PR6710 Open next question 1 for four rows; this is an exact counting proof, not a proof-assistant binding or an audit.", + "bottleneck_link": "Local shared-header interface result. It determines the sign of batching four independent full guards under uniform complete headers; a physical producer and full caller bill remain unknown.", + "budget_minutes": 60, + "stop_rule": "Stop after proving and finitely corroborating the four-row sign; do not extend to five rows.", + "outcome": "completed", + "evidence": "PROOF.md supplies the universal proof. verify.py computes 56 finite exceptional signs, 258 subspace checks, 16 independent affine-box counts, five semantic controls and four rejected inputs.", + "author": "Nick Petalas", + "ai_assistance": "Independent human and formal proof-kernel review are unclaimed.", + "open_questions": [ + { + "question": "Do five or more independent normalized common-image full guards beat their product in every dimension?", + "why_it_matters": "This is the remaining independent-family sign question in PR6710.", + "first_step": "Classify subspaces through the all-ones vector in five dimensions and their full-support counts.", + "blocked_by": "Intermediate subspaces need additional structure beyond the four-dimensional line and hyperplane classes." + }, + { + "question": "Can an actual BIT caller use the four-event count with a fully paid uniform complete-header producer?", + "why_it_matters": "A formal count alone supplies no physical caller or recursive saving.", + "first_step": "Pin one request tuple and the exact physical header distribution.", + "blocked_by": "Selection, emission, dispatch, restoration, storage, precision and the complete signed bill remain unknown." + } + ] +} diff --git a/research/independent-four-guard-positive/VERIFY.json b/research/independent-four-guard-positive/VERIFY.json new file mode 100644 index 0000000000..3dad8006df --- /dev/null +++ b/research/independent-four-guard-positive/VERIFY.json @@ -0,0 +1,34 @@ +{ + "schema_version": 1, + "status": "ready", + "python": "3.12", + "requirements": [], + "inputs": [], + "commands": [ + { + "argv": [ + "{python}", + "-I", + "-W", + "error", + "-B", + "{package}/verify.py" + ], + "timeout_seconds": 120, + "checks": "56 exact sign comparisons, 258 literal subspace checks, 16 independent affine-box counts and nine semantic/boundary controls." + }, + { + "argv": [ + "{python}", + "-I", + "-O", + "-W", + "error", + "-B", + "{package}/verify.py" + ], + "timeout_seconds": 120, + "checks": "Repeat all finite checks with optimization; explicit checks remain enabled." + } + ] +} diff --git a/research/independent-four-guard-positive/verify.py b/research/independent-four-guard-positive/verify.py new file mode 100644 index 0000000000..2107d485f1 --- /dev/null +++ b/research/independent-four-guard-positive/verify.py @@ -0,0 +1,224 @@ +"""Exact finite corroboration of the independent-four guard theorem.""" + +import hashlib +import json +from collections import Counter +from fractions import Fraction +from itertools import combinations, product +from math import comb +from pathlib import Path + + +def require(condition, message): + if not condition: + raise RuntimeError(message) + + +def field_product(a, b, q): + if q != 4: + return a * b % q + value = 0 + for _ in range(2): + if b & 1: + value ^= a + b >>= 1 + a <<= 1 + if a & 4: + a ^= 7 + return value + + +def field_tables(q): + require(q in (2, 3, 4, 5, 7), "unsupported finite check field") + add = tuple(tuple(a ^ b if q == 4 else (a + b) % q + for b in range(q)) for a in range(q)) + mul = tuple(tuple(field_product(a, b, q) for b in range(q)) + for a in range(q)) + neg = tuple(next(b for b in range(q) if add[a][b] == 0) + for a in range(q)) + inv = (0,) + tuple(next(b for b in range(1, q) if mul[a][b] == 1) + for a in range(1, q)) + return add, mul, neg, inv + + +def normalize(vector, mul, inv): + scale = inv[next(x for x in vector if x)] + return tuple(mul[scale][x] for x in vector) + + +def dot(left, right, add, mul): + value = 0 + for a, b in zip(left, right, strict=True): + value = add[value][mul[a][b]] + return value + + +def strata(q): + add, mul, _, inv = field_tables(q) + lines = {normalize(v + (0,), mul, inv) + for v in product(range(q), repeat=3) if any(v)} + planes = set() + for v in product(range(q), repeat=4): + if any(v) and dot(v, (1, 1, 1, 1), add, mul) == 0: + planes.add(normalize(v, mul, inv)) + line_counts, plane_counts = Counter(), Counter() + for v in sorted(lines): + support = len(set(v)) + h = sum(all(add[x][mul[y][a]] for a in v) + for x, y in product(range(q), repeat=2)) + require(h == (q - 1) * (q + 1 - support), "line full support") + line_counts[support] += 1 + for normal in sorted(planes): + support = sum(a != 0 for a in normal) + h = sum(dot(normal, x, add, mul) == 0 + for x in product(range(1, q), repeat=4)) + expected = (q - 1) ** (4 - support) + expected *= ((q - 1) ** support + (-1) ** support * (q - 1)) // q + require(h == expected, "plane full support") + plane_counts[support] += 1 + expected_lines = {2: 7, 3: 6 * (q - 2), 4: (q - 2) * (q - 3)} + expected_planes = {2: 6, 3: 4 * (q - 2), 4: q * q - 3 * q + 3} + require(dict(line_counts) == {s: n for s, n in expected_lines.items() if n}, + "projective quotient strata") + require(dict(plane_counts) == {s: n for s, n in expected_planes.items() if n}, + "dual hyperplane strata") + require(len(lines) == len(planes) == q * q + q + 1, "projective counts") + return {"q": q, "lines": len(lines), "planes": len(planes)} + + +def formula_terms(q, d): + require(isinstance(q, int) and q >= 2 and isinstance(d, int) and d >= 3, + "formula domain requires integers q >= 2, d >= 3") + a = q + (q - 1) ** 2 + line_counts = (7, 6 * (q - 2), (q - 2) * (q - 3)) + plane_counts = (6, 4 * (q - 2), q * q - 3 * q + 3) + line_sum = plane_sum = 0 + for s, n2, n3 in zip(range(2, 5), line_counts, plane_counts, strict=True): + h3 = (q - 1) ** (4 - s) + h3 *= ((q - 1) ** s + (-1) ** s * (q - 1)) // q + line_sum += n2 * (q * q + (q - 1) ** 2 * (q + 1 - s)) ** d + plane_sum += n3 * (q ** 3 + (q - 1) * h3) ** d + return (q ** 4 + (q - 1) ** 5) ** d, plane_sum, q * line_sum, q ** 3 * a ** d + + +def joint_probability(q, d): + top, planes, lines, bottom = formula_terms(q, d) + denominator = (q ** (d + 1) - 1) * q ** d + for i in range(3): + denominator *= q ** d - q ** i + return Fraction((q - 1) * (top - planes + lines - bottom), denominator) + + +def marginal(q, d): + return Fraction((q - 1) * (q * q - q + 1) ** d, + (q ** (d + 1) - 1) * q ** d) + + +def finite_tail(): + rows, comparisons = [], [] + fields = (3, 4, 5, 7, 8, 9, 11, 13, 16, 17, 19, 23) + for q in fields: + t = Fraction(q * q - q + 1, q * q) + base = q * t ** 4 + require(base > 1, "tail must persist") + first = next((d for d in range(3, 128) + if Fraction(3, q) * Fraction(q - 1, q) ** 4 * base ** d + > q * q + q + 1), None) + require(first is not None, "bounded tail search exhausted") + ratios = [] + for d in range(3, first): + ratio = joint_probability(q, d) / marginal(q, d) ** 4 + require(ratio > 1, f"four-way sign at {(q, d)}") + ratios.append(ratio) + comparisons.append({"q": q, "d": d, + "ratio": [ratio.numerator, ratio.denominator]}) + rows.append({"q": q, "d0": first, "exceptions": len(ratios)}) + require(len(comparisons) == 56, "finite exception domain") + require(Fraction(3, 4) ** 4 < Fraction(1, 2), "binary last-coordinate bound") + # At q >= 25, 3q^2-48q > q^2+q+1. Its difference increases there. + require(2 * 25 ** 2 - 49 * 25 - 1 > 0, "uniform tail endpoint") + require(4 * Fraction(3, 4) ** 4 > 1, "uniform tail base") + return rows, comparisons + + +def cross(left, right, add, mul, neg): + a, b, c = left + x, y, z = right + return (add[mul[b][z]][neg[mul[c][y]]], + add[mul[c][x]][neg[mul[a][z]]], + add[mul[a][y]][neg[mul[b][x]]]) + + +def affine_bases(q, unrestricted): + add, mul, neg, inv = field_tables(q) + coordinates = [range(q) if i < unrestricted else range(1, q) for i in range(3)] + points = tuple(product(*coordinates)) + sizes, total = {}, 0 + for x, y, z in combinations(points, 3): + left = tuple(add[b][neg[a]] for a, b in zip(x, y, strict=True)) + right = tuple(add[b][neg[a]] for a, b in zip(x, z, strict=True)) + normal = cross(left, right, add, mul, neg) + if not any(normal): + continue + normal = normalize(normal, mul, inv) + offset = dot(normal, x, add, mul) + key = normal + (offset,) + if key not in sizes: + sizes[key] = sum(dot(normal, v, add, mul) == offset for v in points) + total += len(points) - sizes[key] + require(total >= 0, "affine basis count") + return 6 * total + + +def direct_boxes(): + results = [] + for q in (2, 3, 4, 5): + counts = [affine_bases(q, j) for j in range(4)] + q3 = q ** 3 + require(counts[3] == q3 * (q3 - 1) * (q3 - q) * (q3 - q * q), + "unrestricted affine basis oracle") + numerator = sum((q - 1) * comb(3, j) * (q - 1) ** (3 - j) * counts[j] + for j in range(4)) + denominator = (q ** 4 - 1) * counts[3] + actual = Fraction(numerator, denominator) + require(actual == joint_probability(q, 3), "literal affine-box comparison") + results.append({"q": q, "d": 3, "ordered_box_bases": counts, + "joint": [actual.numerator, actual.denominator]}) + return results + + +def controls(): + top, planes, lines, bottom = formula_terms(3, 3) + actual = top - planes + lines - bottom + mutants = (top + planes + lines - bottom, + top - planes + lines // 3 - bottom, + top - planes + lines - bottom // 3, + top - planes + lines + bottom) + require(all(value != actual for value in mutants), "Mobius mutation controls") + require(joint_probability(3, 3) != marginal(3, 3) ** 4, "independence control") + rejected = 0 + for q, d in ((1, 3), (3, 2), (3.0, 3), (3, 3.0)): + try: + formula_terms(q, d) + except RuntimeError: + rejected += 1 + require(rejected == 4, "formula boundary controls") + return {"semantic_mutants": len(mutants) + 1, "rejected_inputs": rejected} + + +def main(): + rows, comparisons = finite_tail() + result = {"claim_type": "scoped proof with exact finite corroboration", + "tail_rows": rows, "exception_comparisons": comparisons, + "strata": [strata(q) for q in (2, 3, 4, 5, 7)], + "direct_boxes": direct_boxes(), "controls": controls()} + package = Path(__file__).resolve().parent + names = ("README.md", "PROOF.md", "TASK.json", "SOURCES.json", "VERIFY.json", "verify.py") + result["sha256"] = {name: hashlib.sha256((package / name).read_bytes()).hexdigest() + for name in names} + print(json.dumps(result, sort_keys=True)) + print("PASS_INDEPENDENT_FOUR_GUARD_POSITIVE") + + +if __name__ == "__main__": + main()