Skip to content

P104 Lean package 3: conditional ceilings (.0204 for nested Priced words, class K .00602), word structure and duality, spec-break lemmas (no κ) - #7656

Open
DreamingOfClouds wants to merge 2 commits into
CrocSwap:mainfrom
DreamingOfClouds:research/p104-lean-premises
Open

DreamingOfClouds wants to merge 2 commits into
CrocSwap:mainfrom
DreamingOfClouds:research/p104-lean-premises

Conversation

@DreamingOfClouds

@DreamingOfClouds DreamingOfClouds commented Nov 17, 2026 •

Copy link
Copy Markdown
Contributor

Lean-only package, part 3 (combined). No κ claim.

Kernel-checked Lean (Lean 4.33.0-rc1, pinned Mathlib; propext, Classical.choice, Quot.sound only; no sorry, no native_decide) with named hypotheses, in four groups. The descriptions below were corrected after an independent review (CORRECTIONS.md); where a description and a Lean statement differ, the Lean statement is authoritative.

1. Premise narrowing for #7620 (the premises on which our #7623/#7630 κ is conditional). In a birth-free, endpoint-exact word every CLEAR is lossless, and the certificate checker is sound and complete for such words (ClearCert; the 180 real certificates are not replayed). In the pricing model every MOVE, owned or public, is charged |Δdim| in either direction and owned registers earn no credit; these are definitions, and OwnedAscent proves their consequences, including that relaxed-class floors imply strict-class floors. Exact rows are equivalent to all columns (NativeColumns). The MOVE pairs used by #7630 lie in #7623's used pairs plus the 981-pair census (kernel-checked inclusion of extracted lists), so all used pairs are correct if the census pairs and #7623's pairs are; both are inputs (CensusComplete). E1, E2 and E3 (flat, and tree under atomic calls with every child unit running the same word) hold for the owned skeleton extracted from #7630 (OwnedSkeleton, OwnedTree; the extraction is not verified). PREMISES.md lists per premise what is now a kernel fact and what is still assumed.

2. Ceilings. All are statements about the 17-call invoice of the #7113 caller C(8|9) unless stated otherwise.

  • Caller side: cost closed form and the Conditional κ = .00363797977 via a 17-stage signed caller #7113 caller invoice (CallerCost). κ ≤ .0419448764 for two-arm callers in InClass 4, conditional on the B-form hypothesis hB, the native floor hN and the numeric certificate NumCert (not kernel-checked; its tail step is unaudited). For the 2|2 split (t ≥ 141/4096) and the 1|1 split (t ≥ 176/4096) the numerics are kernel-checked; hB, hth and hN remain hypotheses (JointCeiling).
  • Whole word: κ ≤ .0204110965 for nested words satisfying Priced (WholeFloorNest.kappa_whole_floor_nested). Hypotheses: Priced w (Theorem Y h_Y; helper and main price floors h_help, h_main; owned pricing with ranks 1..9, owned mass ≤ 112 and at least 16 paid owned MOVEs) and the F-currency pricing link hF. Words with fewer than 16 paid owned MOVEs or owned mass above 112 are outside the statement. Nesting enters through the lateral count of a MOVE log (NestedWord); the pricing summary is not derived from a run. Slack-rank independence (Indep) is not a hypothesis of this theorem; it sits upstream of h_Y and is not linked. The numeric cover is discharged in the kernel (WholeFloorCover, NumCertK). The verifier's nesting rule is what rules out lateral owned MOVEs (see FALSE.md item 11).
  • κ ≤ .0060197405 for class K(S22) (FloorK22, NumCertK22): F(1−t) < 0 for t in [.0060197405, 1). Hypotheses: strictly monotone dim (hdim), membership in ClassK22 (a model-Accepted word with the kept data of S22, including the rank input rank_ge), and the cost-model link hF. No word, S22 included, is shown in Lean to lie in ClassK22.
  • κ ≤ .0183952347 and κ ≤ .0134769139 for the restricted class M_V (CongestionI3), the second with descent mass ≥ 56. M_V is not defined in Lean: MV, Rank8C56, PlaneSep (first ceiling) and Prov (second) are uninterpreted propositions that only guard the I3 hypothesis, so the class restriction rests on the reading of that hypothesis. Both theorems assume the junk count |J| ≥ 1936 directly; its derivation from the flag-DP minima (forced_junk_ge) is a separate theorem and is not invoked. Further hypotheses are listed in PROVED.md §F (native bound hF, Theorem Y, stop bound hst, per-pair minima, at least 16 paid owned MOVEs for the first; descent ranks and at least 8 owned rises for the second). No known native lies in M_V, so these bound the restricted class, not the native class.
  • Supporting: a dual certificate for an 892 × 18,868 LP checked by decide +kernel (FloorCert*; it reaches class-K words only through the hypothesis H2), descent pricing (DescentPrice), helper D0 ≥ 2 ln 2 per paid stay on accepted words with strictly monotone dim (FloorD0).

