A Conditional Closure Route for H': Turning Point Elimination, Uniform Weighted Lemma, Frontier Reduction, and Three Residual Inputs
DOI: 10.5281/zenodo.19226607This paper establishes a conditional closure route for H' (\(\bar{c}_h(N) \to 0\)) and compresses the closing problem into three residual numerical inputs (NI1–NI3). Apart from these three inputs, every other link in the chain is given a theorem-level, exact algebraic, or purely reductive proof.
Main results:
(1) Turning point elimination. The sf-only turning point at Ω ≈ 7.2 reported in Paper XLI is a sampling artifact. After incorporating ss and hp cores, all Ω = 2–8 shells (sf+ss+hp combined) exhibit positive slopes, most exceeding 10σ (fourteen experimental Blocks).
(2) Strong numerical evidence for NI1. Block 14 shows that \(V_k\) saturates at approximately 1.0–1.3 across the full spectrum, with Ω = 7 stable and Ω = 8 declining, providing uniform numerical support for \(V^*_F = O(1)\). However, \(V^*_F = O(1)\) is recorded as residual input NI1, not claimed as an analytic theorem.
(3) Uniform Weighted Log-Moment Lemma (theorem-level). We prove \(W_k(N)/S_k(N) \leq 1/(\log N)^2 + C_A(5/6)^k\) with explicit constant \(\rho_A = 5/6\), based on Lichtman's harmonic Sathe–Selberg estimates.
(4) Successor-Reset Exact Identity. When \(J_n > 0\), \(J_{n+1} = (1 - \Delta M_n)^+\). This is an exact consequence of the DP min-recursion, demonstrating that jumps undergo a "memory wipe" at the next step.
(5) Averaged Transfer Lemma. Under a shell-level averaged interface, given a uniform variance bound and an averaged Margin-from-Jump lower bound: \(\bar{c}^Y \cdot (L^Y)^2 \leq a_F + b_F(J^Y)^2\).
(6) Frontier identification and conditional closure. The BRS route compresses the closing problem — originally depending on S4b / tail assumption / MJ5 — into three residual inputs: NI1 (\(V^*_F = O(1)\)), NI2 (MJ4's averaged bridge lower bound), NI3 (weighted second moment bound for \(J^2\)). Outside these three, the rest of the chain is closed.
Conclusion: Paper XLII provides a conditional closure route for H': once NI1–NI3 hold, \(\bar{c}_h(N) \to 0\) follows. This paper does not claim H' has been theorem-level closed.
Keywords: conditional closure, H prime, BRS theorem, turning point elimination, Uniform Weighted Log-Moment Lemma, Successor-Reset identity, Averaged Transfer Lemma, NI1–NI3
§1 Background and Difficulty
Paper XLI (DOI: 10.5281/zenodo.19201877) established positive-slope signals for Ω ≤ 6 (94.39% harmonic density) and reported a turning point at Ω ≈ 7.2 (sf-only).
Core difficulty: \(\bar{c}_h(N) = \sum_k h^{\mathrm{har}}_k(N)\,\bar{c}_k(N)\), where \(h^{\mathrm{har}}_k(N)\) is the actual harmonic shell weight. In the bulk window it can be approximated by a Poisson surrogate with parameter \(\lambda = \log\log N\). The mass center shifts rightward, so convergence at each fixed \(k\) does not automatically imply global convergence ("moving mass × moving function").
1.1 Notation Summary
- \(\lambda := \log\log N\), \(K_A(N) := \lfloor\lambda + A\sqrt{\lambda}\rfloor\)
- \(S_k(N) := \sum_{\Omega(m)=k,\,m\leq N} 1/m\), \(h^{\mathrm{har}}_k(N) := S_k(N)/\sum_j S_j(N)\) — the actual harmonic shell weight. Poisson surrogate: \(h^{\mathrm{Pois}}_k(N) := e^{-\lambda}\lambda^k/k!\)
- \(\bar{c}_h(N) := \sum_{k\geq 1} h^{\mathrm{har}}_k(N)\,\bar{c}_k(N)\) — global harmonic defect average
- \(F \in \{\mathrm{sf},\,\mathrm{ss},\,\mathrm{hp}\}\) — the three families
- \(Y_{k,F}(N)\) — bulk complement of family \(F\) on the Ω=\(k\) shell (main arena for averaged analysis)
- \(T_{k,F}(N;p)\) — top slice associated with prime \(p\); S4a controls its harmonic mass, typically \(O(1/\log N)\)
- Full shell: \(W_k(N) := \sum_{\Omega(m)=k,\,m\leq N} 1/(m(\log m)^2)\); \(W_k/S_k\) controlled by the Weighted Lemma (§4.2)
- On \(Y_{k,F}(N)\): \((L^Y)^{-2} := W^Y/S^Y\) — effective log scale; in bulk window, \(L^Y \asymp \log N\)
- \(J^Y_{k,F}(N)\) — weighted jump scale on Y: \((J^Y)^2 := \sum_{m\in Y} J(m)^2/(m(\log m)^2)\,/\,W^Y\) — controlled by NI3
- \(\bar{M}^Y_{k,F}(N)\) — shell-level averaged margin; all MJ3/MJ4 use this averaged register
- \(B_A(N)\) — bulk-window contribution to \(\bar{c}_h(N)\); proof strategy: control \(B_A\) first, then use bulk-window reduction
§2 Turning Point Elimination (Blocks 12–13)
2.1 sf+ss Merge (Block 12)
| Ω | sf-only (Paper XLI) | sf+ss (Block 12) | σ |
|---|---|---|---|
| 7 | −0.016 (−1.2σ) | +0.136 ± 0.006 | 24.0 |
| 8 | −0.088 (−3.8σ) | +0.119 ± 0.006 | 18.5 |
2.2 hp Cores (Block 13)
| Ω | sf+ss (σ) | hp (σ) |
|---|---|---|
| 7 | +0.136 (24.0) | +0.252 (33.7) |
| 8 | +0.119 (18.5) | +0.100 (11.3) |
§3 Full Positive-Slope Spectrum and \(V_k = O(1)\)
3.1 M̄ Positive-Slope Spectrum (sf+ss+hp, Ω = 2–8)
| Ω | sf (σ) | ss (σ) | hp (σ) |
|---|---|---|---|
| 2 | +0.173 (>10) | +0.135 (4.4) | — |
| 3 | +0.220 (11.9) | +0.247 (16.6) | +0.284 (2.4) |
| 4 | +0.171 (10.8) | +0.300 (16.2) | +0.259 (16.7) |
| 5 | +0.185 (20.2) | +0.414 (31.3) | +0.388 (15.6) |
| 6 | +0.111 (10.8) | +0.231 (17.6) | +0.039 (2.6) |
| 7 | — | +0.136 (24.0) | +0.252 (33.7) |
| 8 | — | +0.119 (18.5) | +0.100 (11.3) |
3.2 \(V_k = O(1)\) (Block 14)
| Ω | ⟨V⟩ | median | V slope |
|---|---|---|---|
| 2 | 0.60 | 0.49 | +0.228 |
| 3 | 0.38 | 0.25 | +0.162 |
| 4 | 0.26 | 0.17 | +0.126 |
| 5 | 0.93 | 0.81 | +0.274 |
| 6 | 1.28 | 1.23 | +0.192 |
| 7 | 1.25 | 1.19 | +0.009 (STABLE) |
| 8 | 1.05 | 1.03 | −0.063 (DECLINING) |
\(V_k\) saturates at ~1.0–1.3. Paper XXXIV's V ≈ 1.4 is the full-spectrum saturation value.
§4 Closure Route for H': Mathematical Framework
4.1 Bulk-Window Reduction Theorem
Theorem. If for each fixed \(A > 0\), \(B_A(N) := \sum_{k \leq K_A(N)} h^{\mathrm{har}}_k(N)\,\bar{c}_k(N) \to 0\), then \(\bar{c}_h(N) \to 0\).
Proof. Write \(\bar{c}_h = B_A + T_A\) where \(T_A := \sum_{k > K_A} h^{\mathrm{har}}_k\,\bar{c}_k\). Since \(0 \leq \bar{c}_k \leq 1\), \(T_A \leq \sum_{k > K_A} h^{\mathrm{har}}_k\). By harmonic Sathe–Selberg asymptotics the actual shell weights in the bulk window are uniformly approximated by a Poisson surrogate with parameter \(\lambda\); in particular, \(\sum_{k > K_A} h^{\mathrm{har}}_k \leq P(\mathrm{Pois}(\lambda) > K_A) + o_A(1)\). Hence \(\limsup \bar{c}_h \leq \limsup B_A + (1-\Phi(A))\). Since \(A\) is arbitrary, choose \(A\) large enough to make \(1-\Phi(A) < \varepsilon\). ∎
4.2 Uniform Weighted Log-Moment Lemma (theorem-level)
Lemma. For fixed \(A > 0\), there exist \(N_0(A)\) and \(C_A\) such that when \(N \geq N_0(A)\) and \(1 \leq k \leq K_A(N)\):
$$\frac{W_k(N)}{S_k(N)} \leq \frac{1}{(\log N)^2} + C_A \cdot \left(\frac{5}{6}\right)^k$$
\(\rho_A = 5/6\) is explicit; \(N_0(A) \geq \exp\exp(16A^2)\).
Proof sketch. (a) Harmonic Sathe–Selberg upper and lower bounds (Lichtman [4], Theorem 1.3). (b) Partial summation: \(W_k = S_k/(\log N)^2 + 2\int S_k(t)/(t(\log t)^3)\,dt\). (c) Small-\(t\) range: \(I_1/S_k \leq (a_+/(a_-(\log 2)^2))(5/6)^k\). (d) Large-\(t\) range: \(I_2/S_k \leq (e\,a_+/a_-)(5/6)^k\). (e) Small-\(k\) exception: \(W_k/S_k \leq C_0(5/6)^k\). (f) Combine. ∎
4.3 Successor-Reset Exact Identity
Theorem (DP exact consequence). For all \(n \geq 2\):
(R1) \(J_{n+1} \leq (1 - \Delta M_n)^+\)
If \(J_n > 0\) (a jump occurs at step \(n\)), then the exact equality holds:
(R2) \(J_{n+1} = (1 - \Delta M_n)^+\)
Proof. From \(\rho_E(n) = \min(\rho_E(n{-}1)+1,\, M_n)\): if \(J_n > 0\) then \(S_n > M_n\), so \(\rho_E(n) = M_n\) and \(S_{n+1} = M_n + 1\). Thus \(J_{n+1} = (S_{n+1} - M_{n+1})^+ = (1 - \Delta M_n)^+\). ∎
4.4 Averaged Transfer Lemma (conditional)
For family \(F\) and bulk shell \(Y_{k,F}(N)\), write \(L := L^Y\), \(J := J^Y\), \(\bar{M} := \bar{M}^Y\), \(\bar{c} := \bar{c}^Y\). Shell-level Cantelli gives \(\bar{c} \leq V^*_F/(V^*_F + \bar{M}^2)\). Assume the averaged Margin-from-Jump lower bound: \(\bar{M} \geq \alpha_F L - \beta_F - \gamma_F J\).
Lemma. \(\bar{c}\,L^2 \leq a_F + b_F J^2\), where \(a_F := \max(16\beta_F^2/\alpha_F^2,\; 4V^*/\alpha_F^2)\), \(b_F := 16\gamma_F^2/\alpha_F^2\).
Proof (three cases). Case 1: \(L \leq 4\beta/\alpha\). Then \(\bar{c} \leq 1\), so \(\bar{c}\,L^2 \leq 16\beta^2/\alpha^2\). Case 2: \(L > 4\beta/\alpha\) and \(\gamma J \leq \alpha L/4\). Averaged MJ gives \(\bar{M} \geq \alpha L/2\). Cantelli: \(\bar{c} \leq 4V^*/(\alpha^2 L^2)\), so \(\bar{c}\,L^2 \leq 4V^*/\alpha^2\). Case 3: \(L > 4\beta/\alpha\) and \(\gamma J > \alpha L/4\). Then \(\bar{c} \leq 1\) and \(L^2 < 16\gamma^2 J^2/\alpha^2\), so \(\bar{c}\,L^2 \leq 16\gamma^2 J^2/\alpha^2\). Combining gives the result. ∎
4.5 From Averaged Transfer Lemma to \(B_A \to 0\)
By §4.4, \(\bar{c}^Y \leq (a_F + b_F(J^Y)^2) \cdot W^Y/S^Y\). This reduces the closing problem to controlling the weighted second moment of \(J^2\) — recorded as the third residual input:
(NI3) For each fixed \(A > 0\), there exists a polynomial \(P_F(k)\) such that when \(N\) is sufficiently large and \(k \leq K_A(N)\), \((J^Y_{k,F}(N))^2 \leq P_F(k)\).
Under NI3, and applying the Weighted Log-Moment Lemma (§4.2) to \(W^Y/S^Y\):
$$B_A \leq \frac{\mathrm{poly}(\log\log N)}{(\log N)^2} + \mathrm{poly}(\log\log N) \cdot (\log N)^{-1/6} \to 0$$
Combined with the Bulk-Window Reduction of §4.1: \(\bar{c}_h(N) \to 0\), conditional on NI1–NI3.
§5 Frontier Identification and Conditional Closure
5.1 Margin-from-Jump Lower Bound
What is needed is the shell-level averaged version. For family \(F\) and bulk complement \(Y_{k,F}(N)\):
$$\bar{M}^Y \geq \alpha_F L^Y - \beta_F - \gamma_F J^Y$$
By Paper XVI's insertion identity, after shell-level averaging:
$$\bar{M}^Y = E_{I_{k,F}}[J(m)\,\mathbf{1}_Y] + E_{I_{k,F}}[K_p(m)\,\mathbf{1}_Y] + O(1)$$
Closing (ATL3) therefore reduces to two averaged frontiers: the insertion source (MJ3) and the bridge cost (MJ4). MJ5 and MJ6 remain important structural companions but no longer belong to the minimal closing chain.
5.2 Four Frontier Lemmas
Lemma MJ3 (Insertion Non-Compression, averaged). \(E_{I_{k,F}}[J(m)\,\mathbf{1}_Y] \geq \alpha_F L^Y - \beta^{(1)}_F\). Reduction: MJ3 ← SPS ← conditioning penalty + scale-shift penalty (§5.3).
Lemma MJ4 (Averaged Bridge Lower Bound). \(E_{I_{k,F}}[K_p(m)\,\mathbf{1}_Y] \geq -\beta^{(2)}_F - \gamma_F J^Y\). Paper XLIII draft provides far stronger numerical evidence than required; recorded here as residual input NI2.
Lemma MJ5 (Successor-Reset Drift). \(E[(J_{t+1}-U)^+ \mid G_t] \leq \theta_F(J_t-U)^+ + C_F\xi_t\). Characterizes the quantitative strength of self-correction; not required for the minimal H' chain under BRS route.
Lemma MJ6 (HP Seed Isolation). Absorbs the hp family's bookkeeping error into \(\gamma_F J^Y\) and \(O(1)\) constant terms, placing hp into the same averaged framework as sf/ss. Framework alignment role only in this paper's main chain.
5.3 SPS and the Scale-Shift Penalty
Lemma SPS (Small-Prime Shell Stability). Decompose:
$$\mu^Y(N/p, p) - \mu^Y(N) = [\mu^Y(N/p,p) - \mu^Y(N/p)] + [\mu^Y(N/p) - \mu^Y(N)]$$
The first term is the conditioning penalty (proved by Cauchy–Schwarz from NI1); the second is the scale-shift penalty (resolved via BRS).
5.4 Block-Roughness Stability Theorem (BRS)
Theorem (BRS). On the family-wise bulk shell \(Y_{k,F}(X)\) with harmonic probability measure \(\nu\), suppose \(\mathrm{Var}_\nu(G_F) \leq V^*_F\). Then for any measurable \(A \subseteq Y_{k,F}(X)\) with \(\delta_A = \nu(A)\):
$$|\mu_A - \mu^Y| \leq \sqrt{V^*_F} \cdot \sqrt{\frac{1-\delta_A}{\delta_A}} \qquad \text{(BRS)}$$
Proof. Let \(Y = G_F\), \(\mu = E[Y]\), \(I_A = \mathbf{1}_A\). Then \(\delta_A(\mu_A - \mu) = E[(Y-\mu)I_A] = E[(Y-\mu)(I_A-\delta_A)]\). By Cauchy–Schwarz: \(|\delta_A(\mu_A-\mu)| \leq \sqrt{\mathrm{Var}(Y)}\cdot\sqrt{\mathrm{Var}(I_A)} = \sqrt{\mathrm{Var}(Y)}\cdot\sqrt{\delta_A(1-\delta_A)}\). Dividing by \(\delta_A\) yields (BRS). ∎
Corollary (S4-weak). Take \(A = T_{k,F}(X;p)\) (top slice). By S4a: \(\delta_A \leq \kappa/\log X\). Then:
$$|\mu^Y(X/p) - \mu^Y(X)| \leq \sqrt{V^*_F}\cdot\sqrt{\delta/(1-\delta)} \ll (\log X)^{-1/2} \to 0 \qquad \text{(S4-weak)}$$
This is stronger than the "bounded scale-shift penalty" needed by MJ3/SPS — it tends to zero.
5.5 Complete Closing Chain (conditional on NI1–NI3)
MJ3 + NI2 ⟹ (ATL3) ⟹ Averaged Transfer Lemma
Averaged TL + NI3 + Weighted Lemma ⟹ B_A → 0 ⟹ Bulk-Window Reduction ⟹ c̄_h → 0
Paper XLII provides not "H' is theorem-level closed" but a conditional closure route: once NI1–NI3 all hold, H' follows.
5.6 Completed Relay Algebra (Paper XVI, theorem-level)
- Exact insertion identity: \(G_{\mathrm{spf}}(pm) = j(m) + K_p(m)\)
- Bridge identity: \(K_p = A(pm) + B(pm) - A(m)\)
- \(A \geq -1\), \(B \leq 0\); when \(v_{P^-} = 1\), \(B \in [-2(k-1), 0]\)
- B-noise closure: Paper XX proves unconditionally that \(\mathrm{Var}(B) = O_k(1)\)
5.7 Complete Status of the Argument Chain
| Step | Content | Status | Notes |
|---|---|---|---|
| Bulk-Window Reduction | §4.1 | proved | — |
| Weighted Log-Moment Lemma | §4.2, ρ=5/6 | proved | — |
| Successor-reset identity | §4.3, R1/R2 | proved | exact DP consequence |
| S4a top-slice thinness | §5.3 | proved | Sathe–Selberg |
| BRS theorem | §5.4 | proved | pure Cauchy–Schwarz |
| Shell-level Cantelli | §4.4 | proved | standard inequality |
| NI1: V*_F = O(1) | §3.2 / Paper XVIII | computationally verified | residual input |
| S4-weak | §5.4 corollary | conditional on NI1 | — |
| SPS | §5.3 | conditional on NI1 | — |
| MJ3 | §5.2 | conditional on NI1 | SPS + insertion identity |
| NI2: MJ4 bridge lower bound | §5.2 | computationally verified | residual input |
| Averaged MJ (ATL3) | §5.1 | conditional on NI1, NI2 | — |
| Averaged Transfer Lemma | §4.4 | conditional on NI1, NI2 | — |
| NI3: weighted J² bound | §4.5 | computationally verified | residual input |
| B_A → 0 | §4.5 | conditional on NI1–NI3 | — |
| H': c̄_h → 0 | — | conditional on NI1–NI3 | — |
§6 Fourteen Experimental Blocks
| Block | Measurement | Result |
|---|---|---|
| 1 | Per-layer defect rate | Ω ≤ 6 declining >5σ |
| 2 | Global c̄_h v1 | Discarded |
| 3 | Band + c̄_h(P) | Ω = 2 declining |
| 4 | Slack collapse | Failed |
| 5 | Global c̄_h v2 | 0.43 flat |
| 6 | c × (log m)² | C_k constant within layer |
| 7 | C_k growth law | γ = 0.503 (superseded) |
| 8 | C_k × A_k reconstruction | C_k ≈ V/a²; upper bound → 1 |
| 9 | Small m vs large m | Cesàro dilution |
| 10 | Ω = 7,8 sf band | Ω = 7 weakly positive |
| 11 | B_A(N) | Rising |
| 12 | Ω = 7,8 sf+ss | Ω=7: 24σ, Ω=8: 18.5σ |
| 13 | Ω = 7,8 hp | Ω=7: 33.7σ, Ω=8: 11.3σ |
| 14 | V_k full spectrum | V_k = O(1), saturating ~1.3 |
§7 Discussion
7.1 SAE Interpretation
The sf-only turning point reflects the memoryless-system limit. The repeated factors of ss/hp serve as memory anchors (8D = 11DD memory + 12DD prediction).
7.2 SAE Meaning of Successor-Reset
(R1/R2) is the DP's "memory erasure": after a large jump the system resets, and the next step depends only on \(\Delta M_n\). This is the chisel-construct cycle of SAE manifested in arithmetic — excessive deviation (jump) is automatically corrected (reset).
7.3 SAE Meaning of the Anti-Correlation Engine
Paper XVIII's \(\mathrm{Cov}(\Delta f, \Delta r) \approx -\mathrm{Var}(\Delta f)\) is a "forced balance" mechanism: fluctuations in the additive part (\(f\), corresponding to SAE's "construct") are precisely cancelled by the combinatorial remainder (\(r\), corresponding to "chisel"). This is the deepest structural property in the entire conditional closure chain for H': it guarantees \(V_k = O(1)\), which via BRS yields scale-shift penalty → 0 directly.
7.4 BRS Route vs. Original S4b Route
The original route required S4b (top-slice bounded oscillation, \(O(1)\)), which required MJ5, which required the tail assumption (T). The BRS route weakens S4b to S4b-weak (\(O(\sqrt{\log X})\)), derived directly from \(V^*_F = O(1)\) + S4a, completely bypassing MJ5 and (T). The cost: S4-weak gives penalty \(O((\log X)^{-1/2})\) rather than \(O((\log X)^{-1})\); but MJ3/SPS only require a bounded penalty, so this suffices — with room to spare, since it tends to zero.
§8 Residual Numerical Inputs and Open Problems
8.1 Three Residual Inputs
(NI1) V*_F = O(1). Paper XVIII's anti-correlation engine provides a structural explanation; Block 14 provides strong numerical evidence. Treated as residual input in this paper.
(NI2) MJ4's averaged bridge lower bound. Paper XLIII draft provides numerical evidence far stronger than required; recorded here as residual input.
(NI3) Weighted second moment bound for J². Related to but not equivalent to NI1: NI1 controls the variance scale; NI3 controls the W-weighted jump second moment. Each must be listed separately.
Promoting all of NI1–NI3 to analytic proofs constitutes the most natural open problems after Paper XLII.
8.2 Open Problems
- (OP1) Analytic proof of \(V^*_F = O(1)\) (possibly from DP min-recursion + anti-correlation identity)
- (OP2) Analytic proof of MJ4 bridge positivity
- (OP3) Analytic proof of NI3: \(J^2\) weighted second moment bound
- (OP4) Analytic proof of \(a_k > 0\) (positive M̄ slope; independent interest)
- (OP5) Full S4b (\(O(1)\) bounded oscillation) — stronger but not required for H' closure
- (OP6) Analytic proof of the tail assumption (T) — no longer required for H' closure, but of independent number-theoretic value
§9 Data Sources
Fourteen scripts (p42_defect_rate.py through p42_variance.py). Data: rho_1e10.bin (int16, N = 10¹⁰).
References
[1] H. Qin. ZFCρ Paper XLI. DOI: 10.5281/zenodo.19201877.
[2] H. Qin. ZFCρ Paper XL. DOI: 10.5281/zenodo.19179778.
[3] H. Qin. ZFCρ Paper XXXIV. DOI: 10.5281/zenodo.19140015.
[4] J. D. Lichtman. Mertens' prime product formula, dissected. Integers 21A (2021), A17.
[5] H. Qin. ZFCρ Paper XVIII (Anti-Correlation Engine). DOI: 10.5281/zenodo.19024385.
[6] H. Qin. ZFCρ Paper XVI (Insertion Identity). DOI: 10.5281/zenodo.19013602.
[7] H. Qin. ZFCρ Paper XVII (Roughness Stability). DOI: 10.5281/zenodo.19016958.
[8] H. Qin. ZFCρ Paper XX (B-Noise Closure). DOI: 10.5281/zenodo.19027892.
Acknowledgments
ChatGPT (Gongxi Hua / 公西华): Principal architect of the analytic proof chain. Bulk-Window Reduction; Uniform Weighted Log-Moment Lemma (ρ = 5/6); Transfer Lemma (three-case averaged version); SPS conditioning penalty (Cauchy–Schwarz); Theorem S4 shell-scale Lipschitz; S4a top-slice thinness (Sathe–Selberg); MJ3–MJ6 frontier decomposition; Block-Roughness Stability (BRS) theorem (the key breakthrough bypassing S4b and (T)); 17-minute review identifying five must-fix issues (register, three-case TL, J² bound, averaged/pointwise levels, Poisson formulation) with line-by-line revision text.
Claude (Zilu / 子路): Designed fourteen Blocks, wrote all scripts, drafted all text. Discovered the Block 12 sf+ss strategy; designed and analyzed Paper XLIII's four Blocks; integrated review revisions.
H' 的条件闭合路线：Turning Point 消除、Uniform Weighted Lemma、Frontier 归约与三个残余输入
DOI: 10.5281/zenodo.19226607本文建立 H'（\(\bar{c}_h(N) \to 0\)）的条件闭合路线，并将 closing problem 压缩为三个残余 numerical inputs（NI1–NI3）。除这三项输入外，其余环节均给出 theorem-level、exact algebraic 或纯归约性证明。
核心结果：
（1）Turning point 消除。Paper XLI 的 sf-only turning point（Ω ≈ 7.2）是 sampling artifact。加入 ss 和 hp cores 后，Ω=2–8 全谱（sf+ss+hp）恢复正斜率，大部分超过 10σ（十四个实验 Block）。
（2）NI1 的强数值证据。Block 14 显示 \(V_k\) 在全谱上饱和于约 1.0–1.3，Ω=7 稳定、Ω=8 下降，为 \(V^*_F = O(1)\) 提供统一数值支撑；但在本文中，\(V^*_F = O(1)\) 仍记为残余输入 NI1，而不宣称为解析定理。
（3）Uniform Weighted Log-Moment Lemma（theorem-level）。证明 \(W_k(N)/S_k(N) \leq 1/(\log N)^2 + C_A(5/6)^k\)，其中 \(\rho_A = 5/6\) 为显式常数；论证基于 Lichtman 的 harmonic Sathe–Selberg 估计。
（4）Successor-Reset Exact Identity。当 \(J_n > 0\) 时，\(J_{n+1} = (1 - \Delta M_n)^+\)。这是 DP min 递推的 exact consequence，表明 jump 在下一步发生"memory wipe"。
（5）Averaged Transfer Lemma。在 shell-level averaged interface 下，若存在 uniform variance bound 与 averaged Margin-from-Jump lower bound，则可推出 \(\bar{c}^Y \cdot (L^Y)^2 \leq a_F + b_F(J^Y)^2\)。
（6）Frontier identification 与条件闭合。BRS 路线把原先依赖 S4b / tail assumption / MJ5 的 closing problem，压缩为三个残余输入：NI1（\(V^*_F = O(1)\)）、NI2（MJ4 的 averaged bridge lower bound）、NI3（\(J^2\) 的 weighted second moment bound）。在这三项之外，其余链条均已闭合。
本文结论：Paper XLII 给出的是 H' 的条件闭合路线：一旦 NI1–NI3 全部成立，即可推出 \(\bar{c}_h(N) \to 0\)。本文不在此处宣称 H' 已 theorem-level closed。
关键词：条件闭合，H prime，BRS 定理，turning point 消除，Uniform Weighted Log-Moment Lemma，Successor-Reset identity，Averaged Transfer Lemma，NI1–NI3
§1 背景与困境
Paper XLI（DOI: 10.5281/zenodo.19201877）建立 Ω ≤ 6 正斜率信号（94.39% harmonic 密度），并报告 Ω ≈ 7.2 turning point（sf-only）。
核心困境：\(\bar{c}_h(N) = \sum_k h^{\mathrm{har}}_k(N)\,\bar{c}_k(N)\)，其中 \(h^{\mathrm{har}}_k(N)\) 是实际 harmonic shell weight；在 bulk window 上，它可由参数 \(\lambda = \log\log N\) 的 Poisson surrogate 近似。质量中心右移，固定 \(k\) 收敛不自动推出全局收敛（"移动质量 × 移动函数"）。
1.1 记号回顾
- \(\lambda := \log\log N\)，\(K_A(N) := \lfloor\lambda + A\sqrt{\lambda}\rfloor\)
- \(S_k(N) := \sum_{\Omega(m)=k,\,m\leq N} 1/m\)，\(h^{\mathrm{har}}_k(N) := S_k(N)/\sum_j S_j(N)\)——实际 harmonic shell weight。Poisson surrogate: \(h^{\mathrm{Pois}}_k(N) := e^{-\lambda}\lambda^k/k!\)
- \(\bar{c}_h(N) := \sum_{k\geq 1} h^{\mathrm{har}}_k(N)\,\bar{c}_k(N)\)——全局 harmonic defect 平均
- \(F \in \{\mathrm{sf},\,\mathrm{ss},\,\mathrm{hp}\}\)——三类 family
- \(Y_{k,F}(N)\)——family \(F\) 在 Ω=\(k\) 壳上的 bulk complement，averaged analysis 的主舞台
- \(T_{k,F}(N;p)\)——与 prime \(p\) 相关的 top slice；S4a 控制其 harmonic 质量，典型量级为 \(O(1/\log N)\)
- 在 full shell 上：\(W_k(N) := \sum_{\Omega(m)=k,\,m\leq N} 1/(m(\log m)^2)\)；§4.2 的 Weighted Lemma 控制 \(W_k/S_k\)
- 在 \(Y_{k,F}(N)\) 上：\((L^Y)^{-2} := W^Y/S^Y\)——effective log scale；在 bulk window 上，\(L^Y \asymp \log N\)
- \(J^Y_{k,F}(N)\)——Y 上的 weighted jump scale：\((J^Y)^2 := \sum_{m\in Y} J(m)^2/(m(\log m)^2)\,/\,W^Y\)——NI3 所控制的量
- \(\bar{M}^Y_{k,F}(N)\)——shell-level 的 averaged margin；所有 MJ3/MJ4 表述都按此 averaged 口径
- \(B_A(N)\)——bulk window 对 \(\bar{c}_h(N)\) 的贡献；证明策略：先控制 \(B_A\)，再用 bulk-window reduction 消去 tail
§2 Turning Point 消除（Blocks 12–13）
2.1 sf+ss 合并（Block 12）
| Ω | sf-only（Paper XLI） | sf+ss（Block 12） | σ |
|---|---|---|---|
| 7 | −0.016 (−1.2σ) | +0.136 ± 0.006 | 24.0 |
| 8 | −0.088 (−3.8σ) | +0.119 ± 0.006 | 18.5 |
2.2 hp cores（Block 13）
| Ω | sf+ss (σ) | hp (σ) |
|---|---|---|
| 7 | +0.136 (24.0) | +0.252 (33.7) |
| 8 | +0.119 (18.5) | +0.100 (11.3) |
§3 完整正斜率谱与 \(V_k = O(1)\)
3.1 M̄ 正斜率谱（sf+ss+hp，Ω=2–8）
| Ω | sf (σ) | ss (σ) | hp (σ) |
|---|---|---|---|
| 2 | +0.173 (>10) | +0.135 (4.4) | — |
| 3 | +0.220 (11.9) | +0.247 (16.6) | +0.284 (2.4) |
| 4 | +0.171 (10.8) | +0.300 (16.2) | +0.259 (16.7) |
| 5 | +0.185 (20.2) | +0.414 (31.3) | +0.388 (15.6) |
| 6 | +0.111 (10.8) | +0.231 (17.6) | +0.039 (2.6) |
| 7 | — | +0.136 (24.0) | +0.252 (33.7) |
| 8 | — | +0.119 (18.5) | +0.100 (11.3) |
3.2 \(V_k = O(1)\)（Block 14）
| Ω | ⟨V⟩ | median | V slope |
|---|---|---|---|
| 2 | 0.60 | 0.49 | +0.228 |
| 3 | 0.38 | 0.25 | +0.162 |
| 4 | 0.26 | 0.17 | +0.126 |
| 5 | 0.93 | 0.81 | +0.274 |
| 6 | 1.28 | 1.23 | +0.192 |
| 7 | 1.25 | 1.19 | +0.009（STABLE） |
| 8 | 1.05 | 1.03 | −0.063（DECLINING） |
\(V_k\) 饱和于 ~1.0–1.3。Paper XXXIV 的 V ≈ 1.4 是全谱饱和值。
§4 H' 闭合路线：数学框架
4.1 Bulk-Window Reduction Theorem
定理。若对每个固定 \(A > 0\)，\(B_A(N) := \sum_{k \leq K_A(N)} h^{\mathrm{har}}_k(N)\,\bar{c}_k(N) \to 0\)，则 \(\bar{c}_h(N) \to 0\)。
证明。写成 \(\bar{c}_h = B_A + T_A\)，其中 \(T_A := \sum_{k > K_A} h^{\mathrm{har}}_k\,\bar{c}_k\)。因为 \(0 \leq \bar{c}_k \leq 1\)，有 \(T_A \leq \sum_{k > K_A} h^{\mathrm{har}}_k\)。由 harmonic Sathe–Selberg 渐近，在 bulk window 内实际 shell weight 可由参数 \(\lambda\) 的 Poisson surrogate 统一逼近；特别地，\(\sum_{k > K_A} h^{\mathrm{har}}_k \leq P(\mathrm{Pois}(\lambda) > K_A) + o_A(1)\)。于是 \(\limsup \bar{c}_h \leq \limsup B_A + (1-\Phi(A))\)。由于 \(A\) 任意，取 \(A\) 足够大即可使 \(1-\Phi(A) < \varepsilon\)。∎
4.2 Uniform Weighted Log-Moment Lemma（theorem-level）
引理。对固定 \(A > 0\)，存在 \(N_0(A)\)，\(C_A\)，使当 \(N \geq N_0(A)\)，\(1 \leq k \leq K_A(N)\) 时：
$$\frac{W_k(N)}{S_k(N)} \leq \frac{1}{(\log N)^2} + C_A \cdot \left(\frac{5}{6}\right)^k$$
\(\rho_A = 5/6\) 显式；\(N_0(A) \geq \exp\exp(16A^2)\)。
证明梗概。（a）Harmonic Sathe–Selberg 上下界（Lichtman [4] Theorem 1.3）。（b）Partial summation: \(W_k = S_k/(\log N)^2 + 2\int S_k(t)/(t(\log t)^3)\,dt\)。（c）小 \(t\) 段：\(I_1/S_k \leq (a_+/(a_-(\log 2)^2))(5/6)^k\)。（d）大 \(t\) 段：\(I_2/S_k \leq (e\,a_+/a_-)(5/6)^k\)。（e）小 \(k\) 例外：\(W_k/S_k \leq C_0(5/6)^k\)。（f）合并。∎
4.3 Successor-Reset Exact Identity
定理（DP exact consequence）。对所有 \(n \geq 2\)：
（R1）\(J_{n+1} \leq (1 - \Delta M_n)^+\)
若 \(J_n > 0\)（当前步发生 jump），则精确等式：
（R2）\(J_{n+1} = (1 - \Delta M_n)^+\)
证明。由 \(\rho_E(n) = \min(\rho_E(n{-}1)+1,\,M_n)\)：若 \(J_n > 0\) 则 \(S_n > M_n\)，故 \(\rho_E(n) = M_n\)，\(S_{n+1} = M_n + 1\)。于是 \(J_{n+1} = (S_{n+1} - M_{n+1})^+ = (1 - \Delta M_n)^+\)。∎
4.4 Averaged Transfer Lemma（条件性）
对 family \(F\) 与 bulk shell \(Y_{k,F}(N)\)，记 \(L := L^Y\)，\(J := J^Y\)，\(\bar{M} := \bar{M}^Y\)，\(\bar{c} := \bar{c}^Y\)。Cantelli 在 shell-level 上给出 \(\bar{c} \leq V^*_F/(V^*_F + \bar{M}^2)\)。再假设 averaged Margin-from-Jump lower bound：\(\bar{M} \geq \alpha_F L - \beta_F - \gamma_F J\)。
引理。\(\bar{c}\,L^2 \leq a_F + b_F J^2\)，其中 \(a_F := \max(16\beta_F^2/\alpha_F^2,\;4V^*/\alpha_F^2)\)，\(b_F := 16\gamma_F^2/\alpha_F^2\)。
证明（三情形）。情形 1：\(L \leq 4\beta/\alpha\)。直接 \(\bar{c} \leq 1\)，故 \(\bar{c}\,L^2 \leq 16\beta^2/\alpha^2\)。情形 2：\(L > 4\beta/\alpha\) 且 \(\gamma J \leq \alpha L/4\)。由 averaged MJ 下界，\(\bar{M} \geq \alpha L/2\)。Cantelli: \(\bar{c} \leq 4V^*/(\alpha^2 L^2)\)，故 \(\bar{c}\,L^2 \leq 4V^*/\alpha^2\)。情形 3：\(L > 4\beta/\alpha\) 且 \(\gamma J > \alpha L/4\)。仍有 \(\bar{c} \leq 1\) 且 \(L^2 < 16\gamma^2 J^2/\alpha^2\)，故 \(\bar{c}\,L^2 \leq 16\gamma^2 J^2/\alpha^2\)。合并得结论。∎
4.5 从 Averaged Transfer Lemma 到 \(B_A \to 0\)
由 §4.4，\(\bar{c}^Y \leq (a_F + b_F(J^Y)^2) \cdot W^Y/S^Y\)。Closing problem 在此进一步归约为对 \(J^2\) 的 weighted second moment 控制，单独记为第三个 residual input：
（NI3）对每个 fixed \(A > 0\)，存在关于 \(k\) 的多项式 \(P_F(k)\)，使得当 \(N\) 充分大且 \(k \leq K_A(N)\) 时，\((J^Y_{k,F}(N))^2 \leq P_F(k)\)。
在 NI3 下，配合 §4.2 的 Weighted Log-Moment Lemma：
$$B_A \leq \frac{\mathrm{poly}(\log\log N)}{(\log N)^2} + \mathrm{poly}(\log\log N) \cdot (\log N)^{-1/6} \to 0$$
配合 §4.1 的 Bulk-Window Reduction：\(\bar{c}_h(N) \to 0\)，conditional on NI1–NI3。
§5 Frontier Identification 与条件闭合
5.1 Margin-from-Jump Lower Bound
后文真正需要的是 shell-level averaged version。对 family \(F\) 与 bulk complement \(Y_{k,F}(N)\)，建立：
$$\bar{M}^Y \geq \alpha_F L^Y - \beta_F - \gamma_F J^Y$$
由 Paper XVI 的 insertion identity，在 shell-level 平均后写为 \(\bar{M}^Y = E_{I_{k,F}}[J(m)\mathbf{1}_Y] + E_{I_{k,F}}[K_p(m)\mathbf{1}_Y] + O(1)\)。因此，closing（ATL3）归约为两个 averaged frontier：insertion source（MJ3）和 bridge cost（MJ4）。MJ5 与 MJ6 仍是重要的结构 companion，但不再属于最小闭合链的必要输入。
5.2 四条 Frontier Lemmas
Lemma MJ3（Insertion Non-Compression，averaged）。\(E_{I_{k,F}}[J(m)\mathbf{1}_Y] \geq \alpha_F L^Y - \beta^{(1)}_F\)。归约：MJ3 ← SPS ← conditioning penalty + scale-shift penalty（§5.3）。
Lemma MJ4（Averaged Bridge Lower Bound）。\(E_{I_{k,F}}[K_p(m)\mathbf{1}_Y] \geq -\beta^{(2)}_F - \gamma_F J^Y\)。Paper XLIII draft 给出远强于所需的数值证据；本文将其记为残余输入 NI2。
Lemma MJ5（Successor-Reset Drift）。\(E[(J_{t+1}-U)^+ \mid G_t] \leq \theta_F(J_t-U)^+ + C_F\xi_t\)。继续刻画 self-correction 的定量强度；在 BRS 路线下不再是 H' 最小闭合链的必要输入。
Lemma MJ6（HP Seed Isolation）。把 hp 家族的 bookkeeping 误差吸收到 \(\gamma_F J^Y\) 与 \(O(1)\) 常数项中，将 hp 纳入与 sf/ss 相同的 averaged framework。在本文主链中只起框架对齐作用。
5.3 SPS 与 Scale-Shift Penalty
Lemma SPS（Small-Prime Shell Stability）。分解：
$$\mu^Y(N/p,p) - \mu^Y(N) = [\mu^Y(N/p,p) - \mu^Y(N/p)] + [\mu^Y(N/p) - \mu^Y(N)]$$
第一项 = conditioning penalty（由 Cauchy–Schwarz + NI1 证明）；第二项 = scale-shift penalty（由 BRS 路线解决）。
5.4 Block-Roughness Stability Theorem（BRS）
定理（BRS）。在 family-wise bulk shell \(Y_{k,F}(X)\) 上取 harmonic 概率测度 \(\nu\)，设 \(\mathrm{Var}_\nu(G_F) \leq V^*_F\)。则对任意可测子集 \(A \subseteq Y_{k,F}(X)\)，记 \(\delta_A = \nu(A)\)：
$$|\mu_A - \mu^Y| \leq \sqrt{V^*_F} \cdot \sqrt{\frac{1-\delta_A}{\delta_A}} \qquad \text{(BRS)}$$
证明。令 \(Y = G_F\)，\(\mu = E[Y]\)，\(I_A = \mathbf{1}_A\)。\(\delta_A(\mu_A - \mu) = E[(Y-\mu)I_A] = E[(Y-\mu)(I_A-\delta_A)]\)。由 Cauchy–Schwarz：\(|\delta_A(\mu_A-\mu)| \leq \sqrt{\mathrm{Var}(Y)}\cdot\sqrt{\delta_A(1-\delta_A)}\)。除以 \(\delta_A\) 得（BRS）。∎
推论（S4-weak）。取 \(A = T_{k,F}(X;p)\)（top slice），由 S4a：\(\delta_A \leq \kappa/\log X\)。代入 S4 代数恒等式：
$$|\mu^Y(X/p) - \mu^Y(X)| \leq \sqrt{V^*_F}\cdot\sqrt{\delta/(1-\delta)} \ll (\log X)^{-1/2} \to 0 \qquad \text{(S4-weak)}$$
这比 MJ3/SPS 所需的"有界 scale-shift penalty"更强——它趋向零。
5.5 完整闭合链（conditional on NI1–NI3）
MJ3 + NI2 ⟹ (ATL3) ⟹ Averaged Transfer Lemma
Averaged TL + NI3 + Weighted Lemma ⟹ B_A → 0 ⟹ Bulk-Window Reduction ⟹ c̄_h → 0
Paper XLII 给出的不是"H' 已 theorem-level closed"，而是一个条件闭合路线：一旦 NI1–NI3 全部成立，H' 即随之成立。
5.6 已完成的 Relay Algebra（Paper XVI，theorem-level）
- Exact insertion identity: \(G_{\mathrm{spf}}(pm) = j(m) + K_p(m)\)
- Bridge identity: \(K_p = A(pm) + B(pm) - A(m)\)
- \(A \geq -1\)，\(B \leq 0\)；当 \(v_{P^-} = 1\) 时，\(B \in [-2(k-1),0]\)
- B-noise closure：Paper XX 无条件证明 \(\mathrm{Var}(B) = O_k(1)\)
5.7 论证链完整状态
| 步骤 | 内容 | 状态 | 备注 |
|---|---|---|---|
| Bulk-Window Reduction | §4.1 | proved | — |
| Weighted Log-Moment Lemma | §4.2，ρ=5/6 | proved | — |
| Successor-reset identity | §4.3，R1/R2 | proved | exact DP consequence |
| S4a top-slice thinness | §5.3 | proved | Sathe–Selberg |
| BRS theorem | §5.4 | proved | pure Cauchy–Schwarz |
| Shell-level Cantelli | §4.4 | proved | standard inequality |
| NI1: V*_F = O(1) | §3.2 / Paper XVIII | computationally verified | residual input |
| S4-weak | §5.4 推论 | conditional on NI1 | — |
| SPS | §5.3 | conditional on NI1 | — |
| MJ3 | §5.2 | conditional on NI1 | SPS + insertion identity |
| NI2: MJ4 bridge lower bound | §5.2 | computationally verified | residual input |
| Averaged MJ (ATL3) | §5.1 | conditional on NI1, NI2 | — |
| Averaged Transfer Lemma | §4.4 | conditional on NI1, NI2 | — |
| NI3: weighted J² bound | §4.5 | computationally verified | residual input |
| B_A → 0 | §4.5 | conditional on NI1–NI3 | — |
| H': c̄_h → 0 | — | conditional on NI1–NI3 | — |
§6 十四个实验 Block
| Block | 测量 | 结果 |
|---|---|---|
| 1 | 逐层 defect rate | Ω ≤ 6 下降 >5σ |
| 2 | 全局 c̄_h v1 | 废弃 |
| 3 | Band + c̄_h(P) | Ω=2 下降 |
| 4 | Slack collapse | 失败 |
| 5 | 全局 c̄_h v2 | 0.43 flat |
| 6 | c×(log m)² | C_k 层内常数 |
| 7 | C_k 增长律 | γ=0.503（被取代） |
| 8 | C_k×A_k 重构 | C_k ≈ V/a²；上界趋向 1 |
| 9 | 小 m vs 大 m | Cesàro 稀释 |
| 10 | Ω=7,8 sf band | Ω=7 弱正 |
| 11 | B_A(N) | 上升 |
| 12 | Ω=7,8 sf+ss | Ω=7: 24σ，Ω=8: 18.5σ |
| 13 | Ω=7,8 hp | Ω=7: 33.7σ，Ω=8: 11.3σ |
| 14 | V_k 全谱 | V_k = O(1)，饱和 ~1.3 |
§7 讨论
7.1 SAE 解释
sf-only turning point = 无记忆系统极限。ss/hp 重复因子 = 记忆锚点（8D = 11DD 记忆 + 12DD 预测）。
7.2 Successor-Reset 的 SAE 含义
（R1/R2）是 DP 的"记忆擦除"：大 jump 后系统 reset，下一步只看 \(\Delta M_n\)。这是 SAE 的凿-构循环在算术中的体现——过度偏离（jump）会被系统自动纠正（reset）。
7.3 反相关引擎的 SAE 含义
Paper XVIII 的 \(\mathrm{Cov}(\Delta f, \Delta r) \approx -\mathrm{Var}(\Delta f)\) 是一个"强制平衡"机制：加法部分（\(f\)，对应于 SAE 的"构"）的涨落被组合余项（\(r\)，对应于"凿"）精确抵消。这是 DP min 递推的代数后果，也是整个 H' 条件闭合链中最深的结构性质——它保证 \(V_k = O(1)\)，而 \(V_k = O(1)\) 通过 BRS 直接给出 scale-shift penalty → 0。
7.4 BRS 路线 vs 原始 S4b 路线
原始路线需要 S4b（top-slice bounded oscillation，\(O(1)\)），进而需要 MJ5，进而需要 tail assumption（T）。BRS 路线将 S4b 弱化为 S4b-weak（\(O(\sqrt{\log X})\)），由 \(V^*_F = O(1)\) + S4a 直接推出，完全绕过了 MJ5 和（T）。代价：S4-weak 的 penalty 是 \(O((\log X)^{-1/2})\) 而非 \(O((\log X)^{-1})\)；但 MJ3/SPS 只需要有界，所以这已经足够（且有余量，因为它趋向零）。
§8 剩余的 Numerical Inputs 与 Open Problems
8.1 三个 Numerical Inputs
（NI1）V*_F = O(1)。Paper XVIII 的反相关引擎给出结构解释；Block 14 给出强数值证据。在本文中仍被视为 residual input。
（NI2）MJ4 的 averaged bridge lower bound。Paper XLIII draft 给出远强于所需的数值证据；本文将其记录为 residual input。
（NI3）J² 的 weighted second moment bound。它与 NI1 相关但不等价：NI1 控制 variance 规模，NI3 控制的是 W 加权的 jump 二阶矩。两者必须单独列出。
将 NI1–NI3 全部提升为解析证明，构成 Paper XLII 之后最自然的 open problems。
8.2 Open Problems
- （OP1）\(V^*_F = O(1)\) 的解析证明（可能从 DP min 递推 + anti-correlation identity 推导）
- （OP2）MJ4 bridge positivity 的解析证明
- （OP3）NI3：\(J^2\) weighted second moment bound 的解析证明
- （OP4）\(a_k > 0\) 解析证明（M̄ 正斜率；独立兴趣）
- （OP5）Full S4b（\(O(1)\) bounded oscillation）——更强但非 H' 闭合所必需
- （OP6）Tail assumption（T）的解析证明——不再是 H' 闭合所必需，但有独立数论价值
§9 数据来源
十四个脚本（p42_defect_rate.py 至 p42_variance.py）。数据：rho_1e10.bin（int16，N = 10¹⁰）。
参考文献
[1] H. Qin. ZFCρ Paper XLI. DOI: 10.5281/zenodo.19201877.
[2] H. Qin. ZFCρ Paper XL. DOI: 10.5281/zenodo.19179778.
[3] H. Qin. ZFCρ Paper XXXIV. DOI: 10.5281/zenodo.19140015.
[4] J. D. Lichtman. Mertens' prime product formula, dissected. Integers 21A (2021), A17.
[5] H. Qin. ZFCρ Paper XVIII（反相关引擎）. DOI: 10.5281/zenodo.19024385.
[6] H. Qin. ZFCρ Paper XVI（Insertion Identity）. DOI: 10.5281/zenodo.19013602.
[7] H. Qin. ZFCρ Paper XVII（Roughness Stability）. DOI: 10.5281/zenodo.19016958.
[8] H. Qin. ZFCρ Paper XX（B-Noise Closure）. DOI: 10.5281/zenodo.19027892.
致谢
ChatGPT（公西华）：解析证明链主要架构师。Bulk-Window Reduction；Uniform Weighted Log-Moment Lemma（ρ=5/6）；Transfer Lemma（三段式 averaged version）；SPS conditioning penalty（Cauchy–Schwarz）；Theorem S4 shell-scale Lipschitz；S4a top-slice thinness（Sathe–Selberg）；MJ3–MJ6 frontier 拆解；Block-Roughness Stability（BRS）theorem（绕过 S4b 和（T）的关键突破）；17 分钟 review 识别五个 must-fix（口径、三段式 TL、J² bound、averaged/pointwise 层级、Poisson 表述）并给出逐段修改文本。
Claude（子路）：设计十四个 Block，编写全部脚本，起草全部文本。发现 Block 12 sf+ss 策略；Paper XLIII 四个 Block 的实验设计与数据判读；整合公西华 review 的修改文本。