1

The definition of vector I usually see is "an element of a vector space". To me, this make little sense from a completely formal standpoint, and I'll explain why.

To speak of an "element of an algebraic structure" is, from my understanding, to speak of an element of its underlying set. So, for example, if we consider the group $\mathbf Z=(\mathbb Z,+)$ (where $\mathbb Z$ is the set of integers), we may use the notation $x\in\mathbf Z$ equivalently to $x\in\mathbb Z$.

So, if I consider the vector space $(\mathbb R^2,\mathbb R,+,\cdot)$, with

$$\begin{align}+\colon\mathbb R^2\times\mathbb R^2\to\mathbb R^2\qquad&\text{s.t.}\quad(x_1,y_1)+(x_2,y_2)=(x_1+x_2,y_1+y_2)\\ \cdot\colon\mathbb R\times\mathbb R^2\to\mathbb R^2\qquad&\text{s.t.}\quad \lambda\cdot(x,y)=(\lambda\cdot x,\lambda \cdot y),\end{align}\tag1$$

I can speak of any element of $\mathbb R^2$ as a "vector". So, $(0,0)$ would be a vector. But, for example, the structure $(\mathbb R^2,+)$ is not a vector space, it's a group. So, we say that in this case $(0,0)$ is not a vector, it's an element of an abelian group.

My problem is the following: $(0,0)$ is always the same object, its value does not depend on the structure defined upon the set which $(0,0)$ is a member of. As I said before, $(0,0)$ being an element of a vector space is the same as saying it's an element of its underlying set, which is $\mathbb R^2$. So, $(0,0)$ being in a group or a vector space or whatever other structure doesn't change it as a mathematical object.

To me, this is a problem. How can we define vector as an element of a vector space, when we can define operations on that same set which don't make a vector space? Defining $+$ as in $(1)$ is not the only way possible, and $x$ being an element of a vector space doesn't add any additional structure to the element itself, taken individually.

A more sensible definition would be to define a vector in a similar way to algebraic structure: a vector is an ordered pair $(\mathbf v,V)$, where $V$ is a vector space such that $\mathbf v\in V$.

