Schrödinger by Counting: Wavepacket Dynamics in a Finite Configuration Ontology
Russell Tillitt
Abstract
In a finite, timeless configuration space where probability is counting and the population of an outcome class is proved to equal N|α|², we construct a refinement chain from local devices—nearest-neighbour beamsplitters and per-cell phase increments, all on the 3,600-value phase lattice of the companion models—and evolve wavepacket classes by literal enumeration. The small-angle brickwork realizes the lattice Hamiltonian H = −2η cos k + V(x): the effective mass m* = 1/(2η) is the inverse hopping rate—mass as resistance to record restructuring, obtained from the move set rather than posited—and the potential is a cell-dependent phase cost per closure step. Counted populations reproduce the Schrödinger spreading law σ²(t) = σ₀² + (t/2m*σ₀)², the group velocity to seven significant figures against the exact device chain, and harmonic oscillation at ω = √(2ηκ), with Σₓ nₓ = N exact at every stage—the counting form of unitarity, tested exactly. Two findings go beyond agreement. First, the counted packet has a literal edge: populations fall to one configuration and then to zero exactly where the Born value crosses 1/N, so a counting world's particle has finite support where the continuum Gaussian merely thins—the rational-probability prediction rendered in position space. Second, the ontology's record-relative definition of classes is load-bearing for dynamics: counting once at the measurement stage (the chain as one composite device) yields residues of O(1/N), measured log–log slope −0.94, whereas imputing an integer census to unrecorded intermediate stages—partitions where no records are—degrades the scaling to slope −0.62 through the amplitude granularity of few-configuration tail classes. A definitional clause changes dynamical accuracy by a factor of order √N. What is not shown is the formal continuum limit: given [CS] the discrete effective dynamics is derived, with the same conditional status as the companion theorems, and the passage to the continuum equation remains the framework's open problem. The cell structure is a named input [CS]—but not a foreign one: its three clauses are the discrete shadow of the framework's own emergent-space program, and we locate each, finding that a preferred partition is what the stability criterion already selects, that adjacency is what the elementary refinement move set already supplies, and that only the graph's large-scale regularity—together with an assumed uniformity of hopping rate, which is a flatness assumption—remains open. Reading the cells as emergent space has an immediate consequence: the construction's maximal group velocity is one instance of the framework's conjectured invariant speed, computed rather than posited, since a single elementary move defines both the refinement step and the spatial adjacency. Relaxing uniformity—a position-dependent hopping rate, hence a position-dependent effective mass—is the discrete form of curvature, and is the natural next model.