Reading the abstract syntax tree recursively gives the eight distinct subformulas
A subformula includes the complete propositional formula itself as well as the operands of its connectives. There are nine occurrences in the abstract syntax tree, because the atomic formula occurs twice, but only eight different propositional formulas in the set.
An integer-entry example is
Direct matrix multiplication gives , so adding and gives the zero matrix. Equivalently, this is the companion matrix of and has the two nonreal cube roots of unity as eigenvalues. The direct multiplication is already a complete proof. It also shows why part (e) does not extend to all real square matrices: with this , choosing satisfies the original product identity.
For scalar , part (c) gives
The numerator is strictly positive for every real , and the denominator is nonzero. Therefore and hence is invertible. This proof uses the order structure of the real scalars; it does not say that the matrix must be nonsingular in higher dimension.
Let for a real eigenvalue and a nonzero real eigenvector . Part (b) gives and . The expression for in part (c) therefore gives
Consequently is a real eigenvalue of , with the same eigenvector . For a real matrix and real eigenvalue, a nonzero real vector can be chosen in the real kernel of ; no complex-vector assumption is needed.
Multiply the original equation on the left by to obtain
Each term on the right commutes with . Thus
No general commutativity of matrix multiplication is being assumed; it follows from this particular expression for .
Rearrange the identity into
Taking determinants gives . Hence , so is an invertible matrix, with . This uses that the matrices are finite and square: a right inverse then implies a two-sided inverse. Applying the identity to a vector in the kernel without first establishing commutation would not justify cancelling an on the wrong side. The argument is a case of invertibility forced by a polynomial product identity.
The initial vector decomposes especially simply in the eigenbasis:
because . Applying multiplies the two eigenvectors by and . Part (b) then yields
Reading the second coordinate gives the Lucas closed form
At this is 2 and at it is 1. Each summand obeys the same recurrence relation, which independently verifies the formula and explains why the irrational parts cancel to give an integer.
The requested order is . To obtain this order directly, put the transposes of the two eigenvectors in the rows of , using the fact that is symmetric:
Then , so is an invertible matrix, with
Multiplication gives , since and . Multiplying by proves the required diagonalization. Putting the eigenvectors in columns would instead give the equally standard order , so the convention must be checked rather than copied mechanically.
For an eigenvalue , the equation gives and . The second identity holds because . Taking gives the eigenvectors
Each associated eigenspace consists of all scalar multiples of its displayed vector. A zero vector is excluded when speaking of an eigenvector.
The characteristic polynomial is
Its two distinct real roots are the eigenvalues
Their product is , so . Equivalently, implies . The positive eigenvalue is the golden ratio.
Use mathematical induction on . For , the identity matrix gives . If , applying and using part (a) gives . Therefore
The base case is essential: the starting vector represents consecutive Lucas numbers, not two arbitrary initial values.

There are unlisted articles, also show them or only show them.