For a set $S$ and a vector space $V$ over a scalar field $\K$, define the set of all functions from $S$ to $V$
\[ \Fun ( S , V ) = \{ f : S \rightarrow V \} . \]

For $f, g \in \Fun(S, V)$, $z \in \K$, addition and scalar multiplication can be defined by
\[ (f+g)(s) = f(s) + g(s) \, \mbox{ and } (cf)(s) = c (f(s)) \, \mbox{ for all } s \in S . \]

(a) Prove that $\Fun(S, V)$ is a vector space over $\K$. What is the zero element?

(b) Let $S_1 = \{ s \}$ be a set consisting of one element. Find an isomorphism between $\Fun(S_1 , V)$ and $V$ itself. Prove that the map you find is actually a linear isomorpism.

(c) Suppose that $B = \{ e_1 , e_2 , \cdots , e_n \}$ is a basis of $V$. Use $B$ to construct a basis of $\Fun(S_1 , V)$.

(d) Let $S = \{ s_1 , s_2 , \cdots , s_m \}$. Construct a linear isomorphism between $\Fun(S, V)$ and the vector space of $n$-tuples of $V$, defined as
\[ V^m = \{ (v_1 , v_2 , \cdots , v_m ) \mid v_i \in V \mbox{ for all } 1 \leq i \leq m \} . \]

(e) Use the basis $B$ of $V$ to constract a basis of $\Fun(S, V)$ for an arbitrary finite set $S$. What is the dimension of $\Fun(S, V)$?

(f) Let $W \subseteq V$ be a subspace. Prove that $\Fun(S, W)$ is a subspace of $\Fun(S, V)$.

Proof.

(a) Prove that $\Fun(S, V)$ is a vector space over $\K$. What is the zero element?

We will prove that each vector space axioms holds for $\Fun(S, V)$.

Closed under addition and scalar multiplication: For $f , g \in \Fun(S, V)$ and $c, d \in \K$, $cf+dg$ is another function with domain $S$ defined by
\[ (cf+dg)(s) = cf(s) + dg(s) \in V \, \mbox{ for all } s \in S . \] Thus $cf+dg \in \Fun(S, V)$. This proves that $\Fun(S, V)$ is closed under addition and scalar multiplication.

Addition is associative: For $f, g, h \in \Fun(S, V)$ and $s \in S$ we have
\begin{align*}
((f+g)+h)(s) &= (f+g)(s) + h(s) \\
&= ( f(s) + g(s) ) + h(s) \\
&= f(s) + ( g(s) + h(s) ) \\
&= f(s) + (g+h)(s) \\
&= (f+(g+h))(s) . \end{align*}

Because $((f+g)+h)(s) = (f+(g+h))(s)$ holds for each $s \in S$, we can say that $(f+g)+h = f+(g+h)$.

Addition is commutative: Notice that for $s \in S$ we have
\[ (f+g)(s) = f(s) + g(s) = g(s) + f(s) = (g+f)(s) . \] Because this holds for every $s \in S$, we can say that $f+g = g+f$.

Zero vector: The zero vector is the function $\mathbf{0}$, defined by $\mathbf{0}(s) = 0 \in V$ for each $s \in S$. To check that $\mathbf{0}$ is the additive identity, we check for any $f \in \Fun(S, V)$ and $s \in S$,
\[ (f+ \mathbf{0})(s) = f(s) + \mathbf{0}(s) = f(s) + 0 = f(s) . \] Because this holds for each $s \in S$, we can say that $f + \mathbf{0} = f$.

Inverse vectors: For $f \in \Fun(S, V)$, its additive inverse is the function $(-f)$ defined by
\[ (-f)(s) = – f(s) \, \mbox{ for all } s \in S . \] To check that $-f$ is the inverse of $f$, we check for all $s \in S$
\[ (f + (-f))(s) = f(s) + (-f)(s) = f(s) – f(s) = 0 = \mathbf{0}(s) . \]

Scalar multiplication is associative: For $c, d \in \K$, $f \in \Fun(S, V)$ and $s \in S$ we have
\[ ((cd)(f))(s) = (cd) f(s) = c ( d f(s) ) = c ( df)(s) = (c (df) )(s) . \] Because this holds for each $s \in S$, we conclude that $(cd)(f) = c (df)$.

