Repository navigation
Prove a line-born erasure cannot leave two unpaid coordinates - #95
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 surviving-birth count and the naive endpoint intersection are both at most the birth dimension, so the selected one-dimensional C_q line never becomes a plane port by a non-nested rewrite. 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 obstruction. No new κ. The selected conditional exponent stays
605457647/200000000000(0.003027288235).A one-dimensional birth cannot leave two unpaid coordinates under a non-nested erasure and rewrite. For any finite sequence of subspaces
A_0, ..., A_t, bothdim(A_0 ∩ ... ∩ A_t)anddim(A_0 ∩ A_t)are at mostdim(A_0). The selectedC_qline therefore never becomes a plane port by rewriting a cleared direction.On
F_2^73the explicit schedule⟨e_0⟩, then⟨e_1⟩, then the whole space has surviving-birth count 0, naive endpoint intersection 1, and dimension charge2 + 72 = 74. The nested climb⟨e_0⟩ → F_2^73still pays 72 and keeps unpaid count 1. That is the72Wterm of the coverage identity. A plane birth⟨e_0, e_1⟩does keep unpaid count 2; that is the separate plane-port contract and is not repriced.rank(A, B) = dim(A+B) - dim(A∩B)agrees with the nested Fourier-rank sentence whenA ⊆ B. Off that hypothesis it is only the dimension charge used in the paid-rank induction. A cheaper physical step would be a different acquisition cost. It still could not raise either intersection above the birth dimension.This is a finite certificate of that ledger plus the general induction in
PROOF.md. It is not a Clifford replay, a compiler theorem for non-nested steps, or a multiplication theorem.Task and overlap
Base:
32890bc5de034ab8fc93ac88ead7279a6a416d04(upstreamCrocSwap/integer-mult-boundsmain). Priority revision 7. Cardcoverage-law-change, scope refined.Ordered eligible list for session r45, item 13. Order: the priority table in
docs/research/current-priorities.md, then catalogue tasks that are not already in that table. A row stays while revision 7 still states its next decision as open. Work this account already delivered is not repeated; a later row may still be taken when the piece is distinct.uniform-transfer-auditsupplier-boundary-auditjoint-query-controllerr437-carrier-integrationp104-side-correctionindependent-momentformal-interface-lemmabit-helper-contractbit-new-register-modelcomplex-rank-shape-decodercomplex-new-helper-inventorycentre-path-sharingcoverage-law-changeThe nested third-bank cycle on this card is merged
research/three-bank-restored-unpaid(upstream CrocSwap#4164). Its open question 1 asks whether a non-nested erasure can leave two unpaid coordinates without becoming a plane port. This package answers that question. It does not rerun the nested frames, the excursion ceilings, orresearch/plane-port-copy-budgets.No open PR states this surviving-birth bound. Fork branch
cursor/three-bank-unpaid-obstruction-cc55is the nested predecessor, not this erasure.Validation
Python 3.12, standard library only, from the repository root:
Observed:
verify.pychecks 4,096 length-3 histories onF_2^3, 67,335 line-born length-3 histories onF_2^4, the step lemma (1,056 and 34,371 instances), the explicit width-73 erasure, and 400 random length-6 histories onF_2^8. An optimized rerun passed. The induction is inPROOF.md. Not run: Clifford phase replay, the 946 local frames, a native tape, Lean, or Docker.Credit
The erasure question is open question 1 of
research/three-bank-restored-unpaid. The nested Fourier-rank sentence andm = 73areresearch/split-centres-global/proofs/INHERITED-COMPLEX-GEOMETRY.txt. The third-bank question was left by themilkman216 inresearch/multipair-schedule-bound. Plane-port budgets are not recomputed.Prepared by unpaidmoon with substantial Cursor Grok assistance. Apache-2.0. No independent human review or proof-assistant acceptance is claimed.
Open next questions
dim(A+B) - dim(A∩B)? The unpaid bound does not need that formula. The paid-rank lower bound does. First step: compare one of the geometry note's 3,120 used transitions with this dimension count. Blocked becauseclifford_exact.pyis not replayed here.605457647/200000000000. Blocked because that package pins an older selected record, and this package does not reprice ceilings.Workflow feedback (optional)
The merged third-bank README already named the erasure question with a first step and a blocker. Answering that question was a smaller and more reviewable piece than reopening the two-unpaid lever.