A"problem of time"in the multiplicative scheme for the $n$-site hopper

Quantum Measure Theory (QMT) is an approach to quantum mechanics, based on the path integral, in which quantum theory is conceived of as a generalised stochastic process. One of the postulates of QMT is that events with zero quantum measure do not occur, however this is not sufficient to give a full picture of the quantum world. Determining the other postulates is a work in progress and this paper investigates a proposal called the Multiplicative Scheme for QMT in which the physical world corresponds, essentially, to a set of histories from the path integral. This scheme is applied to Sorkin's $n$-site hopper, a discrete, unitary model of a single particle on a ring of $n$ sites, motivated by free Schr\"odinger propagation. It is shown that the multiplicative scheme's global features lead to the conclusion that no non-trivial, time-finite event can occur.


Introduction
One motivation for reformulating quantum mechanics beyond the Copenhagen interpretation is to understand quantum mechanics without observers or measurements. Another is to bring quantum theory into harmony with relativity and the four dimensional world view of General Relativity. Such a framework would be relevant for quantum cosmology and could contribute to the construction of a theory of quantum gravity. A promising starting point for a realist and relativistic formulation of quantum mechanics is the path integral or sum-over-histories approach to quantum mechanics, initiated by P.A.M. Dirac [1] and developed by R.P. Feynman [2]. In the approach, for a given system, a history is the most complete description possible of the system throughout spacetime. For a single particle on a fixed spacetime a history would be a spacetime path, for two particles it would be a pair of spacetime paths and for a quantum field in a fixed spacetime it would be a field configuration on that spacetime. The path integral shifts the focus from the state vectors, Hilbert space, Schrödinger evolution, and state vector collapse of canonical quantum mechanics to spacetime histories, spacetime events and their amplitudes. This allows us to consider statements about the quantum world without appealing to the notion of collapse and measurement, and without having to perform the split of the universe into quantum system and classical measuring system necessary in Copenhagen quantum mechanics.
The path integral approach to quantum foundations has been championed particularly by J.B. Hartle and R.D. Sorkin and there is much common ground between Hartle's path integral version of Decoherent Histories [3,4,5] and Sorkin's Quantum Measure Theory (QMT) which conceives of quantum theory as a generalised stochastic process [6,7,8,9]. Quantum physics, in the path integral approach, is rooted in spacetime. The dynamics and initial condition of a quantum system are encoded in a Schwinger-Keldysh double path integral for the quantum measure [2,6], or, equivalently, decoherence functional [3,9,10] on spacetime events. Some frontiers of current knowledge in the path integral approach to quantum theory are signposted by more-or-less technical questions such as how to define the path integral for quantum mechanics as a mathematically well-defined integral over path space, including both "ultraviolet" problems associated with the continuity of spacetime (see e.g. [11,12,13]) and "infrared" problems associated with questions involving arbitrarily long times [11,14]. The central conceptual question in QMT is: "What, in the path integral approach to quantum theory, corresponds to the physical world?" In Quantum Measure Theory, the concept of a co-event has been proposed as that which represents the physical world. A co-event is an answer to every yes-no physical question that can be asked about the world, once the class of spacetime histories has been fixed. In this paper we investigate one proposal -the multiplicative schemefor the physical laws governing co-events. We work in the context of a one parameter family of discrete unitary quantum models, the n-site hopper [11]. The discreteness can be viewed as a ploy to sidestep the ultraviolet problems, referred to above, that arise in trying to define the path integral in the continuum, or more positively as something we may actually want to keep in the end. Indeed, Sorkin's motivation for developing Quantum Measure Theory is to employ it to build a quantum theory of gravity in which continuum spacetime emerges from a fundamentally discrete substructure.
In section 2 we introduce the n-site hopper as a quantum system within Quantum Measure Theory. We define the decoherence functional, the quantum measure and the law of preclusion. In section 3 we define the concept of a co-event and the Multiplicative Scheme. We prove the main result of the paper, that every non-trivial finite time event is a subevent of an event of measure zero. In the Multiplicative Scheme this implies that no non-trivial finite time event happens. We discuss the implications of this result in section 4.

