Preprint
Article

This version is not peer-reviewed.

Causal Set Approach to AQFT

Submitted:

19 January 2026

Posted:

21 January 2026

You are already at the latest version

Abstract
The goal of this paper is to combine algebraic quantum field theory with methods from modal logic and the causal set program. We introduce a factorially damped past-influence operator on causal sets, formulate locally covariant nets over Alexandrov intervals, and give discrete analogues of the Haag–Kastler axioms. We close by sketching a route toward dynamics via sequential growth and incidence-algebra localization.
Keywords: 
;  ;  ;  ;  ;  

Organization

In §1, we introduce the Haag–Kastler axioms, and describe the categories that make up an algebraic quantum field theory. It is here that we introduce an important example 1.1, which reminds one of the approach taken in [5]. The overall goal of the section is to highlight the axiomatic, functorial nature of AQFTs, allowing the paper to be more self-contained.
In §2, we introduce the causal set framework of Dowker and Sorkin [7,14]. It is in this section that we begin dabbling with some modal logic, and state our main result, Theorem 2.1. We implement a factorially damping so that non-necessary (past) frames exert a weakened influence upon the presence, modelling diffusion. We then recast AQFT in terms of (modal) causets in §2.2, and we manage to discretize all the Haag–Kastler axioms, as well as make contact between the modal damping formula and AQFT.
Having laid down the kinematics, in §3 we discuss causet dynamics. We suggest a very simple way to tie these dynamics to AQFTs, thus bringing our paper full circle.

1. Introduction: AQFTs

Many QFTs, including non-linear Σ -models, topological quantum field theories (TQFTs), and algebraic quantum field theories (AQFTs) are essentially functorial; i.e., the theories can be realized as a functor:
Z : S T
between (typically symmetric monoidal) categories. For instance, if we take S to be the category Loc m of m = ( n + 1 ) -dimensional spacetimes and T to be the category Alg C * of complex *-algebras, then we recover the Benini–Perin–Schenkel (BPS) formalism (a type of axiomatic AQFT) from [2]. However, the BPS model is actually a special case of Fewster–Verch [9,10], in which Z becomes a functor:
A : Loc Phys
where Phys is a “suitable category of physical systems," i.e., Alg or C * - Alg . The specific algebra will always be a subalgebra of the algebra of all bounded operators on a Hilbert space, which is denoted in the literature by B ( H ) .
Definition 1.1. 
The category Loc has:
1. 
Objects: quadruples M = ( M , g , o , t ) where: ( M , g ) is a nonempty (smooth paracompact globally hyperbolic Lorentzian) spacetime of spacetime dimension m with at most finitely many connected components o is a choice of orientation t is a choice of time-orientation
2. 
Morphisms: smooth isometric embeddings, preserving both orientations, with causally convex image
Rather than being implemented “by hand," the observables of the theory are given in terms of elements γ of algebras assigned by sub-theories B i A which obey a few key axioms, including the Reeh-Schlieder theorem [6,9,10,15] of the vacuum representation, and Einstein causality [2,15]. The key property of γ means it satisfies the identity:
| | γ * γ | | = | | γ | | 2
which is known as the C * -property. Further, AQFTs are generally expected to satisfy another property, known as isotony, which states that if O 1 O 2 is an inclusion of spacetime regions, then there is an inclusion of algebras given by A ( O 1 ) A ( O 2 ) .1
A popular choice for local quantum physics (LQP) is to let each B i ( M ) A ( M ) be chosen such that we have an inclusion M i : M where M i are the sub-objects of M such that
M i ( N i M , g , o , t ) .
Then, M is the universal spacetime, and the N i are then an orientation-preserving localizations of M .
Usually, we would want to consider diffeomorphisms2 of spacetimes M f M g granted by considering isomorphic theories
B i , f ( ) B i , g ( )
and thus promote the (Cauchy) morphisms of Loc to isomorphisms in the algebra category. This latter property is known as the “timeslice axiom" [9,10].
Example 1.1. 
Let M be an Alexandrov double-cone (causal diamond) in Minkowski space; then, the N i that preserve both orientations are the sublightcones including subsets of the past, future, and present strata of M . Then, our nets assign algebras of observables to every ℓ-local point, where
= M + M
is the present region.3
In other words, we have a minimal algebra of observables given by B N ( ) , and a nested chain of embeddings B N ( ) B N 1 . . . B 0 where N is the number of connected components4 of N 0 , acting as a finite cutoff to ensure that the physics is coherent.
Let N i , 1 and N i , 2 be two causally disjoint components of the global lightcone; then, pick representatives a B i , 1 ( ) and b B i , 2 ( ) ; Einstein causality5 tells us that they commute:
[ a , b ] = 0 .
Finally, one assumes translation covariance and the spectrum condition in the vacuum sector. Concretely, let U ( a ) = e i a μ P μ be a strongly continuous unitary representation of spacetime translations on H implementing covariance. The spectrum condition is that the joint spectrum of the generators P μ lies in the closed forward lightcone. The vacuum vector Ω is invariant under translations,
U ( a ) Ω = Ω for all translations a ,
and is unique up to a phase.

