Search This Blog

Thursday, January 2, 2025

Causal structure

From Wikipedia, the free encyclopedia

In modern physics (especially general relativity) spacetime is represented by a Lorentzian manifold. The causal relations between points in the manifold are interpreted as describing which events in spacetime can influence which other events.

The causal structure of an arbitrary (possibly curved) Lorentzian manifold is made more complicated by the presence of curvature. Discussions of the causal structure for such manifolds must be phrased in terms of smooth curves joining pairs of points. Conditions on the tangent vectors of the curves then define the causal relationships.

Tangent vectors

Subdivision of Minkowski spacetime with respect to a point in four disjoint sets. The light cone, the causal future, the causal past, and elsewhere. The terminology is defined in this article.

If is a Lorentzian manifold (for metric on manifold ) then the nonzero tangent vectors at each point in the manifold can be classified into three disjoint types. A tangent vector is:

  • timelike if
  • null or lightlike if
  • spacelike if

Here we use the metric signature. We say that a tangent vector is non-spacelike if it is null or timelike.

The canonical Lorentzian manifold is Minkowski spacetime, where and is the flat Minkowski metric. The names for the tangent vectors come from the physics of this model. The causal relationships between points in Minkowski spacetime take a particularly simple form because the tangent space is also and hence the tangent vectors may be identified with points in the space. The four-dimensional vector is classified according to the sign of , where is a Cartesian coordinate in 3-dimensional space, is the constant representing the universal speed limit, and is time. The classification of any vector in the space will be the same in all frames of reference that are related by a Lorentz transformation (but not by a general Poincaré transformation because the origin may then be displaced) because of the invariance of the metric.

Time-orientability

At each point in the timelike tangent vectors in the point's tangent space can be divided into two classes. To do this we first define an equivalence relation on pairs of timelike tangent vectors.

If and are two timelike tangent vectors at a point we say that and are equivalent (written ) if .

There are then two equivalence classes which between them contain all timelike tangent vectors at the point. We can (arbitrarily) call one of these equivalence classes future-directed and call the other past-directed. Physically this designation of the two classes of future- and past-directed timelike vectors corresponds to a choice of an arrow of time at the point. The future- and past-directed designations can be extended to null vectors at a point by continuity.

A Lorentzian manifold is time-orientable if a continuous designation of future-directed and past-directed for non-spacelike vectors can be made over the entire manifold.

Curves

A path in is a continuous map where is a nondegenerate interval (i.e., a connected set containing more than one point) in . A smooth path has differentiable an appropriate number of times (typically ), and a regular path has nonvanishing derivative.

A curve in is the image of a path or, more properly, an equivalence class of path-images related by re-parametrisation, i.e. homeomorphisms or diffeomorphisms of . When is time-orientable, the curve is oriented if the parameter change is required to be monotonic.

Smooth regular curves (or paths) in can be classified depending on their tangent vectors. Such a curve is

  • chronological (or timelike) if the tangent vector is timelike at all points in the curve. Also called a world line.
  • null if the tangent vector is null at all points in the curve.
  • spacelike if the tangent vector is spacelike at all points in the curve.
  • causal (or non-spacelike) if the tangent vector is timelike or null at all points in the curve.

The requirements of regularity and nondegeneracy of ensure that closed causal curves (such as those consisting of a single point) are not automatically admitted by all spacetimes.

If the manifold is time-orientable then the non-spacelike curves can further be classified depending on their orientation with respect to time.

A chronological, null or causal curve in is

  • future-directed if, for every point in the curve, the tangent vector is future-directed.
  • past-directed if, for every point in the curve, the tangent vector is past-directed.

These definitions only apply to causal (chronological or null) curves because only timelike or null tangent vectors can be assigned an orientation with respect to time.

  • A closed timelike curve is a closed curve which is everywhere future-directed timelike (or everywhere past-directed timelike).
  • A closed null curve is a closed curve which is everywhere future-directed null (or everywhere past-directed null).
  • The holonomy of the ratio of the rate of change of the affine parameter around a closed null geodesic is the redshift factor.

Causal relations

There are several causal relations between points and in the manifold .

  • chronologically precedes (often denoted ) if there exists a future-directed chronological (timelike) curve from to .
  • strictly causally precedes (often denoted ) if there exists a future-directed causal (non-spacelike) curve from to .
  • causally precedes (often denoted or ) if strictly causally precedes or .
  • horismos (often denoted or ) if or there exists a future-directed null curve from to (or equivalently, and ).

