Math 54 Midterm 1 Practice Review

0.0(0)
Studied by 0 people
call kaiCall Kai
learnLearn
examPractice Test
spaced repetitionSpaced Repetition
heart puzzleMatch
flashcardsFlashcards
GameKnowt Play
Card Sorting

1/19

flashcard set

Earn XP

Description and Tags

Comprehensive vocabulary flashcards covering the core linear algebra concepts, theorems, matrix invertibility criteria, system consistency, and linear transformation properties from the Math 54 practice exam.

20 Terms

1
New cards

Underdetermined Homogeneous System

A homogeneous linear system Ax⃗=0⃗A\vec{x} = \vec{0} with more variables than equations (n>mn > m). It always contains at least one free variable and therefore always has infinitely many solutions.

2
New cards

Overdetermined Non-homogeneous System

A non-homogeneous linear system with more equations than variables (m>nm > n). Such a system can be inconsistent (no solution), have a unique solution, or have infinitely many solutions.

3
New cards

Augmented Matrix Consistency Criterion

A linear system is consistent if and only if the rightmost column of the augmented matrix is not a pivot column. Having a pivot position in every row does not guarantee consistency, as the pivot in the bottom row could lie in the augmented column ([0  …  0∣bm][0 \;\dots\; 0 \mid b_m] with bm≠0b_m \neq 0).

4
New cards

Spanning Set Consistency Theorem

If vectors b⃗1,…,b⃗k\vec{b}_1, \dots, \vec{b}_k span Rm\mathbb{R}^m and each system Ax⃗=b⃗jA\vec{x} = \vec{b}_j is consistent, then Ax⃗=b⃗A\vec{x} = \vec{b} is consistent for every b⃗∈Rm\vec{b} \in \mathbb{R}^m.

5
New cards

Row Equivalence and System Consistency

If two m×nm \times n matrices AA and BB are row equivalent (A∼BA \sim B), the systems Ax⃗=b⃗A\vec{x} = \vec{b} and Bx⃗=b⃗B\vec{x} = \vec{b} do not necessarily share the same consistency for a fixed b⃗\vec{b}, unless AA and BB are invertible.

6
New cards

Pairwise Non-proportional Vectors

A set of vectors where no two are scalar multiples of each other. In R3\mathbb{R}^3, this property is insufficient to guarantee that three vectors are linearly independent, as all three could still lie in the same plane.

7
New cards

Linear Transformation Definition Check

A mapping TT must satisfy both additivity (T(u⃗+v⃗)=T(u⃗)+T(v⃗)T(\vec{u} + \vec{v}) = T(\vec{u}) + T(\vec{v})) and homogeneity (T(cu⃗)=cT(u⃗)T(c\vec{u}) = cT(\vec{u})) for all scalars cc. Satisfying only T(0⃗)=0⃗T(\vec{0}) = \vec{0} and T(2x⃗)=2T(x⃗)T(2\vec{x}) = 2T(\vec{x}) is not sufficient to guarantee that TT is linear.

8
New cards

Left Inverse vs. Right Inverse in Dimension Mismatch

If linear transformations satisfy S:R2→R3S: \mathbb{R}^2 \to \mathbb{R}^3 and T:R3→R2T: \mathbb{R}^3 \to \mathbb{R}^2 with T∘S=IR2T \circ S = I_{\mathbb{R}^2}, the reverse composition S∘TS \circ T cannot be the identity on R3\mathbb{R}^3 because the rank of S∘TS \circ T is at most 22, which is strictly less than the dimension of R3\mathbb{R}^3.

9
New cards

Matrix Polynomial Invertibility

If an n×nn \times n matrix AA satisfies A2−3A+2I=0A^2 - 3A + 2I = 0, then AA is invertible with explicit inverse A−1=12(3I−A)A^{-1} = \frac{1}{2}(3I - A), obtained from A(3I−A)=2IA(3I - A) = 2I.

