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/proper-terminal-helper-rank-bill/PROOF.md b/research/proper-terminal-helper-rank-bill/PROOF.md new file mode 100644 index 0000000000..8c3f6075c9 --- /dev/null +++ b/research/proper-terminal-helper-rank-bill/PROOF.md @@ -0,0 +1,186 @@ +# Proof: proper helper terminals and the rank bill + +**Proof. No new κ.** The selected conditional exponent stays +`363005817/100000000000`. No word is emitted and no cut is declared legal. + +## Hypotheses + +Fix a real exponent `0 < t < 1` and integers `0 < T < D`. A helper boundary +runs from the zero subspace to a proper terminal of dimension `T`, strictly +inside the ambient `D`-dimensional space. The helper is cut at an intermediate +dimension `x`, using `m ≥ 1` contact-free transport paths. Path `i` has integer +endpoints `0 ≤ a_i ≤ b_i ≤ D` and old charge `(b_i - a_i)^t`. A path with +`b_i > T` leaves the boundary. + +Write `h(u) = u^t` for `u > 0` and `h(0) = 0`. On the closed feasible interval +`[A, B]`, with `A = max a_i` and `B = min(T, min b_i)`, every leg length is +nonnegative and the rank bill is + +```text +G(x) = h(x) + h(T-x) - h(T) + - Σ_i ( h(x-a_i) + h(b_i-x) - h(b_i-a_i) ). +``` + +This is the #7283 formula with the helper dimension `D` replaced by the +terminal `T`. A zero leg is omitted from a physical word; the formula keeps +`h(0) = 0`. The value `G` is the rank-bill factor only. It is not an ordinary +cost, a legality test or a supplier invoice. + +The interval endpoints are feasible dimensions. `A` is the largest path start, +and `B` is the terminal when at least one path crosses it, otherwise the +smallest path end. Joins or meets can only shrink `[A, B]`, and the argument +below applies to every closed subinterval on which all legs are nonnegative. + +## Lemma 1 (concavity and its derivative) + +For `0 < u < v`, + +```text +h'(u) = t u^(t-1) > t v^(t-1) = h'(v). +``` + +Both sides are positive because `0 < t < 1`, and `u^(t-1) > v^(t-1)` +because `u < v` and `t - 1 < 0`. Hence `h` is strictly concave and `h'` is +strictly decreasing on `(0, ∞)`. The verifier checks the equivalent integer +form: for `t = p/q` in lowest terms, `s = q - p > 0`, and `u ≤ v` implies +`u^s ≤ v^s`. + +The same strict monotonicity gives the increment form used below. For +`0 ≤ y < z` and `x > 0`, + +```text +h(z) - h(z-x) < h(y+x) - h(y) + if and only if z-x > y, +``` + +because both increments are `∫_0^x h'(base + s) ds` and `h'` is strictly +decreasing. We use the case `y = T-x`, `z = b` with `b > T`. + +## Lemma 2 (subadditivity) + +For `u, v ≥ 0`, + +```text +h(u+v) ≤ h(u) + h(v). +``` + +For positive `u, v` this is the strict concavity inequality +`h(u) ≥ h(u+v) + h'(u+v)(u - (u+v))`, together with the symmetric bound for +`h(v)`; the boundary cases follow from `h(0) = 0`. Equality holds only when +`u = 0` or `v = 0`. + +## Lemma 3 (the terminal is not a positive bill) + +Suppose every path has `a_i ≤ T ≤ b_i`. Then + +```text +G(T) = - Σ_i ( h(T-a_i) + h(b_i-T) - h(b_i-a_i) ) ≤ 0. +``` + +The helper terms vanish because `h(T) - h(T) = 0` and `h(0) = 0`. Each summand +is nonnegative by Lemma 2, applied to `u = T - a_i` and `v = b_i - T` whose sum +is `b_i - a_i`. A summand is zero exactly when `T` equals `a_i` or `b_i`. +Therefore `G(T) ≤ 0`, with equality exactly when `T` is an endpoint of every +path. + +## Lemma 4 (no path starts inside the boundary) + +Suppose every `a_i = 0`, at least one path crosses (`b_i > T`), and +`0 < x < T`. Then `G(x) < 0`. + +Proof. Substitute `a_i = 0`: + +```text +G(x) = - (h(T) - h(T-x)) + Σ_i ( h(b_i) - h(b_i-x) ) - (m-1) h(x). +``` + +For a crossing path, `b_i > T`, so `b_i - x > T - x`. Lemma 1 with +`y = T-x`, `z = b_i` gives + +```text +h(b_i) - h(b_i-x) < h(T) - h(T-x). +``` + +Summing over the `m` paths, + +```text +Σ_i ( h(b_i) - h(b_i-x) ) < m ( h(T) - h(T-x) ), +``` + +so + +```text +G(x) < (m-1) ( h(T) - h(T-x) ) - (m-1) h(x) + = -(m-1) ( h(x) + h(T) - h(T-x) ). +``` + +For `m ≥ 2` the right side is negative because `h(x) > 0` and +`h(T) > h(T-x)`. For `m = 1` the strict increment inequality alone gives +`G(x) < 0` without the last line. At `x = 0` every term vanishes, so +`G(0) = 0` and the maximum is attained only at the left endpoint. + +## Theorem 1 (one crossing path) + +Suppose `m = 1` and `b > T`. Then `G` is strictly decreasing on `[a, T]`, so +its maximum on the feasible interval is `G(a)`. + +Proof. For `a < x < T` the legs are positive and + +```text +G'(x) = h'(x) - h'(T-x) - h'(x-a) + h'(b-x) + = [h'(x) - h'(x-a)] + [h'(b-x) - h'(T-x)]. +``` + +Since `a ≥ 0`, we have `x - a ≤ x`, and Lemma 1 gives +`h'(x-a) ≥ h'(x)`, with equality only if `a = 0`. Since `b > T`, we have +`b - x > T - x`, and Lemma 1 gives `h'(b-x) < h'(T-x)`. The second bracket is +strictly negative, so `G'(x) < 0` on `(a, T)`. A differentiable function with +a strictly negative derivative on an open interval is strictly decreasing +there; `G` is continuous on the closed interval because `h(0) = 0`. Hence the +maximum is `G(a)`. When `a = 0`, Lemma 4 gives `G(x) < 0` on `(0, T)` directly. + +Consequently one path that leaves a proper helper boundary can never justify a +new intermediate dimension: the candidate is the path's own lower endpoint, +which is already a boundary dimension. This is the first step requested in +#7283's Open next question 1. + +## Proposition (the endpoint maximum fails for four crossing paths) + +Take `t = 1/2`, `D = 26`, `T = 24`, and the four paths + +```text +(3, 25), (17, 26), (0, 25), (6, 25). +``` + +Every path starts in `[0, T]` and crosses the terminal, and every endpoint is +in `[0, D]`. The feasible interval is `[A, T] = [17, 24]`. At +`x0 = 3819/160` the exact integer square-root certificate gives + +```text +G(17) - G(x0) < 0, G(24) - G(x0) < 0. +``` + +The decimal displays are `G(17) = -3.747477...`, `G(24) = -3.734846...` and +`G(x0) = -3.554274...`. Thus `x0` strictly beats both endpoints. The endpoint +maximum of #7283 therefore does not extend to four boundary-crossing paths. + +The witness has a negative interior value, so it does not exhibit a profitable +rank bill. It shows that the two-endpoint comparison can understate the +maximum. The sign question is left as an open next question. + +## What this does not prove + +The proper-terminal bill is a rank-bill factor. This package does not prove a +legal cut, an arbitrary-input identity, a native realization, an ordinary +cost, ownership, restoration or a paid-profile improvement. It does not change +the selected exponent. The two-path and three-path cases are not proved; only +the stated finite grids are censused. The sign of an interior maximum with +nonpositive endpoints is not proved. + +## Dependencies + +The rank-bill formula, its zero-to-`D` endpoint theorem and the proper-terminal +question are unpaidmoon's #7283. That package credits CubeJerry's shared-native +helper-split exploration and the two-chain word from DreamingOfClouds in #6902. +No part of #7283 is replayed or re-audited here. This package was produced by Nick Petalas. +Apache-2.0. diff --git a/research/proper-terminal-helper-rank-bill/README.md b/research/proper-terminal-helper-rank-bill/README.md new file mode 100644 index 0000000000..f94441cb37 --- /dev/null +++ b/research/proper-terminal-helper-rank-bill/README.md @@ -0,0 +1,144 @@ +# A proper helper terminal and the rank bill + +**Proof with an exact finite counterexample. No new κ.** The selected +conditional exponent stays `363005817/100000000000`. No word is emitted, no cut +is declared legal, and no ordinary or paid bill is priced. + +## Result + +Fix a real exponent `0 < t < 1`, integers `0 < T < D`, and `m ≥ 1` +contact-free paths `0 ≤ a_i ≤ b_i ≤ D`. The helper boundary now runs from `0` +to the proper terminal `T`, so the rank bill of a cut at dimension `x` is + +```text +G(x) = x^t + (T-x)^t - T^t + - Σ_i ( (x-a_i)^t + (b_i-x)^t - (b_i-a_i)^t ), +``` + +with `0^t = 0`. This is the formula of +[#7283](../helper-split-endpoint-rank-bill/PROOF.md) with `D` replaced by the +terminal `T`. A path with `b_i > T` leaves the boundary. The feasible interval +is `[A, B]` with `A = max a_i` and `B = min(T, min b_i)`. + +**Theorem 1 (one crossing path).** If `m = 1` and `b > T`, then `G` is strictly +decreasing on `[a, T]`. Its maximum is `G(a)`. If moreover `a = 0`, then +`G(0) = 0` and `G(x) < 0` for every `x ∈ (0, T)`. + +So the answer to the first step of the #7283 open question is: for one path that +leaves the boundary, the endpoint maximum survives, and the only candidate +dimension is the path's own lower endpoint. + +**Proposition 2 (the terminal is never a positive bill).** For every `m` and +every path with `a_i ≤ T ≤ b_i`, `G(T) ≤ 0`, with equality exactly when `T` is +an endpoint of every path. + +**Proposition 3 (no path starts inside the boundary).** If every `a_i = 0` and +at least one path crosses the terminal (`b_i > T`), then `G(x) < 0` for every +`x ∈ (0, T)` and every `m ≥ 1`. No number of boundary-crossing paths makes a +proper interior cut profitable in this first-order sense. + +**Proposition 4 (the endpoint maximum fails for four crossing paths).** At +`t = 1/2`, `D = 26`, `T = 24` and paths + +```text +(3, 25), (17, 26), (0, 25), (6, 25), +``` + +the interior dimension `x0 = 3819/160 = 23.86875` satisfies + +```text +G(17) = -3.747477... < G(x0) = -3.554274... +G(24) = -3.734846... < G(x0). +``` + +The comparisons `G(17) < G(x0)` and `G(24) < G(x0)` are certified with exact +integer square-root arithmetic, not floating point. At this witness both +endpoint values are lower than the interior value, so the endpoint maximum of +#7283 does not survive a proper terminal once four paths cross the terminal. + +The counterexample does not make the interior bill positive: it shows that the +endpoint comparison alone can understate the maximum, not that a gain exists. +Whether a positive proper-terminal bill can appear away from `A` is left open; +see Open next questions. + +## Evidence classes + +1. **Written proof.** Lemmas 1-3 and Theorem 1 in [PROOF.md](PROOF.md), for + every real `0 < t < 1`, every integer `0 < T < D` and every `m ≥ 1`. +2. **Exact finite certificate.** Proposition 4 is one exact instance at + `t = 1/2`. The verifier compares sums of integer square roots with a + certified truncation whose error is strictly less than one unit per term. +3. **Exhaustive finite censuses**, only on the domains named in + [VERIFY.json](VERIFY.json): the one-path decrease on a rational grid for + `D ≤ 10`; the zero-start negativity for `D ≤ 8` and `m ≤ 3`; the terminal + sign for `D ≤ 8` and `m ≤ 2`; and the absence of an interior win for two or + three crossing paths on the stated grids (`D ≤ 8` for two paths, `D ≤ 7` for + three). A census is not a proof for larger parameters and is not used as + one. +4. **Control rejections.** The verifier rejects a flipped endpoint comparison, + a one-path decrease claim applied to the four-path witness, and a positive + terminal bill. + +A failed or absent search is not used anywhere in this package. + +## Scope and connection + +Card `p104-side-correction`, priority revision 8, base commit +`e54523517d0f03e58352e647c403a5af3e525a57`, selected record unchanged. +Scope status: **changed**. The card asks whether a legal causal split improves +the complete P104 invoice. This package answers one boundary case of the +rank-bill factor that #7283 explicitly left open. It prices only the rank-bill +term `G`. Legality, ownership, ordinary cost and any target/paid invoice remain +where the selected record left them. + +## Reproduce + +From the repository root, CPython 3.12, standard library: + +```sh +python3.12 -B research/proper-terminal-helper-rank-bill/verify.py +python3.12 -O -B research/proper-terminal-helper-rank-bill/verify.py +python3.12 -B scripts/research_package.py --package research/proper-terminal-helper-rank-bill +``` + +The direct verifier prints + +```text +PASS_PROPER_TERMINAL_HELPER_RANK_BILL ... +``` + +Proof checks raise `SystemExit` rather than using `assert`, including under +`python -O`. + +## Open next questions + +- **Can a positive proper-terminal bill appear away from the endpoints?** The + four-path witness has an interior maximum that is still negative. A search + over four million random integer configurations with `D ≤ 24`, `m ≤ 8` and + `t ∈ {1/2, 1/3, 2/3, 1/4, 3/4, 1/5, 2/5, 3/5, 4/5}` found no case with both + endpoint values nonpositive and an interior value above zero. That search is + floating-point evidence, not a proof and not part of the verifier. The + smallest next step is to fix `m = 4` and ask for the exact sign structure of + the unique interior critical point, or to prove the sign claim by a + maximum-principle argument on the tent decomposition in PROOF.md. +- **Which crossing count is the threshold?** Theorem 1 proves one path. The + verifier finds no interior win for two paths with `D ≤ 8` or three paths with + `D ≤ 7` on the stated grids, and Proposition 4 gives four paths. Resolving + `m = 2` and `m = 3` for all `D` would make the threshold exact. +- **Does a proper terminal help any actual helper?** Evaluate `G` at the two + endpoints for one pinned helper of the published 68-split word whose terminal + is proper, and compare with the zero-to-`D` certificate. A positive value + would still need legality, ownership and the paid profile. + +## Credit + +The rank-bill formula, the zero-to-`D` endpoint theorem, the one-path +normalization and this open question are unpaidmoon's [#7283]. That package +credits CubeJerry's shared-native helper-split exploration and the two-chain +word from DreamingOfClouds in #6902. The present package adds the proper +terminal case, the crossing-path theorem, the zero-start proposition and the +four-path counterexample. Nothing from #7283 is replayed or re-audited. + +This package was produced by Nick Petalas. Apache-2.0. + +[#7283]: https://github.com/CrocSwap/integer-mult-bounds/pull/7283 diff --git a/research/proper-terminal-helper-rank-bill/SOURCES.json b/research/proper-terminal-helper-rank-bill/SOURCES.json new file mode 100644 index 0000000000..5335fa97d9 --- /dev/null +++ b/research/proper-terminal-helper-rank-bill/SOURCES.json @@ -0,0 +1,18 @@ +{ + "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" + } + ] +} diff --git a/research/proper-terminal-helper-rank-bill/TASK.json b/research/proper-terminal-helper-rank-bill/TASK.json new file mode 100644 index 0000000000..3c16b22fcb --- /dev/null +++ b/research/proper-terminal-helper-rank-bill/TASK.json @@ -0,0 +1,123 @@ +{ + "schema_version": 1, + "task_id": "p104-side-correction", + "priority_revision": 8, + "base_commit": "e54523517d0f03e58352e647c403a5af3e525a57", + "original_card": { + "id": "p104-side-correction", + "question": "Can joint helper bases and a legal causal split improve the complete P104 productive/paid invoice?", + "starting_points": [ + "docs/research/current-priorities.md", + "docs/research/research-family-status.md", + "certificates/selected-result.json", + "docs/research/pr-intake-evidence/pr5599-completion/PROOF-REVIEW.md", + "research/p104-helper-subspace-splits/README.md", + "research/dyadic-helper-channel-capacity/README.md" + ], + "methods": [ + "Construct and independently check one source-bound instance of the stated first experiment.", + "Seek an exact counterexample or target-specific complete-budget obstruction to that same proposed change." + ], + "acceptance_gate": "An exact arbitrary-input identity, source/target frame availability and restoration at the chosen cut, plus the complete channel+correction+idle/hosting bill or an explicit favorable bound. The native channel alone is not a supplier. A scoped local result may be retained without a complete supplier. Expanding it into further construction rounds requires the family-level budget and obligation gate in research-family-status.md; an optimistic passing relaxation alone is not acceptance.", + "first_step": { + "command": [ + "python3", + "-B", + "scripts/research_selected_baseline.py" + ], + "expected": "PASS_RESEARCH_BASELINE_BINDINGS_ONLY", + "inspect": "Read revision 8, the selected review and live exact-source handoffs. Then follow this card's bounded first_experiment.", + "scope": "Source-bound orientation only, not a supplier replay or theorem proof." + }, + "first_experiment": "Start with the selected #5599 emitted word and review pending #5718 distinct input/output bases plus #5717/#5719 coverage before claiming work. Pick one uncovered source word, helper group and cut region. Prove the arbitrary-input relation and legal entry/exit corrections, then compare full target and paid profiles. Reject if completion, owned lifetimes or consumer costs repay the gain. A static pairing rank alone is not a physical split.", + "bottleneck_link": "Judge the actual current supplier contract and complete signed target/paid bill; frozen-profile ceilings require an applicability proof.", + "allowed_variations": [ + "One exact source head, helper/cut region or quantified proposition and changed hypothesis; check live handoffs first. Different seeds are not different scopes." + ], + "scope_change_triggers": [ + "Changing source head, helper/cut domain, operation alphabet or caller boundary without recording the new scope.", + "Treating an archived proposal or local numerical pass as complete supplier admission." + ], + "overlap_terms": [ + "P104", + "helper basis", + "helper split", + "5718", + "dyadic capacity" + ], + "existing_checks": [ + { + "scope": "PR #4133: literal-slot defect", + "evidence": "research/p104-literal-slot-defect/README.md", + "remaining": "Independently validate the stated scope or change its producer/consumer premise and pay the complete boundary.", + "status": "author-checked", + "source_commit": "88666f1dee93fbd85b31fd5d6f91a219e111b5f4", + "selected_record_sha256": "bb2eaa58647b353f88d0aec2eafb9d30df1be53589231b23e12ceef3e4bad129" + }, + { + "scope": "PR #4136: uniform commutation gap", + "evidence": "research/p104-uniform-commutation-gap/README.md", + "remaining": "Independently validate the stated scope or change its producer/consumer premise and pay the complete boundary.", + "status": "author-checked", + "source_commit": "281ce601a8be9db470de630759179c23e1dfaa88", + "selected_record_sha256": "bb2eaa58647b353f88d0aec2eafb9d30df1be53589231b23e12ceef3e4bad129" + }, + { + "scope": "PR #4140: uniform encoding gap", + "evidence": "research/p104-uniform-encoding-gap/README.md", + "remaining": "Independently validate the stated scope or change its producer/consumer premise and pay the complete boundary.", + "status": "author-checked", + "source_commit": "de25c6525aa866962309df5d107b32d55e6e5628", + "selected_record_sha256": "bb2eaa58647b353f88d0aec2eafb9d30df1be53589231b23e12ceef3e4bad129" + }, + { + "scope": "PR #4153: source-chart shortcut exhausts its optimistic allowance", + "evidence": "research/p104-source-chart-shortcut/README.md", + "remaining": "Independently validate the stated scope or change its producer/consumer premise and pay the complete boundary.", + "status": "author-checked", + "source_commit": "9123241fea53df77e51ffe30d9aca1625d4bf3a8", + "selected_record_sha256": "bb2eaa58647b353f88d0aec2eafb9d30df1be53589231b23e12ceef3e4bad129" + }, + { + "scope": "PR #4154: fiber-tag seam mismatch", + "evidence": "research/p104-fiber-tag-seam/README.md", + "remaining": "Independently validate the stated scope or change its producer/consumer premise and pay the complete boundary.", + "status": "author-checked", + "source_commit": "4ffcdaee5d6255a9cea1fe53a5424435068089d0", + "selected_record_sha256": "bb2eaa58647b353f88d0aec2eafb9d30df1be53589231b23e12ceef3e4bad129" + }, + { + "scope": "Selected PR5599: complete helper-subspace construction and independent caller replay; five framework assumptions remain.", + "evidence": "docs/research/pr-intake-evidence/pr5599-completion/PROOF-REVIEW.md", + "remaining": "The next experiment must identify uncovered source-specific work. Successor archive intake does not transfer this admission.", + "status": "reviewed", + "source_commit": "09dd0965711ca7eeb169057a420abab1c9052137", + "selected_record_sha256": "2a0220e866417774606e0f991e41b9c1d26b1f43b97857238cf478dbc7d330b5" + } + ] + }, + "scope_status": "changed", + "actual_scope": "For a helper boundary with proper terminal 0T gives a strictly decreasing rank bill on [a,T], that the terminal value is nonpositive for every path set, that all paths starting at zero with at least one crossing path give a negative interior bill, and exhibit four crossing paths where an interior dimension beats both endpoints.", + "scope_change_reason": "The card asks whether a legal causal split improves the complete P104 productive/paid invoice. The predecessor #7283 proves the endpoint maximum only for a boundary from dimension 0 to D and leaves the proper terminal open. This package answers that boundary case of the rank-bill factor. It does not emit a cut, price an ordinary bill, or change the selected exponent, so the invoice question stays open.", + "bottleneck_link": "Side result on the rank-bill factor of a helper split. A proper terminal is the remaining geometric case in which a new intermediate chart could change that factor. A positive G is still short of a legal paid-profile improvement.", + "budget_minutes": 60, + "stop_rule": "Stop after the one-path theorem, the terminal and zero-start propositions, the four-path counterexample and the stated finite censuses. Do not search the 68-split word, emit a chart, or rerun frontier7000.", + "outcome": "partial", + "evidence": "PROOF.md is the general argument for 0 err: + return 1 + if -acc > err: + return -1 + if err == 0: + return 0 + if bits > 1 << 16: + fail("sign unresolved: " + repr(terms)) + return sign_sqrt_sum(terms, bits * 4) + + +def power_monotone(max_base, max_q): + """Lemma 1 integer form: 1 <= u <= v implies u^s <= v^s, s = q - p.""" + checked = 0 + for q in range(2, max_q + 1): + for p in range(1, q): + s = q - p + for u in range(1, max_base + 1): + previous = u ** s + for v in range(u, max_base + 1): + if previous > v ** s: + fail("power increase failed at u={} v={} s={}".format(u, v, s)) + previous = v ** s + checked += 1 + if not (2 ** s > 1): + fail("strict unit power failed at q={} p={}".format(q, p)) + return checked + + +def g_terms(T, paths, x): + """Terms of G(x) at t = 1/2; x is a Fraction.""" + terms = [ + (1, Fraction(x)), + (1, Fraction(T - x)), + (-1, Fraction(T)), + ] + for a, b in paths: + terms.append((-1, Fraction(x - a))) + terms.append((-1, Fraction(b - x))) + terms.append((1, Fraction(b - a))) + return terms + + +def g_sign(T, paths, x): + return sign_sqrt_sum(g_terms(T, paths, x)) + + +def g_diff_sign(T, paths, x, y): + """Sign of G(x) - G(y).""" + return sign_sqrt_sum(g_terms(T, paths, x) + + [(-c, r) for c, r in g_terms(T, paths, y)]) + + +def grid(A, B, steps): + """Exact rational grid including both endpoints.""" + return [Fraction(A) + Fraction(B - A) * k / steps for k in range(steps + 1)] + + +def check_structure(D, T, paths): + if not (0 < T < D): + fail("proper terminal violated D={} T={}".format(D, T)) + for a, b in paths: + if not (0 <= a <= b <= D): + fail("path outside ambient space {} {} D={}".format(a, b, D)) + + +def one_path_census_clean(max_d=10, steps=8): + rows = 0 + for D in range(2, max_d + 1): + for T in range(1, D): + for a in range(0, T + 1): + for b in range(T + 1, D + 1): + paths = [(a, b)] + check_structure(D, T, paths) + if a >= T: + continue + xs = grid(a, T, steps) + for x, y in zip(xs, xs[1:]): + if g_diff_sign(T, paths, y, x) >= 0: + fail("one-path decrease failed D={} T={} a={} b={}" + .format(D, T, a, b)) + rows += 1 + if a == 0 and g_sign(T, paths, 0) != 0: + fail("G(0) was not zero") + return rows + + +def zero_start_census(max_d=8, max_m=3, steps=8): + """Lemma 4: all paths start at zero, every interior value is negative.""" + from itertools import combinations_with_replacement + rows = 0 + for D in range(2, max_d + 1): + for T in range(1, D): + ends = list(range(T + 1, D + 1)) + for m in range(1, max_m + 1): + for combo in combinations_with_replacement(ends, m): + paths = [(0, b) for b in combo] + check_structure(D, T, paths) + if g_sign(T, paths, 0) != 0: + fail("G(0) not zero for zero-start paths") + for x in grid(0, T, steps * T)[1:-1]: + if g_sign(T, paths, x) >= 0: + fail("zero-start interior not negative D={} T={} b={}" + .format(D, T, combo)) + rows += 1 + return rows + + +def terminal_census(max_d=8, max_m=2): + """Lemma 3: G(T) <= 0 whenever T lies between the path endpoints.""" + from itertools import combinations_with_replacement + rows = 0 + for D in range(2, max_d + 1): + for T in range(1, D): + types = [(a, b) for a in range(0, T + 1) for b in range(T, D + 1)] + for m in range(1, max_m + 1): + for combo in combinations_with_replacement(types, m): + paths = list(combo) + check_structure(D, T, paths) + if g_sign(T, paths, T) > 0: + fail("positive terminal bill D={} T={} {}".format(D, T, combo)) + rows += 1 + return rows + + +def endpoint_census(m, max_d, steps=8): + """Finite census: no interior point beats both endpoints on this grid.""" + from itertools import combinations_with_replacement + rows = 0 + for D in range(2, max_d + 1): + for T in range(1, D): + types = [(a, b) for a in range(0, T + 1) for b in range(T + 1, D + 1)] + for combo in combinations_with_replacement(types, m): + paths = list(combo) + check_structure(D, T, paths) + A = max(a for a, b in paths) + if A >= T: + continue + for x in grid(A, T, steps)[1:-1]: + if (g_diff_sign(T, paths, x, A) > 0 + and g_diff_sign(T, paths, x, T) > 0): + fail("interior beats both endpoints at m={} D={} T={} x={} paths={}" + .format(m, D, T, x, paths)) + rows += 1 + return rows + + +def counterexample(): + """Proposition: four crossing paths beat both endpoints exactly.""" + D, T = 26, 24 + paths = [(3, 25), (17, 26), (0, 25), (6, 25)] + x0 = Fraction(3819, 160) + A = max(a for a, b in paths) + check_structure(D, T, paths) + if A != 17 or not (A < x0 < T): + fail("counterexample interval changed") + if not all(b > T for _a, b in paths): + fail("counterexample path does not cross the terminal") + if g_diff_sign(T, paths, x0, A) <= 0: + fail("interior did not beat the left endpoint") + if g_diff_sign(T, paths, x0, T) <= 0: + fail("interior did not beat the terminal") + if g_sign(T, paths, x0) >= 0: + fail("counterexample unexpectedly has a nonnegative value") + return D, T, x0 + + +def controls(): + """Reject forged claims adjacent to the proved statements.""" + D, T = 26, 24 + paths = [(3, 25), (17, 26), (0, 25), (6, 25)] + x0 = Fraction(3819, 160) + # 1. A forged claim that the left endpoint wins at the witness. + if g_diff_sign(T, paths, 17, x0) >= 0: + fail("control: forged endpoint win was not rejected") + # 2. Theorem 1 does not apply to four crossing paths: some step increases. + xs = grid(17, T, 32) + if not any(g_diff_sign(T, paths, y, x) > 0 for x, y in zip(xs, xs[1:])): + fail("control: four-path witness was unexpectedly monotone") + # 3. A forged positive terminal claim at a crossing configuration. + if g_sign(T, paths, T) > 0: + fail("control: positive terminal bill was not rejected") + # 4. Lemma 2 is strict for two positive legs. + if sign_sqrt_sum([(1, Fraction(9)), (1, Fraction(16)), (-1, Fraction(25))]) != 1: + fail("control: strict subadditivity failed at 9 and 16") + return 4 + + +def main(): + checked_power = power_monotone(24, 6) + one_path = one_path_census_clean(10, 8) + zero_start = zero_start_census(8, 3, 4) + terminal = terminal_census(8, 2) + two_path = endpoint_census(2, 8, 8) + three_path = endpoint_census(3, 7, 6) + D, T, x0 = counterexample() + rejected = controls() + print( + "{} power_pairs={} one_path={} zero_start={} terminal={} " + "two_path={} three_path={} counterexample=D{},T{},x={} controls={} " + "kappa={} no_new_kappa=true".format( + MARKER, checked_power, one_path, zero_start, terminal, two_path, + three_path, D, T, x0, rejected, KAPPA + ) + ) + + +if __name__ == "__main__": + main()