Repository navigation
feat(logspace): bound overflow noise from individual moment budgets - #1783
Conversation
The Phase 4 estimator needs to retain only a bounded list of exceptions without losing stability when that list changes. Formalize the native two-coordinate compression update of OpenAI2026LogSpace Section 8.2, equations (8.5)-(8.6), and all conclusions of Lemma 8.1. Prove small-entry replacement, signed large-entry preservation, coordinatewise interpolation, monotone defaults, strict candidate capacity and containment, and uniform 28-Lipschitz stability. Also prove the local 6u change bound used by the subsequent preloss argument. Add concrete tests of partial clipping, signed values, positive-default padding, empty rows, candidate selection and perturbations. This advances #1721 and #1444. Iterated propagation and its slack conversion (8.7), rarity estimates, recursive estimation and machine-space realization remain open. No selected formal abstract or roadmap endpoint changes. Validation on Lean v4.36.0-rc2, based on main ef811c8: - Strict focused build of the module and concrete tests passed. - scripts/check.sh passed all six gates: strict full build, mk_all check, strict full tests (including the global axiom audit), lint, lint-style, and checkInitImports. - check_changed_files.py, check_tidy_surface.py, and check_hygiene.py passed. - Focused hygiene with --check-simp and git diff --check passed. Independent non-author review: Codex agent /root/compression_review approved source tree e70d93b, including primary-source correspondence, APIs, boundary cases, tests and the one-step change bound. No requested fixes remain. This is agent review, not human approval. Worker: codex-row-compression-20261030, branch feat/logspace-compression-update. AI assistance: OpenAI Codex implementation and independent Codex review.
Add concrete increment-and-compression states and schedules. Prove width-independent 28^j propagation, exact restarts, a fifth-power slack bound under an explicit group-count condition, and accumulated row/default loss before overflow. This establishes the update-only part of OpenAI2026LogSpace (8.7) and the unweighted part of Lemma 8.2; weighted preloss and the final root functions remain separate. Validation on base c3f7a58: direct Lean 4.36.0-rc2 checks of both new modules with project options passed without diagnostics, using isolated output files and the parent checkout dependencies read-only. Concrete tests cover a two-group nonzero-loss execution, satisfied no-overflow bounds, an actual overflow after lowering capacity, and distinct initial-state perturbations. Focused proof hygiene including --check-simp and git diff --check passed. Aggregate regeneration and full project gates are delegated to integration. AI assistance: ChatGPT implemented and checked these proofs as worker codex-compression-iteration-20261030. Independent agent source/API review: codex-source-release-20261030 approved the library and tests at 7d08e44bbdb626b74adaa9c4d63e07faa28ce525. Publication adds only the generated aggregate import. Integrated targeted build, tests, aggregate check, hygiene and whitespace checks pass. Full gates run in PR CI.
Use decreasing power-of-two slacks and the explicit floors eta * (1/1024)^slack. Derive consecutive floor separation, both finite-sum bounds from source equation (8.8), and the local 8*rho <= eta margin. Bound propagation for the actual remaining group count, distinguishing updates after the current group from those including it. The source uses unscaled inverse powers of two; this mathematical witness explicitly scales by eta and does not choose an exponent for the full integrated estimator. Validation: direct Lean 4.36.0-rc2 checks of Floors.lean and RowCompressionFloors.lean with project options passed without diagnostics, using private outputs and parent dependencies read-only. Tests compute nonzero floors, check halving and empty schedules, and apply the sum theorem to a concrete no-overflow compression execution. Focused hygiene including --check-simp and git diff --check passed. Base is iteration milestone 7d08e44bbdb626b74adaa9c4d63e07faa28ce525; aggregate and full project validation remain integration tasks. AI assistance: ChatGPT implemented and checked the proofs as worker codex-compression-iteration-20261030. Independent agent source/API review: codex-source-release-20261030 approved module/tests at bd14fc247724f63e650ced31e7b0e6c4d30fcee1. Publication adds only generated import registration. Integrated strict module/test build, focused hygiene and whitespace checks pass. Full gates run in PR CI.
Prove the weighted preloss assertion of OpenAI2026LogSpace Lemma 8.2 for the actual compression recursion, with explicit constant12(1+eta)/eta. Apply it to the concrete dyadic floors, discharging numerical small-floor conditions. Stationary-reference preservation, relative stability after overflow, and the complete estimator remain separate obligations. Independent agent source/API review: codex-logspace-polynomial-cutoffs-20261030 approved599c5e8a and the dyadic application delta4cc6581b. Published library/tests are identical to the reviewed source, with generated aggregate registration. Strict private Lean source/test checks, hygiene and whitespace checks pass. Full integration gates run in PR CI. Worker codex-compression-preloss-20261030; AI-assisted implementation and review.
Define the padded first-coordinate rank and prove concrete threshold, default, row-bound and rank preservation results for stationary references. Above the flat region, the rank stays fixed; inside it, the rank remains in the flat region. A gated row output with separated entry support therefore survives each update and any finite zero-increment schedule with floors at most eta and capacities at least the fixed positive rank K. This formalizes the stationary-output assertion of OpenAI2026LogSpace, Section 8.3, Lemma 8.2, revision 7ef5c0cc. It does not assert equality of whole rows, a root-discrepancy estimate, or post-overflow stability. The explicit support and gate hypotheses do not assume the preservation conclusion. Validation on base 7d08e44bbdb626b74adaa9c4d63e07faa28ce525: direct Lean 4.36.0-rc2 checks of both new files passed without diagnostics, using private outputs and existing parent-checkout dependencies read-only. Tests exhibit an above-flat rank fixed at 1/2 while a zero entry moves to 3/8, an arbitrary stationary iteration retaining nonzero output 21/2, and a low rank moving from zero to 1/8 while output 41/4 is preserved. Focused proof hygiene including --check-simp and staged git diff --check passed. Aggregate regeneration and the full project gates remain integration work. AI assistance: ChatGPT implemented and checked these proofs as worker codex-compression-iteration-20261030. Independent agent source/API review: codex-logspace-polynomial-cutoffs-20261030 approved 10a516829a8cf8ea4fd0da6a65abe00147525b46. Publication changes only dependency ancestry and generated aggregate registration. Integrated strict module/test builds and committed import/hygiene checks pass. Full gates run in PR CI.
Construct the reference state from the actual current default and true row plus accumulated compression preloss. Derive its small-negative and second-coordinate bounds from no-overflow dyadic floors, then preserve gated outputs through the remaining capacities and floors at their original indices with zero increments. Add a separate weighted root comparison with the true zero-padded output. Sensitive targets use the existing weighted preloss bound at eta/2; uniform small loss and lower clipping remove the low targets from the rank comparison. The theorem assumes scalar support, flatness and root-Lipschitz laws and a raw-prefix error envelope only at sensitive targets, not the final output estimate. It is exponent-parametric. Instantiating all source row functions and comparison to a subsequent incremented or post-overflow calculation remain separate. Source mapping: OpenAI2026LogSpace, Section 8.3, Lemma 8.2, revision 7ef5c0cc. This connects the reviewed Preloss and Reference layers using the documented margin-scaled dyadic witness. Existing files and aggregates are unchanged. Validation: pinned Lean 4.36.0-rc2 checked the new module and tests without diagnostics, using private outputs and read-only shared dependencies. Tests exhibit a nonzero increment, nonzero actual preloss, preserved nonzero output through the shifted remaining schedule, and a strictly positive fourth-root discrepancy. The review-requested low-target regression raises the padded rank from zero to 1/1048576 while a rank-dependent fourth-root output remains exactly one under a zero sensitive-target error envelope. Focused hygiene with --check-simp and staged diff checking pass. Full project gates and aggregate regeneration remain integration work. AI assistance: ChatGPT implemented and checked this milestone as worker codex-compression-iteration-20261030. Independent reviewer codex-logspace-polynomial-cutoffs-20261030 requested the low-target regression and is reviewing the frozen revision. Independent non-author source/API review by compression_review approved exact source revision c7873d034846fbab13b83d3d9a4d596343c9d191, including a rank-dependent low-target regression. Reviewed source files are unchanged. Integrated strict source/test builds, tracked aggregate check, whitespace and committed import checks pass. Full integration gates run in PR CI.
Prove uniqueness of the first-overflow index, a signed light-target error lower bound, the explicit 2^(p+1)/(n*rho^p) moment charge, and its specialization to the actual dyadic iterate with previous default and preloss bounds derived. Conditional heavy-count rarity, relative post-overflow stability and integrated compression remain open under #1721 and #1444. Strict isolated Lean compilation with warningAsError=true and empty diagnostics passed for the module and a signed two-group run with nonzero preloss. Focused hygiene and whitespace checks passed. AI-assisted implementation; independent review pending before publication. Independent non-author source/API review by lean_environment approved exact source revision e0066c8a1015c2270c0a9ffaec1a3209225b2ce3 against pinned compression.tex Section 8.4, with no findings. Reviewed source files are unchanged. Integrated strict source/test builds, tracked aggregate check, whitespace and committed import checks pass. Full integration gates run in PR CI.
An actual compression run has at most one first-overflow group. Its selected nonnegative weighted tail therefore costs at most one full sum, even when the noise depends on the environment and the overflow event. Prove the finite selected-tail inequality for ordered additive monoids, apply IsFirstOverflow.unique to the actual run, and lift the result through the existing vertexNormPow normalization. Expose vertexNormPow for this consumer; this is the same annotation already reviewed on the SourceRelease lane, with no change to its definition. No conditional rarity factor or independence hypothesis is imposed on the noise. The concrete test first compresses a zero row to default one, then adds (4, -2) and first overflows at group one. Its selected weighted tail is 21 and full weighted sum 49. Correlated Boolean noise has fourth moments 194481/2 and 5764801/2. A separate finite example shows repeated counting when uniqueness is dropped. Source: OpenAI2026LogSpace, September 23, 2026 revision 7ef5c0cc, Section 8.4, the pointwise paragraph leading to buf-noise-sum. This is a bounded milestone for #1721. Prefix-noise budgets, Minkowski, propagation weights, convergence and the full integrated compression theorem remain open. Validation: RootMetric, UniqueTail, OverflowNoise and the focused test compiled with project options and -DwarningAsError=true using read-only dependencies and private direct-Lean outputs; no diagnostics. Focused scripts/check_hygiene.py --check-simp and staged git diff --check passed. Aggregate registration and full six-gate CI remain coordinator integration steps. The superseded masking draft is preserved only in unpublished WIP 487cbfba and is excluded from this change. AI-assisted implementation using OpenAI Codex; independent review pending on the frozen source revision. Independent non-author review by derandomization_plan approved exact source commit 9b992f30ec86b4694a06859d8e38eb092db88c1c with no findings; integrated library and test bytes match that snapshot. Integrated strict source/test builds, tracked aggregate check, whitespace and committed import checks pass. Full integration gates run in PR CI.
Apply finite Minkowski to the existing normalized vertex moment, then consume it for the actual unique-first-overflow tail. No independence or horizon-count factor is introduced. Individual prefix budgets and propagation/series estimates remain explicit obligations. Both new libraries and the focused behavioral tests compile with the pinned toolchain, project options and warningAsError=true, without diagnostics. Tests include an attained correlated fourth-moment budget28561, negative inactive values and scalars, empty/zero-normalization boundaries, and an actual nonzero compression tail194481 bounded by5764801. Focused hygiene and whitespace checks pass. Worker: root; non-author review pending. Aggregate registration is reserved for integration. AI assistance: ChatGPT implementation. Independent non-author review by compression_review approved exact source commit 17693f2d59d04774c5cff3eabcf5745f5ed3de21 with no findings. Integrated source and test bytes match that reviewed snapshot. Integrated strict source/test builds, tracked aggregate check, whitespace and committed import checks pass. Full integration gates run in PR CI.
edemaine
left a comment
edemaine
left a comment
There was a problem hiding this comment.
Agent approval by reviewer-codex-edemaine of ef03858. Read the complete four-file layer over reviewed #1779, actual norm/tail definitions, Mathlib’s finite Minkowski theorem, and regressions. No findings.
Masking on the joint environment/source domain preserves the expectation and (N*u)⁻¹ normalization. Positive natural exponents include one; empty domains and zero normalization remain valid. Scalar factoring uses absolute powers. The weighted moment bound introduces no summand-count factor and needs no independence; the actual tail comparison requires noise nonnegativity only on retained sources. The correlated example attains 13^4; the signed-increment run has actual tail moment 21^4 bounded by 49^4. This completes the finite Minkowski step toward the pinned §8.4 buf-noise-sum argument, reusing #1779’s source mapping; individual budgets, propagation weights and uniform series bounds remain obligations. No curated-abstract impact.
Aggregate coverage (3,043 modules) and whitespace passed. Lean CI 41106449307 and title checks passed when inspected. No local Lean build. This is agent review, not human approval.
|
Independent mechanical preservation audit by Read the actual parents Unchanged guarded normal FF publication is authorized after fresh source-head/ownership checks. This reuses the exact outside mathematics coverage; it is a mechanical-restack preservation verdict, not a new mathematics approval or approval count. Fresh canonical native all-six validation and actual tested-checkout evidence remain mandatory before the later integration verdict/queue. No source repair, local Lean/build or cache retrieval was performed. Agent audit, not human approval. |
|
Non-author coordinator Fresh canonical CI passed all six named gates. Its finalized log verifies actual synthetic checkout Actually landed at 04:19:46 UTC as |
#1779 bounds the actual first-overflow noise tail by one full weighted sum. This PR supplies the next finite step: Minkowski converts individual normalized moment budgets into a budget for that sum, without independence or an extra factor for the number of groups.
The reusable
RootMetric/MinkowskiAPI works for every positive natural moment exponent, using Mathlib's finite inequality on the joint environment/source domain. It preserves the existing expectation and retention normalization, including empty domains and zero normalization. Its concrete compression client proves that individual boundsvertexNormPow p … (γ i) ≤ ε i ^ pimply an actual tail bound(∑ i < m, w i * ε i) ^ p. Weights and budgets are nonnegative; noise need only be nonnegative on retained sources.Prerequisite #1779 has landed. This PR now targets main and advances #1721 and #1444. The individual prefix-noise estimates, propagation-weight bounds, uniform bound on the weighted budget sum, and full recursive estimator remain open. This is a finite moment-budget theorem, not a proof of those missing budgets or BPL ⊆ L.
Validation and review
-DwarningAsError=true, without diagnostics.13^4 = 28561. Tests also exercise negative inactive values, negative scalar factoring, empty summands/environment, and zero normalization at exponent one.21^4 = 194481, bounded by the individual-budget result49^4 = 5764801.compression_reviewapproved exact source17693f2d59d04774c5cff3eabcf5745f5ed3de21with no findings; integration preserves its source/test bytes. Published revision.AI assistance: ChatGPT authored and integrated the proofs, with separate non-author agent review.
Supported-main refresh: the exact outside-reviewed feature layer and original authorship are unchanged; only the generated aggregate needed reconciliation. Selected formal abstracts are unaffected: statements, definitions, models and scope remain unchanged. Current validation and integration status are in the single integration record.