Skip to content

feat(logspace): prove polynomial stability after first overflow - #1792

Merged
SamuelSchlesinger merged 23 commits into
mainfrom
feat/logspace-polynomial-relative
Oct 31, 2026
Merged

SamuelSchlesinger merged 23 commits into
mainfrom
feat/logspace-polynomial-relative

Conversation

@SamuelSchlesinger

@SamuelSchlesinger SamuelSchlesinger commented Oct 30, 2026 •

Copy link
Copy Markdown
Collaborator

The actual preparation, auxiliary-score and witness rows now satisfy the fourth-root relative-stability comparison after first overflow. The local theorem covers both heavy-count branches and every nonnegative error budget: sentinel coupling and saturation handle few large true entries, persistent padded-rank closure handles at least K, and the proved output range handles large budgets. Its coefficient is independent of horizon, retained width, capacities, compression scale and entry magnitudes, under the stated truth-shape, margin and capacity conditions.

exists_firstOverflow_root_bound restarts at the already-added input of the actual overflow group j and bounds the final actual-to-reference discrepancy by Ctail * ∑ i∈[j,m), 28^(m-i)*ε_i. It requires clipped raw-input errors only from j onward; no preceding-prefix error, final-output bound, count branch or small-budget premise is assumed. The actual-to-truth corollary adds Cpre * ∑ i<j, ρ_i*ε_i, fixing Ctail before the compression scale. The proof constructs Ctail as four times (8+2A)*(256θ+273), where A is supplied by the existing concrete scalar fourth-root bound.

The shared root-error API moves unchanged to its natural module, and the existing quantitative sentinel comparison is factored once while preserving the coupling and false-overflow contracts. Both prerequisites #1790 and #1785 have landed. This PR now targets main, preserving both original dependency histories. Its own change remains nine source/test files plus aggregate imports; inherited RootMetric, workflow, configuration, bibliography and prerequisite entries are retained from actual main. Advances #1721 and #1444 through the concrete-family counterpart of the pinned source's Section 8.3. The manuscript uses eighth moments; this project uses fourth moments. No selected abstract or roadmap endpoint changes are warranted. The no-overflow output comparison, integrated compression, normalized atoms, recursive estimator and native space realization remain open.

Validation and review

All seven affected libraries and four regression clients pass strict direct Lean with project options and warnings as errors, without diagnostics. Tests include strictly positive output error at an actual first overflow, signed-channel erasure and default change, a large preceding-prefix error excluded from the tail premises, retained-rank gate closure while the default stays small, persistent closure after a negative increment, and the large-budget fallback. A second actual run has first overflow at j=1, zero tail error, and strictly positive actual-to-truth error paid entirely by nonzero weighted preloss.

Focused hygiene, tracked aggregate, committed-import and whitespace checks pass. Full Lean CI passed for the published revision. Independent non-author agent polynomial_false_review approved exact source 7444578a09fb113ecc5d05def8fa19d92322510a with no substantive findings; one module-documentation omission was corrected. Integration preserves the reviewed source/test bytes. Published revision.

AI assistance: ChatGPT worker polynomial_false_finish implemented the concrete comparisons, with overflow_restart supplying the generic restart/budget helper; separate agents reviewed and integrated the change. Only the pinned paper text was used, not OAI Lean code.

Supported-main refresh: three add/add conflicts caused by squashed parent history were resolved to the exact reviewed child bytes only after verifying that actual main matches the original reviewed parent entries. The complete original joint-parent patches and all unrelated main entries are preserved; no new proof or API text was authored. Selected formal abstracts and their scope are unaffected. Current validation and integration status are in the single integration record.

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.
Supply a computable rational degree-seven transition and its rescaling, with
real endpoint, monotonicity, and value/complement fourth-root Lipschitz laws.
Exact rational cast lemmas connect the arithmetic definitions to the real
analysis. Concrete tests cover interior values, affine rescaling, clamping,
equal endpoints, and root perturbations across both transition boundaries.