2. Causal Sets

In a flat Minkowski spacetime, there is a ready-made description in terms of causal sets (causets). The macroscopic, manifoldlike structure of the spacetime arises as a faithfully embeddable limit of causets. In this language, spacetime points x M 4 are called events. Then, a causal set is defined by
C = ( E , )
where E is a set of events (typically countable and locally finite); for intuition one may consider a labeled subset { x i } i Z E , but no global labeling is assumed and ≺ is an order relationship satisfying6:
  • (transitivity): x y z x z
  • (local finiteness) for all x , z E with x z , the Alexandrov interval
    I ( x , z ) { y E x y z }
    is finite.
  • (irreflexivity) x E such that x x .
Definition 2.1. 
Given a causal set C = ( E , ) , the Alexandrov topology τ A is the topology generated by sets of the form
I ( x , y ) = { z E | x z y } .
Remark 2.1. 
The topology is derived, not assumed; ergo, no manifold structure or Hausdorff property is required.
Definition 2.2. 
A space K n equipped with k time dimensions is denoted by K n + k and is called a spacetime.
Two points in a spacetime comparable by the order x y are said to be causally related, and are often additionally required (in sequential growth dynamics) to satisfy Bell causality.7. For two causally related spacetime points, x is said to be “in the past" of y (or called an ancestor of y), and y is said to be “in the future" (or a descendant of x) if x y .
Example 2.1. 
One may model a discrete “time axis” by a chain { x i } i Z with x i x j i < j . This is only a simplifying example and is not assumed in the general causal set framework.

2.1. Past-Step Modalities and Factorial Damping

Notation 2.1. 
Write y · x if y x and there is no z with y z x . We call · the link relation. For n N , let
Past n ( x ) : = { y E : x 0 , , x n with x 0 = y , x n = x , and x 0 · x 1 · · x n } .
We also set Past 0 ( x ) : = { x } .
Definition 2.3. 
For each n N 0 define an n-step past necessity modality P n by
x P n φ y Past n ( x ) , y φ .
We emphasize that P n is indexed by n; it is not an inverse power of a single operator.8
Definition 2.4. 
Let f : E C be a (field / observable-valued) function on events. Define the past-link adjacency operator B by
( B f ) ( x ) : = y · x f ( y ) .
Then B n f ( x ) is a sum over length-n link-chains ending at x (counting multiplicity of chains).
Axiom 2.1 
(Factorially damped past influence). Fix a coupling parameter λ C . The total influence of past events on the present is encoded by the exponential generating operator
U ( λ ) : = e λ B = n 0 λ n n ! B n .
Thus the contribution from events n link-steps in the past is weighted by 1 / n ! (up to λ n ), and the overall past influence at x is ( U ( λ ) f ) ( x ) .
Remark 2.2. 
This gives a canonical discrete causal propagator on the Hasse diagram, compatible with link-composition and suitable for transporting local algebraic data along the net.
Remark 2.3. 
The factorial weighting is not imposed ad hoc: it is exactly what makes U compose cleanly as a one-parameter semigroup,
U ( λ ) U ( μ ) = U ( λ + μ ) ,
which is the discrete-causal analogue of propagating influence through “elapsed causal depth.” By contrast, treating the individual coefficients 1 n ! B n as literal “powers” does not respect composition without extra binomial factors.

Main result: finite propagation, covariance, and truncation

