0% found this document useful (0 votes)
15 views

Linear Algebra

The document discusses methods for manipulating matrices in linear algebra without altering their solution sets, including row swapping, multiplying by non-zero constants, and adding multiples of rows. It provides examples to illustrate that these operations maintain the integrity of the solution set, even when contradictions arise. Ultimately, it emphasizes that the order of equations and certain operations do not affect the solutions of a linear system.

Uploaded by

eleanorasbrand
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
0% found this document useful (0 votes)
15 views

Linear Algebra

The document discusses methods for manipulating matrices in linear algebra without altering their solution sets, including row swapping, multiplying by non-zero constants, and adding multiples of rows. It provides examples to illustrate that these operations maintain the integrity of the solution set, even when contradictions arise. Ultimately, it emphasizes that the order of equations and certain operations do not affect the solutions of a linear system.

Uploaded by

eleanorasbrand
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/ 5

HW2-Linear Algebra Ele Asbrand

(oue 9/13)

[]
This
system can be

rewritten as the
following
matrix- >

of In order to find a simpler matrix with the same solutions we can use a combination of the
following methods to arrange equations
differently without
changing the solution set of any one equation or of the system :
There operations

3
(RFR
change the
I
Swapping rows in the Matrix do not
solution set of a
2 .

multiplying single a now


by a non-zero constant (nR + R ., no system because they
all maintain an identical ratio between
3 .

adding a constant multiple of one row to another


(nRs + R- R.
) sides of the
equal sign before and after
completion.
Here is a demonstration of this :

(Rs

[]
If we subtract now two

from Rs and insert that into


R3 ,
we can reduce I"Killi S

numbers in Rs to be O (zero) .

This will result in a simpler linear


↓ -

system
-
.

3-RR
&

-
] There we have a simpler linear
syren .a

-
- - - -

b) We can write the matrix as


with variables once
a
system
again
:

X .
-

x + xz =
4 It doesn't take scrutinous observation
I

-
contradiction.
x2 2xz -
= -
to discover this
logical
0 =
23
-

Any time
linear
we find a contradiction
know it must not have
in a

system we

X + xz 5xz 0
,
-
=
any solutions. Thus, this system N
solutions
has .
I
Rs- R+ &z R+ R
. " 32 + R

I
.

[0 3)
(0 ) [a
. 20
:
0
-

12

RREF ,
U 0 - -
1

001

R, R igR-Rz

[00 ])
o
:
Rz Rz + &z -
I
-

3Rz + RzRz
(
/ I Get Ry R 223 -

R3 + Ry + Ry
2232

% [

I
Rs 2Rz + Rs

7
+
-

ReRz

10 R .
+ Rz + R ,

RREF~
%

I cat
"Tige
R .
-

222 + R
-
3+ 4/z =

I (
/zRz + Ra

100
RREF v
ar R

I
, b) 322- Ra
equation matrix
switching two rows of a matrix
multiplying an in a
by
will
et
never
change theswitches
solution A constant will never
change
its solution set
- because it only because each Vector in the equation is
the order of equations it does factor, and ratio
multiplied by a common a
,

notchange the retof na


aform .
betweensideofthe e signisset will

I
The solution set depends only on

the equations themselves ,


not
remain
unchanged .

their order
.
An example of this :

Here
[Y/)
example of this :
is an
we'll find the volutiona

will find the


solution set
set for our
original matrix :


We
now , then after we witch

I
4 -

>
R. F Rs to show that it
4x +
2x) =

I
,

doesn't
change : -
2x -

Xa = 3


Xe = 2 -
2x ,
6x. + 2x b

=
=

* + k +
4x3 · solution set

b
-
2x -
(2 2x , ) =
3
2x2
-
=
,
-
-

run
ir solution
= -
2 + x. = 3
2 = 3

3RztRzG(t /X EX xE0]
-

R ESRs ·
I
.

E
.
,




3 4xz 1
+ + = -

G3 3 4xz
+ = -

1
3
-

3
-

-
[Y24
4xz 4
and we'll findhe e
= -

Xz = -

/
/
Xz solution set for our
augmented one
= -

(
will solve
>
I
now we
4 -
for the solution set
4x
,
+
2x) =

once 6x 3a =
9
again
-

:
-

Xe = 2 -
2x ,

2x2 =
-6 · solution set

-

6x -
3(2 2x,) - =
9

-
6X . +
2x2 = k ir solution =x -

64x. =
9

6=9

G(t x)(X=X x 0]
-

=
E
,
,

↑ ↑
I
Set is
3 4xz 1
+ + = -

G
4xz
3
identical.
+ 1
These solution ats
= -

3 are ,
again
-


-

,
These solution sets

umuplyingarouaa
4

we'rehow
4xz = -

are identical and thus


,
Xz = -

/ Xz = -
/
we've shown switching - set of the Matrix

I
order does not
.

equation
change the solution of a

system of equations ,
GRz- R + R .

Subtracting one now of a matrix from


another will not change it's solution

set because we know that if a = b


and c=d then , a tc = bid This is .

the same as :

a = b
#
c = d

if we call a = b R, and c = d Rz , then


it must be valid to add or subtract them
.

Here is an example of this


concept :

11 Solving for the solution


j

32 set before

Rs-R
performing
. Rs :

xz = 2
3x ,
+
2xz =
7 >
-

3(1) + 2(2) = 7
X = 1

4=
3 +

twecane
rer
3
V

[i]
and after
R. solving performing
2 -

+R :

xz = 2
3x ,
+
2xz =
7 + X. -
(2) = -

x x = -
1
X 1
-

-
2 = -

.
+ 2 + 2
X
.
= 1


3(y + 2(2) =
7
Again, we observe the
3 + 4 =
7
solution set to r 7 =
7 ~
be :

/
The solution set remains unchanged
in our , our augmentation
example
is valid .

You might also like