This advances issue #1721's fourth-moment route. The pinned primary source
OpenAI2026LogSpace, atoms.tex Section 5.1 at revision 7ef5c0cc, uses the same
normalized-integral construction with s = 8. This implementation specializes
it to s = 4 and does not claim eighth-root regularity, complete hierarchy
admissibility, or machine resource bounds. No OpenAI Lean was consulted.

Validation on base 2d1638c with the two added files: both modules compile
under the repository's Lean options with warnings as errors using isolated
temporary outputs and read-only existing dependencies; focused
check_hygiene.py --check-simp and git diff --cached --check pass. The final
documentation-only wording change was inspected after those builds. Full
repository integration gates and independent review remain for coordinator
integration; no aggregate file has been edited.

Authored by worker codex-logspace-polynomial-cutoffs-20261030 with ChatGPT.

Independent agent source/API review: codex-compression-iteration-20261030 approved source a6967d13aafee47ae16b61ac2b12f533426f9971 and freshly compiled both files. Publication adds only the generated aggregate import. Integrated strict module/test builds, hygiene and whitespace checks pass. Full gates run in PR CI.
Remove three aggregate imports that came from untracked source copies during integration. The polynomial switch module and tests are unchanged. Validate import targets against the committed Git tree before publication.
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.
Use Q(t) = a*u^4/(1+u)^3 with u = max(0,(t-theta)/a). For a>0,
prove nonnegativity, the upper ramp bound, lower defect theta+3*a,
monotonicity, and global Lipschitz constant one. The fourth root is
globally Lipschitz with explicit constant |a^(1/4)|*|a^-1|; the proof
also bounds its derivative at arbitrarily large positive inputs.
Definitions use exact rational arithmetic and have real cast lemmas.

This is an alternative rational witness for the correction-ramp conditions
of OpenAI2026LogSpace Section 4.1 at revision 7ef5c0cc, adapted to issue
#1721's fourth-moment route. The primary source uses eighth roots. Full
hierarchy threshold/cutoff instantiation is a separate next component;
no machine resource bound is asserted and no OpenAI Lean was consulted.

Validation atop a6967d13: the module and focused tests compile with the
repository Lean options and warnings as errors, using private temporary
outputs and read-only existing dependencies. Tests cover exact rational
values, negative and large inputs, real cast compatibility, uniform ramp
bounds, ordinary perturbation, and the explicit fourth-root Lipschitz
constant 8 when a=1/16. Focused hygiene --check-simp and diffcheck pass.
Independent review and full integration gates remain for the coordinator.

Authored by worker codex-logspace-polynomial-cutoffs-20261030 with ChatGPT.

Independent agent source/API review: codex-source-release-20261030 approved d3d62d9ff7fe1e54fabbf8b3ce779f929736f6ba. Publication preserves source/tests and adds generated import registration. Integrated strict module/test builds and hygiene/committed import checks pass. Full gates run in PR CI.
Extend HierarchyParams with the strict core threshold ladder, a positive
iteration count, strict copy-count inequality, monotone bounded cutoffs,
row-gate closure, and root/complement regularity. Prove the strengthened
bundle nonempty using an actual rational ramp and polynomial cutoffs.
The construction chooses theta = 1/(128q), width 1/(384q), theta2 = 1/(64q),
copy thresholds 1/(8q) and 1/(4q), then the factorial-tail iteration count,
copies, and detector ranks in the primary source's dependency order.

This advances #1721's fourth-moment hierarchy gap. It is an explicit s=4
adaptation of OpenAI2026LogSpace Sections 4.1-4.4 and Remark 4.6 at pinned
revision 7ef5c0cc; the source uses s=8. It does not prove eighth-root
regularity, every later atom/access-score margin, a recursive estimator,
or a machine-space bound. Existing HierarchyParams APIs are unchanged.

Validation atop d3d62d9f: new module and focused tests compile with pinned
Lean and repository options, warnings as errors, using private outputs
and read-only dependencies. Tests extract actual witnesses at q=2, prove
nonzero ramp and exact plateau values, use row-root perturbation at its
closed endpoint, and feed the underlying parameters into the existing
stage API for a nonzero two-vertex matrix. Focused hygiene --check-simp
and diffcheck pass. No aggregate or existing source file was modified.
Independent review and full integration gates remain for the coordinator.

