ME681: Mathematics for Engineers: Assignment 1 Solution

Arpan Kedia (arpanked@iitk.ac.in) and Santanu Das (santanu@iitk.ac.in)

Latex work by Vimal Kumar Gaurav (vkgaurav@iitk.ac.in).
August 9, 2012
If you nd any mistakes or doubts about possible mistakes in the solution, then email above TAs.
A1.1
For three real numbers x
1
x
2
x
3
, give examples such that there is
(1) No solution
(2) Unique solution
(3) Innite number of solutions.
Give (only) geometrical justication for each.
Solution
(1) Example for Unique solution: x, y, and z are three real variables.
3x y +z = 6,
x +y + 2z = 2,
x + 3y + 4z = 4.
Unique solution (MATLAB Code):
syms x y z
z=(-3*x+y+6)
ezsurf(z, x, y);
hold on
z=(x-y+2)/2;
ezsurf(z, x, y);
hold on
z = (x-3*y+4)/4;
ezsurf(z, x, y);
hold o
Note: These are the equations of three planes. Now from the gure (Fig 1) we can see that these
three planes meet at single point. Hence there is a unique solution.
(2) Example for No solution: x, y, and z are three real variables.
x +y +z = 4,
x + 2y + 6z = 10,
y + 5z = 100.
1
Figure 1: Unique solution
No solution (MATLAB Code):
syms x y z
z=(-x-y+4);
ezsurf(z, x, y);
hold on
z=(-x-2*y+10)/6;
ezsurf(z, x, y);
hold on
z=(-y+100)/5;
ezsurf(z, x, y);
Note : These are the equations of three planes. Now from the gure (Fig 2) we can see that these
three planes do not meet at any point. Hence there is no solution.
(3) Example for innite number of solutions: x, y, and z are three real variables.
x +y +z = 5,
x + 3y + 2z = 10,
2y +z = 5.
Innite number of solutions (MATLAB Code):
syms x y z
z=(-x-y+5);
ezsurf(z, x, y);
hold on
z=(-x-3*y+10)/2;
2
Figure 2: No solution
ezsurf(z, x, y);
hold on
z=(-2*y+5);
ezsurf(z, x, y);
hold o
Note: These are the equations of three planes. When we add P1 and P3 we get P2. Now from
the gure (Fig 3) we can see that these three planes meet at a line. Hence there are innitely many
solutions.
Figure 3: Innite number of solutions
3
A1.2
Given equations are
a
11
x
1
+a
12
x
2
+. . . +a
1n
x
n
= b
1
,
a
21
x
1
+a
22
x
2
+. . . +a
2n
x
n
= b
2
,
.
.
. (1)
a
m1
x
1
+a
m2
x
2
+. . . +a
mn
x
n
= b
m
,
where x
1
, x
2
, . . . , x
n
are real variables, a
11
, a
12
, . . . a
mn
and b
1
, b
2
, . . . b
m
are real numbers.
Solution
The above system of equations has two distinct solutions i.e. y
1
, y
2
, . . . , y
n
and z
1
, z
2
, . . . , z
n
.
Now putting solutions in equation (1), we get, (as they satisfy equation (1))
a
11
y
1
+a
12
y
2
+. . . +a
1n
y
n
= b
1
,
a
21
y
1
+a
22
y
2
+. . . +a
2n
y
n
= b
2
,
.
.
. (2)
a
m1
y
1
+a
m2
y
2
+. . . +a
mn
y
n
= b
m
,
and
a
11
z
1
+a
12
z
2
+. . . +a
1n
z
n
= b
1
,
a
21
z
1
+a
22
z
2
+. . . +a
2n
z
n
= b
2
,
.
.
. (3)
a
m1
z
1
+a
m2
z
2
+. . . +a
mn
z
n
= b
m
.
Let, , be the any two real numbers. Now, multiplying equation (2) by (

+
) and multiplying
equation (3) by (

+
) and adding corresponding equations, we get (we assume
1
+ = 0),
a
11
(

+
y
1
+

+
z
1
) +. . . +a
1n
(

+
y
n
+

+
z
n
) =

+
b
1
+

+
b
1
,
.
.
. (4)
a
m1
(

+
y
1
+

+
z
1
) +. . . +a
mn
(

+
y
n
+

+
z
n
) =

+
b
m
+

+
b
m
.

