Repository navigation
Conversation
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
Add this suggestion to a batch that can be applied as a single commit.This suggestion is invalid because no changes were made to the code.Suggestions cannot be applied while the pull request is closed.Suggestions cannot be applied while viewing a subset of changes.Only one suggestion per line can be applied in a batch.Add this suggestion to a batch that can be applied as a single commit.Applying suggestions on deleted lines is not supported.You must change the existing code in this line in order to create a valid suggestion.Outdated suggestions cannot be applied.This suggestion has been applied or marked resolved.Suggestions cannot be applied from pending reviews.Suggestions cannot be applied on multi-line comments.Suggestions cannot be applied while the pull request is queued to merge.Suggestion cannot be applied right now. Please check back later.
Scoped negative result: every finite word on the four-projector maximizer with at most three saturated exponent relations has only two productive diagonal targets. For all four types present, nonzero paid labels, a torsion-free paid-generated exponent group and the original four-coordinate diagonal boundary, the endpoint is
diag([u],[u],1,1). The complete rank-power tariff cannot improve for0<t<=1. No new kappa follows.Read the proof, order certificates, checker, source pins and credits. This resolves the minimal-relation word question for the alphabet in PR #7749.
The proof gives necessary and sufficient conditions. No P or Q can lie between the first and last R calls. No Q can lie between the first and last S calls. After deleting P/Q, the R/S word has at most three runs. Exact totals must satisfy P=Q=u and R=S=0. A private-writer lemma first proves that R and S each need two calls, so six calls are the sharp minimum. Three independent first-order patterns and four independent commutators force the chronology at every length. Exact private-row identities then force cancellation; parity alone is insufficient.
All 35 multiplicity domains through nine calls agree under two separate enumeration methods: 108,904 type orders, with exact quadratic and full Laurent checks. Exactly 8,412 endpoints are diagonal, all with the predicted entries. A separate multivariate engine checks 175 products. Four hundred conjugated single-writer controls and three even-total faults pass. The source geometry verifier runs unchanged. The finite domains support the written all-length proof; they do not enumerate all saturated lattices.
Python 3.12, standard library only:
Both registered commands print:
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 requiresmake 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.Nick Petalas (@petalas) supplied the alphabet and question and unchanged geometry checker. His notices credit Ali Romman (@aliromman), with substantial OpenAI Codex assistance, for the comparison pool in PR #7707 and matching theorem in PR #7692. The augmentation approach follows the retained proof in PR #7711, which credits Jerry Jiaheng Chen (@CubeJerry) and PR #6782. The finite engines adapt PR #7763, with its checker and credit chain retained byte-exact.
More than three relations, changed projector pools or coordinate boundaries, native realization, physical storage/restoration and the complete caller invoice remain open. The full PR7711/PR7763 word suites, other geometry suites, selected cold replay, Lean and Docker were not run. All five framework assumptions and the selected frontier remain unchanged. No global literature priority or independent human/formal-kernel acceptance is claimed.
Base: canonical main
e54523517d0f03e58352e647c403a5af3e525a57, priority revision 8. Eight source files retain their exact pins; no unmerged ancestry is asserted. Prepared by Ali Romman with substantial OpenAI Codex assistance in research, implementation, verification and writing. Apache-2.0. Canonical claim.