Why Multiplication Dialogues and Addition Doesn’t
The Ternary Root of Distinguishability
A companion article proposed that × represents two structures interacting while preserving their own identity, and + represents them blurring into an ambiguous mixture — and left open why that asymmetry should hold at all, rather than being an arbitrary assignment. This article closes that gap: the asymmetry is not a separate rule bolted onto the framework. It falls directly out of the same arity structure that fixes everything else in this corpus, once one question is asked properly: what does it take for two things to be genuinely distinct from each other, rather than merely a symmetric, interchangeable pair?
1. The question that was left open
Two earlier pieces in this line of work established, first, that multiplication represents structures in dialogue — each preserving its own identity — while addition represents structures blurring into superposition; and second, a candidate rule for when to use which, grounded in how independent events combine under probability (joint necessity → product, alternative sufficiency → sum). What neither piece explained is why dialogue specifically requires multiplication rather than addition in the first place — that assignment was stated, motivated by analogy, but not derived from anything more basic in the framework.
It turns out it can be. The derivation was already sitting in an earlier foundational document, unconnected to this specific question until now.
2. What it takes for two things to be genuinely distinct
Every arity level in this corpus corresponds to a minimum count of temporal particles (Tf) — indivisible, mutually indistinguishable units; no Tf is different from any other Tf considered alone. This gives a precise way to ask a question that sounds trivial but isn’t: what does it actually take for two labeled things, A and B, to be genuinely distinct from one another, rather than a symmetric pair that could be relabeled without loss?
If A and B each consist of exactly one Tf, they cannot be told apart — a single Tf carries no internal structure that could mark it as “the A one” rather than “the B one,” since no Tf differs from any other. A pair built from two lone Tf’s is not a distinction between two things; it is one symmetric configuration, (a,a') ≡ (a',a), with no privileged direction and no way to say which is which. This is exactly the structure the corpus assigns to T¹ (arity 2): a mutual, order-free pair, explicitly characterized elsewhere in this corpus as “without object” and governed by “fundamental undecidability” about any directional attribution between its two terms.
For A and B to be genuinely distinct — for one to be identifiably A and not B — at least one of them needs more than a single Tf: something that marks it as structurally richer than its counterpart, breaking the symmetry that made T¹’s pair interchangeable. The minimum configuration that achieves this is one term with two Tf and the other with one — three Tf total. This is T⁻¹ (arity 3), and it is exactly where this corpus already places the first appearance of genuine order — (a,b) ≠ (b,a), in contrast to T¹’s symmetric pair — and the first structure carrying “+Objective” status rather than T¹’s “without object.”
The conclusion is precise and general, not specific to any one pair: genuine distinguishability between two identities is not available below arity 3. Below that threshold, what looks like “two things” is really one symmetric, interchangeable configuration.
3. Why this settles the × / + asymmetry
Multiplication, in this corpus’s reading, represents two structures interacting while each retains its own identity — a dialogue, not a merger. But by §2, retaining a distinct identity while relating to something else is not a free assumption; it is a specific structural achievement that requires arity 3 to be available in the first place. Multiplication’s dialogic character is not a separate ontological commitment layered on top of the arithmetic. It is arithmetic that only makes sense — only describes a coherent relationship — once the arity-3 threshold for genuine distinguishability has already been crossed. A product of two terms that preserves both terms’ identity is, structurally, an operation that presupposes exactly the mediating structure §2 shows is necessary for two things to be distinguishable at all.
Addition does not carry this requirement. When two structures are combined by superposition — blurred together rather than held apart — there is no need for the arity-3 mediating structure that distinguishability requires, because the operation is not claiming to preserve two separate, identifiable things in the first place. It is closer to what T¹’s symmetric pair already permits: a combination where the two contributors are not sharply held apart from one another. This is why addition can “work well enough,” in the sense of producing numerically accurate results, without carrying the same structural necessity — it was never claiming the kind of relationship that would require it.
This is not a new, independent rule. It is the existing conjunction/disjunction proposal, now anchored to something more fundamental than an analogy to probability: multiplication is grounded in the arity-3 threshold for genuine distinguishability; addition is not, and falls back toward the ungrounded, order-free symmetry of arity 2.
4. What this changes for the corpus’s formula inventory
A companion audit classified the corpus’s constant-derivation formulas into five recurring patterns and found that only two of them (Type 1, difference-of-squares-plus-product; Type 2, ratio-with-product) rest on multiplication of independent structural mediators, while two others (Type 4, scale-with-additive-correction; Type 5, polynomial-with-additive-terms) rest on addition to reach their final numerical value. That audit already suspected, on weaker grounds, that the addition-based cases carried less structural weight than the multiplication-based ones — the muon mass ratio’s 40π term, in particular, was flagged as justified only by retrospective elimination of alternatives rather than prospective derivation.
This article gives that suspicion a formal basis rather than an intuition. Any formula whose fit to its target value depends on an addition is not anchored to the arity-3 requirement that gives multiplication its structural necessity. This does not mean such formulas are wrong — m_μ/m_e = 3⁴ + 40π + 2/19 still matches its target to a small fraction of a percent, and that numerical success is real. What it means is that this class of formula should be held, systematically, to a lower standard of structural confidence than the multiplication-based ones, because the operation connecting its terms was never doing the kind of ontological work that would let a wrong candidate be ruled out in advance. A product-based formula can fail its own grammar before the numbers are compared (§3.1 of the companion piece on operator validity). A sum-based formula, on the evidence gathered so far, can only be defended after the fact — which is a structurally weaker position, independent of how well any specific instance happens to match its target.
5. Revised confidence labeling
Dialogic operation (×): the two combined terms retain separate identity; the operation is grounded in the arity-3 threshold for genuine distinguishability. Supports the conjunction/disjunction test as a prospective, falsifiable filter.
Non-dialogic operation (+): the two combined terms blur into a single value without the arity-3 mediating structure; the operation is not grounded in the same necessity. Formulas that depend on addition to reach their final value should carry a lower structural-confidence label than formulas that depend only on multiplication and division, regardless of numerical accuracy.
This label should be applied retroactively to the five-type inventory: Types 1 and 2 keep their existing confidence level; Types 4 and 5 are downgraded, and any future formula that relies on addition for its fine structure should be flagged the same way at the point it is proposed, not after the fact.
6. What remains open
The claim in §2 — that distinguishability requires arity 3 — is a philosophical argument, not an empirical one, and this article inherits that status rather than resolving it. It cannot be checked against a measured constant the way the operator-selection audit could be checked against existing formulas; it is a claim about what distinguishability means, prior to any specific physical application.
This does not mean addition-based formulas are false. The downgrade in §4 is a downgrade in why we should believe them, not a claim that they are wrong. Some may well be correct despite resting on a weaker structural foundation — the muon mass ratio’s precision is still a fact that needs explaining, one way or another.
A genuine, independently motivated rule for the additive pattern (Types 4 and 5) is still missing. This article explains why such a rule is harder to obtain — addition is not anchored the way multiplication is — but it does not supply one. That remains the open task this line of work has not yet completed.
For the original conjunction/disjunction proposal this article grounds: “Product as Conjunction, Sum as Disjunction: A Prospective Rule for Operator Selection.”
For the formula-type inventory and the audit that first flagged the asymmetry in confidence: the operator-selection audit accompanying that piece.
For the arity structure of T¹ and T⁻¹ this derivation depends on directly: the n-ary logic foundations documents, “Binary Logic (2-ary) — Level T¹” and “Ternary Logic (3-ary) — Level T⁻¹.”
Appendix: Formal statement
Claim: genuine distinguishability between A and B requires arity ≥ 3.
Proof sketch:
Let A, B each be built from Tf (indivisible, mutually indistinguishable
temporal particles; no Tf differs intrinsically from any other Tf).
If A = 1 Tf and B = 1 Tf:
A and B are structurally identical → (A,B) ≡ (B,A) → no genuine
distinction, only a symmetric, order-free pair. [T¹, arity 2]
For A ≠ B genuinely (not merely as an interchangeable pair):
at least one of A, B must carry more internal structure than the
other → minimum: one term with 2 Tf, one term with 1 Tf → 3 Tf total.
[T⁻¹, arity 3 — first level with (a,b)≠(b,a), first "+Objective" status]
Conclusion: distinguishability is unavailable below arity 3.
Consequence for operators:
× (DIALOGUE): requires both combined terms to retain separate identity
→ presupposes the arity-3 threshold → grounded.
+ (SUPERPOSITION): terms blur into a single value, no requirement that
separate identity be preserved → does not presuppose arity-3 →
ungrounded relative to ×, closer to T¹'s symmetric, order-free pair.
Formula confidence revision:
Type 1 (α⁻¹-style, difference of squares + product): grounded — unchanged
Type 2 (ratio with product, α_s / Ω_Λ / M_DM-style): grounded — unchanged
Type 3 (pure ratio): no + or × combination — n/a
Type 4 (scale + additive correction): DOWNGRADED
Type 5 (polynomial with additive terms): DOWNGRADEDCC BY-SA 4.0 — Diego Luis Tentor, ArXe Research, 2026