a
11
(

+
y
1
+

+
z
1
) +. . . +a
1n
(

+
y
n
+

+
z
n
) = b
1
,
.
.
. (5)
a
m1
(

+
y
1
+

+
z
1
) +. . . +a
mn
(

+
y
n
+

+
z
n
) = b
m
.
So, {

+
y
i
+

+
z
i
} where i = 1, 2, . . . , n are also the solution sets of equation (1), and , can
be any real numbers with + = 0, so there are innite number of solutions. (hence proved)
1
not really needed for the result to hold
4
A1.3
Give examples of equation in one variable x such that equation is not linear and it has
(1) No solution,
(2) Unique solution,
(3) Two solution,
(4) Innite number of solutions.
Solution
(1) No solution:
x
2
+ 1 = 0,
Note: Solutions are not real. Hence no solution is possible for above equation.
(2) Unique solution:
ln x = 0,
Note: After solving this, we get x = 1. Hence unique solution is possible for the above equation.
(3) Two solutions:
x
2
1 = 0,
Note: Solutions are x = 1, 1. Hence there are two solution of above equation.
(4) Innite number of solutions:
sin x = 0,
Note: Solutions x = n. Where n = 0, 1, 2, 3 . . . . Hence there are innitely many solutions
possible.
A1.4
Solve for real real variables x
1
, x
2
, x
3
by using Gauss-elimination method:
4x
2
3x
3
= 3,
x
1
+ 7x
2
5x
3
= 4,
x
1
+ 8x
2
6x
3
= 5.
Solution
Augmented matrix is:
_
_
0 4 3 : 3
1 7 5 : 4
1 8 6 : 5
_
_
,
R
1
R
2
:
_
_
1 7 5 : 4
0 4 3 : 3
1 8 6 : 5
_
_
,
5
R
3
R
3
R
1
:
_
_
1 7 5 : 4
0 4 3 : 3
0 1 1 : 1
_
_
,
R
2
R
3
:
_
_
1 7 5 : 4
0 1 1 : 1
0 4 3 : 3
_
_
,
R
3
R
3
4R
1
:
_
_
1 7 5 : 4
0 1 1 : 1
0 0 1 : 1
_
_
,
and now applying back substitution,
E
3
: 0.x
1
+ 0.x
2
+ 1.x
3
= 1,
x
3
= 1
E
2
: 0.x
1
+ 1.x
2
+ (1).x
3
= 1,
x
2
= 0
E
1
: (1).x
1
+ 7.x
2
+ (5).x
3
= 4
x
1
= 1.
Finally, we get a unique solution as
_
_
x
1
x
2
x
3
_
_
=
_
_
1
0
1
_
_
.
A1.5
Solve using Gauss-Jordan method the examples 2 and 3 given in the class.
(a)
x
1
+ 3x
2
2x
3
= 1,
x
1
+ 4x
2
3x
3
= 0,
x
1
+ 5x
2
4x
3
= 0,
(b)
x
1
+ 3x
2
2x
3
= 4,
x
1
+ 4x
2
3x
3
= 5,
x
1
+ 5x
2
4x
3
= 6.
6
Solution
(a) Augmented matrix:
_
_
1 3 2 : 1
1 4 3 : 0
1 5 4 : 0
_
_
,
R
1
(1) R
1
:
_
_
1 3 2 : 1
1 4 3 : 0
1 5 4 : 0
_
_
,
R
2
R
1
+R
2
and R
3
R
1
+R
3
:
_
_
1 3 2 : 1
0 1 1 : 1
0 2 2 : 1
_
_
,
R
1
R
1
+ 3R
2
and R
3
R
3
2R
2
:
_
_
1 0 1 : 4
0 1 1 : 1
0 0 0 : 1
_
_
,
and using back substitution,
0.x
1
+ 0.x
2
+ 0.x
3
= 1
which is not possible because 0 = 1, hence no solution exists.
(b) Augmented matrix:
_
_
1 3 2 : 4
1 4 3 : 5
1 5 4 : 6
_
_
,
R
1
(1) R
1
:
_
_
1 3 2 : 4
1 4 3 : 5
1 5 4 : 6
_
_
,
R
2
R
1
+R
2
and R
3
R
1
+R
3
:
_
_
1 3 2 : 4
0 1 1 : 1
0 2 2 : 2
_
_
,
R
3
R
3
2R
2
:
_
_
1 3 2 : 4
0 1 1 : 1
0 0 0 : 0
_
_
,
R
1
R
1
+ 3R
2
:
_
_
1 0 1 : 1
0 1 1 : 1
0 0 0 : 0
_
_
,
and using back substitution,
E
3
: 0.x
1
+ 0.x
2
+ 0.x
3
= 0
7
E
2
: 0.x
1
+ 1.x
2
1.x
3
= 1
x
2
= 1 +x
3
E
1
: 1.x
1
+ 0.x
2
1.x
3
= 1
x
1
= 1 +x
3
.
Finally,
_
_
x
1
x
2
x
3
_
_
=
_
_
1 +x
3
1 +x
3
x
3
_
_
.
In this way, this system has innite number of solutions since x
3
is an arbitrary real number.
A1.6
Solve for real variables x
1
, x
2
, x
3
from the following system of equations using Gauss-Jordan method:
2x
1
x
2
= 1
x
1
+ 2x
2
x
3
= 0
x
1
+x
3
= 0,
2x
1
x
2
= 0
x
1
+ 2x
2
x
3
= 1
x
1
+x
3
= 0,
and
2x
1
x
2
= 0
x
1
+ 2x
2
x
3
= 0
x
1
+x
3
= 1.
Solution
Augmented matrix:
_
_
2 1 0 : 1 0 0
1 2 1 : 0 1 0
1 0 1 : 0 0 1
_
_
,
R
1
R
3
:
_
_
1 0 1 : 0 0 1
1 2 1 : 0 1 0
2 1 0 : 1 0 0
_
_
,
R
1
(1)R
1
:
_
_
1 0 1 : 0 0 1
1 2 1 : 0 1 0
2 1 0 : 1 0 0
_
_
,
R
2
R
1
+R
2
and R
3
R
3
2R
1
:
_
_
1 0 1 : 0 0 1
0 2 2 : 0 1 1
0 1 2 : 1 0 2
_
_
,
8
R
2

