Expanding the cross product component by component gives its cross-product matrix:
It is a real skew-symmetric matrix and annihilates . By the vector triple product,
so for a unit vector . Choose a unit vector and put . Then is an orthonormal basis and , , . Thus the characteristic polynomial is and the cross-product matrix spectrum is
Over the complex numbers, corresponding eigenvectors are , , and . Only the zero eigenvalue has real eigenvectors.
For the specified third coordinate axis, direct multiplication gives
Its zero eigenspace is , and its eigenspace is the whole plane . Hence the eigenvalues of are , with every nonzero vector in the appropriate eigenspace an eigenvector.
First is a linear subspace. To prove it is nonzero, use orthogonality and :
Hence . If then also implies . For ,
so is invariant. If had dimension two, its one-dimensional orthogonal complement would be invariant and would act there as a scalar . The determinant would be , so , forcing . Dimension three also forces . Both contradict the hypothesis. Consequently
Choose an orthonormal basis beginning with a unit vector in and followed by a basis of . In this basis the orthogonal matrix has block form
The first column of is some . Its perpendicular unit second column with positive orientation must be . Thus the restriction is the plane rotation
Trace invariance gives , proving
A Euclidean reflection in fixes that plane pointwise and reverses , so it occurs exactly when . This is equivalent to , hence exactly to . Finally,
This exhibits the three-dimensional improper orthogonal transformation as a rotation about the axis composed with Euclidean reflection in .
Extend the selected to an orthonormal basis of eigenvectors, writing it as . For a unit vector orthogonal to it, , and therefore
A unit eigenvector attains equality. Thus is a unit eigenvector for the largest eigenvalue on , and the maximum is . If the largest eigenvalue is repeated, a second orthogonal vector in that eigenspace is allowed and ; there is no uniquely determined first pair of directions.
Let be the eigenvalues of the symmetric covariance matrix , and choose an orthonormal basis of eigenvectors . If has unit length, then and
Equality is attained by , and precisely by unit vectors in the top eigenspace. Hence choose to be any unit eigenvector for the largest eigenvalue; the maximum variance is . This proves the maximizing property of the Rayleigh quotient, rather than merely specifying a stationary point.
For the sample, put and use the sample covariance matrix
Order its eigenvalues decreasingly and choose unit orthogonal eigenvectors . The sample principal components are the score columns
Their sample means are zero and their sample covariance is diagonal, since . The th sample variance is , and its explained variance of a principal component is . Using divisor instead changes the numerical variances by a common factor but leaves the component directions unchanged.
Standardizing means replacing a variable with positive sample variance by . This gives principal component analysis on a correlation matrix, using with . It removes arbitrary differences of measurement units and prevents a large-variance coordinate from dominating solely through its scale. It also changes the question being optimized: small-variance and possibly noisy coordinates receive equal marginal weight. Principal component analysis based on the covariance matrix can be more appropriate when the variables have common meaningful units and absolute variability matters. Standardization is therefore a substantive choice, not an automatic improvement. A zero-variance variable must first be removed. In the word-rating example the variables share the same numerical range, but their across-word dispersions can differ; standardization gives each attribute equal initial variance.
For the standardized eight-variable analysis, total variance is . The first three fractions of explained variance of a principal component are approximately 59.6%, 19.1% and 10.1%, respectively. The first two account for about 78.8%, and the first three for 88.9%. The first direction is dominant but one direction alone loses substantial variation. Retaining two principal components is a plausible descriptive summary: their eigenvalues exceed , whereas the third is below . That cutoff is a heuristic, and the third principal component may still have interpretable content.
The reported coefficient rows are not unit-length vectors. The printed rounded rows have squared lengths , and , consistent with their eigenvalues to the precision of the coefficient table. They are consistent with the scaled principal component loading convention . Such rows remain eigenvectors, but the score direction with unit length is , or more accurately the row divided by its actual Euclidean norm when using rounded entries. Under this convention is the correlation of standardized attribute with the variance-one score for component :
This explains both their sizes and why they must not be treated as the unit vectors from parts (i) and (ii).
The first principal component has positive coefficients on every attribute, strongest on friendliness, goodness, niceness, bravery and strength. With the favorable endpoints coded in the positive direction, it describes a broad favorable or impressive evaluation, with a potency contribution. The second contrasts movement and speed, with some size and strength, against the first three evaluative attributes; it is chiefly an activity dimension. The third is dominated by size, with smaller positive strength and negative movement/speed coefficients, distinguishing size or potency from activity. These are interpretations of directions of variation, not evidence of causal latent traits. Reversing a principal component's overall sign changes neither its meaning as an axis nor its explained variance; endpoint coding fixes only how its positive side is described.
A positively oriented planar rotation matrix acts by
For a unit vector in three dimensions, the parallel and perpendicular orthogonal projections are
On the plane perpendicular to , the map preserves lengths and turns vectors through a positive right angle about . It squares to minus the identity there. Thus rotates that component, while the parallel component remains fixed. This proves the Rodrigues rotation formula
Its component form uses the Levi-Civita symbol:
Since and , its matrix trace is .
For the given matrix, the matrix trace is with , so . In the stated angular range, . The antisymmetric entries give
Therefore the two axis-angle pairs are
Reversing the axis and the angle leaves the Rodrigues rotation formula unchanged, so these describe the same rotation.
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.
Use the equal-time points to estimate velocity and acceleration with centered finite differences:
At the endpoints use one-sided formulas of the desired order. A differentiated path and its time parametrization can instead supply these quantities. Let denote the gravitational acceleration, directed downwards. In the accelerating camera, the effective downward vector is , so the locally felt upward vector is . For a stationary camera this gives , fixing the sign.
The apparent-gravity camera frame is obtained by orthogonal projection and a cross product:
When , are perpendicular unit vectors, and completes a right-handed orthonormal basis: . Also , so the felt-up vector lies in the plane, with its transverse component pointing towards positive .
The stated exclusion of ensures , but it does not ensure . If felt-up is parallel to travel, the roll angle is undetermined rather than the construction being impossible. Every transverse orthonormal basis then has the required plane property. For continuity, project the previous into and normalize it, using . If this projection is also too small, choose a coordinate unit vector least aligned with and project that vector instead. Switch to this transported choice near the parallel case to avoid numerical amplification. A stopped vehicle likewise needs a chosen limiting travel tangent vector, since its zero velocity itself has no direction. None of this requires a Frenet frame, which can fail where curvature vanishes.
The three spherical basis vectors form an orthonormal basis: their displayed Cartesian components have unit lengths and pairwise zero dot products. For an orthonormal basis, a vector is the sum of its projections onto the basis vectors. Taking the dot product of each Cartesian unit vector with each spherical unit vector therefore gives the inverse change of basis:
Equivalently, the change-of-basis matrix is orthogonal, so its matrix inverse is its transpose. These formulas use the stated angular convention for spherical polar coordinates; at a pole the tangential basis vectors still depend on the chosen azimuth.
For , the dot product equation says that the angle between and the oriented unit vector satisfies . Thus is fixed. More explicitly, using the orthogonal projection from the introductory solution,
Consequently the surface is one infinite nappe of a right circular cone, with apex at the origin, including the apex itself. The cone's axis points along , and its acute semi-angle is . Equivalently, is the cosine of the angle from the oriented axis. Squaring the original equation without retaining the sign of would incorrectly add the opposite nappe of a double circular cone. No base disk is included in this infinite lateral surface.
Decompose the position vector into its components parallel and perpendicular to the unit vector :
This is an orthogonal projection, and the Pythagorean theorem gives . The two surfaces are distinguished by fixing an angle in part (a), and fixing distance from an axis in part (b).
In suffix notation, , so the matrix entries are
Here is the Kronecker delta and the Levi-Civita symbol. The diagonal determines . Comparing the off-diagonal entries with
gives . As is a unit vector and , and . Thus
In this example the transverse scaling is and the axial scaling is two; the rotation angle is .
Divide the velocity by the speed calculated above. The unit tangent vector is
Its derivative is
Because , the principal normal vector has the direction of , giving
This is a unit vector, and for every real . The curvature of a space curve is , so the principal normal vector is defined everywhere on this curve. The same perpendicularity follows from constant tangent component forces perpendicular principal normals: is constant, and differentiating this identity forces the normal component along to vanish.
Let . Since and ,
so . Choose a unit vector with . Its orthogonal complement is an invariant subspace: for , . In an orthonormal basis , therefore has a scalar block and a two-dimensional orthogonal matrix block of determinant one. Such a block has columns and . Consequently is a rotation in three dimensions about the axis through angle , including the identity when .
To construct the Householder reflections, let reflect in the plane spanned by and let reflect in the plane spanned by . They fix , while on their matrices are
Their product is the planar rotation matrix through . Taking proves . This gives the composition of two plane reflections explicitly; each is a Householder reflection for the corresponding unit plane normal .
All graphs here are finite and simple. For the strong graph product , two distinct graph vertex pairs are adjacent if in each coordinate the entries are equal or adjacent. Use for its strong graph power; the exam's means this product power, not the distance-based graph power. The Shannon capacity of a graph is
where is the independence number. Products of independent sets are independent, so for . To see why the limit exists, fix and write , . Then , using and , so . Take the supremum over ; the reverse upper bound holds termwise. This proves the required form of Fekete lemma. For the empty graph on no graph vertices one sets graph capacity zero separately.
Associativity of the strong product gives
An orthonormal representation of a graph assigns a real unit vector to each graph vertex, with whenever distinct graph vertices are nonadjacent. Adjacent graph vertices need not receive orthogonal vectors. A handle is a unit vector . The handle formulation of the Lovász theta function is
with a zero denominator giving infinity. Representations may use any finite-dimensional Euclidean space. This is the usual Lovász number in its orthonormal-representation formulation.
For an independent set , the vectors , , are mutually orthonormal. Directly,
If is finite, every summand is at least , giving . For a strong power, use the vectors and handle
Their norms are one. Nonadjacency of two distinct words means a coordinate has distinct nonadjacent entries, so the corresponding tensor inner product has a zero factor. The handle inner products satisfy
Applying the preceding calculation gives . Taking roots, then the infimum over representations and handles, proves
This is the tensor-product capacity bound from an orthonormal representation, and the displayed projection calculation supplies Bessel inequality explicitly.
For , label graph vertices by , with edges at differences . The five words
are independent in its strong square: a difference in the first coordinate produces a nonedge difference in the second, while a first-coordinate difference is already a nonedge. Hence .
Figure 1.
Five independent words in the strong square of the pentagon
. Details.
For the matching upper bound set , , and
Each vector is unit. For a nonedge, the angle difference is , and
because and . Thus these vectors form an orthonormal representation. The handle has , giving . Together the two bounds prove the pentagon capacity code result
Use suffix notation, summing repeated indices from one to three. The contraction identity for the Levi-Civita symbol gives
Here because is a unit vector. For the second cross product identity, use :
The first term vanishes because is symmetric while the Levi-Civita symbol is antisymmetric in those indices. The last equality uses cyclicity and antisymmetry of the scalar triple product.
On the unit sphere, a great circle has radius one, so the spherical distance is its shorter arc length, equal to its central angle in . The dot product of its endpoint unit vectors is the cosine of that angle. Hence
For the angular formulas, take the ordinary nondegenerate convex minor spherical triangle: no pair of vertices is antipodal and the three vertices do not lie on one great circle. These are needed for the displayed denominators and interior angles to be defined. Merely requiring three distinct points, as the PDF does, does not exclude degeneracy.
Put , and . The outgoing unit tangent vectors at are
Their dot product is . Equivalently, they are obtained from the normalized plane normals and by the same right-angle rotation in the tangent plane: , and similarly for . Rotation preserves the dot product, giving
Since and , the first proved identity becomes the spherical law of cosines:
For the spherical law of sines, take norms in the second proved identity. Writing , and using , gives
Cyclic permutation gives the corresponding formulas at and . Dividing each by the positive product proves
Finally, if all sides equal , the spherical law of cosines gives
because makes and . Cosine is strictly decreasing on , so every angle of a nondegenerate equilateral spherical triangle is greater than .