10
New cards

Commutativity of Matrix Inverses

If AA is an invertible matrix and AB=BAAB = BA, then A−1A^{-1} commutes with BB, satisfying A−1B=BA−1A^{-1}B = BA^{-1}.

11
New cards

Odd-Dimensional Skew-Symmetric Matrix Invertibility

An n×nn \times n matrix satisfying AT=−AA^T = -A where nn is odd (such as 3×33 \times 3) satisfies det⁡(A)=det⁡(AT)=det⁡(−A)=(−1)ndet⁡(A)=−det⁡(A)\det(A) = \det(A^T) = \det(-A) = (-1)^n \det(A) = -\det(A), which implies det⁡(A)=0\det(A) = 0. Hence, it is always singular and not invertible.

12
New cards

Subspace Criteria in Rn\mathbb{R}^n

A subset H⊆RnH \subseteq \mathbb{R}^n is a subspace if and only if it contains the zero vector 0⃗\vec{0}, is closed under vector addition, and is closed under scalar multiplication. Being closed under scalar multiplication alone is not sufficient.

13
New cards

Basic Variable

A variable in a system of linear equations that corresponds to a pivot column in the coefficient matrix or its row-reduced echelon form.

14
New cards

Free Variable

A variable in a system of linear equations corresponding to a column in the coefficient matrix that does not contain a pivot position, allowing it to act as an arbitrary parameter in the solution set.

15
New cards

Parametric Vector Form

An algebraic representation of the solution set of a linear system Ax⃗=b⃗A\vec{x} = \vec{b} written as x⃗=p⃗+su⃗+tv⃗+…\vec{x} = \vec{p} + s\vec{u} + t\vec{v} + \dots, where p⃗\vec{p} is a particular solution and the remaining terms form the general solution of the associated homogeneous system Ax⃗=0⃗A\vec{x} = \vec{0}.

16
New cards

Linear Combination

A vector w⃗\vec{w} expressed in the form w⃗=c1v⃗1+c2v⃗2+⋯+cpv⃗p\vec{w} = c_1\vec{v}_1 + c_2\vec{v}_2 + \dots + c_p\vec{v}_p, where c1,…,cpc_1, \dots, c_p are scalars and v⃗1,…,v⃗p\vec{v}_1, \dots, \vec{v}_p are vectors in the same space.

17
New cards

Span Criterion for Columns

The columns of an m×nm \times n matrix AA span Rm\mathbb{R}^m if and only if AA has a pivot position in every row. If n<mn < m, the columns can never span Rm\mathbb{R}^m.

18
New cards

Onto (Surjective) Linear Transformation

A mapping T:Rn→RmT: \mathbb{R}^n \to \mathbb{R}^m such that for every b⃗∈Rm\vec{b} \in \mathbb{R}^m, there is at least one x⃗∈Rn\vec{x} \in \mathbb{R}^n satisfying T(x⃗)=b⃗T(\vec{x}) = \vec{b}. In terms of its standard matrix, TT is onto if and only if the matrix has a pivot in every row.

19
New cards

One-to-One (Injective) Linear Transformation

A mapping T:Rn→RmT: \mathbb{R}^n \to \mathbb{R}^m where T(u⃗)=T(v⃗)T(\vec{u}) = T(\vec{v}) implies u⃗=v⃗\vec{u} = \vec{v}. Equivalently, the homogeneous equation T(x⃗)=0⃗T(\vec{x}) = \vec{0} has only the trivial solution x⃗=0⃗\vec{x} = \vec{0}, which occurs if and only if the standard matrix has a pivot in every column.

20
New cards

Multiplicative Property of Determinants

For any two n×nn \times n matrices AA and BB, det⁡(AB)=det⁡(A)det⁡(B)\det(AB) = \det(A)\det(B). For upper or lower triangular matrices, the determinant simplifies to the product of the main diagonal entries.