Scribd
Upload
17 views

Tutorial-1

The document outlines a tutorial for a Linear Algebra course at IIT Ropar, led by Instructor Manmohan Vashisth. It includes a series of problems related to solving linear systems using Gauss-Jordan elimination, exploring properties of binary operations, and investigating matrix operations. The tutorial covers various mathematical concepts, including consistency of systems, existence of solutions, and properties of operations on sets.

Uploaded by

2023chb1060
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
17 views

Tutorial-1

The document outlines a tutorial for a Linear Algebra course at IIT Ropar, led by Instructor Manmohan Vashisth. It includes a series of problems related to solving linear systems using Gauss-Jordan elimination, exploring properties of binary operations, and investigating matrix operations. The tutorial covers various mathematical concepts, including consistency of systems, existence of solutions, and properties of operations on sets.

Uploaded by

2023chb1060
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 3

Department of Mathematics, IIT Ropar, India

Instructor: Manmohan Vashisth


TA: Vinay Rana and Priya Jain

Tutorial 1
Linear Algebra, Integral Transforms and Special Functions
(MA102)
1. Use Gauss-Jordan elimination to solve the following linear systems.

(a)

x1 − 4x2 − x3 + x4 = 3
2x1 − 8x2 + x3 − 4x4 = 9
−x1 + 4x2 − 2x3 + 5x4 = −6.

(b)

x1 − 2x2 − x3 =1
2x1 − 3x2 + x3 =6
3x1 − 5x2 =7
x1 + 5x3 = 9.

(c)

3x1 − x2 + x3 − x4 + 2x5 =5
x1 − x2 − x3 − 2x4 − x5 =2
5x1 − 2x2 + x3 − 3x4 + 3x5 = 10
2x1 − x2 − 2x4 + x5 = 5.

2. Is the following system

x1 − 2x2 + x3 + 2x4 = 1
x1 + x2 − x3 + x4 = 2
x1 + 7x2 − 5x3 − x4 = 3.

consistent? If so, find the solutions by using the Gaussian elimination method.

3. Choose h and k such that the following system

x1 + 3x2 = 2
3x1 + hx2 = k

has (a) no solution, (b) unique solution, and (c) many solutions. Justify your answer
for each part.

4. If [A|b1 ] and [B|b2 ] are two row-equivalent matrices, then show that the non-homogeneous
systems of linear equations AX = b1 and BX = b2 have exactly the same solutions.
5. Let
 
3 −1 2
A = 2 1 1 .
1 −3 0
 
y1
For which triples (y1 , y2 , y3 ) does the system AX = Y have a solution, where Y = y2 ?

y3
6. Prove that a consistent linear system of equations in n unknowns can have either a
unique or infinitely many solutions.

7. Given a polynomial p(x) and a square matrix A, let p(A) denote the matrix obtained
by ‘substituting’ A for the variable x. Thus, if p(x) = a0 + a1 x + · · · + ak xk , then
p(A) = a0 I + a1 A + · · · ak Ak . Given polynomials p and q, show that
(i) (p + q)(A) = p(A) + q(A) and
(ii) (pq)(A) = p(A)q(A).

(Definition: A binary operation ∗ on a set S is a mapping of the elements of the Cartesian


product S × S to S. Hence a ∗ b ∈ S, for all a, b ∈ S.

• We say ∗ is commutative if a ∗ b = b ∗ a, for all a, b ∈ S.


• We say ∗ is associative if a ∗ (b ∗ c) = (a ∗ b) ∗ c, for all a, b, c ∈ S.
• We say there exists an identity element if there exists 1S ∈ S such that a ∗ 1S =
1S ∗ a = a, for all a ∈ S.
• We say a ∈ S is invertible if there exists b ∈ S such that a ∗ b = b ∗ a = 1S .)

8. Let N be the set of natural numbers. For a, b ∈ N, define a ∗ b = a − b. Show that ∗ is


not a binary operation on N.

9. Let Z be the set of integers. For a, b ∈ Z, define a ∗ b = a − b. Show that ∗ is a binary


operation on Z but it is not commutative.

10. Let ∗ be a binary operation on a nonempty set S. Then show that identity element for
∗ if it exists is unique.

11. Let R+ := {x ∈ R : x > 0}. For a, b ∈ R+ define a ∗ b := ab . Then show that ∗ is a


binary operation on R+ and answer the following.

(a) Is ∗ commutative?
(b) Is ∗ associative?
(c) Does there exist an identity element for ∗ on R+ ?

12. Let R+ := {x ∈ R : x > 0}. For a, b ∈ R+ define a ∗ b := ab. Then show that ∗ is a
binary operation on R+ and answer the following.

(a) Is ∗ commutative?
(b) Is ∗ associative?
(c) Does there exist an identity element for ∗ on R+ ?
(d) Which elements of R+ have inverse w.r.t. ∗?

13. Let Mn (R) denote the set of all n × n matrices with real entries. For A, B ∈ Mn (R)
define A ∗ B := AB, where AB stands for the usual multiplication of matrices A and
B. Then show that ∗ is a binary operation on Mn (R) and answer the following.

(a) Is ∗ commutative?
(b) Is ∗ associative?
(c) Does there exist an identity element for ∗ on Mn (R)?
(d) Which elements of Mn (R) have inverse w.r.t. ∗?

14. Let Rn := {x := (x1 , x2 , · · · , xn ) : xi ∈ R, 1 ≤ i ≤ n}. For x, y ∈ Rn and α ∈ R define

x ⊕ y := (x1 + y1 , x2 + y2 , · · · , xn + yn ), and
α ⊙ x := (αx1 , αx2 , · · · , αxn ).

Then show that ⊕ is a binary operation on Rn and α ⊙ x ∈ Rn for all α ∈ R and


x ∈ Rn . Also, prove the following.

(a) ⊕ is commutative.
(b) ⊕ is associative.
(c) There exists an identity element in Rn w.r.t. ⊕.
(d) Show that each element of Rn has an inverse w.r.t. ⊕.
(e) Show that (α + β) ⊙ x = α ⊙ x ⊕ β ⊙ y, for all α, β ∈ R and x ∈ Rn .
(f) Show that there exists an α ∈ R such that α ⊙ x = x, for all x ∈ Rn .

You might also like