← RG-SCP: The Counterexample Universe, Obstruction Covers and Self-Audits / RG-SCP 07 · Shift transport for a minimal counterexample

RG-SCP: The Counterexample Universe, Obstruction Covers and Self-Audits RG-SCP 07 · Shift transport for a minimal counterexample Author line in the source: Neo.K; Aletheia (GPT-5.6 Sol)

Minimal Counterexamples, Shift Transport, and Demand–Capacity Closure

For a hypothetical minimal counterexample N_*, lower Goldbach pairs shifted by h with M_k | h force the shifted endpoints to be p_k-rough composites, giving D_{N_*}(p_k) ≥ ν_k(N_*) (transport matching) and a 'minimality → transport → capacity' contradiction architecture; the needed crossing ν_k > U is not proved.

RG-SCP 07 turns 'all smaller even numbers succeed' into new demand lower bounds; the capacity upper bound needed for a contradiction is still unproved. 'Primorial-smooth shift' is a misnomer (it is primorial-divisible); the matching/Hall framing is over-specified (V0-07).

Connections · Connections

PreviousRG-SCP 06 · Demand–capacity inequalities · Counterexample Demand–Obstruction Capacity Inequalities

NextV0-01 · Audit of RG-SCP 01: the circular admissibility definition · RG-SCP 01 Claim / Source Audit

This is a full-text translation of the Chinese source, which remains authoritative for its research claims. Translation is not independent mathematical verification and does not upgrade the original evidence level.

Loading…