diff --git a/research/permutation-cycle-layout/PROOF.md b/research/permutation-cycle-layout/PROOF.md new file mode 100644 index 0000000000..da61b1883e --- /dev/null +++ b/research/permutation-cycle-layout/PROOF.md @@ -0,0 +1,159 @@ +# Optimal simultaneous column order for a wire permutation + +This contribution was produced by Nick Petalas. Apache-2.0. + +Claim type: scoped written proof. The finite replay corroborates bounded +instances; it is not the universal proof or a proof-kernel certificate. + +## 1. Contract and result + +Let n >= 1, d >= 2 and let pi be a permutation of {0,...,n-1}. +Each site is C^d. The full operator U_pi routes an input site to its +specified destination: + + U_pi[y,x] = product_i [y_(pi(i)) = x_i]. + +Every input and output coordinate is retained. There is no side information, +restriction to a subspace, dirty workspace, scalar phase or discarded output. +Choose one order o of the sites and use it for both input and output columns. +At a cut let A be the sites preceding it, B its complement, and put + + c(A) = |{i in A : pi(i) in B}|. + +There are also c(A) wires from B to A, since pi is a bijection. A fixed-width +matrix-product representation may use different local tensors at different +positions, with scalar boundary bonds. Its peak bond is the largest internal +virtual dimension; define it as one when n=1. + +**Theorem.** The coefficient unfolding across A|B has exactly + + r(A) = d^(2 c(A)) + +nonzero singular values, all with square d^(n-2 c(A)). In the prescribed +order the minimum possible peak bond is max_A r(A), over its prefix cuts. +When the simultaneous order may be chosen arbitrarily, + + min_order min_exact_train peak_bond = 1 if pi is identity, + = d^2 otherwise. + +Consecutive directed cycles attain the optimum. These are algebraic layout +statements. They do not assert that a caller permits that layout, that a +permutation description is available cheaply, or that physical reordering +has zero cost. The fixed-width representation does not invoke the all-width +fixed-table equivalence theorem of zxv's PR #5441. + +## 2. Complete cut spectrum + +Unfold U_pi with rows (y_A,x_A) and columns (y_B,x_B). +There are 2c crossing wires. Index their independent d-valued wire labels +by z. For fixed z, let u_z be the left 0/1 vector imposing the crossing +labels and every equality on an internal A-to-A wire. Define v_z on B +similarly. Orient each label by its original source wire, so that + + H = sum_z u_z v_z^T. + +Different z have disjoint left supports and disjoint right supports: each +crossing label appears in a distinct left physical coordinate and a distinct +right physical coordinate. They therefore give orthogonal nonzero vectors. +There are |A|-c internal A-to-A wires. Each contributes one freely chosen +label after its equality constraint, independently of every other wire. +Consequently + + ||u_z||^2 = d^(|A|-c), + ||v_z||^2 = d^(|B|-c). + +Normalizing these orthogonal vectors gives a singular value decomposition +with d^(2c) equal singular values. Their squares are d^(n-2c). +In particular their sum is d^n, the squared Frobenius norm of U_pi. +This includes empty cuts and c=0. The same disjoint-support factorization +also proves the rank formula over any coefficient field. + +## 3. Exact attaining tensor train + +At each cut carry one d-valued state label for each directed wire whose +endpoints lie on opposite sides of that cut. Thus the virtual space has +dimension d^(2c). For a local tensor at site v, impose these equalities: + +- Every wire present on both adjacent cut frontiers keeps its label. +- The wire with source v has label x_v at its source endpoint. +- The wire with destination v has label y_v at its destination endpoint. +- A self-wire imposes x_v=y_v locally. + +All other tensor entries are zero. Both endpoint frontiers are empty. +Contracting the local tensors sums over every wire label. A full physical +input/output pair has exactly one satisfying assignment if it obeys every +routing equality, and has none otherwise. The contracted coefficient is +therefore precisely U_pi[y,x], with no multiplicative d factor or phase. +This constructs all cut dimensions simultaneously. + +Conversely, at a bond of dimension D the unfolding factors through that +D-dimensional virtual space, so its rank is at most D. Section 2 forces +D >= d^(2c) at every cut. The explicit construction attains every such +lower bound in the prescribed order. It uses standard tensor-network +factorization; no new general factorization principle is claimed. + +## 4. Optimal simultaneous order + +Decompose pi into disjoint directed cycles. Place each cycle consecutively, +in its directed order, and concatenate the cycles. At any prefix, completed +cycles contribute no crossing wires. A cut strictly inside one nontrivial +cycle has exactly one wire from A to B and one from B to A. A cut between +cycles has no crossing wires. Hence the peak is at most d^2, or one when +all cycles are fixed points. The algorithm visits each site once after +validating the permutation. + +For the lower bound, fix any order of a nonidentity permutation and consider +its first moved site v. Every preceding site is a fixed point. The site +pi(v) is another moved site, so it is still on the right. At the cut just +after v, exactly one A-to-B wire leaves, namely the wire from v. There is +at least one further moved site, so this is an internal cut. Section 2 +forces bond at least d^2. Identity routing is a product of local identities +and has peak one. This proves the optimum for all n and d in the contract. + +For the half-swap pi(i)=i+k modulo 2k, natural order has c=k at its middle +cut, giving peak d^(2k). The cycle order + + 0,k,1,k+1,...,k-1,2k-1 + +alternates c=1 and c=0 and has peak exactly d^2. Thus the fixed-order +exponential obstruction from #5441 disappears under this simultaneous +layout change. Its physical legality and cost are a separate question. + +## 5. Approximation consequence and its limit + +Write N=d^n. At a cut of rank r, an arbitrary rank-D approximation to H +has optimal squared relative Frobenius error + + max(0,1-D/r). + +Indeed its squared singular values are N/r, and projection can retain at +most D of them; truncating the displayed decomposition attains the bound. +Unfolding preserves the Frobenius norm. For a physical approximation V, +||V-U_pi||_F^2 <= N ||V-U_pi||_op^2, so cut bond D and operator error +at most epsilon imply D >= (1-epsilon^2)r. This is a necessary condition, +not an attaining operator-norm construction or a joint approximation at +all cuts. The projection argument is inherited classical reasoning, also +used for #5441's two original fixed-order examples. + +## 6. Attribution and scope + +[zxv #5441](https://github.com/CrocSwap/integer-mult-bounds/pull/5441) +provides the repository's physical-column transfer contract, the cut-rank +argument, the half-swap example and the explicit warning that reordering +changes the obstruction. Its native fixture, equivalence algorithm and +scientific verification are cited, not replayed. Its predecessor attribution, +including Krzysztof Wójt #5262, Ali Romman #5352 and Jose Manuel #2250, +remains in that unchanged package. + +Cycle decomposition, operator-Schmidt rank, projection bounds and +matrix-product factorizations are classical. The new repository result is +the complete arbitrary-permutation cut spectrum, its explicit wire-label +train, and the sharp optimum over simultaneous orders, resolving the +algebraic layout subproblem. No global literature priority is claimed. +Nick Petalas #6184 concerns arithmetic chirp phases, a different endpoint; +its formulas and construction are not used here. + +No fixed finite table uniform across all widths, legal physical reordered +caller, native/tape tariff, supplier admission, new kappa or complete +multiplication theorem follows. The selected frontier is unchanged. +Independent human and formal proof-kernel review are unclaimed. diff --git a/research/permutation-cycle-layout/README.md b/research/permutation-cycle-layout/README.md new file mode 100644 index 0000000000..cb20cd7282 --- /dev/null +++ b/research/permutation-cycle-layout/README.md @@ -0,0 +1,153 @@ +# Every wire permutation has an exact cycle layout of peak bond d^2 + +This contribution was produced by Nick Petalas. Apache-2.0. + +Claim type: scoped written proof with exact finite corroboration. +For n sites of equal dimension d >= 2, route source i to destination pi(i). +Use the same column order for the operator's input and output sites. +If c wires leave a prefix, exactly c enter it, and its coefficient unfolding +has rank d^(2c). All its nonzero squared singular values equal d^(n-2c). + +The minimum exact matrix-product peak bond in that order is the largest +of these cut ranks. Optimizing the simultaneous column order gives exactly +one for identity routing and d^2 for every nonidentity permutation. +Consecutive directed cycles attain the optimum with an explicit wire-label +tensor train. [PROOF.md](PROOF.md) proves the statements for every n and d +in the mathematical contract. The executable caps formula/layout inputs +at 64 sites and local dimension 16; materialized trains have smaller caps. + +For the half-swap of 2k sites, the natural order needs peak d^(2k). +The order 0,k,1,k+1,...,k-1,2k-1 has peak d^2. At d=2 and k=2 this +changes the exact representation requirement from 16 to 4. The full cut +spectrum also gives a necessary operator-error bound and a sharp +single-cut relative Frobenius approximation bound, with their scopes +separated in the proof. + +## What this adds + +[zxv #5441](https://github.com/CrocSwap/integer-mult-bounds/pull/5441) +supplies the physical-column transfer contract, cut-rank method and +fixed-order half-swap obstruction, and explicitly leaves column reordering +as an escape. This package determines the algebraic optimum under +unrestricted simultaneous reordering and constructs the attaining train. +It does not replay the predecessor's verifier or audit its result. +Classical cycle decomposition, operator-Schmidt rank and tensor-network +factorization retain their credit. Global literature priority is unclaimed. + +The card `formal-interface-lemma` is explicitly changed to this algebraic +side result. It can prevent a fixed-order lower bound from being treated as +a representation-independent routing obstruction. It does not establish +that a physical caller permits this order or pays less for it. Site-dependent +fixed-width tensors do not automatically form a fixed finite transfer table +uniform across widths. No supplier admission, new kappa or complete +multiplication theorem is claimed, and the selected frontier is unchanged. + +## Exact finite evidence and reproduction + +From the worktree root, with the standard library of CPython 3.12: + +```sh +/Users/nick/git/integer-mult-bounds/.venv/bin/python3.12 -W error -B research/permutation-cycle-layout/verify.py +/Users/nick/git/integer-mult-bounds/.venv/bin/python3.12 -W error -O -B research/permutation-cycle-layout/verify.py +/Users/nick/git/integer-mult-bounds/.venv/bin/python3.12 -B scripts/research_package.py --package research/permutation-cycle-layout +/Users/nick/git/integer-mult-bounds/.venv/bin/python3.12 -B scripts/check_research_commit.py --package research/permutation-cycle-layout --check-source-history --check-modes +``` + +Another CPython 3.12 path may replace the absolute interpreter path. +Expected markers are `PASS_PERMUTATION_CYCLE_LAYOUT`, +`PASS_REGISTERED_RESEARCH_PACKAGE` and `PASS_RESEARCH_COMMIT_BYTES`. +The direct verifier emits its actual counters, interpreter version and +SHA256 hashes of all seven package files. It writes no files and needs +neither Git nor predecessor files. Receipts are generated by execution. + +The exact replay checks: + +- 11,680 literal coefficient unfoldings containing 694,400 nonzero entries, + and 164,014 stored Gram entries. It constructs the full routed basis + entries for every binary permutation through six sites and every ternary + permutation through four sites, in natural and cycle orders when distinct. + The exact identities G^2=lambda G and trace(G)=lambda*r certify the + complete proposed spectrum, since G=H H^T is positive semidefinite. +- All 5,913 permutations through seven sites. An independent subset dynamic + program represents every column order, using 695,482 prefix subsets + and 2,406,609 transitions. Its optimum agrees with the constructed order. + This is exhaustive dynamic programming, not literal listing of every order. +- 64 explicit trains and 17,047 contracted physical entries. Complete small + matrices are compared with literal routing; two six-site half-swap trains + use every input with its correct output and one incorrect output. +- Thirteen invalid-input rejections and seven semantic controls covering + ordering, crossing directions, singular values, a missing local factor, + absolute phase and routing orientation. + +Finite checks corroborate the written theorem. No numerical tolerance, +Monte Carlo, predecessor execution, selected cold replay, Lean or Docker +run is required or supplied. Independent human and formal proof-kernel +review are unclaimed. + +## Sources and overlap coverage + +Canonical base is e54523517d0f03e58352e647c403a5af3e525a57, priority +revision 8, selected #7000. [SOURCES.json](SOURCES.json) binds the exact +predecessor notes and orientation documents as historical provenance. +There are no live external scientific inputs or imported predecessor code. +The current selected metadata orientation passed; the catalogue's #5599 +assessment predates selected #7000 and is not used as a scientific limit. + +Live open PR bodies and Discussions were searched with the overlap helper, +plus the latest handoffs, all-state recent account bodies, merged PR searches +and all-main README searches for permutation bonds, wire crossings, cycle +layouts and reordering. The helper's sparse local note inventory was +incomplete. Its separate closed-PR bulk refresh timed out, so focused +merged searches and the direct all-state account query supplement it. +No exhaustive historical-diff or unpublished-work coverage is claimed. +The [advance claim](https://github.com/CrocSwap/integer-mult-bounds/discussions/1166#discussioncomment-19595275) +records the bounded scope. Nick Petalas #6184 is an older different-endpoint +chirp-spectrum result; its construction and formulas are not used here. +The unchanged #5441 source retains its full predecessor attribution. + +## Open next questions + +Structured questions, relevance and blockers are in [TASK.json](TASK.json). + +1. Which actual caller permits a cycle order on both input and output sites? + Bind its requested wire permutation and complete bank layout, then price + preparation and restoration of that layout. The layout permission and + physical movement cost are currently missing. +2. Can one useful restricted permutation family be represented by a fixed + transfer table in its legal order, uniformly across widths? Start with + adjacent paired swaps after interleaving and declare the schedule state. + The present position-dependent trains do not establish that contract. +3. How does the optimum change with retained side information or unequal + site dimensions? First specify which input and output coordinates remain + demanded; the disjoint crossing-label argument then needs a new endpoint + and dimension calculation. + +## Verifier resource contract + +New code uses no recursion, subprocesses, network, dynamic evaluation or +optional dependencies. All functions are shorter than 60 lines. Formula +inputs are capped at 64 sites and dimension 16. Materialization is capped +at six sites and 64 virtual labels per cut. Literal spectra use at most +81 routed basis inputs and a smaller-side unfolding with at most 81 rows. +The subset verifier caps n at seven. Boundary validation rejects malformed +permutations, orders and unsupported dimensions. Checks use explicit +exceptions and remain active under optimized Python. + +Power of Ten rule 3 has a managed-runtime deviation in routing.py and +verify.py: Python allocates integers and containers during exact arithmetic. +The explicit train has at most six local tables, each with at most 256 +physical pairs and 64*64 scalar entries. One train is retained at a time. +The verifier's matrices have at most 81 nonzero endpoint entries, and the +subset program has at most 128 states per permutation. Layout arithmetic +has integers no larger than 16^64. File hashing reads only seven fixed local +files. These bounds and rejection controls constrain live allocations; +platform allocator behavior is not instrumented. Any interface expansion +must set new caps and recheck this resource contract first. + +Power of Ten rule 9 has a bounded-dispatch deviation in verify.py: main +calls four explicitly listed verification functions, and the rejection helper +accepts only three listed boundary-check targets in this closed verifier. +These seven fixed targets have no recursive call paths. The registered warning-strict +normal and optimized runs exercise every target. No generic Python static +analyzer is configured for this isolated package; repository metadata, +publication preflight and these two executions are the recurring checks. diff --git a/research/permutation-cycle-layout/SOURCES.json b/research/permutation-cycle-layout/SOURCES.json new file mode 100644 index 0000000000..b2695fe4e2 --- /dev/null +++ b/research/permutation-cycle-layout/SOURCES.json @@ -0,0 +1,30 @@ +{ + "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/finite-memory-lifting/README.md", + "usage": "provenance", + "git_blob": "5ce4fa86af1d5487f9a639acdc9fa0177c76c192", + "sha256": "ca0be421d5cb1835a8814685907db78a7a3ea24b7e1e474f3038c87b0e46498e" + }, + { + "path": "research/finite-memory-lifting/PROOF.md", + "usage": "provenance", + "git_blob": "36152f9e31555a88ce3636ae59abf07a8058d78d", + "sha256": "de4a6b79d480d7718b3d157d2be73b4f45723ccac6719160dd815f8cef40356b" + } + ] +} diff --git a/research/permutation-cycle-layout/TASK.json b/research/permutation-cycle-layout/TASK.json new file mode 100644 index 0000000000..2500eee156 --- /dev/null +++ b/research/permutation-cycle-layout/TASK.json @@ -0,0 +1,107 @@ +{ + "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": "Determine the exact cut spectrum and minimum peak tensor-train bond of every equal-dimension wire permutation under arbitrary simultaneous input/output column ordering.", + "scope_change_reason": "The source PR5441 explicitly leaves reordering as an escape from its routing obstruction. This is a written algebraic layout theorem with finite exact corroboration, rather than a proof-assistant audit of the selected construction.", + "bottleneck_link": "Side result for routing interfaces: distinguish a fixed-order cut obstruction from one that survives permissible column layout changes. Physical legality and the complete cost remain open.", + "budget_minutes": 60, + "stop_rule": "Stop at the first verified optimal layout theorem; leave physical caller binding, uniform tables and side information as open questions.", + "outcome": "completed", + "evidence": "PROOF.md proves the all-n,d theorem. verify.py independently constructs literal coefficient Gram certificates, exhaustive prefix-set optima and explicit tensor-train contractions, with rejecting controls.", + "author": "Nick Petalas", + "ai_assistance": "Independent human and formal proof-kernel review are unclaimed.", + "open_questions": [ + { + "question": "Which actual caller permits this cycle order on both input and output sites?", + "why_it_matters": "Only a permitted and fully priced bank layout can turn the representation saving into a physical benefit.", + "first_step": "Pin one caller permutation and every bank endpoint, then price both reorder preparation and restoration.", + "blocked_by": "No source-bound caller layout permission or physical movement invoice is supplied." + }, + { + "question": "Which useful restricted family admits one fixed finite transfer table uniformly across widths?", + "why_it_matters": "Position-dependent fixed-width trains do not inherit the predecessor all-width equivalence cutoff.", + "first_step": "Specify the two-position schedule for adjacent paired swaps after interleaving and account for its schedule state.", + "blocked_by": "A fixed table, its complete boundary contract and legal physical order remain unspecified." + }, + { + "question": "What is the correct optimum with retained side information or unequal site dimensions?", + "why_it_matters": "The present bound assumes every equal-dimension source and destination coordinate is demanded independently.", + "first_step": "Declare the retained and omitted endpoint coordinates, then derive the new crossing-label spaces.", + "blocked_by": "A different endpoint and dimension contract is needed before reusing the proof." + } + ] +} diff --git a/research/permutation-cycle-layout/VERIFY.json b/research/permutation-cycle-layout/VERIFY.json new file mode 100644 index 0000000000..38618f8bbe --- /dev/null +++ b/research/permutation-cycle-layout/VERIFY.json @@ -0,0 +1,32 @@ +{ + "schema_version": 1, + "status": "ready", + "python": "3.12", + "requirements": [], + "inputs": [], + "commands": [ + { + "argv": [ + "{python}", + "-W", + "error", + "-B", + "{package}/verify.py" + ], + "timeout_seconds": 120, + "checks": "Complete literal cut spectra, exhaustive subset-order optima, tensor-train endpoints and invalid/semantic controls" + }, + { + "argv": [ + "{python}", + "-W", + "error", + "-O", + "-B", + "{package}/verify.py" + ], + "timeout_seconds": 120, + "checks": "Complete literal cut spectra, exhaustive subset-order optima, tensor-train endpoints and invalid/semantic controls under optimized Python" + } + ] +} diff --git a/research/permutation-cycle-layout/routing.py b/research/permutation-cycle-layout/routing.py new file mode 100644 index 0000000000..483a70f6f2 --- /dev/null +++ b/research/permutation-cycle-layout/routing.py @@ -0,0 +1,127 @@ +"""Exact fixed-width wire-permutation tensor trains. Apache-2.0.""" + +from itertools import product + +MAX_SITES = 64 +MAX_LOCAL_DIMENSION = 16 +MAX_EXPLICIT_SITES = 6 +MAX_EXPLICIT_STATES = 64 + + +def check_permutation(permutation): + """Validate the bounded source-to-destination permutation interface.""" + n = len(permutation) + if not 1 <= n <= MAX_SITES: + raise ValueError("site count must be in 1..64") + if any(type(v) is not int for v in permutation): + raise ValueError("site labels must be integers") + if sorted(permutation) != list(range(n)): + raise ValueError("not a permutation of the site labels") + + +def check_layout(permutation, order, dimension): + check_permutation(permutation) + if type(dimension) is not int or not 2 <= dimension <= MAX_LOCAL_DIMENSION: + raise ValueError("local dimension must be in 2..16") + if len(order) != len(permutation) or any(type(v) is not int for v in order): + raise ValueError("invalid simultaneous column order") + if sorted(order) != list(range(len(permutation))): + raise ValueError("column order must permute the site labels") + + +def cycle_order(permutation): + """List disjoint directed cycles consecutively, in their directed order.""" + check_permutation(permutation) + n = len(permutation) + seen = [False] * n + order = [] + for start in range(n): + if seen[start]: + continue + site = start + for _ in range(n): + if seen[site]: + break + seen[site] = True + order.append(site) + site = permutation[site] + if site != start: + raise RuntimeError("cycle traversal did not close") + if len(order) != n: + raise RuntimeError("cycle order omitted a site") + return tuple(order) + + +def cut_profile(permutation, order, dimension): + """Return outgoing-wire counts and predicted exact bonds, including ends.""" + check_layout(permutation, order, dimension) + left = set() + counts = [0] + for site in order: + left.add(site) + counts.append(sum(permutation[v] not in left for v in left)) + return tuple(counts), tuple(dimension ** (2 * c) for c in counts) + + +def wire_frontiers(permutation, order, dimension): + """The state at a cut labels every directed wire crossing that cut.""" + check_layout(permutation, order, dimension) + left = set() + frontiers = [()] + for site in order: + left.add(site) + frontiers.append(tuple(i for i, j in enumerate(permutation) + if (i in left) != (j in left))) + return tuple(frontiers) + + +def local_factor(permutation, site, left, right, before, after, x, y): + """One 0/1 tensor entry; local physical indices are input x and output y.""" + old = dict(zip(left, before, strict=True)) + new = dict(zip(right, after, strict=True)) + for edge, destination in enumerate(permutation): + values = [] + if edge in old: + values.append(old[edge]) + if edge in new: + values.append(new[edge]) + if edge == site: + values.append(x) + if destination == site: + values.append(y) + if values and any(value != values[0] for value in values): + return 0 + return 1 + + +def make_train(permutation, order, dimension): + """Materialize a bounded fixed-width train, with both endpoint bonds one.""" + check_layout(permutation, order, dimension) + if len(permutation) > MAX_EXPLICIT_SITES: + raise ValueError("explicit train limited to six sites") + frontiers = wire_frontiers(permutation, order, dimension) + if any(dimension ** len(f) > MAX_EXPLICIT_STATES for f in frontiers): + raise ValueError("explicit virtual state cap exceeded") + states = [tuple(product(range(dimension), repeat=len(f))) for f in frontiers] + train = [] + for step, site in enumerate(order): + tables = {} + for y, x in product(range(dimension), repeat=2): + tables[y, x] = tuple(tuple(local_factor( + permutation, site, frontiers[step], frontiers[step + 1], + before, after, x, y) for after in states[step + 1]) + for before in states[step]) + train.append(tables) + return tuple(train) + + +def train_entry(train, order, x, y): + """Contract supplied local matrices, without using the routing formula.""" + row = (1,) + for tables, site in zip(train, order, strict=True): + matrix = tables[y[site], x[site]] + row = tuple(sum(a * b for a, b in zip(row, column, strict=True)) + for column in zip(*matrix, strict=True)) + if len(row) != 1: + raise ValueError("tensor train has an open right endpoint") + return row[0] diff --git a/research/permutation-cycle-layout/verify.py b/research/permutation-cycle-layout/verify.py new file mode 100644 index 0000000000..ee2bca00ef --- /dev/null +++ b/research/permutation-cycle-layout/verify.py @@ -0,0 +1,249 @@ +"""Bounded exact corroboration of permutation-cycle-layout. Apache-2.0.""" + +import hashlib +import json +from itertools import permutations, product +from pathlib import Path +import platform +import sys + +from routing import (check_layout, check_permutation, cut_profile, cycle_order, + make_train, train_entry, wire_frontiers) + + +def require(condition, message): + if not condition: + raise ArithmeticError(message) + + +def literal_output(permutation, x): + y = [0] * len(permutation) + for source, destination in enumerate(permutation): + y[destination] = x[source] + return tuple(y) + + +def pair_code(order, x, y, dimension): + value = 0 + for site in order: + value = value * dimension * dimension + y[site] * dimension + x[site] + return value + + +def literal_unfolding(permutation, order, cut, dimension): + """Enumerate all nonzero entries of the full literal permutation matrix.""" + rows = {} + n = len(permutation) + require(n <= 6 and dimension ** n <= 81, "literal matrix capacity") + left, right = order[:cut], order[cut:] + if len(left) > len(right): + left, right = right, left + for x in product(range(dimension), repeat=n): + y = literal_output(permutation, x) + row = pair_code(left, x, y, dimension) + column = pair_code(right, x, y, dimension) + entries = rows.setdefault(row, {}) + require(column not in entries, "duplicate physical matrix entry") + entries[column] = 1 + return rows + + +def literal_gram(rows): + """Construct H H^T by joining literal columns, without a rank formula.""" + columns = {} + for row, entries in rows.items(): + for column, value in entries.items(): + columns.setdefault(column, []).append((row, value)) + gram = {row: {} for row in rows} + for entries in columns.values(): + for row, a in entries: + for column, b in entries: + gram[row][column] = gram[row].get(column, 0) + a * b + return gram + + +def multiply_sparse(a, b): + result = {row: {} for row in a} + for row, entries in a.items(): + for middle, value in entries.items(): + for column, other in b[middle].items(): + result[row][column] = result[row].get(column, 0) + value * other + return result + + +def valid_flat_spectrum(gram, eigenvalue, rank): + square = multiply_sparse(gram, gram) + expected = {i: {j: eigenvalue * value for j, value in row.items()} + for i, row in gram.items()} + trace = sum(row.get(i, 0) for i, row in gram.items()) + return square == expected and trace == eigenvalue * rank + + +def verify_spectra(): + cases = entries = gram_entries = 0 + for dimension, max_sites in ((2, 6), (3, 4)): + for n in range(1, max_sites + 1): + for permutation in permutations(range(n)): + natural = tuple(range(n)) + orders = tuple(dict.fromkeys((natural, cycle_order(permutation)))) + for order in orders: + counts, bonds = cut_profile(permutation, order, dimension) + for cut in range(n + 1): + h = literal_unfolding(permutation, order, cut, dimension) + gram = literal_gram(h) + sides = set(order[:cut]) + crossing = sum((i in sides) != (j in sides) + for i, j in enumerate(permutation)) + rank = dimension ** crossing + eigenvalue = dimension ** (n - crossing) + require(crossing == 2 * counts[cut], "unbalanced wires") + require(bonds[cut] == rank, "wrong predicted bond") + require(valid_flat_spectrum(gram, eigenvalue, rank), + "literal spectrum certificate failed") + cases += 1 + entries += sum(len(row) for row in h.values()) + gram_entries += sum(len(row) for row in gram.values()) + return {"literal_unfoldings": cases, "literal_nonzero_entries": entries, + "literal_gram_entries": gram_entries} + + +def subset_optimum(permutation): + """Dynamic program over every prefix set, independently of cycle layout.""" + n = len(permutation) + count = 1 << n + costs = [sum(bool(mask & (1 << i)) and not bool(mask & (1 << j)) + for i, j in enumerate(permutation)) for mask in range(count)] + best = [n] * count + best[0] = 0 + transitions = 0 + for mask in range(1, count): + predecessor = n + for site in range(n): + if mask & (1 << site): + predecessor = min(predecessor, best[mask ^ (1 << site)]) + transitions += 1 + best[mask] = max(costs[mask], predecessor) + return best[-1], count, transitions + + +def verify_all_layouts(): + cases = subsets = transitions = 0 + for n in range(1, 8): + natural = tuple(range(n)) + for permutation in permutations(range(n)): + optimum, states, edges = subset_optimum(permutation) + order = cycle_order(permutation) + profile, _ = cut_profile(permutation, order, 2) + frontier = wire_frontiers(permutation, order, 2) + expected = int(permutation != natural) + require(optimum == expected == max(profile), "nonoptimal cycle layout") + require(all(len(f) == 2 * c for f, c in zip(frontier, profile, strict=True)), + "frontier does not realize the claimed dimensions") + cases += 1 + subsets += states + transitions += edges + return {"permutations_with_all_order_optimum": cases, + "prefix_subsets": subsets, "subset_transitions": transitions} + + +def check_train(permutation, order, dimension, complete): + train = make_train(permutation, order, dimension) + n = len(permutation) + basis = tuple(product(range(dimension), repeat=n)) + count = 0 + for x in basis: + target = literal_output(permutation, x) + if complete: + outputs = basis + else: + wrong = ((target[0] + 1) % dimension,) + target[1:] + outputs = (target, wrong) + for y in outputs: + actual = train_entry(train, order, x, y) + require(actual == int(y == target), "tensor train differs from endpoint") + count += 1 + return count + + +def verify_trains(): + cases = entries = 0 + for dimension, max_sites in ((2, 4), (3, 3)): + for n in range(1, max_sites + 1): + natural = tuple(range(n)) + for permutation in permutations(range(n)): + orders = tuple(dict.fromkeys((natural, cycle_order(permutation)))) + for order in orders: + entries += check_train(permutation, order, dimension, True) + cases += 1 + swap = (3, 4, 5, 0, 1, 2) + for order in (tuple(range(6)), cycle_order(swap)): + entries += check_train(swap, order, 2, False) + cases += 1 + return {"explicit_trains": cases, "contracted_physical_entries": entries} + + +def expect_rejection(function, *args): + try: + function(*args) + except ValueError: + return 1 + raise ArithmeticError("invalid input was accepted") + + +def verify_controls(): + rejected = 0 + for permutation in ((), (0, 0), (1, 2), (False, 1), tuple(range(65))): + rejected += expect_rejection(check_permutation, permutation) + for order, d in (((0,), 2), ((0, 0), 2), ((True, 0), 2), ((1, 0), 1), + ((1, 0), 17), ((1, 0), True)): + rejected += expect_rejection(check_layout, (1, 0), order, d) + rejected += expect_rejection(make_train, tuple(range(7)), tuple(range(7)), 2) + rejected += expect_rejection(make_train, (3, 4, 5, 0, 1, 2), tuple(range(6)), 3) + p, natural = (2, 3, 0, 1), (0, 1, 2, 3) + require(max(cut_profile(p, natural, 2)[1]) == 16, "natural half-swap control") + require(max(cut_profile(p, cycle_order(p), 2)[1]) == 4, "reorder control") + gram = literal_gram(literal_unfolding(p, natural, 2, 2)) + require(not valid_flat_spectrum(gram, 1, 4), "one-direction rank accepted") + require(not valid_flat_spectrum(gram, 2, 16), "wrong singular value accepted") + p, order, x = (1, 2, 0), (0, 1, 2), (0, 1, 0) + y = literal_output(p, x) + train = make_train(p, order, 2) + broken = [dict(tables) for tables in train] + table = broken[0][y[0], x[0]] + broken[0][y[0], x[0]] = tuple(tuple(0 for _ in row) for row in table) + require(train_entry(broken, order, x, y) != 1, "missing local factor escaped") + broken[0][y[0], x[0]] = tuple(tuple(-v for v in row) for row in table) + require(train_entry(broken, order, x, y) == -1, "absolute phase escaped") + inverse = (2, 0, 1) + require(train_entry(train, order, x, literal_output(inverse, x)) == 0, + "inverse routing orientation escaped") + return {"invalid_input_rejections": rejected, "semantic_controls": 7} + + +def receipt(counts): + package = Path(__file__).resolve().parent + names = ("README.md", "PROOF.md", "TASK.json", "SOURCES.json", "VERIFY.json", + "routing.py", "verify.py") + hashes = {name: hashlib.sha256((package / name).read_bytes()).hexdigest() + for name in names} + return {"status": "PASS_PERMUTATION_CYCLE_LAYOUT", "counts": counts, + "source_sha256": hashes, "python": platform.python_version(), + "implementation": platform.python_implementation(), + "platform": platform.platform(), "machine": platform.machine(), + "optimized": sys.flags.optimize, + "scope": "Finite exact corroboration; universal theorem is in PROOF.md."} + + +def main(): + if len(sys.argv) != 1: + raise ValueError("this finite verifier accepts no arguments") + counts = {} + for run in (verify_spectra, verify_all_layouts, verify_trains, verify_controls): + report = run() + require(not counts.keys() & report.keys(), "duplicate evidence counter") + counts.update(report) + print(json.dumps(receipt(counts), indent=2, sort_keys=True)) + + +if __name__ == "__main__": + main()