Repository navigation
Consolidated root theorem for P104: chain-nested optimality with rigidity, the cost formula, dense supports and the one-extra-unit floor, under an explicit hypothesis ledger (no κ) - #6877
Open
DreamingOfClouds wants to merge 1 commit into
Open
DreamingOfClouds wants to merge 1 commit into
DreamingOfClouds wants to merge 1 commit into
Conversation
…orts, extra-unit floor, with an explicit hypothesis ledger (no κ) Co-Authored-By: Claude Opus 5.5 <noreply@anthropic.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.
Claim. Research package
research/p104-consolidated-root-theorem(builds on #6868, the chain-nested root of #6833). Under a stated model and an explicit hypothesis ledger,chain(9|9)minimisesD_root = f(8L+1) + sum[f(8|M|+1) - sum f(8r)](f = x ln x,1418.8458829per port atL = 18) among shortest roots. Included: DieudonneN >= n+1with a direct rigidity proof (no Katz theorem; char != 2 automatic overZ[1/2][i]); star optimality forN = 2..1199; the block-partition S identity (all 384 partitions of 18, best -4.8%); the cost formula derived from the #6833 invoice to 1e-40 (exact kernel rescalesD_rootby -0.78%, optimiser unchanged); dense x and y (exactL <= 8, allLfor single-host fields); roots with one extra unit (floor 1276.0 against break-even 1120.2, under R1-R4); D-free bases as a verifier convention with D-jobs priced. No kappa claim, no word.Scope (open assumptions and items).
D_konce and affine;[P_k, U_k] = 0andx_k, y_kinsideM_kin the site frame; liveness R4; D-free bases (verifier convention); the whole-job/compiler contract behind the cost formula; quoted constants (S = 760, native total).L = 2(no twisted root below 90.854 against 87.7147; twisted sites with|S| = 2do not exist, Groebner basis{1}over Q); open forL >= 4.L >= 10: proved only for single-host fields (all L) and exact up toL = 8.e >= 2extra units, ande = 1with R2/R3 dropped; thee = 1floor needs R1-R4.How to verify.
python3.12 -I -B research/p104-consolidated-root-theorem/check.py(about 25 s, standard library only; printsPASS_P104_CONSOLIDATED_ROOT_THEOREM;--twistedadds two Groebner decisions, needs Singular). Registered check:python3.12 -B scripts/research_package.py --package research/p104-consolidated-root-theoremprintsPASS_REGISTERED_RESEARCH_PACKAGE.Prepared by DreamingOfClouds with Claude Opus 5.5 (Anthropic), via Claude Code.
🤖 Generated with Claude Code