can project a sphere's surface to a plane, it can also project a -sphere into -space. This image shows three coordinate directions projected to -space: parallels (red), meridians (blue), and hypermeridians (green). Due to the conformal map property of the stereographic projection, the curves intersect each other orthogonally (in the yellow points) as in 4D. All of the curves are circles: the curves that intersect have an infinite radius (= straight line).]]
In mathematics, an -sphere or hypersphere is an -dimension generalization of the -dimensional circle and -dimensional sphere to any non-negative integer .
The circle is considered 1-dimensional and the sphere 2-dimensional because a point within them has one and two degrees of freedom respectively. However, the typical embedding of the 1-dimensional circle is in 2-dimensional space, the 2-dimensional sphere is usually depicted embedded in 3-dimensional space, and a general -sphere is embedded in an -dimensional space. The term hypersphere is commonly used to distinguish spheres of dimension which are thus embedded in a space of dimension , which means that they cannot be easily visualized. The -sphere is the setting for -dimensional spherical geometry.
Considered extrinsically, as a hypersurface embedded in -dimensional Euclidean space, an -sphere is the locus of points at equal distance (the radius) from a given center point. Its interior, consisting of all points closer to the center than the radius, is an -dimensional ball. In particular:
Given a Cartesian coordinate system, the unit n-sphere of radius can be defined as:
Considered intrinsically, when , the -sphere is a Riemannian manifold of positive constant curvature, and is orientable. The geodesics of the -sphere are called .
The stereographic projection maps the -sphere onto -space with a single adjoined point at infinity; under the metric tensor thereby defined, is a model for the -sphere.
In the more general setting of topology, any topological space that is homeomorphic to the unit -sphere is called an - sphere. Under inverse stereographic projection, the -sphere is the one-point compactification of -space. The -spheres admit several other topological descriptions: for example, they can be constructed by gluing two -dimensional spaces together, by identifying the boundary of an hypercube with a point, or (inductively) by forming the suspension of an -sphere. When it is simply connected; the -sphere (circle) is not simply connected; the -sphere is not even connected, consisting of two discrete points.
where is a center point, and is the radius.
The above -sphere exists in -dimensional Euclidean space and is an example of an -manifold. The volume form of an -sphere of radius is given by
where is the Hodge star operator; see for a discussion and proof of this formula in the case . As a result,
Specifically:
The -ball is sometimes defined as a single point. The -dimensional Hausdorff measure is the number of points in a set. So
A unit -ball is a line segment whose points have a single coordinate in the interval of length , and the -sphere consists of its two end-points, with coordinate .
A unit -sphere is the unit circle in the Euclidean plane, and its interior is the unit disk (-ball).
The interior of a sphere in three-dimensional space is the unit -ball.
In general, and are given in closed form by the expressions
where is the gamma function. Note that 's values at half-integers contain a factor of that cancels out the factor in the numerator.
As tends to infinity, the volume of the unit -ball (ratio between the volume of an -ball of radius and an hypercube of side length ) tends to zero.
Equivalently, representing the unit -ball as a union of concentric -sphere spherical shell,
We can also represent the unit -sphere as a union of products of a circle (-sphere) with an -sphere. Then . Since , the equation
x_1 &= r \cos(\varphi_1), \\[5mu] x_2 &= r \sin(\varphi_1) \cos(\varphi_2), \\[5mu] x_3 &= r \sin(\varphi_1) \sin(\varphi_2) \cos(\varphi_3), \\ &\qquad \vdots\\ x_{n-1} &= r \sin(\varphi_1) \cdots \sin(\varphi_{n-2}) \cos(\varphi_{n-1}), \\[5mu] x_n &= r \sin(\varphi_1) \cdots \sin(\varphi_{n-2}) \sin(\varphi_{n-1}).\end{align} Except in the special cases described below, the inverse transformation is unique:
&\qquad \vdots\\\varphi_{n-2} &= \operatorname{atan2} \left({\textstyle \sqrt^2}}, x_{n-2}\right), \\5mu \varphi_{n-1} &= \operatorname{atan2} \left(x_n, x_{n-1}\right). \end{align}
where is the two-argument arctangent function.
There are some special cases where the inverse transform is not unique; for any will be ambiguous whenever all of are zero; in this case may be chosen to be zero. (For example, for the -sphere, when the polar angle is or then the point is one of the poles, zenith or nadir, and the choice of azimuthal angle is arbitrary.)
& & & & &0 \\s_1\cdots s_{n-2}c_{n-1} &\cdots &\cdots & & &-rs_1\cdots s_{n-2}s_{n-1} \\ s_{1}\cdots s_{n-2}s_{n-1} &rc_1\cdots s_{n-1} &\cdots & & &\phantom{-}rs_1\cdots s_{n-2}c_{n-1} \end{pmatrix}.
The determinant of this matrix can be calculated by induction. When , a straightforward computation shows that the determinant is . For larger , observe that can be constructed from as follows. Except in column , rows and of are the same as row of , but multiplied by an extra factor of in row and an extra factor of in row . In column , rows and of are the same as column of row of , but multiplied by extra factors of in row and in row , respectively. The determinant of can be calculated by Laplace expansion in the final column. By the recursive description of , the submatrix formed by deleting the entry at and its row and column almost equals , except that its last row is multiplied by . Similarly, the submatrix formed by deleting the entry at and its row and column almost equals , except that its last row is multiplied by . Therefore the determinant of is
Similarly the surface area element of the -sphere of radius , which generalizes the area element of the -sphere, is given by
The natural choice of an orthogonal basis over the angular coordinates is a product of ultraspherical polynomials,
for , and the for the angle in concordance with the spherical harmonics.
Polyspherical coordinate systems arise from a generalization of this construction.N. Ja. Vilenkin and A. U. Klimyk, Representation of Lie groups and special functions, Vol. 2: Class I representations, special functions, and integral transforms, translated from the Russian by V. A. Groza and A. A. Groza, Math. Appl., vol. 74, Kluwer Acad. Publ., Dordrecht, 1992, , pp. 223–226. The space is split as the product of two Euclidean spaces of smaller dimension, but neither space is required to be a line. Specifically, suppose that and are positive integers such that . Then . Using this decomposition, a point may be written as
= \arccos\frac{\lVert\mathbf{z}\rVert}{\lVert\mathbf{x}\rVert} = \arctan\frac{\lVert\mathbf{y}\rVert}{ \lVert\mathbf{z}\rVert}.\end{align}
These splittings may be repeated as long as one of the factors involved has dimension two or greater. A polyspherical coordinate system is the result of repeating these splittings until there are no Cartesian coordinates left. Splittings after the first do not require a radial coordinate because the domains of and are spheres, so the coordinates of a polyspherical coordinate system are a non-negative radius and angles. The possible polyspherical coordinate systems correspond to binary trees with leaves. Each non-leaf node in the tree corresponds to a splitting and determines an angular coordinate. For instance, the root of the tree represents , and its immediate children represent the first splitting into and . Leaf nodes correspond to Cartesian coordinates for . The formulas for converting from polyspherical coordinates to Cartesian coordinates may be determined by finding the paths from the root to the leaf nodes. These formulas are products with one factor for each branch taken by the path. For a node whose corresponding angular coordinate is , taking the left branch introduces a factor of and taking the right branch introduces a factor of . The inverse transformation, from polyspherical coordinates to Cartesian coordinates, is determined by grouping nodes. Every pair of nodes having a common parent can be converted from a mixed polar–Cartesian coordinate system to a Cartesian coordinate system using the above formulas for a splitting.
Polyspherical coordinates also have an interpretation in terms of the special orthogonal group. A splitting determines a subgroup
In polyspherical coordinates, the volume measure on and the area measure on are products. There is one factor for each angle, and the volume measure on also has a factor for the radial coordinate. The area measure has the form:
Likewise, the stereographic projection of an -sphere of radius will map to the -dimensional hyperplane perpendicular to the -axis as
To generate uniformly distributed random points on the unit -sphere (that is, the surface of the unit -ball), gives the following algorithm.
Generate an -dimensional vector of normal deviates (it suffices to use , although in fact the choice of the variance is arbitrary), . Now calculate the "radius" of this point:
The vector is uniformly distributed over the surface of the unit -ball.
An alternative given by Marsaglia is to uniformly randomly select a point in the unit hypercube by sampling each independently from the uniform distribution over , computing as above, and rejecting the point and resampling if (i.e., if the point is not in the -ball), and when a point in the ball is obtained scaling it up to the spherical surface by the factor ; then again is uniformly distributed over the surface of the unit -ball. This method becomes very inefficient for higher dimensions, as a vanishingly small fraction of the unit cube is contained in the sphere. In ten dimensions, less than 2% of the cube is filled by the sphere, so that typically more than 50 attempts will be needed. In seventy dimensions, less than of the cube is filled, meaning typically a trillion quadrillion trials will be needed, far more than a computer could ever carry out.
Alternatively, points may be sampled uniformly from within the unit -ball by a reduction from the unit -sphere. In particular, if is a point selected uniformly from the unit -sphere, then is uniformly distributed within the unit -ball (i.e., by simply discarding two coordinates).
If is sufficiently large, most of the volume of the -ball will be contained in the region very close to its surface, so a point selected from that volume will also probably be close to the surface. This is one of the phenomena leading to the so-called curse of dimensionality that arises in some numerical and other applications.
Let be the appropriately scaled version, then at the limit, the probability density function of converges to . This is sometimes called the Porter–Thomas distribution.
In general, it takes the shape of a cross-polytope.
The octahedral -sphere is a square (without its interior). The octahedral -sphere is a regular octahedron; hence the name. The octahedral -sphere is the topological join of pairs of isolated points. Intuitively, the topological join of two pairs is generated by drawing a segment between each point in one pair and each point in the other pair; this yields a square. To join this with a third pair, draw a segment between each point on the square and each point in the third pair; this gives a octahedron.
|
|