The operator U ( λ ) = e λ B is the technical hinge connecting modal damping to AQFT-style local propagation. On a finite causet region it is automatically well-defined (as a finite polynomial in B), and its action admits an explicit causal kernel.
Theorem 2.1 
(Causal support and covariance of the factorial propagator). Let C = ( E , ) be a causal set and let I E be a finite Alexandrov interval (or, more generally, any finite causally convex subset). Let B be the past-link adjacency operator restricted to I, and define U ( λ ) = e λ B as in (2.5). Then:
1. 
(Finite propagation / causal support). For every x I and every function f : I C ,
( U ( λ ) f ) ( x ) = y I , y x K λ ( x , y ) f ( y ) ,
where
K λ ( x , y ) : = n 0 λ n n ! N n ( y x ) ,
and N n ( y x ) is the number of link-chains of length n from y to x. In particular, K λ ( x , y ) = 0 unless y lies in the causal past of x.
2. 
(Polynomiality on finite regions). If | I | = N , then B N = 0 on I (equivalently, B is nilpotent), hence
U ( λ ) = n = 0 N 1 λ n n ! B n
is a finite sum.
3. 
(Discrete covariance). If g : I I is an order-automorphism (a poset automorphism), and ( g · f ) ( x ) : = f ( g 1 x ) is the induced action on functions, then
U ( λ ) ( g · f ) = g · ( U ( λ ) f ) .
Proof. (1) Expanding (2.5) gives U ( λ ) f = n 0 λ n n ! B n f . By definition of B, the value ( B n f ) ( x ) is a sum of f ( y ) over length-n link-chains y = x 0 · x 1 · · x n = x ; collecting coefficients yields (2.7)–(2.8), and shows y x is necessary. (2) Choose any linear extension of ⪯ on I; then B is strictly lower triangular in that basis, hence nilpotent with index at most N, giving (2.9). (3) An order-automorphism preserves link relations, so it conjugates B (and hence B n ) under the pullback action on functions. Therefore U ( λ ) = λ n n ! B n commutes with the action, giving (2.10). □
Corollary 2.1 
(Locality of influence). For x I , the value ( U ( λ ) f ) ( x ) depends only on the restriction of f to the causal past { y I : y x } .
Corollary 2.2 
(A simple truncation bound). Equip functions f : I C with the sup norm f = sup x I | f ( x ) | , and let Δ : = max x I # { y I : y · x } be the maximal past-link degree. Then B f Δ f . Consequently, for any k 0 the truncated propagator U k ( λ ) : = n = 0 k λ n n ! B n satisfies
( U ( λ ) U k ( λ ) ) f n = k + 1 N 1 | λ | n Δ n n ! f .
Let x M 4 be a point of Minkowski spacetime corresponding (under an embedding / sprinkling9) to an event x 0 E .
Definition 2.5. 
The present representative x 0 is a maximal element of a finite Alexandrov interval up to isomorphism.
Formally: fix a causet C = ( E , ) and a finite interval I ( x , x + ) . The present representative is defined to be the x 0 I ( x , x + ) which is maximal w.r.t. ≺. Any two such choices are declared equivalent if they are related by an automorphism of the induced subposet.
Remark 2.4. 
The above gives us gauge freedom, and is meaningful from a LQP perspective. No global present is assumed or required.
We interpret x 0 as a present representative for the fixed interval I ( x , x + ) , i.e. a gauge-chosen “necessary” frame organizing modal accessibility within that interval, reminiscent of [5].
Denote the set of present (necessary) events by C / E , and write x 0 C / . To relate this to the causal order, fix a choice of a past-directed link-chain
x n · x ( n 1 ) · · x 1 · x 0 , n N ,
so that x n Past n ( x 0 ) in the sense of Notation 2.1.10
We also consider two auxiliary collections of events:
  • C / E , the previously possible events11;
  • C / + E , the future-possible events.
Their intersection
C / 0 : = C / C / +
is interpreted as the “kinematically admissible” present slice (possible from both past and future perspectives). We assume that the necessary present sits inside this admissible slice:
C / C / 0 .
Axiom 2.2. 
(Reflexive necessity) The present event is 0-steps from itself, i.e. Past 0 ( x 0 ) = { x 0 } . Past dependence is encoded by the indexed past modalities P n (Definition 2.3), rather than by negative powers of □. Concretely, P n φ expresses a necessity condition12 on all events n link-steps in the past of x 0 .
Remark 2.5. 
Heuristically, a chosen past chain ( x n ) n N may be viewed as a directed approximation of the present event x 0 from the past.

2.2. Locally Covariant Nets on Causal Sets

The abstract causal–modal framework developed above admits a direct reformulation in the language of algebraic quantum field theory once spacetime regions are replaced by suitable order-theoretic domains. In this subsection we construct a net of local algebras over a causal set and formulate discrete analogues of the Haag–Kastler axioms, thereby reconnecting the modal lightcone formalism with AQFT proper.

2.2.1. Nets on Causal Sets

