Repository navigation
Research consolidation: rational support descent for fixed-reader single lifts (no new kappa) - #1133
Merged
Mister-Meeseeks merged 2 commits intoOct 14, 2026
Conversation
Contributor
|
100-PR batch review at Merged to Reviewed scope: Support-preserving reciprocal-projection descent over any infinite base field, with a finite-field counterexample; only fixed-reader single-lift support costs are preserved. The pinned scoped command passed; the batch ledger contains its command, input hashes, environment and log. This incorporates the research/tooling contribution and does not change the selected κ or discharge the inherited multiplication-theorem assumptions. Batch review, attribution and evidence. Thank you for the contribution. |
thakrarsagar
deleted the
research/cycle06-seed95-rational-lift-descent
branch
October 14, 2026 19:57
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
For a rational matrix X, every complex fixed-reader single lift has a rational representative with identical support pairs in all rank-one terms. This extends @woklerx's #998 reciprocal-projection argument from complex-to-real descent to every infinite base field. The proof uses a linear functional on a finite span, avoiding finitely many polynomial roots. A 1 by 1 F4-to-F2 counterexample identifies a genuine boundary of the statement.
The P112 consequence is equality of the attainable ordered nine-term support-cost vectors over Q, R and C. Mihir Srivastava's #845 floor 64 remains inherited. There is no new kappa, physical supplier, coefficient-height bound, terminating rational search, or efficiency-preserving compiler claim. The proof allows arbitrary complex inputs, while the exact implementation demonstrates inputs with supplied quadratic-field coordinates. This differs from #998's already-effective Gaussian rational examples and #1098's Gram spectra.
Nine new files live only in
research/rational-lift-descent-seed95/. Base:ba82555c64e1879e4b7decce28186f208fcb8262.SOURCES.jsonpins six predecessor files and records the historical selected context. The six dependencies are unchanged at refreshed maince7ad1b6ab09452c3478723a2e96ed5ff212dc08. Existing sources,upstream/and the selected frontier are unchanged. Seed 95 selected research consolidation; the local claim records the alternatives and overlap checks.Credit: @woklerx for reciprocal support transfer, @mihir-s-05 for the real obstruction, DreamingOfClouds for P112 geometry and the copy interpretation, and GamingPuzzled / Joel Pulikkan for the coordinate cost. New work is Apache-2.0 with substantial OpenAI Codex assistance, disclosed in
NOTICE.md. No independent human or proof-assistant review is claimed.Validation
1d4cd17ba4970a62624d378c402422c074e5d5dcc73a3700df10077bc618f0d7.The predecessor's full support census, full
make verify, selected-supplier cold replay, Linux and formalization were not run. The inherited physical and analytic assumptions remain. Search coverage and stopping rules are explicit in the package; no previous decoder search was repeated.