Pseudo-Euclidean space

In mathematics and theoretical physics, a pseudo-Euclidean space of signature (k, n-k) is a finite-dimensional real n-space together with a non-degenerate quadratic form q. Such a quadratic form can, given a suitable choice of basis (e₁, …, e_n), be applied to a vector x = x₁e₁ + ⋯ + x_ne_n, giving $$q(x)=(x_1^2+\dots +x_k^2)-(x_{k+1}^2+\dots +x_n^2)$$ which is called the scalar square of the vector x.Template:Rp

For Euclidean spaces, k = n, implying that the quadratic form is positive-definite. When 0 < k < n, then q is an isotropic quadratic form. Note that if 1 ≤ i ≤ k < j ≤ n, then q(e_i + e_j) = 0, so that e_i + e_j is a null vector. In a pseudo-Euclidean space with k < n, unlike in a Euclidean space, there exist vectors with negative scalar square.

As with the term Euclidean space, the term pseudo-Euclidean space may be used to refer to an affine space or a vector space depending on the author, with the latter alternatively being referred to as a pseudo-Euclidean vector space (see point–vector distinction).

Geometry

The geometry of a pseudo-Euclidean space is consistent despite some properties of Euclidean space not applying, most notably that it is not a metric space as explained below. The affine structure is unchanged, and thus also the concepts line, plane and, generally, of an affine subspace (flat), as well as line segments.

Positive, zero, and negative scalar squares

File:DoubleCone.png

n = 3, k is either 1 or 2 depending on the choice of sign of q

A null vector is a vector for which the quadratic form is zero. Unlike in a Euclidean space, such a vector can be non-zero, in which case it is self-orthogonal. If the quadratic form is indefinite, a pseudo-Euclidean space has a linear cone of null vectors given by Template:Mset. When the pseudo-Euclidean space provides a model for spacetime (see below), the null cone is called the light cone of the origin.

The null cone separates two open sets, respectively for which q(x) > 0 and q(x) < 0. If k ≥ 2, then the set of vectors for which q(x) > 0 is connected. If k = 1, then it consists of two disjoint parts, one with x₁ > 0 and another with x₁ < 0. Similarly, if n − k ≥ 2, then the set of vectors for which q(x) < 0 is connected. If n − k = 1, then it consists of two disjoint parts, one with x_n > 0 and another with x_n < 0.

Interval

The quadratic form q corresponds to the square of a vector in the Euclidean case. To define the vector norm (and distance) in an invariant manner, one has to get square roots of scalar squares, which leads to possibly imaginary distances; see square root of negative numbers. But even for a triangle with positive scalar squares of all three sides (whose square roots are real and positive), the triangle inequality does not hold in general.

Hence terms norm and distance are avoided in pseudo-Euclidean geometry, which may be replaced with scalar square and interval respectively.

Though, for a curve whose tangent vectors all have scalar squares of the same sign, the arc length is defined. It has important applications: see proper time, for example.

Rotations and spheres

File:Hyperboloid1.png

The rotations group of such space is the indefinite orthogonal group O(q), also denoted as O(k, n − k) without a reference to particular quadratic form. Such "rotations" preserve the form q and, hence, the scalar square of each vector including whether it is positive, zero, or negative.

Whereas Euclidean space has a unit sphere, pseudo-Euclidean space has the hypersurfaces Template:Mset and Template:Mset. Such a hypersurface, called a quasi-sphere, is preserved by the appropriate indefinite orthogonal group.

Symmetric bilinear form

The quadratic form q gives rise to a symmetric bilinear form defined as follows:

$$⟨x,y⟩=\frac{1}{2}[q(x+y)-q(x)-q(y)]=(x_1{y}_1+\dots +x_k{y}_k)-(x_{k+1}{y}_{k+1}+\dots +x_n{y}_n).$$

The quadratic form can be expressed in terms of the bilinear form: q(x) = Template:Langlex, xTemplate:Rangle.

When Template:Langlex, yTemplate:Rangle = 0, then x and y are orthogonal vectors of the pseudo-Euclidean space.

This bilinear form is often referred to as the scalar product, and sometimes as "inner product" or "dot product", but it does not define an inner product space and it does not have the properties of the dot product of Euclidean vectors.

If x and y are orthogonal and q(x)q(y) < 0, then x is hyperbolic-orthogonal to y.

The standard basis of the real n-space is orthogonal. There are no orthonormal bases in a pseudo-Euclidean space for which the bilinear form is indefinite, because it cannot be used to define a vector norm.

Subspaces and orthogonality

For a (positive-dimensional) subspace U of a pseudo-Euclidean space, when the quadratic form q is restricted to U, following three cases are possible:

1. q|_U is either positive or negative definite. Then, U is essentially Euclidean (up to the sign of q).
2. q|_U is indefinite, but non-degenerate. Then, U is itself pseudo-Euclidean. It is possible only if dim U ≥ 2; if dim U = 2, which means than U is a plane, then it is called a hyperbolic plane.
3. q|_U is degenerate.

One of the most jarring properties (for a Euclidean intuition) of pseudo-Euclidean vectors and flats is their orthogonality. When two non-zero Euclidean vectors are orthogonal, they are not collinear. The intersections of any Euclidean linear subspace with its orthogonal complement is the {0} subspace. But the definition from the previous subsection immediately implies that any vector ν of zero scalar square is orthogonal to itself. Hence, the isotropic line N = [[linear span|Template:LangleνTemplate:Rangle]] generated by a null vector ν is a subset of its orthogonal complement N^⊥.