1
2
R
2
:
_
_
1 0 1 : 0 0 1
0 1 1 : 0 1/2 1/2
0 1 2 : 1 0 2
_
_
,
R
3
R
2
+R
3
:
_
_
1 0 1 : 0 0 1
0 1 1 : 0 1/2 1/2
0 0 1 : 1 1/2 3/2
_
_
,
R
1
R
1
+R
3
and R
2
R
2
+R
3
:
_
_
1 0 0 : 1 1/2 1/2
0 1 0 : 1 1 1
0 0 1 : 1 1/2 3/2
_
_
,

_
_
x
1
x
2
x
3
_
_
=
_
_
1
1
1
_
_
,
_
_
1
2
1
1
2
_
_
,
_
_
1
2
1
3
2
_
_
,
respectively, for the three systems of equations.
A1.7
Determine the rank and the basic columns of the following matrix.
_
_
1 2 2 1
2 4 2 2
3 6 3 4
_
_
.
Solution
Applying the operations R
2
R
2
2R
1
and R
3
R
3
3R
1
:
_
_
1 2 1 1
0 0 0 0
0 0 0 1
_
_
,
R
3
R
2
:
_
_
1 2 1 1
0 0 0 1
0 0 0 0
_
_
,
R
1
R
1
R
2
:
_
_
1 2 1 0
0 0 0 1
0 0 0 0
_
_
,
Rank of matrix = No. of non-zero rows. In above matrix the number of non-zero rows is 2.
Hence rank of the matrix = 2.
Basic variables are x
1
and x
4
. Hence basic column are
_
_
1
0
0
_
_
and
_
_
0
1
0
_
_
i.e. column 1 and column 4 of
above matrix.
9
A1.8
Solve Ax = 0, where
A =
_

_
1 2 1 3 1
2 4 1 3 8
1 2 3 5 7
2 4 2 6 2
3 6 1 7 3
_

_
and x =
_

_
x
1
x
2
x
3
x
4
x
5
_

_
.
Solution
Applying the operations R
2
R
2
2R
1
, R
3
R
3
R
1
, R
4
R
4
2R
1
and R
5
R
5
3R
1
to matrix A:
_

_
1 2 1 3 1
0 0 3 3 6
0 0 2 2 6
0 0 0 0 0
0 0 2 2 6
_

_
,
R
4
R
5
:
_

_
1 2 1 3 1
0 0 3 3 6
0 0 2 2 6
0 0 2 2 6
0 0 0 0 0
_

_
,
R
4
R
4
+R
3
:
_

_
1 2 1 3 1
0 0 3 3 6
0 0 2 2 6
0 0 0 0 0
0 0 0 0 0
_

_
,
The above form is row echelon form.
R
2

1
3
R
2
, R
3

1
2
R
3
_

_
1 2 1 3 1
0 0 1 1 2
0 0 1 1 3
0 0 0 0 0
0 0 0 0 0
_

_
,
R
1
R
1
R
2
and R
3
R
3
R
2
:
_

_
1 2 0 2 3
0 0 1 1 2
0 0 0 0 5
0 0 0 0 0
0 0 0 0 0
_

_
,
10
R
3

1
5
R
3
:
_

_
1 2 0 2 3
0 0 1 1 2
0 0 0 0 1
0 0 0 0 0
0 0 0 0 0
_

_
,
R
1
R
1
3R
3
and R
2
R
2
+ 2R
3
:
_

_
1 2 0 2 0
0 0 1 1 0
0 0 0 0 1
0 0 0 0 0
0 0 0 0 0
_

_
,
The above form of matrix is row reduced echelon form. And the basic variables are x
1
, x
3
, and
x
5
. Using back substitution,
E
5
: 0.x
1
+ 0.x
2
+ 0.x
3
+ 0.x
4
+ 0.x
5
= 0,
E
4
: 0.x
1
+ 0.x
2
+ 0.x
3
+ 0.x
4
+ 0.x
5
= 0,
E
3
: 0.x
1
+ 0.x
2
+ 0.x
3
+ 0.x
4
+ 1.x
5
= 0,
x
5
= 0,
E
2
: 0.x
1
+ 0.x
2
+ 1.x
3
+ 1.x
4
+ 0.x
5
= 0,
x
3
= x
4
,
E
1
: 1.x
1
+ 2.x
2
+ 0.x
3
+ 2.x
4
+ 0.x
5
= 0,
x
1
= 2x
2
2x
4
,
x =
_

_
x
1
x
2
x
3
x
4
x
5
_

_
= x
2
_

_
2
1
0
0
0,
_

_
.x
4
=
_

_
2
0
1
1
0,
_

_
.
So, above solution is in the form of the equation x = x
f
1
h
1
, where x
f
1
= free variable = x
2
and
x
f
2
= free variable = x
4
and h
1
=
_

