Linear Algebra
Balances Gaussian elimination with vector spaces and proofs. Worked solutions to all exercises are useful for independent study; suitable before an operator-focused second course.
Row reduction answers computational questions, while vector spaces and linear maps explain why the answers fit together. Hefferon keeps elimination and proof in view; Axler places more weight on operators, invariant subspaces and spectral structure. If you can find a null space but cannot explain rank-nullity, the operator route can expose the gap. If changes of basis still feel mysterious, keep concrete matrices beside that route.
Linear Algebra Done Right, fourth edition — Sheldon Axler. Read 3B, Null Spaces and Ranges, and the Change of Basis subsection of 3D. Then use 5B and 5D for the minimal polynomial and diagonalizability; finish with 7A-7B for adjoints and the spectral theorem after reviewing inner products in chapter 6 if needed.
Express one map in two bases and derive the coordinate conversion instead of memorizing the formula. Work with differentiation on a finite-dimensional polynomial space, then compare a Jordan block with a real symmetric matrix. State the field and inner product before invoking a spectral theorem. After a calculation, write one sentence explaining which feature belongs to the map itself and which feature depends on your coordinates.
Explain kernels, minimal polynomials and spectral decompositions conceptually.
Read 3B, Null Spaces and Ranges, and the Change of Basis subsection of 3D. Then use 5B and 5D for the minimal polynomial and diagonalizability; finish with 7A-7B for adjoints and the spectral theorem after reviewing inner products in chapter 6 if needed.
Source · Checked 2026-10-16
Connect row operations to subspaces before an operator-focused second course.
Use the systems, vector-space and linear-map portions of the author edition; confirm its current contents before assigning pages.
Source · Checked 2026-10-17
Linear-map and spectral exercises. Exercises 3B, 3D, 5B, 5D and 7B; each set follows its named section.. Exercises provided; public solutions not verified.
Try a proof or calculation before opening the hint. These solutions address the checks below, not the exercises in the linked textbooks.
For D on the real polynomials of degree at most 3, where Dp = p', compute kernel, image and a matrix, and verify rank-nullity.
Apply to the basis . The coordinate vectors of the results form the columns of the matrix.
Take both domain and codomain to be and use the ordered basis . Since , , and ,
A polynomial has zero derivative exactly when it is constant, so . Every polynomial of degree at most two has an antiderivative of degree at most three, so . Thus and , with .
Compare the matrices [[1,1],[0,1]] and [[2,1],[1,2]]: find eigenspaces, determine diagonalizability, and give an orthonormal eigenbasis when one exists.
A repeated root of the characteristic polynomial does not by itself decide diagonalizability. Count independent eigenvectors. For the symmetric matrix, test and .
For , the only eigenvalue is . The equation forces , so its eigenspace is . Its dimension is only one; is not diagonalizable.
For , the eigenspaces are and . The vectors
form an orthonormal eigenbasis. With having columns , one has . Symmetry explains why an orthonormal choice is available here; diagonalizability alone would not guarantee it.
Already comfortable with this? Skip the map review if you can explain rank-nullity without row-reduction alone and derive change of basis. Skip the spectral selection only if you can distinguish diagonalizable, normal and self-adjoint operators over the appropriate field.
Review the prerequisites · Compare the full subject collection
Balances Gaussian elimination with vector spaces and proofs. Worked solutions to all exercises are useful for independent study; suitable before an operator-focused second course.
A proof-based, operator-centered second course that introduces determinants late. Especially useful for structural understanding; not designed primarily as a computational matrix handbook.
Develops matrices and vector spaces through geometric ideas and applications. The author route provides online and PDF editions.
Combines matrix methods, abstract vector spaces and proof practice. Sage examples are supplementary rather than required.
An applications-oriented treatment of vectors, matrices and least squares. It does not replace a full course on determinants, eigenvalues and abstract linear algebra.
Connects linear systems and vector-space reasoning with optimization, orthogonal bases and singular values.
English title: Linear Algebra. A first course that presents matrix methods and vector spaces with attention to proofs and the order of multiplication.
Develops vector spaces, matrices, determinants, eigenvalues and inner products, followed by tensor constructions, differential equations and matrix groups. The author identifies Chapters 1–5 as the required core; later chapters are optional.先讲向量空间、矩阵、行列式、特征值和内积,再讨论张量构造、微分方程与矩阵群。作者将前五章列为必修主线,后续章节可选读。
A book devoted to determinants, including their definitions, identities and methods of calculation. Use selected chapters alongside a linear-algebra course rather than replacing the whole course with determinant techniques.专门讨论行列式的定义、恒等式和计算方法。适合在线性代数课程中按需选读,不必将整门课程变成行列式技巧训练。
A proof-oriented text emphasizing linear maps, bases, inner products and spectral theory. Includes bilinear forms, duality and tensors.
A structural linear-algebra course emphasizing vector spaces and linear maps. A concise bridge beyond row reduction into invariant reasoning.
Moves from matrix computations to vector spaces, linear maps, determinants, eigenvalues and duality.
Derives graph-Laplacian clustering algorithms and compares their normalized and unnormalized forms.推导基于图拉普拉斯的聚类算法,并比较归一化与非归一化形式。
Found via — References: A Tutorial on Spectral Clustering
Develops structural linear algebra beyond matrix manipulation, including module-theoretic viewpoints and additional advanced topics.
An extensive second course covering canonical forms, matrix norms, positivity and spectral questions. Its many problems are useful for mastering matrix arguments.
Studies matrix inequalities and spectral structure from an analytic viewpoint. Distinct from the Horn–Johnson book with the same title.
Develops stable matrix computation, decompositions and iterative methods. Its numerical emphasis complements structural algebra; it does not replace proof-based linear algebra.
A separate companion to Matrix Analysis on numerical ranges, singular values, matrix equations and related topics. Chapters and reprints count as one work.
An applied seminar on graph-based clustering and its spectral interpretation, connecting matrix eigenvectors, graph Laplacians and statistical learning.关于图上聚类及其谱解释的应用专题,将矩阵特征向量、图拉普拉斯和统计学习联系起来。
A substantial survey connecting random embeddings and matrix sampling to least squares, low-rank approximation and linear solvers.
线性代数 — 李思 (Si Li). Use Chapters 1–5 for a first course; choose later applications after that foundation.第一遍以第1—5章为主,建立基础后再选读应用部分。