Repository navigation
Show four-stage K=4 schedules miss the Theorem S bound over F2 (no new κ) - #125
Draft
unpaidmoon wants to merge 1 commit into
Draft
unpaidmoon wants to merge 1 commit into
unpaidmoon wants to merge 1 commit into
Conversation
The F2 multi-pair model has no 4-stage schedule of cost 11. Chains already attain 12 at s=3, so four stages do not beat three at this size. No new kappa. Co-authored-by: unpaidmoon <unpaidmoon@users.noreply.github.com>
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.
Change and mathematical scope
Scoped negative result in the F2 multi-pair stage model. No κ change and no selected-frontier update. The selected record stays κ = 781451/250000000 from
certificates/selected-result.json(source PR CrocSwap#6030 and its manifest), with the five framework assumptions still in force.Theorem S gives N ≥ 2K + ceil(2K/(s−1)) pair-calls for s stages on K bank pairs. For K = 4 and s = 4 the bound is N = 11, while parallel B1 chains attain N = 12 at s = 3. Over F2, in the model of
research/multipair-schedule-bound(bridges quotiented out; a stage [[I, H], [E, I]] with HE = EH = 0), no 4-stage schedule reaches the goal at cost 11. Every 4-stage schedule therefore has N ≥ 12. Four stages do not beat three stages at this size, and the minimum over schedules with at most four stages is 12.The proof is the equality-signature skeleton of Theorem S (18 edges, waste exactly 3) plus an exhaustive GL(X)×GL(Y) orbit search along those edges. Stage 1 is one orbit per rank signature. The four reachable stage-2 orbits have no legal equality child, so the goal is unreachable. Dimension counts still allow waste 3; the obstruction is F2 linear algebra.
Remaining obligations: the same question over a field other than F2, and attainment at the predecessor's historical s = 8 price. This package does not rerun the selected supplier.
Task and overlap
626e936ce4d61f2584316914fc71baf96940c512(upstreammainat submission).coverage-law-change, priority revision 8. Scope status: changed.research/multipair-schedule-bound(merged PR Research: multi-pair schedules cannot beat the nine-stage template (Theorem S, no new κ) CrocSwap/integer-mult-bounds#2052) already retargeted that card onto non-B_K schedules and left K = 4, s = 4 as its first open instance. This package decides that instance over F2. It does not price the selected Conditional κ .003125804 (+5.22e-7 over #5907): remove helper 470's frame-593 rung, the twin of #5907's removal CrocSwap/integer-mult-bounds#6030 supplier, and the predecessor's historical T74 percentages are not used as a current limit.research/three-bank-restored-unpaidare the predecessor's other open question (a third bank class) and are left untouched. Other "Theorem S" hits are different theorems.research/theorem-s-k4-s4/.Validation
CPython 3.12, standard library only. Metadata pins and the registered hook passed:
The hook reruns
research/theorem-s-k4-s4/verify.py(about 40s here) and checks:sched_searchfrontier.Not run: selected-supplier replay, Lean, Docker, and any search outside F2. The predecessor's chain replay is cited for odd-stage attainment of N = 12 at s = 3; it is not re-executed here.
Credit
Theorem S, the stage model, the K = 2 frontier, the K = 3 negative search, and odd-stage chain attainment are from themilkman216, with substantial Claude assistance, in
research/multipair-schedule-bound(PR CrocSwap#2052), generalisingresearch/cross-shear-stage-boundand citingresearch/format-limits-corrected. The T74 prices there come from PR CrocSwap#1800 and its lineage.Prepared by unpaidmoon with substantial Cursor Grok assistance. Apache-2.0.
Open next questions
Linked from
research/theorem-s-k4-s4/README.mdandTASK.json:Workflow feedback (optional)
The equality skeleton is small enough that the F2 decision is an ordinary Python orbit search once stage 1 is quotiented by GL(X)×GL(Y). The predecessor's note that K = 4 needs a compiled search can be retired for this one instance.