Repository navigation
Exact inverse envelope for unequal row contraction budgets - #5306
Merged
Mister-Meeseeks merged 1 commit intoOct 23, 2026
Merged
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.
This scoped proof gives the exact worst column norm of an inverse under unequal row contraction budgets and a fixed directed support. Maximum-product paths give an attaining matrix for every column. It extends the uniform-budget result without imposing a common worst row gap. The complete kappa calculation is unchanged.
Proof and scope, exact checker, replay declaration, and source provenance are pinned to the reviewed commit. Base: canonical main
ff3cc58e370d0f678e529246f8c73e8094e18fcf, priority revision 7.The initial proof and standalone check are in Discussion #5290.
CPython 3.12.14 registered normal and optimized replays passed: 5,259 attaining columns, 282 signed matrices and seven controls. Both print
PASS_UNEQUAL_ROW_ENVELOPE; the launcher printsPASS_REGISTERED_RESEARCH_PACKAGE. All five package files match their committed bytes, and the base is an ancestor of the package commit.Use Python 3.12 and the standard library. No external runtime inputs or third-party Python packages are required. Hosted planning and the registered package replay passed on this exact head in run 39989924902. No predecessor scientific suite, selected cold replay, native replay, compiler, Lean or Docker build was run. The optional full-history preflight is unavailable in this shallow checkout. Finite checks corroborate the written proof; they do not constitute independent human or proof-kernel acceptance.
Extract unequal rational row budgets from one emitted coefficient matrix and charge their preparation. Source preparation, native operations, precision, movement, and supplier/outer admission remain separate obligations.
Credit Ali Romman's PR #5255 for the uniform support optimum, Cinna Davis's PR #4100 for the conditioning context, and James Reed's PR #4282 for periodic sections. Neumann-series, maximum-principle, and optimal-path methods are classical. Prepared by Ali Romman with substantial OpenAI Codex assistance; Apache-2.0. No general literature-priority or independent human/proof-kernel acceptance is claimed.