A Trace–Determinisation Identity for the Noncommutative Prime Address System

This paper develops a structural interpretation of integer factorisation using ordered prime addresses. In ordinary arithmetic, the order of prime factors is forgotten. For example, multiplying two then three gives the same integer as multiplying three then two. In the noncommutative prime address system, however, these two ordered traces are kept distinct before they are collapsed to the same integer. The central idea is that an integer should not be viewed only as a final commutative value. It can also be viewed as the output of a whole family of ordered prime traces. These traces form a fiber over the integer. The main result proves that when a fixed ordered prime trace is applied to a given fiber, and then the result is closed under the same-output relation, one obtains exactly the fiber over the multiplied integer. In simple terms, one ordered trace determines the full collection of ordered traces with the same commutative output. This is structurally similar to the determinisation of a nondeterministic finite automaton. In automata theory, many possible paths can be packaged into one deterministic subset-state. In the prime address system, many ordered prime traces with the same output are packaged into one fiber-state. The paper also separates two notions of atomicity. A number has a singleton fiber precisely when it is one or a prime power. Therefore, being fiber-atomic is not enough to identify a prime. A genuine prime is both fiber-atomic and length-one. This separates prime powers from primes in a clean structural way. The paper then studies the size of each fiber. The number of ordered prime traces over a given integer is the usual multinomial count of its prime factors. This shows that the framework is not changing arithmetic, but reorganising the information that ordinary factorisation already contains. A further quantitative object is introduced: the fiber Dirichlet series. This series counts each integer not once, but with weight equal to the number of ordered prime traces above it. It is expressed in terms of the prime zeta function. This gives a global measurement of the growth caused by ordered prime-address histories. The paper also discusses a shuffle version of the construction. Prefixing adds one trace in front of another, while shuffling interleaves two traces while preserving their internal orders. The shuffle layer lies between the narrow prefix layer and the full fiber. After fiber closure, both prefixing and shuffling lead to the same final fiber. This gives a sandwich structure between prefix traces, shuffle traces, and the full same-output fiber. Finally, the shuffle construction is compared with a pushdown-automaton interpretation. Each shuffle-generated trace can be read as a stack trace that can be cleared by a matching pop operation. At the same time, the same trace opens the full fiber under abelianisation. Thus the same object has two readings: as a clearable stack trace and as a generator of a full same-output fiber. The paper does not claim a new primality test, a proof of the Riemann Hypothesis, or a universal computation model. Its contribution is structural. It gives a precise language for viewing ordinary integers as commutative outputs of noncommutative prime-address traces.