Let ( C , ) be a locally finite causal set. Let Int ( C ) denote the category whose objects are finite Alexandrov intervals I ( x , y ) C and whose morphisms are inclusions I ( x , y ) I ( x , y ) . We use the Alexandrov topology τ A of Definition 2.1 only as a derived notion of locality.
A net of local algebras on C is a covariant functor
A : Int ( C ) Phys ,
where Phys denotes a category of physical systems, such as unital *-algebras or C * -algebras. To each Alexandrov interval I ( x , y ) the functor assigns a local algebra
I ( x , y ) A ( I ( x , y ) ) ,
interpreted as the algebra of observables localized within the causal diamond determined by x and y.
Functoriality is implemented via inclusions of intervals:
I ( x , y ) I ( x , y ) A ( I ( x , y ) ) A ( I ( x , y ) ) .
These inclusions are induced by order-theoretic containment of Alexandrov intervals, ensuring that algebraic localization respects the discrete causal structure.
Remark 2.6 
(Why the causal set formulation is not merely a translation). Working over Int ( C ) is not only a cosmetic replacement of open subsets of a manifold by order-theoretic regions. In a general causal set there is no canonical notion of Cauchy surface, nor a preferred differential structure, and even the availability of “time-slice” hypersurfaces becomes a genuinely nontrivial condition. Moreover, locality and causal disjointness become purely order-theoretic constraints, and the factorially damped modal operator U ( λ ) = exp ( λ B ) supplies a canonical (and tunable) mechanism for controlled propagation along the Hasse diagram. In this sense the causal set axioms below encode genuinely discrete content rather than a formal rephrasing of the continuum Haag–Kastler setup.

2.2.2. Discrete Haag–Kastler Axioms

Within this framework, the Haag–Kastler axioms admit natural reformulations adapted to the partial order ⪯.

Isotony.

For any pair of intervals I 1 , I 2 C ,
I 1 I 2 A ( I 1 ) A ( I 2 ) .

Einstein causality.

If two intervals I 1 = I ( x 1 , y 1 ) and I 2 = I ( x 2 , y 2 ) are spacelike separated in the sense that no event of I 1 is comparable to any event of I 2 (i.e. for all a I 1 and b I 2 , neither a b nor b a holds), then the corresponding algebras commute:
[ A ( I 1 ) , A ( I 2 ) ] = 0 .

Time-slice axiom (discrete).

Assume C admits a causally convex slice S intersecting every maximal chain in a chosen finite region exactly once.
Then,
A ( I ) = A ( S ) , for every interval I S ,
denotes the C * -algebra generated by the indicated subalgebras.
Property 2.1 
(Functoriality of factorially damped modal transport on intervals). Let C be a causal set and let A : Int ( C ) Alg be a causal net on Alexandrov intervals, with isotony maps
ι I J : A ( I ) A ( J ) for I J
in Int ( C ) . Fix λ R 0 and assume that for each interval I Int ( C ) the algebra A ( I ) carries a (linear) action of the link-adjacency operator B I induced by the Hasse diagram of I (e.g. by acting on coefficient functions in a chosen presentation of A ( I ) ), and define the factorially damped operator
U I ( λ ) : = exp ( λ B I ) = n 0 λ n n ! B I n
on A ( I ) . Then for every inclusion I J in Int ( C ) the diagram
Preprints 195124 i001
commutes, i.e. ι I J U I ( λ ) = U J ( λ ) ι I J .
Proof. 
The inclusion I J induces an inclusion of Hasse diagrams (links inside I remain links when regarded inside J). Hence the adjacency operators are compatible in the sense that B J restricts to B I on the subinterval I, and therefore
ι I J B I = B J ι I J .
By induction this implies ι I J B I n = B J n ι I J for all n 0 . Applying this termwise to the exponential series gives
ι I J U I ( λ ) = n 0 λ n n ! ι I J B I n = n 0 λ n n ! B J n ι I J = U J ( λ ) ι I J ,
as claimed. □
Corollary 2.3. 
The family { U I ( λ ) } I Int ( C ) defines a natural endomorphism of the functor A : Int ( C ) Alg . In particular, factorially damped modal transport is compatible with isotony, so that “evolving inside a smaller interval and then embedding” equals “embedding first and evolving inside the larger interval.”
Definition 2.6. 
For any causally convex subset S C , define
A ( S ) : = lim I S A ( I ) ,
the inductive limit over all finite Alexandrov intervals I contained in S.
Causal propagation along the net is implemented by the factorially damped operator of (2.5)
U ( λ ) : = e λ B ,
where B is the causal adjacency operator on the Hasse diagram of C . This operator acts as a discrete causal propagator, implementing algebraic transport between successive layers of the net.

