Question about notation in Linear Algebra

BiGyElLoWhAt
Gold Member
Messages
1,637
Reaction score
138
Given vector spaces V, W, and a function T:V→W , state the two equations that the function T must satisfy to be a linear function.

Does T:V→W mean a function that maps vectors in V into W? Or what does this actually mean?
 
Physics news on Phys.org
pretty much, yeah. The domain of the function is V and the codomain is W.
 
  • Like
Likes 1 person
V or W could be the real numbers of course, or vector spaces of different dimensions.
 
T is a function that takes a vector ##v## in ##V## to a vector ##w## in ##W##. We are very used to the idea of function that take numbers as inputs. For instance, if ##f(x) = x^2 + 1##, then ##f## takes ##1## to ##2##. We denote this by ##f(1) = 2##.

So ##T: V \rightarrow W## means a function that takes v's to w's. I.e. ##T(v) = w##.

Now in vector spaces, any old function isn't that useful. We are specifically interested in linear transformations.

##T## is a linear transformation if the following two properties hold:

##1) \ T(v + v') = T(v) + T(v')## for all ##v, v' \in V##.
##2) \ T(cv) = cT(v)## for all ##v \in V## and scalars ##c##.
 
Thread 'Use greedy vertex coloring algorithm to prove the upper bound of χ'
Hi! I am struggling with the exercise I mentioned under "Homework statement". The exercise is about a specific "greedy vertex coloring algorithm". One definition (which matches what my book uses) can be found here: https://people.cs.uchicago.edu/~laci/HANDOUTS/greedycoloring.pdf Here is also a screenshot of the relevant parts of the linked PDF, i.e. the def. of the algorithm: Sadly I don't have much to show as far as a solution attempt goes, as I am stuck on how to proceed. I thought...
Back
Top