⚡Shunyaya Arithmetic Origin Resolution (SAOR)

🧩 Can the Same Sum and Product Hide Different Arithmetic Structures?

Can two arithmetic realizations have the same numerical projection yet behave differently under the same future context?

🌌 Equal values do not always mean equal future behaviour

Two arithmetic realizations can have:

the same arity;
the same sum; and
the same product.

At first sight, they may appear numerically indistinguishable.

But there is another question:

Will they continue to behave the same way when both are placed inside the same future arithmetic context?

No — equal sum and equal product do not, by themselves, determine future structural behaviour.

The Shunyaya Arithmetic Origin Resolution (SAOR) v1.3.0 develops a finite mathematical theory for deciding exactly when distinct equal-sum/equal-product realizations remain indistinguishable under common prime-context extension, when they separate, and what finite information is sufficient to classify that future behaviour.

🔗 Explore Shunyaya Arithmetic Origin Resolution on GitHub

🎯 The arithmetic question

Suppose A and B are distinct finite multisets of integers with the same arity, sum, and product.

Now append the same finite prime context E to both.

SAOR studies two transfer relations:

P-transfer -> equal product + shared factor value

S-transfer -> equal sum + shared factor value

The contextual realizations are called MASKED when they have exactly the same external neighbours in both transfer graphs.

In ordinary graph language, they are twins.

A one-sided neighbour immediately proves that they are UNMASKED.

So the central problem becomes:

How much information about E must we retain to know every possible future masking behaviour?

🔬 A finite critical-support classifier

SAOR proves that, under explicit arithmetic hypotheses, the answer is finite.

The two hypotheses are:

Prime Cover

and

Omega(P0) < 2*m0

where Omega(P0) counts prime factors of the common product with multiplicity.

Under these conditions, the product side becomes automatically twin for every finite prime context.

The difficult part moves to the sum side.

There, separation reduces to a finite safe-filler representability problem.

The resulting classifier has the form

K(E) = (N(E), S(E), supp(E) intersect Crit)

where:

N(E) = |E|

S(E) = sum(E)

and Crit is a finite computable set of critical primes.

The important point is that future behaviour does not require remembering the entire context.

It compresses to:

aggregate arithmetic data

+

finitely many critical support bits.

♾️ Every equal-sum/equal-product pair reaches a synthesis regime

The initial arithmetic hypotheses are restrictive.

SAOR therefore goes further.

For every distinct equal-sum/equal-product pair, it constructs an explicit finite common prime anchor after which the general critical-support synthesis theorem applies permanently throughout an upward-closed cone of future contexts.

Conceptually:

arbitrary equal-sum/equal-product pair

-> finite common prime anchor

-> synthesis conditions become valid

-> every further common prime extension remains inside the classified region

So the theory is not limited to specially prepared starting examples.

Every distinct equal-sum/equal-product pair has an explicit anchored region in which its future behaviour admits finite critical-support classification.

🧠 A sharp complete classifier

For the fixed two-module SAOR system, the general theory becomes especially sharp.

Define

D4(E) = -3 + S - 4*N

and

D5(E) = 4 + S - 5*N.

Then define the future signature

K(E) = (D4(E), D5(E), eps5(E), eps7(E), eps11(E))

where

eps_p(E)=1

exactly when prime p occurs in the context.

SAOR proves the complete equivalence:

E ~future E' iff K(E)=K(E')

In words:

Two contexts have identical behaviour under every finite future prime extension exactly when their SAOR signatures agree.

And if the signatures differ?

There is an explicit finite future context that exposes the difference.

So the classification works in both directions:

same signature -> no future context can distinguish them

different signature -> some finite future context does distinguish them.

🔑 Why the primes `{5,7,11}` matter

For the fixed two-module system, aggregate statistics alone are not enough.

For classifiers of the form

(N(E), S(E), supp(E) intersect C),

the exact unique minimum critical support is

{5,7,11}.

Module 4 alone has unique minimum support

{5,7}.

This means the extra information is not arbitrary bookkeeping.

Those support bits are structurally necessary.

💥 A simple escape from aggregate arithmetic

Consider

E = (3,7)

and

E' = (5,5).

Both have

N = 2

and

