[video] Lecture video — Topic 1: Linear Systems — /api/lesson-media/videos/4d3653ff-a3ca-4f63-bf8e-bb93c553e599-1794885368146-943080d5e0806cd6.mp4
Flashcards · Linear systems
Linear equation — a₁x₁ + … + aₙxₙ = b with fixed real coefficients and b; no products of unknowns, powers or functions of them.
2x₁ − 3x₂ = 5 is linear; x₁x₂ = 5 is not.
Augmented matrix [A | b] — The coefficient matrix with the right-hand side appended as an extra column; column order must match the order of the unknowns.
Elementary row operations — Rᵢ ↔ Rⱼ (swap), Rᵢ ← cRᵢ with c ≠ 0 (scale), Rᵢ ← Rᵢ + cRⱼ (replace). They never change the solution set; multiplying by 0 is not allowed.
Pivot — The leading nonzero entry of a nonzero row. Forward elimination creates zeros below each pivot.
Row echelon form — Zero rows at the bottom and pivots moving strictly to the right as you go down. Reduced form: every pivot is 1 and is the only nonzero entry in its column.
Inconsistent system — A row [0 … 0 | c] with c ≠ 0 means 0 = c; the system has no solution.
Basic and free variables — Variables in pivot columns are basic; the others are free and can take any value. A unique solution needs a pivot in every variable column.
Homogeneous system — Ax = 0. Always has x = 0; has nonzero solutions exactly when some variable is free (always, if there are fewer equations than unknowns).
Ghi chú: If xₚ solves Ax = b, all solutions are xₚ + z with Az = 0.
[markdown] content available only on the platform