These relations satisfy the following properties:

  • implies (this follows trivially from the definition)
  • , implies
  • , implies
  • , , are transitive. is not transitive.
  • , are reflexive

For a point in the manifold we define

  • The chronological future of , denoted , as the set of all points in such that chronologically precedes :
  • The chronological past of , denoted , as the set of all points in such that chronologically precedes :

We similarly define

  • The causal future (also called the absolute future) of , denoted , as the set of all points in such that causally precedes :
  • The causal past (also called the absolute past) of , denoted , as the set of all points in such that causally precedes :
  • The future null cone of as the set of all points in such that .
  • The past null cone of as the set of all points in such that .
  • The light cone of as the future and past null cones of together.
  • elsewhere as points not in the light cone, causal future, or causal past.

Points contained in , for example, can be reached from by a future-directed timelike curve. The point can be reached, for example, from points contained in by a future-directed non-spacelike curve.

In Minkowski spacetime the set is the interior of the future light cone at . The set is the full future light cone at , including the cone itself.

These sets defined for all in , are collectively called the causal structure of .

For a subset of we define

For two subsets of we define

  • The chronological future of relative to , , is the chronological future of considered as a submanifold of . Note that this is quite a different concept from which gives the set of points in which can be reached by future-directed timelike curves starting from . In the first case the curves must lie in in the second case they do not. See Hawking and Ellis.
  • The causal future of relative to , , is the causal future of considered as a submanifold of . Note that this is quite a different concept from which gives the set of points in which can be reached by future-directed causal curves starting from . In the first case the curves must lie in in the second case they do not. See Hawking and Ellis.
  • A future set is a set closed under chronological future.
  • A past set is a set closed under chronological past.
  • An indecomposable past set (IP) is a past set which isn't the union of two different open past proper subsets.
  • An IP which does not coincide with the past of any point in is called a terminal indecomposable past set (TIP).
  • A proper indecomposable past set (PIP) is an IP which isn't a TIP. is a proper indecomposable past set (PIP).
  • The future Cauchy development of , is the set of all points for which every past directed inextendible causal curve through intersects at least once. Similarly for the past Cauchy development. The Cauchy development is the union of the future and past Cauchy developments. Cauchy developments are important for the study of determinism.
  • A subset is achronal if there do not exist such that , or equivalently, if is disjoint from .

Causal diamond
  • A Cauchy surface is a closed achronal set whose Cauchy development is .
  • A metric is globally hyperbolic if it can be foliated by Cauchy surfaces.
  • The chronology violating set is the set of points through which closed timelike curves pass.
  • The causality violating set is the set of points through which closed causal curves pass.
  • The boundary of the causality violating set is a Cauchy horizon. If the Cauchy horizon is generated by closed null geodesics, then there's a redshift factor associated with each of them.
  • For a causal curve , the causal diamond is (here we are using the looser definition of 'curve' whereon it is just a set of points), being the point in the causal past of . In words: the causal diamond of a particle's world-line is the set of all events that lie in both the past of some point in and the future of some point in . In the discrete version, the causal diamond is the set of all the causal paths that connect from .

Properties

See Penrose (1972), p13.

  • A point is in if and only if is in .
  • The horismos is generated by null geodesic congruences.

Topological properties:

  • is open for all points in .
  • is open for all subsets .
  • for all subsets . Here is the closure of a subset .

Conformal geometry

Two metrics and are conformally related if for some real function called the conformal factor. (See conformal map).

Looking at the definitions of which tangent vectors are timelike, null and spacelike we see they remain unchanged if we use or . As an example suppose is a timelike tangent vector with respect to the metric. This means that . We then have that so is a timelike tangent vector with respect to the too.

It follows from this that the causal structure of a Lorentzian manifold is unaffected by a conformal transformation.

A null geodesic remains a null geodesic under a conformal rescaling.

Conformal infinity

