Repository navigation
Prove exact incomparable-demand fanout tariffs over Z/n - #5089
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.
Change and mathematical scope
PR #5045 leaves incomparable demand ideals open, starting with
(2,3)overZ/6. This proves the exact optimum for that instance, gives all five attaining words and proves that their count vectors are the complete Pareto frontier. For arbitrary positive stationary coefficient-independent prices, withc_icharging ADD into row i:The additional algebra also extends #5045's piecewise five-term formula to every demand pair over every Z/n, n >= 2, including incomparable ideals with a nonunit common generator. Given demands x,y, the new construction chooses
beta=x-a*ywith(beta)=(x,y), using an elementary CRT argument. Writingy=r*betathen gives a single-insertion, four-ADD word with exact dirt restoration. The arbitrary-word source-count lower bound and directional return lemma are credited to #5045 and restated in the self-contained proof.Only
research/z6-incomparable-fanout/is added (five files). This is a scoped written algebraic proof with exact finite corroboration, no new κ. Exactly two arbitrary dirty rows, one preserved disjoint source, and full dirt restoration are required. Extra rows, observers, coefficient-dependent physical prices, arbitrary noncommutative incomparable ideals, a physical caller and compiler/outer admission remain outside scope. No independent human or proof-kernel acceptance is claimed.Task and overlap
81e9bd69e4a5b00ba9c713a1620e36d576d5522e; unchanged at the submission refresh. Priority revision 7; selected κ remains60403/20000000.bit-helper-contractis marked changed, preserving the full original card and explaining the algebraic side-result boundary.8639d7b6348d9b09683e71d74afcceedf2d4bdc0: proof and README are pinned by Git blob and SHA256 at the new base, as provenance. No predecessor executable is imported or rerun.incomparable/fanout/5045searches and the live DONE: exact two-row nonunit dirty-fanout tariff (#5045) #5030 thread. The submission snapshot covers 307 open PRs (08:39 UTC) and 4,212 Discussion records (08:41 UTC), with complete reported remote pagination. No resolving successor or conflicting active claim was found in that coverage. Local note coverage is sparse; arbitrary diffs, omitted notes, unpublished work and later activity are not exhaustively covered.Validation
At contribution head
ba325c0b94bc69d2a0d264bec581899f220d4613, standard-library Python 3.12 on macOS:PATH=/nonexistent; all six exported files remain unchanged.The universal conclusion rests on the written CRT and arbitrary-word proofs, not extrapolation from the finite price/modulus checks. No selected-construction cold replay, Lean or Docker was needed for this isolated result. Optional full source-history ancestry checking was not run in the shallow checkout. Hosted CI passed both planning and the registered package replay at this exact head in run 39926839937. This is replay evidence, not mathematical acceptance.
Credit
Prepared by lee-phys with substantial OpenAI Codex assistance in derivation, implementation, checking and writing; Apache-2.0. Credit Krzysztof Wójt #5045 for the source-count lower bound, directional return lemma and comparable-demand result; Nick Petalas #4916 for the ring-valued contract; Ross Richardson #3121/#3063; Cinna Davis #1944/#1968; Anthony #774; Oscar Fennell #759; Tekalign #3130; and the retained lineage. No novelty is claimed for CRT or the inherited lower-bound argument.
Open next questions
README and TASK give first steps and blockers for the one-insertion orbit over other rings, three-row nonunit demand
(2,1,1)over Z/4, and one actual caller with a complete physical tariff matrix. The residue-ring two-row question is resolved within the stated contract; these extensions remain separate.