The n-site Hopper
The n-site hopper model, proposed by Sorkin in [11], is a unitary quantum model of a particle on a ring of n > 1 spatial sites i ∈ Z n , with discrete times steps t = 0, 1, 2 . . .. For more details on the 2-site hopper see [12,14] and on the 3-site hopper see [15].
In QMT [16,17,18] a system is defined by a triple (Ω, A, D) where Ω is the set of histories, A is the event algebra and D is the decoherence functional. An event is a set of histories and the event algebra is the set of all events to which the theory assigns a measure. The event algebra is, then, a subset of the power set of Ω. The decoherence functional is a function with two arguments D : • For any finite collection of events • D(Ω, Ω) = 1 ; The quantum measure, µ(E), of an event E ∈ A is given by the diagonal of the decoherence functional D: We will now define each of these entities for the n-site hopper. First, the spacetime lattice is fixed so a history for the system is simply a path, γ, the hopper can take on the lattice. Each history is an infinite sequence of spatial sites which can be conceived of as a function γ : N → Z n or as an infinite string of sites. For example, here is the beginning of a particular history displayed in the two ways: Figure 1 gives a visualisation of this history for the 8-site hopper. The history space, Ω(n), is the set of all possible paths γ. Each path γ that starts at site i at t = 0 will have an initial amplitude of ψ i and n−1 i=0 |ψ i | 2 = 1. In the canonical approach the initial amplitudes are the initial state, |ψ = i ψ i |i . However, in a sum over histories approach to quantum mechanics where the focus is on the paths, not the state vector, these initial amplitudes should be thought of as summarising as much of the past as is necessary to make further predictions. From then on, at each time step the hopper transfers from site j to k with amplitude where for even n e 1 n for odd n and e(x) := e i2πx . So for n odd, ω n is an n th root of unity and for n even, ω n is a (2n) th root of unity. The form of U(n) is motivated by the propagator of a nonrelativistic free particle of mass m in continuum 1-d space from x i to x f in time T , given by [2] Moreover, U(n) is a unitary n × n matrix, U(n) jk only depends on the distance between sites rather than their absolute position, and U(n) j(k±n) = U(n) jk reflects the periodicity of the ring.
The form of the model as a process gives the space of histories a temporal structure. For a given time t ∈ N consider a finite path consisting of the first t + 1 sites of a history. We call such a truncated history a t-path γ t . The set of all such t-paths, for a given t, is Ω t (n) with cardinality |Ω t (n)| = n t+1 .
Each t-path, γ t , is associated to an event called a cylinder set which corresponds to the physical statement "the hopper's history agrees with γ t for the first t + 1 sites." The cylinder set, cyl(γ t ), is formally defined by For any two cylinder sets, either they are disjoint or one contains the other. The cylinder set for γ t can be expressed as a disjoint union of cylinder sets of t ′ -paths where t ′ > t in the following way. First, for the t-path γ t , consider the (t + 1)-path which is the extension of γ t , by the site j ∈ Z n at time t + 1. We write this extension as γ t j: The cylinder set of γ t is the disjoint union of all such extensions of γ t : Each cylinder set in this union can be similarly expressed as a disjoint union of cylinder sets of extended paths, and so on. We will call an event E which can be expressed as a finite union of cylinder sets time-finite because we can determine whether any given history γ is an element of E or not by only looking at the first (t + 1) values of γ for some finite t. For a time-finite event, E, and each t ∈ N we define a corresponding set of t-paths we also define the defining time t E , which is the least time t such that For example, consider the event E corresponding to the statement "The hopper is at site 0 at t = 0 or at site 1 at t = 1" for the 2-site hopper: E = cyl(0) ∪ cyl(11) = cyl(00) ∪ cyl(01) ∪ cyl (11) .
The path amplitude a[γ t ] of a t-path is given by the product of the sequence of transfer amplitudes and the initial amplitude The decoherence functional of two t-path cylinder sets is given by where the Kronecker delta ensures the paths meet at their end points and is a feature of unitary systems [5]. The decoherence functional D(E, F ) of two time-finite events is then given by where t = max{t E , t F } is the greater of the two defining times. Proof. where This gives us the quantum measure of a time-finite event E with defining time t E : where f is the final site of the t-paths and t ≥ t E .
Since the quantum measure of time-finite events is defined, the event algebra A(n) for the n-site hopper certainly includes all time-finite events. If µ were a classical measure it would have an extension from the semi-ring of time-finite events to the full sigma algebra generated by the time-finite events and A would then be this sigma algebra. However, the standard extension theorems cannot be used for quantum measures and we do not yet know to which events the measure can be extended [11,12]. For the purposes of this paper we will only need to consider the time-finite events so we will not address this question here.