_
2
1
0
0
0
_

_
and h
2
=
_

_
2
0
1
1
0
_

_
.
A1.9
Consider the following system of equations:
x +y +z = 0,
4x + 8y z = 0,
6x 2y +z = 1.
where x, y, z are real variables.
1. Determine such that there exists a solution,
2. Determine such that there is a unique solution,
3. Determine such that there is innite number of solutions.
11
Solution
The above system of equations can be compared with Ax = b, where Augmented matrix
[A|b] =
_
_
1 1 1 : 0
4 8 1 : 0
6 2 : 1
_
_
,
R
2
R
2
4R
1
and R
3
R
3
6R
1
:
_
_
1 1 1 : 0
0 4 5 : 0
0 8 6 : 1
_
_
,
R
3
R
3
+ 2R
2
:
_
_
1 1 1 : 0
0 4 5 : 0
0 0 16 : 1
_
_
,
R
2

1
4
R
2
:
_
_
1 1 1 : 0
0 1
5
4
: 0
0 0 16 : 1
_
_
,
R
1
R
1
R
2
:
_
_
1 0
9
4
: 0
0 1
5
4
: 0
0 0 16 : 1
_
_
,
1. For at least one solution, can be any real number, except = 16.
2. For unique solution, = 16,
3. For innite number of solution, there is no such real value of exists.
A1.10
Verify the properties (i), (ii), (iii) and (v) for R
n
.
(i) x + (y +z) = (x +y) +z,
(ii) x +y = y +x,
(iii) x + 0 = 0 +x = x,
(v) (x +y) = (x) + (y),
wherex, y, z R
n
, where R
n
is a linear space and x =
_

_
x
1
x
2
.
.
.
x
n
_

_
; y =
_

_
y
1
y
2
.
.
.
y
n
_

_
and z =
_

_
z
1
z
2
.
.
.
z
n
_

_
.
12
Solution
(i) x + (y +z) = (x +y) +z,
L.H.S of property (i):
x + (y +z) =
_

_
x
1
x
2
.
.
.
x
n
_

_
+
_
_
_
_
_
_

_
y
1
y
2
.
.
.
y
n
_

_
+
_

_
z
1
z
2
.
.
.
z
n
_

_
_
_
_
_
_
=
_

_
x
1
x
2
.
.
.
x
n
_

_
+
_

_
y
1
+z
1
y
2
+z
2
.
.
.
y
n
+z
n
_

_
=
_

_
x
1
+y
1
+z
1
x
2
+y
2
+z
2
.
.
.
x
n
+y
n
+z
n
_

_
,
R.H.S of property (i):
(x +y) +z =
_
_
_
_
_
_

_
x
1
x
2
.
.
.
x
n
_

_
+
_

_
y
1
y
2
.
.
.
y
n
_

_
_
_
_
_
_
+
_

_
z
1
z
2
.
.
.
z
n
_

_
=
_

_
x
1
+y
1
x
2
+y
2
.
.
.
x
n
+y
n
_

_
+
_

_
z
1
z
2
.
.
.
z
n
_

_
=
_

_
x
1
+y
1
+z
1
x
2
+y
2
+z
2
.
.
.
x
n
+y
n
+z
n
_

_
,
L.H.S. = R.H.S. Hence property (i) is veried.
(ii) x +y = y +x,
L.H.S of property (ii):
x +y =
_

_
x
1
x
2
.
.
.
x
n
_

_
+
_

_
y
1
y
2
.
.
.
y
n
_

_
=
_

_
x
1
+y
1
x
2
+y
2
.
.
.
x
n
+y
n
_

_
,
R.H.S of property (ii):
y +x =
_

_
y
1
y
2
.
.
.
y
n
_

_
+
_

_
x
1
x
2
.
.
.
x
n
_

_
=
_

_
y
1
+x
1
y
2
+x
2
.
.
.
y
n
+x
n
_

_
=
_

_
x
1
+y
1
x
2
+y
2
.
.
.
x
n
+y
n
_

_
,
L.H.S. = R.H.S. Hence property (ii) is veried.
(iii) x + 0 = 0 +x = x, where 0 =
_

_
0
0
.
.
.
0
_

_
L.H.S of property (iii):
x + 0
_

_
x
1
x
2
.
.
.
x
n
_

_
+
_

_
0
0
.
.
.
0
_

_
=
_

_
x
1
+ 0
x
2
+ 0
.
.
.
x
n
+ 0
_

_
=
_

_
x
1
x
2
.
.
.
x
n
_

_
,
R.H.S of property (iii):
0 +x =
_

_
0
0
.
.
.
0
_

_
+
_

_
x
1
x
2
.
.
.
x
n
_

_
=
_

_
0 +x
1
0 +x
2
.
.
.
0 +x
n
_

_
=
_

_
x
1
x
2
.
.
.
x
n
_

_
,
13
L.H.S. = R.H.S. Hence property (iii) is veried.
(v) (x +y) = (x) + (y),
L.H.S of property (v):
(x +y) =
_
_
_
_
_
_

