Let . Uniform volume measure on the unit ball gives , , hence radius density . Conditional on , independence leaves a standard Brownian motion. Its exit time from the radius- ball is finite: applying optional stopping to stopped at that exit and then letting gives .
The probability law of the exit point is invariant under every orthogonal transformation, because both Brownian motion and the centred sphere are invariant under those transformations. The unique invariant probability on that sphere is normalized surface measure; for it is the equally weighted pair . This is also the conditional angular law of given . Mixing these identical conditional laws against proves the uniform ball sampling by Brownian stopping identity
The event has probability zero and causes no difficulty. Independence of permits its value to be included in the initial filtration, making a stopping time.
An orthogonal transformation preserves the real inner product. If is an invariant subspace, its orthogonal complement is invariant too: in finite dimensions, and for , , we have .
Complexify the space and the transformation. There is a complex eigenvalue , and preservation of the Hermitian norm gives . If is real, it is or , and the real kernel of contains a nonzero vector. Its span is an invariant line on which acts as or .
If is nonreal, write an eigenvector as . Its real and imaginary parts are linearly independent: otherwise a nonzero real vector would have the nonreal eigenvalue. The real plane is invariant, because comparison of real and imaginary parts in gives real combinations of . The restriction has determinant . In an oriented orthonormal basis of , it is therefore a rotation
There is no invariant real line in this plane: such a line would supply a real eigenvalue, whereas its two eigenvalues are nonreal.
Apply the argument repeatedly to the invariant orthogonal complement. Thus the smallest mutually orthogonal invariant blocks are lines with action , and planes with a genuine rotation. Planes with angle or can be decomposed further into lines.
In dimension three a suitably chosen orthonormal basis therefore gives either
or
Changing the orientation of the plane reverses the angle, so this angle range loses no cases. These exhaust rotations, reflections and their possible compositions in three dimensions.
There are two necessary qualifications to the literal formulation. The whole group is itself a closed normal subgroup, so the claim about containment in the centre must concern proper closed normal subgroups. Also, the homomorphism conclusion needs a nontrivial target : for example, has surjective differential onto the zero Lie algebra, but its group kernel is all of and no quotient by a finite subgroup is a one-point group. We prove the precise assertions, including these exceptional cases.
Write . The centre is invariant under the Adjoint representation, so irreducibility makes it either zero or all of . In the latter case is Abelian. For connected , the adjoint action is then trivial: the group is generated by exponentials, and . A nonzero trivial representation is irreducible only in dimension one. A connected compact one-dimensional Lie group is a circle, so .
For every other , the Lie algebra of its centre is zero. The centre is a closed compact Lie subgroup; a zero-dimensional compact Lie group is finite. Let be a closed normal subgroup. The closed-subgroup theorem identifies as an adjoint-invariant subspace of , hence or . If the latter holds, contains an identity neighbourhood and is open, so connectedness forces . If is proper, it therefore has zero Lie algebra and is finite. For any , the continuous map takes connected into the finite set , so it is constant and equal to . Thus
Proper closed subgroups of the circle are finite as well, and of course central.
Now let be surjective. The submersion theorem makes contain an identity neighbourhood in , so it is an open subgroup. Since is connected, . Its group kernel is closed and normal. If is nontrivial, is proper and the preceding argument gives a finite central group kernel; this also holds for , whose proper closed subgroups are finite. The Lie-group first isomorphism theorem gives
If is trivial, the correct statement is instead .
For the Spin groups, use the real Clifford algebra with . The group consists of products of an even number of unit vectors inside its invertible even part. Conjugation on the embedded defines the standard double covering with group kernel . The Clifford relations show that a unit-vector reflection, with the usual twisted conjugation, is a hyperplane reflection; the even products give orientation-preserving transformations. The Cartan–Dieudonné theorem states that every orthogonal transformation is a product of reflections, proving surjectivity. For this connected covering group is simply connected; is a circle.
Here is an explicit exterior-square construction of the requested six-dimensional map. Put with its standard Hermitian form and volume . On , write and define an antilinear map by
It satisfies . Intrinsically, if and the Hermitian inner product is linear in its first variable, then . Because preserves both and , it commutes with . This is the real structure of the SU4 exterior square.
The fixed space has the following real orthonormal basis, with all vectors divided by :
Thus is six-dimensional over , its complexification is , and the exterior-square action restricts to an orthogonal representation on . Its determinant is one because is connected. We obtain .
To compute the group kernel, diagonalize with eigenvalues . If , its complexified exterior-square action is the identity, hence for every . Comparing pairs shows that all are equal, and their common value has square one. A unitary matrix with that single eigenvalue is scalar, so . Conversely, those two scalar matrices plainly act trivially on the exterior square.
The differential of is injective because its group kernel is finite. Both Lie algebras have dimension , so the differential is an isomorphism. Its image is consequently open in connected , hence all of . Therefore
This also realizes as , since is simply connected, by uniqueness of the connected simply connected covering group.
Set and . These are orthonormal because . Complete them to an orthonormal basis of . An orthogonal transformation of the standard normal error vector has independent normal random variables as coordinates : its joint probability density remains because the transformation preserves squared length and has Jacobian determinant of absolute value one.
Projection onto these basis directions gives
Therefore the joint distribution of least-squares and variance estimators is
The last law is the chi-squared distribution of a sum of squared independent normal random variables with mean zero and variance one, and independence follows because the three statistics use disjoint independent coordinate sets. When all , omit the slope direction: and are independent, and there is no identifiable slope estimator.
Use the following skew-symmetric matrix, whose columns reduce modulo three to four of the specified nonzero tetracode words:
Set , , and define the full Euclidean lattices . Their determinants have absolute value , since
For arbitrary positive real numbers , put and . This is the tetracode length-isospectral lattice construction. We prove equality of the length multisets by an explicit bijection, not just equality of the shortest lengths.
Modulo three, both lattices have image . The matrix has rank two over ; its four column lines are precisely the four lines in . Also modulo three, so . Each nonzero tetracode word has exactly one zero coordinate. Every therefore has some coordinate divisible by three. Moreover, all four coordinates of have the same parity, because every entry of either is odd.
For , choose the least index with and set . The coordinate reflection bijection for tetracode lattices will show that . First, , so . Second, positive-lattice membership implies . Hence
The expression in parentheses has th coordinate zero and every other coordinate even, by the common parity and . Thus . Together the congruences modulo three and four say , which is precisely .
Conversely, if , the same reflection has unchanged reduction modulo three, and now . Thus
Its th coordinate is and its other coordinates are even multiples of two, so it vanishes modulo four; it vanishes modulo three as well. The reflected vector is in . The chosen index is unchanged by reflection, including for vectors reducing to zero, so this map is an involution between the two lattices. It preserves every and therefore preserves . The two lattices have the same length spectrum, including every multiplicity, for every positive choice of weights.
To prove a genuine failure of isometry, choose
These four numbers are linearly independent over : changing the signs of the independent square roots in the multiquadratic field isolates each coefficient of a rational relation. If an orthogonal transformation maps to , then
and . Comparing rational coefficients of the independent in the diagonal entries gives . Consequently is diagonal with entries .
Such a coordinate sign change must preserve modulo three. For each zero coordinate , there are exactly two opposite nonzero tetracode words. Preserving their line requires the other three signs to be equal. Taking two different zero coordinates forces all four signs to be equal. Thus or , either of which would imply . But
This contradiction proves and are not isometric. Allowing affine isometries changes nothing: translating the image of zero back to zero reduces them to the orthogonal case.
For the flat tori, take period lattices equal to the dual lattices:
The standard spectrum of a flat torus lemma states that its characters of a real torus are indexed by the dual of its period lattice. Here they are for , with Laplacian eigenvalue . These characters give a complete orthogonal basis, so our length-preserving bijection proves that and are isospectral manifolds. The second standard lemma is that an isometry of flat tori lifts to an affine isometry of their Euclidean universal covers. Its orthogonal part maps the period lattices to one another, and therefore maps their dual lattices to one another. This would give the impossible isometry . Hence and are isospectral non-isometric flat four-dimensional tori.
For , take the normalized Pauli operators as the traceless basis. The matrix associated with a vector is , where these basis matrices are the usual Pauli matrices divided by . Their multiplication relations give
At radius , these eigenvalues are one and zero. Every sphere point therefore gives a positive rank-one projector. Any other orthonormal Hermitian basis merely changes the real coordinates by an orthogonal transformation, so the result is basis independent.
For every , choose a rank-one projector and consider the Hermitian trace-one matrix
Its eigenvalues are once and with multiplicity . They sum to one and satisfy
By orthonormality its traceless coordinate vector has squared length , so it is on the specified sphere. But , so is not a density operator. Thus for , the pure states occupy a proper subset of the sphere; positivity excludes some of its points. In fact, this example is the antipodal Bloch vector to that of .
The usual assertion presumes . If the trivial dimension is admitted, the radius-zero sphere consists of the single coordinate point, also corresponding to the single pure state, so that dimension is an additional trivial exception.
Put . The Bellman equation is . For the quadratic candidate , the quantity minimized is
For , completing the square gives . Matching the and constant terms requires
The first equation is . Its admissible nonnegative root is , and . Hence .
A suitable discounted verification theorem is: if a nonnegative candidate satisfies the Bellman equation, a stationary minimizing selector has finite cost and its discounted expected terminal candidate tends to zero, and the same terminal limit holds for every finite-cost competing policy, then that selector is optimal and the candidate is the value function. Iterating the Bellman inequality proves the lower bound for each competing cost; iterating equality along the selector proves attainment. Here finite cost implies , so . Under the selector , the second moments are bounded by a geometric recursion, giving finite cost and the same terminal limit. Thus . Infinite-cost policies cannot improve the value.
For , the two coordinates decouple and have the same discount, so . The total value is .
For , the discount is and the state cost is . Introduce the orthogonal transformation , , with controls , . The cost becomes . Each transformed noise has mean zero and variance one; they need not be independent unless the original noises are Gaussian, and no such independence is needed here. The unpenalized difference coordinate has optimal control . For the sum coordinate, the quadratic coefficient solves
so , , and the constant is . Therefore
The sum state is mean-square stable under this feedback; the uncontrolled difference state may wander, but its value function and state cost are both zero. The same verification argument applies to the penalized sum coordinate.
Use the Fourier transform convention . For every orthogonal matrix , changing variables gives
since the Jacobian has absolute determinant one and a radial function satisfies . Any two vectors of the same length are related by an orthogonal transformation, so .
Taking the Fourier transform gives . Thus the canonical solution is
A smooth compactly supported function is a Schwartz function, as is its Fourier transform. The multiplier and all its derivatives have polynomial bounds, so their product with is again a Schwartz function. The inverse integral can therefore be differentiated to verify classically. By part (b), its Fourier-space integrand factor is radial. Changing variables by any orthogonal transformation in the inverse integral gives , proving radiality.
This is also the unique tempered-distribution solution: the nonvanishing multiplier can be inverted on that space. Unrestricted classical solutions need not be unique, since one may add, for example, ; the Fourier construction selects the rapidly decaying solution.
Equip with the inner product defining the root system, so the Weyl group acts by orthogonal transformations. As usual, the root system spans its ambient space . Let be an invariant subspace for the reflection representation of a Weyl group. Its orthogonal complement is also invariant.
For a root , the Weyl reflection satisfies
If for every , then . Otherwise choose with . Both and belong to , and their difference is a nonzero multiple of , so . Hence
The two sets are mutually orthogonal and individually closed under their root reflections. If both were nonempty, this would decompose into two orthogonal root systems, contradicting that it is an irreducible root system. All roots therefore lie in one of the two subspaces. Because they span , either or , the latter giving . Thus the reflection representation is an irreducible representation.
The Malgrange–Ehrenpreis theorem states that every nonzero constant-coefficient linear differential operator on Euclidean space has a distributional fundamental solution. With and , the conclusion is an such that . If , simply take ; hence assume .
We construct a Hörmander staircase in frequency space. The highest-degree homogeneous part is not identically zero on real vectors, since a polynomial vanishing on all real vectors has all coefficients zero. After an orthogonal transformation of coordinates, we can arrange that . Thus, for each real , the polynomial
has degree in and the same nonzero leading coefficient , independent of . This constant leading coefficient of a polynomial is what makes a uniform staircase possible.
For a fixed , factor , counting repeated roots of a polynomial. Consider the heights , . A given root has imaginary part within distance less than one of at most one of these heights. By the pigeonhole principle, some height avoids every root, and then
This is finite-height polynomial root avoidance. Root labels need not be chosen continuously or even measurably. Instead define the closed sets
Continuity in extends the inequality from rational to every real . These Borel sets partition . The Hörmander staircase assigns the horizontal contour over ; its height is bounded by , and the denominator has the uniform lower bound . For , the transverse space is a single point and only one horizontal contour is needed.
Use the Fourier transform convention , with inverse factor . Define the candidate fundamental solution of a linear differential operator by
For a test function supported in a fixed compact set , Fourier decay in a bounded complex strip gives, for any integer ,
Indeed, this is the real Fourier transform of with reversed frequency, and repeated integration by parts with proves the estimate. Taking and using the denominator bound proves absolute convergence and a continuity estimate on . Thus is a distribution; no unsupported interpretation of a divergent inverse Fourier transform is being used.
For its distributional derivatives, the formal transpose of a differential operator is . Since
applying cancels the denominator. For each fixed , the numerator is an entire function of . The Cauchy integral theorem, applied to a rectangle between the lines and , gives
The two vertical edges tend to zero by the same bounded-strip decay. The resulting contour deformation is performed separately for each transverse frequency, so discontinuities of the staircase height introduce no additional boundary terms. Absolute convergence permits integration over the partition . The Fourier inversion theorem then yields
This proves the Malgrange–Ehrenpreis theorem. Undoing the orthogonal change of coordinates gives the fundamental solution of a linear differential operator for the original operator; the Dirac delta distribution is unchanged by that change of coordinates.
For a one-dimensional operator of degree , with leading coefficient , we may choose the single staircase contour below every pole. Take and integrate on . The corresponding formula is the Bromwich contour version of the construction above, after putting . Its poles all lie above the frequency contour. For , close that contour downwards; the exponential function decays and there are no enclosed poles. For , close upwards, where the exponential function again decays, and apply the residue theorem. The bound justifies the large arcs, including by the Jordan lemma away from their endpoints. Thus away from the retarded fundamental solution is , where
The sum is over distinct roots of a polynomial, with the residue including the whole multiplicity. For simple characteristic roots of a constant-coefficient differential equation, it reduces to . Repeated roots give exponential polynomial solutions of a constant-coefficient differential equation through differentiation of .
To establish the equality also at the origin, rather than leave a possible point-supported term undecided, verify the distributional jump formula for a Heaviside product. The residue expression is an entire function of , and
Its initial derivatives are
These identities follow by integrating over a large circle: for the integrand is , whereas for its coefficient of is . The distributional jump formula for a Heaviside product therefore gives . Moreover, since is a tempered distribution, its Fourier transform satisfies
There are no real zeros of this polynomial, so its reciprocal is the transform. This is exactly the shifted-contour construction, proving equality there as a distribution as well. Hence
The sign of matters: for the operator in the preceding solution, and the last initial derivative is .
Denote the four displayed matrices, from left to right, by . An orthogonal matrix has an orthonormal set of columns, equivalently . Direct column dot products give for . The first column of has squared Euclidean norm , so the third matrix is the unique nonorthogonal matrix.
For , the determinant is . A nonidentity orthogonal transformation of with determinant is a rotation: it has a fixed axis and restricts to a plane rotation on its orthogonal complement. Consequently is the rotation.
For , calculation gives
A plane reflection fixes its entire plane, and therefore has eigenvalue . Since is invertible, is not a plane reflection. Thus is the combination of a rotation and a reflection. More explicitly, is an eigenvector with eigenvalue . On the perpendicular plane, is a rotation with , because . This gives a three-dimensional improper orthogonal transformation.
For , set . Then
This reflection matrix reverses the normal and fixes every vector perpendicular to . Therefore is reflection in the plane . In particular, and . Finally represents none of the three listed orthogonal transformations, since each preserves the Euclidean norm.
Use completing the square rather than computing the eigenvalues of the symmetric matrix. Successively removing the mixed terms gives
Thus one suitable invertible linear change of coordinates is
The coordinate matrix is upper triangular with determinant one, so the change is an invertible linear map. Its inverse is , , . Hence the diagonal coefficients can be taken as . This is a matrix congruence of a quadratic form; an orthogonal transformation was not required.
A flat torus is the quotient , where is a full-rank Euclidean lattice, with the Riemannian metric induced from the Euclidean metric. Translation by a lattice vector is a Riemannian isometry, so this metric is well defined and has zero curvature. Its volume is the covolume of .
The dual lattice is . For , the function descends to the flat torus, and direct differentiation gives
Conversely, write and . Ordinary Fourier series on have frequencies , corresponding to . After normalization they form a complete orthonormal basis in , and the Fourier coefficients of a smooth function decay rapidly. Applying the Laplace-Beltrami operator term by term shows that a smooth eigenfunction with eigenvalue has nonzero coefficients only where . Thus the spectrum of a flat torus is
The formula counts multiplicity over either the real or complex numbers: the two frequencies give the real sine and cosine functions.
For the rigidity assertion in dimension two, it suffices to reconstruct a rank-two Euclidean lattice from its vector-length multiset. The multiset first determines its covolume . Indeed, a bounded fundamental parallelogram, and comparison of the cells meeting a disk with slightly larger and smaller disks, give the lattice-point asymptotics by fundamental cells
The spectrum determines , including multiplicities, so it determines .
Let be the smallest nonzero vector length, and choose with . This vector is primitive: with would contradict minimality. From the length multiset subtract the two vectors at every positive length , for . The shortest remaining length is exactly the length of a shortest vector . This subtraction is legitimate even if several directions have length : it subtracts just two copies, and then . It also proves that is independent of our choice of shortest direction. Replace by to arrange
The replacement stays outside and cannot be shorter than , so a reduced choice still has length .
The shortest-independent-vector basis lemma says that are a basis of . To prove it, choose coordinates with . Because is primitive, ; let be the smallest positive vertical coordinate in . Write , with after changing its sign. If , a vector of vertical coordinate , reduced horizontally modulo , has
This contradicts the definition of , since . Hence and generate .
The Gram matrix of this basis is , with , and its determinant is . Therefore
Changing the sign of one basis vector allows . The numbers , all audible from the spectrum, consequently determine the Gram matrix, and hence , up to an orthogonal transformation. Taking dual lattices gives the same conclusion for . Isospectral flat two-dimensional tori are isometric. The argument uses the special basis property of rank-two Euclidean lattices, so it does not claim higher-dimensional rigidity.
For unit , put . Then and , so is an orthogonal matrix. The affine reflection in a hyperplane is . Hence preserves the Euclidean norm and distance, and whenever . Thus it is an Euclidean isometry fixing the hyperplane pointwise.
For , any reflection exchanging them must have normal parallel to , and its fixed hyperplane must contain their midpoint. These requirements determine the perpendicular bisector uniquely:
Changing both signs of leaves the same reflection. It belongs to the orthogonal group exactly when its translation term vanishes, that is, . Since ,
To prove the finite reflection decomposition of a Euclidean isometry, first note that a distance-preserving map fixing zero preserves inner products by the polarization identity. Its values on an orthonormal basis form an orthonormal basis, and shows . Thus is orthogonal.
Every orthogonal transformation is a product of at most linear reflections: if , reflect to using the hyperplane normal , which passes through zero. The resulting orthogonal transformation fixes , and its restriction to is handled inductively in dimension . If , no initial reflection is necessary. Reflections on the complement extend by fixing ; the induction starts in dimension zero.
For an arbitrary isometry , if , first reflect to zero across its perpendicular bisector with zero. Composing this one affine reflection with gives an orthogonal transformation. If , skip the initial reflection. Therefore
The glide reflection cannot use fewer than three: its determinant sign is negative, excluding zero or two reflections, while absence of fixed points excludes a single reflection. Three suffice by reflecting successively in , , and .
The linear least-squares problem is to minimize over , allowing an overdetermined system to have a nonzero residual. For a full QR decomposition, is orthogonal and is with an upper-triangular top block. Orthogonal transformations preserve the Euclidean norm, so
If has full column rank, the top triangular block is nonsingular; setting its residual to zero gives the unique minimizer, while the remaining residual is independent of . Without full column rank, minimizers still exist but need not be unique.
For the specified matrix, one Householder reflection already produces an upper-triangular matrix. Take , the difference between the first column and , and set
The formula gives , . Direct multiplication yields the Householder QR decomposition
All subdiagonal entries in the remaining columns are already zero, so no further reflection is needed. For the supplied right-hand side, . Back substitution gives , , , hence
The residual is orthogonal to every column of , independently confirming the normal equations .
Let be orthonormal unit vectors north, west and upward. A direction of altitude and westward azimuth is
The north celestial pole and the upper equatorial meridian direction are
In the equatorial coordinate system, the same unit vector is . Taking dot products with respectively gives
This is an orthogonal transformation between two bases, so it preserves the length of the direction vector. Recover from both its sine and cosine to keep the correct quadrant. At the zenith, azimuth itself is undefined; the vector equations remain meaningful by continuity. Using the more usual eastward azimuth changes the sign of the second equation.
At the Gaussian fixed point, , so all three quartic couplings have engineering dimension . Thus
Take and , as in the perturbative epsilon expansion. Define , , . The renormalization-group fixed point equations become
If , each of is independently or , giving four renormalization-group fixed points. If , subtracting the first two equations gives
The branch forces ; inserting this in the first equation yields a repeated root . Hence every nonzero- solution has . Then , and
has roots and . The complete list of six coupled Ising fixed points near four dimensions, in coordinates , is
The internal symmetries of these renormalization-group fixed points are:
The last point displays the field-rotation equivalence of decoupled Ising theories. With the orthogonal transformation ,
It is the same pair of decoupled Ising models written in fields rotated by , but remains a distinct coordinate solution of the stated renormalization-group beta functions. Here denotes the dihedral group of order eight; an alternative convention calls it . We have described linear internal transformations preserving the gradient energy; free massless sectors also have constant scalar-field shift symmetries. At , the six coordinates coalesce at the Gaussian fixed point.
A smooth surface in is a subset locally parametrized by a smooth map of two variables whose derivative has rank two and which is a homeomorphism onto its image.
Writing , the first surface equation becomes
It is the torus of major radius and minor radius , with smooth parametrization
Since , this is an embedding. The Gaussian curvature of a torus is
For the second surface, use the orthogonal transformation
Its equation becomes the same torus equation . Orthogonal transformations are Euclidean isometries and preserve Gaussian curvature. Curvature vanishes where , equivalently . In the original coordinates the zero-curvature points are therefore exactly
For an edge , put and . Since , we have .
The random normal has the isotropic Gaussian distribution . Its distribution is invariant under orthogonal transformations; if are linearly independent, its projection onto their plane has a uniformly distributed direction. The signs of its inner products with differ in two sectors of total angle , out of . Thus random hyperplane rounding gives
If , the signs differ with probability one and the same formula holds with . Zero inner products have probability zero, since each is a unit vector.
If the graph has an edge, its corresponding principal block of forces , so the division by used to obtain the Gram matrix is valid. An edgeless graph can instead be colored with one color directly.