Elvis
  • 1,543
  • 4
    Comments have been moved to chat; please do not continue the discussion here. Before posting a comment below this one, please review the purposes of comments. Comments that do not request clarification or suggest improvements usually belong as an answer, on [meta], or in [chat]. Comments continuing discussion may be removed. – Xander Henderson Oct 06 '24 at 02:48
  • 3
    I don't see the problem. We define a vector space to be a set along with a field, some operations and axioms. Then we define the elements of the set to be vectors. The fact that elements of the set work with the operations, the field and the axioms make them vectors. – John Douma Oct 06 '24 at 04:34
  • 1
    It's worth noting that OP's question has been answered in the chat (or in comments that were moved to the chat). – Stefan Oct 06 '24 at 10:11
  • 2
    @Stefan Still, it would be better to have a proper answer here, so that it can be accepted, searched, voted on, and archived in the data dump. – Federico Poloni Oct 06 '24 at 10:59
  • 4
    This kind of looseness of notation is universal in mathematics. It drives me slightly nuts, although if you chase full formalism far enough you discover that it's kind of impractical, and you have to draw a line somewhere. (Consider: is 1 (the natural number) the same object as 1 (the real number)?) – Glenn Willen Oct 06 '24 at 17:58
  • 2
    Do read the (alas, chatified) comments - they are far better than the accepted answer. $\ \ $ – Bill Dubuque Oct 06 '24 at 18:35
  • 4
    I have always thought of “a vector is an element of a vector space” as a half-joking comment. The term “vector” is overloaded. In some contexts it means an ordered $n$-tuple of real numbers. In other contexts it might mean something else. If we are working with a vector space $V$, we often call the elements of $V$ vectors in that context. – littleO Oct 06 '24 at 19:24
  • 1
    If you applied that objection to the concept of “ordered pair” itself, it would follow that each ordered pair should contain a reference to the sets that contain the ordered pair’s terms, and the projection functions as well. – user3840170 Oct 07 '24 at 12:16
  • It is informal notational abuse, just like saying $,ax^2+bx+c,$ is a polynomial. Usually there is abundant context that quickly helps (humans) infer the precise denotation. There are some contexts where such precision is needed, e.g. model theory and universal algebra, e.g. see Wilfred Hodges on Naming of parts, e.g. see the structure superscripts on the distinguished constants of the structure (reposted from chatified comments to get the link reestablished). – Bill Dubuque Oct 17 '24 at 02:31
  • @BillDubuque why is $ax^2+bx+c$ not a polynomial? – Elvis Oct 18 '24 at 18:22
  • 1
    @Elvis A polynomial is an element of a polynomial ring, which in particular makes clear which symbols are variables (indeterminates) vs. coefs, and also specifies the underlying coef ring. The above poly notation could denote an element of $\Bbb Z[a,b,c,x]$ (all symbols variables), or in $\Bbb Z[x],$ (only $x$ is a variable), etc. – Bill Dubuque Oct 18 '24 at 18:35
  • @BillDubuque but it would be a polynomial in any case. – Elvis Oct 18 '24 at 18:38
  • @Elvis Only given said further context - analogous to "vector". Lacking such we can't even know its (total) degree, etc. – Bill Dubuque Oct 18 '24 at 19:26
  • @BillDubuque yes, but we know it's a polynomial. The problem with the definition of vector was different. – Elvis Oct 19 '24 at 09:20
  • @Elvis: I think that the situation with polynomials is actually quite analogous to the one with vectors. Outside of further context, the string "$ax^2+bx+c$" is just ambiguous notation: perhaps $a$, $b$, $c$, and $x$ are just elements of the real numbers, in which case $ax^2+bx+c$ is just a real number. But actually I think there is a more significant reason why it is awkward to ask whether $ax^2+bx+c$ is a polynomial. – Joe Oct 19 '24 at 11:22
  • The central concept in modern algebra is how a structure behaves, rather than the set-theoretic identities of its elements. For concreteness, consider the $\mathbb R$-algebra $\mathbb R[t]$. This is given by a universal property that characterises it up to unique isomorphism. But given any mathematical object $x$, we can find a free $\mathbb R$-algebra with one generator that contains $x$, using the transport of structure construction I mentioned in my answer. So in that sense, everything "could" be a polynomial. – Joe Oct 19 '24 at 11:22
  • Again, this analysis suggests that when we talk about the polynomial $at^2+bt+c$, this notation only makes sense after we have implicitly fixed a polynomial algebra for our discussion. And $t$ would just denote the generator of that polynomial algebra: what matters is not the set-theoretic properties that $t$ might have, but rather the special role it plays in the structure. See the nLab for further discussion of this point. – Joe Oct 19 '24 at 11:25
  • (Sorry, where I wrote "$\mathbb R$-algebra" I am assuming that algebras are associative, unital, and commutative.) – Joe Oct 19 '24 at 11:31

3 Answers3

20

Your suggestion to define a vector as an ordered pair $(v, V)$ of a vector space $V$ and an element of (the underlying set of) $V$ works fine. In practice it will almost always be clear from context what $V$ is and so nobody has felt the need to make it an explicit part of the notation, in the same way that it is extremely common to write $V$ itself for a vector space even though this strictly speaking only refers to the underlying set and not to the operations on it.

