> Full-text translation from Chinese. The original remains authoritative for its research claims; this translation is not independent mathematical verification.

# RG-SCP Note C
## Symmetric Finite Relation Closure
### The Positive Dual, Residual States, Finite Cover Closure, and Goldbach in Zero-Obstruction-Degree Form

**Date:** 2026-09-30  
**Document type:** Research Note / Positive Dual Reformulation  
**Status:** Not a proof; a candidate canonical representation

---

## 0. The Core Reversal

The negative form:

$$
\boxed{
\forall d\in\Omega_m,
\quad
\exists w\in W_m,
\quad
R_m(d,w).
}
$$

means:

> Every admissible offset is covered by some bounded obstruction witness.

The positive dual takes the negation:

$$
\neg
\left[
\forall d\exists w\,R_m(d,w)
\right].
$$

By De Morgan:

$$
\boxed{
\exists d\in\Omega_m,
\quad
\forall w\in W_m,
\quad
\neg R_m(d,w).
}
$$

This surviving $d$ is an:

> obstruction-free state.

---

## 1. Finite Relation Domain

Define:

$$
\boxed{
\mathfrak R_m
=
(\Omega_m,W_m,R_m).
}
$$

where:

$$
\Omega_m
$$

is the finite symmetric offset domain,

$$
W_m
=
\{-1,+1\}
\times
\mathbb P_{\le\sqrt{2m-3}}
$$

is the finite witness domain,

and:

$$
R_m
\subseteq
\Omega_m\times W_m.
$$

Thus:

$$
\boxed{
\mathfrak R_m
}
$$

is a finite bipartite relation system.

---

## 2. Obstruction Degree

For:

$$
d\in\Omega_m,
$$

define:

$$
\boxed{
\deg_{\mathfrak R_m}(d)
=
\#\{w\in W_m:R_m(d,w)\}.
}
$$

Then:

$$
\boxed{
\deg_{\mathfrak R_m}(d)=0
}
$$

means:

- the left side has no root-bounded proper divisor;
- the right side has no root-bounded proper divisor.

So both endpoints are prime.

---

## 3. Residual Set

Define:

$$
\boxed{
\operatorname{Res}(\mathfrak R_m)
=
\left\{
d\in\Omega_m:
\deg_{\mathfrak R_m}(d)=0
\right\}.
}
$$

Then:

$$
\boxed{
\operatorname{Res}(\mathfrak R_m)\neq\varnothing
}
$$

is equivalent to:

$$
\boxed{
2m
\text{ has a Goldbach prime pair}.
}
$$

Whereas:

$$
\boxed{
\operatorname{Res}(\mathfrak R_m)=\varnothing
}
$$

is equivalent to:

> The obstruction cells completely cover $\Omega_m$.

---

## 4. Prime Pair as Residual State

Thus a prime pair can be described anew as an:

$$
\boxed{
\text{ineliminable point after finite root-bounded obstruction closure}.
}
$$

In this representation, the prime predicate is no longer the outermost primitive.

Only the following remain at the outermost level:

1. a finite offset set;
2. a finite witness set;
3. a finite incidence relation;
4. residual nonemptiness.

---

## 5. Obstruction Cells

For each:

$$
w\in W_m,
$$

define:

$$
\boxed{
O_w
=
\{d\in\Omega_m:R_m(d,w)\}.
}
$$

Put:

$$
\boxed{
\mathcal O_m
=
\bigcup_{w\in W_m}O_w.
}
$$

Then:

$$
\boxed{
\operatorname{Res}(\mathfrak R_m)
=
\Omega_m\setminus\mathcal O_m.
}
$$

---

## 6. Finite Elimination Process

Let:

$$
X_0=\Omega_m.
$$

Choose a witness enumeration:

$$
w_1,\ldots,w_s.
$$

Step by step:

$$
\boxed{
X_{j+1}
=
X_j\setminus O_{w_{j+1}}.
}
$$

Since:

$$
W_m
$$

is finite,

after finitely many steps:

$$
\boxed{
X_s
=
\Omega_m
\setminus
\bigcup_{w\in W_m}O_w.
}
$$

That is:

$$
\boxed{
X_s
=
\operatorname{Res}(\mathfrak R_m).
}
$$

---

## 7. Finite Closure Interpretation

For fixed $m$, this is a finitely terminating elimination system.

The final state can be called:

$$
\boxed{
\operatorname{ClRes}(m)
}
$$

or:

$$
\boxed{
\text{finite residual closure}.
}
$$

The final residual:

$$
\Omega_m\setminus\bigcup_wO_w
$$

is independent of the order in which witnesses are processed.

---

## 8. Order Independence

If the witness enumeration is reordered,

the final residual is still:

$$
\boxed{
\Omega_m
\setminus
\bigcup_wO_w.
}
$$

Thus this closure is:

