Repository navigation
P104 t = −1 laws: charge deficiency, one-unit owned cuts, hub additivity, the per-J odd unit (no κ) - #7557
P104 t = −1 laws: charge deficiency, one-unit owned cuts, hub additivity, the per-J odd unit (no κ)#7557DreamingOfClouds wants to merge 4 commits into
Conversation
This is the exact documentation prerequisite retained by CrocSwap#7156. It points the onboarding check to the selected CrocSwap#7000/CrocSwap#7001 review. Credit to Rohan Arun and the source authors.
The PR CrocSwap#6292 rejection census and package plan are statements about 2485805. Load its exact sources and planner in a private sparse checkout, keeping all source hashes, 19 expected rejections, nine package selections and the empty-plan control. Subsequent edits to the live Makefile and CI guide no longer invalidate this historical check. The original audit is by unpaidmoon, building on Dennis’s historical replay gate. The pinned repository view follows the precedent of Matarener’s PR CrocSwap#5434. Repair prepared with substantial OpenAI Codex assistance.
…itivity, the per-J odd unit (no kappa) Co-Authored-By: Claude Opus 5.5 <noreply@anthropic.com>
|
lemma A is the enemy so like if you can break it please do |
…example checker
Lemma A as worded ("a y-atom leaves Y_q only during Y_q's neutral period or
through an owned copy") is false on E8/P104: a sigma-anchor design whose every
Y_t first takes -Z_ts x_s from a pure X_s, then is snapshotted and parked, has
0 neutral columns and 0 owned units yet D = 7 (literal bound 96).
counterexample.py reproduces this exactly (standard library, cross-validated
against a full register simulation, with controls). ADDENDUM.md states the
retraction, the corrected premise, what is proved (D >= (n - r) - dim Q_V for
all programs; Lemma P in the park family) and what stays open. Laws 1-4 are
unaffected; no kappa claim.
Co-Authored-By: Claude Opus 5.5 <noreply@anthropic.com>
|
Retraction (pushed in 31842e1). Law 5 as stated is withdrawn, together with the "neutral period" wording of its premise (Lemma A). The wording was "a y-atom of column q leaves Y_q only during Y_q's neutral period or through an owned copy". It is false on E8/P104.
Laws 1–4 are unaffected. There is no κ or price impact. The validator passes. — DreamingOfClouds with Claude Opus 5.5 (Anthropic), via Claude Code |
|
Follow-up to the addendum: the "one unit per source" bound is withdrawn, replaced by an exact rank formula ADDENDUM.md lists Theorem R (σ-anchor family) [proved]. D = rank(C′K) + res, where res = dim{u ∈ range G : (C′ − M0)ᵀu = 0} and M0 = Z_E⁻¹·G/2 − I.
Three independent exact computations agree on 85 random A3/A4/D4 designs and on every counterexample below: a full register simulation with Y exact, the witness system, and the formula. On the 92 designs behind the original ρ_K observation it matches D in 92/92 with res = 0. The cases there with D < ρ_K are exactly those with rank(C′K) < ρ_K. Counterexamples to D ≤ ρ_K, certified exactly on A4:
Consequences:
Also proved, for any legal program: every y-atom is an owned unit or a frame-local time difference of Y_q. Token-carrying public routes, the owned gauge J and carrier pre-loads therefore supply no further atom source. Still open: the column-priced corrected premise (PA_gen) outside the σ-anchor family. That is, pricing deliveries into Y_t that ride inside the exported atom rather than arriving after the snapshot. Law 5 remains conditional on it. No κ change. — DreamingOfClouds with Claude Opus 5.5 (Anthropic), via Claude Code |
|
Second follow-up: a column-priced bound that holds for any program (Theorem M), plus a second geometry where the per-source bound fails Theorem M [proved, any legal program]. D ≥ rank_K([v_x + v_y] over the arrivals at V) − (number of owned rows landing at V). Here the bracket is the merged class of each arrival's x-part and y-part, and the rank is taken over K = ker G.
What it says about contamination. The blanket statement "contamination always costs owned units" is false:
Per-source upper bound, now certified on two geometries (single-source family):
Status of Law 5. It is now best read through Theorem M, which is proved for any program. The y-class premise is superseded rather than open. No κ change. — DreamingOfClouds with Claude Opus 5.5 (Anthropic), via Claude Code |
Retraction / addendum (Nov 13). Law 5 as stated below, and the "neutral period" wording of its premise PA (Lemma A), are retracted.
counterexample.py, standard library only, exact, cross-validated against a full register simulation.research/p104-t-minus-one-laws/ADDENDUM.md.Theory package
research/p104-t-minus-one-laws/. It covers the t = −1 per-port contract on P104: M = [[1, −1], [1, 0]], X = x − y, Y = x. No κ claim, no word. The σ-rank o, o = rank(q-odd part), Lemma E and the hub bound come from #7555 and are cited, not repeated.Tags: [P] proved in PROOF.md, [C] exact standard-library check, [cond] conditional.
Results
D ≥ dim{k ∈ ker G : k_N = 0} ≥ n − r − N_neutral − N_owned, which is 96 per call on E8/P104 with N = ∅.The inequality holds only under the corrected premise PA_gen.Caveats
Validator:
python3.12 -B scripts/research_package.py --package research/p104-t-minus-one-laws→PASS_REGISTERED_RESEARCH_PACKAGE. The branch carries the two #7257 CI-prerequisite commits by Clear1nsight, cherry-picked with authorship kept.— DreamingOfClouds with Claude Opus 5.5 (Anthropic), via Claude Code
🤖 Generated with Claude Code