Preclusions
In QMT, the quantum measure µ is viewed as a generalisation of a probability measure: quantum theories are generalisations of classical stochastic processes. Classical theories, in this view, are special cases of quantum measure theories. ‡ In general, quantum ‡ Classical and quantum theories are respectively the first and second levels in a countable, nested hierarchy of measure theories characterised by how much interference there is between histories [9].
interference means that the quantum measure does not satisfy the Kolmogorov sum rules and cannot be interpreted as a probability measure. The question then is, what is the physical significance of the quantum measure? The full answer is yet to be worked out, but at the current stage of development QMT assigns a central role to the concept of preclusion [19]: an event of zero measure is precluded ("almost surely does not happen"). It is useful to adopt the term null event to mean an event of measure zero and the Law of Preclusion is then: A null event is precluded.
Null events are therefore of central importance, so we will now investigate their structure in the case of the n-site hopper. For each t-path γ t we define the phase,ã[γ t ], of the path byã Note that this definition of the phase of a t-path does not include the phase of the initial amplitude but only depends on the structure of the path. Theñ where p ∈ Z n ′ (n) and n ′ (n) := 2n for even n n for odd n.
Now, for each time-finite event E ∈ A, each i, f ∈ Z n , p ∈ Z n ′ (n) , and each t ≥ t E let us define where | · | is the cardinality of a set. In other words, s t if p (E) is the number of t-paths in E t which begin at i, end at f and have phase ω n p . Recall that the quantum measure is for any t ≥ t E . The sum over t-path amplitudes in the formula for µ(E) can be reexpressed in terms of s t if p (E): E is null if and only if this sum is zero for each final site f . We use the fact that the roots of unity sum to zero to give the following identities Therefore, for odd n, E will be null if, for each i and f , the s t if p (E) are equal for all p. When n is even, E will be null if, for each i and f , the s t if p (E) are equal when the p's are of the same parity. However, this is trumped by the observation that ω n p+n = −ω n p for even n.
for all i, f, p ∈ Z n . The events described above will be null no matter what the initial amplitudes are, but there can also be events that are null depending on the initial amplitudes. If ψ i = cz i ω n p i for some fixed c ∈ C and integers z i and p i then and we see that it is possible that µ(E) = 0 even when the s t if p (E) are not equal for all p. A trivial example of this would be if ψ i = 0 for some i, then any event that only contains histories that start at i would be null.
Let us look at some examples. For the 2-site hopper, consider the event Then t A = 2, and all other s 2 if p (A) = 0. So A is null for any initial amplitudes. For the 5-site hopper, the event with all other s 4 if p (B) = 0. So B is null for any initial amplitudes. As a final example, in the 3-site hopper the event has t C = 2 and with all other s 2 if p (C) = 0. Let the initial amplitudes satisfy ψ 0 = ω 3 ψ 1 . The only final site for the 2-paths is f = 0. So the relevant sum is and so C is null.

