Scribd
Upload
377 views

Chapter 1 - Ex 1.1

This document provides an overview of systems of linear equations and matrices. It defines what constitutes a linear equation and system of linear equations. Linear systems can have zero, one, or infinitely many solutions. The document describes how to represent systems of linear equations using matrices and how elementary row operations can be performed on matrices without changing the solution set, allowing the system to be simplified until the number and value of solutions can be determined.

Uploaded by

FAISAL RAHIM
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
377 views

Chapter 1 - Ex 1.1

This document provides an overview of systems of linear equations and matrices. It defines what constitutes a linear equation and system of linear equations. Linear systems can have zero, one, or infinitely many solutions. The document describes how to represent systems of linear equations using matrices and how elementary row operations can be performed on matrices without changing the solution set, allowing the system to be simplified until the number and value of solutions can be determined.

Uploaded by

FAISAL RAHIM
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 20

1

Chapter 1
Systems of Linear Equations and Matrices
Ex 1.1 (Practice Questions 1-14)
Linear Equations
Linear equations are those equations that are of the first order. These equations are defined for lines in
the coordinate system.
A linear equation does not involve any products or roots of variables. All variables occur only to the first power and
do not appear, for example, as arguments of trigonometric, logarithmic, or exponential functions. The following
are linear equations:
Some of the examples of such equations are as follows:
𝑥
2x – 3 = 0, 2y = 8, m + 1 = 0, = 3, 𝑥 + 𝑦 = sin 30, , x + y = 2.
𝑦

In general in two dimensions a line in a rectangular 𝑥𝑦 −coordinate system can be represented by an equation of
the form
𝑎𝑥 + 𝑏𝑦 = 𝑐 (𝑎 and 𝑏 not both 0)
and in three dimensions a plane in a rectangular xyz-coordinate system can be represented by an equation of the
form
𝑎𝑥 + 𝑏𝑦 + 𝑐𝑧 = 𝑑 (𝑎, 𝑏, 𝑐 not all 0)

More generally, we define a linear equation in the 𝑛 variables to be one that can be expressed in the form
𝑎1 𝑥1 + 𝑎2 𝑥2 + 𝑎3 𝑥3 + ⋯ + 𝑎𝑛 𝑥𝑛 = 𝑏 (1)

where 𝑎1 , 𝑎2 , 𝑎3 , … , 𝑎𝑛 and 𝑏 are constants, and the a's are not all zero.
2

In the special case where 𝑏 = 0, Equation 1 has the form


𝑎1 𝑥1 + 𝑎2 𝑥2 + 𝑎3 𝑥3 + ⋯ + 𝑎𝑛 𝑥𝑛 = 0 (2)
which is called a homogeneous linear equation.

The following are not linear equations:


𝑥 + 3𝑦 2 = 4, 3𝑥 + 2𝑦 + 𝑦𝑧 = 8, sin 𝑥 + 𝑦 = 0, √𝑥 + 𝑦 = 9.

System of linear equations


A finite set of linear equations is called a system of linear equations or, more briefly, a linear system.
The variables are called unknowns.

𝑥+𝑦 =3
3

5𝑥 + 9𝑦 = 25
A general linear system of m equations in the n unknowns 𝑥1 , 𝑥2 , 𝑥3 , … , 𝑥𝑛 can be written as
𝑎11 𝑥1 + 𝑎12 𝑥2 + 𝑎13 𝑥3 + ⋯ + 𝑎1𝑛 𝑥𝑛 = 𝑏1
𝑎21 𝑥1 + 𝑎22 𝑥2 + 𝑎23 𝑥3 + ⋯ + 𝑎2𝑛 𝑥𝑛 = 𝑏2
𝑎31 𝑥1 + 𝑎32 𝑥2 + 𝑎33 𝑥3 + ⋯ + 𝑎3𝑛 𝑥𝑛 = 𝑏3
⋮ ⋮ ⋮ ⋮ ⋮
𝑎𝑚1 𝑥1 + 𝑎𝑚2 𝑥2 + 𝑎𝑚3 𝑥3 + ⋯ + 𝑎𝑚𝑛 𝑥𝑛 = 𝑏𝑚

Solution for system of linear equations


A solution of a linear system in n unknowns 𝑥1 , 𝑥2 , 𝑥3 , … , 𝑥𝑛 is a sequence of n numbers
𝑠1 , 𝑠2 , 𝑠3 , … , 𝑠𝑛 for which the substitution
𝑥1 = 𝑠1 , 𝑥2 = 𝑠2 , 𝑥3 = 𝑠3 , … , 𝑥𝑛 = 𝑠𝑛
makes each equation a true statement. Also we can write this solution as (𝑠1 , 𝑠2 , 𝑠3 , … , 𝑠𝑛 ), which is
called ordered n-tuple.

For example the system


5𝑥 + 𝑦 = 3
2𝑥 − 𝑦 = 4
has solution
𝑥 = 1, 𝑦 = −2
Which can be written in more clear form as (1, −2), which is an ordered pair.
4

Linear Systems with Two and Three Unknowns


Linear systems in two unknowns arise in connection with intersections of lines. For example, consider
the linear System
𝑎1 𝑥 + 𝑏1 𝑦 = 𝑐1
𝑎2 𝑥 + 𝑏2 𝑦 = 𝑐2
in which the graphs of the equations are lines in the xy-plane. Each solution (x, y) of this system
corresponds to a point of intersection of the lines, so there are three possibilities (Figure 1.1.1):
5

1. The lines may be parallel and distinct, in which case there is no intersection and consequently no
solution.
2. The lines may intersect at only one point, in which case the system has exactly one solution.
3. The lines may coincide, in which case there are infinitely many points of intersection (the points on the
common line) and consequently infinitely many solutions.

Consistent system
In general, we say that a linear system is consistent if it has at least one solution and inconsistent if it
has no solutions. Thus, a consistent linear system of two equations in two unknowns has either one
solution or infinitely many solutions—there are no other possibilities.
6

(a) 2(3) − 4(1) − (1) = 6 − 4 − 1 = 1


(3) − 3(1) + (1) = 3 − 3 + 1 = 1
3(3) − 5(1) − 3(1) = 9 − 5 − 3 = 1
So given vector is a solution of the given system

(b) 2(3) − 4(−1) − (1) = 6 + 4 − 1 = 9


(3) − 3(−1) + (1) = 3 + 3 + 1 = 7
3(3) − 5(−1) − 3(1) = 9 + 5 − 3 = 11
So given vector is not a solution of the given system

Types of Solution for Linear system


Every system of linear equations has zero (no solution), one (unique solution), or infinitely (parametric)
many solutions. There are no other possibilities.
7
8
9
10
11

Q9
12
13

For example
14
15
16

Elementary row operations


The basic method for solving a linear system is to perform appropriate algebraic operations on the system
that do not alter the solution set and that produce a succession of increasingly simpler systems, until a
point is reached where it can be ascertained whether the system is consistent, and if so, what its solutions
are. Typically, the algebraic operations are as follows:
1. Multiply an equation through by a nonzero constant.
17

2. Interchange two equations.


3. Add a constant times one equation to another.
Since the rows (horizontal lines) of an augmented matrix correspond to the equations in the associated
system, these three operations correspond to the following operations on the rows of the augmented
matrix:
1. Multiply a row through by a nonzero constant.
2. Interchange two rows.
3. Add a constant times one row to another.
These are called elementary row operations on a matrix.
18
19
20

You might also like