An operator R defined on a set S of functions or vectors over a field F (with + and ×)[ with multiplication * between elements of F and elements of S] is linear if, for all f, g in S and all a in F, R(f⊕g) = R(f) ⊕ R(g), and R(s*f) = s*R(f).
A linear vector space is a set S of vectors closed under addition ⊕ and closed under multiplication ⊗ between scalars [from a field F (with +, ×)] and vectors is defined, such that vector addition is associative and commutative, there is a null vector and every vector has an additive inverse in S, and scalar multiplication is distributive: (a+b)*v = a*v⊕v*b, a(v⊕w) = a*v⊕a*w, and finally (a×b)*v = a*(b*v)