2.2.3. Cauchy Slices and the Necessary Present

The modal lightcone construction introduced earlier singles out distinguished slices of the causet. The necessary present slice C / , together with the admissible slice C / 0 , play the role of discrete Cauchy surfaces. Each such slice determines a subalgebra
A ( C / ) A ( C ) ,
from which the full net may be reconstructed via causal propagation.
This identification permits the formulation of initial-value problems, state selection, and vacuum-like conditions entirely within the causal-set framework. In this sense, the modal present functions as a discretized analogue of a global Cauchy hypersurface, anchoring the dynamical content of the theory.
Remark 2.7 
(Choice of local algebras). The abstract formulation above leaves open the precise nature of the objects of Phys and of the inclusions A ( I 1 ) A ( I 2 ) . From the perspective of algebraic quantum field theory, several natural choices present themselves.
  • (i) C * -algebras. A canonical choice is to take Phys to be the category of unital C * -algebras with injective *-homomorphisms. In this case, A ( I ) is interpreted as the algebra of bounded observables measurable within the Alexandrov interval I, and isotony is realized as C * -subalgebra inclusion. This choice aligns most closely with the Haag–Kastler framework and ensures the existence of well-behaved state spaces.
  • (ii) von Neumann algebras. Alternatively, one may assign to each interval I a von Neumann algebra A ( I ) B ( H ) , obtained as the weak closure of a corresponding C * -algebra in a chosen representation. In this setting, causal propagation along the net admits a natural modular-theoretic interpretation, and the discrete propagator U ( λ ) may be compared with Tomita–Takesaki modular flows [4].
  • (iii) Quasilocal algebra. The global algebra
    A ( C ) : = I C A ( I ) ¯
    is naturally interpreted as the quasilocal algebra of the theory, where the closure is taken in the norm topology. Subalgebras associated with slices such as C / or C 0 then serve as candidates for initial-data algebras, from which the full net may be reconstructed via causal propagation.
  • (iv) Subalgebras and localization. For any causally convex subset S C , the associated algebra A ( S ) should be understood as the inductive limit of the algebras A ( I ) over all Alexandrov intervals I S . This ensures that localization is stable under refinement of the causal domain and is compatible with the discrete time-slice axiom.
    In all cases, the causal set structure provides a canonical notion of locality, while the choice of algebraic category determines the analytical and representational content of the theory. The framework is therefore flexible enough to accommodate both kinematical constructions and dynamical state-selection schemes.

3. Dynamical and Other Aspects of Causets

