Skip to content

Construct rank-exact dyadic quaternion response factors - #7753

Open
aliromman wants to merge 1 commit into
CrocSwap:mainfrom
aliromman:codex/consecutive-result-068
Open

aliromman wants to merge 1 commit into
CrocSwap:mainfrom
aliromman:codex/consecutive-result-068

Conversation

@aliromman

@aliromman aliromman commented Nov 18, 2026 •

Copy link
Copy Markdown
Contributor

Every finite rectangular dyadic Hamilton-quaternion response factors through exactly its rational quaternion rank. The exact algorithm returns attaining factors without odd denominators. If 2^s A has integral coordinates, the left factor has at most one half per coordinate and the right factor has denominator dividing 2^(s+1). This answers the first open question in PR #7745. No new kappa or physical query implementation is claimed.

Read the proof, exact factor algorithm, certificates and witnesses, separate rank/product checker, source pins and credits.

Let O be the Hurwitz order. Norm-decreasing left row operations produce an echelon matrix while tracking a two-sided inverse. The nonzero echelon rows and the corresponding inverse columns give the factors. All these entries stay in O; restoring the input's central scale gives the denominator bound. A separate division-ring rank lower bound proves minimal width. Inverse updates multiply on the right, so the construction preserves noncommutative order.

A = C B,  width = rank_K(A)
C in Mat_(m,r)(O),  2^s B in Mat_(r,n)(O)
coordinate denominators: C divides 2; B divides 2^(s+1)
Evidence Coverage
Complete small alphabet All 625 two-by-two matrices over {0,1,i,j,(1+i+j+k)/2}
Rectangular responses 35 constructed cases across ten shapes, five dense cases, and four explicit witnesses; ranks zero through five
Exact certificates All 669 matrices and 947 Euclidean reductions; operation replay, two-sided inverses, products, pivots and denominator bounds
Separate rank method Rational Gaussian rank of each four-lane block matrix, independent of the Euclidean reducer
Order arithmetic 4,096 rounding points, sixteen Hamilton products and sixteen Hurwitz basis products
Failure controls Eight invalid domains, three altered certificates, reversed quotient order and integer-only stagnation
Retained source evidence Original eight basis responses, sixteen parity classes and twenty-four norm-two divisors, unchanged

Python 3.12, standard library only:

python3.12 -B scripts/research_package.py --package research/dyadic-quaternion-rank-factorization

Both registered commands print:

PASS_DYADIC_QUATERNION_RANK_FACTORIZATION exact rank and denominator certificates

Normal and optimized registered replay, syntax/indentation, committed bytes/source history/modes, export and sealed read-only Git-free serial replay pass. Hosted CI did not certify this package. The plan job failed in the shared test_current_ci_section_matches_selected_record: the base guide names frontier6030 while the selected record requires make frontier7000-verify. The log reports 760 tests, one failure and 24 skipped; package replay was skipped. This package changes no shared CI file. Local replay remains the scientific evidence. The written rounding, termination and factorization proof covers all finite sizes; the fixtures are corroboration.

Nick Petalas supplied the motivating response, integral obstruction and general-response handoff in the retained source proof. Dugongue supplied R03-R07 and RQ10 in the algebra volume of PR #5803. All six retained files and predecessor credit remain unchanged.

Hurwitz arithmetic and Euclidean row reduction are classical. John Voight's The Hurwitz order, section 11.3, supplies the classical norm-Euclidean reference. This is a source-specific answer and executable certificate for the repository's open coefficient question; no global novelty is claimed for that algebra or its usual rank-factorization consequence.

The theorem concerns the full dyadic Hamilton ring. A smaller ordinary dictionary can require more channels. Offline rational arithmetic may use odd denominators to choose a rounded quotient; the emitted coefficients obey the stated bound. Numerator growth, compiler bit complexity, a faithful live dictionary, reached-grid exact halving, query realization, source preservation, movement and scratch restoration remain open. Historical full suites, selected cold replay, Lean and Docker were not run. All five framework assumptions and the selected frontier remain unchanged.

Base: canonical main e54523517d0f03e58352e647c403a5af3e525a57, priority revision 8. Consumed heads: PR7745 b92ecb5f9579215dda5832fe604f4124b0198cde and PR5803 0acda5ab421d28b98fdf916968696c8f9453376f. No unmerged source ancestry is asserted. Prepared by Ali Romman with substantial OpenAI Codex assistance in research, implementation, verification and writing. Separate computational paths share the quaternion definitions and source response; no independent human or formal-kernel acceptance is claimed. Apache-2.0. Canonical claim.

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment

Labels

None yet

Projects

None yet

Development

Successfully merging this pull request may close these issues.

1 participant