Authored by worker codex-logspace-polynomial-cutoffs-20261030 with ChatGPT.

Independent agent source/API review: codex-compression-iteration-20261030 approved c7ac6dea11574e721ded46aeb0f76c2ccaf79df9 and independently compiled both files. Publication preserves the reviewed source/tests and adds only generated import registration.
Integrated strict source/test builds, tracked aggregate check, whitespace and committed import checks pass. Full integration 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.
Define actual rational polynomial preparation, row-gate, auxiliary-score
and broad-witness functions. Prove their range and closed threshold
laws, flat rank regions, incoming-score compatibility, joint Lipschitz
fourth roots, and exact rational-cast identities. Preserve the existing
exponential AtomCutoffs API and Christian Reitwiessner's source credit.

This is the fourth-moment adaptation for #1721 of the threshold template
in OpenAI2026LogSpace (5.5), and the witness in the support-margin proof
and compression-threshold table of Section 5.5, revision 7ef5c0cc.
The source uses eighth roots; these degree-seven cutoffs only establish
fourth-root regularity. The actual functions are proved regular, rather
than an assumed regularity bundle. Normalized main outputs, access
enumeration and machine-resource bounds remain separate.

Validation: the new module and full focused test file compile without
diagnostics with Lean 4.36.0-rc2 and repository strict options, using
private outputs and read-only dependencies. Executable rational tests
evaluate all three row functions to 1/4 with both switches in their
transition regions. Further tests check signed inputs, closed endpoints
and the witness's strict 82 > 3*27 margin, real/rational agreement,
nonzero existing atomPrep and auxScore expressions on a concrete matrix,
and nonconstant fourth-root variation. Focused --check-simp hygiene and
staged diff checking pass. Independent review and full integration gates
remain pending; aggregate regeneration belongs to the coordinator.

AI assistance: implemented by worker /root/compression_review on
feat/logspace-polynomial-atom-cutoffs, based on the reviewed hierarchy
lane. The Stationary specialization will be a separate cross-lane change.

Independent non-author source/API review by lean_environment approved exact source revision a4eae07bdd9993e038a83aea84cc3c4b31c794d9 against pinned atoms.tex, 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.
Dependency join for the concrete polynomial atom-row consumer. Inputs are PR #1757 and PR #1750. This is a feature-branch merge, not a merge into main. All compression source/test blobs are identical to the reviewed second parent; the first parent is retained unchanged. The tracked aggregate checker passes. No full estimator endpoint is claimed.
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 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.
Add the concrete preparation, auxiliary-score, and broad-witness row
consumers of the stationary-reference compression results for issue #1721.
The three-constructor PolynomialAtomRow selects actual rational polynomial
functions; no scalar support or regularity contract is assumed. Prove strict
retained support, zero default output, rank flatness, stationary preservation,
and a weighted fourth-root comparison with a constant quantified before the
endpoint type, row, rank, schedule, and error envelopes. Bridge the existing
Matrix.atomPrep and Matrix.auxScore expressions at their zero-padded ranks.

Source mapping: OpenAI2026LogSpace revision 7ef5c0cc, atoms.tex Section 5.5
support margins and compression-threshold table, and compression.tex
Section 8.3 Lemma 8.2 stationary preservation/root comparison. This is the
explicit fourth-moment adaptation, not the source's eighth-root endpoint.
The sufficient scale margin is 0 < eta <= theta/10000. Normalized main
atoms, incoming-gate assembly, access enumeration, overflow stability, and
machine resource bounds remain open. No curated abstract changes.

Tests construct nonzero actual preloss, move the true witness rank into its
polynomial transition, prove positive output and positive root discrepancy,
and apply the uniform weighted theorem. A remaining compression group
changes the default and erases a nonzero second coordinate while preserving
the witness. A separate K > cardinality example distinguishes positive
dummy padding from zero padding, with a signed raw coordinate.

Validation: library and tests independently compiled without diagnostics
using Lean 4.36.0-rc2 and -DwarningAsError=true under project linter options,
private outputs and read-only shared dependencies. Focused hygiene
--check-simp and staged git diff --check pass. Full integration gates are
coordinator-owned. No aggregate changes. Authored with AI assistance by
worker codex-logspace-polynomial-cutoffs-20261030; independent review pending.

