Editing Linear combination (section)

== Operad theory ==
{{Main article|Operad theory}}
More abstractly, in the language of [[operad theory]], one can consider vector spaces to be [[Algebra (ring theory)|algebras]] over the operad <math>\mathbf{R}^\infty</math> (the infinite [[Direct sum of modules|direct sum]], so only finitely many terms are non-zero; this corresponds to only taking finite sums), which parametrizes linear combinations: the vector <math>(2,3,-5,0,\dots)</math> for instance corresponds to the linear combination <math>2 \mathbf v_1 + 3 \mathbf v_2 - 5 \mathbf v_3 + 0 \mathbf v_4 + \cdots</math>. Similarly, one can consider affine combinations, conical combinations, and convex combinations to correspond to the sub-operads where the terms sum to 1, the terms are all non-negative, or both, respectively. Graphically, these are the infinite affine hyperplane, the infinite hyper-octant, and the infinite simplex. This formalizes what is meant by <math>\mathbf{R}^n</math> being or the standard simplex being model spaces, and such observations as that every bounded [[convex polytope]] is the image of a simplex. Here suboperads correspond to more restricted operations and thus more general theories.

From this point of view, we can think of linear combinations as the most general sort of operation on a vector space – saying that a vector space is an algebra over the operad of linear combinations is precisely the statement that ''all possible'' algebraic operations in a vector space are linear combinations.

The basic operations of addition and scalar multiplication, together with the existence of an [[additive identity]] and additive inverses, cannot be combined in any more complicated way than the generic linear combination: the basic operations are a [[generating set]] for the operad of all linear combinations.

Ultimately, this fact lies at the heart of the usefulness of linear combinations in the study of vector spaces.