_
x
1
x
2
.
.
.
x
n
_

_
+
_

_
y
1
y
2
.
.
.
y
n
_

_
_
_
_
_
_
=
_

_
x
1
+y
1
x
2
+y
2
.
.
.
x
n
+y
n
_

_
=
_

_
(x
1
+y
1
)
(x
2
+y
2
)
.
.
.
(x
n
+y
n
)
_

_
,
R.H.S of property (v):
(x) + (y) =
_
_
_
_
_

_
x
1
x
2
.
.
.
x
n
_

_
_
_
_
_
_
+
_
_
_
_
_

_
y
1
y
2
.
.
.
y
n
_

_
_
_
_
_
_
=
_

_
x
1
x
2
.
.
.
x
n
_

_
+
_

_
y
1
y
2
.
.
.
y
n
_

_
=
_

_
x
1
+y
1
x
2
+y
2
.
.
.
x
n
+y
n
_

_
=
_

_
(x
1
+y
1
)
(x
2
+y
2
)
.
.
.
(x
n
+y
n
)
_

_
,
L.H.S. = R.H.S. Hence property (v) is veried.
A1.11
Give the denition of complex linear space C
n
. Also give an example of such complex linear space
and verify that it satises the above denition.
Solution
Denition: A complex linear space C
n
is a vector space over the eld C. The complex linear space
C
n
is a set. The elements of this set are columns of n entries taken from the eld C. And the elements
of C
n
together with vector addition and scalar multiplication (similar to R
n
) satisfy the following
axioms for every x, y, z C
n
and , C with + , . operations:
(i) x +y = y +x, (Commutative),
(ii) (x +y) +z = x + (y +z), (Associative),
(iii) x + 0 = 0 +x = x, (Additive identity),
(iv) x + (1)x = (1)x +x = 0, (Additive inverse),
(v) (x +y) = (x) +(y), (Distributive with respect to vectors),
(vi) ( +)x = (x) + (x), (Distributive with respect to scalars),
(vii) ()x = (x) = (x), (Associative),
(viii) 1.x = x, (Multiplicative identity).
Let C
n
, where n = 1, 2, , be the set of all n-columns of complex numbers. Let x =
_

_
x
1
.
.
.
x
n
_

_, y =
_

_
y
1
.
.
.
y
n
_

_
and z =
_

_
z
1
.
.
.
z
n
_

_ are the elements of C

n
.
Property (i): x +y = y +x,
L.H.S. = x +y =
_

_
x
1
x
2
.
.
.
x
n
_

_
+
_

_
y
1
y
2
.
.
.
y
n
_

_
=
_

_
x
1
+y
1
x
2
+y
2
.
.
.
x
n
+y
n
_

_
14
R.H.S. = y +x =
_

_
y
1
y
2
.
.
.
y
n
_

_
+
_

_
x
1
x
2
.
.
.
x
n
_

_
=
_

_
y
1
+x
1
y
2
+x
2
.
.
.
x
n
+y
n
_

_
=
_

_
x
1
+y
1
x
2
+y
2
.
.
.
x
n
+y
n
_

L.H.S. = R.H.S.
Hence property (i) is veried.
Property (ii): (x +y) +z = x + (y +z),
L.H.S. = x + (y +z) =
_
_
_
_
_
_

_
x
1
x
2
.
.
.
x
n
_

_
+
_

_
y
1
y
2
.
.
.
y
n
_

_
_
_
_
_
_
+
_

_
z
1
z
2
.
.
.
z
n
_

_
=
_

_
x
1
+y
1
x
2
+y
2
.
.
.
x
n
+y
n
_

_
+
_

_
z
1
z
2
.
.
.
z
n
_

_
=
_

_
x
1
+y
1
+z
1
x
2
+y
2
+z
1
.
.
.
x
n
+y
n
+z
1
_

_
R.H.S. = x + (y +z) =
_

_
x
1
x
2
.
.
.
x
n
_

_
+
_
_
_
_
_
_

_
y
1
y
2
.
.
.
y
n
_

_
+
_

_
z
1
z
2
.
.
.
z
n
_

_
_
_
_
_
_
=
_

_
x
1
x
2
.
.
.
x
n
_

_
+
_

_
y
1
+z
1
y
2
+z
2
.
.
.
y
n
+z
n
_

_
=
_

_
x
1
+y
1
+z
1
x
2
+y
2
+z
1
.
.
.
x
n
+y
n
+z
1
_

L.H.S. = R.H.S.
Hence property (ii) is veried.
Property (iii): x + 0 = 0 +x,
L.H.S. = x + 0 =
_

_
x
1
x
2
.
.
.
x
n
_

_
+
_

_
0
0
.
.
.
0
_

_
=
_

_
x
1
+ 0
x
2
+ 0
.
.
.
x
n
+ 0
_

_
=
_

_
x
1
x
2
.
.
.
x
n
_

_
R.H.S. = 0 +x =
_

_
0
0
.
.
.
0
_

_
+
_

_
x
1
x
2
.
.
.
x
n
_

_
=
_

_
0 +x
1
0 +x
2
.
.
.
0 +x
n
_