Multiplicative Co-events
The set of all events, A, for a quantum measure system has a natural Boolean structure inherited from its being a subset of the power set of Ω. In QMT, possible physical worlds correspond to "answering" maps Equivalently we can say that A happens (does not happen) in the world φ. Such a map, φ, is called a co-event [16,18,20] as a reminder that the map takes events to scalars, one or zero. A co-event is a possible physical world since it gives an answer to every question that can be asked about the system, once the set of histories is fixed. One might say, "the world is everything that is the case and nothing that is not the case," echoing Wittgenstein.
A co-event is considered classical if it preserves the Boolean structure of A. In particular, it must be the case that the event "A and B" is affirmed iff A is affirmed and B is affirmed, that "A xor B" is affirmed iff A is affirmed or B is affirmed but not both, and that "nothing"= ∅ is denied and "something"= Ω is affirmed. Thus the classical co-events follow our intuitive logic. Moreover, for finite Ω, it can be shown that each classical co-event can be uniquely associated with a single history γ ∈ Ω, where physically γ is the history that happens. For example, for a ball passing through a left or a right slit, a classical co-event could be associated with the history γ ='right slit', which would affirm the event "the ball passes through the right slit", deny the event "the ball passes through the left slit" and affirm the event "the ball passes through the right or left slit". Now, the Law of Preclusion implies that a possible co-event, φ, must satisfy the condition When this condition holds we say that φ is a preclusive co-event. In classic stochastic theory, since µ would be a probability measure and therefore satisfies the Kolmogorov sum rule, it would always be possible to assign a classical co-event that is preclusive to the system, provided the associated history does not have zero probability. However, with a quantum measure it is possible to cover Ω with null events, which prevents the assignment of a preclusive classical co-event to the system [16,21]. Instead, in QMT we seek a more general framework for choosing co-events using the law of preclusion. However, this condition is not strong enough to give us all the predictions we want to be able to make. In particular, in the special case that the measure µ is classical we want to recover the usual classical co-events. To achieve this, more conditions on the possible co-events are required. We refer to a complete set of conditions to be imposed on co-events that defines the full set of possible worlds as a scheme.
In the multiplicative scheme [17], the most closely studied scheme to date [15,18,21], the possible co-events satisfy The scheme is attractive for several reasons. It can be shown that the multiplicative condition is, essentially, equivalent to the rule of inference known as modus ponens [22]. It can also be shown that, in systems with finite Ω, each multiplicative co-event can be uniquely associated with a subset of Ω, know as the support of the co-event. This gives the co-events a corresponding partial order, making it natural to add to the scheme the postulate that the allowed co-events are minimal in this order. If the measure is classical, then the minimal multiplicative co-events correspond to single histories in Ω, resulting in classical co-events. Further, Sorkin has shown that a minimal multiplicative co-event will be classical when restricted to the algebra of macroscopic events with permanent records. So, within the multiplicative scheme, "to the extent that one is willing to posit the existence of sufficiently permanent records of macroscopic events, one can [...] regard the measurement problem as solved" [18]. Whilst the multiplicative scheme has enjoyed these successes, the previous history spaces it had been applied to were small and had small fixed cut-off times. This is not the case with the n-site hopper model presented in this paper, which allows us to expose a problem with the multiplicative scheme. Any future scheme developed for QMT would need to take this problem into account.

