From a1b1b327a0780b3ec12c4aa02586487c017e1256 Mon Sep 17 00:00:00 2001 From: Nick Petalas Date: Thu, 12 Nov 2026 18:25:38 +0000 Subject: [PATCH] feat(research): reduce mixed recharts to Boolean closure --- research/mixed-rechart-closure/PROOF.md | 146 +++++++++ research/mixed-rechart-closure/README.md | 123 ++++++++ research/mixed-rechart-closure/SOURCES.json | 24 ++ research/mixed-rechart-closure/TASK.json | 130 ++++++++ research/mixed-rechart-closure/VERIFY.json | 34 ++ research/mixed-rechart-closure/verify.py | 331 ++++++++++++++++++++ 6 files changed, 788 insertions(+) create mode 100644 research/mixed-rechart-closure/PROOF.md create mode 100644 research/mixed-rechart-closure/README.md create mode 100644 research/mixed-rechart-closure/SOURCES.json create mode 100644 research/mixed-rechart-closure/TASK.json create mode 100644 research/mixed-rechart-closure/VERIFY.json create mode 100644 research/mixed-rechart-closure/verify.py diff --git a/research/mixed-rechart-closure/PROOF.md b/research/mixed-rechart-closure/PROOF.md new file mode 100644 index 0000000000..64e85b2a32 --- /dev/null +++ b/research/mixed-rechart-closure/PROOF.md @@ -0,0 +1,146 @@ +# Mixed line/hyperplane rechart closure + +This scoped written proof was produced by Nick Petalas. New work is Apache-2.0. +The maximum-closure/min-cut equivalence and distributive-lattice methods are +classical. The new step is the explicit mixed rechart representation and its +linear-price optimization consequence. + +## Contract and theorem + +Let V be a finite-dimensional vector space over any field. Fix a hyperplane H +and a line L with L not contained in H. At each vertex v of a finite directed +graph, an original subspace U_v is given. Every edge u -> v obeys U_u subset U_v. +An allowed replacement at v is any distinct member of + + A_v = U_v intersect H, + U_v, + P_v = A_v + L, + B_v = U_v + L. + +Require replacement subspaces to remain nested on every edge. Any vertices +may be pinned to named allowed options. Zero edge rank gaps are permitted. +The objective is any rational linear combination of vertex dimensions and +edge rank gaps, where the gap is dim(V_v)-dim(V_u). Prices may have either sign. + +**Theorem.** This exact optimization problem reduces to maximum-weight closure +on at most 2N Boolean nodes, at most 4E nesting implications, and at most 2N +fixed Boolean values. It has an exact polynomial-time algorithm, including +infeasibility detection for incompatible pins. No assumption on field +characteristic or on the signs of the prices is needed. + +This is a dimension-linear optimization theorem. It is neither a computation +of the nonlinear P104 power invoice nor a proof of native realization. + +## 1. The local options are Boolean lattices + +If U subset H, the options reduce to A=U and B=U+L, with a single Boolean +choice. If L subset U, they reduce to A=U intersect H and B=U=A+L, again a +single Boolean choice. These two cases cannot overlap because L is transverse. + +Otherwise dim A=dim U-1, P=A+L has dimension dim U, and B=U+L has dimension +dim U+1. U and P are distinct: equality would put L in U. Their intersection +is A and their sum is B. Thus the four options form a Boolean diamond, with +atoms U and P above A. Label these atoms J_1,J_2. A subset S of the two atoms +represents the sum of A and the selected atoms, and + + dim V(S) = dim A + |S|. + +The single-choice case has one atom J_1=B and the same formula. Each local +lattice is therefore represented by one or two independent bits. Inclusion +within this lattice is exactly subset inclusion of those bit sets. + +## 2. Nesting becomes implications + +For an original nested edge u -> v, A_u subset A_v and B_u subset B_v. For +an atom J_a at u, consider the allowed options at v that contain J_a. This +set is nonempty because B_v contains J_a. It is closed under intersection, +so has a unique least member, represented by some bit set R(a). + +Require x_(u,a) <= x_(v,b) for each b in R(a). There are at most four such +implications per edge. Equivalently, b lies in R(a) exactly when J_a is not +contained in the option at v with every bit except b set. This gives an +explicit construction using only subspace containment tests. + +These implications are necessary for V_u subset V_v. They are sufficient +because A_u subset A_v, and V_u is spanned by A_u and its selected atoms. +Every selected atom then lies in V_v. This proves exact equivalence, including +edges with equal endpoints. Pinning an option fixes its one or two bits. + +## 3. The objective and cut construction + +Collect all vertex and edge coefficients into rational numbers alpha_v and +a constant C. In particular, an edge coefficient beta adds beta to alpha_v +and subtracts beta from alpha_u. The objective becomes + + C + sum_v alpha_v dim A_v + sum_(v,a) alpha_v x_(v,a). + +Hence it is a maximum-weight closed-set problem. Multiply by a common positive +denominator for an integer network. For a bit of positive weight w, add a +source arc of capacity w. For a bit of negative weight, add a sink arc of +capacity -w. Each implication gets capacity M, where M=1+sum |w|. Forced-one +bits get source arcs of capacity M and forced-zero bits get sink arcs of +capacity M. The source side of a cut is the selected bit set. + +First propagate forced-one bits along implication paths. Reaching a forced-zero +bit certifies infeasibility. Otherwise the propagated set itself is feasible. +A feasible cut has capacity at most sum |w|. Thus every minimum cut avoids +all M-capacity arcs. If W_plus is the sum of positive weights, its weight is +W_plus minus the cut capacity. Restoring the constant gives the exact optimum. +Standard exact max-flow algorithms give polynomial time; rational denominator +clearing has polynomial bit length in the encoded input size. Subspace basis +and containment operations have their usual field-arithmetic cost. This is +not an assertion of polynomial bit cost over an unspecified encoded field. + +## 4. Mixed choices can strictly improve both one-sided optima + +Over F_2^3 let H=, L=, U= and W=. +There is one nesting edge U -> W. Maximize dim(W')-dim(U'). +The original value is 1. Growth-only choices U or U+L, and W or W+L, have +maximum 2. Shrink-only choices U or U intersect H, and W or W intersect H, +also have maximum 2. The mixed choices U'=0 and W'=V give 3. Thus separate +one-sided optima do not bound this mixed family, even on a single nested edge. +This illustrates the optimization distinction; it is not a supplier invoice. + +## 5. Two explicit limits on extension + +**Positive rank need not define a closure family.** In F_2^3 take H=, +L=, U= and W=. +The strict-nesting choices (U,W) and (U,U+L) are both allowed. Their componentwise +intersection is (U,U), which has zero gap. Every family of implication-closed +bit assignments, including auxiliary bits and pins, is closed under intersection +and union, and projection preserves these operations. Consequently exact strict +gap feasibility in this representation cannot always be expressed by implications, +even after adding auxiliary Boolean variables. This does not exclude richer +optimization methods or another encoding that does not preserve these operations. + +**A power price is not dimension-linear.** For 00. Thus the linear reduction +cannot silently substitute the nonlinear power invoice. + +## Sources, scope and obligations + +ToikY PR #7459 at 4f3dc4a40e2a3bee5fc0d6d5dfd7e4e95614fc22 poses mixed growth +and demotion as an untested direction after its common-hyperplane screen. +Its one-sided numerical bound and its #7456/#7454/#7334/#7113 lineage are +credited premises about that work, not replayed or used to prove this theorem. +This proof uses no predecessor executable, invoice, construction or receipt. +David Ganz / Dugongue's merged PR #556 already optimizes binary U/P(U) +frame choices for one oblique projection over F_2, with monotone nonlinear +paid edge prices. It is background on earlier frame cuts. That option family +is different from this four-option lattice and is not generalized here to +nonlinear signed prices. No part of its numerical search is replayed. +The maximum-closure reduction is classical; no literature-wide priority is +claimed. The explicit local lattice and scope examples are the contribution. + +The theorem fixes one transverse line/hyperplane pair, a nesting graph and +linear rank prices. It does not cover arbitrary independent recharts, strict +gap constraints, nonlinear recursive powers or physical execution. A P104 +application still needs a current complete edge inventory, scalar/native +legality, positive productive ranks, endpoint contracts, ownership, dirty +restoration, precision, stock and full fees. No new kappa, admitted supplier, +selected-frontier change or complete multiplication theorem is claimed. diff --git a/research/mixed-rechart-closure/README.md b/research/mixed-rechart-closure/README.md new file mode 100644 index 0000000000..39f04c11ae --- /dev/null +++ b/research/mixed-rechart-closure/README.md @@ -0,0 +1,123 @@ +# Exact mixed rechart optimization with linear rank prices + +This contribution was produced by Nick Petalas. It is a scoped written proof +with exact finite corroboration. For one common hyperplane H and transverse line L, each helper's +allowed subspaces + +```text +U intersect H, U, (U intersect H)+L, U+L +``` + +form a Boolean lattice with one or two bits. On any original nesting graph, +all replacement nesting constraints become at most four implications per edge. +Arbitrary rational dimension-linear signed invoices and fixed endpoint options +therefore reduce exactly to maximum-weight closure on at most two nodes per +helper. The result holds over every field. [PROOF.md](PROOF.md) gives the +representation, objective, min-cut construction and infeasible-pin criterion. + +A sharp small example has original rank gap 1, one-sided growth optimum 2, +one-sided shrinkage optimum 2 and mixed optimum 3. Separate one-sided screens +therefore do not bound the mixed family. Two additional examples explain the +scope: positive productive gaps need not define an implication-closed family, +and nonlinear power prices do not become unary linear bit weights. The latter +does not exclude richer cut constructions with pairwise terms. + +## Evidence and reproduction + +From the repository root with CPython 3.12 and the standard library: + +```sh +/Users/nick/git/integer-mult-bounds/.venv/bin/python3.12 -I -W error -B research/mixed-rechart-closure/verify.py +/Users/nick/git/integer-mult-bounds/.venv/bin/python3.12 -I -W error -O -B research/mixed-rechart-closure/verify.py +/Users/nick/git/integer-mult-bounds/.venv/bin/python3.12 -B scripts/research_package.py --package research/mixed-rechart-closure +/Users/nick/git/integer-mult-bounds/.venv/bin/python3.12 -B scripts/check_research_commit.py --package research/mixed-rechart-closure --check-source-history --check-modes +``` + +Other installations may substitute their CPython 3.12 path. Each registered +command has a 120-second limit. Direct replay prints a generated +`PASS_MIXED_RECHART_CLOSURE` JSON receipt bound by SHA256 to all six package +files. It writes no files and also works in a Git-free export. + +The exhaustive checker generates every subspace of F_2^n for n=2,3,4 and +checks every hyperplane/transverse-line pair and every originally nested edge. +It covers 154 flags, 8,518 local lattices, 63,480 nested edges and 552,408 option +pairs. Direct subspace containment agrees with the compiled implications in +every case. A separate direct enumeration of physical subspace options checks +the min-cut objective on 1,950 signed integer price cases, 548 rational-price +fixed-option cases and 83 graph/cycle cases. Eight invalid-domain controls +require the exact rejection reason. The written proof supplies the universal +claim; these finite computations are corroboration, not proof-kernel acceptance. + +## Sources and overlap + +ToikY [PR #7459](https://github.com/CrocSwap/integer-mult-bounds/pull/7459), +head `4f3dc4a40e2a3bee5fc0d6d5dfd7e4e95614fc22`, leaves mixed growth/demotion +open after its common-hyperplane screen. It supplies the source question and +one-sided motivation. Its #7456/#7454/#7334/#7113 lineage keeps its credit. +No predecessor scientific program, numerical bound or receipt is replayed, +imported or relied on to prove this result. The proof is self-contained. +David Ganz / Dugongue's merged [PR #556](https://github.com/CrocSwap/integer-mult-bounds/pull/556) +already gives a binary frame/projection cut theorem, including monotone +nonlinear paid tariffs. Its two options are U and its oblique projection; +the present four options, mixed growth/demotion and signed linear objective +are different. The new claim is the explicit two-bit representation, rather +than the use of cuts in frame search. Its theorem is pinned as background. +Maximum closure/min-cut and distributive lattices are classical methods; +no literature-wide priority is claimed for them. New work is Apache-2.0. + +The `p104-side-correction` card changes scope to an abstract optimization +interface. [TASK.json](TASK.json) preserves the original card and declares +this side result. [SOURCES.json](SOURCES.json) pins the selected record, +catalogue and prior projection theorem as historical provenance. None is a +scientific runtime input. +Base canonical main is `e54523517d0f03e58352e647c403a5af3e525a57`, priority +revision 8, with selected #7000 unchanged. The contextual picker reports that +the catalogue's older #5599 assessment differs from that selected record. +The source-binding orientation command passed; it is not a selected replay. + +Live open PRs, recent own PRs, handoff claims, local reservations, merged +searches and distinctive main-tree terms were checked. The cached overlap +search had complete remote pagination but omitted 9,979 sparse local notes; +main-tree Git searches supplement that omission. No claim of complete novelty +coverage follows from absence of matches. Related one-sided open work includes +#7459, #7456 and #7454. #7458 tests a different two-plane growth family. + +## Limitations + +This is an enabling scoped proof with no new kappa, physical word, supplier +admission, selected-frontier change or complete multiplication theorem. All +five selected framework assumptions remain. No selected scientific cold replay, +predecessor suite, Lean or Docker run was performed. Independent human and +formal proof-kernel review are unclaimed. + +## Open next questions + +- Can the actual nonlinear signed power invoice be optimized on this mixed + lattice? Start with its paid/productive edge mixed differences. Positive + productive-rank constraints and complete charges remain blockers. +- Does a current P104 public-component inventory have a useful mixed rechart? + First bind the exact word, eligible components, endpoint contracts and every + incident edge. Scalar/native legality, ownership, dirty restoration, + precision and stock must be priced before claiming a supplier improvement. + +Structured next questions are in [TASK.json](TASK.json). The first proved +reduction is the deliverable; no larger construction search is included. + +## Verifier constraints + +All functions are below 60 lines. The checker has no recursion, network, +subprocess, dynamic code loading or output file creation. Subspace domains +stop at dimension four. Graphs have at most eight vertices, sixteen bits, +64 edges and sixteen pins; brute-force assignments are at most 4^8. BFS scans +at most eighteen vertices. Edmonds-Karp uses an explicit vertex/arc-derived +augmentation cap and fails on exhaustion. Mathematical guards use explicit +exceptions and remain enabled under optimization. Normal/optimized warning-strict +replay and source compilation supply the available Python diagnostics. + +Power-of-ten rule 3 deviation: CPython allocates managed integers, Fractions, +containers and queue nodes during this one-shot check. Fixed fixture domains, +sequential processing and the bounds above limit live collections. Package +reads are limited to 128 KiB per file. No fixed-allocation claim is made; a +fixed-allocation runtime would need a separate representation. Rule 9 deviation: +eight local rejection callbacks have fixed targets and exact expected reasons; +all propagate unexpected exceptions. No general callback input is accepted. diff --git a/research/mixed-rechart-closure/SOURCES.json b/research/mixed-rechart-closure/SOURCES.json new file mode 100644 index 0000000000..850f4eedf2 --- /dev/null +++ b/research/mixed-rechart-closure/SOURCES.json @@ -0,0 +1,24 @@ +{ + "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/projection-cut-toolkit/PROJECTION-CUT-THEOREM.md", + "usage": "provenance", + "git_blob": "2e1e3d129399026a804ddf23c0ec7fc48a99d939", + "sha256": "bf647c60a16d8331368f2839224d8036ddc052ea19d4ce35cac9656702c48eab" + } + ] +} diff --git a/research/mixed-rechart-closure/TASK.json b/research/mixed-rechart-closure/TASK.json new file mode 100644 index 0000000000..6006c582c8 --- /dev/null +++ b/research/mixed-rechart-closure/TASK.json @@ -0,0 +1,130 @@ +{ + "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": "Exact maximum-closure reduction for mixed line/hyperplane rechart lattices with dimension-linear signed prices and fixed options.", + "scope_change_reason": "The card seeks a physical helper split. This side result resolves an optimization interface left open by ToikY PR7459, without asserting a literal word or new supplier.", + "bottleneck_link": "Mixed common-direction growth and demotion can escape separate one-sided screens. The reduction removes exponential option enumeration for linear rank prices, while explicitly retaining nonlinear tariffs and positive productive rank as separate obligations.", + "budget_minutes": 60, + "stop_rule": "Ship this first proved reduction and its scope counterexamples; do not expand to a P104 search.", + "outcome": "completed", + "evidence": "PROOF.md and standalone exact binary-space verifier; generated SHA256 receipt on stdout.", + "author": "Nick Petalas", + "ai_assistance": "Independent human and formal proof-kernel review are unclaimed.", + "open_questions": [ + { + "question": "Can the actual nonlinear signed power invoice be optimized on this mixed lattice?", + "why_it_matters": "Dimension-linear prices alone do not decide the complete supplier bill.", + "first_step": "Use the explicit diamond state table to derive the mixed finite differences of one paid and one productive edge.", + "blocked_by": "Concave power prices and positive productive-rank constraints need additional structure." + }, + { + "question": "Does an exact P104 public-component inventory admit a useful mixed rechart?", + "why_it_matters": "The abstract reduction is an enabling result, with no measured supplier gain.", + "first_step": "Bind one current word, eligible component boundaries and complete incident edge inventory before optimizing.", + "blocked_by": "Literal scalar/native legality, endpoint positivity, ownership, restoration and full charges remain unpaid." + } + ], + "source_question": { + "pr": 7459, + "author": "ToikY", + "head": "4f3dc4a40e2a3bee5fc0d6d5dfd7e4e95614fc22", + "url": "https://github.com/CrocSwap/integer-mult-bounds/pull/7459", + "usage": "Question and one-sided model motivation only; no numerical result or executable imported." + } +} diff --git a/research/mixed-rechart-closure/VERIFY.json b/research/mixed-rechart-closure/VERIFY.json new file mode 100644 index 0000000000..50eb9ba287 --- /dev/null +++ b/research/mixed-rechart-closure/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": "Complete binary subspace/flag nesting equivalence, exact closure optima, fixed-option cases and scope counterexamples." + }, + { + "argv": [ + "{python}", + "-I", + "-W", + "error", + "-O", + "-B", + "{package}/verify.py" + ], + "timeout_seconds": 120, + "checks": "Identical exact certificate under optimization; explicit guards remain enabled." + } + ] +} diff --git a/research/mixed-rechart-closure/verify.py b/research/mixed-rechart-closure/verify.py new file mode 100644 index 0000000000..767d7db435 --- /dev/null +++ b/research/mixed-rechart-closure/verify.py @@ -0,0 +1,331 @@ +"""Exact small-space corroboration; the all-field theorem is in PROOF.md.""" +from collections import deque +from fractions import Fraction +from hashlib import sha256 +from itertools import product +import json +from pathlib import Path + + +FILES = ('README.md', 'PROOF.md', 'TASK.json', 'SOURCES.json', 'VERIFY.json', 'verify.py') + + +def need(condition, message): + if not condition: + raise ValueError(message) + + +def contained(left, right): + return left & right == left + + +def dimension(space): + size = space.bit_count() + need(size > 0 and size & (size - 1) == 0, 'non-subspace cardinality') + return size.bit_length() - 1 + + +def add_line(space, line, n): + need(2 <= n <= 4 and 0 < line < 1 << n, 'line domain') + result = space + for vector in range(1 << n): + if space >> vector & 1: + result |= 1 << (vector ^ line) + return result + + +def spaces(n): + need(2 <= n <= 4, 'ambient domain') + found = {1} + for _ in range(n): + previous = tuple(found) + for space in previous: + for line in range(1, 1 << n): + found.add(add_line(space, line, n)) + return tuple(sorted(found)) + + +SPACE_INVENTORIES = ((), (), spaces(2), spaces(3), spaces(4)) + + +def lattice(space, hyperplane, line, n): + need(2 <= n <= 4, 'ambient domain') + need(space in SPACE_INVENTORIES[n] and hyperplane in SPACE_INVENTORIES[n], 'subspace domain') + need(0 < line < 1 << n, 'line domain') + need(dimension(hyperplane) == n - 1, 'hyperplane domain') + need(not hyperplane >> line & 1, 'line must be transverse') + bottom = space & hyperplane + top = add_line(space, line, n) + projected = add_line(bottom, line, n) + choices = set((bottom, space, projected, top)) + need(len(choices) in (2, 4), 'Boolean lattice size') + atoms = (top,) if len(choices) == 2 else tuple(sorted(choices - {bottom, top})) + states = (bottom, top) if len(atoms) == 1 else (bottom, *atoms, top) + need(set(states) == choices, 'choice representation') + for mask, state in enumerate(states): + need(dimension(state) == dimension(bottom) + mask.bit_count(), 'rank modularity') + return states, atoms + + +def implications(left, right): + ls, la = left + rs, ra = right + need(contained(ls[0], rs[0]) and contained(ls[-1], rs[-1]), 'edge boundary') + arcs = [] + for a, atom in enumerate(la): + for b in range(len(ra)): + without_b = rs[((1 << len(ra)) - 1) ^ (1 << b)] + if not contained(atom, without_b): + arcs.append((a, b)) + need(len(arcs) <= 4, 'edge arc bound') + return tuple(arcs) + + +def obeys(left_mask, right_mask, arcs): + return all(not (left_mask >> a & 1) or (right_mask >> b & 1) for a, b in arcs) + + +def compile_graph(originals, hyperplane, line, n, edges): + need(1 <= len(originals) <= 8 and len(edges) <= 64, 'graph capacity') + lattices = tuple(lattice(u, hyperplane, line, n) for u in originals) + offsets = [] + count = 0 + for _, atoms in lattices: + offsets.append(count) + count += len(atoms) + arcs = [] + for u, v in edges: + need(0 <= u < len(originals) and 0 <= v < len(originals), 'edge index') + need(contained(originals[u], originals[v]), 'original nesting') + for a, b in implications(lattices[u], lattices[v]): + arcs.append((offsets[u] + a, offsets[v] + b)) + need(count <= 2 * len(originals) and len(arcs) <= 4 * len(edges), 'graph size') + return lattices, tuple(offsets), tuple(arcs), count + + +def reachable(residual, source): + previous = [-1] * len(residual) + previous[source] = source + queue = deque((source,)) + for _ in range(len(residual)): + if not queue: + break + u = queue.popleft() + for v, capacity in enumerate(residual[u]): + if capacity > 0 and previous[v] < 0: + previous[v] = u + queue.append(v) + need(not queue, 'BFS capacity') + return previous + + +def min_cut(capacities, source, sink): + residual = [row[:] for row in capacities] + value = Fraction(0) + arc_count = sum(x > 0 for row in capacities for x in row) + bound = len(residual) * max(1, 2 * arc_count) + 1 + for _ in range(bound): + previous = reachable(residual, source) + if previous[sink] < 0: + return value, tuple(i for i, p in enumerate(previous) if p >= 0) + path = [] + v = sink + for _ in range(len(residual)): + if v == source: + break + u = previous[v] + need(u >= 0, 'augmenting predecessor') + path.append((u, v)) + v = u + need(v == source and path, 'augmenting path bound') + amount = min(residual[u][v] for u, v in path) + need(amount > 0, 'positive augmentation') + value += amount + for u, v in path: + residual[u][v] -= amount + residual[v][u] += amount + raise ValueError('Edmonds-Karp augmentation bound') + + +def optimize(compiled, weights, pins=()): + lattices, offsets, arcs, count = compiled + need(len(weights) == len(lattices), 'weight count') + need(all(isinstance(w, (int, Fraction)) and abs(w) <= 100 for w in weights), 'weight domain') + need(len(pins) <= 16, 'pin capacity') + bit_weights = tuple(w for w, (_, atoms) in zip(weights, lattices) for _ in atoms) + big = 1 + sum(abs(w) for w in bit_weights) + source, sink = count, count + 1 + capacities = [[Fraction(0) for _ in range(count + 2)] for _ in range(count + 2)] + for bit, weight in enumerate(bit_weights): + capacities[source][bit] += max(0, weight) + capacities[bit][sink] += max(0, -weight) + for a, b in arcs: + capacities[a][b] += big + forced = [] + for vertex, mask in pins: + need(0 <= vertex < len(lattices), 'pin vertex') + need(0 <= mask < len(lattices[vertex][0]), 'pin option') + for a in range(len(lattices[vertex][1])): + bit = offsets[vertex] + a + on = bool(mask >> a & 1) + forced.append((bit, on)) + if on: + capacities[source][bit] += big + else: + capacities[bit][sink] += big + cut, selected = min_cut(capacities, source, sink) + if cut >= big: + return None + chosen = set(selected) + need(all(a not in chosen or b in chosen for a, b in arcs), 'returned nesting') + need(all((a in chosen) == on for a, on in forced), 'returned pins') + baseline = sum(w * dimension(states[0]) for w, (states, _) in zip(weights, lattices)) + return baseline + sum(max(0, w) for w in bit_weights) - cut + + +def brute(compiled, edges, weights, pins=()): + lattices = compiled[0] + best = None + for masks in product(*(range(len(states)) for states, _ in lattices)): + if any(masks[v] != mask for v, mask in pins): + continue + values = tuple(states[mask] for mask, (states, _) in zip(masks, lattices)) + if any(not contained(values[u], values[v]) for u, v in edges): + continue + score = sum(w * dimension(value) for w, value in zip(weights, values)) + best = score if best is None else max(best, score) + return best + + +def check_all_edges(): + counts = dict(flags=0, local_lattices=0, nested_edges=0, option_pairs=0) + for n in range(2, 5): + inventory = spaces(n) + need(len(inventory) == (5, 16, 67)[n - 2], 'complete subspace count') + for normal in range(1, 1 << n): + h = sum(1 << x for x in range(1 << n) if (x & normal).bit_count() % 2 == 0) + for line in range(1, 1 << n): + if h >> line & 1: + continue + counts['flags'] += 1 + tables = tuple(lattice(u, h, line, n) for u in inventory) + counts['local_lattices'] += len(tables) + for u, left in zip(inventory, tables): + for v, right in zip(inventory, tables): + if not contained(u, v): + continue + counts['nested_edges'] += 1 + arcs = implications(left, right) + for a, x in enumerate(left[0]): + for b, y in enumerate(right[0]): + counts['option_pairs'] += 1 + need(contained(x, y) == obeys(a, b, arcs), 'nesting equivalence') + return counts + + +def check_optima(): + counts = dict(price_cases=0, pin_cases=0, graph_cases=0) + for n in (2, 3): + inventory = spaces(n) + h = (1 << (1 << (n - 1))) - 1 + line = 1 << (n - 1) + for u in inventory: + for v in inventory: + if not contained(u, v): + continue + graph = compile_graph((u, v), h, line, n, ((0, 1),)) + for weights in product(range(-2, 3), repeat=2): + need(optimize(graph, weights) == brute(graph, ((0, 1),), weights), 'cut optimum') + counts['price_cases'] += 1 + for a in range(len(graph[0][0][0])): + for b in range(len(graph[0][1][0])): + pins = ((0, a), (1, b)) + weights = (Fraction(-2, 3), Fraction(5, 7)) + need(optimize(graph, weights, pins) == brute(graph, ((0, 1),), weights, pins), 'pinned optimum') + counts['pin_cases'] += 1 + originals = (1, 3, 5, 15) + edges = ((0, 1), (0, 2), (1, 3), (2, 3)) + graph = compile_graph(originals, 15, 4, 3, edges) + for weights in product((-1, 0, 1), repeat=4): + need(optimize(graph, weights) == brute(graph, edges, weights), 'diamond graph optimum') + counts['graph_cases'] += 1 + graph = compile_graph((3, 3, 3), 15, 4, 3, ((0, 1), (1, 2), (2, 0))) + need(optimize(graph, (1, 0, -1), ((0, 0), (2, 1))) is None, 'infeasible cycle pins') + need(optimize(graph, (1, 0, -1), ((0, 0), (2, 0))) == 0, 'feasible cycle pins') + counts['graph_cases'] += 2 + return counts + + +def span(vectors, n=3): + result = 1 + for vector in vectors: + result = add_line(result, vector, n) + return result + + +def check_scope_examples(): + h, line = span((1, 2)), 4 + u, w = span((5,)), span((5, 2)) + graph = compile_graph((u, w), h, line, 3, ((0, 1),)) + need(optimize(graph, (-1, 1)) == 3, 'mixed strict gain') + one_sided = [] + for options in (((u, add_line(u, line, 3)), (w, add_line(w, line, 3))), ((u, u & h), (w, w & h))): + best = max(dimension(y) - dimension(x) for x, y in product(*options) if contained(x, y)) + one_sided.append(best) + need(one_sided == [2, 2] and dimension(w) - dimension(u) == 1, 'one-sided controls') + u, w = span((1,)), span((1, 6)) + graph = compile_graph((u, w), h, line, 3, ((0, 1),)) + options_u, options_w = (x[0] for x in graph[0]) + projected = (w & h) + need(projected == u, 'strict-gap meet fixture') + pairs = ((u, w), (u, add_line(u, line, 3))) + need(all(contained(x, y) and dimension(y) > dimension(x) for x, y in pairs), 'positive gaps') + meet = (pairs[0][0] & pairs[1][0], pairs[0][1] & pairs[1][1]) + need(meet == (u, u), 'positive-gap family not meet-closed') + low = (u, add_line(u, line, 3)) + high = (add_line(u, line, 3), add_line(w, line, 3)) + need(all(x in options_u for x in low) and all(y in options_w for y in high), 'power rectangle options') + gaps = tuple(dimension(y) - dimension(x) for x, y in product(low, high)) + need(gaps == (1, 2, 0, 1), 'nonlinear rectangle') + need(2 < 2 ** 2, 'square-root strict concavity') + return dict(original=1, growth=2, shrinkage=2, mixed=3, strict_gap_meet=0, power_gaps=gaps) + + +def check_rejections(): + controls = ( + ('ambient domain', lambda: spaces(5)), + ('line must be transverse', lambda: lattice(3, 15, 1, 3)), + ('hyperplane domain', lambda: lattice(3, 255, 4, 3)), + ('subspace domain', lambda: lattice(7, 15, 4, 3)), + ('original nesting', lambda: compile_graph((3, 5), 15, 4, 3, ((0, 1),))), + ('graph capacity', lambda: compile_graph((3,) * 9, 15, 4, 3, ())), + ('pin option', lambda: optimize(compile_graph((3,), 15, 4, 3, ()), (1,), ((0, 4),))), + ('weight domain', lambda: optimize(compile_graph((3,), 15, 4, 3, ()), (101,))), + ) + for message, control in controls: + try: + control() + except ValueError as error: + need(str(error) == message, 'wrong rejection cause') + continue + raise ValueError('rejection control accepted') + return len(controls) + + +def receipt(): + root = Path(__file__).resolve().parent + hashes = {} + for name in FILES: + path = root / name + need(path.stat().st_size <= 128 * 1024, 'package file capacity') + hashes[name] = sha256(path.read_bytes()).hexdigest() + return hashes + + +def main(): + result = dict(status='PASS_MIXED_RECHART_CLOSURE', edges=check_all_edges(), optima=check_optima(), examples=check_scope_examples(), rejections=check_rejections(), sha256=receipt()) + print(json.dumps(result, sort_keys=True)) + + +if __name__ == '__main__': + main()