Scalar identity element: Let $1 \in \K$ be the multiplicative identity. Then for $f \in \Fun(S, V)$ and $s \in S$ we have
\[ (1f)(s) = 1 f(s) = f(s) . \] Because this holds for all $s \in S$, we conclude that $1f = f$.

Distributivity: Next we check distributivity. For $c, d \in \K$, $f \in \Fun(S, V)$ and $s \in S$, we have
\[ ( (c+d)(f) )(s) = (c+d) f(s) = c f(s) + d f(s) = (cf + df)(s) . \] Because this holds for all $s \in S$, we can conclude that
\[ (c+d)f = cf + df . \]

For $c \in \K$, $f, g \in \Fun(S, V)$ and $s \in S$ we have
\begin{align*}
( c(f+g))(s) &= c ( (f+g)(s) ) \\
&= c ( f(s) + g(s) ) \\
&= cf(s) + cg(s) \\
&= (cf + cg)(s) . \end{align*}

Because this holds for all $s \in S$, we conclude that
\[ c(f+g) = cf + cg . \]

We have shown that $\Fun(S, V)$ satisfies all of the vector space axioms, so it is a vector space.

(b) Let $S_1 = \{ s \}$ be a set consisting of one element. Find an isomorphism between $\Fun(S_1 , V)$ and $V$ itself. Prove that the map you find is actually a linear isomorpism.

Define the map $T : \Fun(S_1 , V) \rightarrow V$ by
\[ T(f) = f(s) \, \mbox{ for all } f \in \Fun(S_1 , V) . \]

We check that $T$ is a linear map. For $f, g \in \Fun(S_1, V)$ we have
\[ T(f+g) = (f+g)(s) = f(s) + g(s) = T(f) + T(g) . \] Thus $T$ is additive. Next, for $c \in \K$ and $f \in \Fun(S_1, V)$ we have
\[ T(cf) = (cf)(s) = c f(s) = c T(f) . \] This shows that $T$ respects scalar multiplication, and so $T$ is a linear map.

Next we prove that $T$ is an isomorphism. To see that $T$ is surjective, pick any $v \in V$. Define the map $f_v \in \Fun(S_1, V)$ by $f_v(s) = v$. Then $T(f_v) = f_v(s) = v$, and so $v$ lies in the range of $T$.

To see that $T$ is injective, it is enough to show that if $T(f) = 0 \in V$ then $f = \mathbf{0} \in \Fun(S_1, V)$. So suppose that $T(f) = 0$. Because $T(f) = f(s)$, this implies that $f(s) = 0$. But $\mathbf{0}(s) = 0$ as well. Because $f(s) = \mathbf{0}(s)$ for each $s \in S_1$ (which, remember, contains only the one element), we can conclude that $f = \mathbf{0}$.

We have shown that $T$ is linear, injective, and surjective. This finishes the proof that $T$ is a linear isomorphism.

(c) Find a basis of $\Fun(S_1 , V)$.

We can use the basis $B$ of $V$ and the linear isomorphism $T$ found in the previous part to define a basis of $\Fun(S_1, V)$. More specifically, the image of $B$ under the inverse isomorphism
\[ T^{-1} : V \rightarrow \Fun(S_1 , V) \] will define a basis of $\Fun(S_1 , V)$.

For $v \in V$ define the function $f_v$ by $f_v(s) = v$. It is clear that $T(f_v) = v$, and so $T^{-1}(v) = f_v$ for all $v \in V$. In particular, $T^{-1}(e_i) = f_{e_i}$ for each $1 \leq i \leq n$, and so the set $\{ f_{e_1} , f_{e_2} , \cdots , f_{e_n} \}$ forms a basis of $\Fun(S, V)$.

(d) Construct a linear isomorphism between $\Fun(S, V)$ and the vector space $V^m$

Define the map $T : \Fun(S, V) \rightarrow V^m$ by
\[ T(f) = ( f(s_1) , f(s_2) , \cdots , f(s_m) ) \in V^m \, \mbox{ for all } f \in \Fun(S, V) . \]

