Solution

ID: past-exam-of-the-year-1-of-the-computer-science-course-of-the-university-of-oxford/2022/digital-systems-linear-algebra-introduction-to-formal-proof/5/b/ii/solution

For the analogous positive off-diagonal entries in size , take
The same entrywise computation gives and , with every other entry zero. Thus the result is a symmetric matrix with a tridiagonal pattern. Positivity of the diagonal entries is not needed for this positive diagonal symmetrization of a tridiagonal matrix; positivity of ensures the displayed positive, invertible . In particular, the assertion is not an arbitrary-real-coefficient symmetrization claim when the off-diagonal signs differ.

New to topics? Read the docs here!