Closure under addition means that when you add any two vectors from a set, the sum is still in the set. In Linear Algebra and Differential Equations, this is a basic subspace check.
Closure under addition is the rule that a set of vectors must stay inside itself when you add any two of its members. In Linear Algebra and Differential Equations, you use it when you are checking whether a set is a vector space or, more often, a subspace of a larger vector space.
The idea is simple: pick two vectors from the set, add them, and see whether the result still belongs there. If the answer is yes for every possible pair, the set is closed under addition. If even one pair produces a vector outside the set, the property fails.
This is not just a symbolic box to check. Subspaces are meant to behave like smaller vector spaces, so they need to survive the same operations as the bigger space. Addition is one of the main operations, so if a set cannot handle addition, it does not have the structure needed for linear algebra work like spanning, solving systems, or describing solution sets.
A quick example helps. The set of all vectors in R2 of the form (x, 0) is closed under addition because adding (a, 0) and (b, 0) gives (a + b, 0), which is still in the set. But the set of vectors in R2 with first coordinate equal to 1 is not closed under addition, because (1, 2) + (1, -3) = (2, -1), and that new vector leaves the set.
A common mistake is checking only one example and assuming that proves closure. One success does not guarantee the rule holds for every pair. Another mistake is forgetting that closure under addition is about the set itself, not about whether the vectors look similar or come from the same equation. In subspace problems, you usually pair this check with the zero vector and closure under scalar multiplication, then decide whether the set really is a subspace.
Closure under addition shows up any time you need to decide whether a set behaves like a legitimate subspace. That matters because subspaces are the places where linear algebra works cleanly: solution sets, spans, row spaces, column spaces, and intersections of subspaces all depend on these closure rules.
If a set is closed under addition, you can keep combining vectors without leaving the set. That makes it possible to build linear combinations and reason about whether a set can generate other vectors. If it is not closed, then the set breaks apart as soon as you try to add things together, which means it cannot act like a subspace.
In differential equations, closure ideas also show up when you think about solution sets. For linear differential equations, the sum of two solutions is often another solution, and that same pattern mirrors the closure idea from linear algebra. So this term helps connect vector-space structure with the way families of solutions behave.
In problem sets, closure under addition is often the fastest part of a subspace test. You are usually checking a set described by an equation, a span, or a condition on vector coordinates, then deciding whether addition preserves that condition. Once you can spot that pattern quickly, many subspace questions become much easier to organize.
Keep studying Linear Algebra and Differential Equations Unit 3
Visual cheatsheet
view gallerySubspace
A subspace is a subset of a vector space that keeps the vector space rules. Closure under addition is one of the main tests, because if adding two vectors from the set throws you outside the set, it cannot be a subspace. Most subspace checks in this course start here.
Closure under Scalar Multiplication
This is the companion rule to closure under addition. Even if a set stays closed when you add vectors, it still fails to be a subspace unless multiplying a vector by any scalar keeps the result in the set. Together, the two closure properties do most of the work in the Subspace Test.
Subspace Test
The Subspace Test combines the main checks you use to decide whether a set is a subspace. Closure under addition is one of the first things you verify, usually alongside scalar multiplication and the zero vector. It gives you a fast method instead of checking every axiom one by one.
Linear Combination
A linear combination uses addition and scalar multiplication together. If a set is closed under addition, that means you can start combining its vectors without immediately leaving the set, which is a big part of why subspaces are the natural setting for linear combinations.
A quiz or problem set will usually give you a set described by coordinates, an equation, or a parametric form and ask whether it is a subspace. Your move is to test closure under addition by taking two general vectors from the set and adding them, then checking whether the result still satisfies the same condition. If it fails, you can stop and say it is not a subspace.
You may also be asked to compare two sets, like one defined by x + y = 0 and another defined by x + y = 1. The first can stay closed under addition, while the second usually fails right away because the constant term changes when you add vectors. Showing that step clearly is often enough for full credit on a proof-style question.
Closure under addition means the sum of any two vectors in the set must still be in the set.
This property is one of the main checks for deciding whether a set is a subspace.
One example is not enough, because closure has to work for every pair of vectors in the set.
If a set fails closure under addition, it cannot be a subspace, even if it looks structured.
In this course, closure under addition often appears in subspace checks, spans, and solution sets for linear systems or differential equations.
It means that when you add any two vectors from a set, the result stays in the same set. In linear algebra, this is one of the basic properties you check when deciding whether a set is a subspace. If the sum ever leaves the set, closure under addition fails.
Pick two vectors from the set, add them, and see whether the sum still satisfies the set’s rule or equation. For sets described by conditions like x + y = 0, you can use two general vectors and test the result algebraically. The key is to show the rule works for any pair, not just one easy example.
Closure under addition checks whether adding two vectors keeps you inside the set. Closure under scalar multiplication checks whether multiplying a vector by any scalar keeps you inside the set. A set needs both properties, plus the zero vector, to qualify as a subspace.
Subspaces have to act like smaller vector spaces, and vector addition is one of the core operations. If addition breaks the set, then you cannot safely build linear combinations or use the set in standard linear algebra reasoning. That is why closure under addition is one of the first checks in a Subspace Test.