14 September 2026 · follow-up to the coordinate check. Internal mathematical draft by the Zerone development assistant team under one operator. External review and accountable human adoption remain pending.
The earlier convex candidate removed coordinate bias but could introduce spurious fixed points. Here we specify sufficient restrictions, prove that the composite has exactly the intended solutions, and give a strong-convergence proof for a declared iteration with small inertial errors. The restrictions are sufficient, not claimed minimal. This is a replacement theorem for our explicit algorithm; it does not validate the source article’s literal theorem.
The useful mechanism is measurable at each stage: distance cannot increase relative to a common solution, and the mixing steps expose residual errors that would otherwise cancel. Even the boundary of the relaxation range can be admitted when the inner mixing parameter stays strictly between zero and one. Strict relaxation alone is therefore not a necessary condition here.
Let be a real Hilbert space. There are fixed finite families and maximal monotone operators , with and . Suppose
Each is demiclosed at zero: and imply . Assume the common solution set
is nonempty. Fix positive weights with , and constants
Let , the everywhere-defined firm resolvent, and set
Let be a contraction with Lipschitz bound . For , define the complete iteration by
Initial are arbitrary. This includes the earlier capped inertial displacement, as well as zero inertia. The proof uses only the stated error bound. In particular, is evaluated at , not at . All weights, operators and mixing parameters above remain fixed.
Result. The set is closed and convex, , and is demiclosed at zero. The iterates converge in norm to the unique point
No pairwise nonexpansiveness or continuity of , , or is assumed. Firm resolvents and the metric projection have their usual nonexpansiveness properties. The proof below does not replace the controlled input error by an unjustified bound on .
Write . Expansion and the demimetric condition give, for ,
The coefficients are nonnegative under the declared bound. Define
The weighted squared-norm identity yields . Thus and each are quasi-nonexpansive: they do not increase distance to their fixed points. For completeness, the common fixed-point identity for follows from
If , every original residual vanishes. The converse is immediate. Here may be any common fixed point of the ; it need not be a zero of the .
Each is closed by demiclosedness. It is convex as follows. For fixed points , let , . Weighting the two quasi-nonexpansive inequalities for gives
so . The zero sets of the are the closed convex fixed sets of their firm resolvents. Hence their finite intersection is closed and convex. The contraction on therefore has exactly one fixed point, the target .
For the resolvent prefixes set , and . Firmness gives
Using the same squared-norm identity for the inner mixture and then applying gives the joint estimate
Finally the outer mixture gives
If , (2) forces all resolvent prefix differences to vanish, so and . It also forces because . Equation (1) now identifies every fixed point. Thus . Conversely every is fixed at every stage. Since , .
With , (3) also implies the quantitative estimate
Suppose and . The sequence is bounded. Its distance-squared loss tends to zero, since
Equation (3) forces and . In particular, every prefix and has the same weak limit as . Equation (1) and boundedness give for every . The assumed demiclosedness puts in every .
Also . Demiclosedness of the nonexpansive resolvent residual gives for every . This standard closure fact can be seen directly: if , and is nonexpansive, expand after substituting . Boundedness and weak convergence yield .
Therefore , proving demiclosedness of . Notice that this argument still works if some or all coefficients in vanish. The positive inner mixing term and (1) supply the needed individual residual control at the endpoint .
Put , , and . Quasi-nonexpansiveness gives
Thus for , by induction. This also bounds , and relative to .
Descent with vanishing forcing. Apply convexity of squared norm to the update and then (4). Since , there is a fixed finite such that
For example, works for . No limit for or has been assumed.
Projection-sensitive recurrence. Write
Then . The identity gives
Here and the remaining square terms are bounded by .
Where the projection sign becomes available. Along any indices for which , the update shows
Take a subsequence attaining the limsup of , and a further weakly convergent subsequence of the bounded . Demiclosedness of puts its limit in ; the same limit holds for . The characterization of gives . Consequently along those indices.
There are two exhaustive cases.
Thus in norm. This proves the complete declared restricted iteration. The argument never infers an infinite limit from the finite runs.
The previous , , example violates the new bound: . It remains a counterexample to the unrestricted candidate. Using for the same map gives and avoids that cancellation.
The relaxation endpoint by itself is admissible. For , , and , we have , and when . In contrast, also taking the excluded value makes while . With the resulting identity-type iteration tends to one. This shows why a bound and a mixing condition must be considered together. It does not show that every excluded endpoint fails.
The coefficients of the repaired point-valued combinations sum to one, so the coordinate-covariance argument from the earlier note still applies. When testing translated trajectories, translate , the operator domains, point-valued maps, initial points and solution set consistently.
The convergence mechanism has established antecedents. In particular, Wongchan and Saejung (2011), Theorem 2.3 studies viscosity iteration for strongly quasinonexpansive mappings with demiclosed residuals. Aoyama and Kohsaka (2014), Corollary 3.5 provides a corresponding fixed-map result within a broader sequence framework. Our explicit proof above handles the declared input perturbation and verifies the composite’s assumptions. We do not claim a novel general convergence principle or infer coverage of the perturbed iteration merely from a citation. The earlier Song predecessor check remains relevant to original-map residual identification.
Run
python3 -I -B verify_restricted.py --output-dir ../restricted-rerun
from this directory, choosing a destination that does not exist. The
checker uses standard-library rational arithmetic. It tests explicit
affine and piecewise examples, the joint loss estimate, translated
trajectories and excluded-parameter controls. results.json
stores its finite output. verify_packet.py checks the
inventory and hashes in MANIFEST.json.
These computations corroborate examples and implementation; the Hilbert-space and limiting statements depend on the mathematical proof and its assumptions. Internal reviewers share one operator. This is neither external peer review nor a machine-checked proof. No claim of novelty, misconduct, author assent, on-chain settlement or general validation of the original article is made. The original review, failed unrestricted candidate and its counterexample remain unchanged in their earlier packets and in the local history.