Subspaces, Span and Linear Independence: Practice with Solutions
Learn to prove subspace closure, build counterexamples and justify span and independence. Six progressive questions with a worked start, hints and solutions.
Linear Algebra and Geometry: one-to-one online tutoring and exam preparation.
McGill MATH 133 connects systems and matrices with three-dimensional geometry, vector spaces, transformations, eigenvalues, and diagonalization. The course combines calculations with increasingly abstract definitions.
After bases and eigenvectors: build a diagonalization and calculate matrix powers. Two examples and six selected exercises; check the topics against your section outline.
Use equations, fractions and coordinates fluently. Explain what a simultaneous solution means before using a matrix algorithm.
The guidance above is study preparation, not an eligibility decision. Confirm current prerequisites, restrictions and availability with McGill University.
Check the official course catalogueFind the real unknowns satisfying both and .
Add the equations to eliminate : , hence . Substituting into gives . Check both originals: and .
A system can have three unknown coefficients without giving three independent directions. This example connects linear combinations, consistency and the choice of a basis.
Work in three-dimensional real coordinate space. Each displayed triple lists a vector’s first, second and third coordinates. Let , and . Notice that . The relation uses coefficients that are not all zero. This proves that the three vectors are linearly dependent. It does not mean that every linear combination is the zero vector.
Let be arbitrary real coefficients multiplying , respectively, and let denote a target vector. The span is the set of all combinations obtained by varying those coefficients. An arbitrary combination is Its third coordinate equals the sum of its first two. Conversely, any vector equals . Therefore the span is exactly the plane
The vector lies in the plane and equals . Choose any real number as the coefficient of . Since , subtracting from the other two coefficients leaves the target unchanged. This gives infinitely many representations: In contrast, has no representation because . Dependence can give nonunique coefficients for vectors in the span; it does not make every target attainable.
The pair is independent: the first two coordinates of force . Since this pair also spans the plane, is a basis and the plane has dimension . Coordinates in this basis are unique.
Add . Is a basis of ? Express an arbitrary using this set.
Yes. The new vector is outside the plane , and The first two coordinates force the coefficients of to be ; the third then fixes the coefficient of . Thus the representation exists and is unique for every target.
For your next vector problem, decide which question is being asked: does a representation exist, is it unique, or what is a basis? These require related but different explanations.
Your tutor can move through your system, augmented matrix and geometric sketch with you to locate the first unclear step. Contrasting an inconsistent system with a consistent system that has a free variable can help you explain the difference instead of relying only on row-reduction rules.
After each row reduction, write one sentence explaining the result. Mix calculations, geometry and definitions, and check proposed solutions by substitution.
Use your section’s outline to choose the chapters to review. We work through permitted practice and comparable problems, without completing graded assignments or exams on your behalf.
Learn to prove subspace closure, build counterexamples and justify span and independence. Six progressive questions with a worked start, hints and solutions.
Understand reversible row operations, solve and check a linear system, and distinguish one, no and infinitely many solutions. Original practice for Concordia MATH 204 and McGill MATH 133.
Practise systems, row operations, dot products and linear independence with original worked examples and self-checks for Concordia MATH 204.
Find eigenvalues and eigenspaces, then diagonalize a matrix and calculate its powers. Four worked examples and eleven questions with hints and explained solutions.
Eight questions on systems, 3×3 inverses, determinants, Cramer’s rule, parameter cases and orthogonality, with hints and explained solutions.
Send your topic and preferred times. We’ll confirm whether we can help and, if so, agree on a time by text or email before payment.
Request MATH 133 tutoringNablio is an independent service and is not affiliated with this institution.