PRH | Essay | 8.0 • Prime Theories, Umbrella Generators, and a Zeta "Theory of Everything"

Prime Theories, Umbrella Generators, and a Zeta “Theory of Everything” A Toy Model for Cascading Mathematical Structure Aleksandar Perišić September 2025 Abstract We first develop a minimal, addition–only picture in which meters are successor clocks kN , ordered by refinement and closed under intersection and generated union. In this successor lattice, primes appear as the indecomposable (“perfect”) meters; composites are coherent overlaps of prime meters. From intersections and a single tie–breaker (first coincidence) we recover gcd / lcm ; with a two–way rebasing and the same tie–breaker we recover ordinary multiplication. We then exhibit a whole family of compatible products parameterized on the prime exponents, with Euler–product avatars, and comment on the structural tie between a particular multiplicative choice and the critical line of ζ , in the sense of a conditional chain through scale–neutral blur and midline unitarity. Companion notes elaborating the multiplicative choice and the prime–theory umbrella are referenced inline. We then build a didactic toy model of theories starting from the trivial 1-theory, then the single-prime theories p -theories whose only theorems assert that “ pk is a power of p ,” and then their combinations. We introduce a compact generator formalism that toggles prime theories on/off and includes/excludes selected prime powers, both as a formal monoid polynomial and as a Dirichlet series. Turning every switch “on” yields the Euler product—the Riemann zeta function—which plays the role of a closure or “theory of everything.” Finally, after allowing s∈C , analytic continuation leads to the familiar landscape where zeta’s nontrivial zeros act as meta-theories that couple all prime theories at once. The goal is illustration rather than proof: to show how simple atoms (prime-power statements) overlap and intertwine into rich global structure. 1 Seed: 0, successor, and closure Peano’s seed is: a null symbol 0, a successor operation succ , and the closure that produces N . Here we keep only the successor viewpoint but refuse to privilege a single, absolute “meter” a priori. Two minimal questions about successor Q1. Repeatability. If we can reach 2, can we (perhaps after an extraction) reach a coherent “3”? We assume we can—but we do not assume a unique mechanism beyond coherence of the next object. Q2. Uniform meter. Does succ act with identical meter independent of base point? We do not assume this globally. Instead we kernelize: we pair objects with a fixed marker suc and regard numerals as nested pairings ( n, suc ); any local variation is relegated to the ancillary slot. The outcome is an “equally spaced” façade for N sufficient to index positions, without committing to a unique concrete meter underneath. 1 2 Meters as successor clocks and their lattice For k≥1, define the k–successor (clock) as the submonoid kN={k, 2k, 3k, . . . }⊂N. Order clocks by refinement: kN⪯mN⇐⇒ kN⊇mN(finer clock sits higher). The family {kN:k≥1}is closed under: meet: kN∧mN:= kN∩mN,join: kN∨mN:= ⟨kN∪mN⟩, hence forms a distributive lattice purely inside addition. Definition 2.1 (Prime/Perfect meters).A meter R is indecomposable if R = X∧Y implies X=Ror Y=R. Proposition 2.2 (Primes are the perfect meters).The indecomposable clocks are precisely {pN:pprime}. Moreover every kNhas a unique refinement kN=^ p pvp(k)N, a meet of prime–power clocks (finite product since vp(k)=0for all but finitely many p). Remark 2.3 (Co–sieve: primes as a kernel).Consider the family F = {kN : k≥ 2 } on the vertex set N≥2 . Keep only the vertices of incidence degree 1(points that belong to exactly one clock in F ). The survivors are precisely the primes: a composite sits in at least two clocks (a proper divisor’s and its own), a prime p only in pN . This one–shot, parallel cut is the “co–Eratosthenes” kernel. 3 How addition births multiplicative structure Three operations from clocks All arise from intersections plus a single tie–breaker (first coincidence). Expressed on prime exponents vp(·): Operation on clocks On integers On exponents last–always–hit (meet) gcd(a, b) min(vp(a), vp(b)) first coincidence (join) lcm(a, b) max(vp(a), vp(b)) mutual rebase + first hit a·b vp(a)+vp(b) Concretely, product without naming gcd/lcm: define a⋆b:= first hit of aNmeasured in b–ticks and bNmeasured in a–ticks. Since both rebased clocks equal (ab)N, the first hit is ab, and exponents add. Remark 3.1 (The lcm/gcd semiring).The pair ( gcd,lcm )is an idempotent, commutative semiring on N≥1 ; in valuations it is just ( min,max )coordinatewise. Our “first coincidence” algebra is exactly this semiring; ordinary product adds a third operation corresponding to +on exponents. 2 4 A family of compatible products Once primes are recognized as the atomic meters, any product rule of the form a⊙fb:= Y p pfpvp(a),vp(b) is determined by a primewise bivariate law fp : N×N→N (all but finitely many zero inputs). Canonical instances: fp(i, j) = min(i, j)⇝gcd, fp(i, j) = max(i, j)⇝lcm, fp(i, j) = i+j⇝ordinary multiplication, fp(i, j) = 1{i>0}1{j>0}⇝“support–only” mixer (distinct prime count). Each choice has an Euler–product avatar Ff(s) = Y pX k≥0 cp,k p−ks, with coefficients cp,k reflecting which prime–power strands are allowed locally. 5 Closure, Euler products, and the meta–layer From prime meters to the zeta closure Switching every prime ladder “on” (and all their powers) formally yields Y p1+p−s+p−2s+···=Y p 1 1−p−s=ζ(s) (ℜs>1), and, via analytic continuation, the familiar global landscape. In this reading, ζ is a closure that aggregates all prime meters; its nontrivial zeros act as meta–modes coupling all local prime ladders at once (standard explicit–formula heuristics). See the companion “umbrella” note for a didactic rendering of these cascades and their meta–structure. On the structural tie to the critical line If one fixes multiplication by three neutral constraints—power–compatibility (“repeat then forget”), unitary Mellin on the midline, and scale–neutral blur on the log–line—then a single boundary positivity (Fejér–Mellin) delivers a compact conditional chain to the critical line for ζ (location of zeros). This is an implication inside that regime, not a stand–alone proof; it makes precise the sense in which “the choice of multiplication already seals the deal.” 6 Probabilistic shadow: why primes look hectic Our co–sieve selects primes as degree–1points in the multiples hypergraph. Near x , surviving (being prime) means dodging all earlier prime clocks, producing the Mertens product heuristic Pr(prime near x)≈Y p≤x 1−1 p∼e−γ log x, hence mean gap ∼log x with visible local irregularity: many small, almost independent traps superimpose a noisy surface on a slow trend. 3 7 Afterword: Meters are not trivial Abandoning the dogma of a unique, indivisible meter and staying within successor alone, we find a refinement lattice with genuine atoms. “Being a meter” is not primitive; it is a structured property. Primes are those perfect meters. Intersections + simple tie–breakers turn additive clocks into the full arithmetic zoo: meet/join, product, and a whole spectrum of alternative products, each with a clean primewise semantics and an Euler–product avatar. When the full closure is switched on, the zeta landscape and its meta–modes appear; under a specific multiplicative choice the midline becomes structurally singled out. Mini–dictionary (one line each). •Clocks kN= additive grids (successors every k). Refinement order = inclusion. •Primes = indecomposable clocks (cannot be written as nontrivial overlaps). •Co–sieve = keep points in exactly one clock ⇒primes. •First coincidence = join/lcm (max on exponents). Last–always–hit = meet/gcd (min). •Mutual rebase + first hit = ordinary product (sum of exponents). •Family of products = choose fpprimewise; Euler avatar = QpPkcp,kp−ks. 8 Motivation over theory growth Now we fix multiplication in order to show how these assumptions we are aware of or not and obtain a strikingly simple prototype of a mathematical theory as the following: fix a prime p . Consider the single predicate “ x is a power of p .” The only theorems are p, p2, p3, . . . . There is no divisibility relation, no addition—just an infinite chain of statements of the form “ pk is a power of p.” This note shows how: 1. starting from the trivial 1-theory, then 2-, 3-, 5-theories, we get infinite cascades; 2. combining prime theories produces a new world of mixed statements (e.g. numbers like 6,12,18,24 from mixing 2and 3); 3. a compact umbrella generator turns prime theories and prime powers on/off, giving a family that ranges from sparse subsets to full closure; 4. switching everything on recovers ζ ( s ), and once we allow s∈C , analytic continuation reveals meta-structure—zeros as “meta-theories” whose faint oscillations touch every prime theory at once. 9 The trivial 1-theory and the single-prime p-theory Definition 9.1 (Language and predicates).We use a language with constants 1and each prime p , multiplication “ · ,” and, for each prime p , a unary predicate Powp ( x )to be read as “ x is a power of p.” No other symbols are used. Definition 9.2 (The 1-theory).The 1-theory has the single axiom Pow1 (1) and no inference rules. It proves only the trivial statement 1. Definition 9.3 (The single-prime theory Tp).Tphas the two schemata: 4 BasepPowp(p). SteppFrom Powp(x)infer Powp(p·x). Proposition 9.4 (Completeness for T p ).The provable sentences of T p are exactly {Powp ( pk ) : k≥1}. Proof. Base p gives k = 1. Applying Step pk− 1times yields pk . Conversely, no term other than pkcan be formed by repeated multiplication by pstarting from p. Example 9.5 (The 2-theory cascade).Pow2(2),Pow2(4),Pow2(8),Pow2(16),.... 10 Combining prime theories: mixtures and structure Let S be a finite set of primes. We form a combined theory T S that contains all axioms and rules of Tpfor p∈Sand additionally allows us to multiply powers from different primes. Definition 10.1 (Combined theory TS).The language extends Theorem 9.1; for each q∈S: Baseq: PowS(q),Stepq: PowS(x)⇒PowS(q·x). Add the product rule: from PowS(x)and PowS(y)infer PowS(xy). Proposition 10.2 (What T S proves).The theorems of T S are precisely the statements PowS ( x ) where x=Y q∈S qeq, eq∈N,not all 0. Proof. Using Base q and Step q we generate qeq for each q∈S ; multiplying them yields any such x. Conversely, any derivation produces a product of prime powers in S. Example 10.3 (The first mixtures: S={2,3}).We see three interlaced cascades: 2,4,8,16, . . . | {z } 2-chain ,3,9,27, . . . | {z } 3-chain ,6,12,18,24,36, . . . | {z } mixtures . Adding 5enriches the landscape to all 2n3m5kwith integers n, m, k ≥0not all zero. 11 An umbrella generator: toggling primes and prime powers The preceding sections describe which numbers appear as theorems. We now encode entire families at once via a compact generator. There are two parallel encodings: 11.1 Algebraic (formal monoid) encoding Work in the free commutative monoid algebra Z [ ⟨primes⟩ ]. For each prime p and exponent k≥ 1 fix a selector ap,k ∈ {0,1}. For each prime pfix a switch bp∈ {0,1}. Define the theory profile Ta,b := Y p∈P 1 + X k≥1 ap,k pkbp.(11.1) By expansion, the coefficient of n=Qpepin Ta,b equals 1iff for each p: bp=0⇒ep= 0, bp=1⇒ ∃ a decomposition ep=X j kjwith each ap,kj= 1, i.e. we may only use those prime powers whose ap,k switch is on, and only from primes with bp= 1. (If all ap,k ≡1then we get all powers pepat pwhen bp= 1.) 5 11.2 Analytic (Dirichlet series) encoding For Re s > 1define Fa,b(s) := X n≥1 ca,b(n) ns=Y p∈P 1 + X k≥1 ap,k p−ksbp.(11.2) Here ca,b ( n ) ∈ { 0 , 1 } is the membership indicator determined by the same combinatorics as above. The analytic encoding carries the same toggling semantics but lives where products converge. Remark 11.1 (Partial sums and products).Switching on finitely many primes and finitely many powers yields finite polynomials/finite Euler products. Turning on infinitely many but with convergence constraints (e.g. ap,k ≡1,bp≡1and Re s>1) yields classical Dirichlet series. 12 The crown: the zeta closure If we fully open every gate by setting ap,k ≡ 1and bp≡ 1for all primes, then Equation (11.2) becomes Fa,b(s) = Y p∈P 1+p−s+p−2s+· · · =Y p∈P 1 1−p−s=ζ(s),Re s>1.(12.1) In the toy-model sense, ζ is the closure or “theory of everything”: it aggregates all prime theories and all their powers. Remark 12.1 (Complex s and analytic continuation).The Euler product (12.1) defines ζ ( s )on Re s > 1. Analytic continuation and a functional equation extend ζ to a meromorphic function on C with a simple pole at s = 1. This step—importing complex analysis—is the moment when the “toy” gains hidden depth: phenomena on the extended plane encode global arithmetic regularities. 13 Meta-theories: zeta’s zeros as global chirps In this narrative, a meta-theory is a global mode that touches every prime theory at once. Nontrivial zeros ρ of ζ play this role. One way to feel this is through a smoothed prime-power sum (a standard explicit-formula avatar): X n≥1 Λ(n)g(log n) ns=b g(s)−X ρb g(ρ)+(trivial/archimedean terms).(13.1) Here g is a short, well-behaved blur in the log scale, and b g is its Laplace/Fourier transform. The right-hand side shows that each zero ρ contributes a coherent “chirp” b g ( ρ )that is fed by all prime powers on the left. Thus, while individual prime theories are atomistic, zeros live at the meta-level, coupling them all. Remark 13.1 (Didactic reading).Nothing in Section 13 is needed for the basic cascade picture; it simply illustrates how, after passing to complex s , global resonances (zeros) emerge as higher-order structures that speak across every local theory at once. 14 Cascades, surprises, and enrichment: a gallery •Start at 1.Only 1is a theorem; there is no motion. •Turn on 2.The infinite chain 2,4,8,16, . . . appears. 6 • Add 3.A second chain 3 , 9 , 27 , . . . appears and a mixed cascade 6 , 12 , 18 , 24 , . . . interleaves with the powers of 2and 3. Already the patterning (e.g. density, gaps) becomes interesting. • Add 5.The playground becomes three-dimensional: { 2 n 3 m 5 k} . The eye starts catching motifs (e.g. numbers congruent to 0or 1modulo small moduli; shapes in logarithmic plots). • Selective powers. With selectors ap,k , we can keep 2 , 8 , 32 , . . . but drop 4 , 16 , . . . , or forbid 9while keeping 3and 27. This creates patterned subtheories with their own combinatorics. • Full closure. Opening everything returns ζ ( s ); step into complex s and meta-structure (zeros) becomes visible. 15 Prime-side closure and the Game of Life: a toy meta-theory This section finishes the prime-side picture by isolating a tiny self-referential kernel at each prime and then pivots to Conway’s Game of Life as a didactic laboratory for how mathematical theories grow, stabilize, and sometimes run into undecidability. 15.1 Prime-side completion: self-image, closure, and a three-fold cycle Fix a prime p. Consider the minimalist “p-theory” whose only content is the infinite ladder p, p2, p3, . . . (read: “pkis a power of p”). As a Dirichlet avatar, the closure of this ladder is the Euler factor Ip(s) := 1 1−p−s= 1+p−s+p−2s+··· (ℜs>1),(15.1) and toggling all primes on gives the global closure Y p Ip(s) = ζ(s). How the closure closes: a 3-cycle under a geometric transform. Introduce the formal (Möbius) transform T(X) := 1 1−X, the operation of “closing under a geometric series” Pk≥0Xk7→ 1 / (1 −X ). Applying T three times returns to the start: T3(X)=X, hence XT −→ 1 1−X T −→ 1−1 X T −→ X. Specializing to X=p−sgives the explicit formal but vivid cycle: (atom) p−sPk≥0Xk −−−−−−−→ ∞ X k=0 p−ks =1 1−p−s Pk≥0Xk −−−−−−−→ ∞ X k=0 1 1−p−sk=1 1−1 1−p−s = 1 −ps Pk≥0Xk −−−−−−−→ ∞ X k=0 (1 −ps)k=1 1−(1 −ps)=1 ps=p−s. (15.2) 7 Remarks. (i) The equalities after the first line are purely formal (they ignore analytic convergence domains); the point is the algebraic closure mechanism and its idempotence after three steps. (ii) Thus the intrinsic structure here is three-fold: atom → Euler factor → complementary factor →atom. Definition 15.1 (Global faces and the 3-cycle).Formally write G0(s) := Y p p−s(atomic face; formal), G1(s) := Y p 1 1−p−s=ζ(s) (ℜs>1), G2(s) := Y p (1 −ps) = 1 ζ(−s)(via analytic continuation), Gumb(s):=G(s)(a selector-driven umbrella generator). Under the transform T acting componentwise on Euler factors, the triple {G0, G1, G2} cycles with period 3as in (15.2); Gumb interpolates between sparse selections and full closure. 15.2 The Game of Life is more than a toy Just as the prime-side picture shows how trivial local axioms ( pk is a power of p ) close up into ζ and its meta-structure, the Game of Life does the same for spatial-temporal dynamics: extremely simple local rules generate rich global engines and undecidable fronts. Conway’s Game of Life (GoL) is an axiomatic system with two rules: Definition 15.2 (Game of Life rules).On the square grid with Moore neighborhood, at each discrete time step: •Survival: a live cell with 2or 3live neighbors stays alive; •Birth: a dead cell with exactly 3live neighbors becomes alive; •all other cells become/stay dead. Despite its barebones axioms, GoL supports an astonishing menagerie: still lifes (stable patterns), oscillators (periodic patterns), and spaceships/gliders (self-propagating patterns). Crucially, GoL is Turing-complete: with appropriate circuitry of stable/oscillatory gadgets, one can embed arbitrary finite computations. As a consequence, many naturally posed questions about long-term behavior are computationally intractable, and some are outright undecidable. In short, the toy hides a full-scale engine. A didactic dictionary. Life can serve as a metaphor for how mathematical theories grow: Life Mathematics (metaphor) Reading Cell Statement/Sentence “alive” =currently active/useful Neighbor support Lemmas/premises 2or 3supports =viable hypothesis Still life Proved theorem Stable under inference/interaction Oscillator Dynamic truth Alternates roles across contexts Spaceship/glider Transfer principle Moves information across the theory Gadgets Lemmas/tools Reusable subproofs in larger builds Guns/emitters Theorem schemes Infinite families by controlled output 8 Under this lens, discovery looks like tinkering with axioms to find survivable constructions. Some trial patterns die in a few generations (discarded heuristics); others stabilize (lemmas); still others become mobile and power larger architectures (transfer principles, induction devices). Because GoL can implement arbitrary computation, it can, in principle, encode proof search; conversely, the undecidability of certain Life questions mirrors the impossibility of deciding all statements from fixed axioms in sufficiently expressive mathematical systems. Why this matters. • From atoms to closure. Just as the prime-side closure Qp (1 −p−s ) −1 aggregates trivial local ladders into ζ ( s ), Life aggregates tiny local interactions into global engines (computers, constructors). • Stability as proof. A still life is a “proved” statement: it persists under the rules. Oscillators model truths that are stable only modulo a context shift; spaceships represent theorems that transport structure. • Limits are informative. In Life, some reachability/long-term questions are undecidable; in mathematics, entire classes of problems are provably out of reach from given axioms without enrichment. Recognizing these limits early is strategically valuable. Example 15.3 (Nested emergence).There exist Life configurations that emit gliders (“glider guns”), which in turn build other machines, which then simulate computations. This is a three-tier emergence: gadget → constructor → computation. On the prime side, we saw atoms → closures → meta-couplings via zeta’s zeros. In both worlds, simple axioms yield stratified structure. Remark 15.4 (Scope and caveats).We are not claiming that Life is mathematics. The point is pedagogical: Life is an unusually transparent sandbox in which to watch the dynamics of theory-building—stability, interaction, transport, and the appearance of hard/undecidable fronts—play out under axioms so simple that the entire “theory” fits on a postcard. Takeaway. Prime theories and Life share a moral: trivial-looking axioms can harbor deep internal organization. On the prime side, the organization is multiplicative and collapses to zeta; on the Life side, it is spatial-temporal and collapses to universal computation. Both provide intuition for how local rules scale to global structure—and where the limits (idempotence or undecidability) begin to bite. 16 Outlook The purpose of this note is illustrative: to show how very simple “local” theories—one per prime, asserting nothing but “being a power of”—overlap, cascade, and intertwine into a rich global picture, and how a compact umbrella generator interpolates between sparse toy worlds and full closure. Once complex analysis is admitted, the same toy becomes a window onto meta-structure: global modes (zeros) that whisper across every local strand. Optional exercises. 1. Prove Equation (11.2) converges absolutely on Re s > 1whenever bp≤ 1and Ppbpp−σ<∞ for some σ > 1. 2. For fixed S , count the number of theorems of T S up to X and identify the leading constant in terms of |S|. 3. Using selectors ap,k , design a pattern where every third power of 2is permitted and others are forbidden; describe the resulting set multiplicatively. 9