$$
\boxed{
\text{finite}
+
\text{deterministic}
+
\text{order-independent}.
}
$$

---

## 9. Positive Dual Statement of Goldbach

Strong Goldbach has the candidate reformulation:

$$
\boxed{
\forall m\ge2,
\quad
\operatorname{Res}(\mathfrak R_m)\neq\varnothing.
}
$$

If:

$$
4=2+2
$$

is handled separately,

then for:

$$
m\ge3
$$

only symmetric odd-prime pairs are needed.

---

## 10. Counterexample Form

If a Goldbach counterexample exists:

$$
N_*=2m_*,
$$

then:

$$
\boxed{
\operatorname{Res}(\mathfrak R_{m_*})
=
\varnothing.
}
$$

Equivalently:

$$
\boxed{
\Omega_{m_*}
=
\bigcup_{w\in W_{m_*}}O_w.
}
$$

Thus a counterexample is compressed anew into:

> A finite residue/root-cell family completely covering the entire offset domain.

---

## 11. Relation to RG-SCP

The original RG-SCP:

$$
\neg G
\Rightarrow
\text{obstruction cover}.
$$

The new relation representation:

$$
\boxed{
G
\Longleftrightarrow
\text{finite obstruction relation has nonempty residual}.
}
$$

That is, it moves from:

$$
\boxed{
\text{counterexample necessary cover}
}
$$

to:

$$
\boxed{
\text{success = positive dual residual}.
}
$$

---

## 12. A Possible Bridge to Canonical Coverage

V1-06 uses:

$$
p\mapsto N-p
$$

and its reduced prime-input survivor domain.

The new relation domain uses:

$$
d\mapsto(m-d,m+d).
$$

The two can be connected through:

$$
\boxed{
p=m-d
}
$$

the relation displayed above.

Thus:

$$
d=m-p.
$$

Subsequent research must examine:

- whether the reduced prime-input domain and the symmetric offset domain correspond one to one;
- how boundary-$3$ enters the relation domain;
- how root-bounded cells connect to canonical coverage cells;
- which representation is better suited to global compression.

---

## 13. Candidate Finite-Closure Theorem Types

### Type A — Non-Coverage

$$
\boxed{
\bigcup_wO_w
\neq
\Omega_m.
}
$$

### Type B — Residual Lower Bound

$$
\boxed{
|\operatorname{Res}(\mathfrak R_m)|
\ge1.
}
$$

### Type C — Coverage Deficit

$$
\boxed{
\sum_w|O_w|
-
\text{overlap correction}
<
|\Omega_m|.
}
$$

### Type D — Structural Hole

Use residue-class incompatibility to prove directly that some:

$$
d
$$

belongs to no:

$$
O_w.
$$

### Type E — Closure Invariant

Prove that an invariant of the elimination process forces a nonempty final residual.

---

## 14. The Most Important GAP

For now, it has still not been proved that:

$$
\boxed{
\operatorname{Res}(\mathfrak R_m)\neq\varnothing
}
$$

for all:

$$
m.
$$

So this is not a Goldbach proof.

What has been obtained is:

$$
\boxed{
\text{Goldbach}
\longrightarrow
\text{finite complete-cover impossibility problem}.
}
$$

---

## 15. Why It Is Worth Retaining

This representation simultaneously has:

- complete finiteness for fixed $m$;
- a complete root bound;
- additive symmetry;
- residue-class structure;
- enumerable obstruction cells;
- direct prime-pair semantics for the residual set;
- exact relational statements for both success and failure.

This is closer to a machine-checkable closure problem than a mere prime-density heuristic.

---

## 16. Candidate Names

### English

**Symmetric Root-Bounded Relation Domain**

Candidate abbreviation:

$$
\boxed{
\mathrm{SRBRD}
}
$$

### Chinese

**Symmetric Root-Bounded Relation Domain**

or:

**Symmetric Root-Bounded Division-Closure Domain**

---

## 17. Order of Formal Development

1. Define $\Omega_m$ precisely;
2. Define the witness universe $W_m$ precisely;
3. Prove Goldbach success iff the residual is nonempty;
4. Prove that the relation is finite;
5. Prove that elimination is order-independent;
6. Express:
   $$
   d\equiv\pm m\pmod r
   $$
   as canonical residue cells;
7. Establish an overlap algebra;
8. Compare RG-SCP canonical coverage;
9. Search for a non-cover invariant;
10. Then decide whether to form a standalone paper / formal module.

---

## 18. The Shortest Conclusion

The new positive dual is not:

> Find two primes.

but:

$$
\boxed{
\text{find an offset with zero incidence in the complete finite root-bounded obstruction relation.}
}
$$

That is:

$$
\boxed{
\operatorname{Res}(\mathfrak R_m)\neq\varnothing.
}
$$

Only if this can be proved uniformly would it genuinely close Goldbach.