Dependencies: local integration merge 35e8a8ec combines independently
reviewed PolynomialAtomCutoffs a4eae07b and Stationary c7873d03 unchanged.
Only the two new PolynomialAtomRows files belong to this implementation.

Independent non-author source/API review by lean_environment approved exact source revision 5925d6e06da530885fbf5144a844439fcf8084a6 and its unchanged reviewed cutoff/compression dependencies, with no findings. The two implementation files are unchanged after joining the published dependency lanes.
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.
Derive the deterministic heavy-set bound from nonnegative row mass, then
apply finite Markov at ceil(n/2) with one distinguished endpoint. The
conditional frequency is at most (2 + 8*c*Cmass)/(n*rho), including empty
conditioning slices. An independent start slice preserves the bound.
The actual affine broad/narrow specialization obtains c = 2^H from the
existing cross-rate pair count and uses rate alpha^H.

Regression examples have perfectly correlated off-endpoint hits with exact
frequency 1/8 and bound 1/2, odd capacity, empty conditioning and the strict
heavy threshold. The affine example uses P=7, broad side 2, narrow side 1,
and the nontrivial bound 19/21, with both exceptional and nonexceptional
seeds in the same conditioning slice.

Validation on base c172011fc0702d7c7a4317b0ad94e57ae13e3bb1 plus these two
files: direct Lean 4.36.0-rc2 elaboration of the module and its test file,
with -DwarningAsError=true, -DautoImplicit=false and repository weak linter
options, both exit 0 with blank diagnostics. Existing dependencies were
read-only and outputs private. Focused check_hygiene.py --check-simp and
git diff --cached --check passed. Aggregate and full hosted gates are left
to coordinator integration under the shared disk constraint.

Source: OpenAI 2026 preprint revision 7ef5c0cc, compression.tex Section 8.4,
lemma/equation buf-rarity. This closes conditional true-heavy-count rarity
only; masked mean/noise estimates, post-overflow stability and integrated
compression remain open. No curated abstract changes.

AI assistance: ChatGPT implemented and self-checked the Lean proofs and
tests. Independent exact-revision review is requested from the coordinator.

Independent non-author source/API review by agent derandomization_plan approved source revision 2391fbec3d50c9927750105dff0466330717b951 with no findings. Review covered finite Markov counting, the forced endpoint, odd capacities, empty slices, the actual affine specialization, and nonvacuous tests. 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.
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.
Compose actual compressed polynomial atom rows with the normalized first-overflow prefix error charge. Preserve both dependency histories from #1772 and #1766.

Independent non-author agent polynomial_false_review approved exact source commit cc6762148fee14289865a7c30fc1231f927eed8d with no findings. Integrated source and behavioral test blobs match the reviewed revision.
Integrated strict source/test builds, tracked aggregate check, whitespace and committed import checks pass. Full integration gates run in PR CI.
Compare actual compression schedules with different increments using the exact
28-weighted propagation sum. Prove that stationary references preserve initial
rank ceilings and bound their actual input thresholds.

For fewer than K true first entries above a fixed level L0, derive every input
rank, threshold and total-variation hypothesis of the existing sentinel-removal
induction from clipped raw-prefix errors. The fixed sentinel is 16*(L0+1), the
rank ceiling is 2*L0+1, and the small weighted budget is at most 1/8 after scaling
by 1+16*(L0+1). No bound on the largest true entry, original compressed inputs,
or final output discrepancy is assumed. Both marked original channels follow
their actual raw prefixes, with exact default and padded-rank agreement.

The 202-line signed behavioral suite exercises a genuine first overflow,
default change and erasure of a negative low second channel, nonconstant raw
evolution of a true first entry 1000, exact coupling to sentinel 32, and weighted
budget 9933/125000. Its zero-initial global run verifies the local indexing:
start from the already-added overflow input and use a zero first local increment.
The preceding global raw prefix has large error and is not a required premise.
It also checks failure of the heavy-count branch and of unclipping at error 1.

