From 316768a3497a88c17fca54cf5d5b240b2ea0b959 Mon Sep 17 00:00:00 2001 From: Ali Romman <226877337+aliromman@users.noreply.github.com> Date: Wed, 18 Nov 2026 22:48:02 -0500 Subject: [PATCH] Prove two-prime block classification and capacity invariance --- research/odd-prime-phase-blocks/CREDITS.md | 25 + research/odd-prime-phase-blocks/LICENSE | 201 + research/odd-prime-phase-blocks/PROOF.md | 201 + research/odd-prime-phase-blocks/README.md | 46 + research/odd-prime-phase-blocks/RESULT.json | 4507 +++++++++++++++++ .../odd-prime-phase-blocks/SOURCE-PINS.json | 301 ++ research/odd-prime-phase-blocks/SOURCES.json | 18 + research/odd-prime-phase-blocks/TASK.json | 101 + research/odd-prime-phase-blocks/VERIFY.json | 32 + .../retained/.gitattributes | 1 + .../retained/source7775/CREDITS.md | 41 + .../retained/source7775/PROOF.md | 184 + .../retained/source7775/README.md | 34 + .../retained/source7775/RESULT.json | 822 +++ .../retained/source7775/SOURCE-PINS.json | 229 + .../retained/source7775/SOURCES.json | 18 + .../retained/source7775/TASK.json | 95 + .../retained/source7775/VERIFY.json | 32 + .../source7775/retained/source7769/CREDITS.md | 32 + .../source7775/retained/source7769/PROOF.md | 132 + .../source7775/retained/source7769/README.md | 33 + .../retained/source7769/RESULT.json | 1559 ++++++ .../retained/source7769/SOURCE-PINS.json | 157 + .../retained/source7769/SOURCES.json | 18 + .../source7775/retained/source7769/TASK.json | 91 + .../retained/source7769/VERIFY.json | 32 + .../retained/source7762/.gitattributes | 1 + .../source7769/retained/source7762/CREDITS.md | 32 + .../source7769/retained/source7762/PROOF.md | 172 + .../source7769/retained/source7762/README.md | 38 + .../retained/source7762/RESULT.json | 191 + .../retained/source7762/SOURCE-PINS.json | 53 + .../retained/source7762/SOURCES.json | 18 + .../source7769/retained/source7762/TASK.json | 91 + .../retained/source7762/VERIFY.json | 32 + .../retained/column-completion-PROOF.md | 125 + .../source7762/retained/two-prime/README.md | 124 + .../retained/two-prime/SOURCES.json | 30 + .../source7762/retained/two-prime/TASK.json | 95 + .../source7762/retained/two-prime/VERIFY.json | 34 + .../source7762/retained/two-prime/verify.py | 149 + .../source7769/retained/source7762/verify.py | 281 + .../source7769/retained/source7768/CREDITS.md | 33 + .../source7769/retained/source7768/PROOF.md | 183 + .../source7769/retained/source7768/README.md | 36 + .../source7775/retained/source7769/verify.py | 190 + .../retained/source7775/verify.py | 205 + research/odd-prime-phase-blocks/verify.py | 251 + 48 files changed, 11306 insertions(+) create mode 100644 research/odd-prime-phase-blocks/CREDITS.md create mode 100644 research/odd-prime-phase-blocks/LICENSE create mode 100644 research/odd-prime-phase-blocks/PROOF.md create mode 100644 research/odd-prime-phase-blocks/README.md create mode 100644 research/odd-prime-phase-blocks/RESULT.json create mode 100644 research/odd-prime-phase-blocks/SOURCE-PINS.json create mode 100644 research/odd-prime-phase-blocks/SOURCES.json create mode 100644 research/odd-prime-phase-blocks/TASK.json create mode 100644 research/odd-prime-phase-blocks/VERIFY.json create mode 100644 research/odd-prime-phase-blocks/retained/.gitattributes create mode 100644 research/odd-prime-phase-blocks/retained/source7775/CREDITS.md create mode 100644 research/odd-prime-phase-blocks/retained/source7775/PROOF.md create mode 100644 research/odd-prime-phase-blocks/retained/source7775/README.md create mode 100644 research/odd-prime-phase-blocks/retained/source7775/RESULT.json create mode 100644 research/odd-prime-phase-blocks/retained/source7775/SOURCE-PINS.json create mode 100644 research/odd-prime-phase-blocks/retained/source7775/SOURCES.json create mode 100644 research/odd-prime-phase-blocks/retained/source7775/TASK.json create mode 100644 research/odd-prime-phase-blocks/retained/source7775/VERIFY.json create mode 100644 research/odd-prime-phase-blocks/retained/source7775/retained/source7769/CREDITS.md create mode 100644 research/odd-prime-phase-blocks/retained/source7775/retained/source7769/PROOF.md create mode 100644 research/odd-prime-phase-blocks/retained/source7775/retained/source7769/README.md create mode 100644 research/odd-prime-phase-blocks/retained/source7775/retained/source7769/RESULT.json create mode 100644 research/odd-prime-phase-blocks/retained/source7775/retained/source7769/SOURCE-PINS.json create mode 100644 research/odd-prime-phase-blocks/retained/source7775/retained/source7769/SOURCES.json create mode 100644 research/odd-prime-phase-blocks/retained/source7775/retained/source7769/TASK.json create mode 100644 research/odd-prime-phase-blocks/retained/source7775/retained/source7769/VERIFY.json create mode 100644 research/odd-prime-phase-blocks/retained/source7775/retained/source7769/retained/source7762/.gitattributes create mode 100644 research/odd-prime-phase-blocks/retained/source7775/retained/source7769/retained/source7762/CREDITS.md create mode 100644 research/odd-prime-phase-blocks/retained/source7775/retained/source7769/retained/source7762/PROOF.md create mode 100644 research/odd-prime-phase-blocks/retained/source7775/retained/source7769/retained/source7762/README.md create mode 100644 research/odd-prime-phase-blocks/retained/source7775/retained/source7769/retained/source7762/RESULT.json create mode 100644 research/odd-prime-phase-blocks/retained/source7775/retained/source7769/retained/source7762/SOURCE-PINS.json create mode 100644 research/odd-prime-phase-blocks/retained/source7775/retained/source7769/retained/source7762/SOURCES.json create mode 100644 research/odd-prime-phase-blocks/retained/source7775/retained/source7769/retained/source7762/TASK.json create mode 100644 research/odd-prime-phase-blocks/retained/source7775/retained/source7769/retained/source7762/VERIFY.json create mode 100644 research/odd-prime-phase-blocks/retained/source7775/retained/source7769/retained/source7762/retained/column-completion-PROOF.md create mode 100644 research/odd-prime-phase-blocks/retained/source7775/retained/source7769/retained/source7762/retained/two-prime/README.md create mode 100644 research/odd-prime-phase-blocks/retained/source7775/retained/source7769/retained/source7762/retained/two-prime/SOURCES.json create mode 100644 research/odd-prime-phase-blocks/retained/source7775/retained/source7769/retained/source7762/retained/two-prime/TASK.json create mode 100644 research/odd-prime-phase-blocks/retained/source7775/retained/source7769/retained/source7762/retained/two-prime/VERIFY.json create mode 100644 research/odd-prime-phase-blocks/retained/source7775/retained/source7769/retained/source7762/retained/two-prime/verify.py create mode 100644 research/odd-prime-phase-blocks/retained/source7775/retained/source7769/retained/source7762/verify.py create mode 100644 research/odd-prime-phase-blocks/retained/source7775/retained/source7769/retained/source7768/CREDITS.md create mode 100644 research/odd-prime-phase-blocks/retained/source7775/retained/source7769/retained/source7768/PROOF.md create mode 100644 research/odd-prime-phase-blocks/retained/source7775/retained/source7769/retained/source7768/README.md create mode 100644 research/odd-prime-phase-blocks/retained/source7775/retained/source7769/verify.py create mode 100644 research/odd-prime-phase-blocks/retained/source7775/verify.py create mode 100644 research/odd-prime-phase-blocks/verify.py diff --git a/research/odd-prime-phase-blocks/CREDITS.md b/research/odd-prime-phase-blocks/CREDITS.md new file mode 100644 index 0000000000..fe1bc4da8f --- /dev/null +++ b/research/odd-prime-phase-blocks/CREDITS.md @@ -0,0 +1,25 @@ +# Credit and source record + +Ali Romman prepared the general product argument, two-block classification, +capacity reduction and checker with substantial OpenAI Codex assistance in +research, implementation, verification and writing. New material is under +Apache-2.0. No global literature priority is claimed. + +T. Y. Lam and K. H. Leung supply the classical two-prime cycle theorem in +[On Vanishing Sums of Roots of Unity, Corollary 3.4](https://arxiv.org/pdf/math/9511209#page=8). +Their theorem is an explicit mathematical input. The new proof does not claim +to reprove or originate that classification. + +Ali Romman's [PR #7775](https://github.com/CrocSwap/integer-mult-bounds/pull/7775) +supplies the [p=3 phase descent](https://github.com/aliromman/integer-mult-bounds/blob/00daa049c349349f7db27ae7ddaf2f56116aaf79/research/two-prime-alphabet-descent/PROOF.md) +and exact predecessor checks. The complete package is retained without changes. +Its nested source proves the exact eight-row capacity. This work replaces the +p=3 two-line step with a product invariant valid for every odd prime, and adds +the full block normal form and capacity equality. + +Nick Petalas supplied the original two-prime completion question in +[PR #7744](https://github.com/CrocSwap/integer-mult-bounds/pull/7744), with +[source and credit](https://github.com/petalas/integer-mult-bounds/blob/7dc85513e8ee9b771a5856f027cf199936f85af0/research/two-prime-column-completion/README.md). +All predecessor and completion notices remain in the retained tree. +[SOURCE-PINS.json](SOURCE-PINS.json) gives exact original Git objects and +SHA256 values. The verifier checks both before replay. diff --git a/research/odd-prime-phase-blocks/LICENSE b/research/odd-prime-phase-blocks/LICENSE new file mode 100644 index 0000000000..261eeb9e9f --- /dev/null +++ b/research/odd-prime-phase-blocks/LICENSE @@ -0,0 +1,201 @@ + Apache License + Version 2.0, January 2004 + http://www.apache.org/licenses/ + + TERMS AND CONDITIONS FOR USE, REPRODUCTION, AND DISTRIBUTION + + 1. Definitions. + + "License" shall mean the terms and conditions for use, reproduction, + and distribution as defined by Sections 1 through 9 of this document. + + "Licensor" shall mean the copyright owner or entity authorized by + the copyright owner that is granting the License. + + "Legal Entity" shall mean the union of the acting entity and all + other entities that control, are controlled by, or are under common + control with that entity. For the purposes of this definition, + "control" means (i) the power, direct or indirect, to cause the + direction or management of such entity, whether by contract or + otherwise, or (ii) ownership of fifty percent (50%) or more of the + outstanding shares, or (iii) beneficial ownership of such entity. + + "You" (or "Your") shall mean an individual or Legal Entity + exercising permissions granted by this License. + + "Source" form shall mean the preferred form for making modifications, + including but not limited to software source code, documentation + source, and configuration files. + + "Object" form shall mean any form resulting from mechanical + transformation or translation of a Source form, including but + not limited to compiled object code, generated documentation, + and conversions to other media types. + + "Work" shall mean the work of authorship, whether in Source or + Object form, made available under the License, as indicated by a + copyright notice that is included in or attached to the work + (an example is provided in the Appendix below). + + "Derivative Works" shall mean any work, whether in Source or Object + form, that is based on (or derived from) the Work and for which the + editorial revisions, annotations, elaborations, or other modifications + represent, as a whole, an original work of authorship. For the purposes + of this License, Derivative Works shall not include works that remain + separable from, or merely link (or bind by name) to the interfaces of, + the Work and Derivative Works thereof. + + "Contribution" shall mean any work of authorship, including + the original version of the Work and any modifications or additions + to that Work or Derivative Works thereof, that is intentionally + submitted to Licensor for inclusion in the Work by the copyright owner + or by an individual or Legal Entity authorized to submit on behalf of + the copyright owner. For the purposes of this definition, "submitted" + means any form of electronic, verbal, or written communication sent + to the Licensor or its representatives, including but not limited to + communication on electronic mailing lists, source code control systems, + and issue tracking systems that are managed by, or on behalf of, the + Licensor for the purpose of discussing and improving the Work, but + excluding communication that is conspicuously marked or otherwise + designated in writing by the copyright owner as "Not a Contribution." + + "Contributor" shall mean Licensor and any individual or Legal Entity + on behalf of whom a Contribution has been received by Licensor and + subsequently incorporated within the Work. + + 2. Grant of Copyright License. Subject to the terms and conditions of + this License, each Contributor hereby grants to You a perpetual, + worldwide, non-exclusive, no-charge, royalty-free, irrevocable + copyright license to reproduce, prepare Derivative Works of, + publicly display, publicly perform, sublicense, and distribute the + Work and such Derivative Works in Source or Object form. + + 3. Grant of Patent License. Subject to the terms and conditions of + this License, each Contributor hereby grants to You a perpetual, + worldwide, non-exclusive, no-charge, royalty-free, irrevocable + (except as stated in this section) patent license to make, have made, + use, offer to sell, sell, import, and otherwise transfer the Work, + where such license applies only to those patent claims licensable + by such Contributor that are necessarily infringed by their + Contribution(s) alone or by combination of their Contribution(s) + with the Work to which such Contribution(s) was submitted. If You + institute patent litigation against any entity (including a + cross-claim or counterclaim in a lawsuit) alleging that the Work + or a Contribution incorporated within the Work constitutes direct + or contributory patent infringement, then any patent licenses + granted to You under this License for that Work shall terminate + as of the date such litigation is filed. + + 4. Redistribution. You may reproduce and distribute copies of the + Work or Derivative Works thereof in any medium, with or without + modifications, and in Source or Object form, provided that You + meet the following conditions: + + (a) You must give any other recipients of the Work or + Derivative Works a copy of this License; and + + (b) You must cause any modified files to carry prominent notices + stating that You changed the files; and + + (c) You must retain, in the Source form of any Derivative Works + that You distribute, all copyright, patent, trademark, and + attribution notices from the Source form of the Work, + excluding those notices that do not pertain to any part of + the Derivative Works; and + + (d) If the Work includes a "NOTICE" text file as part of its + distribution, then any Derivative Works that You distribute must + include a readable copy of the attribution notices contained + within such NOTICE file, excluding those notices that do not + pertain to any part of the Derivative Works, in at least one + of the following places: within a NOTICE text file distributed + as part of the Derivative Works; within the Source form or + documentation, if provided along with the Derivative Works; or, + within a display generated by the Derivative Works, if and + wherever such third-party notices normally appear. The contents + of the NOTICE file are for informational purposes only and + do not modify the License. You may add Your own attribution + notices within Derivative Works that You distribute, alongside + or as an addendum to the NOTICE text from the Work, provided + that such additional attribution notices cannot be construed + as modifying the License. + + You may add Your own copyright statement to Your modifications and + may provide additional or different license terms and conditions + for use, reproduction, or distribution of Your modifications, or + for any such Derivative Works as a whole, provided Your use, + reproduction, and distribution of the Work otherwise complies with + the conditions stated in this License. + + 5. Submission of Contributions. Unless You explicitly state otherwise, + any Contribution intentionally submitted for inclusion in the Work + by You to the Licensor shall be under the terms and conditions of + this License, without any additional terms or conditions. + Notwithstanding the above, nothing herein shall supersede or modify + the terms of any separate license agreement you may have executed + with Licensor regarding such Contributions. + + 6. Trademarks. This License does not grant permission to use the trade + names, trademarks, service marks, or product names of the Licensor, + except as required for reasonable and customary use in describing the + origin of the Work and reproducing the content of the NOTICE file. + + 7. Disclaimer of Warranty. Unless required by applicable law or + agreed to in writing, Licensor provides the Work (and each + Contributor provides its Contributions) on an "AS IS" BASIS, + WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or + implied, including, without limitation, any warranties or conditions + of TITLE, NON-INFRINGEMENT, MERCHANTABILITY, or FITNESS FOR A + PARTICULAR PURPOSE. You are solely responsible for determining the + appropriateness of using or redistributing the Work and assume any + risks associated with Your exercise of permissions under this License. + + 8. Limitation of Liability. In no event and under no legal theory, + whether in tort (including negligence), contract, or otherwise, + unless required by applicable law (such as deliberate and grossly + negligent acts) or agreed to in writing, shall any Contributor be + liable to You for damages, including any direct, indirect, special, + incidental, or consequential damages of any character arising as a + result of this License or out of the use or inability to use the + Work (including but not limited to damages for loss of goodwill, + work stoppage, computer failure or malfunction, or any and all + other commercial damages or losses), even if such Contributor + has been advised of the possibility of such damages. + + 9. Accepting Warranty or Additional Liability. While redistributing + the Work or Derivative Works thereof, You may choose to offer, + and charge a fee for, acceptance of support, warranty, indemnity, + or other liability obligations and/or rights consistent with this + License. However, in accepting such obligations, You may act only + on Your own behalf and on Your sole responsibility, not on behalf + of any other Contributor, and only if You agree to indemnify, + defend, and hold each Contributor harmless for any liability + incurred by, or claims asserted against, such Contributor by reason + of your accepting any such warranty or additional liability. + + END OF TERMS AND CONDITIONS + + APPENDIX: How to apply the Apache License to your work. + + To apply the Apache License to your work, attach the following + boilerplate notice, with the fields enclosed by brackets "[]" + replaced with your own identifying information. (Don't include + the brackets!) The text should be enclosed in the appropriate + comment syntax for the file format. We also recommend that a + file or class name and description of purpose be included on the + same "printed page" as the copyright notice for easier + identification within third-party archives. + + Copyright [yyyy] [name of copyright owner] + + Licensed under the Apache License, Version 2.0 (the "License"); + you may not use this file except in compliance with the License. + You may obtain a copy of the License at + + http://www.apache.org/licenses/LICENSE-2.0 + + Unless required by applicable law or agreed to in writing, software + distributed under the License is distributed on an "AS IS" BASIS, + WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. + See the License for the specific language governing permissions and + limitations under the License. diff --git a/research/odd-prime-phase-blocks/PROOF.md b/research/odd-prime-phase-blocks/PROOF.md new file mode 100644 index 0000000000..854047352b --- /dev/null +++ b/research/odd-prime-phase-blocks/PROOF.md @@ -0,0 +1,201 @@ +# Two odd prime blocks and capacity under prime powers + +Ali Romman with substantial OpenAI Codex assistance. Apache-2.0. + +Write `mu_s` for the group of complex s-th roots of unity. Let p=1, and put `m=p^a q^b`. All orthogonality below is exact. +A phase change multiplies a row or a column by a root in mu_m. + +## Theorem + +Let H have p+q rows, c pairwise orthogonal columns and entries in mu_m. +If H cannot be changed by row and column phases to have entries in mu_(pq), +then c<=p. More precisely, a row permutation and phase changes put H in the form + +```text +H = [ A D ] + [ B ], + +A: p by c, entries in mu_p, A* A = p I, +B: q by c, entries in mu_q, B* B = q I, +D: diagonal, entries gamma_j in mu_m. +``` + +Here `*` is conjugate transpose. At least one ratio `gamma_j/gamma_k` is outside +mu_(pq). Conversely, every such pair of orthogonal prime blocks and diagonal D +gives an orthogonal-column matrix. It fails to descend exactly when some such +ratio is outside mu_(pq). + +It follows that every H with at least p+1 columns descends. This threshold is +sharp whenever m>pq: there are p-column matrices that cannot descend, even if +arbitrary unit-modulus row and column phases are allowed. + +Let `C(n,s)` denote the maximum number of pairwise orthogonal n-entry columns +with entries in mu_s. Then + +```text +C(p+q, p^a q^b) = C(p+q, pq). +``` + +The theorem removes all higher prime powers from this capacity question. It +does not compute the squarefree capacity for every p,q. In the known case +p=3,q=5, that capacity is four by the retained finite source certificate. +No physical supplier or complete kappa gain follows. + +## 1. The classical two-cycle input + +[T. Y. Lam and K. H. Leung, Corollary 3.4](https://arxiv.org/pdf/math/9511209#page=8) +classify minimal positive zero sums for an alphabet with two prime divisors as +rotated prime cycles. A zero sum of length p+q therefore splits into one +p-cycle and one q-cycle: the only nonnegative solution of `pu+qv=p+q` is +u=v=1. To check uniqueness, v<=1 since pp. If k>0, the only possible collisions +are t=u and t=-u. These cannot both hold for nonzero t in an odd-order group. +At least three values remain. This conflicts with the two-cycle quotient type. + +If k=0, there are again three values unless t=-u. That exception gives two +counts, q-p and 2p. They cannot be p and q: equality would require q=2p, which +is not prime. The difference cannot be constant either. Thus all nonconstant +columns have one common subset S of p rows. + +If no nonconstant quotient column remains, all entries already lie in mu_(pq). +Otherwise write every quotient column as `t_j 1_S`, including t_j=0. The +first column has t_j=0, so at least two distinct phase classes occur. + +## 3. The product invariant replaces the special p=3 argument + +For two columns in different phase classes, their inner-product terms have +separate quotient values on S and its complement T. The p-cycle lies on S +and the q-cycle lies on T. Thus those column restrictions are orthogonal on +each block. + +Take columns x,y in the same phase class. Choose z in another class. On S, +the ratios x/z and y/z are scalar multiples of permutations of all p-th roots. +It follows that the ratios x/y on S lie in one coset `gamma mu_p`, and + +```text +product over S of (x_r/y_r) = gamma^p. +``` + +The permutation products cancel. The full x/y zero sum is one p-cycle and +one q-cycle. The q-cycle has at most one term in `gamma mu_p`. Since S has +p>=3 terms in that coset, the p-cycle must be in that same coset. All terms +on S come from that full p-cycle and at most one extra term from the q-cycle. + +The product of all roots of an odd prime cycle `gamma mu_p` is gamma^p. +Choosing p terms from the cycle plus one extra term can only keep the full +cycle, or remove one root u and insert one root v. In the latter case the +product changes by v/u. The displayed product identity forces v=u. +Consequently the multiset of terms on S is exactly the full p-cycle. Its sum +is zero. Thus x and y are also orthogonal on S. Their full inner product is +zero, so their restrictions to T are orthogonal as well. + +All c nonzero column restrictions are now pairwise orthogonal in C^p. Hence +c<=p. This argument works for every odd p. It does not rely on the two Fourier +lines that suffice in the p=3 source proof. + +The oddness is necessary for this argument. For p=2,q=3, the two-cycle zero +sum with mu_6 exponents `(0,3,3,5,1)` contains the two terms `(3,3)`. Their +product is one but their sum is -2. The checker verifies this failure of the +product implication. It is not a counterexample to a full capacity theorem +for even-prime alphabets. + +## 4. Extract the two prime blocks + +For columns in different phase classes, their entrywise ratios on S lie in +a single mu_p coset, and their ratios on T lie in a single mu_q coset. The +same coset statement holds for columns in the same class: divide their ratios +to a third column from another class. + +Make the first column one by row phases. For each column, divide by its entry +at one fixed row in T. All entries on T then lie in mu_q. On S, divide each +column separately by its value gamma_j at one fixed row of S. The remaining +entries on S lie in mu_p. This gives `[A D; B]`. The phase operations preserve +the block orthogonality proved above, so `A* A=p I` and `B* B=q I`. + +Conversely, orthogonal A and B imply orthogonality of the stacked matrix for +any unit diagonal D. If every gamma_j belongs to one common mu_(pq) coset, +a single row phase on the top block puts every entry in mu_(pq). + +If `gamma_j/gamma_k` is outside mu_(pq), take any top row and any bottom row, +and columns j,k. The multiplicative two-by-two cross ratio is that phase ratio +times an element of mu_(pq). It is outside mu_(pq). Cross ratios are unchanged +by row and column phases. Descent is therefore impossible. This proves both +directions of the block classification. + +## 5. Sharpness and equality of capacities + +Let eta be a primitive m-th root, omega a primitive p-th root and zeta a +primitive q-th root. Index columns by j=0,...,p-1 and use + +```text +first p rows: H_rj = eta^j omega^(rj), r=0,...,p-1, +last q rows: H_rj = zeta^(2*r*j), r=0,...,q-1. +``` + +Each block has orthogonal columns, since p and q are odd primes and a nonzero +column-index difference has absolute value less than ppq, this is outside +mu_(pq), so the p-column example cannot descend. + +Replacing eta by 1 gives p orthogonal columns already over mu_(pq). Therefore +`C(p+q,pq)>=p`. Any matrix over the larger alphabet has at most p columns, +or descends by the theorem and has at most `C(p+q,pq)` columns. The reverse +inequality follows from the inclusion `mu_(pq) subset mu_m`. This proves the +claimed equality of capacities for all positive a,b. + +## Evidence and limits + +The checker validates exact cyclotomic Gram matrices, the common-subset +counts, the product invariant and the extracted normal forms. The common-subset checks include every unordered pair of five-row subsets +of twelve rows, with all four nonzero value pairs in the odd quotient group +Z/3. This tests the combinatorial lemma beyond the quotient orders that occur +for primes 5 and 7. It enumerates +all relative permutations for p=3,5,7; common row permutation reduces an +arbitrary pair of permutations to this domain. It checks every pair of rotated +prime cycles in the stated twelve finite alphabets, and every p-term selection +inside the relevant p-root coset. These finite checks support the written +proof; they do not enumerate all root-phase matrices or replace the classical +two-prime theorem. + +The full predecessor verifier and its nested eight-row capacity source run +unchanged. No independent human or formal-kernel acceptance is claimed. The +squarefree capacity for general p,q, even-prime cases, a third prime divisor, +other row counts and approximate orthogonality remain open here. The block +classification does not classify the smaller matrices A and B. Native +preparation, restoration and a complete caller price are outside scope. All +five multiplication-framework assumptions and the selected frontier remain. + +## Open next questions + +Determine one new squarefree capacity, or identify a different zero-sum type +for a changed alphabet or row count. Do not repeat prime-power searches in +this exact class. The structured questions are in [TASK.json](TASK.json). diff --git a/research/odd-prime-phase-blocks/README.md b/research/odd-prime-phase-blocks/README.md new file mode 100644 index 0000000000..5e2c4634fc --- /dev/null +++ b/research/odd-prime-phase-blocks/README.md @@ -0,0 +1,46 @@ +# Two odd prime blocks and capacity under prime powers + +For distinct odd primes p=1, p+q-row column capacity over mu_(p^a q^b) equals that over mu_(pq).", + "block_statement": "Every matrix that cannot descend has at most p columns and a row/column phase normal form [A D; B], with orthogonal columns in A over mu_p and in B over mu_q." +} diff --git a/research/odd-prime-phase-blocks/SOURCE-PINS.json b/research/odd-prime-phase-blocks/SOURCE-PINS.json new file mode 100644 index 0000000000..6acfda699a --- /dev/null +++ b/research/odd-prime-phase-blocks/SOURCE-PINS.json @@ -0,0 +1,301 @@ +{ + "schema_version": 1, + "sources": [ + { + "repository": "aliromman/integer-mult-bounds", + "commit": "00daa049c349349f7db27ae7ddaf2f56116aaf79", + "path": "research/two-prime-alphabet-descent/CREDITS.md", + "retained": "retained/source7775/CREDITS.md", + "sha256": "23d2fae2705b1be6528b9f73bc09a26196fb55c9d27a9095c1df08479d4c1dd0", + "git_blob": "6616487f6a0114c0abffc53a4ce8f9d68339220b" + }, + { + "repository": "aliromman/integer-mult-bounds", + "commit": "00daa049c349349f7db27ae7ddaf2f56116aaf79", + "path": "research/two-prime-alphabet-descent/PROOF.md", + "retained": "retained/source7775/PROOF.md", + "sha256": "b755770b60216800a8035c2be9795c7534645ee144c3e64199a895aa5ac56a72", + "git_blob": "010dcd2b685fcb4d00599211482809d0c7a1c8c3" + }, + { + "repository": "aliromman/integer-mult-bounds", + "commit": "00daa049c349349f7db27ae7ddaf2f56116aaf79", + "path": "research/two-prime-alphabet-descent/README.md", + "retained": "retained/source7775/README.md", + "sha256": "22eefac3f11fce6cf128167a98a53c8214f27cf1e2b5ae3a29f98b605b5d11bd", + "git_blob": "373baaaa41ca21418e1a7b169f2ca0d5cff8a732" + }, + { + "repository": "aliromman/integer-mult-bounds", + "commit": "00daa049c349349f7db27ae7ddaf2f56116aaf79", + "path": "research/two-prime-alphabet-descent/RESULT.json", + "retained": "retained/source7775/RESULT.json", + "sha256": "59d604368401e95fafd5a4d7a002e7410d3c3acf14ab3226b0b28dfdf72fb803", + "git_blob": "8094d0d3dd4c7428ff7de7697984f2a0a80bc101" + }, + { + "repository": "aliromman/integer-mult-bounds", + "commit": "00daa049c349349f7db27ae7ddaf2f56116aaf79", + "path": "research/two-prime-alphabet-descent/SOURCE-PINS.json", + "retained": "retained/source7775/SOURCE-PINS.json", + "sha256": "366485d66712714164747407707a2fcc06942b53b7f82c9b0cbe1709d1b4ba7d", + "git_blob": "2f1181113aefc8030bba497b245741baa4a51a4b" + }, + { + "repository": "aliromman/integer-mult-bounds", + "commit": "00daa049c349349f7db27ae7ddaf2f56116aaf79", + "path": "research/two-prime-alphabet-descent/SOURCES.json", + "retained": "retained/source7775/SOURCES.json", + "sha256": "0761fd793723c2df1e2ca51733251cfd597ff3e120f7e2ee8ebb8e10e8e98c08", + "git_blob": "5335fa97d97f6df5a917eea1ee2fcd01c082d261" + }, + { + "repository": "aliromman/integer-mult-bounds", + "commit": "00daa049c349349f7db27ae7ddaf2f56116aaf79", + "path": "research/two-prime-alphabet-descent/TASK.json", + "retained": "retained/source7775/TASK.json", + "sha256": "cd09e007a796e2f2c9b0712fa6a63392cb861103d52c77c13b56a2c2fa38920c", + "git_blob": "153a90debc706509fae014ff7353134c6a59158d" + }, + { + "repository": "aliromman/integer-mult-bounds", + "commit": "00daa049c349349f7db27ae7ddaf2f56116aaf79", + "path": "research/two-prime-alphabet-descent/VERIFY.json", + "retained": "retained/source7775/VERIFY.json", + "sha256": "b5217a4eb57e867a4db324aa57bf479888ab1152a51fcf94fa644ba491bd012c", + "git_blob": "8864ad531aaa36b76fa0f2f106b0c47fea04c9c9" + }, + { + "repository": "aliromman/integer-mult-bounds", + "commit": "00daa049c349349f7db27ae7ddaf2f56116aaf79", + "path": "research/two-prime-alphabet-descent/retained/source7769/CREDITS.md", + "retained": "retained/source7775/retained/source7769/CREDITS.md", + "sha256": "d8fb2999cb8a844bfb583abbe92795fcc2baf4ed7dd61a03c0cfd7e1484eb76a", + "git_blob": "005092c4edd699409d5f6b253052c94a4aaf0441" + }, + { + "repository": "aliromman/integer-mult-bounds", + "commit": "00daa049c349349f7db27ae7ddaf2f56116aaf79", + "path": "research/two-prime-alphabet-descent/retained/source7769/PROOF.md", + "retained": "retained/source7775/retained/source7769/PROOF.md", + "sha256": "d88fb3f8556f3ec2874bb2c10710609554d5cfa1ae1592cca68052d858c58f90", + "git_blob": "668c92d847065c17a23bb23717cf32145be81d6c" + }, + { + "repository": "aliromman/integer-mult-bounds", + "commit": "00daa049c349349f7db27ae7ddaf2f56116aaf79", + "path": "research/two-prime-alphabet-descent/retained/source7769/README.md", + "retained": "retained/source7775/retained/source7769/README.md", + "sha256": "7084058a854552f69a730b4c217026cab202133dec5ec5c3ac899428bbb870a9", + "git_blob": "37a2995b47e6abf9e3da263955e370bfd808a8bc" + }, + { + "repository": "aliromman/integer-mult-bounds", + "commit": "00daa049c349349f7db27ae7ddaf2f56116aaf79", + "path": "research/two-prime-alphabet-descent/retained/source7769/RESULT.json", + "retained": "retained/source7775/retained/source7769/RESULT.json", + "sha256": "69d7370cbfe8c2ebf15c6a30595a925162272366b210292002ca6a15fd0056b0", + "git_blob": "e762c8acce3ee289689167cf491dbe82c95e30e0" + }, + { + "repository": "aliromman/integer-mult-bounds", + "commit": "00daa049c349349f7db27ae7ddaf2f56116aaf79", + "path": "research/two-prime-alphabet-descent/retained/source7769/SOURCE-PINS.json", + "retained": "retained/source7775/retained/source7769/SOURCE-PINS.json", + "sha256": "9cc8f20c3e6690c032d6e0c113fad49268b2997946858a11a1831628452603be", + "git_blob": "2594116cf4344373b82b90587376fbdd9df74978" + }, + { + "repository": "aliromman/integer-mult-bounds", + "commit": "00daa049c349349f7db27ae7ddaf2f56116aaf79", + "path": "research/two-prime-alphabet-descent/retained/source7769/SOURCES.json", + "retained": "retained/source7775/retained/source7769/SOURCES.json", + "sha256": "0761fd793723c2df1e2ca51733251cfd597ff3e120f7e2ee8ebb8e10e8e98c08", + "git_blob": "5335fa97d97f6df5a917eea1ee2fcd01c082d261" + }, + { + "repository": "aliromman/integer-mult-bounds", + "commit": "00daa049c349349f7db27ae7ddaf2f56116aaf79", + "path": "research/two-prime-alphabet-descent/retained/source7769/TASK.json", + "retained": "retained/source7775/retained/source7769/TASK.json", + "sha256": "ff09137d6215e14882602e3c0f4c1c0e821e53c3a0dbb052390b060179d04842", + "git_blob": "599b9bd2a0700e4affdf02094253cd7a47b378d4" + }, + { + "repository": "aliromman/integer-mult-bounds", + "commit": "00daa049c349349f7db27ae7ddaf2f56116aaf79", + "path": "research/two-prime-alphabet-descent/retained/source7769/VERIFY.json", + "retained": "retained/source7775/retained/source7769/VERIFY.json", + "sha256": "42fff59764b141363ab2a5ff6ffa467ff56e9c13f5c5d157a3efbdc407b42796", + "git_blob": "bb39353ac6b547855a3a55696384f62a5627f477" + }, + { + "repository": "aliromman/integer-mult-bounds", + "commit": "00daa049c349349f7db27ae7ddaf2f56116aaf79", + "path": "research/two-prime-alphabet-descent/retained/source7769/retained/source7762/.gitattributes", + "retained": "retained/source7775/retained/source7769/retained/source7762/.gitattributes", + "sha256": "3a90a01036aab114f09495dd88d8cc7db233e784ba70377064f11ffa8a1602fd", + "git_blob": "130a3ecaa26bd4a35622a8c5c22f05f14cc4c665" + }, + { + "repository": "aliromman/integer-mult-bounds", + "commit": "00daa049c349349f7db27ae7ddaf2f56116aaf79", + "path": "research/two-prime-alphabet-descent/retained/source7769/retained/source7762/CREDITS.md", + "retained": "retained/source7775/retained/source7769/retained/source7762/CREDITS.md", + "sha256": "0ba30859824881ba0129b911064b19215cad226232bb3a089724f22c8f5be5e9", + "git_blob": "9ca00a2db881b4a7ca95f79372aad31fc08ff3c2" + }, + { + "repository": "aliromman/integer-mult-bounds", + "commit": "00daa049c349349f7db27ae7ddaf2f56116aaf79", + "path": "research/two-prime-alphabet-descent/retained/source7769/retained/source7762/PROOF.md", + "retained": "retained/source7775/retained/source7769/retained/source7762/PROOF.md", + "sha256": "3f43b8ddeffce9e39057162fa4a15667b78e3bdd72da353d8e65aa3caa4d5203", + "git_blob": "33f93945bad645ecd77cf6c00a6bca5bcef52ca4" + }, + { + "repository": "aliromman/integer-mult-bounds", + "commit": "00daa049c349349f7db27ae7ddaf2f56116aaf79", + "path": "research/two-prime-alphabet-descent/retained/source7769/retained/source7762/README.md", + "retained": "retained/source7775/retained/source7769/retained/source7762/README.md", + "sha256": "8a0f975f986e766ef933a2b19165e6e0d46a9e03ed83d81326dcd4b315393fa5", + "git_blob": "be36a951e7b38b169aa35d16d96206510d556cea" + }, + { + "repository": "aliromman/integer-mult-bounds", + "commit": "00daa049c349349f7db27ae7ddaf2f56116aaf79", + "path": "research/two-prime-alphabet-descent/retained/source7769/retained/source7762/RESULT.json", + "retained": "retained/source7775/retained/source7769/retained/source7762/RESULT.json", + "sha256": "749d0afb9fec09cca6ef7bca26c6659480402ea220a5e4d7200910ac32c500a4", + "git_blob": "49eb2cf4ac9679a227766815b06014aac77c91c7" + }, + { + "repository": "aliromman/integer-mult-bounds", + "commit": "00daa049c349349f7db27ae7ddaf2f56116aaf79", + "path": "research/two-prime-alphabet-descent/retained/source7769/retained/source7762/SOURCE-PINS.json", + "retained": "retained/source7775/retained/source7769/retained/source7762/SOURCE-PINS.json", + "sha256": "5f5d4d629e205f572d82c57ffafc12ec2d0678e88f9c8a2ad6ce6fba7a400834", + "git_blob": "df8ae4bc660e2d13c9d90719ebbc3714b9678bb7" + }, + { + "repository": "aliromman/integer-mult-bounds", + "commit": "00daa049c349349f7db27ae7ddaf2f56116aaf79", + "path": "research/two-prime-alphabet-descent/retained/source7769/retained/source7762/SOURCES.json", + "retained": "retained/source7775/retained/source7769/retained/source7762/SOURCES.json", + "sha256": "0761fd793723c2df1e2ca51733251cfd597ff3e120f7e2ee8ebb8e10e8e98c08", + "git_blob": "5335fa97d97f6df5a917eea1ee2fcd01c082d261" + }, + { + "repository": "aliromman/integer-mult-bounds", + "commit": "00daa049c349349f7db27ae7ddaf2f56116aaf79", + "path": "research/two-prime-alphabet-descent/retained/source7769/retained/source7762/TASK.json", + "retained": "retained/source7775/retained/source7769/retained/source7762/TASK.json", + "sha256": "c77a80f1233d8c3f0bb9992fce77d2593629605cb9ec7fa1fadca536b245ea93", + "git_blob": "f7b94713399e7e90b8c08354af4331d6ddc3efed" + }, + { + "repository": "aliromman/integer-mult-bounds", + "commit": "00daa049c349349f7db27ae7ddaf2f56116aaf79", + "path": "research/two-prime-alphabet-descent/retained/source7769/retained/source7762/VERIFY.json", + "retained": "retained/source7775/retained/source7769/retained/source7762/VERIFY.json", + "sha256": "74ba990fc0db5a43dc2e5f5af93483e3510d650807e9eba50781238c072d3ae5", + "git_blob": "6b5afe14f23ec328a2af358dc85eb6ab5b3906cf" + }, + { + "repository": "aliromman/integer-mult-bounds", + "commit": "00daa049c349349f7db27ae7ddaf2f56116aaf79", + "path": "research/two-prime-alphabet-descent/retained/source7769/retained/source7762/retained/column-completion-PROOF.md", + "retained": "retained/source7775/retained/source7769/retained/source7762/retained/column-completion-PROOF.md", + "sha256": "b194084e203a70574397eeafae053af8e9e49d9e519aacfa112f039da2499674", + "git_blob": "5023cdde8762720467f708b28dabda0f0532064e" + }, + { + "repository": "aliromman/integer-mult-bounds", + "commit": "00daa049c349349f7db27ae7ddaf2f56116aaf79", + "path": "research/two-prime-alphabet-descent/retained/source7769/retained/source7762/retained/two-prime/README.md", + "retained": "retained/source7775/retained/source7769/retained/source7762/retained/two-prime/README.md", + "sha256": "fd8223d9bee95195c5eceaa2212d52f1ab0e91ce6673ae9e18fb4d87d0ae638a", + "git_blob": "1c9d65a78f4e8c8f1a7a15f48c30e372fada3f8f" + }, + { + "repository": "aliromman/integer-mult-bounds", + "commit": "00daa049c349349f7db27ae7ddaf2f56116aaf79", + "path": "research/two-prime-alphabet-descent/retained/source7769/retained/source7762/retained/two-prime/SOURCES.json", + "retained": "retained/source7775/retained/source7769/retained/source7762/retained/two-prime/SOURCES.json", + "sha256": "b0b763a0aeda6400ac597c7cd39ab0ee47f1426345673986320e82354bc69e33", + "git_blob": "4b1a8b1b788fadf5cbc6b0d21cce51195cdab973" + }, + { + "repository": "aliromman/integer-mult-bounds", + "commit": "00daa049c349349f7db27ae7ddaf2f56116aaf79", + "path": "research/two-prime-alphabet-descent/retained/source7769/retained/source7762/retained/two-prime/TASK.json", + "retained": "retained/source7775/retained/source7769/retained/source7762/retained/two-prime/TASK.json", + "sha256": "a23e66700d55318ef684428bca00bdd6f421b2592dec379c0542737701ae79d9", + "git_blob": "7fcc4e615ef5bbca3fbef73972828f4484aacaef" + }, + { + "repository": "aliromman/integer-mult-bounds", + "commit": "00daa049c349349f7db27ae7ddaf2f56116aaf79", + "path": "research/two-prime-alphabet-descent/retained/source7769/retained/source7762/retained/two-prime/VERIFY.json", + "retained": "retained/source7775/retained/source7769/retained/source7762/retained/two-prime/VERIFY.json", + "sha256": "953b105013e4448521e8e5f6ca3008bef14c47ee2785d45efdd7b9e664fa12c1", + "git_blob": "807e154f99b58630fc1468c8ed999892af8b48e2" + }, + { + "repository": "aliromman/integer-mult-bounds", + "commit": "00daa049c349349f7db27ae7ddaf2f56116aaf79", + "path": "research/two-prime-alphabet-descent/retained/source7769/retained/source7762/retained/two-prime/verify.py", + "retained": "retained/source7775/retained/source7769/retained/source7762/retained/two-prime/verify.py", + "sha256": "cd7ebf036588a0f3fa108f05f5ad9cb3836c1abd7edde6e7507ee8fa0bba3691", + "git_blob": "f44c327017bc3e2720d4fb80c5374e43eb795dae" + }, + { + "repository": "aliromman/integer-mult-bounds", + "commit": "00daa049c349349f7db27ae7ddaf2f56116aaf79", + "path": "research/two-prime-alphabet-descent/retained/source7769/retained/source7762/verify.py", + "retained": "retained/source7775/retained/source7769/retained/source7762/verify.py", + "sha256": "3f875680dce9943ac503f87ae71adba3c4498f7b5d34cbf4b6e0afa492cbcccc", + "git_blob": "7fe9f369d1c78f33ba045da235aa796e1db60f18" + }, + { + "repository": "aliromman/integer-mult-bounds", + "commit": "00daa049c349349f7db27ae7ddaf2f56116aaf79", + "path": "research/two-prime-alphabet-descent/retained/source7769/retained/source7768/CREDITS.md", + "retained": "retained/source7775/retained/source7769/retained/source7768/CREDITS.md", + "sha256": "cf24781eb749a94f8a1dd287c0c577fbf783adddef96819e92f27dfac65d065e", + "git_blob": "ba7ae62d840e35e35952f89ee297d622f3e92b71" + }, + { + "repository": "aliromman/integer-mult-bounds", + "commit": "00daa049c349349f7db27ae7ddaf2f56116aaf79", + "path": "research/two-prime-alphabet-descent/retained/source7769/retained/source7768/PROOF.md", + "retained": "retained/source7775/retained/source7769/retained/source7768/PROOF.md", + "sha256": "8c95e31e7395ec9a1b16a8de616f4242e7d2ca3a4347e11fe76e4217231a3537", + "git_blob": "88f7de6041c614551c50d2d1609e3d494f99028a" + }, + { + "repository": "aliromman/integer-mult-bounds", + "commit": "00daa049c349349f7db27ae7ddaf2f56116aaf79", + "path": "research/two-prime-alphabet-descent/retained/source7769/retained/source7768/README.md", + "retained": "retained/source7775/retained/source7769/retained/source7768/README.md", + "sha256": "f93ea6e248e30a6f09d8597696c5db8585f8a7850d1e1769c2e3f37e47ae1238", + "git_blob": "82a078431882496a1b2fb0e09b4f5efb0def334d" + }, + { + "repository": "aliromman/integer-mult-bounds", + "commit": "00daa049c349349f7db27ae7ddaf2f56116aaf79", + "path": "research/two-prime-alphabet-descent/retained/source7769/verify.py", + "retained": "retained/source7775/retained/source7769/verify.py", + "sha256": "1b375d06a97a7aa849a075948cb34d80764061cdf1d70a2d6384ede3a99fd90c", + "git_blob": "bb19b58a88bddf14c8aaf68e573391ba13add460" + }, + { + "repository": "aliromman/integer-mult-bounds", + "commit": "00daa049c349349f7db27ae7ddaf2f56116aaf79", + "path": "research/two-prime-alphabet-descent/verify.py", + "retained": "retained/source7775/verify.py", + "sha256": "24392789b91d2eafe789d869654faa43e3ebb6192ac015c50ec47965805baaa4", + "git_blob": "84b23751a15be37d301905730f41b0e3845b24f0" + } + ] +} diff --git a/research/odd-prime-phase-blocks/SOURCES.json b/research/odd-prime-phase-blocks/SOURCES.json new file mode 100644 index 0000000000..5335fa97d9 --- /dev/null +++ b/research/odd-prime-phase-blocks/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/odd-prime-phase-blocks/TASK.json b/research/odd-prime-phase-blocks/TASK.json new file mode 100644 index 0000000000..c16fad1024 --- /dev/null +++ b/research/odd-prime-phase-blocks/TASK.json @@ -0,0 +1,101 @@ +{ + "schema_version": 1, + "task_id": "formal-interface-lemma", + "priority_revision": 8, + "base_commit": "e54523517d0f03e58352e647c403a5af3e525a57", + "original_card": { + "id": "formal-interface-lemma", + "question": "Can one uncovered interface implication be formalized with exact caller and certificate bindings?", + "starting_points": [ + "docs/research/research-family-status.md", + "certificates/selected-result.json", + "research/gate-operand-parity-lean/README.md", + "research/staged544-certified-endpoint/README.md", + "research/unconditional-batched-crt/README.md" + ], + "methods": [ + "Formalize a missing boundary lemma identified by the selected review.", + "Audit a formal theorem-to-certificate binding independently." + ], + "acceptance_gate": "State the exact formalized proposition and remaining assumptions; avoid duplicate arithmetic formalizations already present.", + "first_step": { + "command": [ + "python3", + "-B", + "scripts/research_selected_baseline.py" + ], + "expected": "PASS_RESEARCH_BASELINE_BINDINGS_ONLY", + "inspect": "Resolve the current selected review, separate complex/ordinary BIT/admitted BIT/outer budgets, and compare the card against live handoffs before starting. Historical ceilings require exact source/model equivalence.", + "scope": "Source-binding orientation only; not a scientific replay or all-size proof. Materialize selected inputs if this checkout is sparse." + }, + "first_experiment": "Write one missing statement with quantified hypotheses, actual caller and existing coverage. A compact-switch lemma is a candidate only after its mathematical contract is reviewed. Establish a bounded proof plan before a separately budgeted proof-assistant build; do not rerun large Lean jobs as orientation.", + "bottleneck_link": "A missing interface proof can reduce the conditional gap even if it does not change kappa.", + "allowed_variations": [ + "Narrow to one formal lemma or one theorem-to-certificate binding." + ], + "scope_change_triggers": [ + "Formalizing already-covered arithmetic and claiming the full multiplication theorem." + ], + "overlap_terms": [ + "hyperplane end", + "formal interface", + "Lean binding", + "3807", + "3857", + "4100", + "gate-operand-parity-lean", + "staged544-certified-endpoint", + "unconditional-batched-crt" + ], + "existing_checks": [ + { + "scope": "PR #3807: scoped gate-operand parity formalization.", + "evidence": "research/gate-operand-parity-lean/README.md", + "remaining": "Exact theorem-to-caller binding and genuinely uncovered interface lemmas.", + "status": "author-checked", + "source_commit": "4c3530f42a6abcc48e7a6bcffd6c901911dc8269", + "selected_record_sha256": "bb2eaa58647b353f88d0aec2eafb9d30df1be53589231b23e12ceef3e4bad129" + }, + { + "scope": "PR #3857: certified real-power moment/endpoint arithmetic.", + "evidence": "research/staged544-certified-endpoint/README.md", + "remaining": "Uniform algorithmic implications, not another endpoint digit.", + "status": "author-checked", + "source_commit": "ef4315b8caa605e47a2515004845eb2d2ed71a86", + "selected_record_sha256": "bb2eaa58647b353f88d0aec2eafb9d30df1be53589231b23e12ceef3e4bad129" + }, + { + "scope": "PR #4100: compact-switch formalization proposed as future validation.", + "evidence": "research/unconditional-batched-crt/README.md", + "remaining": "Audit the statement and assumptions before a formal proof campaign.", + "status": "author-checked", + "source_commit": "337d04939571a637aeab54a0f58f54fde811663a", + "selected_record_sha256": "bb2eaa58647b353f88d0aec2eafb9d30df1be53589231b23e12ceef3e4bad129" + } + ] + }, + "scope_status": "changed", + "actual_scope": "For all distinct odd primes p=5 be prime and let a,b>=1. Let H have q+3 rows, +at least four pairwise orthogonal columns, and entries in the group +of roots `mu_m`, where `m=3^a q^b`. Row and column phases from mu_m +change H into a matrix with entries in `mu_(3q)`. + +Equivalently, every two-by-two multiplicative cross ratio of H lies +in mu_(3q). The explicit double dephasing is + +```text +H'_rj = H_rj conjugate(H_r0) conjugate(H_0j) H_00. +``` + +The theorem says that every entry of H' lies in the smaller alphabet. +It preserves all column inner products and their norms. + +**Corollary.** The maximum number of pairwise orthogonal eight-entry +columns over `mu_(3^a 5^b)` is exactly four for every a,b>=1. This follows +from the complete fifteenth-root capacity proof in +[PR #7769](https://github.com/CrocSwap/integer-mult-bounds/pull/7769). +Its [attaining matrix and exhaustive certificate](https://github.com/aliromman/integer-mult-bounds/blob/6dbe6e9503f26189833d5ef213aee708679835f2/research/fifteenth-root-column-capacity/PROOF.md) +remain unchanged and replay here. Four columns attain the bound in +every larger alphabet because mu_15 is a subgroup. + +This is an exact alphabet theorem, not a physical supplier. No new +kappa or change to the selected frontier follows. + +## 1. Pairwise zero sums have only two cycles + +The classical two-prime result of +[T. Y. Lam and K. H. Leung, Corollary 3.4](https://arxiv.org/pdf/math/9511209#page=8) +states that minimal positive zero sums over mu_m are rotated prime +cycles. Decompose any positive zero sum into such minimal sums. +For a zero sum of length q+3, the only nonnegative solution of +`3u+qv=q+3` is u=v=1. Thus each pair of orthogonal columns gives +exactly one rotated 3-cycle and one rotated q-cycle, as a multiset. + +Two consequences are needed. First, each of those cycles lies inside +one coset of mu_(3q) in mu_m. Its coset has multiplicity three or q; +if the two cosets coincide, all q+3 terms lie in that one coset. +Second, a single root has multiplicity at most two in the zero sum. +Each individual prime cycle has no repeated root, so their union +cannot contain a root three times. + +This use of the classical theorem is explicit. The new argument below +concerns simultaneous columns; the cycle classification is not claimed +as new theory. + +## 2. Every nonconstant quotient column uses the same three rows + +Multiply rows to make the first column constant one. Work in the +additive quotient group + +```text +K = mu_m / mu_(3q). +``` + +Its order is `3^(a-1) q^(b-1)`, which is odd. By Section 1, each column's +quotient entries are either constant or have two values with counts +three and q. A column phase makes the value on q rows zero. A +nonconstant column then has the form `t 1_S`, where t is nonzero in K +and S is a three-row subset. A constant column can be made identically +zero in the quotient. + +Suppose two nonconstant columns have different subsets S,T. Put +`k=|S intersection T|`, so k is 0,1 or 2. Their quotient difference has +these values and multiplicities before coincident values are combined: + +| Row region | Quotient value | Multiplicity | +| --- | --- | --- | +| Outside S and T | 0 | q-3+k | +| S only | t | 3-k | +| T only | -u | 3-k | +| Intersection | t-u | k | + +Here t,u are nonzero. If k>0, the only possible equalities between the +four values are t=u or t=-u. These cannot both hold in an odd-order +group. At least three distinct values therefore remain, contrary to +Section 1. + +If k=0, there are three occupied values unless t=-u. In that exceptional +case there are two, with multiplicities q-3 and six. They cannot be +three and q for a prime q>=5: that equality would require q=6. Nor +is the quotient difference constant. This is again impossible. + +Thus all nonconstant quotient columns have one common three-row subset +S. Every quotient column is `t_j 1_S`, allowing t_j=0 for the constant +columns. If no nonconstant quotient column exists, column phases +already place every entry in mu_(3q), and the theorem follows. + +## 3. An essential higher phase permits at most three columns + +Assume that a nonconstant quotient column exists. The first column has +t_j=0, so there are at least two distinct quotient values among columns. +Partition the columns by t_j. + +For columns in different parts, their quotient difference has value +`t_j-t_k` on S and zero on the other q rows. The two cycles in their +inner product must therefore be supported separately: the 3-cycle is +on S and the q-cycle is on its complement. In particular, their +restrictions to S are orthogonal in C^3. + +Now take two columns x,y in the same part, and choose a column z from +a different part. The three coordinate ratios x/z form a rotated +3-cycle, and so do y/z. After their scalar factors are removed, each +is a permutation of `(1,omega,omega^2)`. Up to scalar, such permutations +lie on only two lines: + +```text +span(1,omega,omega^2), span(1,omega^2,omega). +``` + +These lines are orthogonal. Multiplication by the unit-modulus entries +of z preserves this conclusion. Therefore x and y restricted to S are +either proportional or orthogonal. + +They cannot be proportional. If they were, the three terms of their +inner product on S would be exactly the same root. The complete +q+3-term zero sum would then contain that root at least three times, +contrary to Section 1. Hence x and y are also orthogonal on S. + +All column restrictions to S are consequently pairwise orthogonal +nonzero vectors in C^3. There can be at most three columns. This +contradicts the hypothesis of at least four and proves the theorem. + +## 4. The four-column threshold is sharp + +Suppose m>3q and write eta for a primitive m-th root, omega for a +primitive cube root and zeta for a primitive q-th root. The following +(q+3)-by-3 matrix has columns indexed by j=0,1,2: + +```text +first three rows: H_rj = eta^j omega^(rj), r=0,1,2, +last q rows: H_rj = zeta^(rj), r=0,...,q-1. +``` + +Any two columns are orthogonal on each block separately. Their +nonzero index differences are one or two, so both geometric sums +vanish. All column norms squared are q+3. + +Use the first row of each block and columns zero and one. Their +multiplicative cross ratio is eta, which is not in mu_(3q). +Cross ratios are unchanged by row and column phases. Thus this +three-column matrix cannot descend to the smaller alphabet, even +if arbitrary unit-modulus row and column phases are permitted. +This gives a uniform counterexample to a three-column version of +the theorem. The requirement of four columns is substantive. + +## Evidence and limits + +The complete source capacity verifier runs unchanged, including its +full 95-vertex extension graph, triangle exclusion, attaining matrix +and nested predecessor checks. All 28 retained files are authenticated. +The new checker uses only exact integers and cyclotomic polynomial +reduction. It checks: + +- 10,272 canonical intersection/group cases and 173,600 full subset-pair + cases for the quotient collision lemma. A composite-q=6 pattern + exhibits the excluded multiplicities three and six. +- All prime-cycle pairs in alphabets of orders 15,45,75,225 and + 21,63,147,441: 14,400 pairs. Their quotient counts and maximum root + multiplicity agree with the proof. This is the complete cycle-pair + family in those alphabets, not an exhaustive search of arbitrary + root multisets without the classical theorem. +- Every normalized three-root zero sum in these eight alphabets, by + exact basis lookup. Each alphabet has exactly the two displayed + normalized Fourier triples. All line-pair inner products agree. +- The explicit three-column matrices and their nontrivial higher-phase + cross ratios, plus four-column attainment over each 3/5 alphabet. + Full row/column phase changes dephase exactly to the source matrix. + In total, 200 exact Gram entries are checked. + +The all-prime/all-power statement is a written proof using the cited +classical theorem. The finite checks do not enumerate all matrices or +replace that theorem. The source capacity result remains a finite +certificate rather than a formal proof-kernel artifact. Other row counts, +a third prime divisor, approximate orthogonality, full equivalence +classification, native preparation and complete caller prices remain +outside the result. No selected cold replay, Lean, Docker, independent +human acceptance or formal-kernel acceptance is claimed. All five +framework assumptions and the selected frontier remain unchanged. diff --git a/research/odd-prime-phase-blocks/retained/source7775/README.md b/research/odd-prime-phase-blocks/retained/source7775/README.md new file mode 100644 index 0000000000..373baaaa41 --- /dev/null +++ b/research/odd-prime-phase-blocks/retained/source7775/README.md @@ -0,0 +1,34 @@ +# Descent from higher prime-power phase alphabets + +For every prime q>=5 and positive a,b, a q+3-row matrix with at least +four pairwise orthogonal columns over mu_(3^a q^b) can be changed by +row and column phases into a matrix over mu_(3q). + +Consequently the maximum number of orthogonal eight-entry columns is +**exactly four for every alphabet mu_(3^a 5^b)**. Three-column examples +with essential higher phases show that the column threshold is sharp. +No new kappa or physical supplier follows. + +Read [PROOF.md](PROOF.md), [RESULT.json](RESULT.json), [verify.py](verify.py), +[SOURCE-PINS.json](SOURCE-PINS.json) and [CREDITS.md](CREDITS.md). + +Use Python 3.12 and the standard library: + +```sh +python3.12 -B scripts/research_package.py --package research/two-prime-alphabet-descent +``` + +Both modes print `PASS_TWO_PRIME_ALPHABET_DESCENT`. The unchanged +fifteenth-root capacity verifier and its nested source checks run. +New exact checks cover quotient patterns, eight cyclotomic alphabets, +14,400 prime-cycle pairs, the sharp three-column examples and lifted +four-column attainment. No network is needed. + +## Open next questions + +- Determine which changed row counts permit an essential higher phase + with four or more columns. First identify the permitted cycle types. +- Test an alphabet with a third prime divisor under a specified matrix + contract. The two-cycle proof does not cover that setting. + +Ali Romman with substantial OpenAI Codex assistance. Apache-2.0. diff --git a/research/odd-prime-phase-blocks/retained/source7775/RESULT.json b/research/odd-prime-phase-blocks/retained/source7775/RESULT.json new file mode 100644 index 0000000000..8094d0d3dd --- /dev/null +++ b/research/odd-prime-phase-blocks/retained/source7775/RESULT.json @@ -0,0 +1,822 @@ +{ + "source_files": 28, + "quotient_collision_checks": { + "canonical_intersection_cases": 10272, + "all_subset_pair_cases": 173600, + "composite_q6_pattern_control": [ + 3, + 6 + ] + }, + "alphabet_cases": [ + { + "q": 5, + "a": 1, + "b": 1, + "modulus": 15, + "quotient_order": 1, + "cyclotomic_degree": 8, + "prime_cycles": 8, + "cycle_pairs": 15, + "constant_coset_pairs": 15, + "mixed_coset_pairs": 0, + "normalized_three_root_sums": [ + [ + 0, + 5, + 10 + ], + [ + 0, + 10, + 5 + ] + ], + "Fourier_line_pairs": 4, + "sharp_three_column_example": [ + [ + 0, + 1, + 2 + ], + [ + 0, + 6, + 12 + ], + [ + 0, + 11, + 7 + ], + [ + 0, + 0, + 0 + ], + [ + 0, + 3, + 6 + ], + [ + 0, + 6, + 12 + ], + [ + 0, + 9, + 3 + ], + [ + 0, + 12, + 9 + ] + ], + "cross_ratio_exponent": 1, + "cannot_descend": false, + "four_column_attainment": [ + [ + 0, + 0, + 0, + 0 + ], + [ + 0, + 5, + 0, + 10 + ], + [ + 0, + 10, + 10, + 5 + ], + [ + 0, + 0, + 5, + 10 + ], + [ + 0, + 3, + 6, + 4 + ], + [ + 0, + 6, + 12, + 13 + ], + [ + 0, + 9, + 3, + 7 + ], + [ + 0, + 12, + 9, + 1 + ] + ], + "exact_Gram_entries": 41 + }, + { + "q": 5, + "a": 2, + "b": 1, + "modulus": 45, + "quotient_order": 3, + "cyclotomic_degree": 24, + "prime_cycles": 24, + "cycle_pairs": 135, + "constant_coset_pairs": 45, + "mixed_coset_pairs": 90, + "normalized_three_root_sums": [ + [ + 0, + 15, + 30 + ], + [ + 0, + 30, + 15 + ] + ], + "Fourier_line_pairs": 4, + "sharp_three_column_example": [ + [ + 0, + 1, + 2 + ], + [ + 0, + 16, + 32 + ], + [ + 0, + 31, + 17 + ], + [ + 0, + 0, + 0 + ], + [ + 0, + 9, + 18 + ], + [ + 0, + 18, + 36 + ], + [ + 0, + 27, + 9 + ], + [ + 0, + 36, + 27 + ] + ], + "cross_ratio_exponent": 1, + "cannot_descend": true, + "four_column_attainment": [ + [ + 0, + 0, + 0, + 0 + ], + [ + 0, + 15, + 0, + 30 + ], + [ + 0, + 30, + 30, + 15 + ], + [ + 0, + 0, + 15, + 30 + ], + [ + 0, + 9, + 18, + 12 + ], + [ + 0, + 18, + 36, + 39 + ], + [ + 0, + 27, + 9, + 21 + ], + [ + 0, + 36, + 27, + 3 + ] + ], + "exact_Gram_entries": 41 + }, + { + "q": 5, + "a": 1, + "b": 2, + "modulus": 75, + "quotient_order": 5, + "cyclotomic_degree": 40, + "prime_cycles": 40, + "cycle_pairs": 375, + "constant_coset_pairs": 75, + "mixed_coset_pairs": 300, + "normalized_three_root_sums": [ + [ + 0, + 25, + 50 + ], + [ + 0, + 50, + 25 + ] + ], + "Fourier_line_pairs": 4, + "sharp_three_column_example": [ + [ + 0, + 1, + 2 + ], + [ + 0, + 26, + 52 + ], + [ + 0, + 51, + 27 + ], + [ + 0, + 0, + 0 + ], + [ + 0, + 15, + 30 + ], + [ + 0, + 30, + 60 + ], + [ + 0, + 45, + 15 + ], + [ + 0, + 60, + 45 + ] + ], + "cross_ratio_exponent": 1, + "cannot_descend": true, + "four_column_attainment": [ + [ + 0, + 0, + 0, + 0 + ], + [ + 0, + 25, + 0, + 50 + ], + [ + 0, + 50, + 50, + 25 + ], + [ + 0, + 0, + 25, + 50 + ], + [ + 0, + 15, + 30, + 20 + ], + [ + 0, + 30, + 60, + 65 + ], + [ + 0, + 45, + 15, + 35 + ], + [ + 0, + 60, + 45, + 5 + ] + ], + "exact_Gram_entries": 41 + }, + { + "q": 5, + "a": 2, + "b": 2, + "modulus": 225, + "quotient_order": 15, + "cyclotomic_degree": 120, + "prime_cycles": 120, + "cycle_pairs": 3375, + "constant_coset_pairs": 225, + "mixed_coset_pairs": 3150, + "normalized_three_root_sums": [ + [ + 0, + 75, + 150 + ], + [ + 0, + 150, + 75 + ] + ], + "Fourier_line_pairs": 4, + "sharp_three_column_example": [ + [ + 0, + 1, + 2 + ], + [ + 0, + 76, + 152 + ], + [ + 0, + 151, + 77 + ], + [ + 0, + 0, + 0 + ], + [ + 0, + 45, + 90 + ], + [ + 0, + 90, + 180 + ], + [ + 0, + 135, + 45 + ], + [ + 0, + 180, + 135 + ] + ], + "cross_ratio_exponent": 1, + "cannot_descend": true, + "four_column_attainment": [ + [ + 0, + 0, + 0, + 0 + ], + [ + 0, + 75, + 0, + 150 + ], + [ + 0, + 150, + 150, + 75 + ], + [ + 0, + 0, + 75, + 150 + ], + [ + 0, + 45, + 90, + 60 + ], + [ + 0, + 90, + 180, + 195 + ], + [ + 0, + 135, + 45, + 105 + ], + [ + 0, + 180, + 135, + 15 + ] + ], + "exact_Gram_entries": 41 + }, + { + "q": 7, + "a": 1, + "b": 1, + "modulus": 21, + "quotient_order": 1, + "cyclotomic_degree": 12, + "prime_cycles": 10, + "cycle_pairs": 21, + "constant_coset_pairs": 21, + "mixed_coset_pairs": 0, + "normalized_three_root_sums": [ + [ + 0, + 7, + 14 + ], + [ + 0, + 14, + 7 + ] + ], + "Fourier_line_pairs": 4, + "sharp_three_column_example": [ + [ + 0, + 1, + 2 + ], + [ + 0, + 8, + 16 + ], + [ + 0, + 15, + 9 + ], + [ + 0, + 0, + 0 + ], + [ + 0, + 3, + 6 + ], + [ + 0, + 6, + 12 + ], + [ + 0, + 9, + 18 + ], + [ + 0, + 12, + 3 + ], + [ + 0, + 15, + 9 + ], + [ + 0, + 18, + 15 + ] + ], + "cross_ratio_exponent": 1, + "cannot_descend": false, + "four_column_attainment": null, + "exact_Gram_entries": 9 + }, + { + "q": 7, + "a": 2, + "b": 1, + "modulus": 63, + "quotient_order": 3, + "cyclotomic_degree": 36, + "prime_cycles": 30, + "cycle_pairs": 189, + "constant_coset_pairs": 63, + "mixed_coset_pairs": 126, + "normalized_three_root_sums": [ + [ + 0, + 21, + 42 + ], + [ + 0, + 42, + 21 + ] + ], + "Fourier_line_pairs": 4, + "sharp_three_column_example": [ + [ + 0, + 1, + 2 + ], + [ + 0, + 22, + 44 + ], + [ + 0, + 43, + 23 + ], + [ + 0, + 0, + 0 + ], + [ + 0, + 9, + 18 + ], + [ + 0, + 18, + 36 + ], + [ + 0, + 27, + 54 + ], + [ + 0, + 36, + 9 + ], + [ + 0, + 45, + 27 + ], + [ + 0, + 54, + 45 + ] + ], + "cross_ratio_exponent": 1, + "cannot_descend": true, + "four_column_attainment": null, + "exact_Gram_entries": 9 + }, + { + "q": 7, + "a": 1, + "b": 2, + "modulus": 147, + "quotient_order": 7, + "cyclotomic_degree": 84, + "prime_cycles": 70, + "cycle_pairs": 1029, + "constant_coset_pairs": 147, + "mixed_coset_pairs": 882, + "normalized_three_root_sums": [ + [ + 0, + 49, + 98 + ], + [ + 0, + 98, + 49 + ] + ], + "Fourier_line_pairs": 4, + "sharp_three_column_example": [ + [ + 0, + 1, + 2 + ], + [ + 0, + 50, + 100 + ], + [ + 0, + 99, + 51 + ], + [ + 0, + 0, + 0 + ], + [ + 0, + 21, + 42 + ], + [ + 0, + 42, + 84 + ], + [ + 0, + 63, + 126 + ], + [ + 0, + 84, + 21 + ], + [ + 0, + 105, + 63 + ], + [ + 0, + 126, + 105 + ] + ], + "cross_ratio_exponent": 1, + "cannot_descend": true, + "four_column_attainment": null, + "exact_Gram_entries": 9 + }, + { + "q": 7, + "a": 2, + "b": 2, + "modulus": 441, + "quotient_order": 21, + "cyclotomic_degree": 252, + "prime_cycles": 210, + "cycle_pairs": 9261, + "constant_coset_pairs": 441, + "mixed_coset_pairs": 8820, + "normalized_three_root_sums": [ + [ + 0, + 147, + 294 + ], + [ + 0, + 294, + 147 + ] + ], + "Fourier_line_pairs": 4, + "sharp_three_column_example": [ + [ + 0, + 1, + 2 + ], + [ + 0, + 148, + 296 + ], + [ + 0, + 295, + 149 + ], + [ + 0, + 0, + 0 + ], + [ + 0, + 63, + 126 + ], + [ + 0, + 126, + 252 + ], + [ + 0, + 189, + 378 + ], + [ + 0, + 252, + 63 + ], + [ + 0, + 315, + 189 + ], + [ + 0, + 378, + 315 + ] + ], + "cross_ratio_exponent": 1, + "cannot_descend": true, + "four_column_attainment": null, + "exact_Gram_entries": 9 + } + ], + "cycle_pairs_checked": 14400, + "exact_Gram_entries": 200, + "universal_statement": "q>=5 prime; a,b>=1; q+3 rows; at least four orthogonal columns descend to mu_(3q)", + "eight_row_capacity": "exactly four for every mu_(3^a*5^b), a,b>=1", + "sharp_column_threshold": "three-column examples do not descend when 3^a*q^b>3q" +} diff --git a/research/odd-prime-phase-blocks/retained/source7775/SOURCE-PINS.json b/research/odd-prime-phase-blocks/retained/source7775/SOURCE-PINS.json new file mode 100644 index 0000000000..2f1181113a --- /dev/null +++ b/research/odd-prime-phase-blocks/retained/source7775/SOURCE-PINS.json @@ -0,0 +1,229 @@ +{ + "schema_version": 1, + "sources": [ + { + "repository": "aliromman/integer-mult-bounds", + "commit": "6dbe6e9503f26189833d5ef213aee708679835f2", + "path": "research/fifteenth-root-column-capacity/CREDITS.md", + "retained": "retained/source7769/CREDITS.md", + "sha256": "d8fb2999cb8a844bfb583abbe92795fcc2baf4ed7dd61a03c0cfd7e1484eb76a", + "git_blob": "005092c4edd699409d5f6b253052c94a4aaf0441" + }, + { + "repository": "aliromman/integer-mult-bounds", + "commit": "6dbe6e9503f26189833d5ef213aee708679835f2", + "path": "research/fifteenth-root-column-capacity/PROOF.md", + "retained": "retained/source7769/PROOF.md", + "sha256": "d88fb3f8556f3ec2874bb2c10710609554d5cfa1ae1592cca68052d858c58f90", + "git_blob": "668c92d847065c17a23bb23717cf32145be81d6c" + }, + { + "repository": "aliromman/integer-mult-bounds", + "commit": "6dbe6e9503f26189833d5ef213aee708679835f2", + "path": "research/fifteenth-root-column-capacity/README.md", + "retained": "retained/source7769/README.md", + "sha256": "7084058a854552f69a730b4c217026cab202133dec5ec5c3ac899428bbb870a9", + "git_blob": "37a2995b47e6abf9e3da263955e370bfd808a8bc" + }, + { + "repository": "aliromman/integer-mult-bounds", + "commit": "6dbe6e9503f26189833d5ef213aee708679835f2", + "path": "research/fifteenth-root-column-capacity/RESULT.json", + "retained": "retained/source7769/RESULT.json", + "sha256": "69d7370cbfe8c2ebf15c6a30595a925162272366b210292002ca6a15fd0056b0", + "git_blob": "e762c8acce3ee289689167cf491dbe82c95e30e0" + }, + { + "repository": "aliromman/integer-mult-bounds", + "commit": "6dbe6e9503f26189833d5ef213aee708679835f2", + "path": "research/fifteenth-root-column-capacity/SOURCE-PINS.json", + "retained": "retained/source7769/SOURCE-PINS.json", + "sha256": "9cc8f20c3e6690c032d6e0c113fad49268b2997946858a11a1831628452603be", + "git_blob": "2594116cf4344373b82b90587376fbdd9df74978" + }, + { + "repository": "aliromman/integer-mult-bounds", + "commit": "6dbe6e9503f26189833d5ef213aee708679835f2", + "path": "research/fifteenth-root-column-capacity/SOURCES.json", + "retained": "retained/source7769/SOURCES.json", + "sha256": "0761fd793723c2df1e2ca51733251cfd597ff3e120f7e2ee8ebb8e10e8e98c08", + "git_blob": "5335fa97d97f6df5a917eea1ee2fcd01c082d261" + }, + { + "repository": "aliromman/integer-mult-bounds", + "commit": "6dbe6e9503f26189833d5ef213aee708679835f2", + "path": "research/fifteenth-root-column-capacity/TASK.json", + "retained": "retained/source7769/TASK.json", + "sha256": "ff09137d6215e14882602e3c0f4c1c0e821e53c3a0dbb052390b060179d04842", + "git_blob": "599b9bd2a0700e4affdf02094253cd7a47b378d4" + }, + { + "repository": "aliromman/integer-mult-bounds", + "commit": "6dbe6e9503f26189833d5ef213aee708679835f2", + "path": "research/fifteenth-root-column-capacity/VERIFY.json", + "retained": "retained/source7769/VERIFY.json", + "sha256": "42fff59764b141363ab2a5ff6ffa467ff56e9c13f5c5d157a3efbdc407b42796", + "git_blob": "bb39353ac6b547855a3a55696384f62a5627f477" + }, + { + "repository": "aliromman/integer-mult-bounds", + "commit": "6dbe6e9503f26189833d5ef213aee708679835f2", + "path": "research/fifteenth-root-column-capacity/retained/source7762/.gitattributes", + "retained": "retained/source7769/retained/source7762/.gitattributes", + "sha256": "3a90a01036aab114f09495dd88d8cc7db233e784ba70377064f11ffa8a1602fd", + "git_blob": "130a3ecaa26bd4a35622a8c5c22f05f14cc4c665" + }, + { + "repository": "aliromman/integer-mult-bounds", + "commit": "6dbe6e9503f26189833d5ef213aee708679835f2", + "path": "research/fifteenth-root-column-capacity/retained/source7762/CREDITS.md", + "retained": "retained/source7769/retained/source7762/CREDITS.md", + "sha256": "0ba30859824881ba0129b911064b19215cad226232bb3a089724f22c8f5be5e9", + "git_blob": "9ca00a2db881b4a7ca95f79372aad31fc08ff3c2" + }, + { + "repository": "aliromman/integer-mult-bounds", + "commit": "6dbe6e9503f26189833d5ef213aee708679835f2", + "path": "research/fifteenth-root-column-capacity/retained/source7762/PROOF.md", + "retained": "retained/source7769/retained/source7762/PROOF.md", + "sha256": "3f43b8ddeffce9e39057162fa4a15667b78e3bdd72da353d8e65aa3caa4d5203", + "git_blob": "33f93945bad645ecd77cf6c00a6bca5bcef52ca4" + }, + { + "repository": "aliromman/integer-mult-bounds", + "commit": "6dbe6e9503f26189833d5ef213aee708679835f2", + "path": "research/fifteenth-root-column-capacity/retained/source7762/README.md", + "retained": "retained/source7769/retained/source7762/README.md", + "sha256": "8a0f975f986e766ef933a2b19165e6e0d46a9e03ed83d81326dcd4b315393fa5", + "git_blob": "be36a951e7b38b169aa35d16d96206510d556cea" + }, + { + "repository": "aliromman/integer-mult-bounds", + "commit": "6dbe6e9503f26189833d5ef213aee708679835f2", + "path": "research/fifteenth-root-column-capacity/retained/source7762/RESULT.json", + "retained": "retained/source7769/retained/source7762/RESULT.json", + "sha256": "749d0afb9fec09cca6ef7bca26c6659480402ea220a5e4d7200910ac32c500a4", + "git_blob": "49eb2cf4ac9679a227766815b06014aac77c91c7" + }, + { + "repository": "aliromman/integer-mult-bounds", + "commit": "6dbe6e9503f26189833d5ef213aee708679835f2", + "path": "research/fifteenth-root-column-capacity/retained/source7762/SOURCE-PINS.json", + "retained": "retained/source7769/retained/source7762/SOURCE-PINS.json", + "sha256": "5f5d4d629e205f572d82c57ffafc12ec2d0678e88f9c8a2ad6ce6fba7a400834", + "git_blob": "df8ae4bc660e2d13c9d90719ebbc3714b9678bb7" + }, + { + "repository": "aliromman/integer-mult-bounds", + "commit": "6dbe6e9503f26189833d5ef213aee708679835f2", + "path": "research/fifteenth-root-column-capacity/retained/source7762/SOURCES.json", + "retained": "retained/source7769/retained/source7762/SOURCES.json", + "sha256": "0761fd793723c2df1e2ca51733251cfd597ff3e120f7e2ee8ebb8e10e8e98c08", + "git_blob": "5335fa97d97f6df5a917eea1ee2fcd01c082d261" + }, + { + "repository": "aliromman/integer-mult-bounds", + "commit": "6dbe6e9503f26189833d5ef213aee708679835f2", + "path": "research/fifteenth-root-column-capacity/retained/source7762/TASK.json", + "retained": "retained/source7769/retained/source7762/TASK.json", + "sha256": "c77a80f1233d8c3f0bb9992fce77d2593629605cb9ec7fa1fadca536b245ea93", + "git_blob": "f7b94713399e7e90b8c08354af4331d6ddc3efed" + }, + { + "repository": "aliromman/integer-mult-bounds", + "commit": "6dbe6e9503f26189833d5ef213aee708679835f2", + "path": "research/fifteenth-root-column-capacity/retained/source7762/VERIFY.json", + "retained": "retained/source7769/retained/source7762/VERIFY.json", + "sha256": "74ba990fc0db5a43dc2e5f5af93483e3510d650807e9eba50781238c072d3ae5", + "git_blob": "6b5afe14f23ec328a2af358dc85eb6ab5b3906cf" + }, + { + "repository": "aliromman/integer-mult-bounds", + "commit": "6dbe6e9503f26189833d5ef213aee708679835f2", + "path": "research/fifteenth-root-column-capacity/retained/source7762/retained/column-completion-PROOF.md", + "retained": "retained/source7769/retained/source7762/retained/column-completion-PROOF.md", + "sha256": "b194084e203a70574397eeafae053af8e9e49d9e519aacfa112f039da2499674", + "git_blob": "5023cdde8762720467f708b28dabda0f0532064e" + }, + { + "repository": "aliromman/integer-mult-bounds", + "commit": "6dbe6e9503f26189833d5ef213aee708679835f2", + "path": "research/fifteenth-root-column-capacity/retained/source7762/retained/two-prime/README.md", + "retained": "retained/source7769/retained/source7762/retained/two-prime/README.md", + "sha256": "fd8223d9bee95195c5eceaa2212d52f1ab0e91ce6673ae9e18fb4d87d0ae638a", + "git_blob": "1c9d65a78f4e8c8f1a7a15f48c30e372fada3f8f" + }, + { + "repository": "aliromman/integer-mult-bounds", + "commit": "6dbe6e9503f26189833d5ef213aee708679835f2", + "path": "research/fifteenth-root-column-capacity/retained/source7762/retained/two-prime/SOURCES.json", + "retained": "retained/source7769/retained/source7762/retained/two-prime/SOURCES.json", + "sha256": "b0b763a0aeda6400ac597c7cd39ab0ee47f1426345673986320e82354bc69e33", + "git_blob": "4b1a8b1b788fadf5cbc6b0d21cce51195cdab973" + }, + { + "repository": "aliromman/integer-mult-bounds", + "commit": "6dbe6e9503f26189833d5ef213aee708679835f2", + "path": "research/fifteenth-root-column-capacity/retained/source7762/retained/two-prime/TASK.json", + "retained": "retained/source7769/retained/source7762/retained/two-prime/TASK.json", + "sha256": "a23e66700d55318ef684428bca00bdd6f421b2592dec379c0542737701ae79d9", + "git_blob": "7fcc4e615ef5bbca3fbef73972828f4484aacaef" + }, + { + "repository": "aliromman/integer-mult-bounds", + "commit": "6dbe6e9503f26189833d5ef213aee708679835f2", + "path": "research/fifteenth-root-column-capacity/retained/source7762/retained/two-prime/VERIFY.json", + "retained": "retained/source7769/retained/source7762/retained/two-prime/VERIFY.json", + "sha256": "953b105013e4448521e8e5f6ca3008bef14c47ee2785d45efdd7b9e664fa12c1", + "git_blob": "807e154f99b58630fc1468c8ed999892af8b48e2" + }, + { + "repository": "aliromman/integer-mult-bounds", + "commit": "6dbe6e9503f26189833d5ef213aee708679835f2", + "path": "research/fifteenth-root-column-capacity/retained/source7762/retained/two-prime/verify.py", + "retained": "retained/source7769/retained/source7762/retained/two-prime/verify.py", + "sha256": "cd7ebf036588a0f3fa108f05f5ad9cb3836c1abd7edde6e7507ee8fa0bba3691", + "git_blob": "f44c327017bc3e2720d4fb80c5374e43eb795dae" + }, + { + "repository": "aliromman/integer-mult-bounds", + "commit": "6dbe6e9503f26189833d5ef213aee708679835f2", + "path": "research/fifteenth-root-column-capacity/retained/source7762/verify.py", + "retained": "retained/source7769/retained/source7762/verify.py", + "sha256": "3f875680dce9943ac503f87ae71adba3c4498f7b5d34cbf4b6e0afa492cbcccc", + "git_blob": "7fe9f369d1c78f33ba045da235aa796e1db60f18" + }, + { + "repository": "aliromman/integer-mult-bounds", + "commit": "6dbe6e9503f26189833d5ef213aee708679835f2", + "path": "research/fifteenth-root-column-capacity/retained/source7768/CREDITS.md", + "retained": "retained/source7769/retained/source7768/CREDITS.md", + "sha256": "cf24781eb749a94f8a1dd287c0c577fbf783adddef96819e92f27dfac65d065e", + "git_blob": "ba7ae62d840e35e35952f89ee297d622f3e92b71" + }, + { + "repository": "aliromman/integer-mult-bounds", + "commit": "6dbe6e9503f26189833d5ef213aee708679835f2", + "path": "research/fifteenth-root-column-capacity/retained/source7768/PROOF.md", + "retained": "retained/source7769/retained/source7768/PROOF.md", + "sha256": "8c95e31e7395ec9a1b16a8de616f4242e7d2ca3a4347e11fe76e4217231a3537", + "git_blob": "88f7de6041c614551c50d2d1609e3d494f99028a" + }, + { + "repository": "aliromman/integer-mult-bounds", + "commit": "6dbe6e9503f26189833d5ef213aee708679835f2", + "path": "research/fifteenth-root-column-capacity/retained/source7768/README.md", + "retained": "retained/source7769/retained/source7768/README.md", + "sha256": "f93ea6e248e30a6f09d8597696c5db8585f8a7850d1e1769c2e3f37e47ae1238", + "git_blob": "82a078431882496a1b2fb0e09b4f5efb0def334d" + }, + { + "repository": "aliromman/integer-mult-bounds", + "commit": "6dbe6e9503f26189833d5ef213aee708679835f2", + "path": "research/fifteenth-root-column-capacity/verify.py", + "retained": "retained/source7769/verify.py", + "sha256": "1b375d06a97a7aa849a075948cb34d80764061cdf1d70a2d6384ede3a99fd90c", + "git_blob": "bb19b58a88bddf14c8aaf68e573391ba13add460" + } + ] +} diff --git a/research/odd-prime-phase-blocks/retained/source7775/SOURCES.json b/research/odd-prime-phase-blocks/retained/source7775/SOURCES.json new file mode 100644 index 0000000000..5335fa97d9 --- /dev/null +++ b/research/odd-prime-phase-blocks/retained/source7775/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/odd-prime-phase-blocks/retained/source7775/TASK.json b/research/odd-prime-phase-blocks/retained/source7775/TASK.json new file mode 100644 index 0000000000..153a90debc --- /dev/null +++ b/research/odd-prime-phase-blocks/retained/source7775/TASK.json @@ -0,0 +1,95 @@ +{ + "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": "For q prime at least five and a,b positive, every q+3-row root-phase matrix with at least four orthogonal columns descends from mu_(3^a q^b) to mu_(3q) by row and column phases. Exact eight-row capacity is four for all a,b.", + "scope_change_reason": "Resolve the higher-power alphabet question with a simultaneous-column rigidity argument, using the published two-prime cycle theorem and the complete fifteenth-root capacity certificate.", + "bottleneck_link": "Determine whether enlarging these exact phase alphabets can supply additional orthogonal columns; no physical supplier or caller gain is inferred.", + "budget_minutes": 60, + "stop_rule": "Stop after the all-power descent proof, sharp three-column boundary and exact source-bound controls pass; leave other row counts and extra prime factors explicit.", + "outcome": "completed", + "evidence": "PROOF.md gives the all-power descent and sharpness. verify.py checks exact quotient patterns, cyclotomic examples and unchanged finite capacity; RESULT.json records the full checks.", + "author": "Ali Romman", + "ai_assistance": "Substantial OpenAI Codex assistance in research, implementation, verification and writing", + "open_questions": [ + { + "question": "Which row counts or alphabets with a third prime permit a higher-power capacity gain?", + "why_it_matters": "The proof uses exactly one 3-cycle and one q-cycle in each pairwise sum.", + "first_step": "Identify the changed vanishing-sum type before a new matrix search.", + "blocked_by": "The present theorem fixes q+3 rows and two odd prime divisors." + } + ] +} diff --git a/research/odd-prime-phase-blocks/retained/source7775/VERIFY.json b/research/odd-prime-phase-blocks/retained/source7775/VERIFY.json new file mode 100644 index 0000000000..8864ad531a --- /dev/null +++ b/research/odd-prime-phase-blocks/retained/source7775/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": "Check the quotient-phase collision lemma, exact cycle and Fourier-line certificates, higher-phase three-column witnesses, lifted four-column attainment and unchanged base capacity proof." + }, + { + "argv": [ + "{python}", + "-W", + "error", + "-O", + "-B", + "{package}/verify.py" + ], + "timeout_seconds": 120, + "checks": "Check the quotient-phase collision lemma, exact cycle and Fourier-line certificates, higher-phase three-column witnesses, lifted four-column attainment and unchanged base capacity proof." + } + ] +} diff --git a/research/odd-prime-phase-blocks/retained/source7775/retained/source7769/CREDITS.md b/research/odd-prime-phase-blocks/retained/source7775/retained/source7769/CREDITS.md new file mode 100644 index 0000000000..005092c4ed --- /dev/null +++ b/research/odd-prime-phase-blocks/retained/source7775/retained/source7769/CREDITS.md @@ -0,0 +1,32 @@ +# Sources and credit + +Ali Romman (@aliromman) prepared the complete finite capacity proof, +checker and package with substantial OpenAI Codex assistance. +New material is Apache-2.0. No independent human or formal +proof-kernel acceptance is claimed. + +Ali Romman's [PR #7768](https://github.com/CrocSwap/integer-mult-bounds/pull/7768) +supplied the [general strict defect bound](https://github.com/aliromman/integer-mult-bounds/blob/fefebaf8285f3c46f75a815657acbf48780763fb/research/mixed-cycle-column-defect/PROOF.md) +and [open attainment question](https://github.com/aliromman/integer-mult-bounds/blob/fefebaf8285f3c46f75a815657acbf48780763fb/research/mixed-cycle-column-defect/README.md). +Three source notes are retained unchanged. This is motivation for the +finite task; the new capacity proof does not use its spectral bound. + +Ali Romman's [PR #7762](https://github.com/CrocSwap/integer-mult-bounds/pull/7762) +supplied the [projected-star proof and full eight-root census](https://github.com/aliromman/integer-mult-bounds/blob/d33fe8562c86888307cbba4a2aa92490212c8d78/research/mixed-cycle-column-obstruction/PROOF.md) +and [unchanged checker](https://github.com/aliromman/integer-mult-bounds/blob/d33fe8562c86888307cbba4a2aa92490212c8d78/research/mixed-cycle-column-obstruction/verify.py). +All sixteen package files remain byte-exact under `retained/source7762/`. +The finite census supplies the pair-normalization input. + +Nick Petalas (@petalas) supplied the two-prime projection and original +mixed-cycle question in [PR #7744](https://github.com/CrocSwap/integer-mult-bounds/pull/7744). +Its [proof and question](https://github.com/petalas/integer-mult-bounds/blob/7dc85513e8ee9b771a5856f027cf199936f85af0/research/two-prime-column-completion/README.md) +and [checker](https://github.com/petalas/integer-mult-bounds/blob/7dc85513e8ee9b771a5856f027cf199936f85af0/research/two-prime-column-completion/verify.py) +remain in the source closure and replay unchanged. All predecessor +notices, including the earlier completion work and David Ganz's +atlas credit, remain intact. + +The source credits T. Y. Lam and K. H. Leung for the classical +vanishing-cycle theorem. The present fixed-alphabet proof can use the +complete finite census instead. No global literature-priority claim +is made. Source commits are content pins, not claims of ancestry. +`SOURCE-PINS.json` authenticates all nineteen retained files. diff --git a/research/odd-prime-phase-blocks/retained/source7775/retained/source7769/PROOF.md b/research/odd-prime-phase-blocks/retained/source7775/retained/source7769/PROOF.md new file mode 100644 index 0000000000..668c92d847 --- /dev/null +++ b/research/odd-prime-phase-blocks/retained/source7775/retained/source7769/PROOF.md @@ -0,0 +1,132 @@ +# Exactly four columns over fifteenth roots + +Ali Romman with substantial OpenAI Codex assistance. Apache-2.0. + +Let zeta be a primitive fifteenth root of unity. The largest number of +pairwise orthogonal columns of length eight with entries among powers of zeta is +exactly four. This resolves the q=5,b=1 attainment question in +[PR #7768](https://github.com/CrocSwap/integer-mult-bounds/pull/7768), +whose general column-defect bound permits five columns. + +This is a complete finite certificate with an attaining example. It is +not a failed search. Larger alphabets of order 3*5^b with b>1 remain +outside the finite domain. No physical supplier or new kappa follows. + +## 1. Normalize any pair of columns + +Row phases make the first column constant 1. The second column is now +a zero sum of eight fifteenth roots. The complete source census checks +all C(22,8)=319,770 multisets in the integral basis modulo + +```text +Phi_15(X) = X^8-X^7+X^5-X^4+X^3-X+1. +``` + +It finds exactly fifteen zero multisets. Each is one rotated 3-cycle +and one rotated 5-cycle. This also follows from the classical cycle +theorem, but the finite census suffices here. See the +[pinned source proof](https://github.com/aliromman/integer-mult-bounds/blob/d33fe8562c86888307cbba4a2aa92490212c8d78/research/mixed-cycle-column-obstruction/PROOF.md) +and [unchanged source checker](https://github.com/aliromman/integer-mult-bounds/blob/d33fe8562c86888307cbba4a2aa92490212c8d78/research/mixed-cycle-column-obstruction/verify.py). + +The fifteen multisets are exactly the scalar shifts of + +```text +v = (0,5,10,0,3,6,9,12), +``` + +where an exponent e denotes zeta^e. The checker compares both sets +exactly. A phase on the second column and a row permutation therefore +put every orthogonal pair into the form (1,zeta^v). These operations +preserve the alphabet and all other orthogonality relations. + +Each additional column can be scaled independently to make its first +entry 1. Its exponent vector then begins with zero. This does not +change the fixed pair. No row or column phase outside the original +alphabet is used. + +## 2. Enumerate every possible extension + +The new checker first examines all C(21,7)=116,280 nondecreasing +seven-term tails, with the first exponent fixed to zero. Polynomial +reduction finds exactly seven possible zero-sum supports. A recursive +multiset permutation gives all 20,160 normalized columns orthogonal +to the first column. A separate enumeration uses the fifteen rotated +cycle multisets and ordinary permutations. The two full sets agree. + +Exactly 95 candidates are also orthogonal to zeta^v. Every decision +is checked in two exact integral bases: direct polynomial division +by Phi_15 and the tensor basis of Q(omega,zeta_5). The basis map uses + +```text +zeta^e = omega^(2e) zeta_5^(2e). +``` + +The cycle-support membership check gives a third comparison for these +20,160 decisions. No floating-point tolerance is used. + +Let G have these 95 candidates as its vertices, in lexicographic order. +An edge means that the corresponding columns are orthogonal. All +C(95,2)=4,465 pairs are tested in both exact bases. The graph has twelve +edges. Its only nontrivial connected components are the cycles + +```text +0 -- 67 -- 2 -- 66 -- 1 -- 68 -- 0, +19 -- 51 -- 20 -- 52 -- 21 -- 53 -- 19. +``` + +The other 83 vertices are isolated. All vectors, edges and components +are in `RESULT.json`. Connected-component traversal checks these two +six-cycles. Separate checks examine every one of the 138,415 vertex +triples and every edge's bitset of common neighbors. Both find no +triangle. + +Five mutually orthogonal columns would give three additional columns +after pair normalization. They would form a triangle in G, which is +impossible. Thus at most four columns exist. With the fixed normalized +pair, there are exactly twelve four-column sets and 83 maximal +three-column sets. These are labeled, normalized counts, not counts +up to every matrix equivalence. + +## 3. An attaining matrix + +Use the following exponent matrix; replace each entry e by zeta^e. + +```text +0 0 0 0 +0 5 0 10 +0 10 10 5 +0 0 5 10 +0 3 6 4 +0 6 12 13 +0 9 3 7 +0 12 9 1 +``` + +The four columns are the constant column, v, vertex 0 and vertex 67. +The checker computes every Gram entry. Its diagonal is 8 and all +other entries are zero, in both exact bases. Therefore four columns +are attainable and the maximum is exactly four. + +The checker rejects all 448 changes obtained by replacing one entry +with any of the other fourteen roots. It also checks each candidate's +self-norm and distinguishes the wrong bilinear pairing that omits +complex conjugation. These controls make the orthogonality convention +explicit. + +## Evidence and limits + +All nineteen retained files have exact SHA-256 and Git-blob pins. +The complete PR7762 checker and its nested PR7744 replay run unchanged. +The new enumeration and full graph are checked in normal and optimized +Python modes. The saved certificate is compared with a full recomputation. +The statement is finite and exhaustive within the specified alphabet, +row count and exact orthogonality condition. + +The source general bound remains valid for every b>=1, but this sharp +capacity proof fixes b=1. It does not classify all matrices under full +row and column equivalence. Other row counts, larger alphabets, +approximate orthogonality, physical preparation and complete caller +pricing remain open. All five framework assumptions and the selected +frontier remain unchanged. No selected cold replay, Lean, Docker, +independent human acceptance or formal proof kernel was used. +No global literature priority is claimed. diff --git a/research/odd-prime-phase-blocks/retained/source7775/retained/source7769/README.md b/research/odd-prime-phase-blocks/retained/source7775/retained/source7769/README.md new file mode 100644 index 0000000000..37a2995b47 --- /dev/null +++ b/research/odd-prime-phase-blocks/retained/source7775/retained/source7769/README.md @@ -0,0 +1,33 @@ +# Exact fifteenth-root column capacity + +Eight rows over fifteenth roots support exactly four orthogonal +columns. The proof gives an attaining matrix and excludes five by a +complete normalized extension graph. Its 95 vertices form two +six-cycles and 83 isolated vertices, so no triangle exists. + +Read [PROOF.md](PROOF.md), [RESULT.json](RESULT.json), +[verify.py](verify.py), [SOURCE-PINS.json](SOURCE-PINS.json) and +[CREDITS.md](CREDITS.md). The general source bound permitted five +columns; this finite result determines the exact count. + +Run with Python 3.12 and the standard library: + +```sh +python3.12 -B scripts/research_package.py --package research/fifteenth-root-column-capacity +``` + +Both registered modes print `PASS_FIFTEENTH_ROOT_COLUMN_CAPACITY`. +The source verifier runs unchanged. No new kappa or physical supplier +follows. All five assumptions and the selected frontier remain. + +## Open next questions + +- Determine whether four is also the sharp count over roots of order + 3*5^b for b>1. First control the extra prime-power cosets; the present + normalization does not remove them. +- Resolve an exact column capacity at another row count and alphabet. + State a new finite domain or supply a general proof. +- Connect a valid matrix to a physical preparation and caller cost. + Exact orthogonality alone does not supply that implementation. + +Ali Romman with substantial OpenAI Codex assistance. Apache-2.0. diff --git a/research/odd-prime-phase-blocks/retained/source7775/retained/source7769/RESULT.json b/research/odd-prime-phase-blocks/retained/source7775/retained/source7769/RESULT.json new file mode 100644 index 0000000000..e762c8acce --- /dev/null +++ b/research/odd-prime-phase-blocks/retained/source7775/retained/source7769/RESULT.json @@ -0,0 +1,1559 @@ +{ + "source_files": 19, + "exact_capacity": 4, + "enumeration": { + "tail_multisets_examined": 116280, + "zero_supports": [ + [ + 0, + 0, + 3, + 5, + 6, + 9, + 10, + 12 + ], + [ + 0, + 1, + 3, + 6, + 6, + 9, + 11, + 12 + ], + [ + 0, + 1, + 4, + 5, + 7, + 10, + 10, + 13 + ], + [ + 0, + 2, + 3, + 6, + 7, + 9, + 12, + 12 + ], + [ + 0, + 2, + 5, + 5, + 8, + 10, + 11, + 14 + ], + [ + 0, + 3, + 3, + 6, + 8, + 9, + 12, + 13 + ], + [ + 0, + 3, + 4, + 6, + 9, + 9, + 12, + 14 + ] + ], + "normalized_candidates": 20160, + "pair_normalization_orbit": [ + [ + 0, + 0, + 3, + 5, + 6, + 9, + 10, + 12 + ], + [ + 0, + 1, + 3, + 6, + 6, + 9, + 11, + 12 + ], + [ + 0, + 1, + 4, + 5, + 7, + 10, + 10, + 13 + ], + [ + 0, + 2, + 3, + 6, + 7, + 9, + 12, + 12 + ], + [ + 0, + 2, + 5, + 5, + 8, + 10, + 11, + 14 + ], + [ + 0, + 3, + 3, + 6, + 8, + 9, + 12, + 13 + ], + [ + 0, + 3, + 4, + 6, + 9, + 9, + 12, + 14 + ], + [ + 1, + 1, + 4, + 6, + 7, + 10, + 11, + 13 + ], + [ + 1, + 2, + 4, + 7, + 7, + 10, + 12, + 13 + ], + [ + 1, + 2, + 5, + 6, + 8, + 11, + 11, + 14 + ], + [ + 1, + 3, + 4, + 7, + 8, + 10, + 13, + 13 + ], + [ + 1, + 4, + 4, + 7, + 9, + 10, + 13, + 14 + ], + [ + 2, + 2, + 5, + 7, + 8, + 11, + 12, + 14 + ], + [ + 2, + 3, + 5, + 8, + 8, + 11, + 13, + 14 + ], + [ + 2, + 4, + 5, + 8, + 9, + 11, + 14, + 14 + ] + ] + }, + "extension_graph": { + "vertices": [ + [ + 0, + 0, + 10, + 5, + 6, + 12, + 3, + 9 + ], + [ + 0, + 0, + 10, + 5, + 9, + 3, + 12, + 6 + ], + [ + 0, + 0, + 10, + 5, + 12, + 9, + 6, + 3 + ], + [ + 0, + 1, + 11, + 3, + 9, + 12, + 6, + 6 + ], + [ + 0, + 1, + 11, + 6, + 6, + 12, + 3, + 9 + ], + [ + 0, + 1, + 11, + 6, + 9, + 3, + 12, + 6 + ], + [ + 0, + 1, + 11, + 6, + 12, + 9, + 6, + 3 + ], + [ + 0, + 1, + 11, + 9, + 6, + 12, + 6, + 3 + ], + [ + 0, + 2, + 12, + 7, + 6, + 12, + 3, + 9 + ], + [ + 0, + 2, + 12, + 7, + 9, + 3, + 12, + 6 + ], + [ + 0, + 2, + 12, + 7, + 12, + 9, + 6, + 3 + ], + [ + 0, + 3, + 13, + 8, + 6, + 12, + 3, + 9 + ], + [ + 0, + 3, + 13, + 8, + 9, + 3, + 12, + 6 + ], + [ + 0, + 3, + 13, + 8, + 12, + 9, + 6, + 3 + ], + [ + 0, + 4, + 14, + 6, + 12, + 9, + 3, + 9 + ], + [ + 0, + 4, + 14, + 9, + 6, + 12, + 3, + 9 + ], + [ + 0, + 4, + 14, + 9, + 9, + 3, + 12, + 6 + ], + [ + 0, + 4, + 14, + 9, + 12, + 9, + 6, + 3 + ], + [ + 0, + 4, + 14, + 12, + 9, + 9, + 3, + 6 + ], + [ + 0, + 5, + 0, + 10, + 6, + 12, + 3, + 9 + ], + [ + 0, + 5, + 0, + 10, + 9, + 3, + 12, + 6 + ], + [ + 0, + 5, + 0, + 10, + 12, + 9, + 6, + 3 + ], + [ + 0, + 6, + 1, + 11, + 6, + 12, + 3, + 9 + ], + [ + 0, + 6, + 1, + 11, + 9, + 3, + 12, + 6 + ], + [ + 0, + 6, + 1, + 11, + 12, + 9, + 6, + 3 + ], + [ + 0, + 7, + 2, + 3, + 12, + 12, + 6, + 9 + ], + [ + 0, + 7, + 2, + 6, + 12, + 3, + 12, + 9 + ], + [ + 0, + 7, + 2, + 12, + 6, + 12, + 3, + 9 + ], + [ + 0, + 7, + 2, + 12, + 9, + 3, + 12, + 6 + ], + [ + 0, + 7, + 2, + 12, + 12, + 9, + 6, + 3 + ], + [ + 0, + 8, + 3, + 13, + 6, + 12, + 3, + 9 + ], + [ + 0, + 8, + 3, + 13, + 9, + 3, + 12, + 6 + ], + [ + 0, + 8, + 3, + 13, + 12, + 9, + 6, + 3 + ], + [ + 0, + 9, + 4, + 14, + 6, + 12, + 3, + 9 + ], + [ + 0, + 9, + 4, + 14, + 9, + 3, + 12, + 6 + ], + [ + 0, + 9, + 4, + 14, + 12, + 9, + 6, + 3 + ], + [ + 0, + 10, + 5, + 0, + 6, + 12, + 3, + 9 + ], + [ + 0, + 10, + 5, + 0, + 9, + 3, + 12, + 6 + ], + [ + 0, + 10, + 5, + 0, + 12, + 9, + 6, + 3 + ], + [ + 0, + 10, + 5, + 1, + 7, + 13, + 4, + 10 + ], + [ + 0, + 10, + 5, + 1, + 10, + 4, + 13, + 7 + ], + [ + 0, + 10, + 5, + 1, + 13, + 10, + 7, + 4 + ], + [ + 0, + 10, + 5, + 2, + 8, + 14, + 5, + 11 + ], + [ + 0, + 10, + 5, + 2, + 11, + 5, + 14, + 8 + ], + [ + 0, + 10, + 5, + 2, + 14, + 11, + 8, + 5 + ], + [ + 0, + 10, + 5, + 3, + 0, + 12, + 9, + 6 + ], + [ + 0, + 10, + 5, + 3, + 9, + 0, + 6, + 12 + ], + [ + 0, + 10, + 5, + 3, + 12, + 6, + 0, + 9 + ], + [ + 0, + 10, + 5, + 4, + 1, + 13, + 10, + 7 + ], + [ + 0, + 10, + 5, + 4, + 10, + 1, + 7, + 13 + ], + [ + 0, + 10, + 5, + 4, + 13, + 7, + 1, + 10 + ], + [ + 0, + 10, + 5, + 5, + 2, + 14, + 11, + 8 + ], + [ + 0, + 10, + 5, + 5, + 11, + 2, + 8, + 14 + ], + [ + 0, + 10, + 5, + 5, + 14, + 8, + 2, + 11 + ], + [ + 0, + 10, + 5, + 6, + 0, + 9, + 3, + 12 + ], + [ + 0, + 10, + 5, + 6, + 3, + 0, + 12, + 9 + ], + [ + 0, + 10, + 5, + 6, + 12, + 3, + 9, + 0 + ], + [ + 0, + 10, + 5, + 7, + 1, + 10, + 4, + 13 + ], + [ + 0, + 10, + 5, + 7, + 4, + 1, + 13, + 10 + ], + [ + 0, + 10, + 5, + 7, + 13, + 4, + 10, + 1 + ], + [ + 0, + 10, + 5, + 8, + 2, + 11, + 5, + 14 + ], + [ + 0, + 10, + 5, + 8, + 5, + 2, + 14, + 11 + ], + [ + 0, + 10, + 5, + 8, + 14, + 5, + 11, + 2 + ], + [ + 0, + 10, + 5, + 9, + 0, + 6, + 12, + 3 + ], + [ + 0, + 10, + 5, + 9, + 3, + 12, + 6, + 0 + ], + [ + 0, + 10, + 5, + 9, + 6, + 3, + 0, + 12 + ], + [ + 0, + 10, + 5, + 10, + 1, + 7, + 13, + 4 + ], + [ + 0, + 10, + 5, + 10, + 4, + 13, + 7, + 1 + ], + [ + 0, + 10, + 5, + 10, + 7, + 4, + 1, + 13 + ], + [ + 0, + 10, + 5, + 11, + 2, + 8, + 14, + 5 + ], + [ + 0, + 10, + 5, + 11, + 5, + 14, + 8, + 2 + ], + [ + 0, + 10, + 5, + 11, + 8, + 5, + 2, + 14 + ], + [ + 0, + 10, + 5, + 12, + 3, + 9, + 0, + 6 + ], + [ + 0, + 10, + 5, + 12, + 6, + 0, + 9, + 3 + ], + [ + 0, + 10, + 5, + 12, + 9, + 6, + 3, + 0 + ], + [ + 0, + 10, + 5, + 13, + 4, + 10, + 1, + 7 + ], + [ + 0, + 10, + 5, + 13, + 7, + 1, + 10, + 4 + ], + [ + 0, + 10, + 5, + 13, + 10, + 7, + 4, + 1 + ], + [ + 0, + 10, + 5, + 14, + 5, + 11, + 2, + 8 + ], + [ + 0, + 10, + 5, + 14, + 8, + 2, + 11, + 5 + ], + [ + 0, + 10, + 5, + 14, + 11, + 8, + 5, + 2 + ], + [ + 0, + 11, + 6, + 1, + 6, + 12, + 3, + 9 + ], + [ + 0, + 11, + 6, + 1, + 9, + 3, + 12, + 6 + ], + [ + 0, + 11, + 6, + 1, + 12, + 9, + 6, + 3 + ], + [ + 0, + 12, + 7, + 2, + 6, + 12, + 3, + 9 + ], + [ + 0, + 12, + 7, + 2, + 9, + 3, + 12, + 6 + ], + [ + 0, + 12, + 7, + 2, + 12, + 9, + 6, + 3 + ], + [ + 0, + 13, + 8, + 3, + 6, + 12, + 3, + 9 + ], + [ + 0, + 13, + 8, + 3, + 9, + 3, + 12, + 6 + ], + [ + 0, + 13, + 8, + 3, + 12, + 9, + 6, + 3 + ], + [ + 0, + 13, + 8, + 9, + 6, + 3, + 12, + 3 + ], + [ + 0, + 13, + 8, + 12, + 6, + 9, + 3, + 3 + ], + [ + 0, + 14, + 9, + 4, + 6, + 12, + 3, + 9 + ], + [ + 0, + 14, + 9, + 4, + 9, + 3, + 12, + 6 + ], + [ + 0, + 14, + 9, + 4, + 12, + 9, + 6, + 3 + ] + ], + "edges": [ + [ + 0, + 67 + ], + [ + 0, + 68 + ], + [ + 1, + 66 + ], + [ + 1, + 68 + ], + [ + 2, + 66 + ], + [ + 2, + 67 + ], + [ + 19, + 51 + ], + [ + 19, + 53 + ], + [ + 20, + 51 + ], + [ + 20, + 52 + ], + [ + 21, + 52 + ], + [ + 21, + 53 + ] + ], + "components": [ + [ + 0, + 1, + 2, + 66, + 67, + 68 + ], + [ + 3 + ], + [ + 4 + ], + [ + 5 + ], + [ + 6 + ], + [ + 7 + ], + [ + 8 + ], + [ + 9 + ], + [ + 10 + ], + [ + 11 + ], + [ + 12 + ], + [ + 13 + ], + [ + 14 + ], + [ + 15 + ], + [ + 16 + ], + [ + 17 + ], + [ + 18 + ], + [ + 19, + 20, + 21, + 51, + 52, + 53 + ], + [ + 22 + ], + [ + 23 + ], + [ + 24 + ], + [ + 25 + ], + [ + 26 + ], + [ + 27 + ], + [ + 28 + ], + [ + 29 + ], + [ + 30 + ], + [ + 31 + ], + [ + 32 + ], + [ + 33 + ], + [ + 34 + ], + [ + 35 + ], + [ + 36 + ], + [ + 37 + ], + [ + 38 + ], + [ + 39 + ], + [ + 40 + ], + [ + 41 + ], + [ + 42 + ], + [ + 43 + ], + [ + 44 + ], + [ + 45 + ], + [ + 46 + ], + [ + 47 + ], + [ + 48 + ], + [ + 49 + ], + [ + 50 + ], + [ + 54 + ], + [ + 55 + ], + [ + 56 + ], + [ + 57 + ], + [ + 58 + ], + [ + 59 + ], + [ + 60 + ], + [ + 61 + ], + [ + 62 + ], + [ + 63 + ], + [ + 64 + ], + [ + 65 + ], + [ + 69 + ], + [ + 70 + ], + [ + 71 + ], + [ + 72 + ], + [ + 73 + ], + [ + 74 + ], + [ + 75 + ], + [ + 76 + ], + [ + 77 + ], + [ + 78 + ], + [ + 79 + ], + [ + 80 + ], + [ + 81 + ], + [ + 82 + ], + [ + 83 + ], + [ + 84 + ], + [ + 85 + ], + [ + 86 + ], + [ + 87 + ], + [ + 88 + ], + [ + 89 + ], + [ + 90 + ], + [ + 91 + ], + [ + 92 + ], + [ + 93 + ], + [ + 94 + ] + ], + "pair_checks": 4465, + "triple_checks": 138415, + "maximal_three_column_sets": 83, + "maximal_four_column_sets": 12, + "attaining_matrix_rows": [ + [ + 0, + 0, + 0, + 0 + ], + [ + 0, + 5, + 0, + 10 + ], + [ + 0, + 10, + 10, + 5 + ], + [ + 0, + 0, + 5, + 10 + ], + [ + 0, + 3, + 6, + 4 + ], + [ + 0, + 6, + 12, + 13 + ], + [ + 0, + 9, + 3, + 7 + ], + [ + 0, + 12, + 9, + 1 + ] + ], + "single_entry_mutations_rejected": 448, + "wrong_bilinear_edge_count": 1540 + } +} diff --git a/research/odd-prime-phase-blocks/retained/source7775/retained/source7769/SOURCE-PINS.json b/research/odd-prime-phase-blocks/retained/source7775/retained/source7769/SOURCE-PINS.json new file mode 100644 index 0000000000..2594116cf4 --- /dev/null +++ b/research/odd-prime-phase-blocks/retained/source7775/retained/source7769/SOURCE-PINS.json @@ -0,0 +1,157 @@ +{ + "schema_version": 1, + "sources": [ + { + "repository": "aliromman/integer-mult-bounds", + "commit": "d33fe8562c86888307cbba4a2aa92490212c8d78", + "path": "research/mixed-cycle-column-obstruction/.gitattributes", + "retained": "retained/source7762/.gitattributes", + "git_blob": "130a3ecaa26bd4a35622a8c5c22f05f14cc4c665", + "sha256": "3a90a01036aab114f09495dd88d8cc7db233e784ba70377064f11ffa8a1602fd" + }, + { + "repository": "aliromman/integer-mult-bounds", + "commit": "d33fe8562c86888307cbba4a2aa92490212c8d78", + "path": "research/mixed-cycle-column-obstruction/CREDITS.md", + "retained": "retained/source7762/CREDITS.md", + "git_blob": "9ca00a2db881b4a7ca95f79372aad31fc08ff3c2", + "sha256": "0ba30859824881ba0129b911064b19215cad226232bb3a089724f22c8f5be5e9" + }, + { + "repository": "aliromman/integer-mult-bounds", + "commit": "d33fe8562c86888307cbba4a2aa92490212c8d78", + "path": "research/mixed-cycle-column-obstruction/PROOF.md", + "retained": "retained/source7762/PROOF.md", + "git_blob": "33f93945bad645ecd77cf6c00a6bca5bcef52ca4", + "sha256": "3f43b8ddeffce9e39057162fa4a15667b78e3bdd72da353d8e65aa3caa4d5203" + }, + { + "repository": "aliromman/integer-mult-bounds", + "commit": "d33fe8562c86888307cbba4a2aa92490212c8d78", + "path": "research/mixed-cycle-column-obstruction/README.md", + "retained": "retained/source7762/README.md", + "git_blob": "be36a951e7b38b169aa35d16d96206510d556cea", + "sha256": "8a0f975f986e766ef933a2b19165e6e0d46a9e03ed83d81326dcd4b315393fa5" + }, + { + "repository": "aliromman/integer-mult-bounds", + "commit": "d33fe8562c86888307cbba4a2aa92490212c8d78", + "path": "research/mixed-cycle-column-obstruction/RESULT.json", + "retained": "retained/source7762/RESULT.json", + "git_blob": "49eb2cf4ac9679a227766815b06014aac77c91c7", + "sha256": "749d0afb9fec09cca6ef7bca26c6659480402ea220a5e4d7200910ac32c500a4" + }, + { + "repository": "aliromman/integer-mult-bounds", + "commit": "d33fe8562c86888307cbba4a2aa92490212c8d78", + "path": "research/mixed-cycle-column-obstruction/SOURCE-PINS.json", + "retained": "retained/source7762/SOURCE-PINS.json", + "git_blob": "df8ae4bc660e2d13c9d90719ebbc3714b9678bb7", + "sha256": "5f5d4d629e205f572d82c57ffafc12ec2d0678e88f9c8a2ad6ce6fba7a400834" + }, + { + "repository": "aliromman/integer-mult-bounds", + "commit": "d33fe8562c86888307cbba4a2aa92490212c8d78", + "path": "research/mixed-cycle-column-obstruction/SOURCES.json", + "retained": "retained/source7762/SOURCES.json", + "git_blob": "5335fa97d97f6df5a917eea1ee2fcd01c082d261", + "sha256": "0761fd793723c2df1e2ca51733251cfd597ff3e120f7e2ee8ebb8e10e8e98c08" + }, + { + "repository": "aliromman/integer-mult-bounds", + "commit": "d33fe8562c86888307cbba4a2aa92490212c8d78", + "path": "research/mixed-cycle-column-obstruction/TASK.json", + "retained": "retained/source7762/TASK.json", + "git_blob": "f7b94713399e7e90b8c08354af4331d6ddc3efed", + "sha256": "c77a80f1233d8c3f0bb9992fce77d2593629605cb9ec7fa1fadca536b245ea93" + }, + { + "repository": "aliromman/integer-mult-bounds", + "commit": "d33fe8562c86888307cbba4a2aa92490212c8d78", + "path": "research/mixed-cycle-column-obstruction/VERIFY.json", + "retained": "retained/source7762/VERIFY.json", + "git_blob": "6b5afe14f23ec328a2af358dc85eb6ab5b3906cf", + "sha256": "74ba990fc0db5a43dc2e5f5af93483e3510d650807e9eba50781238c072d3ae5" + }, + { + "repository": "aliromman/integer-mult-bounds", + "commit": "d33fe8562c86888307cbba4a2aa92490212c8d78", + "path": "research/mixed-cycle-column-obstruction/retained/column-completion-PROOF.md", + "retained": "retained/source7762/retained/column-completion-PROOF.md", + "git_blob": "5023cdde8762720467f708b28dabda0f0532064e", + "sha256": "b194084e203a70574397eeafae053af8e9e49d9e519aacfa112f039da2499674" + }, + { + "repository": "aliromman/integer-mult-bounds", + "commit": "d33fe8562c86888307cbba4a2aa92490212c8d78", + "path": "research/mixed-cycle-column-obstruction/retained/two-prime/README.md", + "retained": "retained/source7762/retained/two-prime/README.md", + "git_blob": "1c9d65a78f4e8c8f1a7a15f48c30e372fada3f8f", + "sha256": "fd8223d9bee95195c5eceaa2212d52f1ab0e91ce6673ae9e18fb4d87d0ae638a" + }, + { + "repository": "aliromman/integer-mult-bounds", + "commit": "d33fe8562c86888307cbba4a2aa92490212c8d78", + "path": "research/mixed-cycle-column-obstruction/retained/two-prime/SOURCES.json", + "retained": "retained/source7762/retained/two-prime/SOURCES.json", + "git_blob": "4b1a8b1b788fadf5cbc6b0d21cce51195cdab973", + "sha256": "b0b763a0aeda6400ac597c7cd39ab0ee47f1426345673986320e82354bc69e33" + }, + { + "repository": "aliromman/integer-mult-bounds", + "commit": "d33fe8562c86888307cbba4a2aa92490212c8d78", + "path": "research/mixed-cycle-column-obstruction/retained/two-prime/TASK.json", + "retained": "retained/source7762/retained/two-prime/TASK.json", + "git_blob": "7fcc4e615ef5bbca3fbef73972828f4484aacaef", + "sha256": "a23e66700d55318ef684428bca00bdd6f421b2592dec379c0542737701ae79d9" + }, + { + "repository": "aliromman/integer-mult-bounds", + "commit": "d33fe8562c86888307cbba4a2aa92490212c8d78", + "path": "research/mixed-cycle-column-obstruction/retained/two-prime/VERIFY.json", + "retained": "retained/source7762/retained/two-prime/VERIFY.json", + "git_blob": "807e154f99b58630fc1468c8ed999892af8b48e2", + "sha256": "953b105013e4448521e8e5f6ca3008bef14c47ee2785d45efdd7b9e664fa12c1" + }, + { + "repository": "aliromman/integer-mult-bounds", + "commit": "d33fe8562c86888307cbba4a2aa92490212c8d78", + "path": "research/mixed-cycle-column-obstruction/retained/two-prime/verify.py", + "retained": "retained/source7762/retained/two-prime/verify.py", + "git_blob": "f44c327017bc3e2720d4fb80c5374e43eb795dae", + "sha256": "cd7ebf036588a0f3fa108f05f5ad9cb3836c1abd7edde6e7507ee8fa0bba3691" + }, + { + "repository": "aliromman/integer-mult-bounds", + "commit": "d33fe8562c86888307cbba4a2aa92490212c8d78", + "path": "research/mixed-cycle-column-obstruction/verify.py", + "retained": "retained/source7762/verify.py", + "git_blob": "7fe9f369d1c78f33ba045da235aa796e1db60f18", + "sha256": "3f875680dce9943ac503f87ae71adba3c4498f7b5d34cbf4b6e0afa492cbcccc" + }, + { + "repository": "aliromman/integer-mult-bounds", + "commit": "fefebaf8285f3c46f75a815657acbf48780763fb", + "path": "research/mixed-cycle-column-defect/CREDITS.md", + "retained": "retained/source7768/CREDITS.md", + "git_blob": "ba7ae62d840e35e35952f89ee297d622f3e92b71", + "sha256": "cf24781eb749a94f8a1dd287c0c577fbf783adddef96819e92f27dfac65d065e" + }, + { + "repository": "aliromman/integer-mult-bounds", + "commit": "fefebaf8285f3c46f75a815657acbf48780763fb", + "path": "research/mixed-cycle-column-defect/PROOF.md", + "retained": "retained/source7768/PROOF.md", + "git_blob": "88f7de6041c614551c50d2d1609e3d494f99028a", + "sha256": "8c95e31e7395ec9a1b16a8de616f4242e7d2ca3a4347e11fe76e4217231a3537" + }, + { + "repository": "aliromman/integer-mult-bounds", + "commit": "fefebaf8285f3c46f75a815657acbf48780763fb", + "path": "research/mixed-cycle-column-defect/README.md", + "retained": "retained/source7768/README.md", + "git_blob": "82a078431882496a1b2fb0e09b4f5efb0def334d", + "sha256": "f93ea6e248e30a6f09d8597696c5db8585f8a7850d1e1769c2e3f37e47ae1238" + } + ] +} diff --git a/research/odd-prime-phase-blocks/retained/source7775/retained/source7769/SOURCES.json b/research/odd-prime-phase-blocks/retained/source7775/retained/source7769/SOURCES.json new file mode 100644 index 0000000000..5335fa97d9 --- /dev/null +++ b/research/odd-prime-phase-blocks/retained/source7775/retained/source7769/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/odd-prime-phase-blocks/retained/source7775/retained/source7769/TASK.json b/research/odd-prime-phase-blocks/retained/source7775/retained/source7769/TASK.json new file mode 100644 index 0000000000..599b9bd2a0 --- /dev/null +++ b/research/odd-prime-phase-blocks/retained/source7775/retained/source7769/TASK.json @@ -0,0 +1,91 @@ +{ + "schema_version": 1, + "task_id": "supplier-boundary-audit", + "priority_revision": 8, + "base_commit": "e54523517d0f03e58352e647c403a5af3e525a57", + "original_card": { + "id": "supplier-boundary-audit", + "question": "Does one changed supplier have complete source-bound native, caller, ordinary and outer admission coverage?", + "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" + ], + "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": "Pin the current sources and one obligation; the historical owner audit is an example, not evidence of a current bug.", + "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": "Choose one latest uncovered candidate and build a delta coverage map against the selected review. For P104, #5717 changes owned-lifetime assumptions and #5719 covers exact #5713 causal premises; neither automatically transfers to #5718. For BIT, #5679/#5708 need component admission and compatible outer use. Check controls and exact source identity before reuse; stop with one resolved gap or explicit remaining obligation. A heavy full replay requires a separate serial resource budget.", + "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": [ + "supplier admission", + "5717", + "5719", + "5708", + "owned lifetime" + ], + "existing_checks": [ + { + "scope": "PR #4088: author-checked local words, native receipts, owner/phase fill and exact moment.", + "evidence": "research/staged544-mixed-fourth-entry/README.md", + "remaining": "Rebind and validate ordinary/outer admission with all four providers; full mixed release not established.", + "status": "author-checked", + "source_commit": "72d7efc181edb21806a878f174847c96dd410ab0", + "selected_record_sha256": "bb2eaa58647b353f88d0aec2eafb9d30df1be53589231b23e12ceef3e4bad129" + }, + { + "scope": "PR #3801: successor scatter-boundary decision package.", + "evidence": "research/scatter-boundary-decision/README.md", + "remaining": "Consult its exact acceptance scope before any new exporter audit; not proof of a selected failure.", + "status": "author-checked", + "source_commit": "911f8800ba7a4b03603ef62c5ffc6240e53cb5fd", + "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 of four orthogonal columns in eight rows over fifteenth roots; complete normalized extension graph and attaining matrix.", + "scope_change_reason": "Resolve the q=5,b=1 attainment question left by the general strict column-defect bound in PR7768.", + "bottleneck_link": "Determine the exact column supply allowed by a specified cyclotomic alphabet. No physical supply or caller invoice is inferred.", + "budget_minutes": 60, + "stop_rule": "Stop at a proved scoped obstruction with exact checks, or report the failed implication. Do not infer nonexistence from a failed search.", + "outcome": "completed", + "evidence": "Complete exact cyclotomic census, two candidate enumerations, all pair tests, graph certificate and an attaining four-column matrix.", + "author": "Ali Romman", + "ai_assistance": "Substantial OpenAI Codex assistance in research, implementation, verification and writing", + "open_questions": [ + { + "question": "Does the same sharp count hold over roots of order 3*5^b for b>1?", + "why_it_matters": "The finite fifteenth-root census does not cover the larger alphabet.", + "first_step": "Classify the prime-power cosets in the vanishing inner products.", + "blocked_by": "Column normalization does not by itself remove the extra fifth-power phases." + } + ] +} diff --git a/research/odd-prime-phase-blocks/retained/source7775/retained/source7769/VERIFY.json b/research/odd-prime-phase-blocks/retained/source7775/retained/source7769/VERIFY.json new file mode 100644 index 0000000000..bb39353ac6 --- /dev/null +++ b/research/odd-prime-phase-blocks/retained/source7775/retained/source7769/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": "Check the complete fifteenth-root census, two normalized column enumerations, all compatible pairs, component and triangle certificates, an attaining matrix and controls." + }, + { + "argv": [ + "{python}", + "-W", + "error", + "-O", + "-B", + "{package}/verify.py" + ], + "timeout_seconds": 120, + "checks": "Check the complete fifteenth-root census, two normalized column enumerations, all compatible pairs, component and triangle certificates, an attaining matrix and controls." + } + ] +} diff --git a/research/odd-prime-phase-blocks/retained/source7775/retained/source7769/retained/source7762/.gitattributes b/research/odd-prime-phase-blocks/retained/source7775/retained/source7769/retained/source7762/.gitattributes new file mode 100644 index 0000000000..130a3ecaa2 --- /dev/null +++ b/research/odd-prime-phase-blocks/retained/source7775/retained/source7769/retained/source7762/.gitattributes @@ -0,0 +1 @@ +retained/** -text whitespace=cr-at-eol diff --git a/research/odd-prime-phase-blocks/retained/source7775/retained/source7769/retained/source7762/CREDITS.md b/research/odd-prime-phase-blocks/retained/source7775/retained/source7769/retained/source7762/CREDITS.md new file mode 100644 index 0000000000..9ca00a2db8 --- /dev/null +++ b/research/odd-prime-phase-blocks/retained/source7775/retained/source7769/retained/source7762/CREDITS.md @@ -0,0 +1,32 @@ +# Sources and credit + +Ali Romman (@aliromman) prepared this proof, exact checker and package +with substantial OpenAI Codex assistance. New material is Apache-2.0. +No independent human or formal proof-kernel acceptance is claimed. + +Nick Petalas (@petalas) supplied the two-prime projection and modular sign +argument, the released eight-row/fifteenth-root question, and the unchanged +fixture checker in [PR #7744](https://github.com/CrocSwap/integer-mult-bounds/pull/7744). +The retained [proof and question](https://github.com/petalas/integer-mult-bounds/blob/7dc85513e8ee9b771a5856f027cf199936f85af0/research/two-prime-column-completion/README.md) +and [checker](https://github.com/petalas/integer-mult-bounds/blob/7dc85513e8ee9b771a5856f027cf199936f85af0/research/two-prime-column-completion/verify.py) +identify the exact consumed version. All five source package files remain +byte-exact under `retained/two-prime/`. + +Nick Petalas also supplied the normalized missing-column formula and the +doubled-alphabet theorem in [PR #5865](https://github.com/CrocSwap/integer-mult-bounds/pull/5865). +Its [retained proof](https://github.com/petalas/integer-mult-bounds/blob/7dc85513e8ee9b771a5856f027cf199936f85af0/research/cyclotomic-column-completion/PROOF.md) +is a dependency of Section 2. The source credits David Ganz for atlas B097 +and the pilot application in [PR #2849](https://github.com/CrocSwap/integer-mult-bounds/pull/2849) +and [PR #2855](https://github.com/CrocSwap/integer-mult-bounds/pull/2855). +Those applications are credited through the retained notices; their +scientific suites are not rerun here. + +T. Y. Lam and K. H. Leung supply the classical two-prime cycle decomposition +in [On Vanishing Sums of Roots of Unity, Theorem 3.3 and Corollary 3.4](https://arxiv.org/pdf/math/9511209#page=7). +The new argument uses projected Gram positivity, classifies the resulting +directed edges, removes the completion sign in the mixed case, and applies +a Hermitian trace obstruction. No global literature-priority claim is made. + +Source commits are content pins, not claims of ancestry. `SOURCES.json` +records the canonical main selection and catalogue. `SOURCE-PINS.json` +authenticates all six retained source files before the source replay. diff --git a/research/odd-prime-phase-blocks/retained/source7775/retained/source7769/retained/source7762/PROOF.md b/research/odd-prime-phase-blocks/retained/source7775/retained/source7769/retained/source7762/PROOF.md new file mode 100644 index 0000000000..33f93945ba --- /dev/null +++ b/research/odd-prime-phase-blocks/retained/source7775/retained/source7769/retained/source7762/PROOF.md @@ -0,0 +1,172 @@ +# The mixed-cycle input does not exist + +Ali Romman with substantial OpenAI Codex assistance. Apache-2.0. + +Let q >= 5 be prime, b >= 1, n = q+3 and m = 3q^b. There is no +n-by-(n-1) matrix A with entries in the mth roots of unity and A* A = nI. +In particular, there is no eight-by-seven partial Butson matrix over the +fifteenth roots. This resolves the released input in +[PR #7744](https://github.com/CrocSwap/integer-mult-bounds/pull/7744). +It does not follow from failure to find a matrix. + +The proof first shows that any such partial matrix would complete in the +original alphabet. It then rules out that square completion. The two steps +are necessary: nonexistence of a square Butson matrix alone does not exclude +a partial matrix whose completion needs a larger alphabet. + +## 1. Projected Gram rigidity + +Write omega for a primitive third root and eta for a primitive q^bth root. +Every mth root is uniquely omega^x eta^y. Let pi discard eta, and put +B = pi(A), entry by entry. This is a map on the root group, not a +characteristic-zero ring homomorphism. + +Each inner product of distinct columns of A is a vanishing sum of n roots. +The two-prime cycle theorem of Lam and Leung decomposes it into rotated +3-cycles and q-cycles. The equation 3r+qs=q+3 has only the nonnegative +solution r=s=1: s is zero or one, and s=0 would require 3 to divide q. +Projection kills the 3-cycle and sends the q-cycle to q times a third root. +Thus B has diagonal column Gram entries n and off-diagonal entries q omega^a. +[Lam and Leung, Theorem 3.3 and Corollary 3.4](https://arxiv.org/pdf/math/9511209#page=7) + +For any three columns, the determinant of their Gram matrix is + +```text +n^3 - 3nq^2 + 2q^3 Re(omega^t), +``` + +where omega^t is the product of the three directed off-diagonal phases. +For t=0 this is 27(q+1). For t=1 or 2 it is + +```text +-3q^3 + 27q + 27 < 0, q >= 5. +``` + +For example, q^3 >= 25q makes the expression at most -48q+27. +A Gram matrix is positive semidefinite, so every triangle has t=0. +Scale the columns by third roots to make all off-diagonal Gram entries q. +Then scale rows by third roots to make the first column all ones. These +operations preserve the original alphabet and orthogonality of A. + +Each other projected column has sum q. Its three symbol counts therefore +satisfy c0-c2=q, c1-c2=0 and c0+c1+c2=q+3. Hence they are (q+1,1,1). +Each column is now the all-one column with omega at one row a and omega^2 +at a different row b. Represent it by the directed edge (a,b). + +Two different edges have projected inner product q exactly when they share +their first endpoint, share their second endpoint, or are reverses. This +follows by subtracting their two exponent vectors: the difference must +again have one 1 and one 2, with all other entries zero. A reverse pair +cannot have a third compatible edge. If two non-reverse edges have the +same first endpoint, every other compatible edge has that first endpoint; +the same argument applies to a common second endpoint. Thus a compatible +family of at least three edges is a directed star. + +For n-1 columns there are n-2 edges. Their distinct leaves and common +centre occupy n-1 rows, so exactly one row is unused. For n columns there +are n-1 edges, and the star occupies every row. Both orientations occur in +this necessary projected classification; it does not supply the q-part +of an actual orthogonal matrix. + +## 2. The partial input would complete without a negative sign + +Use the unused row u as the normalization row. The formula from +[PR #5865](https://github.com/CrocSwap/integer-mult-bounds/pull/5865) gives + +```text +w = (nI - AA*) e_u, w_u = 1, H = [A w]. +``` + +It proves H*H=nI and w_i in the 2mth roots. In particular each w_i is +eps omega^x eta^y with eps in {1,-1}. That theorem uses the rank-one +complement, integrality of the displayed formula and Kronecker's theorem; +we retain its proof as a dependency. + +Reduce in the ring R = F_q[X]/(X^2+X+1), with omega sent to X and eta +sent to 1. This is a ring map from Z[omega,eta], since the q^bth +cyclotomic polynomial takes the value q at 1. It commutes with inversion +of roots. R is nonzero and has odd characteristic. The powers of X have +odd order, so their coset and its negative are disjoint. This remains true +when R has zero divisors. + +The unused row of B is all ones. If the star has exponent s in {1,2} +at its centre and -s at each leaf, the projected row sums are + +| Row | Sum across the n-1 supplied columns | Negative sum modulo q | +| --- | --- | --- | +| Centre | 1 + (q+1) omega^s | omega^(-s) | +| Leaf | q+1 + omega^(-s) | omega^s | +| Unused | q+2 | The diagonal term makes w_u=1 | + +The completion formula therefore reduces each w_i to a positive power +of X. Disjoint sign cosets force eps=1 for every i. Thus H uses only +mth roots. Undoing the row and column phases preserves this property. +A different normalization row changes w by an mth root, so the conclusion +does not depend on which row was originally first. + +## 3. No square completion can have these parameters + +Apply Section 1 to a hypothetical n-by-n H. Its projected star has n-1 +leaves. Multiply its centre row by omega^(-s), and order rows and columns +so the constant column is first and each leaf matches its edge column. +The projected matrix then has omega^(-s) on the diagonal and 1 elsewhere. +Scale rows by q^bth roots to make the q-part of every diagonal entry 1. +Consequently + +```text +H = Q + (omega^(-s) - 1) I, +``` + +where Q has entries in the q^bth roots and Q_ii=1. + +For columns i and j, the two nontrivial third-root terms in their inner +product occur at rows i and j. In the unique one-3-cycle/one-q-cycle +decomposition, they must belong to the same 3-cycle, with the same q-part. +Their q-parts are Q_ij and conjugate(Q_ji). Thus Q is Hermitian. +Since omega+omega^2=-1, full orthogonality gives + +```text +HH* = Q^2 - 3Q + 3I = (q+3)I, +Q^2 - 3Q - qI = 0. +``` + +The two possible eigenvalues of Q are (3 +/- sqrt(9+4q))/2. If the first +has integer multiplicity k, the trace condition trace(Q)=n gives + +```text +(2k-n) sqrt(9+4q) = -n. +``` + +For odd q, 9+4q is 5 modulo 8 and cannot be a square. Its square root is +irrational. If 2k-n is nonzero, the displayed equation would make it +rational; if 2k-n is zero, it would give n=0. Both are impossible. +Thus no square H exists. Section 2 now excludes the partial A as well. + +## Evidence and limits + +The checker examines all 319,770 multisets of eight fifteenth roots in an +integer basis modulo Phi_15. Exactly 15 vanish, and these are exactly the +one-3-cycle/one-5-cycle multisets. This separately checks the source cycle +conclusion in the requested small case. + +It examines all 6,561 ternary words of length eight and all 1,540 pairs of +the resulting 56 edge words. A maximal-clique search gives exactly 16 +stars and 28 reverse pairs. A separate fixed-size search finds all 112 +six-edge configurations and compares them with the star subsets. Every +configuration passes the missing-column sign check in both orientations. + +For all 24 primes from 5 through 101 it checks 648 Gram phase assignments, +2,408 completion row residues and every possible spectral multiplicity. +Exact Eisenstein arithmetic checks the Hermitian matrix identity and +rejects missing conjugation, missing diagonal shift and a wrong linear +coefficient. Reverse-pair, nontrivial-phase, opposite-sign, nonorthogonal +projection and excluded-q controls mark the other boundaries. The pinned +PR7744 verifier runs unchanged in both registered modes. + +The theorem for arbitrary q and b is the written proof, not a conclusion +from finite sampling. The checker constructs no valid mixed-case input: +the theorem proves that none exists. No global literature priority is +claimed. Other row counts, more than two prime factors, larger powers of +three, noisy inputs and physical recovery remain outside scope. This +does not improve kappa or discharge any of the five framework assumptions. +No selected cold replay, Lean, Docker or formal proof kernel was run. diff --git a/research/odd-prime-phase-blocks/retained/source7775/retained/source7769/retained/source7762/README.md b/research/odd-prime-phase-blocks/retained/source7775/retained/source7769/retained/source7762/README.md new file mode 100644 index 0000000000..be36a951e7 --- /dev/null +++ b/research/odd-prime-phase-blocks/retained/source7775/retained/source7769/retained/source7762/README.md @@ -0,0 +1,38 @@ +# No mixed-cycle input at q+3 rows + +There is no (q+3)-by-(q+2) partial Butson matrix over roots of order +3q^b when q>=5 is prime and b>=1. In particular, the eight-row, +fifteenth-root input requested in PR7744 does not exist. + +Read [PROOF.md](PROOF.md), [RESULT.json](RESULT.json), +[verify.py](verify.py), [SOURCE-PINS.json](SOURCE-PINS.json) and +[CREDITS.md](CREDITS.md). The proof first forces an original-alphabet +completion, then excludes it by a Hermitian trace contradiction. +It does not infer nonexistence from a search limit. + +Run from the repository root with Python 3.12 and the standard library: + +```sh +python3.12 -B scripts/research_package.py --package research/mixed-cycle-column-obstruction +``` + +Both registered modes print `PASS_MIXED_CYCLE_COLUMN_OBSTRUCTION`. +The retained source replay is unchanged. Exact finite checks support the +written proof; they are not a formal proof-kernel acceptance. + +No physical supplier, new kappa or selected-frontier change follows. +All five framework assumptions remain. The selected cold replay, Lean +and Docker were not run. + +## Open next questions + +- Resolve mixed-cycle counts that admit more than one cycle decomposition. + Start with the projected Gram constraints; the triangle argument above + depends on the precise ratio q/(q+3). +- Determine which parts survive an alphabet of order 3^a q^b with a>1. + The projected phases then have more than three possible values, so a + nontrivial triangle phase need not give a negative minor. +- Connect a valid recovery interface to a complete physical caller cost. + This package supplies an obstruction and no physical recovery routine. + +Ali Romman with substantial OpenAI Codex assistance. Apache-2.0. diff --git a/research/odd-prime-phase-blocks/retained/source7775/retained/source7769/retained/source7762/RESULT.json b/research/odd-prime-phase-blocks/retained/source7775/retained/source7769/retained/source7762/RESULT.json new file mode 100644 index 0000000000..49eb2cf4ac --- /dev/null +++ b/research/odd-prime-phase-blocks/retained/source7775/retained/source7769/retained/source7762/RESULT.json @@ -0,0 +1,191 @@ +{ + "source_files": 6, + "root_sums": { + "multisets_examined": 319770, + "vanishing_multisets": [ + [0,0,3,5,6,9,10,12], + [0,1,3,6,6,9,11,12], + [0,1,4,5,7,10,10,13], + [0,2,3,6,7,9,12,12], + [0,2,5,5,8,10,11,14], + [0,3,3,6,8,9,12,13], + [0,3,4,6,9,9,12,14], + [1,1,4,6,7,10,11,13], + [1,2,4,7,7,10,12,13], + [1,2,5,6,8,11,11,14], + [1,3,4,7,8,10,13,13], + [1,4,4,7,9,10,13,14], + [2,2,5,7,8,11,12,14], + [2,3,5,8,8,11,13,14], + [2,4,5,8,9,11,14,14] + ] + }, + "eight_row_projection": { + "ternary_words_examined": 6561, + "edge_words": 56, + "pair_checks": 1540, + "maximal_cliques": 44, + "stars": 16, + "reverse_pairs": 28, + "partial_configurations": [ + {"edges":[[0,1],[0,2],[0,3],[0,4],[0,5],[0,6]],"reference":7,"completion_mod_five":[2,1,1,1,1,1,1,0]}, + {"edges":[[0,1],[0,2],[0,3],[0,4],[0,5],[0,7]],"reference":6,"completion_mod_five":[2,1,1,1,1,1,0,1]}, + {"edges":[[0,1],[0,2],[0,3],[0,4],[0,6],[0,7]],"reference":5,"completion_mod_five":[2,1,1,1,1,0,1,1]}, + {"edges":[[0,1],[0,2],[0,3],[0,5],[0,6],[0,7]],"reference":4,"completion_mod_five":[2,1,1,1,0,1,1,1]}, + {"edges":[[0,1],[0,2],[0,4],[0,5],[0,6],[0,7]],"reference":3,"completion_mod_five":[2,1,1,0,1,1,1,1]}, + {"edges":[[0,1],[0,3],[0,4],[0,5],[0,6],[0,7]],"reference":2,"completion_mod_five":[2,1,0,1,1,1,1,1]}, + {"edges":[[0,1],[2,1],[3,1],[4,1],[5,1],[6,1]],"reference":7,"completion_mod_five":[2,1,2,2,2,2,2,0]}, + {"edges":[[0,1],[2,1],[3,1],[4,1],[5,1],[7,1]],"reference":6,"completion_mod_five":[2,1,2,2,2,2,0,2]}, + {"edges":[[0,1],[2,1],[3,1],[4,1],[6,1],[7,1]],"reference":5,"completion_mod_five":[2,1,2,2,2,0,2,2]}, + {"edges":[[0,1],[2,1],[3,1],[5,1],[6,1],[7,1]],"reference":4,"completion_mod_five":[2,1,2,2,0,2,2,2]}, + {"edges":[[0,1],[2,1],[4,1],[5,1],[6,1],[7,1]],"reference":3,"completion_mod_five":[2,1,2,0,2,2,2,2]}, + {"edges":[[0,1],[3,1],[4,1],[5,1],[6,1],[7,1]],"reference":2,"completion_mod_five":[2,1,0,2,2,2,2,2]}, + {"edges":[[0,2],[0,3],[0,4],[0,5],[0,6],[0,7]],"reference":1,"completion_mod_five":[2,0,1,1,1,1,1,1]}, + {"edges":[[0,2],[1,2],[3,2],[4,2],[5,2],[6,2]],"reference":7,"completion_mod_five":[2,2,1,2,2,2,2,0]}, + {"edges":[[0,2],[1,2],[3,2],[4,2],[5,2],[7,2]],"reference":6,"completion_mod_five":[2,2,1,2,2,2,0,2]}, + {"edges":[[0,2],[1,2],[3,2],[4,2],[6,2],[7,2]],"reference":5,"completion_mod_five":[2,2,1,2,2,0,2,2]}, + {"edges":[[0,2],[1,2],[3,2],[5,2],[6,2],[7,2]],"reference":4,"completion_mod_five":[2,2,1,2,0,2,2,2]}, + {"edges":[[0,2],[1,2],[4,2],[5,2],[6,2],[7,2]],"reference":3,"completion_mod_five":[2,2,1,0,2,2,2,2]}, + {"edges":[[0,2],[3,2],[4,2],[5,2],[6,2],[7,2]],"reference":1,"completion_mod_five":[2,0,1,2,2,2,2,2]}, + {"edges":[[0,3],[1,3],[2,3],[4,3],[5,3],[6,3]],"reference":7,"completion_mod_five":[2,2,2,1,2,2,2,0]}, + {"edges":[[0,3],[1,3],[2,3],[4,3],[5,3],[7,3]],"reference":6,"completion_mod_five":[2,2,2,1,2,2,0,2]}, + {"edges":[[0,3],[1,3],[2,3],[4,3],[6,3],[7,3]],"reference":5,"completion_mod_five":[2,2,2,1,2,0,2,2]}, + {"edges":[[0,3],[1,3],[2,3],[5,3],[6,3],[7,3]],"reference":4,"completion_mod_five":[2,2,2,1,0,2,2,2]}, + {"edges":[[0,3],[1,3],[4,3],[5,3],[6,3],[7,3]],"reference":2,"completion_mod_five":[2,2,0,1,2,2,2,2]}, + {"edges":[[0,3],[2,3],[4,3],[5,3],[6,3],[7,3]],"reference":1,"completion_mod_five":[2,0,2,1,2,2,2,2]}, + {"edges":[[0,4],[1,4],[2,4],[3,4],[5,4],[6,4]],"reference":7,"completion_mod_five":[2,2,2,2,1,2,2,0]}, + {"edges":[[0,4],[1,4],[2,4],[3,4],[5,4],[7,4]],"reference":6,"completion_mod_five":[2,2,2,2,1,2,0,2]}, + {"edges":[[0,4],[1,4],[2,4],[3,4],[6,4],[7,4]],"reference":5,"completion_mod_five":[2,2,2,2,1,0,2,2]}, + {"edges":[[0,4],[1,4],[2,4],[5,4],[6,4],[7,4]],"reference":3,"completion_mod_five":[2,2,2,0,1,2,2,2]}, + {"edges":[[0,4],[1,4],[3,4],[5,4],[6,4],[7,4]],"reference":2,"completion_mod_five":[2,2,0,2,1,2,2,2]}, + {"edges":[[0,4],[2,4],[3,4],[5,4],[6,4],[7,4]],"reference":1,"completion_mod_five":[2,0,2,2,1,2,2,2]}, + {"edges":[[0,5],[1,5],[2,5],[3,5],[4,5],[6,5]],"reference":7,"completion_mod_five":[2,2,2,2,2,1,2,0]}, + {"edges":[[0,5],[1,5],[2,5],[3,5],[4,5],[7,5]],"reference":6,"completion_mod_five":[2,2,2,2,2,1,0,2]}, + {"edges":[[0,5],[1,5],[2,5],[3,5],[6,5],[7,5]],"reference":4,"completion_mod_five":[2,2,2,2,0,1,2,2]}, + {"edges":[[0,5],[1,5],[2,5],[4,5],[6,5],[7,5]],"reference":3,"completion_mod_five":[2,2,2,0,2,1,2,2]}, + {"edges":[[0,5],[1,5],[3,5],[4,5],[6,5],[7,5]],"reference":2,"completion_mod_five":[2,2,0,2,2,1,2,2]}, + {"edges":[[0,5],[2,5],[3,5],[4,5],[6,5],[7,5]],"reference":1,"completion_mod_five":[2,0,2,2,2,1,2,2]}, + {"edges":[[0,6],[1,6],[2,6],[3,6],[4,6],[5,6]],"reference":7,"completion_mod_five":[2,2,2,2,2,2,1,0]}, + {"edges":[[0,6],[1,6],[2,6],[3,6],[4,6],[7,6]],"reference":5,"completion_mod_five":[2,2,2,2,2,0,1,2]}, + {"edges":[[0,6],[1,6],[2,6],[3,6],[5,6],[7,6]],"reference":4,"completion_mod_five":[2,2,2,2,0,2,1,2]}, + {"edges":[[0,6],[1,6],[2,6],[4,6],[5,6],[7,6]],"reference":3,"completion_mod_five":[2,2,2,0,2,2,1,2]}, + {"edges":[[0,6],[1,6],[3,6],[4,6],[5,6],[7,6]],"reference":2,"completion_mod_five":[2,2,0,2,2,2,1,2]}, + {"edges":[[0,6],[2,6],[3,6],[4,6],[5,6],[7,6]],"reference":1,"completion_mod_five":[2,0,2,2,2,2,1,2]}, + {"edges":[[0,7],[1,7],[2,7],[3,7],[4,7],[5,7]],"reference":6,"completion_mod_five":[2,2,2,2,2,2,0,1]}, + {"edges":[[0,7],[1,7],[2,7],[3,7],[4,7],[6,7]],"reference":5,"completion_mod_five":[2,2,2,2,2,0,2,1]}, + {"edges":[[0,7],[1,7],[2,7],[3,7],[5,7],[6,7]],"reference":4,"completion_mod_five":[2,2,2,2,0,2,2,1]}, + {"edges":[[0,7],[1,7],[2,7],[4,7],[5,7],[6,7]],"reference":3,"completion_mod_five":[2,2,2,0,2,2,2,1]}, + {"edges":[[0,7],[1,7],[3,7],[4,7],[5,7],[6,7]],"reference":2,"completion_mod_five":[2,2,0,2,2,2,2,1]}, + {"edges":[[0,7],[2,7],[3,7],[4,7],[5,7],[6,7]],"reference":1,"completion_mod_five":[2,0,2,2,2,2,2,1]}, + {"edges":[[1,0],[1,2],[1,3],[1,4],[1,5],[1,6]],"reference":7,"completion_mod_five":[1,2,1,1,1,1,1,0]}, + {"edges":[[1,0],[1,2],[1,3],[1,4],[1,5],[1,7]],"reference":6,"completion_mod_five":[1,2,1,1,1,1,0,1]}, + {"edges":[[1,0],[1,2],[1,3],[1,4],[1,6],[1,7]],"reference":5,"completion_mod_five":[1,2,1,1,1,0,1,1]}, + {"edges":[[1,0],[1,2],[1,3],[1,5],[1,6],[1,7]],"reference":4,"completion_mod_five":[1,2,1,1,0,1,1,1]}, + {"edges":[[1,0],[1,2],[1,4],[1,5],[1,6],[1,7]],"reference":3,"completion_mod_five":[1,2,1,0,1,1,1,1]}, + {"edges":[[1,0],[1,3],[1,4],[1,5],[1,6],[1,7]],"reference":2,"completion_mod_five":[1,2,0,1,1,1,1,1]}, + {"edges":[[1,0],[2,0],[3,0],[4,0],[5,0],[6,0]],"reference":7,"completion_mod_five":[1,2,2,2,2,2,2,0]}, + {"edges":[[1,0],[2,0],[3,0],[4,0],[5,0],[7,0]],"reference":6,"completion_mod_five":[1,2,2,2,2,2,0,2]}, + {"edges":[[1,0],[2,0],[3,0],[4,0],[6,0],[7,0]],"reference":5,"completion_mod_five":[1,2,2,2,2,0,2,2]}, + {"edges":[[1,0],[2,0],[3,0],[5,0],[6,0],[7,0]],"reference":4,"completion_mod_five":[1,2,2,2,0,2,2,2]}, + {"edges":[[1,0],[2,0],[4,0],[5,0],[6,0],[7,0]],"reference":3,"completion_mod_five":[1,2,2,0,2,2,2,2]}, + {"edges":[[1,0],[3,0],[4,0],[5,0],[6,0],[7,0]],"reference":2,"completion_mod_five":[1,2,0,2,2,2,2,2]}, + {"edges":[[1,2],[1,3],[1,4],[1,5],[1,6],[1,7]],"reference":0,"completion_mod_five":[0,2,1,1,1,1,1,1]}, + {"edges":[[1,2],[3,2],[4,2],[5,2],[6,2],[7,2]],"reference":0,"completion_mod_five":[0,2,1,2,2,2,2,2]}, + {"edges":[[1,3],[2,3],[4,3],[5,3],[6,3],[7,3]],"reference":0,"completion_mod_five":[0,2,2,1,2,2,2,2]}, + {"edges":[[1,4],[2,4],[3,4],[5,4],[6,4],[7,4]],"reference":0,"completion_mod_five":[0,2,2,2,1,2,2,2]}, + {"edges":[[1,5],[2,5],[3,5],[4,5],[6,5],[7,5]],"reference":0,"completion_mod_five":[0,2,2,2,2,1,2,2]}, + {"edges":[[1,6],[2,6],[3,6],[4,6],[5,6],[7,6]],"reference":0,"completion_mod_five":[0,2,2,2,2,2,1,2]}, + {"edges":[[1,7],[2,7],[3,7],[4,7],[5,7],[6,7]],"reference":0,"completion_mod_five":[0,2,2,2,2,2,2,1]}, + {"edges":[[2,0],[2,1],[2,3],[2,4],[2,5],[2,6]],"reference":7,"completion_mod_five":[1,1,2,1,1,1,1,0]}, + {"edges":[[2,0],[2,1],[2,3],[2,4],[2,5],[2,7]],"reference":6,"completion_mod_five":[1,1,2,1,1,1,0,1]}, + {"edges":[[2,0],[2,1],[2,3],[2,4],[2,6],[2,7]],"reference":5,"completion_mod_five":[1,1,2,1,1,0,1,1]}, + {"edges":[[2,0],[2,1],[2,3],[2,5],[2,6],[2,7]],"reference":4,"completion_mod_five":[1,1,2,1,0,1,1,1]}, + {"edges":[[2,0],[2,1],[2,4],[2,5],[2,6],[2,7]],"reference":3,"completion_mod_five":[1,1,2,0,1,1,1,1]}, + {"edges":[[2,0],[2,3],[2,4],[2,5],[2,6],[2,7]],"reference":1,"completion_mod_five":[1,0,2,1,1,1,1,1]}, + {"edges":[[2,0],[3,0],[4,0],[5,0],[6,0],[7,0]],"reference":1,"completion_mod_five":[1,0,2,2,2,2,2,2]}, + {"edges":[[2,1],[2,3],[2,4],[2,5],[2,6],[2,7]],"reference":0,"completion_mod_five":[0,1,2,1,1,1,1,1]}, + {"edges":[[2,1],[3,1],[4,1],[5,1],[6,1],[7,1]],"reference":0,"completion_mod_five":[0,1,2,2,2,2,2,2]}, + {"edges":[[3,0],[3,1],[3,2],[3,4],[3,5],[3,6]],"reference":7,"completion_mod_five":[1,1,1,2,1,1,1,0]}, + {"edges":[[3,0],[3,1],[3,2],[3,4],[3,5],[3,7]],"reference":6,"completion_mod_five":[1,1,1,2,1,1,0,1]}, + {"edges":[[3,0],[3,1],[3,2],[3,4],[3,6],[3,7]],"reference":5,"completion_mod_five":[1,1,1,2,1,0,1,1]}, + {"edges":[[3,0],[3,1],[3,2],[3,5],[3,6],[3,7]],"reference":4,"completion_mod_five":[1,1,1,2,0,1,1,1]}, + {"edges":[[3,0],[3,1],[3,4],[3,5],[3,6],[3,7]],"reference":2,"completion_mod_five":[1,1,0,2,1,1,1,1]}, + {"edges":[[3,0],[3,2],[3,4],[3,5],[3,6],[3,7]],"reference":1,"completion_mod_five":[1,0,1,2,1,1,1,1]}, + {"edges":[[3,1],[3,2],[3,4],[3,5],[3,6],[3,7]],"reference":0,"completion_mod_five":[0,1,1,2,1,1,1,1]}, + {"edges":[[4,0],[4,1],[4,2],[4,3],[4,5],[4,6]],"reference":7,"completion_mod_five":[1,1,1,1,2,1,1,0]}, + {"edges":[[4,0],[4,1],[4,2],[4,3],[4,5],[4,7]],"reference":6,"completion_mod_five":[1,1,1,1,2,1,0,1]}, + {"edges":[[4,0],[4,1],[4,2],[4,3],[4,6],[4,7]],"reference":5,"completion_mod_five":[1,1,1,1,2,0,1,1]}, + {"edges":[[4,0],[4,1],[4,2],[4,5],[4,6],[4,7]],"reference":3,"completion_mod_five":[1,1,1,0,2,1,1,1]}, + {"edges":[[4,0],[4,1],[4,3],[4,5],[4,6],[4,7]],"reference":2,"completion_mod_five":[1,1,0,1,2,1,1,1]}, + {"edges":[[4,0],[4,2],[4,3],[4,5],[4,6],[4,7]],"reference":1,"completion_mod_five":[1,0,1,1,2,1,1,1]}, + {"edges":[[4,1],[4,2],[4,3],[4,5],[4,6],[4,7]],"reference":0,"completion_mod_five":[0,1,1,1,2,1,1,1]}, + {"edges":[[5,0],[5,1],[5,2],[5,3],[5,4],[5,6]],"reference":7,"completion_mod_five":[1,1,1,1,1,2,1,0]}, + {"edges":[[5,0],[5,1],[5,2],[5,3],[5,4],[5,7]],"reference":6,"completion_mod_five":[1,1,1,1,1,2,0,1]}, + {"edges":[[5,0],[5,1],[5,2],[5,3],[5,6],[5,7]],"reference":4,"completion_mod_five":[1,1,1,1,0,2,1,1]}, + {"edges":[[5,0],[5,1],[5,2],[5,4],[5,6],[5,7]],"reference":3,"completion_mod_five":[1,1,1,0,1,2,1,1]}, + {"edges":[[5,0],[5,1],[5,3],[5,4],[5,6],[5,7]],"reference":2,"completion_mod_five":[1,1,0,1,1,2,1,1]}, + {"edges":[[5,0],[5,2],[5,3],[5,4],[5,6],[5,7]],"reference":1,"completion_mod_five":[1,0,1,1,1,2,1,1]}, + {"edges":[[5,1],[5,2],[5,3],[5,4],[5,6],[5,7]],"reference":0,"completion_mod_five":[0,1,1,1,1,2,1,1]}, + {"edges":[[6,0],[6,1],[6,2],[6,3],[6,4],[6,5]],"reference":7,"completion_mod_five":[1,1,1,1,1,1,2,0]}, + {"edges":[[6,0],[6,1],[6,2],[6,3],[6,4],[6,7]],"reference":5,"completion_mod_five":[1,1,1,1,1,0,2,1]}, + {"edges":[[6,0],[6,1],[6,2],[6,3],[6,5],[6,7]],"reference":4,"completion_mod_five":[1,1,1,1,0,1,2,1]}, + {"edges":[[6,0],[6,1],[6,2],[6,4],[6,5],[6,7]],"reference":3,"completion_mod_five":[1,1,1,0,1,1,2,1]}, + {"edges":[[6,0],[6,1],[6,3],[6,4],[6,5],[6,7]],"reference":2,"completion_mod_five":[1,1,0,1,1,1,2,1]}, + {"edges":[[6,0],[6,2],[6,3],[6,4],[6,5],[6,7]],"reference":1,"completion_mod_five":[1,0,1,1,1,1,2,1]}, + {"edges":[[6,1],[6,2],[6,3],[6,4],[6,5],[6,7]],"reference":0,"completion_mod_five":[0,1,1,1,1,1,2,1]}, + {"edges":[[7,0],[7,1],[7,2],[7,3],[7,4],[7,5]],"reference":6,"completion_mod_five":[1,1,1,1,1,1,0,2]}, + {"edges":[[7,0],[7,1],[7,2],[7,3],[7,4],[7,6]],"reference":5,"completion_mod_five":[1,1,1,1,1,0,1,2]}, + {"edges":[[7,0],[7,1],[7,2],[7,3],[7,5],[7,6]],"reference":4,"completion_mod_five":[1,1,1,1,0,1,1,2]}, + {"edges":[[7,0],[7,1],[7,2],[7,4],[7,5],[7,6]],"reference":3,"completion_mod_five":[1,1,1,0,1,1,1,2]}, + {"edges":[[7,0],[7,1],[7,3],[7,4],[7,5],[7,6]],"reference":2,"completion_mod_five":[1,1,0,1,1,1,1,2]}, + {"edges":[[7,0],[7,2],[7,3],[7,4],[7,5],[7,6]],"reference":1,"completion_mod_five":[1,0,1,1,1,1,1,2]}, + {"edges":[[7,1],[7,2],[7,3],[7,4],[7,5],[7,6]],"reference":0,"completion_mod_five":[0,1,1,1,1,1,1,2]} + ] + }, + "general_steps": { + "primes": [ + {"q":5,"rows":8,"balanced_determinant":162,"unbalanced_determinant":-213,"discriminant":29}, + {"q":7,"rows":10,"balanced_determinant":216,"unbalanced_determinant":-813,"discriminant":37}, + {"q":11,"rows":14,"balanced_determinant":324,"unbalanced_determinant":-3669,"discriminant":53}, + {"q":13,"rows":16,"balanced_determinant":378,"unbalanced_determinant":-6213,"discriminant":61}, + {"q":17,"rows":20,"balanced_determinant":486,"unbalanced_determinant":-14253,"discriminant":77}, + {"q":19,"rows":22,"balanced_determinant":540,"unbalanced_determinant":-20037,"discriminant":85}, + {"q":23,"rows":26,"balanced_determinant":648,"unbalanced_determinant":-35853,"discriminant":101}, + {"q":29,"rows":32,"balanced_determinant":810,"unbalanced_determinant":-72357,"discriminant":125}, + {"q":31,"rows":34,"balanced_determinant":864,"unbalanced_determinant":-88509,"discriminant":133}, + {"q":37,"rows":40,"balanced_determinant":1026,"unbalanced_determinant":-150933,"discriminant":157}, + {"q":41,"rows":44,"balanced_determinant":1134,"unbalanced_determinant":-205629,"discriminant":173}, + {"q":43,"rows":46,"balanced_determinant":1188,"unbalanced_determinant":-237333,"discriminant":181}, + {"q":47,"rows":50,"balanced_determinant":1296,"unbalanced_determinant":-310173,"discriminant":197}, + {"q":53,"rows":56,"balanced_determinant":1458,"unbalanced_determinant":-445173,"discriminant":221}, + {"q":59,"rows":62,"balanced_determinant":1620,"unbalanced_determinant":-614517,"discriminant":245}, + {"q":61,"rows":64,"balanced_determinant":1674,"unbalanced_determinant":-679269,"discriminant":253}, + {"q":67,"rows":70,"balanced_determinant":1836,"unbalanced_determinant":-900453,"discriminant":277}, + {"q":71,"rows":74,"balanced_determinant":1944,"unbalanced_determinant":-1071789,"discriminant":293}, + {"q":73,"rows":76,"balanced_determinant":1998,"unbalanced_determinant":-1165053,"discriminant":301}, + {"q":79,"rows":82,"balanced_determinant":2160,"unbalanced_determinant":-1476957,"discriminant":325}, + {"q":83,"rows":86,"balanced_determinant":2268,"unbalanced_determinant":-1713093,"discriminant":341}, + {"q":89,"rows":92,"balanced_determinant":2430,"unbalanced_determinant":-2112477,"discriminant":365}, + {"q":97,"rows":100,"balanced_determinant":2646,"unbalanced_determinant":-2735373,"discriminant":397}, + {"q":101,"rows":104,"balanced_determinant":2754,"unbalanced_determinant":-3088149,"discriminant":413} + ], + "triangle_cases": 648, + "sign_rows": 2408, + "controls": [ + "reverse pair", + "nontrivial triangle phase", + "nonorthogonal projection", + "opposite completion sign", + "excluded q=3 boundary" + ], + "spectral_identity": { + "orientations": 2, + "entries_per_orientation": 9, + "faults": [ + "conjugation", + "diagonal shift", + "linear coefficient" + ] + } + } +} diff --git a/research/odd-prime-phase-blocks/retained/source7775/retained/source7769/retained/source7762/SOURCE-PINS.json b/research/odd-prime-phase-blocks/retained/source7775/retained/source7769/retained/source7762/SOURCE-PINS.json new file mode 100644 index 0000000000..df8ae4bc66 --- /dev/null +++ b/research/odd-prime-phase-blocks/retained/source7775/retained/source7769/retained/source7762/SOURCE-PINS.json @@ -0,0 +1,53 @@ +{ + "schema_version": 1, + "sources": [ + { + "repository": "petalas/integer-mult-bounds", + "commit": "7dc85513e8ee9b771a5856f027cf199936f85af0", + "path": "research/two-prime-column-completion/README.md", + "retained": "retained/two-prime/README.md", + "git_blob": "1c9d65a78f4e8c8f1a7a15f48c30e372fada3f8f", + "sha256": "fd8223d9bee95195c5eceaa2212d52f1ab0e91ce6673ae9e18fb4d87d0ae638a" + }, + { + "repository": "petalas/integer-mult-bounds", + "commit": "7dc85513e8ee9b771a5856f027cf199936f85af0", + "path": "research/two-prime-column-completion/verify.py", + "retained": "retained/two-prime/verify.py", + "git_blob": "f44c327017bc3e2720d4fb80c5374e43eb795dae", + "sha256": "cd7ebf036588a0f3fa108f05f5ad9cb3836c1abd7edde6e7507ee8fa0bba3691" + }, + { + "repository": "petalas/integer-mult-bounds", + "commit": "7dc85513e8ee9b771a5856f027cf199936f85af0", + "path": "research/two-prime-column-completion/VERIFY.json", + "retained": "retained/two-prime/VERIFY.json", + "git_blob": "807e154f99b58630fc1468c8ed999892af8b48e2", + "sha256": "953b105013e4448521e8e5f6ca3008bef14c47ee2785d45efdd7b9e664fa12c1" + }, + { + "repository": "petalas/integer-mult-bounds", + "commit": "7dc85513e8ee9b771a5856f027cf199936f85af0", + "path": "research/two-prime-column-completion/TASK.json", + "retained": "retained/two-prime/TASK.json", + "git_blob": "7fcc4e615ef5bbca3fbef73972828f4484aacaef", + "sha256": "a23e66700d55318ef684428bca00bdd6f421b2592dec379c0542737701ae79d9" + }, + { + "repository": "petalas/integer-mult-bounds", + "commit": "7dc85513e8ee9b771a5856f027cf199936f85af0", + "path": "research/two-prime-column-completion/SOURCES.json", + "retained": "retained/two-prime/SOURCES.json", + "git_blob": "4b1a8b1b788fadf5cbc6b0d21cce51195cdab973", + "sha256": "b0b763a0aeda6400ac597c7cd39ab0ee47f1426345673986320e82354bc69e33" + }, + { + "repository": "petalas/integer-mult-bounds", + "commit": "7dc85513e8ee9b771a5856f027cf199936f85af0", + "path": "research/cyclotomic-column-completion/PROOF.md", + "retained": "retained/column-completion-PROOF.md", + "git_blob": "5023cdde8762720467f708b28dabda0f0532064e", + "sha256": "b194084e203a70574397eeafae053af8e9e49d9e519aacfa112f039da2499674" + } + ] +} diff --git a/research/odd-prime-phase-blocks/retained/source7775/retained/source7769/retained/source7762/SOURCES.json b/research/odd-prime-phase-blocks/retained/source7775/retained/source7769/retained/source7762/SOURCES.json new file mode 100644 index 0000000000..5335fa97d9 --- /dev/null +++ b/research/odd-prime-phase-blocks/retained/source7775/retained/source7769/retained/source7762/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/odd-prime-phase-blocks/retained/source7775/retained/source7769/retained/source7762/TASK.json b/research/odd-prime-phase-blocks/retained/source7775/retained/source7769/retained/source7762/TASK.json new file mode 100644 index 0000000000..f7b9471339 --- /dev/null +++ b/research/odd-prime-phase-blocks/retained/source7775/retained/source7769/retained/source7762/TASK.json @@ -0,0 +1,91 @@ +{ + "schema_version": 1, + "task_id": "supplier-boundary-audit", + "priority_revision": 8, + "base_commit": "e54523517d0f03e58352e647c403a5af3e525a57", + "original_card": { + "id": "supplier-boundary-audit", + "question": "Does one changed supplier have complete source-bound native, caller, ordinary and outer admission coverage?", + "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" + ], + "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": "Pin the current sources and one obligation; the historical owner audit is an example, not evidence of a current bug.", + "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": "Choose one latest uncovered candidate and build a delta coverage map against the selected review. For P104, #5717 changes owned-lifetime assumptions and #5719 covers exact #5713 causal premises; neither automatically transfers to #5718. For BIT, #5679/#5708 need component admission and compatible outer use. Check controls and exact source identity before reuse; stop with one resolved gap or explicit remaining obligation. A heavy full replay requires a separate serial resource budget.", + "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": [ + "supplier admission", + "5717", + "5719", + "5708", + "owned lifetime" + ], + "existing_checks": [ + { + "scope": "PR #4088: author-checked local words, native receipts, owner/phase fill and exact moment.", + "evidence": "research/staged544-mixed-fourth-entry/README.md", + "remaining": "Rebind and validate ordinary/outer admission with all four providers; full mixed release not established.", + "status": "author-checked", + "source_commit": "72d7efc181edb21806a878f174847c96dd410ab0", + "selected_record_sha256": "bb2eaa58647b353f88d0aec2eafb9d30df1be53589231b23e12ceef3e4bad129" + }, + { + "scope": "PR #3801: successor scatter-boundary decision package.", + "evidence": "research/scatter-boundary-decision/README.md", + "remaining": "Consult its exact acceptance scope before any new exporter audit; not proof of a selected failure.", + "status": "author-checked", + "source_commit": "911f8800ba7a4b03603ef62c5ffc6240e53cb5fd", + "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": "No (q+3)-by-(q+2) partial Butson matrix over roots of order 3q^b, for q prime at least five and b positive; includes n=8,m=15.", + "scope_change_reason": "Resolve the released PR7744 mixed-cycle missing-column question through projected Gram rigidity, original-alphabet completion and a spectral contradiction.", + "bottleneck_link": "Exact alphabet compatibility of the missing-column recovery interface; physical preparation, consumption and the complete caller bill remain open.", + "budget_minutes": 60, + "stop_rule": "Stop at a proved scoped obstruction with exact checks, or report the failed implication. Do not infer nonexistence from a failed search.", + "outcome": "negative-result", + "evidence": "PROOF.md supplies the general argument; RESULT.json and verify.py supply complete eight-row checks and bounded general controls.", + "author": "Ali Romman", + "ai_assistance": "Substantial OpenAI Codex assistance in research, implementation, verification and writing", + "open_questions": [ + { + "question": "Other mixed-cycle row counts and larger powers of three.", + "why_it_matters": "The input obstruction does not cover these alphabets and row counts.", + "first_step": "Derive the projected Gram constraints at one specified row count.", + "blocked_by": "The unique-cycle and triangle-rigidity arguments can fail." + } + ] +} diff --git a/research/odd-prime-phase-blocks/retained/source7775/retained/source7769/retained/source7762/VERIFY.json b/research/odd-prime-phase-blocks/retained/source7775/retained/source7769/retained/source7762/VERIFY.json new file mode 100644 index 0000000000..6b5afe14f2 --- /dev/null +++ b/research/odd-prime-phase-blocks/retained/source7775/retained/source7769/retained/source7762/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": "Check exact mixed sums, projected Gram phases, the complete eight-row edge classification, sign residues, spectral obstruction and controls." + }, + { + "argv": [ + "{python}", + "-W", + "error", + "-O", + "-B", + "{package}/verify.py" + ], + "timeout_seconds": 120, + "checks": "Check exact mixed sums, projected Gram phases, the complete eight-row edge classification, sign residues, spectral obstruction and controls." + } + ] +} diff --git a/research/odd-prime-phase-blocks/retained/source7775/retained/source7769/retained/source7762/retained/column-completion-PROOF.md b/research/odd-prime-phase-blocks/retained/source7775/retained/source7769/retained/source7762/retained/column-completion-PROOF.md new file mode 100644 index 0000000000..5023cdde87 --- /dev/null +++ b/research/odd-prime-phase-blocks/retained/source7775/retained/source7769/retained/source7762/retained/column-completion-PROOF.md @@ -0,0 +1,125 @@ +# One-column cyclotomic completion + +This contribution was produced by Nick Petalas. Apache-2.0. + +## Statement + +Write mu_m for the mth roots of unity. Let m,n>=2 and let A be an +n-by-(n-1) matrix with entries in mu_m and A* A=nI. Then its unique +orthogonal flat completion whose new column starts with 1 is + +```text +w = (nI-AA*) e_1, H = [A w]. (1) +``` + +It satisfies H*H=nI and has entries in mu_lcm(2,m). Moreover: + +1. If m is even, every entry of w belongs to mu_m, for every n>=2. +2. If m is an odd prime power and n>=3, every entry of w belongs to mu_m. + +Thus composite even alphabets and odd prime-power alphabets retain their +original alphabet. Both the matrix order n and alphabet order m are arbitrary +under these hypotheses; they need not agree. This extends the prime-order +statement B097 of David Ganz's atlas, PR2849. That result and PR2855's +prime pilot application are cited rather than reverified here. + +The n>=3 condition in the second conclusion is necessary. For any odd m, +the valid two-row input A=(1,1)^T has normalized completion (1,-1)^T. +Even allowing a global phase cannot put both entries in mu_m, since their +ratio is -1. The doubled-alphabet conclusion is therefore sharp without +a restriction on n. No sharpness assertion is made for odd composite m +and n>=3. + +## The flat column and its integral entries + +Set C=nI-AA*. Since A*A=nI, C is Hermitian, C^2=nC, and rank C=1. +Every diagonal entry of AA* is n-1, so C has diagonal 1. A rank-one +Hermitian positive matrix with C_11=1 satisfies C=C e_1 e_1* C. +Consequently C=ww*, |w_i|=1 and w_1=1. Also A*C=0, so A*w=0. +The squared norm of w is n, proving H*H=nI. The orthogonal complement +of A's columns has dimension one, proving normalized uniqueness. + +For i>1 the formula is explicitly + +```text +w_i = -sum_(j=1)^(n-1) A_ij conjugate(A_1j). (2) +``` + +Hence w_i belongs to Z[zeta_m] and is an algebraic integer. No division by +n or a determinant denominator occurs. This is the useful integrality +property behind the alphabet extension. + +## The classical cyclotomic facts + +We use cyclotomic irreducibility and [Q(zeta_r):Q]=phi(r). Here are the +remaining arguments, to make their exact use explicit. + +If alpha in Z[zeta_m] satisfies |alpha|=1, then alpha conjugate(alpha)=1. +All automorphisms of Q(zeta_m) commute with complex conjugation, since this +Galois group is abelian. Applying an automorphism therefore shows that +every algebraic conjugate of alpha has modulus one. Kronecker's theorem +implies that alpha is a root of unity. + +For completeness, the needed Kronecker argument is finite. If alpha has +degree d, each power alpha^k is an algebraic integer of degree at most d, +and every conjugate still has modulus one. Coefficients of its monic +minimal polynomial are integer elementary symmetric sums, bounded in +absolute value by the corresponding binomial coefficients of degree at +most d. Only finitely many such polynomials exist, and each has finitely +many roots. Thus the sequence alpha,alpha^2,... has finitely many possible +values. Two powers agree; alpha!=0 then implies a positive power equals 1. + +Put M=lcm(2,m). The roots of unity in Q(zeta_m)=Q(zeta_M) are exactly +mu_M. Indeed, if a primitive tth root lies in this field, the compositum +with Q(zeta_M) is Q(zeta_l), l=lcm(M,t). Thus phi(l)=phi(M). +Because M is even and M divides l, the product formula for phi shows +that increasing any existing prime exponent or adjoining any new odd +prime strictly increases phi. It follows that l=M and t divides M. +The reverse inclusion is immediate, using zeta_2m=-zeta_m^((m+1)/2) +when m is odd. These are classical facts, not new number-theory claims. + +Applying them to every entry in (2) proves w_i in mu_M. For even m, +M=m, proving the first conclusion. + +## Removing the sign for odd prime powers + +Let m=p^a for an odd prime p and a>=1. Evaluation at zeta_m=1 followed +by reduction modulo p defines a ring map + +```text +rho: Z[zeta_m] -> F_p, rho(zeta_m)=1, +``` + +because Phi_(p^a)(1)=p. If n>=3, A has two distinct columns. Their +orthogonality is a sum of n elements of mu_m equal to zero. Applying +rho shows p divides n. Applying rho to (2) now gives + +```text +rho(w_i) = -(n-1) = 1 in F_p. +``` + +Every element of mu_2m is either zeta_m^k or -zeta_m^k. Their images +under rho are respectively 1 and -1, which differ because p is odd. +Therefore each w_i lies in mu_m. The first entry already equals 1. +This proves the second conclusion and completes the theorem. + +## Sources and scope + +David Ganz's atlas B082/B097 in PR2849 supplies the one-column and +prime-order setting and explicitly leaves the composite alphabet outside +its proof. The prime-phase pilot application in PR2855 supplies the exact +recovery context. Their original files and credit remain unchanged. +Kronecker's theorem, cyclotomic irreducibility, cyclotomic field degrees +and the prime-power reduction are classical. Richard Stanley's +[Algebraic Combinatorics, Theorem 12.14](https://math.mit.edu/~rstan/algcomb/algcomb.pdf) +and Eric Moorhouse's +[Cyclotomic Fields with Applications](https://ericmoorhouse.org/handouts/cyclotomic_fields.pdf) +are accessible mathematical precedents for the integrality argument. +The proof above supplies the actual implication used here. + +The contribution is the stated extension of this project's completion +interface and its exact finite corroboration. Global literature priority, +independent human and formal proof-kernel review are unclaimed. More than +one missing column, approximate data, physical preparation, paid consumption, +supplier admission and complete multiplication-theorem obligations remain +outside scope. No new kappa or selected-frontier change follows. diff --git a/research/odd-prime-phase-blocks/retained/source7775/retained/source7769/retained/source7762/retained/two-prime/README.md b/research/odd-prime-phase-blocks/retained/source7775/retained/source7769/retained/source7762/retained/two-prime/README.md new file mode 100644 index 0000000000..1c9d65a78f --- /dev/null +++ b/research/odd-prime-phase-blocks/retained/source7775/retained/source7769/retained/source7762/retained/two-prime/README.md @@ -0,0 +1,124 @@ +# One-column completion over two-prime odd alphabets + +This scoped proof was produced by Nick Petalas. Apache-2.0. + +Let `m = p^a q^b`, where `p, q` are distinct odd primes and `a, b` are positive. +Let `A` be an `n`-by-`(n-1)` matrix with entries in the `m`th roots of unity +and `A* A = nI`. If `3 <= n < pq` and either prime divides `n`, the unique +normalized missing column uses only `m`th roots. It preserves every supplied +column. For example, at alphabet order 15 this covers row counts 5, 6, 9, 10, +and 12 in addition to 3. + +The proof gives a separate sufficient condition at any `n >= 3`. Project each +entry to one prime-power component in its unique factorization into a +`p^a`th root and a `q^b`th root. If that projection preserves column +orthogonality, the missing column uses the original alphabet. + +## Proof + +Write `P = p^a` and `Q = q^b`. By symmetry, use the projection `pi` that sends +`x y` to `x` for `x` a `P`th root and `y` a `Q`th root. Denote the +projected matrix by `B = pi(A)`. + +**Orthogonality below `pq`.** For any two distinct columns of `A`, their +inner product is a vanishing sum of `n` roots with repetitions allowed. +Lam and Leung show that every such sum over this alphabet splits into +rotated prime cycles. If there are `r` `p`-cycles and `s` `q`-cycles, then +`n = pr + qs`. When `p` divides `n`, it divides `s`. A positive `s` +would give `n >= pq`, so all cycles have length `p`. The projection sends +each rotated `p`-cycle to a rotated `p`-cycle, which still sums to zero. +The projection commutes with phase inversion, so these are exactly the +off-diagonal column inner products of `B`. The diagonal entries stay +`n` because each projected entry has modulus one. +[Lam and Leung, Theorem 3.3 and Corollary 3.4](https://arxiv.org/pdf/math/9511209#page=7) + +**Removing the sign.** Use the normalized missing columns +`w = (nI - AA*) e_1` and `v = (nI - BB*) e_1` from PR #5865. +That result gives `w_i` among the `2m`th roots and, because `B` uses an +odd prime-power alphabet with `n >= 3`, it gives `v_i` among the `P`th roots. +Thus `w_i = eps x y` for `eps` equal to 1 or -1 and roots `x, y` of orders +dividing `P, Q`, respectively. [PR #5865](../cyclotomic-column-completion/PROOF.md) + +Let `X, Y` represent primitive roots of orders `P, Q`. The ring of integers +generated by these roots has the presentation +`Z[X,Y]/(Phi_P(X), Phi_Q(Y))`. The monic relations give a basis of +`phi(P) phi(Q)` powers, and these powers are independent over the rationals +because the roots generate the cyclotomic field of degree +`phi(PQ) = phi(P) phi(Q)`. + +Reduce coefficients modulo `q` and send `Y` to 1. This gives a ring map +to `F_q[X]/(Phi_P(X))` because `Phi_Q(1) = q`. It sends each entry of +`A` to the same residue as the corresponding entry of `B`, including +after conjugation since conjugation inverts the roots. The column formulas +therefore give the same residue for `w_i` and `v_i`. + +In the residue ring the class of `X` generates a group of odd order dividing +`P`, since `X^P = 1`. The element `-1` has order two because the +ring has odd characteristic. The residues of the `P`th roots and their +negatives lie in disjoint cosets. The equal residues of `w_i` and `v_i` +force `eps = 1`. This proves the sufficient condition and, with the first +step, the row-count theorem. + +## Exact examples + +The first fixture has row and column indices `(r,s)` and `(j,k)` +in `{0,1,2}^2`. Its entry is +`zeta_3^(rj+sk+sj) zeta_5^(sj)`. If two column indices differ in `j`, +the sum over `r` vanishes. With equal `j` and different `k`, the sum over +`s` vanishes. Both arguments survive projection to the third roots. +The cross ratio on rows `(0,0),(0,1)` and columns `(0,0),(1,0)` +has order 15, so the mixed phases cannot all be removed by row and +column scalings into either prime-power alphabet. + +The verifier uses integer power bases modulo the two cyclotomic polynomials. +It checks 6 mixed fixtures, all 86 single-column erasures, and all 1,574 +recovered entries and their opposite signs. The fixtures include order 225 +and a 25-row order-15 example for which the sufficient condition applies +outside the automatic row-count range. The two projection controls use +an eight-term sum of one 3-cycle and one 5-cycle, and the 15-row partial +Fourier tensor. The latter retains a collision under either projection +and marks where the automatic projection argument can fail. It has an +original-alphabet completion. + +## Reproduce + +Run from the repository root with CPython 3.12.15 and its standard library. + +```sh +python3.12 -I -W error -B research/two-prime-column-completion/verify.py +python3.12 -I -W error -O -B research/two-prime-column-completion/verify.py +python3.12 -B scripts/research_package.py --package research/two-prime-column-completion +python3.12 -B scripts/check_research_commit.py --package research/two-prime-column-completion --check-source-history +``` + +The direct checks print `PASS_TWO_PRIME_COLUMN_COMPLETION`. The verifier uses +fixed inputs of at most 25 rows and 25 columns. Its coefficient tables have +at most 120 entries and its exponents are reduced modulo fixed prime powers. +Python allocates these bounded objects and dispatches their operations at +runtime. No runtime source files, external dependencies, or generated files +are needed. Both registered modes keep the mathematical checks active. + +## Scope and credit + +This is an exact algebraic result for one missing column. Physical execution, +precision for inexact inputs, a paid supplier and independent human and +formal proof-kernel review remain open. No selected cold replay, Lean or +Docker run was needed for the scoped claim. It yields no new κ. + +Credit David Ganz for the prime-order setting and pilot recovery application +in PRs #2849 and #2855. PR #5865 supplies the normalized column formula, the +doubled-alphabet result, the prime-power sign result and the open odd-composite +question. Lam and Leung supply the two-prime decomposition of vanishing sums. +The new step combines a complex orthogonality-preserving projection with +reduction at the discarded prime. [Atlas B097](../pure-math-atlas-400/volumes/02-geometry.md#b097) +· [PR #2855](https://github.com/CrocSwap/integer-mult-bounds/pull/2855) +· [Advance claim](https://github.com/CrocSwap/integer-mult-bounds/discussions/1166#discussioncomment-19718465) + +## Open next questions + +- Resolve the mixed-cycle case at `m = 15, n = 8`. This is the first + row count where both cycle lengths fit in one vanishing column product. + Start by dephasing the first column and enumerating the remaining columns' + pairwise differences, whose multiplicities must decompose into one + 3-cycle and one 5-cycle. The root-sum control alone gives no compatible + partial matrix. diff --git a/research/odd-prime-phase-blocks/retained/source7775/retained/source7769/retained/source7762/retained/two-prime/SOURCES.json b/research/odd-prime-phase-blocks/retained/source7775/retained/source7769/retained/source7762/retained/two-prime/SOURCES.json new file mode 100644 index 0000000000..4b1a8b1b78 --- /dev/null +++ b/research/odd-prime-phase-blocks/retained/source7775/retained/source7769/retained/source7762/retained/two-prime/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/cyclotomic-column-completion/PROOF.md", + "usage": "provenance", + "git_blob": "5023cdde8762720467f708b28dabda0f0532064e", + "sha256": "b194084e203a70574397eeafae053af8e9e49d9e519aacfa112f039da2499674" + }, + { + "path": "research/pure-math-atlas-400/volumes/02-geometry.md", + "usage": "provenance", + "git_blob": "baef1e69c08c7cbd4dfd020862870fa5161afc86", + "sha256": "39fc97bdfa29337b79d1308e35df41e867ce2102d44755fd407aa09ff8352b39" + } + ] +} diff --git a/research/odd-prime-phase-blocks/retained/source7775/retained/source7769/retained/source7762/retained/two-prime/TASK.json b/research/odd-prime-phase-blocks/retained/source7775/retained/source7769/retained/source7762/retained/two-prime/TASK.json new file mode 100644 index 0000000000..7fcc4e615e --- /dev/null +++ b/research/odd-prime-phase-blocks/retained/source7775/retained/source7769/retained/source7762/retained/two-prime/TASK.json @@ -0,0 +1,95 @@ +{ + "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": "Exact one-column completion for partial Butson matrices over p^a q^b when either prime divides the row count below pq, or when a prime-power projection preserves column orthogonality.", + "scope_change_reason": "PR #5865 asks for the missing odd-composite case of an algebraic recovery interface. This work answers a row-count subcase without a selected-caller binding.", + "bottleneck_link": "An algebraic side result on exact phase recovery. No supplier or kappa improvement follows.", + "budget_minutes": 60, + "stop_rule": "Package the first verified same-alphabet theorem beyond the odd prime-power case.", + "outcome": "completed", + "evidence": "README.md proves the projection criterion and its row-count corollary. verify.py checks six mixed fixtures, all their 86 erasures and all 1574 recovered entries and their opposite signs, plus two projection controls. CPython 3.12.15 with the standard library.", + "author": "Nick Petalas", + "ai_assistance": "Independent human and formal proof-kernel review are unclaimed.", + "open_questions": [ + { + "question": "Does every partial matrix at m=15 and n=8 admit original-alphabet completion?", + "why_it_matters": "This is the first dimension at that alphabet where one vanishing column product can use both prime cycles.", + "first_step": "Dephase the first column and use the one-3-cycle and one-5-cycle multiplicity constraint on all pairwise column differences.", + "blocked_by": "Mixed cycles can spoil prime-power projection. A root-sum example is not a compatible partial matrix." + } + ] +} diff --git a/research/odd-prime-phase-blocks/retained/source7775/retained/source7769/retained/source7762/retained/two-prime/VERIFY.json b/research/odd-prime-phase-blocks/retained/source7775/retained/source7769/retained/source7762/retained/two-prime/VERIFY.json new file mode 100644 index 0000000000..807e154f99 --- /dev/null +++ b/research/odd-prime-phase-blocks/retained/source7775/retained/source7769/retained/source7762/retained/two-prime/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": 60, + "checks": "Check exact mixed-alphabet column recovery, modular sign separation, and the mixed-cycle and boundary projection controls." + }, + { + "argv": [ + "{python}", + "-I", + "-W", + "error", + "-B", + "-O", + "{package}/verify.py" + ], + "timeout_seconds": 60, + "checks": "Check exact mixed-alphabet column recovery, modular sign separation, and the mixed-cycle and boundary projection controls." + } + ] +} diff --git a/research/odd-prime-phase-blocks/retained/source7775/retained/source7769/retained/source7762/retained/two-prime/verify.py b/research/odd-prime-phase-blocks/retained/source7775/retained/source7769/retained/source7762/retained/two-prime/verify.py new file mode 100644 index 0000000000..f44c327017 --- /dev/null +++ b/research/odd-prime-phase-blocks/retained/source7775/retained/source7769/retained/source7762/retained/two-prime/verify.py @@ -0,0 +1,149 @@ +#!/usr/bin/env python3 +"""Check the two-prime completion proof on fixed exact examples.""" + +from itertools import combinations, product + + +def require(condition, message): + if not condition: + raise ArithmeticError(message) + + +def powers(prime, order): + """Sparse monomial residues modulo the prime-power cyclotomic polynomial.""" + step = order // prime + degree = order - step + residues = [((exponent, 1),) for exponent in range(degree)] + for offset in range(step): + residues.append(tuple((offset + j * step, -1) for j in range(prime - 1))) + return degree, tuple(residues) + + +def evaluate(phases, bases): + """Sum roots in the tensor product of the two integral power bases.""" + (x_degree, x_powers), (y_degree, y_powers) = bases + coefficients = [[0] * y_degree for _ in range(x_degree)] + for x, y in phases: + for i, a in x_powers[x % len(x_powers)]: + for j, b in y_powers[y % len(y_powers)]: + coefficients[i][j] += a * b + return tuple(map(tuple, coefficients)) + + +def pairing(left, right, bases): + differences = ((a - c, b - d) for (a, b), (c, d) in zip(left, right, strict=True)) + return evaluate(differences, bases) + + +def orthogonal_columns(matrix, bases): + zero = evaluate((), bases) + return all(pairing(left, right, bases) == zero + for left, right in combinations(zip(*matrix, strict=True), 2)) + + +def project(matrix, keep=0): + return tuple(tuple((x, 0) if keep == 0 else (0, y) for x, y in row) + for row in matrix) + + +def normalized_column(partial, bases): + n = len(partial) + column = [] + for index, row in enumerate(partial): + gram_row = pairing(row, partial[0], bases) + coefficients = [list(-value for value in power_row) for power_row in gram_row] + coefficients[0][0] += n if index == 0 else 0 + column.append(tuple(map(tuple, coefficients))) + return tuple(column) + + +def reduce_at_q(coefficients, q): + return tuple(sum(row) % q for row in coefficients) + + +def check_erasures(matrix, bases, q): + projected = project(matrix) + require(orthogonal_columns(matrix, bases), "mixed fixture is not orthogonal") + require(orthogonal_columns(projected, bases), "fixture loses projected orthogonality") + n = len(matrix) + entries = 0 + for erased in range(n): + partial = tuple(row[:erased] + row[erased + 1:] for row in matrix) + column = normalized_column(partial, bases) + projected_column = normalized_column(project(partial), bases) + x0, y0 = matrix[0][erased] + for index, row in enumerate(matrix): + x, y = row[erased] + expected = evaluate(((x - x0, y - y0),), bases) + require(column[index] == expected, "reconstruction changed the erased phase") + require(projected_column[index] == evaluate(((x - x0, 0),), bases), + "projected reconstruction changed the retained prime-power phase") + residue = reduce_at_q(projected_column[index], q) + require(reduce_at_q(column[index], q) == residue, "reduction mismatch") + opposite = tuple(-value % q for value in reduce_at_q(expected, q)) + require(residue != opposite, "the opposite sign also passed reduction") + entries += 1 + return n, entries + + +def mixed_fixture(p, p_power): + """Fourier blocks with a column-block-dependent row phase.""" + indices = tuple(product(range(p), repeat=2)) + matrix = tuple( + tuple(((p_power // p) * (r * j + s * k) + s * j, s * j) + for j, k in indices) + for r, s in indices + ) + # At rows (0,0),(0,1) and columns (0,0),(1,0), the cross ratio + # has exponent one in each component, even after row and column gauges. + require(matrix[0][0] == matrix[0][p] == matrix[1][0] == (0, 0), + "mixed cross-ratio normalization changed") + require(matrix[1][p] == (1, 1), "fixture lacks a primitive mixed cross ratio") + return matrix + + +def check_projection_boundaries(): + bases = powers(3, 3), powers(5, 5) + mixed_cycles = tuple((i, 0) for i in range(3)) + tuple((0, j) for j in range(5)) + require(evaluate(mixed_cycles, bases) == evaluate((), bases), + "the two mixed cycles must vanish together") + collapsed = tuple((x, 0) for x, _ in mixed_cycles) + require(evaluate(collapsed, bases) == evaluate(((0, 0),) * 5, bases), + "the five-cycle should contribute five after projection") + + indices = tuple(product(range(3), range(5))) + partial = tuple(tuple((r * j, s * k) for j, k in indices[:-1]) for r, s in indices) + require(orthogonal_columns(partial, bases), "boundary partial Fourier matrix is invalid") + zero = evaluate((), bases) + for kept_part, discarded_phase in ((0, (0, 1)), (1, (1, 0))): + columns = tuple(zip(*project(partial, keep=kept_part), strict=True)) + left = columns[0] + right = columns[indices.index(discarded_phase)] + require(pairing(left, right, bases) != zero, + "discarded prime did not collapse two columns") + + +def main(): + fixtures = ( + (3, 5, 3, 5), + (3, 5, 9, 5), + (3, 5, 3, 25), + (3, 5, 9, 25), + (5, 7, 5, 7), + (5, 3, 5, 3), + ) + erasures = 0 + entries = 0 + for p, q, p_power, q_power in fixtures: + bases = powers(p, p_power), powers(q, q_power) + fixture_erasures, fixture_entries = check_erasures(mixed_fixture(p, p_power), bases, q) + erasures += fixture_erasures + entries += fixture_entries + check_projection_boundaries() + print("PASS_TWO_PRIME_COLUMN_COMPLETION") + print(f"{len(fixtures)} mixed fixtures, {erasures} erasures, {entries} recovered entries") + print("All opposite signs reject modulo q. Mixed-cycle and pq-row controls pass.") + + +if __name__ == "__main__": + main() diff --git a/research/odd-prime-phase-blocks/retained/source7775/retained/source7769/retained/source7762/verify.py b/research/odd-prime-phase-blocks/retained/source7775/retained/source7769/retained/source7762/verify.py new file mode 100644 index 0000000000..7fe9f369d1 --- /dev/null +++ b/research/odd-prime-phase-blocks/retained/source7775/retained/source7769/retained/source7762/verify.py @@ -0,0 +1,281 @@ +"""Check the mixed-cycle column obstruction with exact integer arithmetic. + +Ali Romman with substantial OpenAI Codex assistance. Apache-2.0. +""" +from hashlib import sha1, sha256 +from itertools import combinations, combinations_with_replacement, product +import json +from math import comb, isqrt +from pathlib import Path +import subprocess +import sys + +ROOT = Path(__file__).resolve().parent + + +def require(value, message): + if not value: + raise ArithmeticError(message) + + +def third_sum(exponents): + counts = [0, 0, 0] + for exponent in exponents: + counts[exponent % 3] += 1 + return counts[0] - counts[2], counts[1] - counts[2] + + +def edge_word(n, edge): + a, b = edge + return tuple(1 if i == a else 2 if i == b else 0 for i in range(n)) + + +def compatible(a, b): + return a[0] == b[0] or a[1] == b[1] or a == b[::-1] + + +def gram_determinant(n, q, phase): + twice_real = 2 if phase % 3 == 0 else -1 + return n ** 3 - 3 * n * q ** 2 + q ** 3 * twice_real + + +def add(a, b): + return a[0] + b[0], a[1] + b[1] + + +def multiply(a, b): + x, y = a + u, v = b + return x * u - y * v, x * v + y * u - y * v + + +def conjugate(a): + return a[0] - a[1], -a[1] + + +def matrix_gram(matrix, use_conjugate=True): + return [[sum_pair(multiply(a, conjugate(b) if use_conjugate else b) + for a, b in zip(left, right)) for right in matrix] + for left in matrix] + + +def sum_pair(values): + result = (0, 0) + for value in values: + result = add(result, value) + return result + + +def check_spectral_identity(): + qmatrix = [[1, 2, 3], [2, 1, 4], [3, 4, 1]] + square = [[sum(qmatrix[i][k] * qmatrix[k][j] for k in range(3)) + for j in range(3)] for i in range(3)] + expected = [[(square[i][j] - 3 * qmatrix[i][j] + 3 * (i == j), 0) + for j in range(3)] for i in range(3)] + for phase in ((0, 1), (-1, -1)): + shift = add(phase, (-1, 0)) + matrix = [[add((qmatrix[i][j], 0), shift if i == j else (0, 0)) + for j in range(3)] for i in range(3)] + require(matrix_gram(matrix) == expected, 'Hermitian spectral identity') + require(matrix_gram(matrix, False) != expected, 'conjugation fault') + wrong = [[add((qmatrix[i][j], 0), phase if i == j else (0, 0)) + for j in range(3)] for i in range(3)] + require(matrix_gram(wrong) != expected, 'diagonal shift fault') + wrong_coefficient = [[(square[i][j] - qmatrix[i][j] + 3 * (i == j), 0) + for j in range(3)] for i in range(3)] + require(expected != wrong_coefficient, 'linear coefficient fault') + return {'orientations': 2, 'entries_per_orientation': 9, + 'faults': ['conjugation', 'diagonal shift', 'linear coefficient']} + + +def maximal_cliques(adjacency): + result = [] + + def visit(chosen, possible, excluded): + if not possible and not excluded: + result.append(tuple(chosen)) + return + union = possible | excluded + pivot = max(union, key=lambda i: len(possible & adjacency[i])) + for vertex in sorted(possible - adjacency[pivot]): + visit(chosen + [vertex], possible & adjacency[vertex], + excluded & adjacency[vertex]) + possible.remove(vertex) + excluded.add(vertex) + + visit([], set(range(len(adjacency))), set()) + return sorted(tuple(sorted(row)) for row in result) + + +def check_edges(): + n = 8 + words = {word for word in product(range(3), repeat=n) + if third_sum(word) == (5, 0)} + edges = list((a, b) for a in range(n) for b in range(n) if a != b) + require(words == {edge_word(n, edge) for edge in edges}, 'word inventory') + adjacency = [set() for _ in edges] + pair_checks = 0 + for i, j in combinations(range(len(edges)), 2): + left, right = edge_word(n, edges[i]), edge_word(n, edges[j]) + actual = third_sum(b - a for a, b in zip(left, right)) == (5, 0) + require(actual == compatible(edges[i], edges[j]), 'edge compatibility') + if actual: + adjacency[i].add(j) + adjacency[j].add(i) + pair_checks += 1 + cliques = maximal_cliques(adjacency) + stars = {tuple(i for i, edge in enumerate(edges) if edge[axis] == centre) + for axis in range(2) for centre in range(n)} + reverse = {tuple(sorted((edges.index((a, b)), edges.index((b, a))))) + for a, b in combinations(range(n), 2)} + require(set(cliques) == stars | reverse, 'maximal clique classification') + six = {sub for star in stars for sub in combinations(star, 6)} + direct_six = set() + + def enumerate_six(chosen, possible): + if len(chosen) == 6: + direct_six.add(tuple(chosen)) + return + while possible: + vertex = min(possible) + possible.remove(vertex) + enumerate_six(chosen + [vertex], possible & adjacency[vertex]) + + enumerate_six([], set(range(len(edges)))) + require(six == direct_six and len(six) == 112, 'six-edge coverage') + records = [] + for clique in sorted(six): + columns = [(0,) * n] + [edge_word(n, edges[i]) for i in clique] + unused = [r for r in range(n) if all(col[r] == 0 for col in columns)] + require(len(unused) == 1, 'unique unused row') + reference = unused[0] + residues = [] + for r in range(n): + residue = (1, 0) if r == reference else tuple( + -x % 5 for x in third_sum(col[r] for col in columns)) + roots = [tuple(x % 5 for x in third_sum([e])) for e in range(3)] + negatives = [tuple(-x % 5 for x in root) for root in roots] + require(residue in roots and residue not in negatives, 'completion sign') + residues.append(roots.index(residue)) + records.append({'edges': [list(edges[i]) for i in clique], 'reference': reference, + 'completion_mod_five': residues}) + return {'ternary_words_examined': 3 ** n, 'edge_words': len(edges), + 'pair_checks': pair_checks, 'maximal_cliques': len(cliques), + 'stars': len(stars), 'reverse_pairs': len(reverse), + 'partial_configurations': records} + + +def check_root_sums(): + # Phi_15(X) = X^8-X^7+X^5-X^4+X^3-X+1. + phi = (1, -1, 0, 1, -1, 1, 0, -1) + powers = [] + current = [1] + [0] * 7 + for _ in range(15): + powers.append(tuple(current)) + leading = current[-1] + current = [0] + current[:-1] + current = [a - leading * b for a, b in zip(current, phi)] + require(current == [1] + [0] * 7, 'fifteenth power') + expected = {tuple(sorted(tuple((a + 5 * i) % 15 for i in range(3)) + + tuple((b + 3 * j) % 15 for j in range(5)))) + for a in range(5) for b in range(3)} + actual = set() + examined = 0 + for terms in combinations_with_replacement(range(15), 8): + examined += 1 + total = tuple(sum(powers[e][i] for e in terms) for i in range(8)) + if total == (0,) * 8: + actual.add(terms) + require(actual == expected, 'complete eight-term vanishing sums') + require(examined == comb(22, 8), 'multiset coverage') + for terms in actual: + projected = third_sum(terms) + require(projected in ((5, 0), (0, 5), (-5, -5)), 'projected mixed sum') + return {'multisets_examined': examined, 'vanishing_multisets': [list(row) for row in sorted(actual)]} + + +def check_general_steps(): + primes = [q for q in range(5, 102) if all(q % d for d in range(2, isqrt(q) + 1))] + phase_records = [] + sign_rows = 0 + for q in primes: + n = q + 3 + solutions = [(r, s) for r in range(n // 3 + 1) for s in range(n // q + 1) + if 3 * r + q * s == n] + require(solutions == [(1, 1)], 'mixed cycle count') + balanced = 0 + for a, b, c in product(range(3), repeat=3): + phase = (a + c - b) % 3 + determinant = gram_determinant(n, q, phase) + require((determinant >= 0) == (phase == 0), 'Gram phase rigidity') + balanced += phase == 0 + require(balanced == 9, 'balanced triangle count') + roots = [tuple(x % q for x in third_sum([e])) for e in range(3)] + require(not set(roots) & {tuple(-x % q for x in root) for root in roots}, + 'sign cosets') + for orientation in (1, 2): + columns = [(0,) * n] + [tuple(orientation if r == 0 else + -orientation % 3 if r == j else 0 for r in range(n)) + for j in range(1, n - 1)] + for r in range(n - 1): + residue = tuple(-x % q for x in third_sum(col[r] for col in columns)) + require(residue in roots, 'general completion residue') + sign_rows += 1 + discriminant = 9 + 4 * q + require(discriminant % 8 == 5 and isqrt(discriminant) ** 2 != discriminant, + 'spectral irrationality') + for multiplicity in range(n + 1): + require((2 * multiplicity - n) ** 2 * discriminant != n ** 2, + 'trace multiplicity contradiction') + phase_records.append({'q': q, 'rows': n, 'balanced_determinant': + gram_determinant(n, q, 0), 'unbalanced_determinant': + gram_determinant(n, q, 1), 'discriminant': discriminant}) + # A reverse pair passes pair compatibility but cannot form a three-edge star. + require(compatible((0, 1), (1, 0)), 'reverse-pair positive control') + require(not any(compatible((0, 1), edge) and compatible((1, 0), edge) + for edge in product(range(8), repeat=2) + if edge[0] != edge[1] and edge not in ((0, 1), (1, 0))), + 'reverse-pair extension control') + require(gram_determinant(8, 5, 1) == -213, 'unbalanced phase control') + require(third_sum([0] * 6 + [1, 2]) == (5, 0), 'projection is not orthogonal') + require((1, 0) != tuple(-x % 5 for x in (1, 0)), 'negative sign control') + require(gram_determinant(6, 3, 1) > 0, 'excluded q=3 phase boundary') + return {'primes': phase_records, 'triangle_cases': 27 * len(primes), + 'sign_rows': sign_rows, + 'controls': ['reverse pair', 'nontrivial triangle phase', + 'nonorthogonal projection', 'opposite completion sign', + 'excluded q=3 boundary'], + 'spectral_identity': check_spectral_identity()} + + +def sources(): + pins = json.loads((ROOT / 'SOURCE-PINS.json').read_text())['sources'] + for pin in pins: + data = (ROOT / pin['retained']).read_bytes() + require(sha256(data).hexdigest() == pin['sha256'], 'retained SHA256') + require(sha1(b'blob ' + str(len(data)).encode() + b'\0' + data).hexdigest() + == pin['git_blob'], 'retained Git blob') + command = [sys.executable, '-W', 'error', *(['-O'] if sys.flags.optimize else []), + '-B', str(ROOT / 'retained/two-prime/verify.py')] + replay = subprocess.run(command, check=True, text=True, capture_output=True, timeout=30) + require('PASS_TWO_PRIME_COLUMN_COMPLETION' in replay.stdout, 'source replay') + return len(pins) + + +def collect(): + return {'source_files': sources(), 'root_sums': check_root_sums(), + 'eight_row_projection': check_edges(), 'general_steps': check_general_steps()} + + +def main(): + actual = collect() + expected = json.loads((ROOT / 'RESULT.json').read_text()) + require(actual == expected, 'saved certificate mismatch') + print('PASS_MIXED_CYCLE_COLUMN_OBSTRUCTION') + print('319770 root multisets; 15 vanishing sums; 6561 ternary words; 1540 edge pairs') + print('44 maximal cliques; all 112 six-edge configurations; exact sign and trace controls') + print('No (q+3)-by-(q+2) input over roots of order 3q^b, q prime >=5: written proof') + + +if __name__ == '__main__': + main() diff --git a/research/odd-prime-phase-blocks/retained/source7775/retained/source7769/retained/source7768/CREDITS.md b/research/odd-prime-phase-blocks/retained/source7775/retained/source7769/retained/source7768/CREDITS.md new file mode 100644 index 0000000000..ba7ae62d84 --- /dev/null +++ b/research/odd-prime-phase-blocks/retained/source7775/retained/source7769/retained/source7768/CREDITS.md @@ -0,0 +1,33 @@ +# Sources and credit + +Ali Romman (@aliromman) prepared the new proof, checker and package +with substantial OpenAI Codex assistance. New material is Apache-2.0. +No independent human or formal proof-kernel acceptance is claimed. + +Ali Romman supplied the projected-star classification and mixed-case +obstruction in [PR #7762](https://github.com/CrocSwap/integer-mult-bounds/pull/7762). +Its [proof](https://github.com/aliromman/integer-mult-bounds/blob/d33fe8562c86888307cbba4a2aa92490212c8d78/research/mixed-cycle-column-obstruction/PROOF.md) +and [checker](https://github.com/aliromman/integer-mult-bounds/blob/d33fe8562c86888307cbba4a2aa92490212c8d78/research/mixed-cycle-column-obstruction/verify.py) +are retained with all source notices and inputs. All sixteen files are +byte-exact under `retained/source7762/`. + +Nick Petalas (@petalas) supplied the two-prime projection and the +released mixed-cycle question in +[PR #7744](https://github.com/CrocSwap/integer-mult-bounds/pull/7744). +The [source proof and question](https://github.com/petalas/integer-mult-bounds/blob/7dc85513e8ee9b771a5856f027cf199936f85af0/research/two-prime-column-completion/README.md) +and [prime-power arithmetic](https://github.com/petalas/integer-mult-bounds/blob/7dc85513e8ee9b771a5856f027cf199936f85af0/research/two-prime-column-completion/verify.py) +remain unchanged. The new checker reuses that arithmetic. The source +also retains Nick's completion theorem and its credit to David Ganz; +those notices remain intact. Completion is not needed for the new +rectangular argument, but its source check is still replayed. + +T. Y. Lam and K. H. Leung supplied the classical cycle theorem in +[On Vanishing Sums of Roots of Unity, Theorem 3.3 and Corollary 3.4](https://arxiv.org/pdf/math/9511209#page=7). +The classical quadratic-subfield fact is stated and proved in +[Romyar Sharifi's Algebraic Number Theory, Lemma 3.2.2](https://www.math.ucla.edu/~sharifi/notes/algnum-ch03.html). +The new result applies these facts to the rectangular rank defect, +then excludes equality through row orthogonality. No global +literature-priority claim is made. + +`SOURCE-PINS.json` authenticates retained bytes. `SOURCES.json` records +canonical main provenance. A source pin does not assert ancestry. diff --git a/research/odd-prime-phase-blocks/retained/source7775/retained/source7769/retained/source7768/PROOF.md b/research/odd-prime-phase-blocks/retained/source7775/retained/source7769/retained/source7768/PROOF.md new file mode 100644 index 0000000000..88f7de6041 --- /dev/null +++ b/research/odd-prime-phase-blocks/retained/source7775/retained/source7769/retained/source7768/PROOF.md @@ -0,0 +1,183 @@ +# A strict column-defect bound + +Ali Romman with substantial OpenAI Codex assistance. Apache-2.0. + +Let q>=5 be prime, b>=1, n=q+3 and 1<=m<=n. Suppose that A is an +n-by-m matrix over the roots of order 3q^b and A* A=nI. Set d=n-m. +Then + +```text +m^2 < d^2(4d-3). +``` + +This is a necessary condition, not an existence theorem. It excludes an +eight-by-six matrix for every alphabet of order 3*5^b. It strengthens the +n-by-(n-1) obstruction in [PR #7762](https://github.com/CrocSwap/integer-mult-bounds/pull/7762). +At q=101 it excludes 91 columns in 104 rows; the strict inequality is +needed in this example. No physical supplier or new kappa follows. + +## 1. The rectangular Hermitian block + +Write omega for a primitive third root and eta for a primitive q^bth +root. The m<=3 case satisfies the bound directly: n>=8 gives d>=5. +Assume m>=4 from now on. + +The projected-star proof in +[the pinned source, Section 1](https://github.com/aliromman/integer-mult-bounds/blob/d33fe8562c86888307cbba4a2aa92490212c8d78/research/mixed-cycle-column-obstruction/PROOF.md) +applies without the n-1-column restriction. Here are the required steps. +Every zero column inner product has length q+3. The two-prime cycle +theorem makes it one 3-cycle and one q-cycle, because 3r+qs=q+3 has +only the solution r=s=1 in nonnegative integers. Discarding the eta +component gives projected Gram diagonal n and off-diagonal q times a +third root. An unbalanced triangle has determinant -3q^3+27q+27<0. +Thus column phases make every off-diagonal projected Gram entry q. +[Lam and Leung, Theorem 3.3 and Corollary 3.4](https://arxiv.org/pdf/math/9511209#page=7) + +Make the first projected column constant. Each other column then has +omega at one row, omega squared at another, and 1 elsewhere. Two such +ordered pairs are compatible exactly when they have the same first +row, the same second row, or are reverses. A reverse pair admits no +third pair. At least three pairs therefore form one directed star. +Its m-1 leaves and centre use m rows; d rows remain unused. + +If the centre exponent is s, multiply its row by omega^(-s). Order the +used rows so that the constant column matches the centre, and each +other column matches its leaf. The projected top m-by-m block has +omega^(-s) on its diagonal and 1 elsewhere. All bottom entries are 1. +Scale columns by eta powers to make every top diagonal q-part 1. +These operations preserve the alphabet and column orthogonality. Write + +```text +A = Q + lambda E, Q = [ K ], E = [ I_m ], + [ R ] [ 0 ] +lambda = omega^(-s)-1. +``` + +K is m-by-m, R is d-by-m, all their entries are q^bth roots, and K_ii=1. +For columns i,j, the only two terms with a nontrivial third-root part +occur at rows i,j. The unique 3-cycle must contain both with equal +q-parts. These q-parts are K_ij and conjugate(K_ji), so K is Hermitian. +As lambda+conjugate(lambda)=-3 and |lambda|^2=3, orthogonality gives + +```text +K^2 - 3K - qI = -R*R. (1) +``` + +In particular, the left side has rank at most d. No completion formula +or extra missing columns were assumed. + +## 2. Equal quadratic-root multiplicities + +Put F=Q(eta), Delta=4q+9 and p(t)=t^2-3t-q. Delta is 5 modulo 8, +so it is not a rational square; also q does not divide Delta. +The unique quadratic subfield of Q(zeta_q) is Q(sqrt(q*)), where +q*=(-1)^((q-1)/2)q. See +[Sharifi, Algebraic Number Theory, Lemma 3.2.2](https://www.math.ucla.edu/~sharifi/notes/algnum-ch03.html). +The extension F/Q(zeta_q) has odd degree q^(b-1). A quadratic subfield +of F must therefore lie in Q(zeta_q): its compositum with that field +would otherwise have degree two in an odd-degree extension. + +The q-adic valuation of Delta is zero, while that of q* is one. +Their ratio cannot be a rational square. Thus Q(sqrt(Delta)) is not +this quadratic subfield, and p is irreducible over F. + +The characteristic polynomial of K lies in F[t]. The two roots of p +have the same multiplicity k in it. K is Hermitian, so it is +diagonalizable. Let h=m-2k count its other eigenvalues. Equation (1) +gives h<=d. Each entry of K has modulus one, so + +```text +trace(K) = m, trace(K^2) = m^2. +``` + +The sum and squared sum of the other h real eigenvalues are therefore + +```text +T = m-3k = (3h-m)/2, +E2 = m^2-k(2q+9) = m^2-(m-h)(2n+3)/2. +``` + +Cauchy's inequality gives T^2<=h E2. This also holds when h=0, +where both actual sums must be zero. After multiplication by four, + +```text +F(h) = (4n-3)h^2 - 4mdh - m^2 >= 0. (2) +``` + +If d=0, h=0 contradicts F(0)=-m^2. Thus d>0. On [0,d], F is convex +and F(0)<0. Equation (2) implies F(d)>=0. Equivalently, + +```text +m^2 <= d^2(4d-3). (3) +``` + +For a direct check, the chord excess is + +```text +h F(d) + (d-h) F(0) - d F(h) + = (4n-3)d h(d-h) >= 0. +``` + +## 3. Equality is impossible + +Suppose equality holds in (3). The strict chord inequality in the +interior, and F(0)<0, force h=d and equality in Cauchy. All h remaining +eigenvalues of K are one common value + +```text +beta = (3d-m)/(2d), p(beta) = -m. +``` + +The second identity follows from m^2=d^2(4d-3) and q=m+d-3. +Equation (1) now says that `R*R` has nonzero eigenvalue m with +multiplicity d. Thus `RR*=mI_d`. The bound forces d>=2, so two rows of +R give a zero sum of m roots of order q^b. + +Such a zero sum has length divisible by q. One direct proof writes +its multiplicities in a polynomial f of degree less than q^b. Since +Phi_(q^b) divides f, f(1) is divisible by Phi_(q^b)(1)=q. Hence q|m +and q|(d-3). But m>=4 gives 0<=d<=q-1, so this forces d=3. Equality +then gives m=9 and q=m+d-3=9, contrary to primality. This proves the +strict bound. + +At q=101, the non-strict spectral relaxation allows m=91,d=13, +k=39 and beta=-2. The row-orthogonality argument removes that case. +Thus the strict conclusion is stronger than the trace relaxation. + +## Evidence and limits + +The checker authenticates all sixteen retained source files and runs +the PR7762 verifier unchanged, including its PR7744 replay. New exact +checks use the retained prime-power cyclotomic basis arithmetic. +There are 36 rectangular fixtures: q in {5,7,11}, b in {1,2}, +m in {4,n-1,n}, and both star orientations. All 2,828 Gram entries +agree with (1), including nonempty and empty R blocks. Four altered +formulas fail. Synthetic block fixtures test the identity; they are +not claimed to be orthogonal examples of A. + +The three polynomial identities have degree at most four in each +variable. They agree on a five-point grid in each variable, which +determines every coefficient over Q. This verifies all coefficients, +not only a sampled numerical inequality. Separate integer calculations +check all 11,193 possible multiplicity cases for the 24 primes from +5 through 101. They recover the strict equality control above. +A union of one 3-cycle and one q-cycle gives a valid two-column +positive control in each fixture alphabet; deleting a term fails. + +| q | Rows | Minimum defect from this bound | Maximum columns from this bound | +| --- | --- | --- | --- | +| 5 | 8 | 3 | 5 | +| 7 | 10 | 3 | 7 | +| 11 | 14 | 4 | 10 | +| 13 | 16 | 4 | 12 | +| 17 | 20 | 5 | 15 | +| 101 | 104 | 14 | 90 | + +The general theorem is the written argument. It uses the classical +cycle and quadratic-subfield theorems. The finite checks do not replace +these inputs. The upper bounds need not be attained. Other row counts, +larger powers of three, more prime factors, approximate orthogonality, +physical preparation and complete caller pricing remain open. +All five framework assumptions remain. No selected cold replay, +Lean, Docker, independent human acceptance or formal proof kernel was +used. No global literature priority is claimed. diff --git a/research/odd-prime-phase-blocks/retained/source7775/retained/source7769/retained/source7768/README.md b/research/odd-prime-phase-blocks/retained/source7775/retained/source7769/retained/source7768/README.md new file mode 100644 index 0000000000..82a0784318 --- /dev/null +++ b/research/odd-prime-phase-blocks/retained/source7775/retained/source7769/retained/source7768/README.md @@ -0,0 +1,36 @@ +# A strict mixed-cycle column bound + +For n=q+3 rows over roots of order 3q^b, where q>=5 is prime and b>=1, +any m orthogonal columns satisfy m^2 1: + require(all(len(adjacency[v]) == 2 for v in component), 'six-cycle degrees') + triangles = [(i, j, k) for i, j, k in combinations(range(len(vertices)), 3) + if j in adjacency[i] and k in adjacency[i] and k in adjacency[j]] + require(not triangles, 'complete triangle enumeration') + masks = [sum(1 << j for j in neighbors) for neighbors in adjacency] + require(all(masks[i] & masks[j] == 0 for i, j in edges), 'independent common-neighbor check') + for word in vertices: + require(residue(a - a for a in word) == (8,) + (0,) * 7, 'self-column norm') + columns = [(0,) * 8, SECOND, vertices[edges[0][0]], vertices[edges[0][1]]] + for i, j in product(range(4), repeat=2): + difference = [a - b for a, b in zip(columns[i], columns[j], strict=True)] + require(residue(difference) == ((8,) + (0,) * 7 if i == j else zero), 'attaining Gram') + require((tensor_residue(difference) == zero) == (i != j), 'attaining tensor Gram') + mutations = 0 + for column, row, change in product(range(4), range(8), range(1, 15)): + altered = list(columns[column]) + altered[row] = (altered[row] + change) % 15 + other = columns[(column + 1) % 4] + require(residue(a - b for a, b in zip(altered, other, strict=True)) != zero, + 'one-entry change escaped Gram check') + mutations += 1 + return {'vertices': vertices, 'edges': edges, 'components': components, + 'pair_checks': comb(len(vertices), 2), 'triple_checks': comb(len(vertices), 3), + 'maximal_three_column_sets': 83, 'maximal_four_column_sets': 12, + 'attaining_matrix_rows': list(zip(*columns, strict=True)), + 'single_entry_mutations_rejected': mutations, + 'wrong_bilinear_edge_count': len(wrong_edges)} + + +def collect(): + count = source_check() + vertices, enumeration = enumerate_columns() + return {'source_files': count, 'exact_capacity': 4, + 'enumeration': enumeration, 'extension_graph': graph_check(vertices)} + + +def main(): + actual = collect() + expected = json.loads((ROOT / 'RESULT.json').read_text()) + require(json.loads(json.dumps(actual)) == expected, 'saved certificate mismatch') + print('PASS_FIFTEENTH_ROOT_COLUMN_CAPACITY') + print('Exact maximum: four orthogonal columns in eight rows over fifteenth roots') + print('116280 tail multisets; two enumerations of 20160 normalized columns; 95 extensions') + print('4465 pairs; 138415 triples; graph = two six-cycles and 83 isolated vertices') + print('Twelve normalized four-column sets; exact attaining Gram; 448 changed entries reject') + + +if __name__ == '__main__': + main() diff --git a/research/odd-prime-phase-blocks/retained/source7775/verify.py b/research/odd-prime-phase-blocks/retained/source7775/verify.py new file mode 100644 index 0000000000..84b23751a1 --- /dev/null +++ b/research/odd-prime-phase-blocks/retained/source7775/verify.py @@ -0,0 +1,205 @@ +"""Check exact controls for two-prime alphabet descent. + +Ali Romman with substantial OpenAI Codex assistance. Apache-2.0. +""" +from collections import Counter +from functools import cache +from hashlib import sha1, sha256 +from itertools import combinations +import json +from pathlib import Path +import subprocess +import sys + +ROOT = Path(__file__).resolve().parent + + +def require(condition, message): + if not condition: + raise ValueError(message) + + +def divide(poly, divisor): + work = list(poly) + quotient = [0]*(len(work)-len(divisor)+1) + for i in range(len(quotient)-1, -1, -1): + factor = work[i+len(divisor)-1] + quotient[i] = factor + for j, value in enumerate(divisor): + work[i+j] -= factor*value + require(not any(work), 'exact cyclotomic division') + return tuple(quotient) + + +@cache +def cyclotomic(order): + poly = (-1,)+(0,)*(order-1)+(1,) + for d in range(1, order): + if order % d == 0: + poly = divide(poly, cyclotomic(d)) + return poly + + +def roots(order): + poly = cyclotomic(order) + degree = len(poly)-1 + values = [] + row = (1,)+(0,)*(degree-1) + for _ in range(order): + values.append(row) + shifted = (0,)+row + row = tuple(shifted[i]-shifted[-1]*poly[i] for i in range(degree)) + require(row == values[0] and len(set(values)) == order, 'primitive root orbit') + return values + + +def root_sum(exponents, basis): + return tuple(sum(basis[e % len(basis)][i] for e in exponents) for i in range(len(basis[0]))) + + +def legal_pattern(values, q): + counts = sorted(Counter(values).values()) + return len(counts) == 1 or counts == [3, q] + + +def collision_checks(): + canonical = 0 + for q in (5, 7, 11, 13): + for modulus in (3, 5, 9, 15, 25): + for intersection in range(3): + left = {0, 1, 2} + right = set(range(intersection)) | set(range(3, 6-intersection)) + require(len(right) == 3 and len(left & right) == intersection, 'intersection representative') + for t in range(1, modulus): + for u in range(1, modulus): + values = [(t*(i in left)-u*(i in right)) % modulus for i in range(q+3)] + require(not legal_pattern(values, q), 'distinct three-subsets accepted') + canonical += 1 + full = 0 + for q, modulus in ((5, 3), (5, 5), (7, 3), (7, 5)): + subsets = list(combinations(range(q+3), 3)) + for left, right in combinations(subsets, 2): + left, right = set(left), set(right) + for t in range(1, modulus): + for u in range(1, modulus): + values = [(t*(i in left)-u*(i in right)) % modulus for i in range(q+3)] + require(not legal_pattern(values, q), 'full subset-pair collision') + full += 1 + # Without the prime-size condition, disjoint triples can give counts 3 and 6. + control = [(int(i < 3)+int(3 <= i < 6)) % 5 for i in range(9)] + require(legal_pattern(control, 6), 'composite-size scope control') + return {'canonical_intersection_cases': canonical, 'all_subset_pair_cases': full, + 'composite_q6_pattern_control': sorted(Counter(control).values())} + + +def check_gram(matrix, basis): + n, m = len(matrix), len(matrix[0]) + for i in range(m): + for j in range(m): + actual = root_sum([row[j]-row[i] for row in matrix], basis) + require(actual == ((n,)+(0,)*(len(basis[0])-1) if i == j else (0,)*len(basis[0])), + 'exact cyclotomic Gram') + return m*m + + +def dephase(matrix, modulus): + return [[(v-row[0]-matrix[0][j]+matrix[0][0]) % modulus for j, v in enumerate(row)] + for row in matrix] + + +def alphabet_case(q, a, b, attaining): + modulus, base = 3**a*q**b, 3*q + quotient = modulus//base + basis = roots(modulus) + lookup = {row: i for i, row in enumerate(basis)} + normalized_triples = [] + for i, row in enumerate(basis): + target = tuple(-x-y for x, y in zip(basis[0], row, strict=True)) + if target in lookup: + normalized_triples.append((0, i, lookup[target])) + expected = [(0, modulus//3, 2*modulus//3), (0, 2*modulus//3, modulus//3)] + require(normalized_triples == expected, 'complete normalized three-root sums') + line_pairs = 0 + for left in normalized_triples: + for right in normalized_triples: + value = root_sum([y-x for x, y in zip(left, right, strict=True)], basis) + require(value == ((3,)+(0,)*(len(basis[0])-1) if left == right else (0,)*len(basis[0])), + 'parallel or orthogonal Fourier lines') + line_pairs += 1 + cycles3 = [tuple((shift+k*(modulus//3)) % modulus for k in range(3)) for shift in range(modulus//3)] + cyclesq = [tuple((shift+k*(modulus//q)) % modulus for k in range(q)) for shift in range(modulus//q)] + for cycle in cycles3+cyclesq: + require(not any(root_sum(cycle, basis)), 'exact prime cycle') + constant = mixed = 0 + for first in cycles3: + for second in cyclesq: + combined = first+second + require(max(Counter(combined).values()) <= 2, 'cycle root multiplicity exceeds two') + histogram = sorted(Counter(e % quotient for e in combined).values()) + require(histogram in ([q+3], [3, q]), 'higher-phase coset counts') + constant += histogram == [q+3] + mixed += histogram == [3, q] + require(constant == modulus and constant+mixed == modulus*quotient, 'complete cycle-pair count') + triple = [[(r*j*(modulus//3)+j) % modulus for j in range(3)] for r in range(3)] + triple += [[r*j*(modulus//q) % modulus for j in range(3)] for r in range(q)] + checks = check_gram(triple, basis) + ratio = (triple[0][1]-triple[0][0]-triple[3][1]+triple[3][0]) % modulus + require(ratio == 1, 'essential higher-phase cross ratio') + if quotient > 1: + require(any(e % quotient for row in dephase(triple, modulus) for e in row), + 'three-column nondescending example lost') + lifted = None + if q == 5: + lifted = [[quotient*v for v in row] for row in attaining] + checks += check_gram(lifted, basis) + changed = [[(v+(r+1)**2+3*j*j+1) % modulus for j, v in enumerate(row)] + for r, row in enumerate(lifted)] + checks += check_gram(changed, basis) + require(dephase(changed, modulus) == lifted, 'exact row/column phase recovery') + if quotient > 1: + require(any((row[0]-changed[0][0]) % quotient for row in changed), + 'column-only gauge control') + return {'q': q, 'a': a, 'b': b, 'modulus': modulus, 'quotient_order': quotient, + 'cyclotomic_degree': len(basis[0]), 'prime_cycles': len(cycles3)+len(cyclesq), + 'cycle_pairs': constant+mixed, 'constant_coset_pairs': constant, 'mixed_coset_pairs': mixed, + 'normalized_three_root_sums': normalized_triples, 'Fourier_line_pairs': line_pairs, + 'sharp_three_column_example': triple, 'cross_ratio_exponent': ratio, + 'cannot_descend': quotient > 1, 'four_column_attainment': lifted, + 'exact_Gram_entries': checks} + + +def collect(): + pins = json.loads((ROOT/'SOURCE-PINS.json').read_text())['sources'] + for pin in pins: + raw = (ROOT/pin['retained']).read_bytes() + require(sha256(raw).hexdigest() == pin['sha256'] and + sha1(b'blob '+str(len(raw)).encode()+b'\0'+raw).hexdigest() == pin['git_blob'], 'source pin') + source = ROOT/'retained/source7769' + run = subprocess.run([sys.executable, '-W', 'error', *(['-O'] if sys.flags.optimize else []), + '-B', str(source/'verify.py')], capture_output=True, text=True, check=True, timeout=60) + require('PASS_FIFTEENTH_ROOT_COLUMN_CAPACITY' in run.stdout, 'unchanged full base capacity') + result = json.loads((source/'RESULT.json').read_text()) + require(result['exact_capacity'] == 4, 'source exact capacity') + attaining = result['extension_graph']['attaining_matrix_rows'] + require(cyclotomic(15) == (1, -1, 0, 1, -1, 1, 0, -1, 1), 'source Phi15 convention') + cases = [alphabet_case(q, a, b, attaining) for q in (5, 7) for a, b in ((1, 1), (2, 1), (1, 2), (2, 2))] + return {'source_files': len(pins), 'quotient_collision_checks': collision_checks(), + 'alphabet_cases': cases, 'cycle_pairs_checked': sum(c['cycle_pairs'] for c in cases), + 'exact_Gram_entries': sum(c['exact_Gram_entries'] for c in cases), + 'universal_statement': 'q>=5 prime; a,b>=1; q+3 rows; at least four orthogonal columns descend to mu_(3q)', + 'eight_row_capacity': 'exactly four for every mu_(3^a*5^b), a,b>=1', + 'sharp_column_threshold': 'three-column examples do not descend when 3^a*q^b>3q'} + + +def main(): + actual = collect() + require(json.loads(json.dumps(actual)) == json.loads((ROOT/'RESULT.json').read_text()), 'saved result mismatch') + print('PASS_TWO_PRIME_ALPHABET_DESCENT') + print('At least four orthogonal columns with q+3 rows descend from mu_(3^a*q^b) to mu_(3q)') + print('Exact eight-row capacity four for all a,b>=1; three-column boundary is sharp') + print('Exact quotient-pattern, prime-cycle, Fourier-line, cross-ratio and lifted-attainment checks pass') + print('Unchanged complete fifteenth-root capacity and nested source checks pass') + + +if __name__ == '__main__': + main() diff --git a/research/odd-prime-phase-blocks/verify.py b/research/odd-prime-phase-blocks/verify.py new file mode 100644 index 0000000000..7b48f54e08 --- /dev/null +++ b/research/odd-prime-phase-blocks/verify.py @@ -0,0 +1,251 @@ +"""Check exact controls for the two odd prime block theorem.""" +from collections import Counter +from functools import cache +from hashlib import sha1, sha256 +from itertools import combinations, permutations +from pathlib import Path +import argparse +import json +import subprocess +import sys + +HERE = Path(__file__).resolve().parent + + +def need(ok, message): + if not ok: + raise ValueError(message) + + +def divide(poly, divisor): + row = list(poly) + quotient = [0]*(len(row)-len(divisor)+1) + for i in range(len(quotient)-1, -1, -1): + quotient[i] = value = row[i+len(divisor)-1] + for j, c in enumerate(divisor): + row[i+j] -= value*c + need(not any(row), 'exact polynomial division') + return tuple(quotient) + + +@cache +def cyclotomic(m): + poly = (-1,)+(0,)*(m-1)+(1,) + for d in range(1, m): + if m % d == 0: + poly = divide(poly, cyclotomic(d)) + return poly + + +@cache +def reduction(m): + poly = cyclotomic(m) + return len(poly)-1, [(i,c) for i,c in enumerate(poly) if c] + + +def zero(exponents, m, constant=0): + row = [0]*m + for e in exponents: + row[e % m] += 1 + row[0] -= constant + degree, terms = reduction(m) + for i in range(m-1, degree-1, -1): + value = row[i] + if value: + for j,c in terms: + row[i-degree+j] -= value*c + return not any(row) + + +def gram(matrix, m): + n, columns = len(matrix), len(matrix[0]) + for i in range(columns): + for j in range(columns): + need(zero([row[j]-row[i] for row in matrix], m, n if i==j else 0), 'exact Gram') + return columns*columns + + +def quotient_checks(): + pairs = [(3,5),(3,7),(5,7),(5,11),(7,11),(7,13),(11,13),(13,17)] + canonical = 0 + for p,q in pairs: + for modulus in (3,5,9,15,25,27): + for k in range(p): + for t in range(1,modulus): + for u in range(1,modulus): + counts = Counter() + for value, count in [(0,q-p+k),(t,p-k),(-u,p-k),(t-u,k)]: + counts[value % modulus] += count + positive = sorted(c for c in counts.values() if c) + need(len(positive) > 1 and positive != [p,q], 'different exceptional subsets') + canonical += 1 + # Enumerate actual subsets by a second route, rather than intersection representatives. + subsets = [set(s) for s in combinations(range(12),5)] + full = 0 + for left,right in combinations(subsets,2): + for t,u in ((1,1),(1,2),(2,1),(2,2)): + values = [(t*(r in left)-u*(r in right)) % 3 for r in range(12)] + counts = sorted(Counter(values).values()) + need(len(counts)>1 and counts != [5,7], 'full subset-pair exclusion') + full += 1 + return dict(prime_pairs=pairs,odd_quotient_orders=[3,5,9,15,25,27],canonical_cases=canonical, + full_p5_q7_modulus3_subset_pairs=full) + + +def permutation_checks(): + cases = [] + for p in (3,5,7): + accepted = total = 0 + for permutation in permutations(range(p)): + ratios = [(i-permutation[i]) % p for i in range(p)] + need(sum(ratios) % p == 0, 'product of two permutations') + counts = Counter(ratios) + possible = any(all(counts[r] <= 1+int(r==extra) for r in range(p)) for extra in range(p)) + if possible: + need(all(counts[r]==1 for r in range(p)), 'product excludes a missing and repeated root') + need(zero(ratios,p), 'exact orthogonality of every compatible ratio pattern') + accepted += 1 + total += 1 + cases.append(dict(p=p,relative_permutations=total,compatible_orthogonal_patterns=accepted)) + control = [0,3,3,5,1] + need(zero(control,6) and sum([3,3]) % 6 == 0 and not zero([3,3],6), 'even-prime product control') + return dict(cases=cases,even_prime_control=dict(p=2,q=3,full_zero_sum_exponents=control, + selected_exponents=[3,3],product_is_one=True,selected_sum_is_zero=False)) + + +def normal_form(matrix,p,q,m): + gram(matrix,m) + n, columns, factor = p+q,len(matrix[0]),m//(p*q) + dephased = [[(row[j]-row[0]) % m for j in range(columns)] for row in matrix] + subsets = [] + for j in range(columns): + counts = Counter(row[j] % factor for row in dephased) + majority = max(counts,key=counts.get) + need(sorted(counts.values()) in ([n],[p,q]), 'column quotient type') + subset = [r for r in range(n) if (dephased[r][j]-majority) % factor] + if subset: + need(len(subset)==p, 'exceptional subset size') + subsets.append(subset) + if not subsets: + answer = [[(row[j]-dephased[0][j]) % m for j in range(columns)] for row in dephased] + need(all(e % factor == 0 for row in answer for e in row), 'squarefree double dephasing') + return dict(kind='descended',entries=[[e//factor for e in row] for row in answer]) + chosen = subsets[0] + need(all(s==chosen for s in subsets), 'common exceptional subset') + other = [r for r in range(n) if r not in chosen] + answer = [[(row[j]-dephased[other[0]][j]) % m for j in range(columns)] for row in dephased] + gamma = answer[chosen[0]] + top = [[(answer[r][j]-gamma[j]) % m for j in range(columns)] for r in chosen] + bottom = [answer[r] for r in other] + need(all(e % (m//p)==0 for row in top for e in row), 'p-root block') + need(all(e % (m//q)==0 for row in bottom for e in row), 'q-root block') + top = [[e//(m//p) for e in row] for row in top] + bottom = [[e//(m//q) for e in row] for row in bottom] + gram(top,p);gram(bottom,q) + need(columns<=p and any((e-gamma[0]) % factor for e in gamma), 'essential higher phase') + for i,r in enumerate(chosen): + need(answer[r]==[(top[i][j]*(m//p)+gamma[j]) % m for j in range(columns)], 'top reconstruction') + for i,r in enumerate(other): + need(answer[r]==[e*(m//q) for e in bottom[i]], 'bottom reconstruction') + return dict(kind='two_blocks',top_rows=chosen,p_block=top,q_block=bottom,column_phases=gamma) + + +def alphabet_case(p,q,a,b): + m = p**a*q**b + factor = m//(p*q) + need(len(cyclotomic(m))-1 == (p-1)*(q-1)*factor, 'cyclotomic degree') + cycles_p = [[(s+i*(m//p)) % m for i in range(p)] for s in range(m//p)] + cycles_q = [[(s+i*(m//q)) % m for i in range(q)] for s in range(m//q)] + for cycle in cycles_p+cycles_q: + need(zero(cycle,m), 'rotated prime cycle') + pair_count = product_cases = accepted = 0 + for left in cycles_p: + coset = left[0] % (m//p) + for right in cycles_q: + full = left+right + need(sorted(Counter(e % factor for e in full).values()) in ([p+q],[p,q]), 'two-cycle quotient counts') + extra = [e for e in right if e % (m//p)==coset] + need(len(extra)<=1, 'prime cosets meet at most once') + pool = left+extra + for selected in combinations(pool,p): + if sum(selected) % m == (p*coset) % m: + need(Counter(selected)==Counter(left), 'odd-prime product rigidity') + accepted += 1 + product_cases += 1 + pair_count += 1 + examples = [] + gram_count = mutants = 0 + for columns in sorted({2,p}): + original = [[(r*j*(m//p)+j) % m for j in range(columns)] for r in range(p)] + original += [[r*2*j*(m//q) % m for j in range(columns)] for r in range(q)] + gram_count += gram(original,m) + cross_ratio = (original[0][1]-original[0][0]-original[p][1]+original[p][0]) % m + need(cross_ratio==1, 'sharp cross ratio') + permutation = list(range(0,p+q,2))+list(range(1,p+q,2)) + changed = [[(original[r][j]+17*r*r+5*r+1+3*j*j+11*j+7) % m + for j in range(columns)] for r in permutation] + gram_count += gram(changed,m) + block = normal_form(changed,p,q,m) + need(block['kind']==('two_blocks' if factor>1 else 'descended'), 'normal-form branch') + if factor>1: + gram_count += 2*columns*columns + # Relative block phases in the smaller alphabet give the opposite branch. + squarefree = [[(r*j*(m//p)+j*factor) % m for j in range(columns)] for r in range(p)] + squarefree += [[r*2*j*(m//q) % m for j in range(columns)] for r in range(q)] + gram_count += gram(squarefree,m) + need(normal_form(squarefree,p,q,m)['kind']=='descended', 'squarefree phase control') + bad = [row[:] for row in original];bad[0][1] = (bad[0][1]+1) % m + try: + gram(bad,m) + except ValueError as error: + need(str(error)=='exact Gram', 'mutation fails at the intended boundary') + else: + raise ValueError('single-entry phase error accepted') + mutants += 1 + examples.append(dict(columns=columns,cross_ratio_exponent=cross_ratio,normal_form=block)) + # Columns zero and two share a phase class; column one is a different class. + shared = [[(r*j*(m//p)+int(j==1)) % m for j in range(p)] for r in range(p)] + shared += [[r*2*j*(m//q) % m for j in range(p)] for r in range(q)] + gram_count += gram(shared,m) + shared_form = normal_form(shared,p,q,m) + need(shared_form['kind']==('two_blocks' if factor>1 else 'descended'), 'same-class block control') + if factor>1: + gram_count += 2*p*p + return dict(p=p,q=q,a=a,b=b,modulus=m,quotient_order=factor,cycle_pairs=pair_count, + product_submultisets=product_cases,accepted_product_submultisets=accepted, + exact_Gram_entries=gram_count,single_entry_mutants=mutants,examples=examples,same_class_example=shared_form) + + +def collect(): + pins = json.loads((HERE/'SOURCE-PINS.json').read_text())['sources'] + for pin in pins: + raw = (HERE/pin['retained']).read_bytes() + need(sha256(raw).hexdigest()==pin['sha256'] and sha1(b'blob '+str(len(raw)).encode()+b'\0'+raw).hexdigest()==pin['git_blob'], 'source bytes') + source = HERE/'retained/source7775/verify.py' + completed = subprocess.run([sys.executable,'-W','error',*(['-O'] if sys.flags.optimize else []),'-B',str(source)],capture_output=True,text=True,check=True,timeout=60) + need('PASS_TWO_PRIME_ALPHABET_DESCENT' in completed.stdout, 'unchanged predecessor replay') + definitions = [(3,5,1,1),(3,5,2,1),(3,7,1,2),(5,7,1,1),(5,7,2,1),(5,7,1,2), + (5,7,2,2),(5,11,2,1),(7,11,2,1),(7,11,1,2),(7,13,2,1),(11,13,2,1)] + cases = [alphabet_case(*d) for d in definitions] + return dict(source_files=len(pins),quotient_checks=quotient_checks(),permutation_checks=permutation_checks(), + alphabets=cases,total_cycle_pairs=sum(c['cycle_pairs'] for c in cases), + total_product_submultisets=sum(c['product_submultisets'] for c in cases), + exact_Gram_entries=sum(c['exact_Gram_entries'] for c in cases), + single_entry_mutants=sum(c['single_entry_mutants'] for c in cases), + statement='For distinct odd primes p=1, p+q-row column capacity over mu_(p^a q^b) equals that over mu_(pq).', + block_statement='Every matrix that cannot descend has at most p columns and a row/column phase normal form [A D; B], with orthogonal columns in A over mu_p and in B over mu_q.') + + +if __name__ == '__main__': + parser = argparse.ArgumentParser(description=__doc__) + parser.add_argument('--record',action='store_true') + args = parser.parse_args() + result = json.loads(json.dumps(collect())) + if args.record: + (HERE/'RESULT.json').write_text(json.dumps(result,indent=2)+'\n') + else: + need(result==json.loads((HERE/'RESULT.json').read_text()), 'deposited result') + print('PASS_ODD_PRIME_PHASE_BLOCKS') + print('General two-block classification, sharp p-column boundary and prime-power capacity equality') + print('Exact quotient, relative-permutation, cycle-product, phase-gauge and mutation checks pass') + print('Unchanged p=3 descent and complete eight-row capacity sources pass')