_
=
_

_
x
1
x
2
.
.
.
x
n
_

L.H.S. = R.H.S.
Hence property (iii) is veried.
Property (iv): x + (1)x = (1)x +x = 0,
L.H.S. = x + (1)x =
_

_
x
1
x
2
.
.
.
x
n
_

_
+ (1)
_

_
x
1
x
2
.
.
.
x
n
_

_
=
_

_
x
1
x
2
.
.
.
x
n
_

_
+
_

_
x
1
x
2
.
.
.
x
n
_

_
=
_

_
x
1
x
1
x
2
x
2
.
.
.
x
n
x
n
_

_
=
_

_
0
0
.
.
.
0
_

_
15
R.H.S. = (1)x +x = (1)
_

_
x
1
x
2
.
.
.
x
n
_

_
+
_

_
x
1
x
2
.
.
.
x
n
_

_
=
_

_
x
1
x
2
.
.
.
x
n
_

_
+
_

_
x
1
x
2
.
.
.
x
n
_

_
=
_

_
x
1
+x
1
x
2
+x
2
.
.
.
x
n
+x
n
_

_
=
_

_
0
0
.
.
.
0
_

L.H.S. = R.H.S.
Hence property (iv) is veried.
Property (v): (x +y) = (x) +(y),
L.H.S. = (x +y) =
_
_
_
_
_
_

_
x
1
x
2
.
.
.
x
n
_

_
+
_

_
y
1
y
2
.
.
.
y
n
_

_
_
_
_
_
_
=
_

_
x
1
+y
1
x
2
+y
2
.
.
.
x
n
+y
n
_

_
=
_

_
(x
1
+y
1
)
(x
2
+y
2
)
.
.
.
(x
n
+y
n
)
_

_
R.H.S. = (x) +(y) =
_

_
x
1
x
2
.
.
.
x
n
_

_
+
_

_
y
1
y
2
.
.
.
y
n
_

_
=
_

_
x
1
x
2
.
.
.
x
n
_

_
+
_

_
y
1
y
2
.
.
.
y
n
_

_
=
_

_
x
1
+y
1
x
2
+y
2
.
.
.
x
n
+y
n
_

_
=
_

_
(x
1
+y
1
)
(x
2
+y
2
)
.
.
.
(x
n
+y
n
)
_

L.H.S. = R.H.S.
Hence property (v) is veried.
Property (vi): ( +)x = (x) + (x),
L.H.S. = ( +)x = ( +)
_

_
x
1
x
2
.
.
.
x
n
_

_
=
_

_
( +)x
1
( +)x
2
.
.
.
( +)x
n
_

_
,
R.H.S. = (x) + (x) =
_
_
_
_
_

_
x
1
x
2
.
.
.
x
n
_

_
_
_
_
_
_
+
_
_
_
_
_

_
x
1
x
2
.
.
.
x
n
_

_
_
_
_
_
_
=
_

_
x
1
x
2
.
.
.
x
n
_

_
+
_

_
x
1
x
2
.
.
.
x
n
_

_
=
_

_
x
1
+x
1
x
2
+x
2
.
.
.
x
n
+x
n
_

_
=
_

_
( +)x
1
( +)x
2
.
.
.
( +)x
n
_

L.H.S. = R.H.S.
Hence property (vi) is veried.
Property (vii): ()x = (x) = (x),
L.H.S. = ()x = ()
_

_
x
1
x
2
.
.
.
x
n
_

_
=
_

_
x
1
x
2
.
.
.
x
n
_

_
16
Middle term = (x) =
_
_
_
_
_

_
x
1
x
2
.
.
.
x
n
_

_
_
_
_
_
_
=
_

_
x
1
x
2
.
.
.
x
n
_

_
=
_

_
x
1
x
2
.
.
.
x
n
_

_
R.H.S. = (x) =
_
_
_
_
_

_
x
1
x
2
.
.
.
x
n
_

_
_
_
_
_
_
=
_

_
x
1
x
2
.
.
.
x
n
_

_
=
_

_
x
1
x
2
.
.
.
x
n
_

_
=
_

_
x
1
x
2
.
.
.
x
n
_

L.H.S. = Middle term = R.H.S.

Hence property (vii) is veried.
Property (viii): 1.x = x,
L.H.S. = 1.x = 1.
_

_
x
1
x
2
.
.
.
x
n
_

_
=
_

_
1.x
1
1.x
2
.
.
.
1.x
n
_

_
=
_

_
x
1
x
2
.
.
.
x
n
_

_
R.H.S. = x =
_

_
x
1
x
2
.
.
.
x
n
_

L.H.S. = R.H.S.
Hence property (viii) is veried.
A1.12
Using x =
_
_
x
1
x
2
x
3
_
_
R
3
, nd
1
,
2
,
3
such that x =
1
_
_
1
0
1
_
_
+
2
_
_
0
1
1
_
_
+
3
_
_
1
0
0
_
_
. Using linear
independence of a = {
_
_
1
0
1
_
_
,
_
_
0
1
1
_
_
,
_
_
1
0
0
_
_
}. What is the property of a ?
Solution
x =
1
_
_
1
0
1
_
_
+
2
_
_
0
1
1
_
_
+
3
_
_
1
0
0
_
_