S = 10.

They even have the same aggregate defect coordinates:

(D4,D5) = (-1,4).

Yet their joint masking states differ:

(3,7) -> (MASKED,UNMASKED)

(5,5) -> (MASKED,MASKED).

So two contexts can agree on all of the aggregate arithmetic information used by the rank-two description and still behave differently.

What is missing?

Prime support.

The distinction is recovered by the finite critical-support coordinates.

🧩 Arithmetic beyond visible numerical projection

This produces a useful conceptual separation.

Ordinary numerical projection records quantities such as

sum

and

product.

SAOR asks a different question:

What structural information survives when the same future context is appended?

The progression is:

equal numerical projection

-> transfer structure

-> contextual twinhood

-> masking or separation

-> finite critical support

-> complete future classification

The paired realizations remain equal in arity, sum, and product under the same appended context.

What changes is our ability to distinguish realization structure.

🔎 Different signatures come with witnesses

A classification theorem is stronger when inequivalence is constructive.

SAOR does not merely say that two unequal signatures differ abstractly.

For the fixed system, unequal signatures admit explicit finite future prime contexts that expose the difference.

So:

K(E) != K(E')

does not mean only

“these contexts belong to different formal classes.”

It means:

there exists a concrete finite continuation under which their observable masking behaviour separates.

That turns classification into a testable arithmetic statement.

⚙️ The aggregate rank-two structure still survives

The support-sensitive classifier does not discard the simpler aggregate theory.

The two quantities D4 and D5 reconstruct N and S exactly:

N = D4 - D5 + 7

S = 5*D4 - 4*D5 + 31.

So every observable depending only on (N,S) still factors through (D4,D5).

The critical-support theorem identifies precisely where that compression stops being sufficient.

In the fixed SAOR system:

aggregate regime -> D4,D5 suffice

full prime-context regime -> D4,D5 + support bits are required.

🧪 Reproducible verification

The SAOR repository contains:

the formal transfer semantics;
the general critical-support synthesis theorem;
the Anchored-Cone Corollary;
the sharp support-sensitive classification;
the complete written principal proof;
definition-level transfer searches;
constructive separator checks;
critical-support necessity extraction;
machine-readable theorem records;
consistency and regression checks; and
automated GitHub verification.

The standard commands are:

python -B verify.py --self-test

and

python -B verify.py --verify.

The implementation uses the Python standard library only.

Definition-level checks construct transfer neighbours directly rather than simply calling the sharp closed-form classifier, keeping computational evidence separated from the theorem formulas it is intended to test.

⚖️ What is — and is not — being claimed

SAOR does not claim novelty for equal-sum/equal-product problems themselves, graph twins, multiplicative partitions, forbidden-part representability, numerical-semigroup gap phenomena, or contextual equivalence as an abstract idea.

Its mathematical contribution is the integrated mechanism:

retained-factor transfer semantics

-> product twinhood under explicit arithmetic conditions

-> exact safe-filler reduction

-> finite critical-support synthesis

-> anchored synthesis cone for every distinct equal-sum/equal-product pair

-> sharp complete future classifier with unique minimum support {5,7,11}.

The general synthesized critical set is finite and effectively computable, but is not claimed minimal in general.

The unique-minimum result {5,7,11} belongs specifically to the declared fixed two-module classifier.

The proof is written and computationally cross-checked; machine-mechanized proof is not claimed.

🌐 Explore the complete mathematics

The GitHub repository contains the full theorem statements, definitions, principal proof, algorithms, definition-level verification, examples, claim boundaries, machine-readable records, and reproduction instructions.

🔗 Shunyaya Arithmetic Origin Resolution on GitHub

Repository version:

v1.3.0

Arithmetic beyond equal values: critical-support classification under shared prime context.

🌌 So, can the same sum and product hide different arithmetic structures?

Yes.

Two realizations can have the same arity, the same sum, and the same product while responding differently to the same future arithmetic context.

SAOR shows that this difference is not necessarily unbounded or mysterious.

Under explicit conditions, it can be compressed into a finite classifier.

For every distinct equal-sum/equal-product pair, an explicit finite anchor reaches such a synthesis regime.

And for the fixed sharp SAOR system: