Eliminating logical implications givesAn absorption step simplifies this to the disjunctive normal formEach one-literal term is a permitted logical conjunction in a disjunctive normal form.
The kernel of a linear map is precisely , sincePart (c) gives . Apply the rank-nullity theorem to the finite-dimensional vector space , and then parts (a) and (b):This proves the dimension formula for a sum of subspaces. The kernel of a linear map records exactly the freedom to transfer a shared vector from one summand to the other without changing their sum.
Every output lies in the sum of subspaces , since it is a linear combination of members of the two vector subspaces. For , and scalars ,Therefore is a linear map. Every vector in is such an output: group the terms of any linear combination from according to their originating vector subspace. Thus the addition map of subspaces is also surjective.
Writing the given bases as and , a basis of the Cartesian product with its componentwise vector space operations isThis is the direct sum basis. Therefore . The construction includes zero-dimensional factors, whose corresponding portion of the basis is empty.
Use banded Gaussian elimination followed by back substitution. To distinguish the right-hand side from the upper-diagonal coefficients , write it as . If the modified pivot elements are nonzero, the tridiagonal elimination recurrences areThey eliminate just the one entry below each pivot element. Solve the resulting upper bidiagonal matrix system byThere is a bounded number of arithmetic operations per row in each sweep, giving arithmetic operations and storage. The unpivoted recurrences cost arithmetic operations under the usual scalar-operation count.
For a general tridiagonal matrix, nonsingularity alone does not guarantee these pivot elements. If a zero or unsafe pivot element occurs, use partial pivoting between the current row and the next row. These are the only possible nonzero candidates in the current column; adjacent row swaps introduce at most a second upper diagonal. Tracking that fill-in keeps both Gaussian elimination and back substitution at arithmetic operations. For example, is invertible but requires a row swap. If the input is singular, report a zero final pivot element; a unique solution cannot be promised, and compatibility or free-variable analysis is a separate issue. No nonsingularity or safe-pivot assumption is silently inferred from the word tridiagonal.
The zero matrix has the required pattern, and matrix addition and scalar multiplication preserve every prescribed zero entry. This proves the vector subspace condition. A basis consists of the matrix unitsThey independently select every permitted entry of a tridiagonal matrix, so the dimension is for .
For , takeThey are commuting operators because every matrix commutes with the identity matrix. However has only the eigenvalue zero, and has dimension one. It has no eigenbasis, so it cannot appear in any simultaneous diagonalization. Equivalently, a diagonal matrix similar to this nonzero nilpotent matrix would have to be zero, an impossibility. For any prescribed , use and ; its zero eigenspace has dimension . For no such example exists.
The independent eigenvectors of from part (e) are also eigenvectors of . Put and . ThenThis supplies the required simultaneous diagonalization over the same field as in part (e).
Work over the field containing the stated distinct eigenvalues of ; in a real formulation these must be real to obtain real eigenvectors. Choose one eigenvector for each distinct eigenvalue. By independence of eigenvectors for distinct eigenvalues, these vectors are a basis. Consequently each eigenspace has dimension one: in an expansion in this eigenbasis, forces every coefficient with a different eigenvalue to vanish.
Now let be any eigenvector of . By part (d), belongs to its one-dimensional eigenspace, so for some scalar . This proves that is an eigenvector of , including the case , where . This is the crucial one-dimensional step in simple spectrum gives simultaneous diagonalization.
Using and linearity,This establishes that commuting maps preserve eigenspaces. The vector can be zero, so this step alone does not assert that is an eigenvector.
With the two diagonal matrices from the preceding part, write and . Their diagonal products agree entry by entry, so . ThereforeHence simultaneous diagonalization implies that are commuting operators.
Let and . ThenBy matrix similarity, every eigenvalue of is for some . These are corresponding eigenvalues on the common eigenbasis, rather than every possible pairwise sum. This is eigenvalue addition in a common eigenbasis.
Write and , where are the standard basis vectors. Since ,Thus the columns of form an eigenbasis, and the requested ordered basis is . Its basis matrix is , giving . More completely, for each distinct eigenvalue , its eigenspace isAll nonzero vectors in these eigenspaces are eigenvectors; when an eigenvalue repeats, they need not be individual columns of .
There are unlisted articles, also show them or only show them.