_
_
x
1
x
2
x
3
_
_
=
_
_
1 0 1
0 1 0
1 1 0
_
_
_
_

3
_
_
17
The above equation is in form of A = x. Augmented matrix:
_
_
1 0 1 : x
1
0 1 0 : x
2
1 1 0 : x
3
_
_
R
3
R
3
R
2
:
_
_
1 0 1 : x
1
0 1 0 : x
2
1 0 0 : x
3
x
2
_
_
R
1
R
3
:
_
_
1 0 0 : x
3
x
2
0 1 0 : x
2
1 0 1 : x
1
_
_
R
3
R
3
R
1
:
_
_
1 0 0 : x
3
x
2
0 1 0 : x
2
0 0 1 : x
1
x
3
+x
2
_
_
Using back substitution,
E
3
:
3
= x
1
x
3
+x
2
,
E
2
:
2
= x
2
,
E
1
:
1
= x
3
x
2
,
=
_
_

3
_
_
=
_
_
x
3
x
2
x
2
x
1
x
3
+x
2
_
_
= x
1
_
_
0
0
1
_
_
+x
2
_
_
1
1
1
_
_
+x
3
_
_
1
0
1
_
_
,
x
f
1
= rst free variable = x
1
,
x
f
2
= second free variable = x
2
,
x
f
3
= third free variable = x
3
,
h
f
1
=
_
_
0
0
1
_
_
; h
f
2
=
_
_
1
1
1
_
_
; h
f
3
=
_
_
1
0
1
_
_
.
Checking linear independence: a = {
_
_
1
0
1
_
_
,
_
_
0
1
1
_
_
,
_
_
1
0
1
_
_
}. Let C
1
, C
2
and C
3
are the real numbers,
C
1
_
_
1
0
1
_
_
+C
2
_
_
0
1
1
_
_
+C
3
_
_
1
0
1
_
_
=
_
_
0
0
0
_
_
,
_
_
1 0 1
0 1 0
1 1 0
_
_
_
_
C
1
C
2
C
3
_
_
=
_
_
0
0
0
_
_
,
From the above results, we get C
1
= C
2
= C
3
= 0. Hence the three vectors
_
_
1
0
1
_
_
,
_
_
0
1
1
_
_
,
_
_
1
0
1
_
_
are
linearly independent. From the above results, it is clear that
(1) every vector in R
3
can be written as linear combination of these three vectors,
(2) these three vectors are linearly independent to each other.
Both these statements imply that these three vectors form a basis of R
3
.
18
A1.13
Determine R, such that b = {
_
_
0
1

_
_
,
_
_

0
1
_
_
,
_
_

1
1 +
_
_
} R
3
, b is a basis of R
3
.
Solution
Checking Linear Independence of Vectors: Let C
1
, C
2
, C
3
be real numbers. Since b is a basis
of R
3
, its elements are linearly independent vectors. So we need trivial solution only for C
1
, C
2
, C
3
for the problem
C
1
_
_
0
1

_
_
+C
2
_
_

0
1
_
_
+C
3
_
_

1
1 +
_
_
=
_
_
0
0
0
_
_
,

_
_
0
1 0 1
1 1 +
_
_
_
_
C
1
C
2
C
3
_
_
=
_
_
0
0
0
_
_
.
Clearly from the given problem
_
_
0
1

_
_
+
_
_

0
1
_
_
=
_
_

1
1 +
_
_
. Hence
1
_
_
0
1

_
_
+ 1
_
_

0
1
_
_
+ (1)
_
_

1
1 +
_
_
=
_
_
0
0
0
_
_
,
So these three vectors are not linearly independent for any value of . Therefore there is no such
value of R for which these three vectors will form a basis of R
3
.
A1.14
Consider the vectors
_

_
1
1
0
0
_

_
,
_

_
1
0
1
0
_

_
,
_

_
1
0
0
1
_

_
,
_

_
0
1
1
0
_

_
,
_

_
0
1
0
1
_

_
and
_

_
0
0
1
1
_

_
.
(i). Is there a subset of the above set of vectors in R
4
which is a basis ?
(ii). Is there another subset (dierent) of vectors in R
4
which is also a basis ?
Solution
For this purpsoe, let us consider a matrix A
46
with each vector which are given in this problem as
column vector of the matrix A.
A =
_

_
1 1 1 0 0 0
1 0 0 1 1 0
0 1 0 1 0 1
0 0 1 0 1 1
_

_
, (6)
(7)
R
2
R
1
+R
2
:
_

_
1 1 1 0 0 0
0 1 1 1 1 0
0 1 0 1 0 1
0 0 1 0 1 1
_

_
,
19
R
2
R
2
+R
4
:
_

_
1 1 1 0 0 0
0 1 0 1 0 1
0 1 0 1 0 1
0 0 1 0 1 1
_

_
,
R
3
R
3
+R
2
:
_

_
1 1 1 0 0 0
0 1 0 1 0 1
0 0 0 0 0 0
0 0 1 0 1 1
_