First we show that $T$ is linear. For $f, g \in \Fun(S, V)$ and $c, d \in \K$ we have
\begin{align*}
T(cf+dg) &= \left( (cf + dg)(s_1) , (cf + dg)(s_2) , \cdots , (cf + dg)(s_m) \right) \\
&= \left( (cf)(s_1) + (dg)(s_1) , (cf)(s_2) + (dg)(s_2) , \cdots , (cf)(s_m) + (dg)(s_m) \right) \\
&= \left( c f(s_1) , c f(s_2) , \cdots , c f(s_m) \right) + \left( d g(s_1) , d g(s_2) , \cdots , d g(s_m) \right) \\
&= c \left( f(s_1) , f(s_2) , \cdots , f(s_m) \right) + d \left( g(s_1) , g(s_2) , \cdots , g(s_m) \right) \\
&= c T(f) + d T(g) . \end{align*}

This proves that $T$ is a linear map.

Next we show that it is an isomorphism.

First we show surjectivity. For $(v_1 , v_2 , \cdots , v_m) \in V^m$ define the function $f$ by
\[ f(s_i) = v_i \, \mbox{ for } 1 \leq i \leq m . \]

Then
\[ T(f) = ( f(s_1) , f(s_2) , \cdots , f(s_m) ) = ( v_1 , v_2 , \cdots , v_m ) . \] Thus every element of $V^m$ lies in the range of $T$.

Next we check injectivity. Suppose that $T(f) = (0 , 0 , \cdots , 0) \in V^m$. This means that $f(s_i) = 0$ for each $1 \leq i \leq m$. Thus $f(s) = \mathbf{0}(s)$ for all $s \in S$, and so $f = \mathbf{0}$. This proves that $T$ is injective. Together with surjectivity and linearity, we have proven that $T$ is an isomorphism.

(e) Constract a basis of $\Fun(S, V)$ for an arbitrary finite set $S$. What is the dimension of $\Fun(S, V)$?

We will use the basis $B = \{ e_1 , \cdots , e_n \}$ of $V$ to create a basis for $V^m$. We will translate this basis into a basis of $\Fun(S, V)$ using the isomorphism $T$, or actually its inverse $T^{-1}$.

For integers $i, j$ with $1 \leq i \leq n$ and $1 \leq j \leq m$, define the vector
\[ d_i^j = ( 0 , \cdots , e_i , \cdots , 0 ) . \] Notice that every component is $0$ except for the $j$-th component, which is the vector $e_i$. The set $\{ d_i^j \}_{ \substack{1 \leq i \leq n \\ 1 \leq j \leq m} }$ is the standard basis of $V^m$ defined by $B$. The set $\{ T^{-1} ( d_i^j ) \}_{ \substack{ 1 \leq i \leq n \\ 1 \leq j \leq m}}$ will then be a basis of $\Fun(S, V)$.