A "Problem of Time"
In a classical theory, if an event A is denied by the physical world (does not happen), then any subevent of A is also denied. This property of the physical world also holds in the multiplicative scheme: Lemma 2. Let φ be a multiplicative co-event and F be an event. If φ(F ) = 0 and E ⊆ F , then φ(E) = 0. Proof.
In a classical theory this property is familiar and causes no difficulty. In QMT, quantum interference results in many more null events than in classical theory and the Law of Preclusion together with the above Lemma then vastly expands the set of events that must be denied by all allowed co-events. It is useful to have a term for this: if µ(A) = 0, so that A is precluded and B ⊂ A and µ(B) = 0, we say that in the multiplicative scheme B is stymied by A. The fact that in the multiplicative scheme there are events of nonzero measure that must be denied by all allowed co-events turns out to be problematic.
In the n-site hopper, the system is extended arbitrarily in time into the future. The space of t-paths, Ω t (n), grows exponentially with t and the number of time-finite events grows as an exponential of an exponential. The store of events that could potentially stymie any given fixed time-finite event therefore grows at a huge rate. In particular the most striking result follows from this next theorem, which is a generalisation of a theorem given in [12] for the 2-site hopper. The consequence of Theorem 1 and Lemma 2 for the multiplicative scheme is that all non-trivial time-finite events are stymied by a null time-finite event. The only timefinite events that are not always denied correspond to statements of the form "the hopper starts at site i or . . .". In fact, we shall see that for odd n there are certain initial conditions for which the result can be extended to stymie these events as well.
We will now prove a number of lemmas before proving Theorem 1 and discussing the implications of this result for multiplicative schemes. Recall that n ′ (n) := 2n for even n n for odd n.
This will allow us to make statements that cover both even and odd n.
Lemma 3. For the n-site hopper with even n, if a t-path with t ≥ 1 begins at site i, ends at site f and has phase ω n p where p ∈ Z 2n , then Proof. Consider the n-site hopper for any n. Consider the t-path γ t ∈ Ω t (n) with phasẽ a[γ t ] = ω n p where p ∈ Z n ′ (n) . Then Now specialise to even n, so n ′ (n) = 2n, and fix γ t (0) = i and γ t (t) = f . We have Noting that the mod 2n operation does not change the parity of the operand, we find and, using the fact that the parity of an integer is equal to the parity of its square Corollary 1. For the n-site hopper with n even, for any time-finite event E, if p ∈ Z 2n and i, f ∈ Z n satisfy p + i + f mod 2 = 1, then s t if p (E) = 0 ∀ t ≥ t E . Given this result we can restrict the sum over p in the measure calculation for even n to exclude trivially zero s t if p (E). Let us define The next lemma shows that the number of paths in E t , with fixed phase and initial and final sites, grows exponentially with t.
where c i (E) is the number of t E -paths in E t E that start at site i.
Proof. We will construct a path γ t ∈ E t , with phaseã[γ t ] = ω n p , that starts at site i and ends at site f , as a concatenation of three paths in three temporal regions as shown in figure 2. The first region is from time 0 to t E , the second from t E to t − 2(n − 1), and the third from t − 2(n − 1) to t. Now, for a t-path γ t to be in E t it must match up with one of the t E -paths γ t E ∈ E t E for the first t E steps, but after this there are no restrictions on it.  Figure 2. A diagram of a t-path across three temporal regions. The times are written along the bottom, the height of the path specifies the site at that time. Drawn in bold is a specific path in E t , in the first region on the left the path is given by γ 1 from site i to site j, in the middle region it is given by γ 2 from site j to site f , and in the final region it is given by γ 3 from site f to site f . In grey are other choices for γ 1 and γ 2 that can be used to find a new path in E t .
Choose a site j ∈ Z n . In the first region, choose γ 1 from among the paths in E t E that start at site i and end at site j. Let c ij (E) be the total number of possible choices for γ 1 .
In the second region, we choose γ 2 to be any path starting at site j at t E and ending at f at t − 2(n − 1). Between these two sites there are (t − t E − 2n + 1) time steps, and at each one the path could go to any one of the n sites, so there are n t−t E −2n+1 such paths to choose from.
In the third region γ 3 starts at site f and ends at f , but we must choose it carefully such that γ t , which is the concatenation of γ 1 , γ 2 and γ 3 , will have a phase ofã[γ t ] = ω n p . The phase isã Since we have already chosen γ 1 and γ 2 we have fixed for some q ∈ Z n,i,f , since γ 1 starts at i and γ 2 ends at f . Therefore, to get a γ t with the right phase we need to choose the path γ 3 such that its phase is For odd n, (p − q) mod n could be any number in Z n . For even n, since both p and q are in Z n,i,f , (p − q) mod 2n could be any number in {0, 2, . . . , 2(n − 1)}. With this in mind, we construct γ 3 in the following way. It starts by zig-zagging between f → (f + 1) → f a number of times and ends by staying at f for the remaining time steps. The number of time steps in region 3 allows for up to a maximum of (n − 1) zig-zags, the exact number of which will determine the amplitude of γ 3 in the following way for even n (71) including the phase ω n (p−q) mod n ′ (n) required to give γ t the phase we want. In conclusion, the number of γ t with phase ω p n that can constructed in this way equals Defining c i (E) = j c ij (E) we can place the lower bound on s t if p (E): the total number of t-paths in E t that start at site i, end at site f , and have phase ω n We will now prove a few lemmas that show that the unitary dynamics is periodic.
Lemma 5. The matrix U(n) for the n-site hopper has eigenvectors [v j ], j ∈ Z n , with components with corresponding eigenvalues for even n e −j 2 4n for n ≡ 1 (mod 4) and even j i e −j 2 4n for n ≡ 1 (mod 4) and odd j i e −j 2 4n for n ≡ 3 (mod 4) and even j e −j 2 4n for n ≡ 3 (mod 4) and odd j. (75) Proof. First note that Therefore U(n) is a circulant matrix. All n × n circulant matrices have orthonormal eigenvalues v j of the form [23] [ where j, k run through Z n . Now, we will use this to derive the eigenvalues But ω n n 2 −2nk = 1 for both even and odd n, and e(−j) = 1 so This implies where n is a natural number and a and b are usually integers or half-integers. Now, we will use the Landsberg-Schaar relation for Gauss sums [24]. For any a, n ∈ N and b ∈ Z, if an + b is even then For a proof to a similar relation that can be easily generalised to this see [25]. Now, for even n we have For odd n we have for n ≡ 1 (mod 4) and even j i e −j 2 4n for n ≡ 1 (mod 4) and odd j i e −j 2 4n for n ≡ 3 (mod 4) and even j e −j 2 4n for n ≡ 3 (mod 4) and odd j. (93) Proof. First, notice that we can use the eigenvectors from Lemma 5 to form unitary For n = 4m + 2, m ∈ N = −1 .
Corollary 2. For all n site hoppers We will now prove Theorem 1.
Proof of Theorem 1. Let E be a time-finite event for the n-site hopper such that E ⊇ cyl(i) ∀ i. LetĒ := Ω(n) \ E be the complement of E. Note thatĒ is a time-finite event and tĒ = t E . We will construct a superset of E, F = E ∪ G, where G ⊆Ē, such that µ(F ) = 0. We will do this by choosing a t > t E large enough and selecting t-paths fromĒ t with amplitudes that cancel the amplitudes in µ(E). G is then the union of the cylinder sets of these selected t-paths. We Notice that where we used that E t−1 still contains all the histories needed to reproduce E because (t − 1) ≥ t E . Now, applying (107) iteratively to (105) gives Then we choose t = t E + 4nm for some m ∈ N, so we can use corollary 2 to replace U(n) t−t E with the identity: (110) The number of paths in E t that start at site i, end at site f and have phase ω n p is bounded from below by Lemma 4 Since E ⊇ cyl(i) for any initial site i,Ē must contain paths that starts at site i, so c i (Ē) ≥ 1. Therefore, for every i, f ∈ Z n and p ∈ Z n,i,f , s t if p (Ē) will scale at least as fast n t . In particular, this means there will exist a finite m, and therefore a finite t = t E + 4nm, such that Given such a t, since G can be any subset ofĒ, we can choose unique paths inĒ t that start at site i and end at site f with phase ω n p to construct a G t such that for all i, f ∈ Z n and p ∈ Z n,i,f . Note that the right hand side is a non-negative integer so this is allowed. Substituting s t if p (G) into (110) gives where we used (32), (33) and (34) in the last step.

Null events dependent on the initial amplitudes
We will now show that, for certain initial amplitudes, it is even possible to stymie "initial position" events, i.e. events E where E ⊇ cyl(i) for some i for which ψ i = 0. We first define the following set of initial sites For this scenario we will split our event E into the subsets E (i) defined by Note that for i ∈ I(E), E (i) = cyl(i), and thus t E (i) = 0. Therefore for all by applying (107) iteratively. Now, E Therefore, if zǐ divides n T /2 z f , we can make this choice for G, and we can use (32) to show that µ(F ) = 0. Note that if we tried to apply this argument to the even n-site hopper we would have the further restriction that s Ť ıf p (G) = 0 necessarily if p ∈ Z n,ǐ−f , and so if q f ∈ Z n,ǐ−f we would not be able to satisfy the condition.

Discussion
Our result shows that the Multiplicative Scheme for the n-site hopper has a rather severe "infrared" problem stemming from the existence of null events with arbitrarily large defining times. To what extent does this indicate a problem with the Multiplicative Scheme more generally?
One possibility for escaping the conclusion that no time-finite event happens is to postulate that the universe is finite in extent in time. For the n-site hopper, this translates into a time t max at which the universe ends, so we are not free to look for stymieing null events with defining times larger than t max . Inspecting the proof of Theorem 1 we see that to stymie an event E, we constructed a null event with defining time that was at least of order n larger than t E . So, for example, if n ≫ t max , then it is likely that this issue can be avoided.
Even if the "no time-finite event happens" problem can be alleviated in some way, the stymieing of events by null events with later defining times is inherent in the Multiplicative Scheme. Consider for example the 2-site hopper event, E = cyl(001) ∪ cyl(0000) ∪ cyl(0101) = cyl(0010) ∪ cyl(0011) ∪ cyl(0000) ∪ cyl(0101) with t E = 3. Then we have, s 3 000 = s 3 002 = s 3 011 = s 3 013 = 1 which implies that E is null. E stymies subevents with the same defining time, such as cyl(0000) ∪ cyl(0101). It also stymies events of the form "E and then something". An example is cyl(00101) ∪ cyl(00111) ∪ 00001 ∪ cyl(01011) which corresponds to "E and then the hopper is at site 1 at time t = 4". These are examples of physical inferences of a sort familiar from classical physics. But stymieing also blocks events to E's past, such as cyl(001). It is this latter effect, this essentially global-in-time nature of the multiplicative scheme which is disturbing, and it is not confined to the n-site hopper. § This could be an appealing result to anyone who thinks of the universe as a single, simultaneously existing, spacetime block [26,27], but for those who favour the concept of Becoming, the stymieing of events in the past is in conflict with the idea of a physical passage of time [28,29]. Moreover, this feature makes physical prediction highly impractical: to know what events are possible at early times we have to look at all future events and their measures first. § These problems are absent when the theory is classical because a classical (probability) measure obeys Prob(G) = 0 ⇒ Prob(E) = 0 for any G ⊃ E. Therefore, there is no stymieing since subevents of a null event are null and precluded in their own right.
One could argue that the n-site hopper is an exception because it is highly symmetric and regular, which means that the number of t-paths in Ω(n) t grows exponentially whilst the number of t-path phases is fixed at n ′ (n), resulting in many null events. However, it seems plausible that there exists a larger class of models with unitary transfer matrices, U, such that for every time-finite event E there exists a sequence of time-finite supersets F k ⊃ E with increasing t F k , such that for any given ǫ > 0 we can find a K such that µ(F k ) < ǫ ∀ k ≥ K. The question of how to deal with "approximate preclusion" is an open one in Quantum Measure Theory but for such a situation, it would be hard to avoid the conclusion that E would be stymied.
To work towards finding such a class of models, consider a hopper on the same n-spatial-sites lattice, with the same set of histories Ω(n) but with a general unitary transfer matrix U of dimension n. And consider an event E.
where we used that |U jk | ≤ 1 for a unitary matrix. So whilst in the n-site hopper we could find times where the sum of amplitudes over t-paths in E t was unchanged, for a more general unitary system this sum of amplitudes is bounded in magnitude from above. And so one could potentially proceed along the same lines as the proof for Theorem 1 by arguing that for a large enough t there are enough paths outside of E with the right amplitudes to cancel E's amplitude, and since the amplitudes are becoming smaller in magnitude for longer paths, but not too small, we can make this cancellation more and more precise to make the measure as small as we like. There is reason to believe that one could show this using the fact that the quantum measure for most unitary systems is not of bounded variation [12]. There is another, related, aspect of the multiplicative scheme that seems problematic: for unitary systems the only way that a history, γ ∈ Ω, can distinguish itself dynamically from another, γ ′ that ends at the same position, is via its amplitude. If the amplitudes of γ and γ ′ are equal the dynamical laws that govern the allowed co-events of the Multiplicative Scheme treat them the same. For example, given a null event, E, we can replace any history, γ ∈ E with another history, γ ′ / ∈ E with the same amplitude to get a new null event, E ′ . And if γ is an element of the support of an allowed multiplicative co-event, then it can be replaced by γ ′ with the same amplitude to give another allowed co-event. If the n-site hopper is a guide, there will always be many more histories than there are amplitudes and there will be wildly different histories sharing the same amplitude. It seems that any scheme that treats all histories with the same amplitude equally would struggle to provide an explanation of the emergence of classical behaviour from quantum theory.
There are at least two possible avenues for revising the scheme: change the preclusion law or give up multiplicativity. As a physical guide to how to make these revisions we can look to the nature of the model as a temporal process and to the heuristic of Becoming. For example, we could consider relaxing the strict Law of Preclusion and instead adopt a new rule that null events that would stymie earlier events are not precluded: "Prior Existence trumps Law." Or, we could keep the strict preclusion rule but drop the multiplicative condition in favour of an evolving construction in which, for each t there is a time-finite co-event φ t on the subalgebra, A t of events with defining time t or less. This partial co-event corresponds to the physical world of the hopper system up to time t. We build up the co-event step by step and require that at each time t the partial co-event agrees with the previous partial co-event on subalgebra A t−1 . Note that the number of potential partial co-events grows as 2 2 |Ω t | and there must be additional conditions on allowed co-events in order for the scheme to be viable. This is under current investigation.
Finally, the n-site hopper was introduced as a discrete analogue of the free particle in the continuum. We can ask to what extent this is more than an analogy: is there a continuum limit for the n-site hopper which gives the continuum propagator? Consider These Gauss sums can be transformed to other Gauss sums over O(t) terms using the Landsberg-Schaar relation given in Lemma 5. The values of these sums are not generally known, however we can compare this to the propagator for a particle on a ring of radius R where φ is the angular position on the ring. This looks very similar in form to the Gauss sums for the n-site hopper. It remains to be shown if there is a way to take the limit n → ∞ so that [U(n) t ] if (appropriately rescaled) tends to the propagator on the ring, or the free propagator on the line. If so, this would increase the relevance of the n-site hopper. The decoherence functional or quantum measure in the continuum is not yet able to be defined for events other than finite unions of events corresponding to finite sequences of projections onto position [5,11,30,31]. If the n-site hoppers have a continuum limit one could potentially use this to define the quantum measure of an event in the continuum as the limit of a sequence of appropriate n-site hopper events as n → ∞.