For any natural number n {\displaystyle n} , an n {\displaystyle n} -sphere of radius r {\displaystyle r} is defined as the set of points in ( n + 1 ) {\displaystyle (n+1)} -dimensional Euclidean space that are at distance r {\displaystyle r} from some fixed point c {\displaystyle \mathbf {c} } , where r {\displaystyle r} may be any positive real number and where c {\displaystyle \mathbf {c} } may be any point in ( n + 1 ) {\displaystyle (n+1)} -dimensional space. In particular:
The set of points in ( n + 1 ) {\displaystyle (n+1)} -space, ( x 1 , x 2 , … , x n + 1 ) {\displaystyle (x_{1},x_{2},\ldots ,x_{n+1})} , that define an n {\displaystyle n} -sphere, S n ( r ) {\displaystyle S^{n}(r)} , is represented by the equation:
where c = ( c 1 , c 2 , … , c n + 1 ) {\displaystyle \mathbf {c} =(c_{1},c_{2},\ldots ,c_{n+1})} is a center point, and r {\displaystyle r} is the radius.
The above n {\displaystyle n} -sphere exists in ( n + 1 ) {\displaystyle (n+1)} -dimensional Euclidean space and is an example of an n {\displaystyle n} -manifold. The volume form ω {\displaystyle \omega } of an n {\displaystyle n} -sphere of radius r {\displaystyle r} is given by
where ⋆ {\displaystyle {\star }} is the Hodge star operator; see Flanders (1989, §6.1) for a discussion and proof of this formula in the case r = 1 {\displaystyle r=1} . As a result,
Main article: Ball (mathematics)
The space enclosed by an n {\displaystyle n} -sphere is called an ( n + 1 ) {\displaystyle (n+1)} -ball. An ( n + 1 ) {\displaystyle (n+1)} -ball is closed if it includes the n {\displaystyle n} -sphere, and it is open if it does not include the n {\displaystyle n} -sphere.
Specifically:
Topologically, an n {\displaystyle n} -sphere can be constructed as a one-point compactification of n {\displaystyle n} -dimensional Euclidean space. Briefly, the n {\displaystyle n} -sphere can be described as S n = R n ∪ { ∞ } {\displaystyle S^{n}=\mathbb {R} ^{n}\cup \{\infty \}} , which is n {\displaystyle n} -dimensional Euclidean space plus a single point representing infinity in all directions. In particular, if a single point is removed from an n {\displaystyle n} -sphere, it becomes homeomorphic to R n {\displaystyle \mathbb {R} ^{n}} . This forms the basis for stereographic projection.1
See also: Volume of an n-ball and Unit sphere § Volume and area
Let S n − 1 {\displaystyle S_{n-1}} be the surface area of the unit ( n − 1 ) {\displaystyle (n-1)} -sphere of radius 1 {\displaystyle 1} embedded in n {\displaystyle n} -dimensional Euclidean space, and let V n {\displaystyle V_{n}} be the volume of its interior, the unit n {\displaystyle n} -ball. The surface area of an arbitrary ( n − 1 ) {\displaystyle (n-1)} -sphere is proportional to the ( n − 1 ) {\displaystyle (n-1)} st power of the radius, and the volume of an arbitrary n {\displaystyle n} -ball is proportional to the n {\displaystyle n} th power of the radius.
The 0 {\displaystyle 0} -ball is sometimes defined as a single point. The 0 {\displaystyle 0} -dimensional Hausdorff measure is the number of points in a set. So
A unit 1 {\displaystyle 1} -ball is a line segment whose points have a single coordinate in the interval [ − 1 , 1 ] {\displaystyle [-1,1]} of length 2 {\displaystyle 2} , and the 0 {\displaystyle 0} -sphere consists of its two end-points, with coordinate { − 1 , 1 } {\displaystyle \{-1,1\}} .
A unit 1 {\displaystyle 1} -sphere is the unit circle in the Euclidean plane, and its interior is the unit disk ( 2 {\displaystyle 2} -ball).
The interior of a 2-sphere in three-dimensional space is the unit 3 {\displaystyle 3} -ball.
In general, S n − 1 {\displaystyle S_{n-1}} and V n {\displaystyle V_{n}} are given in closed form by the expressions
where Γ {\displaystyle \Gamma } is the gamma function. Note that Γ {\displaystyle \Gamma } 's values at half-integers contain a factor of π {\displaystyle {\sqrt {\pi }}} that cancels out the factor in the numerator.
As n {\displaystyle n} tends to infinity, the volume of the unit n {\displaystyle n} -ball (ratio between the volume of an n {\displaystyle n} -ball of radius 1 {\displaystyle 1} and an n {\displaystyle n} -cube of side length 1 {\displaystyle 1} ) tends to zero.2
The surface area, or properly the n {\displaystyle n} -dimensional volume, of the n {\displaystyle n} -sphere at the boundary of the ( n + 1 ) {\displaystyle (n+1)} -ball of radius R {\displaystyle R} is related to the volume of the ball by the differential equation
Equivalently, representing the unit n {\displaystyle n} -ball as a union of concentric ( n − 1 ) {\displaystyle (n-1)} -sphere shells,
We can also represent the unit ( n + 2 ) {\displaystyle (n+2)} -sphere as a union of products of a circle ( 1 {\displaystyle 1} -sphere) with an n {\displaystyle n} -sphere. Then S n + 2 = 2 π V n + 1 {\displaystyle S_{n+2}=2\pi V_{n+1}} . Since S 1 = 2 π V 0 {\displaystyle S_{1}=2\pi V_{0}} , the equation
holds for all n {\displaystyle n} . Along with the base cases S 0 = 2 {\displaystyle S_{0}=2} , V 1 = 2 {\displaystyle V_{1}=2} from above, these recurrences can be used to compute the surface area of any sphere or volume of any ball.
We may define a coordinate system in an n {\displaystyle n} -dimensional Euclidean space which is analogous to the spherical coordinate system defined for 3 {\displaystyle 3} -dimensional Euclidean space, in which the coordinates consist of a radial coordinate r {\displaystyle r} , and n − 1 {\displaystyle n-1} angular coordinates φ 1 , φ 2 , … , φ n − 1 {\displaystyle \varphi _{1},\varphi _{2},\ldots ,\varphi _{n-1}} , where the angles φ 1 , φ 2 , … , φ n − 2 {\displaystyle \varphi _{1},\varphi _{2},\ldots ,\varphi _{n-2}} range over [ 0 , π ] {\displaystyle [0,\pi ]} radians (or [ 0 , 180 ] {\displaystyle [0,180]} degrees) and φ n − 1 {\displaystyle \varphi _{n-1}} ranges over [ 0 , 2 π ) {\displaystyle [0,2\pi )} radians (or [ 0 , 360 ) {\displaystyle [0,360)} degrees). If x i {\displaystyle x_{i}} are the Cartesian coordinates, then we may compute x 1 , … , x n {\displaystyle x_{1},\ldots ,x_{n}} from r , φ 1 , … , φ n − 1 {\displaystyle r,\varphi _{1},\ldots ,\varphi _{n-1}} with:34
Except in the special cases described below, the inverse transformation is unique:
where atan2 is the two-argument arctangent function.
There are some special cases where the inverse transform is not unique; φ k {\displaystyle \varphi _{k}} for any k {\displaystyle k} will be ambiguous whenever all of x k , x k + 1 , … x n {\displaystyle x_{k},x_{k+1},\ldots x_{n}} are zero; in this case φ k {\displaystyle \varphi _{k}} may be chosen to be zero. (For example, for the 2 {\displaystyle 2} -sphere, when the polar angle is 0 {\displaystyle 0} or π {\displaystyle \pi } then the point is one of the poles, zenith or nadir, and the choice of azimuthal angle is arbitrary.)
The arc length element is d s 2 = d r 2 + ∑ k = 1 n − 1 r 2 ( ∏ m = 1 k − 1 sin 2 ( φ m ) ) d φ k 2 {\displaystyle ds^{2}=dr^{2}+\sum _{k=1}^{n-1}r^{2}\left(\prod _{m=1}^{k-1}\sin ^{2}\left(\varphi _{m}\right)\right)d\varphi _{k}^{2}} To express the volume element of n {\displaystyle n} -dimensional Euclidean space in terms of spherical coordinates, let s k = sin φ k {\displaystyle s_{k}=\sin \varphi _{k}} and c k = cos φ k {\displaystyle c_{k}=\cos \varphi _{k}} for concision, then observe that the Jacobian matrix of the transformation is:
The determinant of this matrix can be calculated by induction. When n = 2 {\displaystyle n=2} , a straightforward computation shows that the determinant is r {\displaystyle r} . For larger n {\displaystyle n} , observe that J n {\displaystyle J_{n}} can be constructed from J n − 1 {\displaystyle J_{n-1}} as follows. Except in column n {\displaystyle n} , rows n − 1 {\displaystyle n-1} and n {\displaystyle n} of J n {\displaystyle J_{n}} are the same as row n − 1 {\displaystyle n-1} of J n − 1 {\displaystyle J_{n-1}} , but multiplied by an extra factor of cos φ n − 1 {\displaystyle \cos \varphi _{n-1}} in row n − 1 {\displaystyle n-1} and an extra factor of sin φ n − 1 {\displaystyle \sin \varphi _{n-1}} in row n {\displaystyle n} . In column n {\displaystyle n} , rows n − 1 {\displaystyle n-1} and n {\displaystyle n} of J n {\displaystyle J_{n}} are the same as column n − 1 {\displaystyle n-1} of row n − 1 {\displaystyle n-1} of J n − 1 {\displaystyle J_{n-1}} , but multiplied by extra factors of sin φ n − 1 {\displaystyle \sin \varphi _{n-1}} in row n − 1 {\displaystyle n-1} and cos φ n − 1 {\displaystyle \cos \varphi _{n-1}} in row n {\displaystyle n} , respectively. The determinant of J n {\displaystyle J_{n}} can be calculated by Laplace expansion in the final column. By the recursive description of J n {\displaystyle J_{n}} , the submatrix formed by deleting the entry at ( n − 1 , n ) {\displaystyle (n-1,n)} and its row and column almost equals J n − 1 {\displaystyle J_{n-1}} , except that its last row is multiplied by sin φ n − 1 {\displaystyle \sin \varphi _{n-1}} . Similarly, the submatrix formed by deleting the entry at ( n , n ) {\displaystyle (n,n)} and its row and column almost equals J n − 1 {\displaystyle J_{n-1}} , except that its last row is multiplied by cos φ n − 1 {\displaystyle \cos \varphi _{n-1}} . Therefore the determinant of J n {\displaystyle J_{n}} is
Induction then gives a closed-form expression for the volume element in spherical coordinates
The formula for the volume of the n {\displaystyle n} -ball can be derived from this by integration.
Similarly the surface area element of the ( n − 1 ) {\displaystyle (n-1)} -sphere of radius r {\displaystyle r} , which generalizes the area element of the 2 {\displaystyle 2} -sphere, is given by
The natural choice of an orthogonal basis over the angular coordinates is a product of ultraspherical polynomials,
for j = 1 , 2 , … , n − 2 {\displaystyle j=1,2,\ldots ,n-2} , and the e i s φ j {\displaystyle e^{is\varphi _{j}}} for the angle j = n − 1 {\displaystyle j=n-1} in concordance with the spherical harmonics.
The standard spherical coordinate system arises from writing R n {\displaystyle \mathbb {R} ^{n}} as the product R × R n − 1 {\displaystyle \mathbb {R} \times \mathbb {R} ^{n-1}} . These two factors may be related using polar coordinates. For each point x {\displaystyle \mathbf {x} } of R n {\displaystyle \mathbb {R} ^{n}} , the standard Cartesian coordinates
can be transformed into a mixed polar–Cartesian coordinate system:
This says that points in R n {\displaystyle \mathbb {R} ^{n}} may be expressed by taking the ray starting at the origin and passing through z ^ = z / ‖ z ‖ ∈ S n − 2 {\displaystyle {\hat {\mathbf {z} }}=\mathbf {z} /\lVert \mathbf {z} \rVert \in S^{n-2}} , rotating it towards ( 1 , 0 , … , 0 ) {\displaystyle (1,0,\dots ,0)} by θ = arcsin y 1 / r {\displaystyle \theta =\arcsin y_{1}/r} , and traveling a distance r = ‖ x ‖ {\displaystyle r=\lVert \mathbf {x} \rVert } along the ray. Repeating this decomposition eventually leads to the standard spherical coordinate system.
Polyspherical coordinate systems arise from a generalization of this construction.5 The space R n {\displaystyle \mathbb {R} ^{n}} is split as the product of two Euclidean spaces of smaller dimension, but neither space is required to be a line. Specifically, suppose that p {\displaystyle p} and q {\displaystyle q} are positive integers such that n = p + q {\displaystyle n=p+q} . Then R n = R p × R q {\displaystyle \mathbb {R} ^{n}=\mathbb {R} ^{p}\times \mathbb {R} ^{q}} . Using this decomposition, a point x ∈ R n {\displaystyle x\in \mathbb {R} ^{n}} may be written as
This can be transformed into a mixed polar–Cartesian coordinate system by writing:
Here y ^ {\displaystyle {\hat {\mathbf {y} }}} and z ^ {\displaystyle {\hat {\mathbf {z} }}} are the unit vectors associated to y {\displaystyle \mathbf {y} } and z {\displaystyle \mathbf {z} } . This expresses x {\displaystyle \mathbf {x} } in terms of y ^ ∈ S p − 1 {\displaystyle {\hat {\mathbf {y} }}\in S^{p-1}} , z ^ ∈ S q − 1 {\displaystyle {\hat {\mathbf {z} }}\in S^{q-1}} , r ≥ 0 {\displaystyle r\geq 0} , and an angle θ {\displaystyle \theta } . It can be shown that the domain of θ {\displaystyle \theta } is [ 0 , 2 π ) {\displaystyle [0,2\pi )} if p = q = 1 {\displaystyle p=q=1} , [ 0 , π ] {\displaystyle [0,\pi ]} if exactly one of p {\displaystyle p} and q {\displaystyle q} is 1 {\displaystyle 1} , and [ 0 , π / 2 ] {\displaystyle [0,\pi /2]} if neither p {\displaystyle p} nor q {\displaystyle q} are 1 {\displaystyle 1} . The inverse transformation is
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 y ^ {\displaystyle {\hat {\mathbf {y} }}} and z ^ {\displaystyle {\hat {\mathbf {z} }}} are spheres, so the coordinates of a polyspherical coordinate system are a non-negative radius and n − 1 {\displaystyle n-1} angles. The possible polyspherical coordinate systems correspond to binary trees with n {\displaystyle n} 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 R n {\displaystyle \mathbb {R} ^{n}} , and its immediate children represent the first splitting into R p {\displaystyle \mathbb {R} ^{p}} and R q {\displaystyle \mathbb {R} ^{q}} . Leaf nodes correspond to Cartesian coordinates for S n − 1 {\displaystyle S^{n-1}} . 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 θ i {\displaystyle \theta _{i}} , taking the left branch introduces a factor of sin θ i {\displaystyle \sin \theta _{i}} and taking the right branch introduces a factor of cos θ i {\displaystyle \cos \theta _{i}} . 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 R n = R p × R q {\displaystyle \mathbb {R} ^{n}=\mathbb {R} ^{p}\times \mathbb {R} ^{q}} determines a subgroup
This is the subgroup that leaves each of the two factors S p − 1 × S q − 1 ⊆ S n − 1 {\displaystyle S^{p-1}\times S^{q-1}\subseteq S^{n-1}} fixed. Choosing a set of coset representatives for the quotient is the same as choosing representative angles for this step of the polyspherical coordinate decomposition.
In polyspherical coordinates, the volume measure on R n {\displaystyle \mathbb {R} ^{n}} and the area measure on S n − 1 {\displaystyle S^{n-1}} are products. There is one factor for each angle, and the volume measure on R n {\displaystyle \mathbb {R} ^{n}} also has a factor for the radial coordinate. The area measure has the form:
where the factors F i {\displaystyle F_{i}} are determined by the tree. Similarly, the volume measure is
Suppose we have a node of the tree that corresponds to the decomposition R n 1 + n 2 = R n 1 × R n 2 {\displaystyle \mathbb {R} ^{n_{1}+n_{2}}=\mathbb {R} ^{n_{1}}\times \mathbb {R} ^{n_{2}}} and that has angular coordinate θ {\displaystyle \theta } . The corresponding factor F {\displaystyle F} depends on the values of n 1 {\displaystyle n_{1}} and n 2 {\displaystyle n_{2}} . When the area measure is normalized so that the area of the sphere is 1 {\displaystyle 1} , these factors are as follows. If n 1 = n 2 = 1 {\displaystyle n_{1}=n_{2}=1} , then
If n 1 > 1 {\displaystyle n_{1}>1} and n 2 = 1 {\displaystyle n_{2}=1} , and if B {\displaystyle \mathrm {B} } denotes the beta function, then
If n 1 = 1 {\displaystyle n_{1}=1} and n 2 > 1 {\displaystyle n_{2}>1} , then
Finally, if both n 1 {\displaystyle n_{1}} and n 2 {\displaystyle n_{2}} are greater than one, then
Main article: Stereographic projection
Just as a two-dimensional sphere embedded in three dimensions can be mapped onto a two-dimensional plane by a stereographic projection, an n {\displaystyle n} -sphere can be mapped onto an n {\displaystyle n} -dimensional hyperplane by the n {\displaystyle n} -dimensional version of the stereographic projection. For example, the point [ x , y , z ] {\displaystyle [x,y,z]} on a two-dimensional sphere of radius 1 {\displaystyle 1} maps to the point [ x 1 − z , y 1 − z ] {\displaystyle {\bigl [}{\tfrac {x}{1-z}},{\tfrac {y}{1-z}}{\bigr ]}} on the x y {\displaystyle xy} -plane. In other words,
Likewise, the stereographic projection of an n {\displaystyle n} -sphere S n {\displaystyle S^{n}} of radius 1 {\displaystyle 1} will map to the ( n − 1 ) {\displaystyle (n-1)} -dimensional hyperplane R n − 1 {\displaystyle \mathbb {R} ^{n-1}} perpendicular to the x n {\displaystyle x_{n}} -axis as
See also: Von Mises–Fisher distribution § The uniform hypersphere distribution.
To generate uniformly distributed random points on the unit ( n − 1 ) {\displaystyle (n-1)} -sphere (that is, the surface of the unit n {\displaystyle n} -ball), Marsaglia (1972) gives the following algorithm.
Generate an n {\displaystyle n} -dimensional vector of normal deviates (it suffices to use N ( 0 , 1 ) {\displaystyle N(0,1)} , although in fact the choice of the variance is arbitrary), x = ( x 1 , x 2 , … , x n ) {\displaystyle \mathbf {x} =(x_{1},x_{2},\ldots ,x_{n})} . Now calculate the "radius" of this point:
The vector 1 r x {\displaystyle {\tfrac {1}{r}}\mathbf {x} } is uniformly distributed over the surface of the unit n {\displaystyle n} -ball.
An alternative given by Marsaglia is to uniformly randomly select a point x = ( x 1 , x 2 , … , x n ) {\displaystyle \mathbf {x} =(x_{1},x_{2},\ldots ,x_{n})} in the unit n-cube by sampling each x i {\displaystyle x_{i}} independently from the uniform distribution over ( − 1 , 1 ) {\displaystyle (-1,1)} , computing r {\displaystyle r} as above, and rejecting the point and resampling if r ≥ 1 {\displaystyle r\geq 1} (i.e., if the point is not in the n {\displaystyle n} -ball), and when a point in the ball is obtained scaling it up to the spherical surface by the factor 1 r {\displaystyle {\tfrac {1}{r}}} ; then again 1 r x {\displaystyle {\tfrac {1}{r}}\mathbf {x} } is uniformly distributed over the surface of the unit n {\displaystyle n} -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 10 − 24 {\displaystyle 10^{-24}} of the cube is filled, meaning typically a trillion quadrillion trials will be needed, far more than a computer could ever carry out.
With a point selected uniformly at random from the surface of the unit ( n − 1 ) {\displaystyle (n-1)} -sphere (e.g., by using Marsaglia's algorithm), one needs only a radius to obtain a point uniformly at random from within the unit n {\displaystyle n} -ball. If u {\displaystyle u} is a number generated uniformly at random from the interval [ 0 , 1 ] {\displaystyle [0,1]} and x {\displaystyle \mathbf {x} } is a point selected uniformly at random from the unit ( n − 1 ) {\displaystyle (n-1)} -sphere, then u 1 / n x {\displaystyle u^{1/n}\mathbf {x} } is uniformly distributed within the unit n {\displaystyle n} -ball.
Alternatively, points may be sampled uniformly from within the unit n {\displaystyle n} -ball by a reduction from the unit ( n + 1 ) {\displaystyle (n+1)} -sphere. In particular, if ( x 1 , x 2 , … , x n + 2 ) {\displaystyle (x_{1},x_{2},\ldots ,x_{n+2})} is a point selected uniformly from the unit ( n + 1 ) {\displaystyle (n+1)} -sphere, then ( x 1 , x 2 , … , x n ) {\displaystyle (x_{1},x_{2},\ldots ,x_{n})} is uniformly distributed within the unit n {\displaystyle n} -ball (i.e., by simply discarding two coordinates).6
If n {\displaystyle n} is sufficiently large, most of the volume of the n {\displaystyle n} -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 y = x 1 2 {\displaystyle y=x_{1}^{2}} be the square of the first coordinate of a point sampled uniformly at random from the ( n − 1 ) {\displaystyle (n-1)} -sphere, then its probability density function, for y ∈ [ 0 , 1 ] {\displaystyle y\in [0,1]} , is
ρ ( y ) = Γ ( n 2 ) π Γ ( n − 1 2 ) ( 1 − y ) ( n − 3 ) / 2 y − 1 / 2 . {\displaystyle \rho (y)={\frac {\Gamma {\bigl (}{\frac {n}{2}}{\bigr )}}{{\sqrt {\pi }}\;\Gamma {\bigl (}{\frac {n-1}{2}}{\bigr )}}}(1-y)^{(n-3)/2}y^{-1/2}.}
Let z = y / N {\displaystyle z=y/N} be the appropriately scaled version, then at the N → ∞ {\displaystyle N\to \infty } limit, the probability density function of z {\displaystyle z} converges to ( 2 π z e z ) − 1 / 2 {\displaystyle (2\pi ze^{z})^{-1/2}} . This is sometimes called the Porter–Thomas distribution.7
The octahedral n {\displaystyle n} -sphere is defined similarly to the n {\displaystyle n} -sphere but using the 1-norm
In general, it takes the shape of a cross-polytope.
The octahedral 1 {\displaystyle 1} -sphere is a square (without its interior). The octahedral 2 {\displaystyle 2} -sphere is a regular octahedron; hence the name. The octahedral n {\displaystyle n} -sphere is the topological join of n + 1 {\displaystyle n+1} pairs of isolated points.10 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.
James W. Vick (1994). Homology theory, p. 60. Springer ↩
Smith, David J.; Vamanamurthy, Mavina K. (1989). "How Small Is a Unit Ball?". Mathematics Magazine. 62 (2): 101–107. doi:10.1080/0025570X.1989.11977419. JSTOR 2690391. https://www.jstor.org/stable/2690391 ↩
Blumenson, L. E. (1960). "A Derivation of n-Dimensional Spherical Coordinates". The American Mathematical Monthly. 67 (1): 63–66. doi:10.2307/2308932. JSTOR 2308932. /wiki/Doi_(identifier) ↩
Formally, this formula is only correct for n > 3 {\displaystyle n>3} . For n − 3 {\displaystyle n-3} , the line beginning with x 3 = ⋯ {\displaystyle x_{3}=\cdots } must be omitted, and for n = 2 {\displaystyle n=2} , the formula for polar coordinates must be used. The case n = 1 {\displaystyle n=1} reduces to x = r {\displaystyle x=r} . Using capital-pi notation and the usual convention for the empty product, a formula valid for n ≥ 2 {\displaystyle n\geq 2} is given by x n = r ∏ i = 1 n − 1 sin φ i {\displaystyle \textstyle x_{n}=r\prod _{i=1}^{n-1}\sin \varphi _{i}} and x k = r cos φ k ∏ i = 1 k − 1 sin φ i {\displaystyle \textstyle x_{k}=r\cos \varphi _{k}\prod _{i=1}^{k-1}\sin \varphi _{i}} for k = 1 , … , n − 1 {\displaystyle k=1,\ldots ,n-1} . /wiki/Polar_coordinates ↩
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, ISBN 0-7923-1492-1, pp. 223–226. /wiki/ISBN_(identifier) ↩
Voelker, Aaron R.; Gosmann, Jan; Stewart, Terrence C. (2017). Efficiently sampling vectors and coordinates from the n-sphere and n-ball (Report). Centre for Theoretical Neuroscience. doi:10.13140/RG.2.2.15829.01767/1. http://compneuro.uwaterloo.ca/publications/voelker2017.html ↩
Livan, Giacomo; Novaes, Marcel; Vivo, Pierpaolo (2018), Livan, Giacomo; Novaes, Marcel; Vivo, Pierpaolo (eds.), "One Pager on Eigenvectors", Introduction to Random Matrices: Theory and Practice, SpringerBriefs in Mathematical Physics, Cham: Springer International Publishing, pp. 65–66, doi:10.1007/978-3-319-70885-0_9, ISBN 978-3-319-70885-0, retrieved 2023-05-19 978-3-319-70885-0 ↩
Stillwell, John (1993), Classical Topology and Combinatorial Group Theory, Graduate Texts in Mathematics, vol. 72, Springer, p. 247, ISBN 9780387979700. 9780387979700 ↩
Agricola, Ilka; Bazzoni, Giovanni; Goertsches, Oliver; Konstantis, Panagiotis; Rollenske, Sönke (2018). "On the history of the Hopf problem". Differential Geometry and Its Applications. 57: 1–9. arXiv:1708.01068. doi:10.1016/j.difgeo.2017.10.014. S2CID 119297359. /wiki/Ilka_Agricola ↩
Meshulam, Roy (2001-01-01). "The Clique Complex and Hypergraph Matching". Combinatorica. 21 (1): 89–94. doi:10.1007/s004930170006. ISSN 1439-6912. S2CID 207006642. /wiki/Doi_(identifier) ↩