← all systems · see it in The System
Common future of a set
'For S in M let us introduce the common past and common future: up-arrow S = Int of the intersection over p in S of I+(p) = I+(intersection of the I+(p))' (Minguzzi 2019, after Hawking and Sachs 1974); the dual of the common past, 'obtained just by interchanging the roles of past and future' (Flores, Herrera, Sanchez 2011).
Properties published scienceour proposal
Sourced fields, and our own readings.
| boundary | Inside: the events that lie chronologically after every point of a set S, taken as an open future set. Outside: S itself, the future of any single point, the common past (its dual), and the boundary points built with it. |
| nested level | A kind of future set built by intersecting chronological futures; used by the S-relation of the causal boundary and by the reflectivity test. Field scale, epoch 1. |
| scale | field |
Measures (4) published science
| year introduced (with the common past, inner and outer continuity) | 1974 (Hawking and Sachs) year |
| year reflectivity introduced (Kronheimer and Penrose, condition iv) | 1967 year |
| spacetime dimension assumed | N > 1 dimension |
| characteristic clock: none of its own; its members are reached along future-directed timelike curves | slower than light causal speed limit |
Partners and parts published science
Built from / builds (1)
Sits inside / holds (1)
Trades with (valence) (8)
- Globally hyperbolic spacetime via sys:spacetime · Common future of a set even
- Chronological future I+(x) via sys:spacetime · Common future of a set gain
- Reflecting spacetime via sys:spacetime · Common future of a set even
- Indecomposable future set (IF), as a PIF via sys:spacetime · Common future of a set gain
- Future set via sys:spacetime · Common future of a set gain
- Causal boundary (c-boundary) and causal completion via sys:spacetime · Common future of a set even
- Common past of a set via sys:spacetime · Common future of a set even
- Terminal indecomposable future set (TIF) via sys:spacetime · Common future of a set even
expressed by (1)
floor filled by (9)
- Future set
- Causal boundary (c-boundary) and causal completion
- Globally hyperbolic spacetime
- Chronological future I+(x)
- Reflecting spacetime
- Indecomposable future set (IF), as a PIF
- Common past of a set
- Past reflecting spacetime
- Terminal indecomposable future set (TIF)
represents (1)
Kinds (1)
wired (1)
Notes published science
- Whether a spacetime is 'reflecting' can be read off one set: take everything in the past of a point, then everything after all of that; you get back exactly the point's future only if the spacetime is reflecting.
- In a globally hyperbolic spacetime (the kind physics usually assumes) no boundary point has both a past and a future side: the common future of every terminal past set with a partner is empty.
Layers
The ways it takes in its world, where they meet, and how it acts back, each from L1 (where it meets the world) up.
common future (chronological structure of spacetime)
- L1: A set S and the chronological futures I+(p) of its points; 'x chronologically precedes y ... if there exists a future-directed chronological (timelike) curve from x to y'; 'I+-(x) is open for all points x in M'
- L2: The points after all of S: the intersection of the I+(p) over p in S; dual of the common past I-[{p : p << q for all q in S}]
- L3: Interior and future: 'up-arrow S = Int of the intersection = I+(intersection)'; 'the result of the intersection is a ... future set'
- L4: Order and the reflectivity test: p <= q implies up-arrow I-(p) contains up-arrow I-(q) (eq. 4.3); 'up-arrow I-(p) = Int D_p+(p) = Int A+(p)' (Prop. 4.5); future reflecting iff 'up-arrow I-(p) = I+(p)'
- L5: Boundary pairing: the S-relation 'P ~S F iff F is ... a maximal IF in up-arrow P and P is ... a maximal IP in down-arrow F'; in a globally hyperbolic spacetime every boundary pair has 'up-arrow P = empty or down-arrow F = empty' (Theorem 3.29); in a counterexample 'P = down-arrow F, F = up-arrow P'
Sources (3) published science
Causal structure (Wikipedia, rev 1375920903, via Wikimedia Enterprise) (behind its links)