# Prior art for return #153: the signed factor algebra of `Q-global-factor-signs` Job #2551 (explore, discovery, lane formalize). Object taken: the central object of return #153 (audit, verified, @Benjaminsen) — the ledger block of `research/global-factor-signs.md`. Read at `GET /return/153`; the fetched package carries `return.json`, `global-factor-signs.revised.md`, `global-factor-signs.diff`, `report243.md`, `questions-rows.regenerated.txt` and the validator `subset_check.py` / `subset_check.out` (sha256 `d6291668…`, verified by `fetch-return`). **The block asserts three things** (the diff touches only `status` and `verdict`; the body, every estimate and the refutation are unchanged): (1) the exact factor formula `G(n) = Λ_{>W}(n) − H_W(n)F(s) − E_W(n)` and the sign rule on regular composites — a global product is negative exactly when the two `F` values have opposite signs; (2) the prime-power exceptions `E_W` paid at `O_ε(x^{39/40+ε})`; (3) the refutation of a **pair-trigger majorant** `F(s)^− ≤ K Σ_{pa}` by a ten-small-prime cell with `F = 1 − 10 + 45 − 120 = −84` while every pair lies below `a`. ## 1. The owning conventions, named before searching | part of the object | owning convention | status in this corpus | |---|---|---| | (1) the formula and `F(s)` | **iterated finite differences of a sieve weight**; vector subset convolution | **already matched.** `global-smooth-majorant.md` §7 assigns it to GKM §1.2 eqs (1.6)–(1.7) with the notation match `R = b_i`, `f(z) = χ((z log b_i − log a_i)/L_i)`, `M_f(n;R) = F̂_i(n)`; `joint-correction-source-audit.md` §1 matches Ford–Maynard Def. 7.1 / Props 7.19, 7.22 and Mounier Thm 1.1 | | (2) paying `E_W` | classical prime-power bookkeeping in a Vaughan decomposition | **already covered** — `joint-correction-source-audit.md` (1)–(4) keeps prime powers exactly and pays no separate error | | (3) *sign*, negative part, pair trigger | **Bonferroni-type inequalities / sharpened sieve inequalities** — MSC 05C65, 60C05, 05A19, 60E15, i.e. **combinatorics and probability, not number theory** | **absent from `SEARCH-CONVENTIONS.md` §1.** The file's only Bonferroni row sends the search to Boolean analysis (Hoeffding, hypercontractivity) for the *depth of the inclusion–exclusion on the CRT product* — a different object from *the sign of one coefficient* | ## 2. What the search returns **(a) Known match, identity level.** `F(s)` with a divisor-ramp profile *is* the object of Granville–Koukoulopoulos–Maynard, *Sieve weights and their smoothings*, Ann. Sci. ÉNS (4) **54** (2021) 1089–1177, Zbl 1500.11071 = arXiv:1606.06781v4, §1.2 (1.6)–(1.7): an exact iterated finite-difference identity. So §1–§2 of the note is not new algebra. Rung: **recorded** by the corpus already; re-confirmed here at the paper's abstract page. **(b) Known match, phenomenon level — and the corpus is missing the one published quantity that predicts it.** GKM's own abstract (read at `https://arxiv.org/abs/1606.06781v4`) states that the main contribution to the `2k`-th moment of a partially smoothed divisor sum of `μ` comes from integers with only large prime factors *only while `2k` is small compared with the smoothing level `A`*, with the explicit threshold A = (1/(2k))·C(2k,k) − 1 , above which the main contribution comes "from integers with quite a few prime factors, which is not the intention when designing sieve weights". That is exactly §3's phenomenon — a **designed lower-order trigger defeated by higher-order subset structure** — published, quantified. The corpus cites `1606.06781` in six files, always for §1.2 (1.6)–(1.7) / Thms 1.3, 10.2, 10.4 / Lemma 10.3, and **never once for this threshold** (grep over the served snapshot, 2026-09-19). Rung: **inspected** at the abstract; the citation pattern is a grep, **measured**. **(c) The refutation is a corollary of classical Bonferroni non-vacuity.** With the note's own two-threshold ramp (`ρ = 1` on every subset of size `≤ m−1`, `ρ = 0` on every subset of size `≥ m`), the complete subset sum (2) *is* the partial alternating binomial sum, so F(s) = Σ_{j