Repository navigation
Prove the exact shared-port graphic query transfer criterion - #3547
Merged
Mister-Meeseeks merged 1 commit intoOct 20, 2026
Merged
Mister-Meeseeks merged 1 commit into
Mister-Meeseeks merged 1 commit into
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.
Summary
Prove the exact shared-port graphic query transfer criterion and its scoped non-Fano application.
Of the 30 displayed rational/GF4 attachments, 13 preserve the supplied marked transfer and 17 fail it. The compatible cases preserve the literal pair-reader floor for arbitrary finite attached graphs. The failures concern these fixed maps. They do not prove that another transfer is impossible or that a decoder saves.
The old-field application is characteristic zero. A six-term actual rank-(4,4) failed-map control costs 14 against baseline 4. No supplier, new kappa or selected-frontier change is claimed.
The package retains all runtime and mathematical premises on canonical ancestry, with exact origins and predecessor credit. It builds on Philippe Van Velzen, ctoth and the actual-reader lineage through PR3414/3463/3472/3489/3491/3505, plus Nick Petalas's PR3506/3524/3535. PR3535 is comparison/handoff context; no foreign Git object is required for scientific replay.
Evidence
After: The written component-flow/path proof gives the exact partition criterion. Separate rational/GF4 elimination and integer-minor/all-annihilator implementations agree on all 30 cases, 64 subsets each, the literal endpoint/ranks/bill and 1,024 five-vertex graph subsets.
check_research_commit.py --check-source-history, focused Ruff and formatting pass. Official committed export creation/check and all 3 actual Git-free scientific/control commands pass withPATH=/nonexistent; source, export and shared-runtime identities remain unchanged.python3.12 -B scripts/research_package.py --package research/p112-multiport-query-boundary. Proof, source closure, exact result, controls, direct commands and limits are in that package. Independent human and formal proof-kernel review are unclaimed.Physical acquisition, coefficient execution, dirty restoration, frames/hosting, precision, stock, compiler/all-size admission and a complete consumer remain separate. Other marked pairs, odd characteristics, larger interfaces and alternative transfer maps are not covered. No Lean, Docker or broad selected-supplier replay was run.
Merge Danger
Door: two-way
One isolated research package; frozen inputs, shared tooling and selected frontier are unchanged.
Blast Radius: research
Archival publication and passing source checks do not imply scientific acceptance.