For each symbol , iterate the permutation . Since the symbol set is finite, some iterate repeats. Applying an inverse power of shows that the first return is to itself, givingwith the displayed symbols distinct. This is a permutation cycle. If two such lists share a symbol, applying powers of shows that they contain exactly the same symbols. Hence these group orbits form a partition of a set . On each group orbit, acts as the corresponding permutation cycle, and these disjoint permutation cycles multiply to .
The disjoint cycle decomposition is unique up to reordering the cycles and cyclically rotating the entries within each cycle, with fixed points optionally omitted. Indeed, each cycle must consist of one of the uniquely determined group orbits, and its successive entries must follow the action of .
For this tripotent linear operator, the relation gives . Since , there is with , and that nonzero vector belongs to . Hence . Also , because would imply . The rank-nullity theorem in dimension three therefore givesNow suppose . Then is a line. On this line, is the identity operator: if , then . Consequently acts on this line by a scalar satisfying . If , then for every , contrary to . Thus .
If , every has the decompositionwhose first term belongs to and second to . Their intersection is zero by ii, so is a direct sum. Choosing bases of the two eigenspaces gives a diagonal matrix with entries and .
Since while , we have . Thus is , , or . Reordering the basis gives exactlyFor , is point inversion through the origin. For , it fixes the plane pointwise and reverses the complementary line : if in this direct sum, then . For , it fixes the line pointwise and reverses the complementary plane .
These are instances of oblique symmetry of complementary subspaces, allowing oblique eigenspaces. They are a Euclidean reflection in a hyperplane and a rotation in three dimensions through about a line, respectively, when the two eigenspaces are perpendicular. The hypotheses do not require an orthogonal transformation or an orthonormal basis, so that additional metric property cannot be inferred just from the displayed diagonal forms.
The definition of an eigenvalue and the kernel criterion for a singular square matrix giveFor the second equivalence, a linear map from a finite-dimensional vector space to itself has zero kernel exactly when its rank of a linear map is the full dimension, by the rank-nullity theorem, and therefore exactly when it is invertible. This proves both directions.
A real number is an eigenvalue of if for some nonzero vector . Its eigenspace isIt is a vector subspace because it contains and whenever and .
Choose an ordered basis of and let . Define the characteristic polynomial byIf a different basis gives for an invertible matrix , multiplicativity of the determinant givesThus the definition is independent of the chosen basis. The alternate convention differs by the constant factor and gives the same roots.
By i and ii,The domain of a function of is . Its rank-nullity theorem gives . Applying the rank-nullity theorem for now giveswhich is exactly the rank-nullity theorem for the function composition .
Since is the restriction of to ,This image of a linear map is contained in , so . Also, applying to a basis of gives a spanning set for , of size . Thus , and
By i, a free choice of is possible precisely when and . ThusThe complete solution set of a linear system isThe direction vector spans the kernel, and the displayed straight line is the entire solution set of a linear system.
Yes. A surjective has , so every is attained. Its rank of a linear map is , and the rank-nullity theorem givesThe solution set of a linear system is therefore a translate of a nonzero vector subspace, containing infinitely many solutions as in iii.
No. The rank-nullity theorem givesbut this guarantees infinitely many solutions only when the linear system is consistent. For a counterexample takeThere is no solution, since the left side always vanishes.
No. Take and . The homogeneous linear system then has only the solution . Homogeneity ensures existence, but infinitely many solutions would additionally require a nonzero kernel.
No. Here has more rows than columns, which does not force a nonzero kernel. For example, with , ,the linear system has the unique solution . With the same and it has no solution at all.
If is outside the image of a linear map , there is no solution. Otherwise choose with . By ii, a zero kernel gives a unique solution. If the kernel contains a nonzero vector , allare solutions. They are distinct, since forces . Hence there are infinitely many. These alternatives exhaust all possibilities.
By definition, the image of a linear map isConsequently means exactly that some satisfies . This is precisely the existence of a solution of the linear system.
Put and for . Since and , the two families have the same linear span. Moreover,If the are linearly independent, a vanishing expression forces for and then . Conversely,so linear independence of the forces all . Thus both the spanning set condition and linear independence are equivalent for the two families, proving the desired equivalence of bases.
There are unlisted articles, also show them or only show them.