Skip to main content

Section 1.4 Linear Systems with Infinitely-Many Solutions (LE4)

Subsection 1.4.1 Class Activities

Activity 1.4.1.

Consider this simplified linear system found to be equivalent to the system from Activity 1.3.6:

x1+2x2=4+x3=1

Earlier, we determined this system has infinitely-many solutions.

(a)

Let x1=a and write the solution set in the form {[a??]|aR}.

(b)

Let x2=b and write the solution set in the form {[?b?]|bR}.

(c)

Which of these was easier? What features of the RREF matrix [12040011] caused this?

Definition 1.4.2.

Recall that the pivots of a matrix in RREF form are the leading 1s in each non-zero row.

The pivot columns in an augmented matrix correspond to the bound variables in the system of equations (x1,x3 below). The remaining variables are called free variables (x2 below).

[12040011]

To efficiently solve a system in RREF form, assign letters to the free variables, and then solve for the bound variables.

Activity 1.4.3.

Find the solution set for the system

2x12x26x3+x4x5=3x1+x2+3x3x4+2x5=3x12x2x3+x4+x5=2

by doing the following.

(a)

Row-reduce its augmented matrix.

(b)

Assign letters to the free variables (given by the non-pivot columns):

?=a and ?=b.

(c)

Solve for the bound variables (given by the pivot columns) to show that

?=1+5a+2b,

?=1+2a+3b,

and ?=3+3b.

(d)

Replace x1 through x5 with the appropriate expressions of a,b in the following set-builder notation.

{[x1x2x3x4x5]|a,bR}

Remark 1.4.4.

Don't forget to correctly express the solution set of a linear system. Systems with zero or one solutions may be written by listing their elements, while systems with infinitely-many solutions may be written using set-builder notation.

  • Inconsistent: or {} (not 0).

  • Consistent with one solution: e.g. {[123]} (not just [123]).

  • Consistent with infinitely-many solutions: e.g. {[123aa]|aR} (not just [123aa] ).

Activity 1.4.5.

Show how to find the solution set for the vector equation

x1[101]+x2[011]+x3[155]+x4[31313]=[31212].

Activity 1.4.6.

Consider the following system of linear equations.

x12x3=35x1+x27x3=185x1x213x3=12x1+3x2+7x3=12
(a)

Explain how to find a simpler system or vector equation that has the same solution set.

(b)

Explain how to describe this solution set using set notation.

Subsection 1.4.2 Videos

Figure 4. Video: Solving a system of linear equations with infinitely-many solutions

Subsection 1.4.3 Slideshow

Slideshow of activities available at https://teambasedinquirylearning.github.io/linear-algebra/2022/LE4.slides.html.

Exercises 1.4.4 Exercises

Exercises available at https://teambasedinquirylearning.github.io/linear-algebra/2022/exercises/#/bank/LE4/.

Subsection 1.4.5 Mathematical Writing Explorations

Exploration 1.4.7.

Construct a system of 3 equations in 3 variables having:

  • 0 free variables

  • 1 free variable

  • 2 free variables

In each case, solve the system you have created. Conjecture a relationship between the number of free variables and the type of solution set that can be obtained from a given system.

Exploration 1.4.8.

For each of the following, decide if it's true or false. If you think it's true, can we construct a proof? If you think it's false, can we find a counterexample?

  • If the coefficient matrix of a system of linear equations has a pivot in the rightmost column, then the system is inconsistent.

  • If a system of equations has two equations and four unknowns, then it must be consistent.

  • If a system of equations having four equations and three unknowns is consistent, then the solution is unique.

  • Suppose that a linear system has four equations and four unknowns and that the coefficient matrix has four pivots. Then the linear system is consistent and has a unique solution.

  • Suppose that a linear system has five equations and three unknowns and that the coefficient matrix has a pivot in every column. Then the linear system is consistent and has a unique solution.

Subsection 1.4.6 Sample Problem and Solution

Sample problem Example B.1.4.

You have attempted 1 of 1 activities on this page.