> Full-text translation from Chinese. The original remains authoritative for its research claims; this translation is not independent mathematical verification. # RG-SCP Validation Round 01 ## RG-SCP 01 Claim / Source Audit ### Claim Classification, Source Deduplication, and Validation Boundaries for Counterexample Universe and Minimal Failure State **Validation series:** RG-SCP Validation **Validation phase:** V0 — Claim / Source Audit **Round:** 01 **Source paper:** RG-SCP 01, Counterexample Universe and Minimal Failure State, v0.1 **Date:** 2026-09-28 **Version:** v0.1 **Authors:** Neo.K; Aletheia (GPT-5.6 Sol) **Document type:** Canonical Audit / Theorem-Source Ledger **Status:** First-phase audit; no new Goldbach number-theoretic claims --- ## Abstract This document conducts the first claim/source audit of RG-SCP 01, Counterexample Universe and Minimal Failure State. This round does not attempt to add new theorems, nor conduct large-scale computation. Its sole objective is to divide the source paper's content into: $$ \boxed{ \mathrm T = \text{Exact Theorem} } $$ $$ \boxed{ \mathrm E = \text{Equivalent Reformulation} } $$ $$ \boxed{ \mathrm H = \text{Heuristic / Empirical} } $$ $$ \boxed{ \mathrm O = \text{Open Target} } $$ and: $$ \boxed{ \mathrm F = \text{Framework / Definition} } $$ the five classes displayed above. At the same time, label every claim with its source class: $$ \mathcal S_0 = \text{Elementary Arithmetic / Logic}, $$ $$ \mathcal S_1 = \text{Prime / Factor Structure}, $$ $$ \mathcal S_2 = \text{Finite Quotient / Wheel}, $$ $$ \mathcal S_3 = \text{Fixed-Point Relational Organization}, $$ $$ \mathcal S_4 = \text{Additive History / Minimality}, $$ $$ \mathcal S_5 = \text{External Analytic Number Theory}, $$ $$ \mathcal S_6 = \text{Heuristic Approximation / Skew}. $$ The conclusions of this audit follow. First, the core mathematically valid content of RG-SCP 01 mainly belongs to: $$ \mathcal S_0. $$ It establishes a counterexample universe, minimal counterexample, admissibility filtration, and proof-channel discipline. Second, RG-SCP 01 itself adds no theorem about prime distribution, Goldbach density, M6, wheels, or spectral structure. Third, existence of the minimal counterexample: $$ N_* = \min\mathcal C_G $$ after assuming: $$ \mathcal C_G\neq\varnothing $$ uses only well-ordering of the natural numbers, and is therefore a wholly elementary exact theorem. Fourth: $$ \mathcal C_G=\varnothing $$ is only a logically equivalent reformulation of standard binary Goldbach, and should not be listed as a new proof achievement. Fifth, the admissibility filtration: $$ \mathcal A_0 \supseteq \mathcal A_1 \supseteq \cdots $$ is a research framework. It has proof meaning only when, at every step, one can prove: $$ \mathcal C_G \subseteq \mathcal A_k $$ the inclusion displayed above. Therefore: $$ \mathcal A_k $$ the genuine proof obligation is not that it 'looks increasingly small', but: $$ \boxed{ \text{Soundness} : \mathcal C_G\subseteq\mathcal A_k. } $$ Sixth, the core most worth formalizing in this paper is not Goldbach itself, but: 1. The counterexample set; 2. Minimal-counterexample existence; 3. The predecessor-success property of minimality; 4. The admissibility-refinement soundness schema. The final assessment of this round: $$ \boxed{ \text{RG-SCP 01 = PASS as framework foundation} } $$ But its theorem novelty should remain conservative: $$ \boxed{ \text{framework novelty} \neq \text{new Goldbach theorem}. } $$ --- # 1. Object of the Audit This round audits only: # RG-SCP 01 ## Counterexample Universe and Minimal Failure State: From Direct Proof to Structural Admissibility Compression It does not audit: - RG-SCP 02 obstruction cover; - RG-SCP 03 M6 / wheel; - RG-SCP 04 fixed point; - RG-SCP 05 heuristic; - RG-SCP 06 demand-capacity; - RG-SCP 07 minimality transport; - RG-SCP 08 synthesis. This is deliberate. Auditing sources across all papers at once can easily feed sources introduced only in later papers back into earlier ones. --- # 2. Canonical Goldbach predicate Define: $$ G(N) : \Longleftrightarrow \left[ N\ge4 \land N\equiv0\pmod2 \right] \Rightarrow \exists p,q\in\mathbb P, \quad N=p+q. $$ The more commonly used global form: $$ \boxed{ G : \forall N\ge4, \quad N\equiv0\pmod2 \Longrightarrow \exists p,q\in\mathbb P, \quad N=p+q. } $$ This is the research target, not a new theorem proposed by RG-SCP 01. Claim class： $$ [\mathrm F] $$ Source： $$ \mathcal S_0 + \text{standard prime predicate}. $$ --- # 3. Goldbach representation count RG-SCP 01 defines: $$ R_G(N) = \#\left\{ p\in\mathbb P: 2\le p\le N-2, \quad N-p\in\mathbb P \right\}. $$ This is a counting convention ordered by first input. If: $$ R_G(N)>0, $$ then a Goldbach pair exists. If: $$ R_G(N)=0, $$ then no Goldbach pair exists. Therefore: $$ \boxed{ G(N) \Longleftrightarrow R_G(N)>0 } $$ holds within the admissible even domain. Claim class： $$ [\mathrm E]. $$ Reason: This only rewrites an existential statement as positivity of a count. --- # 4. Failure predicate Define: $$ F_G(N) = 1 \Longleftrightarrow R_G(N)=0. $$ Or, as a proposition: $$ F_G(N) : \Longleftrightarrow R_G(N)=0. $$ Claim class： $$ [\mathrm F]. $$ There is no theorem novelty. --- # 5. Counterexample universe Define: $$ \boxed{ \mathcal C_G = \left\{ N\in2\mathbb N: N\ge4, \quad R_G(N)=0 \right\}. } $$ Claim class： $$ [\mathrm F]. $$ Source： $$ \mathcal S_0. $$ --- # 6. Goldbach and Counterexample-Universe Emptiness RG-SCP 01 uses: $$ \boxed{ G \Longleftrightarrow \mathcal C_G=\varnothing. } $$ Claim class： $$ [\mathrm E]. $$ This is exact, but only a logical equivalence. It cannot be labeled: $$ [\mathrm T_{\mathrm{new}}]. $$ Proof source： $$ \mathcal S_0. $$ --- # 7. Counterexample-universe nonemptiness The negation of Goldbach: $$ \neg G $$ is equivalent to: $$ \mathcal C_G\neq\varnothing. $$ Claim class： $$ [\mathrm E]. $$ There is no additional number-theoretic content. --- # 8. Minimal counterexample existence If: $$ \mathcal C_G\neq\varnothing, $$ and: $$ \mathcal C_G\subseteq\mathbb N, $$ then by well-ordering of the natural numbers: $$ \boxed{ N_* = \min\mathcal C_G } $$ exists. Claim class： $$ [\mathrm T]. $$ Source： $$ \boxed{ \mathcal S_0 } $$ Only the following are needed: - nonemptiness of the set; - being a subset of the natural numbers; - the well-ordering principle. The following are not needed: - prime distribution; - sieve methods; - M6; - analytic number theory. --- # 9. Minimality predecessor-success theorem From: $$ N_*=\min\mathcal C_G $$ we obtain: If: $$ 4\le M0. } $$ In formal terms: $$ \boxed{ \forall M0. } $$ Claim class： $$ [\mathrm T]. $$ Source： $$ \mathcal S_0. $$ This is the foundation of the additive-history source in subsequent RG-SCP 07. But in RG-SCP 01 itself it is still only a direct consequence of minimality. --- # 10. Is Minimality a New Source? Two levels must be distinguished. In RG-SCP 01: $$ N_* = \min\mathcal C_G $$ is only an elementary logical construction. But when subsequent work uses: $$ \forall M0 $$ to construct a transport graph, it becomes: $$ \mathcal S_4 = \text{Additive History / Minimality Source}. $$ Thus the source classification should record: ```text RG-SCP 01: minimality_source_defined: yes minimality_source_exploited_nontrivially: no ``` The genuinely nontrivial use occurs in RG-SCP 07. --- # 11. Goldbach fiber RG-SCP 01 defines: $$ \mathcal F_N = \left\{ (x,y)\in\mathbb N^2: x+y=N \right\}. $$ and: $$ \mathcal F_N^{\mathbb P} = \mathcal F_N \cap (\mathbb P\times\mathbb P). $$ We have: $$ \boxed{ R_G(N)>0 \Longleftrightarrow \mathcal F_N^{\mathbb P}\neq\varnothing. } $$ Claim class： $$ [\mathrm E]. $$ This is a coordinate change. --- # 12. Fiber emptiness form Failure is equivalent to: $$ \boxed{ F_G(N)=1 \Longleftrightarrow \mathcal F_N^{\mathbb P}=\varnothing. } $$ Claim class： $$ [\mathrm E]. $$ There is no new proof information. --- # 13. Complement involution Define: $$ C_N(x)=N-x. $$ On the admissible additive domain: $$ C_N(C_N(x))=x. $$ Thus: $$ C_N $$ is an involution. Claim class： $$ [\mathrm T]. $$ But the theorem complexity is extremely low. Source： $$ \mathcal S_0. $$ --- # 14. Prime-sector self-avoidance RG-SCP 01 describes failure as: $$ C_N(\mathbb P) \cap \mathbb P = \varnothing $$ on an appropriate finite domain. Claim class： $$ [\mathrm E]. $$ This is only the complement-map representation of Goldbach failure. --- # 15. Structural admissibility RG-SCP 01 defines a constraint family: $$ \mathcal K_k = \left\{ K_1,\ldots,K_k \right\}. $$ and defines: $$ \mathcal A_k $$ as the admissible state space satisfying the failure hypothesis and current constraints. An important correction is needed here. If: $$ \mathcal A_k $$ directly includes, in its definition: $$ F_G(N)=1, $$ then: $$ \mathcal A_k $$ is only a re-description of a subset of counterexamples. This is not convenient enough for theorem search. A better canonical version should define: $$ \mathcal A_k $$ as 'even candidates satisfying all proved counterexample-necessary constraints'. That is: $$ \boxed{ \mathcal A_k = \left\{ N\in2\mathbb N_{\ge4}: K_1(N) \land\cdots\land K_k(N) \right\}. } $$ and require soundness: $$ \boxed{ \mathcal C_G \subseteq \mathcal A_k. } $$ Only then: $$ \mathcal A_k $$ is an outer approximation to the counterexample universe. --- # 16. The First Canonical Correction to RG-SCP 01 Some passages of the source paper put: $$ F_G(N)=1 $$ directly into: $$ \mathcal A_k $$ the set definition. If this formulation is retained, then: $$ \mathcal A_k $$ cannot be independently computed or approximated without knowing a counterexample. This audit therefore proposes correcting the canonical admissibility definition to: $$ \boxed{ \mathcal A_k = \left\{ N\in2\mathbb N_{\ge4}: \bigwedge_{i=1}^{k}K_i(N) \right\}. } $$ and retaining separately the proof obligation: $$ \boxed{ F_G(N)=1 \Longrightarrow \bigwedge_{i=1}^{k}K_i(N). } $$ Therefore: $$ \mathcal C_G \subseteq \mathcal A_k. $$ --- # 17. Why This Correction Matters Without correction, 'compressing the admissible space to emptiness' actually uses: $$ F_G. $$ circularly. After correction, every: $$ K_i $$ must be an independently checkable constraint. Only in this way: $$ \mathcal A_k=\varnothing $$ can genuinely imply: $$ \mathcal C_G=\varnothing. $$ This is the most important audit correction of this round. --- # 18. Admissibility refinement If: $$ K_{k+1} $$ is a new necessary condition, then: $$ \mathcal A_{k+1} = \mathcal A_k \cap \left\{ N: K_{k+1}(N) \right\}. $$ Thus: $$ \boxed{ \mathcal A_{k+1} \subseteq \mathcal A_k. } $$ Claim class： $$ [\mathrm T] $$ provided the sets are defined in the way above. Source： $$ \mathcal S_0. $$ --- # 19. Soundness obligation The most important proof obligation: $$ \boxed{ \mathcal C_G \subseteq \mathcal A_k. } $$ Equivalently: $$ \boxed{ F_G(N)=1 \Longrightarrow K_i(N) } $$ for all: $$ i\le k $$ holds for all such indices. If some: $$ K_i $$ is only heuristic, it cannot enter the canonical: $$ \mathcal A_k^{\mathrm{proof}}. $$ --- # 20. Proof admissibility vs heuristic admissibility Thus two spaces should be distinguished. ## Proof admissibility $$ \boxed{ \mathcal A_k^{\mathrm P} = \left\{ N: \bigwedge_i K_i^{\mathrm{proof}}(N) \right\}. } $$ satisfying: $$ \mathcal C_G \subseteq \mathcal A_k^{\mathrm P}. $$ ## Heuristic candidate space $$ \boxed{ \mathcal A_k^{\mathrm H} = \left\{ N: \bigwedge_j H_j(N) \right\}. } $$ But one cannot generally guarantee: $$ \mathcal C_G \subseteq \mathcal A_k^{\mathrm H}. $$ --- # 21. The Second Canonical Correction The RG-SCP 01 source paper already distinguishes proof and heuristic channels, but this round proposes also separating the admissibility notation directly into: $$ \boxed{ \mathcal A^{\mathrm P} } $$ and: $$ \boxed{ \mathcal A^{\mathrm H}. } $$ to prevent a later heuristic filter from inadvertently being treated as a counterexample-necessary condition. --- # 22. Counterexample admissibility volume The source paper defines, on a finite domain: $$ V_G(k;B) = \left| \mathcal A_k\cap D_B \right|. $$ If the canonical correction is adopted, this should become: $$ \boxed{ V_G^{\mathrm P}(k;B) = \left| \mathcal A_k^{\mathrm P} \cap D_B \right|. } $$ This is the proof-admissible candidate volume. If: $$ V_G^{\mathrm P}(k;B)=0, $$ one can infer only: $$ \mathcal C_G \cap D_B = \varnothing. $$ It cannot imply global Goldbach. Claim class： $$ [\mathrm T]. $$ --- # 23. Global closure criterion If: $$ \mathcal C_G \subseteq \mathcal A_k^{\mathrm P} $$ and: $$ \mathcal A_k^{\mathrm P} = \varnothing, $$ then: $$ \boxed{ \mathcal C_G=\varnothing. } $$ Claim class： $$ [\mathrm T]. $$ Source： $$ \mathcal S_0. $$ This is pure set theory. --- # 24. This Is Not a Goldbach-Specific Theorem It is worth making explicit: The closure criterion above holds for any conjecture. If a target counterexample set: $$ \mathcal C $$ is contained in a proof-admissible superset: $$ \mathcal A $$ as displayed above, and: $$ \mathcal A=\varnothing, $$ then: $$ \mathcal C=\varnothing. $$ it is therefore a generic proof architecture. --- # 25. Quantifier residual RG-SCP 01 introduces: $$ R_Q(k) $$ as the global proof burden not yet absorbed. This is not a single mathematical quantity currently possessing a standard precise definition. Thus: $$ R_Q(k) $$ currently has claim class: $$ [\mathrm F/H]. $$ unless a formal definition is subsequently given. Theorem-level arithmetic cannot be performed on: $$ R_Q(k) $$ the quantity displayed above, until it is defined precisely. --- # 26. Serialization state RG-SCP 01 proposes: $$ \mathfrak G_k $$ or counterexample-state serialization. This is a research-engineering architecture. Claim class： $$ [\mathrm F]. $$ It has no number-theoretic proof content. But it is very valuable for long-term AI / formal verification. --- # 27. 'A Counterexample Must Pay Its Cost of Existence' This sentence is a research principle. If it is written as: $$ F_G(N)=1 \Longrightarrow K_1(N)\land K_2(N)\land\cdots $$ and every: $$ K_i $$ is proved, then it is an exact consequence chain. But 'high cost' itself has no formal meaning. Thus: ```text existence cost ``` in RG-SCP 01 should be labeled: $$ [\mathrm F]. $$ until it is quantified subsequently by demand / capacity. --- # 28. 'Anomaly Is Not Contradiction' RG-SCP 01 emphasizes: $$ \text{unlikely} \neq \text{impossible}. $$ $$ \text{low density} \neq \text{empty}. $$ $$ \text{no observed example} \neq \text{global exclusion}. $$ These are proof-discipline principles. Claim class： $$ [\mathrm F]. $$ They are very important, but not number-theory theorems. --- # 29. Source audit summary The sources used by RG-SCP 01: ## $\mathcal S_0$ Extensive use of: - logic; - set theory; - well-ordering of the natural numbers; - finite counting; - implication. ## $\mathcal S_1$ Appears only through the standard prime predicate. No new factor theorem is used. ## $\mathcal S_2$ No substantial wheel use. ## $\mathcal S_3$ Only a fixed-point interface is reserved. ## $\mathcal S_4$ The minimality source is defined, but not yet used nontrivially. ## $\mathcal S_5$ Analytic number theory is not used. ## $\mathcal S_6$ Heuristics need not be used. --- # 30. Source-Novelty Assessment The novelty of RG-SCP 01 is not in a number-theoretic source. It is: $$ \boxed{ \text{proof-state architecture novelty}. } $$ That is: $$ \text{counterexample universe} \to \text{admissibility filtration} \to \text{certificate discipline}. $$ Thus it should not be described externally as: > A new Goldbach theorem. More precisely: > A new reverse-closure research architecture. --- # 31. Formalization priority Four items in RG-SCP 01 are worth formalizing first. ## F01 Counterexample set: $$ \mathcal C_G. $$ ## F02 Minimal-counterexample existence under a nonemptiness assumption. ## F03 Minimality predecessor-success theorem. ## F04 Generic admissibility soundness: If: $$ \forall N, \quad F_G(N)\Rightarrow K_i(N), $$ then: $$ \mathcal C_G \subseteq \mathcal A_k^{\mathrm P}. $$ --- # 32. Content Not Requiring Priority Formalization For now, the following are not needed: - existence-cost rhetoric; - the quantifier-residual symbol; - normalized admissibility volume; - the heuristic-state schema. Reason: They are not the elementary proof spine. --- # 33. Canonical theorem ledger — RG-SCP 01 | ID | Claim | Class | Source | Status | |---|---|---|---|---| | R01-T01 | Nonempty $\mathcal C_G$ has a least element $N_*$ | T | $\mathcal S_0$ | PASS | | R01-T02 | Admissible even $M Is the target predicate being smuggled into the candidate-space definition, followed by a claim that the candidate space has been emptied? If the original: $$ F_G(N)=1 $$ is put directly into: $$ \mathcal A_k, $$ this makes the admissibility framework less suitable for independent validation. Thus correction C01 should be treated as canonical. After correction, the circularity risk is substantially reduced. --- # 36. Oracle leakage audit RG-SCP 01 has not yet established a computational probe, so there is no direct oracle leakage. But if a future implementation computes: $$ \mathcal A_k^P, $$ it must not read: $$ R_G(N) $$ as a filter. The truth channel may only be compared afterward. --- # 37. Minimality source leakage If subsequent work uses: $$ N_* $$ as a hypothetical minimal counterexample, one may use: $$ M0 $$ since this is a legitimate consequence of the minimality assumption. But one must not use: $$ R_G(N_*)=0 $$ to construct a supposedly independent capacity bound, and then treat that bound as external evidence. Provenance labeling is needed. --- # 38. Independent proof value Almost all content in RG-SCP 01 that can genuinely be reconstructed independently is elementary logic. Thus the value of cross-AI reconstruction is mainly: - checking consistency of definitions; - checking circularity; - checking the direction of set inclusion. There is no need to spend large-model quota reproving well-ordering. --- # 39. The First Formal Checkpoint Suggested: ```yaml checkpoint: id: RG-SCP-V0-R01 source_paper: RG-SCP-01 theorem_count_pass: 4 equivalence_count_pass: 3 canonical_corrections: 3 heuristic_promotions: 0 source_novelty: number_theory: none research_architecture: yes circularity_status: repaired_by_C01 formalization_ready: true ``` --- # 40. Validation verdict The verdict on RG-SCP 01: $$ \boxed{ \mathrm{PASS} } $$ But it must include: $$ \boxed{ \mathrm{PASS} \text{ as framework foundation} } $$ rather than: $$ \boxed{ \mathrm{PASS} \text{ as new Goldbach theorem}. } $$ --- # 41. The Most Important Conclusion of This Round If only one point is retained, it is: $$ \boxed{ \mathcal A_k \text{must be an independently verifiable outer approximation to the counterexample universe, not embed }F_G\text{ itself into its definition.} } $$ Thus the canonical proof architecture should be fixed as: $$ F_G(N)=1 \Longrightarrow K_1(N)\land\cdots\land K_k(N), $$ Then define: $$ \mathcal A_k^P = \left\{ N: K_1(N)\land\cdots\land K_k(N) \right\}. $$ From this: $$ \boxed{ \mathcal C_G \subseteq \mathcal A_k^P. } $$ Only if one can prove in future: $$ \boxed{ \mathcal A_k^P=\varnothing, } $$ does one obtain: $$ \boxed{ \mathcal C_G=\varnothing. } $$ This is the noncircular core that RG-SCP reverse closure must maintain. --- # 42. The Next Round V0 Round 02 should audit only: # RG-SCP 02 ## Goldbach Failure Obstruction Cover Focus: 1. Is a total proper obstruction map genuinely equivalent to failure? 2. Domain boundaries of the least-prime-factor partition; 3. Is the reduced-half domain fully equivalent? 4. Are raw covers and canonical partitions being conflated? 5. Is the obstruction source only a reformulation of a compositeness witness? 6. Which quantities genuinely deserve to enter the formal core? Do not audit RG-SCP 03 ahead of its turn. --- # Appendix A: Canonical Claim Records ```yaml - id: R01-T01 class: T statement: nonempty counterexample set has a least element source: [S0] proof_status: pass formalization_priority: high - id: R01-T02 class: T statement: all legal smaller even numbers below N_star are Goldbach-success source: [S0, S4-definition] proof_status: pass formalization_priority: high - id: R01-E01 class: E statement: Goldbach iff counterexample universe is empty source: [S0] proof_status: pass novelty: reformulation - id: R01-C01 class: correction statement: define proof-admissible candidate space without embedding F_G in the set predicate status: canonicalize - id: R01-O01 class: O statement: some proof-admissible finite-stage candidate space becomes globally empty proof_status: open ``` --- # Appendix B: Source Signature ```yaml RG-SCP-01: S0_elementary: true S1_factor: standard-prime-predicate-only S2_quotient: false S3_fixed_point: interface-only S4_minimality: defined_not_exploited S5_analytic: false S6_heuristic: false novelty: arithmetic_source: none relational_source: minimality-interface architecture: reverse-closure-admissibility ``` --- # Appendix C: Formalization Sketch ```text namespace RGSCP def GoldbachSuccess (N : Nat) : Prop := ... def Counterexample (N : Nat) : Prop := ... def CounterexampleSet : Set Nat := ... theorem goldbach_iff_counterexampleSet_empty : ... theorem minimal_counterexample_exists (h : CounterexampleSet.Nonempty) : ∃ Nstar, Nstar ∈ CounterexampleSet ∧ ∀ M < Nstar, M ∉ CounterexampleSet := ... def ProofAdmissible (Ks : List (Nat → Prop)) : Set Nat := {N | Even N ∧ 4 ≤ N ∧ ∀ K ∈ Ks, K N} theorem counterexample_subset_admissible (sound : ∀ K ∈ Ks, ∀ N, Counterexample N → K N) : CounterexampleSet ⊆ ProofAdmissible Ks := ... theorem empty_admissible_implies_goldbach (sound : CounterexampleSet ⊆ ProofAdmissible Ks) (hempty : ProofAdmissible Ks = ∅) : CounterexampleSet = ∅ := ... end RGSCP ``` --- # Appendix D: Commit Decision ```yaml validation_round: V0-R01 decision: PASS_WITH_CANONICAL_CORRECTION commit_to_sync_core: true promote_new_goldbach_theorem: false next_round: V0-R02 ```