Thus far, the above description has been purely kinematic; thus, it cannot be said to be a full theory of physics. We are impelled by classical wisdom now to describe the dynamics of the theory, in a way that is consistent with both the frameworks of causets and those of AQFT.
It has been suggested by Sorkin that time itself (also dubbed “growth" or cosmological accretion) is a stochastic process, akin to Brownian motion [14]. This view was taken up by Sorkin and Rideout in [12], and it involves fixing an unphysical “external time” (ET) parameter, which plays the rôle of a gauge variable. ET is constituted by a labelling of the events x i by a function label i ( x ) satisfying
x i y i label i ( x ) label i ( y ) .
The analogue of gauge invariance (dubbed discrete general covariance) is then the slogan “labels are unphysical."
The authors of [12] concluded that the transition probability α n from a causet C n to any C n + 1 is given by
α n = p m ( 1 p ) n ϖ
whence there are m maximal elements in C n and ϖ is the size of the entire precursor set. Some care is then taken to ensure that the discrete general covariance holds, and that the Einstein-Bell causality is satisfied.
The authors themselves note that this description does not obviously translate into a notion of gauge invariance on a resulting manifold. One route there would be to consider each collection of chains (bounded region X) as a T 0 -topological space with a poset-structure [11]. This effectively amounts to taking an enrichment C Top of the causet category from (2.12). The poset relation is then given by x y , which means “the convergence of the constant sequence ( x ) to y in the T 0 topology of P", where P is the quotient of X by an equivalence relation between events.13 This enrichment supplies the minimal topological and categorical structure needed to pass from bare causal order to algebraic localization.
Given such a finitary T 0 -poset P, a standard algebraic avatar of its causal-topological information is the (Rota) incidence algebra
Ω ( P ) : = span C { p q : p , q P } ,
equipped with the associative product induced by concatenation of composable arrows:
( p q ) · ( r s ) : = p s if q = r , 0 otherwise .
The passage P Ω ( P ) may be regarded as a quantization of the underlying finitary causal topology itself, since the causal arrow-relations p q now admit coherent superpositions in the C -linear envelope Ω ( P ) .
To recover a notion of “(quantum) points,” one passes to the primitive spectrum Prim ( Ω ( P ) ) , identifying points with kernels of irreducible finite-dimensional representations of Ω ( P ) . A corresponding finitary topology is then induced on Prim ( Ω ( P ) ) by a relation generated intrinsically from the noncommutative product structure14 of Ω ( P ) . In this way, one spatializes the algebraic data back into a topological object, but now in a manner that is sensitive to the noncommutativity which encodes quantum interference of causal connections.
Moreover, Ω ( P ) carries a natural Z 0 -grading
Ω ( P ) = Ω 0 Ω 1 Ω 2 ,
where Ω 0 may be viewed as a discrete algebra of “coordinates” on P, and Ω 1 as higher-degree discrete differential forms. In this framework, bounded causet regions X may be endowed not only with finitary causal-topological structure, but also with a discrete differential calculus, providing a principled route from purely order-theoretic kinematics to geometric field content.
At this stage, one may combine the kinematical locality of AQFT with the stochastic “growth” dynamics of causal sets as follows. To each bounded region X (e.g. a suitable collection of chains, or a causally convex subcauset), we associate a finitary T 0 -poset P X , and hence an incidence algebra Ω ( P X ) . Thus one obtains an algebra assignment
X Ω ( P X ) ,
which is contravariantly compatible with refinement of regions (or, dually, covariantly compatible with coarse-graining). This has precisely the net-like shape expected in AQFT: smaller regions determine subalgebras or restriction maps, and global information is assembled from local data.
Finally, the Rideout–Sorkin sequential growth dynamics supplies a natural probabilistic law on the space of finite causet histories. Note that each growth step C n C n + 1 induces, after passage through the finitary T 0 -poset representation, a corresponding transition of local algebraic data associated to bounded regions.
Ω ( P n ) Ω ( P n + 1 ) ,
and hence a stochastic evolution not merely of events, but of the algebraic carriers of causal information themselves. In this way, one may regard the growth law as generating a dynamical measure on nets of local incidence algebras, giving a concrete sense in which “labels are unphysical” becomes compatible with a gauge-like covariance principle at the algebraic level.

4. Future Work

The present manuscript has focused on a concrete kinematical package: (i) a factorially damped causal propagator U ( λ ) = e λ B with finite propagation and discrete covariance (Proposition 2.1), and (ii) a causet-indexed net of local algebras satisfying discrete Haag–Kastler-type axioms. What remains is to (a) strengthen these structures into a representation-theoretic AQFT, and (b) connect them to genuine dynamics. We record three focused directions.

4.1. Deepening the Modal Structure of Causet Nets

The modal lightcone formalism can be made less semantic and more structural by treating the indexing category itself as carrying modal data. Concretely, one can:
  • define a modal enrichment of Int ( C ) (e.g. by adding accessibility morphisms between intervals determined by admissible slices);
  • impose compatibility conditions between the modal operators P n and the algebra maps A ( I 1 ) A ( I 2 ) (so that modal restriction/extension is functorial);
  • study whether the propagator U ( λ ) intertwines modal refinement, i.e. whether it acts naturally on modalized subalgebras associated to slices such as C / .
The goal is to replace informal “necessity/possibility” language by explicit functorial data that can be checked on finite regions.

4.2. Dynamics via Sheaf-Localization and Gauge Data

The sequential growth law supplies a measure on causet histories, but does not immediately specify how local algebras evolve. A concrete next step is to evolve pairs  ( C n , A n ) rather than bare causets C n . One route is:
  • represent bounded regions by finitary T 0 -posets P X and assign incidence algebras Ω ( P X ) ;
  • organize these assignments as a sheaf (or stack) over refinements of regions, so that restriction maps become part of the data;
  • introduce discrete connection-like transport between overlaps, and compare it against the intrinsic transport encoded by U ( λ ) .
This reframes “dynamics” as a local-to-global compatibility problem for algebraic carriers, in which curvature-type obstructions can be defined purely finitarily.

4.3. Continuum Limits, Reconstruction, and Comparison to Haag–Kastler Axioms

To compare with continuum AQFT, one needs explicit reconstruction criteria rather than informal “sprinkling limits.” Useful near-term targets include:
  • a discrete additivity condition (generation of A ( I ) from subinterval algebras) and its stability under refinement;
  • an explicit covariance statement for embeddings of finite intervals (compatible with Proposition 2.1(3));
  • representation-theoretic input: existence of physically meaningful states and a causet analogue of the spectrum condition.
These are the points at which one can begin proving that the discrete net converges (in an appropriate sense) to a Haag–Kastler net in a continuum approximation.

Closing Remarks

The core message is that the causet order already carries enough combinatorial structure to support an AQFT-style notion of locality, and that the factorial propagator U ( λ ) provides a simple, covariant mechanism for causal transport on finite regions (cf. Appendix A). The remaining work is not to add further interpretive layers, but to tighten the analytic and representation-theoretic side: define appropriate state spaces, prove stability under coarse-graining/refinement, and connect stochastic growth to evolution of the local algebras. If these steps succeed, then causal discreteness and algebraic locality can be developed as mutually reinforcing constraints rather than competing principles.

Appendix A. A Toy Computation on a Diamond Causet

This appendix illustrates the factorial propagator U ( λ ) = e λ B by an explicit computation on a minimal nontrivial causal set. The point is that on finite regions U ( λ ) is a polynomial in the past-link adjacency operator B, and its coefficients have a transparent combinatorial meaning.

Appendix A.1. The Diamond Poset and Its Adjacency Operator

Consider the four-element “diamond” causet with events { a , b , c , d } and order relations
a b , a c , b d , c d ,
with no other comparabilities. Equivalently, the Hasse diagram consists of the four link relations a · b , a · c , b · d , c · d .
Let f : { a , b , c , d } C be any function. By Definition 2.4, the past-link adjacency operator B acts as
( B f ) ( a ) = 0 ,
( B f ) ( b ) = f ( a ) ,
( B f ) ( c ) = f ( a ) ,
( B f ) ( d ) = f ( b ) + f ( c ) .
Applying B twice yields
( B 2 f ) ( a ) = 0 ,
( B 2 f ) ( b ) = 0 ,
( B 2 f ) ( c ) = 0 ,
( B 2 f ) ( d ) = 2 f ( a ) ,
since there are precisely two distinct length-2 link-chains from a to d (namely a b d and a c d ). One checks immediately that B 3 = 0 on this causet.

Appendix A.2. The Factorial Propagator

Because B 3 = 0 , the exponential truncates exactly:
U ( λ ) = e λ B = + λ B + λ 2 2 B 2 .
Therefore
( U ( λ ) f ) ( a ) = f ( a ) ,
( U ( λ ) f ) ( b ) = f ( b ) + λ f ( a ) ,
( U ( λ ) f ) ( c ) = f ( c ) + λ f ( a ) ,
( U ( λ ) f ) ( d ) = f ( d ) + λ f ( b ) + f ( c ) + λ 2 f ( a ) .
The last line displays the causal-kernel interpretation from Proposition 2.1 explicitly: the coefficient of f ( a ) at d is λ 2 , coming from two length-2 chains weighted by λ 2 / 2 ! .

References

  1. Bombelli, L.; Lee, J.; Meyer, D.; Sorkin, R. D. Space-Time as a Causal Set. Physical Review Letters 1987, 59, 5. [Google Scholar] [CrossRef] [PubMed]
  2. Benini, M.; Perin, M.; Schenkel, A. Smooth 1-dimensional algebraic quantum field theories. arXiv 2020, arXiv:2010.13808v2. [Google Scholar] [CrossRef]
  3. Benini, M.; Grant-Stuart, A.; Schenkel, A. Haag-Kastler stacks Communications in Contemporary Mathematics (2025) 2550099. [CrossRef]
  4. Borchers, H. J. On Revolutionizing of Quantum Field Theory with Tomita’s Modular Theory Vienna, Preprint ESI 773 (1999). Available online: https://www.esi.ac.at/preprints/esi773.pdf.
  5. Buchanan, R. J. (p,q)-String Junctions as Interstitial Fields on a Modal Lightcone. [CrossRef]
  6. Doplicher, S.; Haag, R.; Roberts, J..E. Fields, Observables, and Gauge Transformations. Commun. math. Phys. 1969, 13, 1–23. [Google Scholar] [CrossRef]
  7. Dowker, F. Causal sets and the deep structure of spacetime. arXiv 2005. [Google Scholar] [CrossRef]
  8. Dowker, F.; Henson, J.; Sorkin, R. D. Quantum Gravity Phenomenology, Lorentz Invariance and Discreteness. Mod. Phys.Lett 2004, A19, 1829–1840. [Google Scholar]
  9. Fewster, C..J. Endomorphisms and automorphisms of locally covariant quantum field theories. Rev. Math. Phys. 2013, arXiv:1201.3295v225, 1350008. [Google Scholar] [CrossRef]
  10. Fewster, C. J.; Verch, R. Dynamical locality and covariance: What makes a physical theory the same in all spacetimes? Annales Henri Poincaré 2012, arXiv:1106.4785v313, 1613–1674. [Google Scholar] [CrossRef]
  11. Raptis, I. Quantum Space-Time as a Quantum Causal Set. arXiv 2002. [Google Scholar] [CrossRef]
  12. Rideout, D. P.; Sorkin, R. D. A Classical Sequential Growth Dynamics for Causal Sets. Phys.Rev. 2000, D61, 024002. [Google Scholar] [CrossRef]
  13. Sion, C.-L. The Haag-Kastler axiomatic framework. 2012. Available online: https://www.physik.uni-hamburg.de/th2/ag-fredenhagen/dokumente/thehaag-kastleraxiomaticframework.pdf (accessed on 24 June 2012).
  14. Sorkin, R. D. Causal Sets: Discrete Gravity (1 Sep, 2003) Report Number: SU-GP-2003/1-2 arXiv:gr-qc/0309009.
  15. Schroer, B. Lectures on Algebraic Quantum Field Theory and Operator Algebras. Notas de Física, Centro Brasileiro de Pesquisas Físicas, Rio de Janeiro, April 2001.
  16. Zapatrin, R. R. Incidence algebras of simplicial complexes. Pure Mathematics and Applications 2001, 11, 105–118. [Google Scholar]
1
The properties of isotony and Einstein locality (the latter of which states that all causally disjoint spacetime regions must commute) together form part of the Haag–Kastler axioms [13]. In the Haag-Kastler framework, an assignment of an “algebra of observables" to each point x O i via A ( x ) A ( O i ) is known as a net. They are technically “precosheaves," (covariant functors on a region poset) while the nets mathematicians may be more familiar with are commonly known as directed systems. For a modern treatment of Haag–Kastler, refer to [3].
2
In general, however, diffeomorphisms (or for that matter, other purely geometric mappings) are not enough to describe the physics of massive particles [15].
3
In standard physics notation, these would be denoted J + and J .
4
“Connected components" should be read as Alexandrov intervals of the causets introduced in Definition (2.1).
5
Also known as Einstein locality or micro-causality
6
The first and third together imply acyclicity. Additional analytic input is required to obtain Reeh–Schlieder-type cyclicity/separating properties in a Hilbert space representation.
7
This is the version of causality discussed in [14], and it functions as a causet-version of Einstein causality. In sum, it states that “spectators" can be deleted, and thus the growth of a causet depends only upon events in the past lightcone. See 3.
8
In particular, writing n as was done in [5] is suggestive but potentially misleading unless one explicitly declares it as notation for P n .
9
“Sprinkling" refers to a type of Poisson process in which a (random) filling of Planck-density populates underlying causal set, and thus the resulting manifold. One must be careful so as to ensure the density remains physical after a Lorentz boost, which will fail if the sprinkling is uniform. See [1] for an introduction to Poisson processes, and [8] for the common pitfalls.
10
The choice of chain is not unique in general; one may either fix a chain or sum over all such chains, depending on the physical interpretation. Discrete covariance [14] tells us that the chosen chain should “drop-out" of the final equations, much like the co-ordinate invariance of GR.
11
These are events compatible with the past but not selected as necessary.
12
Iteration of necessity is treated qualitatively via P n , while quantitative influence from n-step ancestors is encoded by U ( λ ) = e λ B = n 0 λ n n ! B n .
13
We defer to [11] for information on the exact equivalence.
14
From the AQFT viewpoint, the graded noncommutative structure of Ω ( P ) provides a field-like enrichment of a bare causal order: it upgrades the relation-symbols p q into elements of a C -algebra admitting coherent superposition, while the grading organizes these degrees of freedom into “0-forms” and higher “k-forms.” This is precisely the sort of additional geometric content one needs if the causet is to support dynamics beyond stochastic accretion, e.g. a notion of local differential response and (ultimately) gauge-covariant transport between local algebras.
Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content.
Copyright: This open access article is published under a Creative Commons CC BY 4.0 license, which permit the free download, distribution, and reuse, provided that the author and preprint are cited in any reuse.
Prerpints.org logo

Preprints.org is a free preprint server supported by MDPI in Basel, Switzerland.

Subscribe

Disclaimer

Terms of Use

Privacy Policy

Privacy Settings

© 2026 MDPI (Basel, Switzerland) unless otherwise stated