Qiaochu Yuan
  • 468,795
  • Thanks. By the way, in the last sentence of my question $V$ is a vector space, not the underlying set of a vector space. – Elvis Oct 06 '24 at 14:52
  • 1
    @Elvis: I don't understand your comment. The definition of a vector space $V$ over a field $k$ that I am familiar with is that it is a triple $V=(S,+,\cdot)$, where $+:S\times S\to S$ and $\cdot: k\times S\to S$ are maps satisfying various axioms. What do you mean by "element of $V$", if not an element of $S$ (i.e. an element of the underlying set of $V$)? – Joe Oct 06 '24 at 19:19
  • @Joe oh, sorry, I misread your answer. My bad. – Elvis Oct 06 '24 at 21:08
  • I'm pretty sure we can find textbooks somewhere where this distinction is explicit in the wording, if not the notation. For instance, if studying a one-dimensional vector space, the vector space and the field are the same set, and a text might be explicit in the distinction between "$x$ the vector" and "$x$ the scalar", and even mention the bijection function $I : (S, \text{field}) \to (S, \text{vector space}), x \mapsto x$ and its inverse. – Stef Oct 07 '24 at 10:57
  • Can two vectors $(v_1, V_1)$ and $(v_2, V_2)$ be added? – md2perpe Oct 07 '24 at 18:57
  • @md2perpe Like Joe said, the addition operation is implicit in the definition of the vector space, so strictly speaking no. But if the two vector spaces are defined over the same set and have equivalent addition operations, then you essentially can. In that case they're the same vector space up to multiplication anyway, though. – Idran Oct 07 '24 at 20:03
  • @Idran. So you agree that Qiaochu's first sentence is not correct? Defining a vector as $(v,V)$ makes addition a partial function since two vectors with different $V$ can not in general be added. – md2perpe Oct 08 '24 at 06:06
  • 1
    @md2perpe I'm not sure I understand your objection. It makes which addition operation a partial function? It was already the case that you can't add two vectors from different vector spaces, because each vector space's addition operation is defined over the underlying set of that particular vector space. Making the vector space that a vector is in an explicit part of the definition of a vector doesn't introduce that. Sometimes you can project a vector in one vector space into a different vector space to fake it, but that's all. – Idran Oct 08 '24 at 14:14
  • @Idran. I realize that my argument wasn't well–thought–out. – md2perpe Oct 08 '24 at 18:41
14

I would like to argue that the slogan "a vector is an element of a vector space" is a little misleading, for reasons that seem similar to what you mention in the post. If we take the definition "a vector is an element of a vector space" seriously, then every $v$ is a vector, since we can define a vector space structure on $\{v\}$ by letting $v$ play the role of the zero element. Hence, this is quite a useless notion.

I think a more honest account would be as follows. There is a precise definition of a vector space over a field $k$, and if $V$ is a vector space over $k$ which is clear from context, then we often adopt the linguistic convention of calling the elements of (the underlying set of) $V$ "vectors". This linguistic convention is not absolute: I have never heard anyone call the elements of $\mathbb R$ "vectors", even though $\mathbb R$ is a vector space over $\mathbb R$.

Here is an analogy. In analysis class, we learn that $\mathbb R$ can be characterised up to unique isomorphism as a complete ordered field. Later in the course, the skeptics are pleased to learn that we don't need to take the existence of a complete ordered field on faith: given a copy of the rational numbers $\mathbb Q$, one can construct a complete ordered field out of Dedekind cuts, or equivalence classes of Cauchy sequences of rationals. While these constructions technically lead to different fields, this doesn't have any significance whatsoever. Any reasonable theorem of analysis is true for one complete ordered field if and only if it is true for all complete ordered fields. However, there is a slightly puzzling artifact of this phenomenon. Suppose we insist that all we care about $\mathbb R$ is that it is a complete ordered field, and refuse to say exactly what the underlying set of $\mathbb R$ is (this largely mirrors actual mathematical practice). Given a mathematical object $x$, it is a little awkward to ask "is $x$ a real number?", at least if we interpret this question literally. It is surely the case that $x$ is a member of some complete ordered field, since we can choose a set $X$ with cardinality continuum and such that $x\in X$, and then give $X$ the structure of a complete ordered field via transport of structure. This analysis suggests, to me at least, that when we write "let $x$ be a real number", what we actually mean is that we are fixing a complete ordered field for our discussion, and then letting $x$ be a member of that field. Similarly, when we write "let $v$ be a vector", there should be a specific vector space $V$ that has been fixed in advance, and by a "vector" we simply mean "element of $V$". To interpret words like "vector" or "real number" in any other way would seem rather perverse, and would violate the modern structural spirit of mathematics.

