“Real coordinate space”的意思、由来-开放百科全书

In mathematics, real coordinate space of {{mvar|n}} dimensions, written R^{{mvar|n}} ({{IPAc-en|ɑr|ˈ|ɛ|n|}} {{respell|ar|EN|'}}) (also written {{math|ℝⁿ}} with blackboard bold) is a coordinate space that allows several ({{math|n}}) real variables to be treated as a single variable. With various numbers of dimensions (sometimes unspecified), {{math|Rⁿ}} is used in many areas of pure and applied mathematics, as well as in physics. With component-wise addition and scalar multiplication, it is the prototypical real vector space and is a frequently used representation of Euclidean {{math|n}}-space. Due to the latter fact, geometric metaphors are widely used for {{math|Rⁿ}}, namely a plane for {{math|R²}} and three-dimensional space for {{math|R³}}.

Definition and uses

For any natural number {{mvar|n}}, the set {{math|Rⁿ}} consists of all {{mvar|n}}-tuples of real numbers ({{math|R}}). It is called (the) "{{mvar|n}}-dimensional real space". Depending on its construction from {{mvar|n}} instances of the set {{math|R}}, it inherits some of the latter's structure, notably:

For each {{mvar|n}} there exists only one {{math|Rⁿ}}, the real {{mvar|n}}-space.^[1]

Purely mathematical uses of {{math|Rⁿ}} can be roughly classified as follows, although these uses overlap. First, linear algebra studies its own properties under vector addition and linear transformations and uses it as a model of any {{mvar|n}}-dimensional real vector space. Second, it is used in mathematical analysis to represent the domain of a function of {{mvar|n}} real variables in a uniform way, as well as a space to which the graph of a real-valued function of {{math|n − 1}} real variables is a subset. The third use parametrizes geometric points with elements of {{math|Rⁿ}}; it is common in analytic, differential and algebraic geometries.

In applied mathematics, numerical analysis, and so on, arrays, sequences, and other collections of numbers in applications can be seen as the use of {{math|Rⁿ}} too.

The domain of a function of several variables

Any function {{math|f(x₁, x₂, … , x_n)}} of {{mvar|n}} real variables can be considered as a function on {{math|Rⁿ}} (that is, with {{math|Rⁿ}} as its domain). The use of the real {{mvar|n}}-space, instead of several variables considered separately, can simplify notation and suggest reasonable definitions. Consider, for {{math|1=n = 2}}, a function composition of the following form:

then {{mvar|F}} is not necessarily continuous. Continuity is a stronger condition: the continuity of {{mvar|f}} in the natural {{math|R²}} topology (discussed below), also called multivariable continuity, which is sufficient for continuity of the composition {{mvar|F}}.

Vector space

The coordinate space {{math|Rⁿ}} forms an {{mvar|n}}-dimensional vector space over the field of real numbers with the addition of the structure of linearity, and is often still denoted {{math|Rⁿ}}. The operations on {{math|Rⁿ}} as a vector space are typically defined by

This structure is important because any {{mvar|n}}-dimensional real vector space is isomorphic to the vector space {{math|Rⁿ}}.

Matrix notation

In standard matrix notation, each element of {{math|Rⁿ}} is typically written as a column vector

The coordinate space {{math|Rⁿ}} may then be interpreted as the space of all {{math|n × 1}} column vectors, or all {{math|1 × n}} row vectors with the ordinary matrix operations of addition and scalar multiplication.

Linear transformations from {{math|Rⁿ}} to {{math|R^m}} may then be written as {{math|m × n}} matrices which act on the elements of {{math|Rⁿ}} via left multiplication (when the elements of {{math|Rⁿ}} are column vectors) and on elements of {{math|R^m}} via right multiplication (when they are row vectors). The formula for left multiplication, a special case of matrix multiplication, is:

Standard basis

To see that this is a basis, note that an arbitrary vector in {{math|Rⁿ}} can be written uniquely in the form

Geometric properties and uses

Orientation

The fact that real numbers, unlike many other fields, constitute an ordered field yields an orientation structure on {{math|Rⁿ}}. Any full-rank linear map of {{math|Rⁿ}} to itself either preserves or reverses orientation of the space depending on the sign of the determinant of its matrix. If one permutes coordinates (or, in other words, elements of the basis), the resulting orientation will depend on the parity of the permutation.

Diffeomorphisms of {{math|Rⁿ}} or domains in it, by their virtue to avoid zero Jacobian, are also classified to orientation-preserving and orientation-reversing. It has important consequences for the theory of differential forms, whose applications include electrodynamics.

Another manifestation of this structure is that the point reflection in {{math|Rⁿ}} has different properties depending on evenness of {{mvar|n}}. For even {{mvar|n}} it preserves orientation, while for odd {{mvar|n}} it is reversed (see also improper rotation).

Affine space

Convexity

In a real vector space, such as {{math|Rⁿ}}, one can define a convex cone, which contains all non-negative linear combinations of its vectors. Corresponding concept in an affine space is a convex set, which allows only convex combinations (non-negative linear combinations that sum to 1).

In the language of universal algebra, a vector space is an algebra over the universal vector space {{math|R^∞}} of finite sequences of coefficients, corresponding to finite sums of vectors, while an affine space is an algebra over the universal affine hyperplane in this space (of finite sequences summing to 1), a cone is an algebra over the universal orthant (of finite sequences of nonnegative numbers), and a convex set is an algebra over the universal simplex (of finite sequences of nonnegative numbers summing to 1). This geometrizes the axioms in terms of "sums with (possible) restrictions on the coordinates".

Another concept from convex analysis is a convex function from {{math|Rⁿ}} to real numbers, which is defined through an inequality between its value on a convex combination of points and sum of values in those points with the same coefficients.

Euclidean space

defines the norm {{math|1={{abs|x}} = {{sqrt|x ⋅ x}}}} on the vector space {{math|Rⁿ}}. If every vector has its Euclidean norm, then for any pair of points the distance

is defined, providing a metric space structure on {{math|Rⁿ}} in addition to its affine structure.

As for vector space structure, the dot product and Euclidean distance usually are assumed to exist in {{math|Rⁿ}} without special explanations. However, the real {{mvar|n}}-space and a Euclidean {{mvar|n}}-space are distinct objects, strictly speaking. Any Euclidean {{mvar|n}}-space has a coordinate system where the dot product and Euclidean distance have the form shown above, called Cartesian. But there are many Cartesian coordinate systems on a Euclidean space.

Conversely, the above formula for the Euclidean metric defines the standard Euclidean structure on {{math|Rⁿ}}, but it is not the only possible one. Actually, any positive-definite quadratic form {{mvar|q}} defines its own "distance" {{math|{{sqrt|q(x − y)}}}}, but it is not very different from the Euclidean one in the sense that

Such a change of the metric preserves some of its properties, for example the property of being a complete metric space.

This also implies that any full-rank linear transformation of {{math|Rⁿ}}, or its affine transformation, does not magnify distances more than by some fixed {{math|C₂}}, and does not make distances smaller than {{math|1 ∕ C₁}} times, a fixed finite number times smaller.{{clarify|date=October 2014}}

The aforementioned equivalence of metric functions remains valid if {{math|{{sqrt|q(x − y)}}}} is replaced with {{math|M(x − y)}}, where {{mvar|M}} is any convex positive homogeneous function of degree 1, i.e. a vector norm (see Minkowski distance for useful examples). Because of this fact that any "natural" metric on {{math|Rⁿ}} is not especially different from the Euclidean metric, {{math|Rⁿ}} is not always distinguished from a Euclidean {{math|n}}-space even in professional mathematical works.

In algebraic and differential geometry

Although the definition of a manifold does not require that its model space should be {{math|Rⁿ}}, this choice is the most common, and almost exclusive one in differential geometry.

On the other hand, Whitney embedding theorems state that any real differentiable {{mvar|m}}-dimensional manifold can be embedded into {{math|R^2m}}.

Other appearances

Other structures considered on {{math|Rⁿ}} include the one of a pseudo-Euclidean space, symplectic structure (even {{mvar|n}}), and contact structure (odd {{mvar|n}}). All these structures, although can be defined in a coordinate-free manner, admit standard (and reasonably simple) forms in coordinates.

Polytopes in Rⁿ

There are three families of polytopes which have simple representations in {{math|Rⁿ}} spaces, for any {{mvar|n}}, and can be used to visualize any affine coordinate system in a real {{mvar|n}}-space. Vertices of a hypercube have coordinates {{math|(x₁, x₂, … , x_n)}} where each {{mvar|x_k}} takes on one of only two values, typically 0 or 1. However, any two numbers can be chosen instead of 0 and 1, for example {{num|−1}} and 1. An {{mvar|n}}-hypercube can be thought of as the Cartesian product of {{mvar|n}} identical intervals (such as the unit interval {{closed-closed|0,1}}) on the real line. As an {{mvar|n}}-dimensional subset it can be described with a system of {{math|2n}} inequalities:

Each vertex of the cross-polytope has, for some {{mvar|k}}, the {{mvar|x_k}} coordinate equal to ±1 and all other coordinates equal to 0 (such that it is the {{mvar|k}}th standard basis vector up to sign). This is a dual polytope of hypercube. As an {{mvar|n}}-dimensional subset it can be described with a single inequality which uses the absolute value operation:

but this can be expressed with a system of {{math|2ⁿ}} linear inequalities as well.

The third polytope with simply enumerable coordinates is the standard simplex, whose vertices are {{mvar|n}} standard basis vectors and the origin {{math|(0, 0, … , 0)}}. As an {{mvar|n}}-dimensional subset it is described with a system of {{math|n + 1}} linear inequalities:

Topological properties

The topological structure of {{math|Rⁿ}} (called standard topology, Euclidean topology, or usual topology) can be obtained not only from Cartesian product. It is also identical to the natural topology induced by Euclidean metric discussed above: a set is open in the Euclidean topology if and only if it contains an open ball around each of its points. Also, {{math|Rⁿ}} is a linear topological space (see continuity of linear maps above), and there is only one possible (non-trivial) topology compatible with its linear structure. As there are many open linear maps from {{math|Rⁿ}} to itself which are not isometries, there can be many Euclidean structures on {{math|Rⁿ}} which correspond to the same topology. Actually, it does not depend much even on the linear structure: there are many non-linear diffeomorphisms (and other homeomorphisms) of {{math|Rⁿ}} onto itself, or its parts such as a Euclidean open ball or the interior of a hypercube).

An important result on the topology of {{math|Rⁿ}}, that is far from superficial, is Brouwer's invariance of domain. Any subset of {{math|Rⁿ}} (with its subspace topology) that is homeomorphic to another open subset of {{math|Rⁿ}} is itself open. An immediate consequence of this is that {{math|R^m}} is not homeomorphic to {{math|Rⁿ}} if {{math|m ≠ n}} – an intuitively "obvious" result which is nonetheless difficult to prove.

Despite the difference in topological dimension, and contrary to a naïve perception, it is possible to map a lesser-dimensional{{clarify|date=April 2016}} real space continuously and surjectively onto {{math|Rⁿ}}. A continuous (although not smooth) space-filling curve (an image of {{math|R¹}}) is possible.{{clarify|date=April 2016}}

Examples

n ≤ 1

Cases of {{math|0 ≤ n ≤ 1}} do not offer anything new: {{math|R¹}} is the real line, whereas {{math|R⁰}} (the space containing the empty column vector) is a singleton, understood as a zero vector space. However, it is useful to include these as trivial cases of theories that describe different {{mvar|n}}.

n = 2

n = 3

n = 4

The first major use of {{math|R⁴}} is a spacetime model: three spatial coordinates plus one temporal. This is usually associated with theory of relativity, although four dimensions were used for such models since Galilei. The choice of theory leads to different structure, though: in Galilean relativity the {{mvar|t}} coordinate is privileged, but in Einsteinian relativity it is not. Special relativity is set in Minkowski space. General relativity uses curved spaces, which may be thought of as {{math|R⁴}} with a curved metric for most practical purposes. None of these structures provide a (positive-definite) metric on {{math|R⁴}}.

Euclidean {{math|R⁴}} also attracts the attention of mathematicians, for example due to its relation to quaternions, a 4-dimensional real algebra themselves. See rotations in 4-dimensional Euclidean space for some information.

In differential geometry, {{math|1=n = 4}} is the only case where {{math|Rⁿ}} admits a non-standard differential structure: see exotic R⁴.

Generalizations

For a given set,X, and a natural number N,

is the "N-dimensional coordinate-space on X" closed under component-wise addition and scalar multiplication.

Definition and uses

The domain of a function of several variables

Vector space

Matrix notation

Standard basis

Geometric properties and uses

Orientation

Affine space

Convexity

Euclidean space

In algebraic and differential geometry

Other appearances

Polytopes in Rⁿ

Topological properties

Examples

n ≤ 1

n = 2

n = 3

n = 4

Generalizations

See also

Footnotes

References

Definition and uses

The domain of a function of several variables

Vector space

Matrix notation

Standard basis

Geometric properties and uses

Orientation

Affine space

Convexity

Euclidean space

In algebraic and differential geometry

Other appearances

Polytopes in Rn

Topological properties

Examples

n ≤ 1

n = 2

n = 3

n = 4

Generalizations

See also

Footnotes

References

Polytopes in Rⁿ