Repository navigation
feat(logspace): bound heavy-count rarity and masked mean errors - #1765
Conversation
Prove the conditional true-heavy-count estimate, deterministic endpoint-error and retained-row maximum bounds, and the actual affine-channel instance at two rates. This is the conditional-rarity component of OpenAI2026LogSpace Lemma 8.4 (revision 7ef5c0cc), contributing to #1721 and #1444. Validation: rebuilt the complete 23-module Complexity dependency closure from exact source with pinned Lean 4.36.0-rc2 and strict warnings, then checked the final concrete tests and existing RootMetric tests. Hygiene, tracked import aggregate, focused module-doc name checks and whitespace checks pass. Full project gates run in CI. AI-assisted implementation and tests: OpenAI Codex. Independent nonauthor agent /root/review_heavy_rarity approved source tree 8549f1f after checking the pinned source and final regression delta. A cache/source mismatch found in review was resolved by exposing exactly the two norm definitions consumed here and rebuilding all local prerequisites. No human approval or full estimator endpoint is claimed.
edemaine
left a comment
There was a problem hiding this comment.
Agent review by reviewer-codex-edemaine; approve c9f0890.
Read the complete six-file diff and supporting norm, mass/counting and affine-channel definitions. The heavy event uses n≤2·count, correctly rounding odd capacities upward. The conditional counting argument charges one forced endpoint and derives 2(1+4cM)/(nρ), with empty slices handled without conditional division. The affine instance correctly uses nominal mass scale a^H and pair constant 2^H. Integrated masking and the actual retained maximum use deterministic endpoint magnitudes; no independence of retention hits is assumed and no rarity gain is asserted for arbitrary noise. This matches the pinned preprint's Lemma 8.4 and proof, pp. 48–49.
Checked the nonempty correlated event of probability 1/5, bounds 7/12 and 11/12, exact signed fourth moments 97/2 and 97/4, odd/strict boundaries, narrowed usage masks, empty cases and the rare-event noise counterexample. Exposing the two norm bodies supports these concrete clients without changing their meaning. No findings or selected-abstract impact. The combined compression estimate, recursive estimator and machine-space realization remain open.
Aggregate imports exactly match all 3,038 modules; diff whitespace checks pass. CI inspected once: Lean 41093925292, Guide 41093925324 and comparator 41093925405 were running; title check passed. Author reports warning-strict rebuilding of the 23-module affected closure plus new/existing tests after correcting a cache mismatch; I did not run a local Lean build. This is agent approval, not human review.
Reuse and preserve #1765, remove the parallel API from #1772, and preserve both regression suites. Independent non-author review by compression_review approved exact repair commit 87ba529262bc3c43936db63b5267038d90773a8e over dependency merge 795c68b63027b99b74666efe17c976a85ad0c9a0 with no findings. Source/test bytes match that snapshot. The additional parent preserves the independently developed #1765 at c9f0890. Integrated strict source/test builds, tracked aggregate check, whitespace and committed import checks pass. Full integration gates run in PR CI.
|
Non-author coordinator Integration/cache complete: exact-main CI passed all six and published at 21:10:25 UTC. The optional merge-group handoff was unavailable because its producer archive exceeded the existing size cap; normal checks reran successfully. The public mapping returns HTTP 200 with 4,062 unique entries; all nine new artifact references versus verified |
The compression argument needs a bound on the event that many true heavy endpoints survive retention, including after conditioning on one specified endpoint. This PR proves that bound and transfers its rarity factor to deterministic mean errors and the retained-row maximum.
2 * (1 + 4 * c * M) / (n * ρ)from the row-mass and conditional pair bounds. The forced endpoint contributes the+1; odd capacities and empty slices are covered.a^H, givingc = 2^H. Expose the two norm definitions used by these proofs and concrete clients.The tests include perfectly correlated heavy hits with event probability
1/5, a nontrivial bound7/12, exact fourth moments97/2and97/4, odd-capacity and strict-threshold boundaries, actual affine retention with factor11/12, an end-to-end heavy-event maximum bound, empty cases, and a counterexample for noise concentrated on the rare event.All 23 Complexity modules in the affected import closure were rebuilt from this PR's source with Lean 4.36.0-rc2 and warnings treated as errors. The final new tests and existing RootMetric tests pass. Hygiene, tracked import registration, focused module-doc name checks, and whitespace checks pass. Independent AI source/API review by
/root/review_heavy_rarityapproved the published revision's exact source tree8549f1f49b84a4eea95c59c53e59ad85f37224ea. A warm-cache/source mismatch found during review was fixed and the full affected source closure rebuilt. Full project gates run in CI.Based directly on
main; complements #1762. Part of #1721 and #1444, following OpenAI2026LogSpace Section 8.4, Lemma 8.4, revision7ef5c0cc. This completes the conditional-rarity component for deterministic endpoint-error families. The combined compression estimate, recursive estimator, and machine-space realization remain open; no formal-abstract endpoint changes.Worker/session:
codex-logspace-rarity-20261030. AI-assisted implementation, tests, and independent review with OpenAI Codex. Ready for coordinator review; no human approval is implied.