Use the orthonormal right-handed basis
Direct multiplication gives , and . Thus the matrix in this basis is
The last two columns are orthogonal and both have squared norm . Therefore is an orthogonal matrix precisely when , giving the unique positive value
Its determinant is , so it is a proper rotation matrix, not a reflection. The transverse block has cosine and sine both . Consequently
With the oriented axis , the angle is positive by the right-hand rule, since . The axis also follows from the unit-eigenvalue eigenspace. As a check, .
For a Cartesian change of basis represented by an orthogonal matrix , vectors transform as and . Their squared norms are invariant and . Substitution into the given expression therefore gives
the transformation law of a Cartesian second-rank tensor. The magnetic field's extra axial sign under an improper physical reflection, if included, appears twice and cancels in its quadratic contribution.
Write the Maxwell stress tensor as . Its divergence is
The identity follows by contracting two Levi-Civita symbols, or directly by differentiating components. Using Maxwell's equations consequently yields
Hence the local conservation of electromagnetic momentum is
The two subtracted terms are the Lorentz force density, while is the electromagnetic momentum density in the units used here.
For fixed finite matrices, the matrix exponential and a Taylor expansion show
This agrees through degree two with , even when and do not commute. On a fixed time interval, and the telescoping identity
turns the one-step defect into global error for . Hence Strang splitting is second order in general; for commuting matrices it is exact.
For the spatial discretization, use , and the interior vector , with . The central finite differences give
Here lists lower diagonal, main diagonal and upper diagonal, in that order. Thus and . Discrete summation by parts gives
The matrix exponential is consequently a contraction in the Euclidean norm, while is an orthogonal matrix for real . Therefore
Repeated split steps are contractive in the mesh-weighted norm , uniformly in the spatial mesh and without a Courant–Friedrichs–Lewy condition. The split semidiscretization is unconditionally stable. No commutativity or shared eigenvectors are needed for this Strang splitting contraction for symmetric diffusion and skew advection. Its time-order proof is for fixed spatial matrices; as , commutators can grow, so this stability result alone is not a uniform-in-mesh second-order error estimate.
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.
True. The determinant gives a group homomorphism
For an orthogonal matrix, implies , and a reflection has determinant , so the target has order two and the map is onto. Its kernel of a group homomorphism is exactly
This is the defining special orthogonal group inside the orthogonal group.
For a differentiable curve in the SO(3) group with , differentiating gives , where . Conversely, if is a real skew-symmetric matrix, is an orthogonal matrix and has determinant . Hence
The displayed generators of the SO(3) Lie algebra are
They are linearly independent and span the three independent entries of a real skew-symmetric matrix. Equivalently, . The vector triple-product identity then gives
Thus the structure constants of a Lie algebra in this basis are
Use a real, antisymmetric convention throughout the SO(3) vector Higgs model. With gauge coupling , the gauge covariant derivative and gauge field strength are
There is no factor of in these formulas because are real antisymmetric generators. For a local non-Abelian gauge transformation , with in the SO(3) group, the compatible transformation of the gauge potential is
It gives and . These covariance laws fix the relative signs in the gauge covariant derivative and gauge field strength.
An SO(3) invariant quartic scalar potential is
Since , this scalar potential is gauge-invariant. Its minimum is the sphere , rather than a preferred direction in the internal vector space.
Writing , the cross product form of the gauge covariant derivative is . In components this is
Correspondingly, the gauge field strength has components
A covariantly constant vector Higgs field has constant norm, because
The last equality uses antisymmetry of the gauge potential. On a connected region write this norm as . If , the vector Higgs field is identically zero. If , the SO(3) group acts transitively on unit vectors, so choose a smooth local non-Abelian gauge transformation rotating to . In this unitary gauge, with constant. This is a local construction, and is global on a trivial contractible region; a nontrivial bundle can require more than one gauge patch.
For nonzero , substituting the constant aligned vector Higgs field into gives . For nonzero gauge coupling, the most general compatible gauge potential and gauge field strength are
where is an arbitrary real one-form. Thus the surviving gauge group is the stabilizer subgroup of . A covariantly constant vector Higgs field does not force the gauge field strength to vanish: it only requires the curvature to annihilate that field.
For the Higgs mechanism, choose a vacuum of the SO(3) invariant quartic scalar potential, so the constant norm is . The canonically normalized kinetic term then contains
The two broken-direction gauge bosons have mass (or if the sign of is unrestricted), while the gauge boson remains massless. The two angular Goldstone bosons supply the massive vectors' longitudinal gauge-boson polarizations. The radial fluctuation remains a physical scalar field, with for this normalization. The condition selects backgrounds without broken-direction gauge potentials; fluctuations about such a vacuum exhibit the two massive modes. Constancy of the norm alone does not require it to minimize the scalar potential.
A counterclockwise planar rotation matrix has the form
To recover this form from preservation of the Euclidean norm, let be the columns of . Applying the norm condition to the two coordinate unit vectors gives . Applying it to their sum gives
so . The columns are an orthonormal basis, and : is an orthogonal matrix.
Write . There are two perpendicular unit vectors available for , namely . The first gives determinant , the second . The positive determinant hypothesis selects the first. A norm-preserving planar map with positive determinant is a rotation.
For the commutation condition, write
Direct matrix multiplication gives
Equality forces and , so, with and ,
If , take and . Otherwise set and choose , . Then
This describes the centralizer of a planar quarter-turn. Its nonzero elements act as a rotation followed by a uniform scaling, just as multiplication by a nonzero complex number does.
Let be an orthogonal matrix describing a Cartesian change of coordinates, with transformed vector components and . Their outer product transforms as
which is the transformation law of a second-order Cartesian tensor. Here “rank two” counts tensor indices, not the rank of a matrix; a nonzero outer product has matrix rank one.
For an isotropic second-rank tensor, invariance means for every proper rotation matrix. The half-turn matrices , and force all off-diagonal entries to vanish. Quarter-turns around coordinate axes then force the three diagonal entries to be equal. Conversely , so the most general second-rank isotropic tensor is
Since has matrix rank at most one, it cannot equal a nonzero scalar multiple of the three-dimensional identity. Thus its isotropy forces . If , a nonzero component makes the entire th row vanish only when ; the converse is immediate. The required choices are exactly
For the Levi-Civita symbol, multilinearity and antisymmetry of the determinant give
for every . This proves the rotation invariance of the Levi-Civita symbol, hence its third-rank isotropy. The convention is invariance under proper rotations: under an orthogonal reflection , the sign reverses. Thus it is a pseudotensor if transformations of both orientations are included.
A Givens rotation is the identity outside rows and columns , with the block
The block's transpose times itself is the identity, so the whole matrix satisfies and is an orthogonal matrix. In particular it preserves the Euclidean norm. To annihilate the lower entry of a column pair , take , , ; the rotated pair is . If both entries are zero, take the identity rotation.
A QR decomposition of an matrix, , is , where is an orthogonal matrix and is and upper trapezoidal: for . In particular its bottom rows vanish.
Successive left Givens rotations annihilate the entries below the diagonal, column by column. When working on column , rotate rows and ; their earlier columns are already zero, so the earlier eliminations persist. If , then
A product of orthogonal matrices is orthogonal. The construction remains valid for a rank-deficient matrix, although uniqueness is not asserted. This is QR decomposition by Givens rotations.
The orthogonal matrix preserves the Euclidean norm, so
The first three entries of can be set to zero by backward substitution in a triangular system, while its fourth entry is always . Solving the triangular system gives , , and . Thus the unique least-squares solution and residual norm are
Uniqueness follows from the nonzero diagonal entries of the top triangular block, equivalently the full column rank of .
Use the scaled proximal operator ; take for each unscaled resolvent.
For the quadratic case, write and . Since is an orthogonal matrix, the quadratic proximal term becomes . The subgradient optimality condition gives
All , so each diagonal entry is positive, including when . Multiplying by the inverse diagonal matrix gives
The proximal operator of Poisson data fidelity separates pointwise. At each , the scalar optimality equation on is
Since , the two roots have opposite signs. Only the positive root is admissible in the logarithm:
The negative root is outside the effective domain. The second derivative of the proximal objective is positive, establishing the unique pointwise minimizer. The integral formula is understood on the function spaces where these quantities are admissible.
Finally, for , positive and negative minimizers obey and , respectively. At zero the subdifferential condition is . Combining these cases yields soft thresholding:
Thus supplies all three requested closed forms.
Componentwise,
so
Repeated application gives . Transposing the matrix exponential term by term therefore yields
Multiplication of the two power series gives
Hence
If is an orthogonal matrix for every real , then
Its coefficient of must vanish, so
that is, is a skew-symmetric matrix.
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 two Lie groups have the same local infinitesimal structure, but different global topology. This difference determines which Lie algebra representations integrate to representations of each group.
An element of the SU(2) group is a unitary matrix of determinant one. Orthogonality of its columns and its determinant give the unique form
Thus its group manifold is the unit three-sphere in : this is SU(2) as the three-sphere. In particular it is compact, connected and simply connected. In terms of the Pauli matrices one may also write with real coefficients satisfying .
Differentiate and at . The tangent space consists of traceless skew-Hermitian matrices:
The Lie bracket of a Matrix Lie group is the matrix commutator. With , the Pauli matrix multiplication law gives
This derives the SU(2) Lie algebra as a three-dimensional real Lie algebra. The Hermitian physics generators instead obey ; they are times the skew-Hermitian tangent generators, so these are consistent conventions.
The SO(3) group consists of real orthogonal matrices with determinant one. Differentiating at the identity gives
The determinant condition gives no additional infinitesimal constraint because a skew-symmetric matrix already has trace zero. Define . The cross product identity implies
Therefore the SO(3) Lie algebra has the same structure constants and is a Lie algebra isomorphism.
The global relation is the Adjoint double cover from SU(2) to SO(3). For , define by
Conjugation preserves the real space of traceless Hermitian matrices and its inner product . Hence is orthogonal. Continuity and connectedness, together with , put it in . Composition of conjugations makes a group homomorphism. If , then commutes with every Pauli matrix, hence is scalar; unitarity and determinant one leave precisely . The differential sends to , so it is an isomorphism. More concretely,
induces rotation through angle about , by the Rodrigues rotation formula. Every three-dimensional rotation has such an axis and angle, proving surjectivity. Consequently
The matrices and are antipodal points on the three-sphere, so the SO(3) group manifold is Real projective space . Equivalently, the closed axis-angle ball has opposite boundary points identified. The fundamental group is , whereas . A rotation lifts from to ; a rotation returns to . Thus the covering is the universal cover and the groups are not globally isomorphic.
For representation theory, specify finite-dimensional complex continuous representations. Compactness permits an invariant Hermitian inner product, obtained by averaging against Haar measure, and therefore complete reducibility. Complexifying either real Lie algebra gives the sl2 Lie algebra. Its finite-dimensional irreducibles are indexed by , have highest weight , and have dimension . By integration of a Lie-algebra representation, since is simply connected, every such Lie algebra representation integrates uniquely. The resulting homogeneous polynomial representation of SU2 is
In the spin angular momentum notation , its Hermitian eigenvalues are . The central matrix acts on the symmetric power by , so descent of an SU(2) representation to SO(3) occurs exactly when is even. Hence
For a reducible representation, every summand must satisfy the descent condition. The spin-one-half doublet is a genuine representation of the covering group but does not define a single-valued representation of ; the spin-one triplet does and is its vector representation. The distinction is topological, rather than a difference in their isomorphic Lie algebras.
Again use and distribution dual pairings with complex bilinearity. The Malgrange–Ehrenpreis theorem asserts that every nonzero constant-coefficient differential operator defined by a polynomial has a fundamental solution of a linear differential operator:
If is constant, take . For positive degree , write for the highest homogeneous part. A nonzero polynomial cannot vanish on all of , so choose a real unit vector with . A change of coordinates by an orthogonal matrix makes it the last coordinate direction. In these coordinates,
Crucially the leading coefficient is constant and never vanishes as varies.
The finite-height polynomial root avoidance construction gives the needed Hörmander staircase. Set for . For each fixed , the fundamental theorem of algebra supplies roots , with multiplicity. A root's imaginary part can be within distance strictly less than one of at most one candidate height, since those heights are separated by three. The pigeonhole principle therefore leaves at least one height with for all roots. At that height, for every real ,
No continuous labelling of the roots is required. To select the heights measurably, define
Each is closed, since the coefficients are continuous in . Continuity in makes the rational test equivalent to the bound for all . The are therefore disjoint Borel sets covering . The union of horizontal fibres
is a Hörmander staircase, with bounded imaginary height and a uniform nonzero denominator. For , the transverse space has one point, and this is simply the choice of one horizontal line.
For example, has roots . One may select for , and for . Then the first region has , while in the second each root is at least two units from the chosen height. The figure shows the height projection of these horizontal fibres, rather than additional connecting contours.
Figure 1. . Blue segments select horizontal integration lines away from all root heights. The dotted vertical markers indicate jumps in the transverse parameter and are not integration segments. Grey bands indicate excluded height distances less than one. Details.
Define a linear functional on test functions by
To establish that this is a distribution, fix a compact set containing the support of , inside a radius- ball. The Fourier decay in a bounded complex strip estimate follows by applying to :
The finite bound on the heights absorbs all exponential factors and powers of into . Taking and using proves absolute convergence and the required finite-order continuity on each fixed support set. Hence .
Now the formal transpose identity and the Fourier derivative identity give
The polynomial denominator cancels in the pairing for . For each fixed real , the remaining function of is entire and rapidly decreasing in its real part throughout . The Cauchy integral theorem therefore allows each horizontal fibre to be shifted to the real axis; its truncated vertical end integrals tend to zero. Absolute convergence justifies Fubini's theorem and the finite sum over the measurable partition. Thus
The last equality is Fourier inversion. Transforming back from the orthogonal coordinates preserves and gives the required fundamental solution of a linear differential operator for the original operator. The staircase is allowed to jump: after cancellation the shift is performed on each one-dimensional fibre, so no assertion that is a smooth contour is used. This construction proves a distributional fundamental solution, without claiming a tempered-growth estimate.
For , use the smoothing convolution with a test function
Indeed is a smooth function, with . On each compact set of values, all translated test functions have supports in one fixed compact set, so differentiation is justified by the continuity of the distribution. Compact support of makes the convolution well defined even when is not tempered. It does not imply compact support of .
Finally the affine solution space of a linear equation is
If every homogeneous solution is represented by a smooth function, so is every . Conversely, if every solution for this fixed is represented by a smooth function, then for any homogeneous solution , the solution is smooth, and subtracting the smooth shows that is smooth. Hence All inhomogeneous solutions are smooth functions exactly when all homogeneous solutions are smooth functions. This is a global statement on for the stated data; no additional local regularity theorem is being assumed.
A real square matrix is an orthogonal matrix when . The planar rotation
obeys by the Pythagorean trigonometric identity.
For , the off-diagonal entry of is . Thus
If , equivalently ; if is scalar, every angle works.
Because is an orthogonal similarity, its diagonal entries are the eigenvalues
The matrix has eigenvalues along . Raising its orthogonal diagonalization to the even power gives
Let be the standard multivariate normal density. Independence gives the proposal distribution density
For an orthogonal matrix ,
The isotropic Gaussian density is unchanged by this transformation. Since has the same distribution as ,
Thus this is an orthogonal-mixture Metropolis proposal with a symmetric density; inversion invariance, rather than any assumption of a uniform distribution on orthogonal matrices, is what is needed.
With , the accepted off-diagonal transitions satisfy
The rejection part is supported on the diagonal and satisfies detailed balance automatically. Values of the acceptance rule at starting points where can be specified separately; they do not affect stationarity under . Therefore the Metropolis–Hastings algorithm kernel is reversible with invariant density , proving
Since and ,
Thus the first column of is , and is a block upper triangular matrix:
where is its bottom-right submatrix. Therefore
A similarity transformation preserves the characteristic polynomial, so
with algebraic multiplicities included.
To construct , use a Householder transformation. With , choose the sign of to avoid cancellation and set
Then is an orthogonal matrix and maps to up to the chosen sign. If already lies on the first coordinate axis, take a suitable diagonal sign matrix. This is the one-vector case of orthogonal coordinate reduction of a subspace.
Direct multiplication and the identities and give
Thus is an orthogonal matrix, while preserves the indefinite quadratic form .