Causality on a spacetime #
This file formalises the causal-relations vocabulary of section 10.2 of the
AQFT-in-Lean blueprint: trips, causal trips, the chronological precedence
relation ≪, the causal precedence relation ≺, and their associated
chronological/causal future/past sets.
Main definitions #
Physicslib4.Spacetime.IsGeodesic(placeholder): aPropplaceholder for "being a geodesic". Mathlib v4.31.0-rc1 does not provide a packaged notion of geodesic in a Lorentzian / pseudo-Riemannian manifold; we encode the predicate as an opaqueProp-valued definition (defined toTrueas a placeholder, see modelling notes).Physicslib4.Spacetime.IsTrip/IsCausalTrip: a trip / causal trip is a smooth curve which is piecewise a future-oriented timelike / causal geodesic, with designated past and future endpoints.Physicslib4.Spacetime.ChronologicallyPrecedes(≪),Physicslib4.Spacetime.CausallyPrecedes(≺): the existence of a trip / causal trip fromptoq.Physicslib4.Spacetime.chronologicalFuture/chronologicalPast,causalFuture/causalPast: pointwise and set-valued versions.Physicslib4.Spacetime.IsSpacelikeRelated,IsCompletelySpacelike: the spacelike-relatedness vocabulary.
Modelling notes #
Geodesics in Lorentzian manifolds are not packaged in Mathlib. We use a placeholder predicate
IsGeodesicset toTrue; downstream agents should refine this to the genuine geodesic condition once Mathlib (or a sibling project) provides one. This is the only mathematical compromise in this file.The "piecewise" condition on trips is encoded by partitioning the parameter space into finitely many sub-intervals on each of which the smooth curve restricts to a future-oriented timelike (resp. causal) geodesic.
Geodesics (placeholder) #
A geodesic of a spacetime, as needed by section 10.2 of the blueprint.
Mathlib v4.31.0-rc1 does not provide a Lorentzian / pseudo-Riemannian
geodesic. We provide an opaque placeholder predicate. Downstream work
should replace this by the genuine geodesic condition (typically:
auto-parallelism of the tangent vector field along the curve with
respect to the Levi-Civita connection of g).
Equations
- M.IsGeodesic _μ = True
Instances For
Trips and chronological precedence #
A trip segment from p to q in a spacetime M is a smooth curve c
together with a representative smooth path μ that
- is future-oriented and timelike;
- is a geodesic;
- has past endpoint
pand future endpointq.
This is a single geodesic piece; a full (piecewise) trip is a finite chain
of such segments (see IsTrip).
A TimeOrientation argument t is required to talk about
future-orientation. The endpoints p, q : M.Carrier are given as
parameters.
Equations
- One or more equations did not get rendered due to their size.
Instances For
Single-segment chronological precedence: p and q are joined by one
future-oriented timelike geodesic segment.
Equations
- M.SegmentPrecedes t p q = ∃ (c : M.SmoothCurve), M.IsTripSegment t p q c
Instances For
A trip from p to q: a curve which is piecewise a future-oriented
timelike geodesic, i.e. a finite chain of trip segments joined at matching
endpoints. This is encoded as the transitive closure of single-segment
precedence, which is exactly "there is a finite ascending sequence
p = x₀, x₁, …, xₙ = q with each consecutive pair joined by a
future-oriented timelike geodesic segment". This genuinely piecewise form
is what makes chronological precedence transitive by concatenation.
Equations
- M.IsTrip t p q = Relation.TransGen (M.SegmentPrecedes t) p q
Instances For
Chronological precedence: p ≪ q iff there exists a trip from p
to q, relative to a fixed time orientation.
Equations
- M.ChronologicallyPrecedes t p q = M.IsTrip t p q
Instances For
Chronological precedence: p ≪ q iff there exists a trip from p
to q, relative to a fixed time orientation.
Equations
- One or more equations did not get rendered due to their size.
Instances For
Causal trips and causal precedence #
A causal trip segment from p to q in a spacetime M is a smooth curve
c together with a representative smooth path μ that
- is future-oriented and causal;
- is a (possibly degenerate) geodesic;
- has past endpoint
pand future endpointq.
Equations
- One or more equations did not get rendered due to their size.
Instances For
Single-segment causal precedence: p and q are joined by one
future-oriented causal geodesic segment.
Equations
- M.CausalSegmentPrecedes t p q = ∃ (c : M.SmoothCurve), M.IsCausalTripSegment t p q c
Instances For
A causal trip from p to q: a curve which is piecewise a
future-oriented causal geodesic, i.e. a finite chain of causal trip
segments. Encoded as the transitive closure of single-segment causal
precedence.
Equations
- M.IsCausalTrip t p q = Relation.TransGen (M.CausalSegmentPrecedes t) p q
Instances For
Causal precedence: p ≺ q iff there exists a causal trip from p
to q, relative to a fixed time orientation.
Equations
- M.CausallyPrecedes t p q = M.IsCausalTrip t p q
Instances For
Causal precedence: p ≺ q iff there exists a causal trip from p
to q, relative to a fixed time orientation.
Equations
- One or more equations did not get rendered due to their size.
Instances For
Chronological and causal futures and pasts #
The chronological future I^+(p) of a point p.
Equations
- M.chronologicalFuture t p = {q : M.Carrier | M.ChronologicallyPrecedes t p q}
Instances For
The chronological past I^-(p) of a point p.
Equations
- M.chronologicalPast t p = {q : M.Carrier | M.ChronologicallyPrecedes t q p}
Instances For
The chronological future I^+(S) of a set S, defined as
⋃ p ∈ S, I^+(p).
Equations
- M.chronologicalFutureSet t S = ⋃ p ∈ S, M.chronologicalFuture t p
Instances For
The chronological past I^-(S) of a set S, defined as
⋃ p ∈ S, I^-(p).
Equations
- M.chronologicalPastSet t S = ⋃ p ∈ S, M.chronologicalPast t p
Instances For
The causal future J^+(p) of a point p.
Equations
- M.causalFuture t p = {q : M.Carrier | M.CausallyPrecedes t p q}
Instances For
The causal past J^-(p) of a point p.
Equations
- M.causalPast t p = {q : M.Carrier | M.CausallyPrecedes t q p}
Instances For
The causal future J^+(S) of a set S, defined as
⋃ p ∈ S, J^+(p).
Equations
- M.causalFutureSet t S = ⋃ p ∈ S, M.causalFuture t p
Instances For
The causal past J^-(S) of a set S, defined as
⋃ p ∈ S, J^-(p).
Equations
- M.causalPastSet t S = ⋃ p ∈ S, M.causalPast t p
Instances For
Spacelike relatedness #
Two points p₁, p₂ of a spacetime are spacelike related if
p₂ ∉ J^+(p₁) ∪ J^-(p₁).
Equations
- M.IsSpacelikeRelated t p₁ p₂ = (p₂ ∉ M.causalFuture t p₁ ∪ M.causalPast t p₁)
Instances For
Two subsets O₁, O₂ of a spacetime are completely spacelike with
respect to each other if every point of O₁ is spacelike related to every
point of O₂.
Equations
- M.IsCompletelySpacelike t O₁ O₂ = ∀ p₁ ∈ O₁, ∀ p₂ ∈ O₂, M.IsSpacelikeRelated t p₁ p₂
Instances For
Chronological implies causal #
A timelike trip is in particular a causal trip, so chronological precedence refines causal precedence and chronological futures/pasts sit inside the corresponding causal ones.
A timelike path is causal.
Every trip segment is a causal trip segment.
Single-segment chronological precedence implies single-segment causal precedence.
Transitivity of chronological precedence. Two trips joined at a common
point q concatenate to a single (piecewise) trip: p ≪ q and q ≪ r give
p ≪ r. This is exactly the transitivity of the transitive closure.
Transitivity of causal precedence. p ≺ q and q ≺ r give p ≺ r.
Chronological precedence implies causal precedence.
The chronological future is contained in the causal future.
The chronological past is contained in the causal past.
Causal-order refinements under the causality condition #
The causality condition (no closed causal curve). A spacetime satisfies the
causality condition when no point causally precedes itself: a closed causal curve
through p is exactly a causal trip p ≺ p, so its absence is ¬ (p ≺ p) for all
p. This is strictly weaker than strong causality and strictly stronger than the
chronology condition ¬ (p ≪ p).
Equations
- M.NoClosedCausalCurve t = ∀ (p : M.Carrier), ¬M.CausallyPrecedes t p p
Instances For
Under the causality condition, chronological precedence is irreflexive:
¬ (p ≪ p), because p ≪ p would give the forbidden p ≺ p.
Under the causality condition, causal precedence is asymmetric:
p ≺ q → ¬ (q ≺ p), since transitivity would otherwise give the forbidden p ≺ p.
Under the causality condition, causal precedence is antisymmetric:
p ≺ q → q ≺ p → p = q (in fact both cannot hold, since transitivity gives the
forbidden p ≺ p). Thus ≺ is a strict partial order.
Symmetry of spacelike relatedness #
Spacelike relatedness is symmetric.
Complete spacelike separation is symmetric in its two regions.
Complete spacelike separation is monotone under shrinking either region.
The empty region is completely spacelike to anything (on the left).
The empty region is completely spacelike to anything (on the right).
A union of regions is completely spacelike to O₂ iff each part is.
O₁ is completely spacelike to a union iff it is to each part.
Monotonicity of set-valued futures and pasts #
The set-valued chronological future is monotone.
The set-valued chronological past is monotone.
The set-valued causal future is monotone.
The set-valued causal past is monotone.
Alexandrov topology #
The basis sets generating the Alexandrov topology: all sets of the
form I^+(p) ∩ I^-(q) for p, q ∈ M.
Equations
- M.alexandrovBasis t = {U : Set M.Carrier | ∃ (p : M.Carrier) (q : M.Carrier), U = M.chronologicalFuture t p ∩ M.chronologicalPast t q}
Instances For
The Alexandrov topology on a spacetime M, with respect to a chosen
time orientation t: the topology generated by the basis alexandrovBasis
consisting of all intersections of chronological futures and pasts.
Equations
Instances For
Every basis set is open in the Alexandrov topology.
No-diamond points have only the whole space as neighbourhood. If x lies
in no Alexandrov diamond I⁺(p) ∩ I⁻(q), then every Alexandrov-open set (i.e. every
set generated from the diamond subbasis) containing x is the whole space M.
Openness of chronological futures and pasts #
Every set of the form I^+(p) ∩ I^-(q) is open in the Alexandrov topology.
This is the basis lemma restated on chronological futures and pasts.
If every point of I^+(p) has a chronological-future point (for all
x ∈ I^+(p) there exists b with x ≪ b), then the chronological future
I^+(p) is open in the Alexandrov topology.
Dually, if every point of I^-(p) has a chronological-past point (for all
x ∈ I^-(p) there exists a with a ≪ x), then the chronological past
I^-(p) is open in the Alexandrov topology.