An infinite metric admits geodesics of infinite length/proper time. However, we can sometimes make a conformal rescaling of the metric with a conformal factor which falls off sufficiently fast to 0 as we approach infinity to get the conformal boundary of the manifold. The topological structure of the conformal boundary depends upon the causal structure.

  • Future-directed timelike geodesics end up on , the future timelike infinity.
  • Past-directed timelike geodesics end up on , the past timelike infinity.
  • Future-directed null geodesics end up on ℐ+, the future null infinity.
  • Past-directed null geodesics end up on ℐ, the past null infinity.
  • Spacelike geodesics end up on spacelike infinity.

In various spaces:

  • Minkowski space: are points, ℐ± are null sheets, and spacelike infinity has codimension 2.
  • Anti-de Sitter space: there's no timelike or null infinity, and spacelike infinity has codimension 1.
  • de Sitter space: the future and past timelike infinity has codimension 1.

Gravitational singularity

If a geodesic terminates after a finite affine parameter, and it is not possible to extend the manifold to extend the geodesic, then we have a singularity.

  • For black holes, the future timelike boundary ends on a singularity in some places.
  • For the Big Bang, the past timelike boundary is also a singularity.

The absolute event horizon is the past null cone of the future timelike infinity. It is generated by null geodesics which obey the Raychaudhuri optical equation.

Arrangement of hyperplanes

In geometry and combinatorics, an arrangement of hyperplanes is an arrangement of a finite set A of hyperplanes in a linear, affine, or projective space S. Questions about a hyperplane arrangement A generally concern geometrical, topological, or other properties of the complement, M(A), which is the set that remains when the hyperplanes are removed from the whole space. One may ask how these properties are related to the arrangement and its intersection semilattice. The intersection semilattice of A, written L(A), is the set of all subspaces that are obtained by intersecting some of the hyperplanes; among these subspaces are S itself, all the individual hyperplanes, all intersections of pairs of hyperplanes, etc. (excluding, in the affine case, the empty set). These intersection subspaces of A are also called the flats of A. The intersection semilattice L(A) is partially ordered by reverse inclusion.

If the whole space S is 2-dimensional, the hyperplanes are lines; such an arrangement is often called an arrangement of lines. Historically, real arrangements of lines were the first arrangements investigated. If S is 3-dimensional one has an arrangement of planes.

A hyperplane arrangement in space

General theory

The intersection semilattice and the matroid

The intersection semilattice L(A) is a meet semilattice and more specifically is a geometric semilattice. If the arrangement is linear or projective, or if the intersection of all hyperplanes is nonempty, the intersection lattice is a geometric lattice. (This is why the semilattice must be ordered by reverse inclusion—rather than by inclusion, which might seem more natural but would not yield a geometric (semi)lattice.)

When L(A) is a lattice, the matroid of A, written M(A), has A for its ground set and has rank function r(S) := codim(I), where S is any subset of A and I is the intersection of the hyperplanes in S. In general, when L(A) is a semilattice, there is an analogous matroid-like structure called a semimatroid, which is a generalization of a matroid (and has the same relationship to the intersection semilattice as does the matroid to the lattice in the lattice case), but is not a matroid if L(A) is not a lattice.

Polynomials

For a subset B of A, let us define f(B) := the intersection of the hyperplanes in B; this is S if B is empty. The characteristic polynomial of A, written pA(y), can be defined by

summed over all subsets B of A except, in the affine case, subsets whose intersection is empty. (The dimension of the empty set is defined to be −1.) This polynomial helps to solve some basic questions; see below. Another polynomial associated with A is the Whitney-number polynomial wA(x, y), defined by

summed over BCA such that f(B) is nonempty.

Being a geometric lattice or semilattice, L(A) has a characteristic polynomial, pL(A)(y), which has an extensive theory (see matroid). Thus it is good to know that pA(y) = yi pL(A)(y), where i is the smallest dimension of any flat, except that in the projective case it equals yi + 1pL(A)(y). The Whitney-number polynomial of A is similarly related to that of L(A). (The empty set is excluded from the semilattice in the affine case specifically so that these relationships will be valid.)

The Orlik–Solomon algebra

The intersection semilattice determines another combinatorial invariant of the arrangement, the Orlik–Solomon algebra. To define it, fix a commutative subring K of the base field and form the exterior algebra E of the vector space

generated by the hyperplanes. A chain complex structure is defined on E with the usual boundary operator . The Orlik–Solomon algebra is then the quotient of E by the ideal generated by elements of the form for which have empty intersection, and by boundaries of elements of the same form for which has codimension less than p.

