From d5564350f5f711286d1c585d7a0b870b85bf3f0f Mon Sep 17 00:00:00 2001 From: Chris R Date: Mon, 19 Oct 2026 18:56:39 +1100 Subject: [PATCH 1/4] Reduce all-class rank-seven COPY to 196 ordinary adapters --- research/r437-parabolic-copy/.gitattributes | 1 + research/r437-parabolic-copy/PROOF.md | 269 ++++++++++++++ research/r437-parabolic-copy/README.md | 136 +++++++ research/r437-parabolic-copy/RESULT.json | 49 +++ research/r437-parabolic-copy/SOURCES.json | 48 +++ research/r437-parabolic-copy/TASK.json | 85 +++++ research/r437-parabolic-copy/VALIDATION.json | 65 ++++ research/r437-parabolic-copy/VERIFY.json | 50 +++ research/r437-parabolic-copy/independent.py | 132 +++++++ .../r437-parabolic-copy/inputs/R437-LICENSE | 201 ++++++++++ .../inputs/R437-UPSTREAM-NOTICE.md | 71 ++++ .../inputs/pr3950-PROOF.md | 346 ++++++++++++++++++ .../inputs/r437-word.json.gz | Bin 0 -> 42280 bytes research/r437-parabolic-copy/parabolic.py | 231 ++++++++++++ research/r437-parabolic-copy/test_package.py | 55 +++ research/r437-parabolic-copy/verify.py | 225 ++++++++++++ 16 files changed, 1964 insertions(+) create mode 100644 research/r437-parabolic-copy/.gitattributes create mode 100644 research/r437-parabolic-copy/PROOF.md create mode 100644 research/r437-parabolic-copy/README.md create mode 100644 research/r437-parabolic-copy/RESULT.json create mode 100644 research/r437-parabolic-copy/SOURCES.json create mode 100644 research/r437-parabolic-copy/TASK.json create mode 100644 research/r437-parabolic-copy/VALIDATION.json create mode 100644 research/r437-parabolic-copy/VERIFY.json create mode 100644 research/r437-parabolic-copy/independent.py create mode 100644 research/r437-parabolic-copy/inputs/R437-LICENSE create mode 100644 research/r437-parabolic-copy/inputs/R437-UPSTREAM-NOTICE.md create mode 100644 research/r437-parabolic-copy/inputs/pr3950-PROOF.md create mode 100644 research/r437-parabolic-copy/inputs/r437-word.json.gz create mode 100644 research/r437-parabolic-copy/parabolic.py create mode 100644 research/r437-parabolic-copy/test_package.py create mode 100644 research/r437-parabolic-copy/verify.py diff --git a/research/r437-parabolic-copy/.gitattributes b/research/r437-parabolic-copy/.gitattributes new file mode 100644 index 0000000000..fa1385d99a --- /dev/null +++ b/research/r437-parabolic-copy/.gitattributes @@ -0,0 +1 @@ +* -text diff --git a/research/r437-parabolic-copy/PROOF.md b/research/r437-parabolic-copy/PROOF.md new file mode 100644 index 0000000000..69fa04fb67 --- /dev/null +++ b/research/r437-parabolic-copy/PROOF.md @@ -0,0 +1,269 @@ +# Parabolic COPY with batched pivot and graph routing + +Chris R / Clear1nsight, with substantial OpenAI Codex assistance. Apache-2.0. + +## Result and boundary + +For m=64, r=7 and every split rank-seven projector over Z/q^w, the construction +below replaces PR3950's alternate generic SL64 word by **8,036 ordered scalar +ADD slots per column and 196 ordinary width-f interchanges**, surrounding the +same single reversed child of width 7f. PR3950's alternate has 41,832 of each. +All slots, including zero coefficients, are charged. This is a uniform algebraic +construction and a **conditional relative caller/cost theorem**; an encoded +physical compiler has not been implemented. The original R437 good/fallback +implementation is a different construction and its tariff is not altered. + +The change combines the parabolic stabilizer of a projector with small fixed +permutation networks. It removes unnecessary internal image/kernel basis work +and shares routing across commuting graph passes and mutually exclusive pivot +stars. Generic conjugacy, local-ring split projectors and elementary matrices +are credited predecessor mathematics, not new claims of this package. + +Even the reduced positive ordinary term is not absorbable from the pinned B1/B2 +upper tariffs at the R437 target scaling. The optimistic decision is therefore: +retain this smaller constructive relative bill, then stop supplier expansion +until a cheaper complete ordinary adapter or a different consumer is supplied. +This does not lower-bound actual runtime or exclude the original algorithm. + +## 1. Domain and a principal chart that always exists + +Fix an odd prime q, w>=1, R=Z/q^w, A=q^w, m>=2 and 0(x_s,-x_i). Grouping the triples +into stars is legal precisely because of that mutually exclusive flag property; +it would be false with two active candidates. Earlier stages cannot move s_i, +which is strictly larger than every earlier s_j. The product J therefore moves +the original S to the first r coordinates and has determinant one. + +The schedule has 3r(m-r) scalar factors with support independent of S, q, w, +header and column. No conditional physical permutation or low-class regrouping +is assumed: only scalar coefficients carry the pivot flags. All zero factors +remain emitted and paid. This addresses a source-dependent routing issue that +merely choosing a matrix basis would leave unresolved. + +## 3. Quotient out the stabilizer + +Write Q'=JQJ^-1 in blocks [[A0,B],[C,D]], with A0 an invertible r-by-r matrix. +Put X=C A0^-1 and Z=-B. Define + + L_X=[[I,0],[X,I]], U_Z=[[I,Z],[0,I]], T0=L_X U_Z. + +Then Q'=T0 E T0^-1. Here is a proof over the local ring, without a probabilistic +chart hypothesis. The first r columns of Q' are independent modulo q; since +im(Q') is a free direct summand of rank r, they form an R-basis of that image. +Thus D=C A0^-1 B=XB. Idempotence gives A0^2+BC=A0, hence A0+BX=I. Multiplying +out T0 E T0^-1 gives blocks I-BX, B, X(I-BX), XB, exactly Q'. Both L_X and +U_Z have determinant one; each is r(m-r) commuting elementary shears. +Set T=J^-1 T0, so Q=TET^-1 and det(T)=1. + +This uses only the image/kernel splitting, rather than a full arbitrary GL64 +basis. The stabilizer degrees of freedom do not need to be implemented. + +## 4. Ancestor units and kernel-only normalization + +Let H'=J H J^-1=diag(d_i). This is diagonal because J is a signed +permutation. Define the determinant-one diagonal + + D*=diag(d_0,...,d_(r-1), (product_(i