Repository navigation
feat(logspace): iterate actual sentinel compression coupling - #1776
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.
Prove Finset.kthLargest_eq_of_eq_or_gt in the existing order-statistic module, preserving Christian Reitwiessner's credit. Values may change arbitrarily when both versions remain strictly above a nonnegative ceiling; if one positive-order rank is at most that ceiling, the actual ranks agree. The boundary rank = ceiling and zero padding are included. Define actual first-coordinate sentinel replacement, leaving every second coordinate unchanged. Derive equality of padded first ranks, size thresholds, and new defaults. The bounded modified rank implies marked cardinality < K. Under the explicit 3R separation, both channels of marked entries are in the compression identity region, and replacement commutes with the concrete update at every retained endpoint. No output equality is assumed. Source mapping for issue #1721: OpenAI2026LogSpace revision 7ef5c0cc, compression.tex Section 8.3, proof of Lemma 8.3, sentinel replacement and removal in the fewer-than-K large-entry case. This is the exact local rank/update argument, independent of the root exponent. Relative-error control through later increments, the iterated coupling, scalar upper saturation, heavy-count closure, and full post-overflow stability remain open. Sentinels are proof devices, not an algorithmic enumeration claim. No curated abstract or catalogue impact; no aggregate changes. Tests use [1000000,4,2,-1] with sentinel 100, K=n=3, positive old default 1/2, and floor 1. Rank and threshold equal the ceiling 2; smaller signed entries actually compress, while a marked second coordinate of -17 is preserved. Further cases exercise K above the retained cardinality and demonstrate why changing a value exactly at the ceiling can change the rank. Validation: KthLargest, Sentinel, and RowCompressionSentinel tests compile without diagnostics under Lean 4.36.0-rc2, warningAsError=true and project linter options, using isolated private outputs and shared dependencies read-only. Focused hygiene --check-simp and staged git diff --check pass. Full integration gates and independent exact-revision review are left to the coordinator. Base is reviewed Reference 10a5168; only these three files belong to this milestone. AI assistance: ChatGPT worker codex-logspace-polynomial-cutoffs-20261030 authored and validated the change. Independent non-author source/API review by agent derandomization_plan approved source revision 68a162675ea79cd7e6e29b0831c725d0dca9bbb2 with no findings. Integrated source and tests are byte-identical to that reviewed revision. Integrated strict source/test builds, tracked aggregate check, whitespace and committed import checks pass. Full integration gates run in PR CI.
For issue #1721, construct the modified initial state and increments: retain the common default, replace marked first entries by L, clear only marked first-channel increments, and retain all second-channel increments. Prove coupling of the actual original and modified iterates at every prefix. Their defaults agree, the modified full row is exactly the sentinel replacement of the original row, and both original marked coordinates equal their actual raw prefixes. The large-input condition is derived from cumulative raw absolute variation: 3R plus the full first-channel variation is below each marked initial first coordinate. Only the actual modified input ranks and step thresholds are assumed bounded by R. A post-update rank bound is used by the main result to prove exact padded-rank equality and the same ceiling after every positive prefix. No original compressed-input or final-output contract is assumed, and no bound depends on the largest original first coordinate. Source mapping: OpenAI2026LogSpace revision 7ef5c0cc, compression.tex Section 8.3, proof of Lemma 8.3, the induction removing the sentinel modification. Deriving the ceilings and variation bounds from clipped errors, scalar upper saturation, the heavy-count case, and the complete post-overflow estimate remain separate. Sentinels are analytical devices; this adds no enumeration or machine-resource certificate. No curated abstract impact and no aggregate changes. The test runs two actual groups with marked first increments -5,+7 and second increments +2,-3. It computes the modified intermediate states and both ceiling bounds, then applies the theorem to recover the original marked raw prefix (1000002,-18), common increased default 2, and final padded-rank equality. An unmarked raw first prefix -2 becomes compressed value 2, so the test exercises real compression as well as nonzero signed increments in both channels. Validation: both new files compile without diagnostics under Lean 4.36.0-rc2, warningAsError=true, and all project linter options, with private outputs and shared dependencies read-only. Focused hygiene --check-simp and staged git diff --check pass. Full integration gates and independent exact-revision review remain coordinator-owned. This commit adds only SentinelIteration and its tests atop reviewed Sentinel 68a16267, which is unchanged and preserved on its original branch. AI assistance: ChatGPT worker codex-logspace-polynomial-cutoffs-20261030 authored and validated the change. Independent non-author source/API review by agent lean_environment approved source revision 6626a870805138484aed78a8c97c1218e3c89899 with no findings. Review covered the actual-run induction, original total variation, modified-only ceilings, full-function equality, both signed coordinates, post-update ranks, and the nontrivial two-step test. Integrated source and tests are byte-identical to that reviewed revision. 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 review by reviewer-codex-edemaine of daa97e7: approve. Reviewed the complete layer over #1770, reusing its unchanged one-step rank/threshold coverage.
The actual-run induction is sound: total absolute first variation keeps every marked raw prefix above 3R; identity of compression there preserves both channels, while the modified ceilings give equal thresholds/defaults and full-row sentinel coupling. The new post-update rank lemma uses the actual update interval and padded-rank counting characterization, including rank equality at the ceiling. Positive K, K≤n at each step and nonnegative R are explicit. Checked the bounded mapping to the sentinel-removal induction in the pinned preprint's Lemma 8.3, p.47. Deriving ceilings/variation from relative errors, saturation and the full post-overflow theorem remain open.
The two-step example derives the original final (1000002,−18), rising common default and final-rank equality from the theorem; an unmarked raw −2 compresses to 2, so it exercises real compression. No findings or abstract impact. Aggregate imports and whitespace checks passed. Author reports warning-strict focused compilation; I did not run a local Lean build. At inspection title passed and Lean CI 41097443483 was running. 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 |
The local sentinel lemma must survive every later compression step. This constructs the two actual runs, replacing marked initial first coordinates by a sentinel and clearing only their first-channel increments. A bound on total original first-channel variation and the modified run’s input ranks/thresholds proves equal defaults, exact full-row sentinel coupling, and preservation of both original marked coordinates along their raw prefixes. It also proves that the actual padded first ranks agree and stay below the ceiling after every positive prefix.
Prerequisite #1770 has landed. This PR now targets main and advances #1721 and #1444 through the removal induction of the pinned source’s Lemma 8.3. The two-step test uses signed first increments −5,+7 and second increments +2,−3, recovers the marked final entry (1000002,−18), raises the common default from 1/2 to 2, and shows an unmarked raw prefix −2 being compressed to 2. Deriving the modified ceilings and variation from clipped errors, proving upper saturation, and the full post-overflow estimate remain open.
Validation and independent agent review are recorded in this revision. Strict direct Lean checks passed for the new module and behavioral tests, with warningAsError=true and project linters; tracked aggregate, committed imports, and whitespace checks passed. Lean CI passed for this published revision. AI assistance: ChatGPT authored the proofs and tests, performed independent agent review, and integrated the change.
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.