3. Word structure. Shadow (under main-table symmetry Sym, the twin has the same net histogram T − P, hence the same S, F, D0, κ), Annihilator (served ports ≤ descending owned rank, for a lineage whose Gram block over the served ports is an identity block), Delivery (net delivery needs two contacts with different courier rows; a courier with exactly three genuine hops whose climb is their sum costs ≥ f(3); direct-read capacity), DesignLaws, SharedCourier, PsiLaw, WordDuality (location-legal words map to location-legal words; the Theorem-K invoice and roots are unchanged for climbing registers; the X_p/Y_p boundary pattern, given as hypotheses, is self-dual), PlaneLaws (SPLIT for any n; t'' is a token only for odd n; QUARTER an exact partition for any n and block B containing 1; counts kernel-checked for one block of E7 only), with HubSettle, RankLaw, RankLawC, FrameSep.

4. Spec-break kills and small lemmas. The rank, Gram and involution lemmas behind the kill arguments (SpecTS, SpecGC, SpecRankP, SpecRankP2, SpecLemmaU, SpecLemmaU2, Spec6, PadLift, Spec0Sym, with SpecTSUR, SpecINV, CallerBorrow), LemmaW, and SmallRoots (kernel checks of three small-caller roots). Spec6's kill is conditional on three named hypotheses excluding the PL / ALLX / ALLY end cases. Spec0K0_ABCEDF_s0..s6 are PARTIAL: certificates for 60 of 68 targets of one class; 8 targets are not certified.

PROVED.md lists the theorems with their hypotheses. FALSE.md lists the statements Lean refuted or corrected, among them: the lateral-move floor (a counterexample, repaired by the nesting rule), the three-genuine-hop bound 3.30 (needs genuine hops), ONE-READ (needs descent), two span/obstruction statements, the "same invoice" claim for the twin (only the net is equal), a rounded recipe (off by 0.13), an arm-of-1 overcharge that withdrew an earlier ceiling, a false composition law for caller cost, and "COPY becomes ADD" under the duality (false as matrices). CHECK.txt has the compile table and axioms.

Not wired into any build or verifier (unregistered, like the other Lean packages). Not included: scripts, generators and source data; the generated Lean data files are included and their fidelity rests on reading.

The premises under study are SYLforge's (#7616, #7620); the caller is rohanarun's (#7113). DreamingOfClouds with Claude Opus 5.5 (Anthropic), via Claude Code.

🤖 Generated with Claude Code

DreamingOfClouds and others added 2 commits November 17, 2026 17:52
…ec-break lemmas (no κ)

Kernel-only Lean (propext, Classical.choice, Quot.sound; no sorry, no native_decide) with named hypotheses.
DreamingOfClouds with Claude Opus 5.5 (Anthropic), via Claude Code.

Co-Authored-By: Claude Opus 5.5 <noreply@anthropic.com>
PROVED.md, README.md and the PR body now state each theorem's exact Lean hypotheses and scope; CORRECTIONS.md lists every change. No Lean statement or proof changed; comments in six files edited (rounding 1,081.31 -> ~1,081.3096, internal labels removed) and rebuilt.
DreamingOfClouds with Claude Opus 5.5 (Anthropic), via Claude Code.

Co-Authored-By: Claude Opus 5.5 <noreply@anthropic.com>
@DreamingOfClouds DreamingOfClouds changed the title P104 Lean package 3: ceilings (all words .0204, class K .00602), word structure and duality, spec-break lemmas (no κ) P104 Lean package 3: conditional ceilings (.0204 for nested Priced words, class K .00602), word structure and duality, spec-break lemmas (no κ) Nov 18, 2026
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment

Labels

None yet

Projects

None yet

Development

Successfully merging this pull request may close these issues.

1 participant