_
,
R
3
R
4
:
_

_
1 1 1 0 0 0
0 1 0 1 0 1
0 0 1 0 1 1
0 0 0 0 0 0
_

_
,
So the rank of the matrix A is 3. Therefore matrix formed by every combination of four vectors taken
from the given six vectors (i.e.
6
C
4
= 15 combinations) will also have rank = 3.
(i) So every combination of four vectors is linearly dependent set. There is no subset of the given
six vectors which form a basis in R
4
.
(ii) No subset.
A1.15
It was shown in class that
_
_
1
0
0
_
_
,
_
_
0
0
1
_
_
and
_
_
0
1
0
_
_
form a basis of R
3
.
(i). Now, show that
_
_
1
1
1
_
_
,
_
_
1
1
1
_
_
and
_
_
0
0
1
_
_
also form a basis of R
3
.
(ii). Find
1
,
2
,
3
Such that
_
_
1
2
3
_
_
=
1
_
_
1
0
0
_
_
+
2
_
_
0
0
1
_
_
+
3
_
_
0
1
0
_
_
.
(iii). Also nd
1
,
2
,
3
such that
_
_
1
2
3
_
_
=
1
_
_
1
1
1
_
_
+
2
_
_
1
1
1
_
_
+
3
_
_
0
0
1
_
_
.
Solution
(i) Checking Linear Independence of Vectors: Let C
1
, C
2
, C
3
R such that
C
1
_
_
1
1
1
_
_
+C
2
_
_
1
1
1
_
_
+C
3
_
_
0
0
1
_
_
=
_
_
0
0
0
_
_
,

_
_
1 1 0
1 1 0
1 1 1
_
_
_
_
C
1
C
2
C
3
_
_
=
_
_
0
0
0
_
_
.
20
Augmented matrix:
_
_
1 1 0 : 0
1 1 0 : 0
1 1 1 : 0
_
_
,
R
3
R
1
+ (1)R
3
:
_
_
1 1 0 : 0
1 1 0 : 0
0 0 1 : 0
_
_
,
R
2

1
2
(R
1
R
2
) :
_
_
1 1 0 : 0
0 1 0 : 0
0 0 1 : 0
_
_
,
R
1
R
1
R
2
:
_
_
1 0 0 : 0
0 1 0 : 0
0 0 1 : 0
_
_
.
Using back substitution,
C
1
= 0, C
2
= 0, C
3
= 0.
So they are linearly independent vectors.
We now check whether every vector in R
3
can be written as a linear combination of these vectors.
Let
_
_
x
1
x
2
x
3
_
_
be any vector in R
3
. Now C
1
, C
2
, C
3
R be such that
C
1
_
_
1
1
1
_
_
+C
2
_
_
1
1
1
_
_
+C
3
_
_
0
0
1
_
_
=
_
_
x
1
x
2
x
3
_
_
,

_
_
1 1 0
1 1 0
1 1 1
_
_
_
_
C
1
C
2
C
3
_
_
=
_
_
x
1
x
2
x
3
_
_
,
Augmented matrix:
_
_
1 1 0 : x
1
1 1 0 : x
2
1 1 1 : x
3
_
_
,
Gauss Jordan form of this augmented matrix will be the following (same as the above steps). Finally,
we get
_
_
1 0 0 :
x
1
+x
2
2
0 1 0 :
x
1
x
2
2
0 0 1 : x
1
x
3
_
_
,
Using back substitution,
C
1
= x
1
x
3
, C
2
=
x
1
x
2
2
, C
3
=
x
1
+x
2
2
.

C =
_
_
C
1
C
2
C
3
_
_
=
_
_
x
1
+x
2
2
x
1
x
2
2
x
1
x
3
_
_
,
21
Hence, every vector in R
3
can be written as a linear combination of these three vectors.
Combining both statements together, the given set of vectors form a basis of R
3
.
(ii)
_
_
1
2
3
_
_
=
1
_
_
1
0
0
_
_
+
2
_
_
0
0
1
_
_
+
3
_
_
0
1
0
_
_
,

_
_
1
2
3
_
_
=
_
_

1
0
0
_
_
+
_
_
0
0

2
_
_
+
_
_
0

3
0
_
_
,
So, we get

1
= 1,
2
= 3,
3
= 2.
(iii) From
_
_
1
2
3
_
_
=
1
_
_
1
1
1
_
_
+
2
_
_
1
1
1
_
_
+
3
_
_
0
0
1
_
_
,

_
_
1
2
3
_
_
=
_
_
1 1 0
1 1 0
1 1 1
_
_
_
_

3
_
_
,
From the solution of A1.15 (i), we have
x
1
= 1, x
2
= 2, x
3
= 3
or
_
_
x
1
x
2
x
3
_
_
=
_
_
1
2
3
_
_
.
So,

1
=
x
1
+x
2
2
,
2
=
x
1
x
2
2
,
3
= x
1
x
3
,

1
=
3
2
,
2
=
1
2
,
3
= 2.
References
[1] Kreyszig, E., Advanced Engineering Mathematics, Wiley Eastern Pvt. Ltd., New Delhi, 1969.
22