Both libraries and the behavioral suite pass strict isolated direct Lean checks
with warningAsError=true and no diagnostics. Focused hygiene with check-simp
and whitespace checks pass. Full integration gates remain for hosted CI.

This is the small-heavy-set sentinel coupling step of the relative-stability
proof, not the full output comparison. Upper saturation, the at-least-K large
entry branch, and integrated compression remain open under #1721 and #1444.

AI-assisted implementation by ChatGPT agent polynomial_false_finish; exact
revision independent review pending before publication.

Independent non-author agent polynomial_false_review approved exact source fd5e03c3ea1a7eb550f0d731bc4548a9da535bd3 with no remaining findings. The only review correction normalized three module-comment headings; final integration strictly rechecked all source and tests and preserves reviewed bytes.
Integrated strict source/test builds, tracked aggregate check, whitespace and committed import checks pass. Full integration gates run in PR CI.
Prove local and actual-first-overflow fourth-root comparisons for all three
concrete polynomial row functions. Small budgets use either sentinel
saturation or persistent rank-gate closure; large budgets use output range.
The first-overflow theorem assumes raw input error bounds only from the
overflow group onward and charges an explicit 28-weighted tail sum. The
truth corollary adds the existing weighted preloss estimate.

Share the existing root-error range/support API and factor quantitative
sentinel comparison once. Preserve the previous coupling contract and the
false-overflow consumer. Add positive-error, signed/default-change,
large-count gate, large-budget, and nonzero-preloss/zero-tail regressions.

Validation: all seven affected library modules and four regression clients
passed direct Lean with warningAsError and project options. Focused source
hygiene (including nonterminal simp) and whitespace checks passed. Full
project CI and import-aggregate integration remain coordinator gates.

AI assistance: implemented with OpenAI ChatGPT agents; the preloaded
restart and finite tail-budget helper was delegated to overflow_restart.
Independent review of the final revision is required before integration.

Independent non-author agent polynomial_false_review approved exact source 7444578a09fb113ecc5d05def8fa19d92322510a with no substantive findings; a minor Main results documentation omission was resolved. Integration preserves the reviewed source/test bytes and both published dependency histories.
Integrated strict source/test builds, tracked aggregate check, whitespace and committed import checks pass. Full integration gates run in PR CI.

@edemaine edemaine left a comment

Copy link
Copy Markdown
Collaborator

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

Independent agent approval by reviewer-codex-edemaine of df4717b. Reviewed the complete nine-file source/test layer plus aggregate, isolated against reviewed parents #1790 and #1785. No blocking findings.

Both heavy-count branches are covered: saturation transfers the small-count sentinel comparison back to actual outputs; enough large raw entries force rank closure until the monotone default closes it permanently. Large budgets use the proved output range. The coefficient 4*(8+2A)*(256θ+273) is fixed before the compression scale, horizon, capacities, retained set and entry magnitudes. The truth-shape conditions, η≤θ/10000 margin, positive K and tail capacities remain explicit.

For the actual first overflow with zero initial default and dyadic floors, the restart uses the already-added group input and a zero first local increment. Its duplicated error is bounded by four times the 28-weighted tail, with no preceding-prefix premise or horizon factor. The actual-to-truth corollary adds weighted preloss with the stated constant order. Checked the mapping to pinned OpenAI2026LogSpace 7ef5c0cc, Lemmas 8.2–8.3, pp. 46–47; this is the concrete fourth-root adaptation, with no-overflow/integrated compression and estimator realization still open.

Regressions show positive actual-overflow error, both gate-closure mechanisms, a large-budget case, and positive actual-to-truth error with zero tail paid by nonzero preloss. The three relocated root-error declarations are byte-identical; coupling and false-overflow contracts are preserved. No curated-abstract impact.

Aggregate coverage (3,060 modules) and whitespace checks pass. At the single inspection Lean 41117201590, Guide and PDF workflows passed; Comparator 41117201585 was running. No local Lean build by this reviewer. Live head/history rechecked before posting. Agent review, not human approval.

Copy link
Copy Markdown
Collaborator Author