The formal definition of the orthogonal complement of a vector subspace in a pseudo-Euclidean space gives a perfectly well-defined result, which satisfies the equality dim U + dim U^⊥ = n due to the quadratic form's non-degeneracy. It is just the condition

U ∩ U^⊥ = Template:Mset or, equivalently, U + U^⊥ = all space,

which can be broken if the subspace U contains a null direction. While subspaces form a lattice, as in any vector space, this ⊥ operation is not an orthocomplementation, in contrast to inner product spaces.

For a subspace N composed entirely of null vectors (which means that the scalar square q, restricted to N, equals to 0), always holds:

N ⊂ N^⊥ or, equivalently, N ∩ N^⊥ = N.

Such a subspace can have up to min(k, n − k) dimensions.

For a (positive) Euclidean k-subspace its orthogonal complement is a (n − k)-dimensional negative "Euclidean" subspace, and vice versa. Generally, for a (d₊ + d₋ + d₀)-dimensional subspace U consisting of d₊ positive and d₋ negative dimensions (see Sylvester's law of inertia for clarification), its orthogonal "complement" U^⊥ has (k − d₊ − d₀) positive and (n − k − d₋ − d₀) negative dimensions, while the rest d₀ ones are degenerate and form the U ∩ U^⊥ intersection.

Parallelogram law and Pythagorean theorem

The parallelogram law takes the form

$q(x)+q(y)=\frac{1}{2}(q(x+y)+q(x-y)).$

Using the square of the sum identity, for an arbitrary triangle one can express the scalar square of the third side from scalar squares of two sides and their bilinear form product:

$q(x+y)=q(x)+q(y)+2⟨x,y⟩.$

This demonstrates that, for orthogonal vectors, a pseudo-Euclidean analog of the Pythagorean theorem holds:

$⟨x,y⟩=0\Rightarrow q(x)+q(y)=q(x+y).$

Angle

File:Minkowski lightcone lorentztransform.svg

Generally, absolute value Template:Abs of the bilinear form on two vectors may be greater than √Template:Abs, equal to it, or less. This causes similar problems with definition of angle (see Template:Section link) as appeared above for distances.

If k = 1 (only one positive term in q), then for vectors of positive scalar square: $$|⟨x,y⟩|\ge \sqrt{q(x)q(y)},$$

which permits definition of the hyperbolic angle, an analog of angle between these vectors through inverse hyperbolic cosine: $$\mathrm{arcosh}\frac{|⟨x,y⟩|}{\sqrt{q(x)q(y)}}.$$

It corresponds to the distance on a (n − 1)-dimensional hyperbolic space. This is known as rapidity in the context of theory of relativity discussed below. Unlike Euclidean angle, it takes values from Template:Closed-open and equals to 0 for antiparallel vectors.

There is no reasonable definition of the angle between a null vector and another vector (either null or non-null).

Algebra and tensor calculus

Like Euclidean spaces, every pseudo-Euclidean vector space generates a Clifford algebra. Unlike properties above, where replacement of q to −q changed numbers but not geometry, the sign reversal of the quadratic form results in a distinct Clifford algebra, so for example Cl_1,2(R) and Cl_2,1(R) are not isomorphic.

Just like over any vector space, there are pseudo-Euclidean tensors. Like with a Euclidean structure, there are raising and lowering indices operators but, unlike the case with Euclidean tensors, there is no bases where these operations do not change values of components. If there is a vector vTemplate:I sup, the corresponding covariant vector is:

$v_{\alpha }=q_{\alpha \beta }{v}^{\beta },$

and with the standard-form

$q_{\alpha \beta }=\left(\begin{array}{cc}{I}_{k\times k}& 0\\ 0& -I_{(n-k)\times (n-k)}\end{array}\right)$

the first k components of v_α are numerically the same as ones of vTemplate:I sup, but the rest n − k have opposite signs.

The correspondence between contravariant and covariant tensors makes a tensor calculus on pseudo-Riemannian manifolds a generalization of one on Riemannian manifolds.

Examples

A very important pseudo-Euclidean space is Minkowski space, which is the mathematical setting in which the theory of special relativity is formulated. For Minkowski space, n = 4 and k = 3 so that

$q(x)=x_1^2+x_2^2+x_3^2-x_4^2,$

The geometry associated with this pseudo-metric was investigated by Poincaré. Its rotation group is the Lorentz group. The Poincaré group includes also translations and plays the same role as Euclidean groups of ordinary Euclidean spaces.

Another pseudo-Euclidean space is the plane z = x + yj consisting of split-complex numbers, equipped with the quadratic form

$\Vert z\Vert =z{z}^{*}=z^{*}z=x^2-y^2.$

This is the simplest case of an indefinite pseudo-Euclidean space (n = 2, k = 1) and the only one where the null cone dissects the remaining space into four open sets. The group SO⁺(1, 1) consists of so named hyperbolic rotations.

See also

• Pseudo-Riemannian manifold
• Hyperbolic equation
• Hyperboloid model
• Paravector

References

• Werner Greub (1963) Linear Algebra, 2nd edition, §12.4 Pseudo-Euclidean Spaces, pp. 237–49, Springer-Verlag.
• Walter Noll (1964) "Euclidean geometry and Minkowskian chronometry", American Mathematical Monthly 71:129–44.

External links

• D.D. Sokolov (originator), Pseudo-Euclidean space, Encyclopedia of Mathematics