Real arrangements

In real affine space, the complement is disconnected: it is made up of separate pieces called cells or regions or chambers, each of which is either a bounded region that is a convex polytope, or an unbounded region that is a convex polyhedral region which goes off to infinity. Each flat of A is also divided into pieces by the hyperplanes that do not contain the flat; these pieces are called the faces of A. The regions are faces because the whole space is a flat. The faces of codimension 1 may be called the facets of A. The face semilattice of an arrangement is the set of all faces, ordered by inclusion. Adding an extra top element to the face semilattice gives the face lattice.

In two dimensions (i.e., in the real affine plane) each region is a convex polygon (if it is bounded) or a convex polygonal region which goes off to infinity.

  • As an example, if the arrangement consists of three parallel lines, the intersection semilattice consists of the plane and the three lines, but not the empty set. There are four regions, none of them bounded.
  • If we add a line crossing the three parallels, then the intersection semilattice consists of the plane, the four lines, and the three points of intersection. There are eight regions, still none of them bounded.
  • If we add one more line, parallel to the last, then there are 12 regions, of which two are bounded parallelograms.

Typical problems about an arrangement in n-dimensional real space are to say how many regions there are, or how many faces of dimension 4, or how many bounded regions. These questions can be answered just from the intersection semilattice. For instance, two basic theorems, from Zaslavsky (1975), are that the number of regions of an affine arrangement equals (−1)npA(−1) and the number of bounded regions equals (−1)npA(1). Similarly, the number of k-dimensional faces or bounded faces can be read off as the coefficient of xnk in (−1)n wA (−x, −1) or (−1)nwA(−x, 1).

Meiser (1993) designed a fast algorithm to determine the face of an arrangement of hyperplanes containing an input point.

Another question about an arrangement in real space is to decide how many regions are simplices (the n-dimensional generalization of triangles and tetrahedra). This cannot be answered based solely on the intersection semilattice. The McMullen problem asks for the smallest arrangement of a given dimension in general position in real projective space for which there does not exist a cell touched by all hyperplanes.

A real linear arrangement has, besides its face semilattice, a poset of regions, a different one for each region. This poset is formed by choosing an arbitrary base region, B0, and associating with each region R the set S(R) consisting of the hyperplanes that separate R from B. The regions are partially ordered so that R1R2 if S(R1, R) contains S(R2, R). In the special case when the hyperplanes arise from a root system, the resulting poset is the corresponding Weyl group with the weak order. In general, the poset of regions is ranked by the number of separating hyperplanes and its Möbius function has been computed (Edelman 1984).

Vadim Schechtman and Alexander Varchenko introduced a matrix indexed by the regions. The matrix element for the region and is given by the product of indeterminate variables for every hyperplane H that separates these two regions. If these variables are specialized to be all value q, then this is called the q-matrix (over the Euclidean domain ) for the arrangement and much information is contained in its Smith normal form.

Complex arrangements

In complex affine space (which is hard to visualize because even the complex affine plane has four real dimensions), the complement is connected (all one piece) with holes where the hyperplanes were removed.

A typical problem about an arrangement in complex space is to describe the holes.

The basic theorem about complex arrangements is that the cohomology of the complement M(A) is completely determined by the intersection semilattice. To be precise, the cohomology ring of M(A) (with integer coefficients) is isomorphic to the Orlik–Solomon algebra on Z.

The isomorphism can be described explicitly and gives a presentation of the cohomology in terms of generators and relations, where generators are represented (in the de Rham cohomology) as logarithmic differential forms

with any linear form defining the generic hyperplane of the arrangement.

Technicalities

Sometimes it is convenient to allow the degenerate hyperplane, which is the whole space S, to belong to an arrangement. If A contains the degenerate hyperplane, then it has no regions because the complement is empty. However, it still has flats, an intersection semilattice, and faces. The preceding discussion assumes the degenerate hyperplane is not in the arrangement.

Sometimes one wants to allow repeated hyperplanes in the arrangement. We did not consider this possibility in the preceding discussion, but it makes no material difference.

Climate engineering

From Wikipedia, the free encyclopedia https://en.wikipedia.org/wiki/Climate_engineering Climate engineering (or geoengineering , cli...