Repository navigation
Prove exact nineteen-term tariffs for nonprincipal zero-sum triples - #5259
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.
The previously open demand
(e,h,e+h)overF2[e,h]/(e,h)^2now has an exact tariff for every strictly positive destination-row price vector. This package proves the all-word lower bound, gives every matching construction, and identifies all 19 indispensable aggregate count vectors. It resolves the unequal all-nonunit example left by #5163 and #5208.The theorem extends to any commutative unital ring and any triple whose sum is zero and whose generated ideal is nonprincipal. Finiteness and locality are unnecessary. There are exactly three arbitrary dirty rows and one preserved disjoint source; all original dirt must return. Insertion into row i costs mu_i; every ADD into row i costs c_i. Prices are stationary, coefficient-independent complete abstract prices.
For distinct i,j,k, the compact formula is:
The proof classifies insertion support. A nonprincipal ideal excludes a single insertion. Dirt restoration excludes exactly one incoming ADD per row. In the two-insertion-row case, either an insertion repeats, an insertion row must itself be restored, or the remaining row needs two calls from each unchanged parent. These cases supply the new exhaustive surcharge. Five word families attain the bounds, and explicit positive prices expose every vector uniquely. The argument includes arbitrary feedback, cancellations and interleavings; it never assumes a universal per-edge two-call rule.
At mu=(1,9,9), c=(1,1,1), the requested demand costs exactly 6. A Boolean-product example checks why nonprincipality cannot be omitted: an explicit one-insertion word costs 16 where the inapplicable formula gives 24. The cost-16 witness is only an upper bound for that different instance.
Changes are confined to the five files in
research/square-zero-triple-fanout/. The README contains the proof, chronological words, model boundaries and open next questions. Sources retain credit to lee-phys #5139/#5163, Nick Petalas #5208/#4916, Krzysztof Wojt #5045, Ross Richardson #3063/#3121 and the earlier fanout lineage. Prepared by lee-phys with substantial OpenAI Codex assistance; no subagents or independent reviewers were used.Validation at contribution head
d2a7d88f011ca9c520333da8d4e03f1f22d23e91:Reproduce from the repository root:
Base is freshly fetched canonical main
ff3cc58e370d0f678e529246f8c73e8094e18fcf, priority revision 7, unchanged at the submission refresh. The preceding survey covered 311 open PRs and 4,490 Discussion records. Entry and submission checks refreshed targeted all-state PR searches plus #1166/#5030; no resolving successor was found. Arbitrary historical diffs and unpublished work were not exhaustively searched. Canonical investigation.Hosted CI passed for this exact head: Registered research packages run 39970918113. Both planning and the focused registered replay succeeded; the replay executes the normal and optimized warning-strict commands. Run metadata confirms completed status, success and the matching head SHA.
The universal statement rests on the written proof; finite checks do not provide independent human or proof-kernel acceptance. Independently directed-edge prices, extra helpers and physical supplier accounting are outside this contract. The selected frontier is unchanged and no new kappa is claimed. Next questions concern the principal-ideal Boolean triple, directed-edge prices and demands without the zero-sum relation.