Independent non-author preservation audit by coordinator codex-pcp-preservation-20261031: PASS for frozen checkpoint 9e3b030b6d97e00a3eec2d9bc277e3a745d142d7, tree 9abb99da691e8116348709ec231047060ea76d05, with exact parents [approved df4717b1, actual main 172e9bfd]. All nine approved source/test modes, blobs and complete per-path patches match the original joint-parent layer. Actual #1790/1d483fa6 and #1785/f59fcb2a are ancestors of that main, with their prerequisite payloads exact before applying the approved child changes.

The three add/add resolutions introduce no new text: main’s SentinelRelative, PolynomialAtomFalseOverflow and PolynomialAtomRows test exactly match their respective original parent blobs (e7d42932, e49cb3ee, d6037933), and the checkpoint applies the exact reviewed child patches. All 4,431 unrelated main entries—including newer RootMetric, bibliography, configuration, pins and abstract catalogue—are preserved. The 3,242 aggregate imports are canonical; reversing the nine original patches and derived aggregate change recovers main exactly.

Unchanged guarded normal FF publication is authorized after fresh head/ownership guards and completion of LogSq’s separately coordinated sample. Fresh canonical native all-six validation with actual tested-checkout identity remains required before verdict/queue. Reuse the original exact-source outside review; this is a mechanical preservation audit, with no new mathematics approval count or change to reviewed meanings, source credit or scope. No local Lean build, extra dispatch or main-cache retrieval.

@SamuelSchlesinger
SamuelSchlesinger changed the base branch from feat/logspace-sentinel-relative to main October 31, 2026 04:54
@SamuelSchlesinger

SamuelSchlesinger commented Oct 31, 2026 •

Copy link
Copy Markdown
Collaborator Author

Non-author coordinator coordinator-codex-logspace-leaves-20261031: APPROVE 9e3b030b6d97e00a3eec2d9bc277e3a745d142d7 as a validated coordinator fix. Classification: API-sensitive source-preserving replay of the already-reviewed joint-parent layer, not aggregate-only. The three squash-history add/add resolutions use exact approved child bytes over exact original parent entries. All nine approved source/test modes and blobs, complete original patches, authorship, model conditions and source credit are preserved; every unrelated frozen-main entry, including modern RootMetric, configuration, bibliography, pins, documentation and catalogue, remains main’s bytes.

This reuses the outside mathematical/API approval, PCP’s independent preservation authorization, and LogSq’s separate coordinator sample of the exact checkpoint, joint-parent bases, public coupling signature and text-identical moved stateRootError definition. No new mathematical approval is claimed.

Fresh canonical CI passed all six named gates. Its finalized log proves actual synthetic checkout 7552fe21f598cfe918919b6f4dc544d87dcdee7f / tree 7708125eaddbbbb46033e30f335b7de45665027c on newer actual main 6d5720963a7a177560829d62c9db9fe398438062. That context exactly retains the approved feature payloads, every main entry and pin, and 3,249 canonical imports. No local build or duplicate dispatch was run.

Actually landed at 05:15:24 UTC as 397100399f009b3202588d5209247d0f228f32d9 / tree 487501c7b2f7394435b7254e5a144b4d6691642c. Required merge-group CI is terminal SUCCESS with all six named gates at that exact checkout. The full actual prefix, original own-layer bases, approved source/test payloads, imported dependencies and pins are verified. Usable covering main/cache is verified at fixed b79750f66e3d8abb7020d0879b9908e2a908bb88: run 41172188157 / job 124453133490 passed all six at that exact checkout, restored producer 41171748162 attempt 1, and published at 05:35:13 UTC. The saved mapping has 4,358 unique pairs; all 22 new artifact references versus Crypto’s saved f6f baseline have positive HEAD 200 responses. The log has zero Built Complexity lines. This audit used one main-log GET and one mapping GET, with zero artifact-body downloads. Source checks retain this exact reviewed layer and explicitly account for its approved updates to earlier parent files; unrelated imported dependencies and pins remain exact. The fixed consumer excludes #1913/#1794. Selected formal abstracts are unaffected. The concrete fourth-moment result retains its explicit conditions and does not complete the estimator, class or native-resource objectives in #1721/#1444/#474.

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.

2 participants