English | Español

# Try our Free Online Math Solver! Online Math Solver

 Depdendent Variable

 Number of equations to solve: 23456789
 Equ. #1:
 Equ. #2:

 Equ. #3:

 Equ. #4:

 Equ. #5:

 Equ. #6:

 Equ. #7:

 Equ. #8:

 Equ. #9:

 Solve for:

 Dependent Variable

 Number of inequalities to solve: 23456789
 Ineq. #1:
 Ineq. #2:

 Ineq. #3:

 Ineq. #4:

 Ineq. #5:

 Ineq. #6:

 Ineq. #7:

 Ineq. #8:

 Ineq. #9:

 Solve for:

 Please use this form if you would like to have this math solver on your website, free of charge. Name: Email: Your Website: Msg:

# Math 237 Quiz 10

1. Prove the Solvability Criterion for Systems of Linear Equations .

Solution : The Solvability Criterion for Systems of Linear Equations
says that any system of linear equations AX = B is solvable if and only
if its vector of constants B belongs to the column space of its coefficient
matrix A (see Theorem 1 on p. 73 of the textbook). Suppose that A1,
A2, ..., An are the columns of A (in this order). Then where (see p. 72 of the textbook). So if AX =
B is solvable , then B is contained in the span of the column vectors of A
(= column space of A) and conversely, if B is contained in the column
space of A, then is a solution of AX = B and
therefore AX = B is solvable .

2. Prove the Translation Theorem for Systems of Linear Equations .

Solution : The Translation Theorem for Systems of Linear Equations
says that SB = T + S0 for any particular solution T of the system
AX = B of linear equations . (Here SB denotes the set of solutions of
the system AX = B and T + S0 := {T + Z | Z ∈S0} = {T + Z |
AZ = 0}.) Let us begin by proving the inclusion (see also the
footnote on p. 102 of the textbook). So suppose that S is any solution
of AX = B. Then A(S − T) = AS − AT = B − B = 0 shows
that S − T ∈S0 or equivalently S ∈T + S0. Now let us prove the
reverse inclusion So suppose that S = T + Z with Z ∈S0. Then
AS = A(T + Z) = AT + AZ = B + 0 = B shows that S is a solution
of AX = B.

 Prev Next