To find $T^{-1}$, suppose that $T(f) = d_i^j$. Because the $j$-th component of $d_i^j$ is $e_i$, we must have that $f(s_j) = e_i$. Because all of the other components are $0$, we must have $f(s_k) = 0$ for all $k \neq j$. This information completely determines the function $f$. Define the function $\delta_i^j$ by
\[ \delta_i^j ( s_k ) = \left\{ \begin{array}{cl} e_i & \mbox{ if } k = j \\ 0 & \mbox{ if } k \neq j \end{array} \right. . \]

Then it is clear that $T(\delta_i^j) = d_i^j$; that is, $T^{-1}(d_i^j) = \delta_i^j$. Thus a basis of $\Fun(S, V)$ is formed by the set $\{ \delta_i^j \}_{ \substack{ 1 \leq i \leq n \\ 1 \leq j \leq m }}$. There are exactly $nm$ elements in this basis, thus $\Fun(S, V)$ has dimension $nm$.

(f) Prove that $\Fun(S, W)$ is a subspace of $\Fun(S, V)$.

We will show in one step that $\Fun(S, W)$ is closed under addition and scalar multiplication. For $f, g \in \Fun(S, W)$, $c, d \in \K$ and $s \in S$ we have
\[ (cf + dg)(s) = c f(s) + d g(s) \in W . \] This proves that $(cf + dg) : S \rightarrow W$, and so $(cf + dg) \in \Fun(S, W)$.

The post Vector Space of Functions from a Set to a Vector Space first appeared on Problems in Mathematics.

Let $C ([0, 3] )$ be the vector space of real functions on the interval $[0, 3]$. Let $\mathrm{P}_3$ denote the set of real polynomials of degree $3$ or less.

Define the map $T : C ([0, 3] ) \rightarrow \mathrm{P}_3 $ by
\[T(f)(x) = f(0) + f(1) \cdot x + f(2) \cdot x^2 + f(3) \cdot x^3.\]

Determine if $T$ is a linear transformation. If it is, determine its nullspace.

$T$ is a linear transformation

We will show that $T$ satisfies both of the axioms for linear transformations. Suppose $f, g \in C([0, 3])$. Then
\begin{align*}
&T(f+g)(x)\\
&= (f+g)(0) + (f+g)(1) \cdot x + (f+g)(2) \cdot x^2 + (f+g)(3) \cdot x^3 \\
&= f(0) + f(1) \cdot x + f(2) \cdot x^2 + f(3) \cdot x^3 + g(0) + g(1) \cdot x + g(2) \cdot x^2 + g(3) \cdot x^3 \\
&= T(f)(x) + T(g)(x) . \end{align*}

Thus we see that $T(f+g) = T(f) + T(g)$.

Next, suppose $f \in C([0, 3])$ and $c \in \mathbb{R}$. Then,
\begin{align*}
&T(cf)(x)\\
&= (cf)(0) + (cf)(1) \cdot x + (cf)(2) \cdot x^2 + (cf)(3) \cdot x^3 \\
&= c f(0) + c f(1) \cdot x + c f(2) \cdot x^2 + c f(3) \cdot x^3 \\
&= c ( f(0) + f(1) \cdot x + f(2) \cdot x^2 + f(3) \cdot x^3 ) \\
&= c T(f)(x) . \end{align*}

This shows that $T$ is a linear transformation.

The nullspace of $T$

Next, we will find the nullspace of $T$. Suppose that $f \in C([0, 3])$ such that $T(f) = 0$. That means that
\[f(0) + f(1) \cdot x + f(2) \cdot x^2 + f(3) \cdot x^3 = 0.\]

This implies that $f(0) = f(1) = f(2) = f(3) = 0$. On the other hand, if $f(0)=f(1)=f(2)=f(3)=0$, then $T(f)(x) = 0$. Thus, the nullspace is
\[\mathcal{N}(T) = \{ f \in C([0, 3]) \mid f(0) = f(1) = f(2) = f(3) = 0 \}.\] Click here if solved 24

The post Is the Map $T(f)(x) = f(0) + f(1) \cdot x + f(2) \cdot x^2 + f(3) \cdot x^3$ a Linear Transformation? first appeared on Problems in Mathematics.

For what real values of $a$ is the set
\[W_a = \{ f \in C(\mathbb{R}) \mid f(0) = a \}\] a subspace of the vector space $C(\mathbb{R})$ of all real-valued functions?

Solution.

The zero element of $C(\mathbb{R})$ is the function $\mathbf{0}$ defined by $\mathbf{0}(x) = 0$. This shows that $\mathbf{0} \in W_a$ if and only if $a=0$.

We have shown that if $a \neq 0$, then $W_a$ is not a subspace as every subspace contains the zero vector. Now we consider the case $a=0$ and prove that $W_0$ is a subspace.

We verify the subspace criteria: the zero vector of $C(\R)$ is in $W_0$, and $W_0$ is closed under addition and scalar multiplication.

As mentioned before, $\mathbf{0} \in W_0$.

Now suppose $f, g \in W_0$. Then $f(0) = g(0) = 0$, and so
\[(f+g)(0) = f(0) + g(0) = 0.\] Thus $f+g \in W_0$. Finally, if $c \in \mathbb{R}$ is a scalar and $f \in W_0$, then
\[(cf)(0) = c f(0) = c \cdot 0 = 0.\] Thus $cf \in W_0$, and $W_0$ is a vector subspace.

The post Determine the Values of $a$ so that $W_a$ is a Subspace first appeared on Problems in Mathematics.

Let $C(\mathbb{R})$ be the vector space of real-valued functions on $\mathbb{R}$.

Consider the set of functions $W = \{ f(x) = a + b \cos(x) + c \cos(2x) \mid a, b, c \in \mathbb{R} \}$.

Prove that $W$ is a vector subspace of $C(\mathbb{R})$.

Proof.

We verify the subspace criteria: the zero vector of $C(\R)$ is in $W$, and $W$ is closed under addition and scalar multiplication.

First, the zero element of $C(\mathbb{R})$ is the zero function $\mathbf{0}$ defined by $\mathbf{0}(x) = 0$. This element lies in $W$, as $\mathbf{0}(x) = 0 + 0 \cos(x) + 0 \cos(2x)$.

Now suppose $f_1(x), f_2(x) \in W$, say $ f_1(x) = a_1 + b_1 \cos(x) + c_1 \cos(2x)$ and $f_2(x) = a_2 + b_2 \cos(x) + c_2 \cos(2x)$. Then
\[f_1(x) + f_2(x) = (a_1 + a_2) + (b_1 + b_2) \cos(x) + ( c_1 + c_2) \cos(2x)\] and so $f_1(x) + f_2(x) \in W$.

Finally, for any scalar $d \in \mathbb{R}$, we have
\[d f_1(x) = (a_1 d) + (b_1 d) \cos(x) + (c_1 d) \cos(2x),\] and so $d f_1(x) \in W$ as well.

This proves that $W$ is a subspace of $W$.

The post The Set $ \{ a + b \cos(x) + c \cos(2x) \mid a, b, c \in \mathbb{R} \}$ is a Subspace in $C(\R)$ first appeared on Problems in Mathematics.

Let $V$ be the vector space over $\R$ of all real valued functions defined on the interval $[0,1]$. Determine whether the following subsets of $V$ are subspaces or not.

(a) $S=\{f(x) \in V \mid f(0)=f(1)\}$.

(b) $T=\{f(x) \in V \mid f(0)=f(1)+3\}$.

Hint.

To show that a subset $W$ of a vector space $V$ is a subspace, we need to check that

1. the zero vector in $V$ is in $W$
2. for any two vectors $u,v \in W$, we have $u+v \in W$
3. for any scalar $c$ and any vector $u \in W$, we have $cu \in W$.

Solution.

(a) Is $S=\{f(x) \in V \mid f(0)=f(1)\}$ a subspace?

We show that $S$ is a subspace of the vector space $V$ by checking conditions (1)-(3) given in the hint above.
First note that the zero vector in $V$ is the zero function $\theta(x)$, that is, $\theta(x)=0$ for any $x \in [0,1]$.
Since we have $\theta(0)=0=\theta(1)$, the zero function $\theta(x)\in S$.
Condition (1) is met.

Now, take any $f(x), g(x) \in S$. By the defining relation of $S$, we have
\[f(0)=f(1), \quad g(0)=g(1).\] Consider the addition $(f+g)(x)$. We have
\[(f+g)(0)=f(0)+g(0)=f(1)+g(1)=(f+g)(1)\] and it follows that $(f+g)(x) \in S$.
Thus $S$ satisfies condition (2).

To check the condition (3), take any scalar $c \in \R$ and $f(x) \in S$.
Since $f(x)\in S$, we have $f(0)=f(1)$. The scalar multiplication $(cf)(x)$ satisfies
\[(cf)(0)=c\cdot f(0)=c\cdot f(1)= (cf)(0).\] Thus $(cf)(x) \in S$.

Therefore, the subset $S$ satisfies conditions (1)-(3). Hence $S$ is a subspace of $V$.

(b) Is $T=\{f(x) \in V \mid f(0)=f(1)+3\}$ a subspace?

We claim that $T$ is not a subspace of the vector space $V$.
For example, the subset $T$ does not satisfy condition (1).

The zero vector of $V$ is the zero function $\theta(x)$.
Then we have
\[\theta(0)=0 \neq 0+3=\theta(1)+3,\] and hence the zero vector $\theta(x) \in V$ is not in $W$.

The post Subspaces of the Vector Space of All Real Valued Function on the Interval first appeared on Problems in Mathematics.