What is an abstract vector space?
A vector space is a set whose objects can be added and multiplied by scalars while satisfying the usual vector-space rules.
Study 5 Vector Spaces with 12 free online flashcards. Review key terms, definitions, and concepts with this interactive flashcard deck.
What is an abstract vector space?
A vector space is a set whose objects can be added and multiplied by scalars while satisfying the usual vector-space rules.
What is the subspace test?
A nonempty subset is a subspace when it is closed under addition and scalar multiplication; equivalently, it is closed under all linear combinations.
What is a linear combination?
A linear combination has the form c1v1+⋯+ckvk, where the ci are scalars.
What is span(S)?
The span of S is the set of every linear combination of vectors in S. It is always a subspace.
When are vectors linearly independent?
A set is linearly independent when c1v1+⋯+ckvk=0 has only the solution c1=⋯=ck=0.
How can row reduction test column independence?
Place the vectors as matrix columns. They are independent exactly when the homogeneous system has only the zero solution, equivalently when every column contains a pivot after row reduction.
What two properties define a basis?
A basis is a linearly independent spanning set. Thus it contains no redundant vector and can represent every vector in the space.
What does a basis guarantee about representation?
Every vector has exactly one representation as a linear combination of the vectors in a given basis.
What is the dimension of a finite-dimensional space?
The dimension is the number of vectors in any basis. All bases of a finite-dimensional vector space have the same number of vectors.
What is dim(Pn)?
The dimension of Pn, the polynomials of degree at most n, is n+1, using the basis {1,x,…,xn}.
What are coordinates relative to an ordered basis?
For an ordered basis B={v1,…,vn}, [v]B is the column of coefficients in v=c1v1+⋯+cnvn.
How does the basis matrix recover coordinates?
If PB=[v1 v2 ⋯ vn], then v=PB[v]B. For a basis in Rn, [v]B=PB−1v.
A progressive guide to interpreting, calculating, and applying limits, asymptotes, continuity, and the Intermediate Value Theorem.
A progressive guide to solving linear equations, rearranging formulas, using proportions and percents, and modeling everyday applications with equations.
A medium-difficulty quiz on relations, relation properties, equivalence relations, partial orders, functions, injectivity, surjectivity, bijections, and inverse functions. The questions emphasize applying definitions to examples and interpreting mathematical structure.
A progressive guide to converting, graphing, differentiating, and integrating polar curves, with emphasis on symmetry, intersections, area, and arc length.
A 14-question quiz on mathematical induction, strong induction, well-ordering, recursive definitions, and structural induction. Questions progress from introductory recognition to medium-difficulty application and proof reasoning.
A 14-question quiz on sequences, sequence limits, monotonicity, boundedness, convergence criteria, the Squeeze Theorem, limit laws, and recursive sequences. Questions progress from foundational understanding to applied reasoning.
A structured guide to defining sequences, evaluating their limits, and proving convergence or divergence using limit laws, bounds, monotonicity, the Squeeze Theorem, and recursive methods.
A medium-difficulty quiz on advanced counting methods, including binomial coefficients, stars and bars, the binomial theorem, inclusion-exclusion, recurrences, tilings, derangements, and characteristic equations.
A progressive guide to choosing and applying binomial coefficients, the binomial theorem, inclusion-exclusion, and recurrence relations in advanced counting problems.
A progressive guide to representing functions with power and Taylor series, determining convergence, manipulating series, and controlling approximation error.
A structured guide to describing sequences, simplifying sums, modeling and solving recurrence relations, using generating functions, and analyzing recursive algorithms.
A structured guide to simplifying rational expressions, solving rational equations, analyzing rational functions, graphing their key features, and applying them to rates, work, and cost models.