Joe
  • 22,603
  • 5
    To me the point of the slogan “a vector is an element of a vector space” is that we don't study “vectors” in isolation; we study vector spaces. – Matthew Leingang Oct 07 '24 at 13:11
  • 1
    @xxxxxxxxx: I think the difference is that the "more honest" version acknowledges that we are usually only working within one particular vector space (or perhaps a very small number of spaces) at any given time, whereas the slogan omits this fact and implies that anything could be a vector if you try hard enough. – Kevin Oct 07 '24 at 22:31
  • @xxxxxxxxx: What I find misleading is that saying "a vector is an element of a vector space" cannot reasonably be thought of as a definition of "vector". If we interpret this statement literally, then it is saying that $x$ is a vector if and only if there exists a vector space $V$ such that $x\in V$. But then every $x$ is a vector, and so this is pointless. What the slogan is saying that if we have fixed a vector space $V$, then we sometimes say talk about "vectors" rather than "elements of $V$". But this is a linguistic convention, not a mathematical definition. – Joe Oct 08 '24 at 10:49
4

Your analysis is correct (even though I would not draw the same conclusion as you that it is a problem), but it is not unique to the definition of a vector. What is a ring element? What is a group element? What is a basis element? What is a homology class? It always depends on the context. You could formalize this with the suggestion in Qiaochu's great answer, by adding the context to the tuple, but there are other ways as well. And of course, the context does not only consist of the underlying set (of a vector space, in case of a vector), but everything we are currently talking about.

Maybe it is more clear if we add some conditions to the elements we are talking about. Take, for example, the notion of an invertible element of a ring $R$. It refers to an element $x \in R$ for which there exists an element $y \in R$ with $xy = 1$ and $yx = 1$. As we know, $x \in R$ actually means $x \in |R|$ where $|R|$ denotes the underlying set of $R$. We usually sweep forgetful functors such as $|-| : \mathbf{Ring} \to \mathbf{Set}$ under the rug, but they are present. Here, your objection, that the notion only depends on the underlying set, is not valid, since $xy = 1$ and $yx = 1$ use the multiplication. (This actually proves that the notion only depends on the underlying monoid. And in fact, most of the multiplicative theory of rings carries over to monoids.) You cannot possibly talk of an invertible element inside of a set with no further context.

But I want to emphasize that the fact that we have a condition on the elements that uses the algebraic structure should not be the only reason to have the ring in the context.

To illustrate this, given a ring $R$, for $n \in \mathbb{N}$ let us call a divisor sequence of length $n$ to be a sequence of elements $(x_1,\dotsc,x_n)$ in $R$ such that $x_i \mid x_{i+1}$. Clearly, this notion does not only depend on the underlying set. Now we may define (I do not claim that this is reasonable, I just do this to make my point): a ring element is a divisor sequence of length $1$. Since we have already agreed that the notion of a divisor sequence does not only depend on the underlying set, it is now clear that the notion of a ring element does not only depend on the underlying set.

Here is another suggestion (which is of course equivalent to the one in Qiaochu's answer). A vector is a linear map of the form $K \to V$, where $V$ is a $K$-vector space. Recall that domain and codomain belong to the data of a map (in particular, of a linear map), so we can recover the ambient vector space from a vector, as well as the base field. Similarly, we may define a ring element to be a ring homomorphism of the form $\mathbb{Z}[T] \to R$, etc. This notion has the advantage that it can also be written down in more general contexts. For example, if we are working in a topos, and we are internalizing the notion of a vector space (or ring object), we will not have an underlying set (!), but we can still use the definition above, namely that of a generalized element.