25. Solutions of Linear Systems: Existence, Uniqueness, General Form

A system of linear equations is a collection of equations involving the same set of variables. The general form of a system with m equations and n unknowns is:

a x + a x + ⋯+ a x = b 11 1 12 2 1n n 1 a x + a x + ⋯+ a x = b 21 1 22 2 2n n 2 ⋮ a x + a x + ⋯+ a x = b m1 1 m2 2 mn n m

This can be compactly written in matrix form as:

Ax = b

Where:

• A is an m×n matrix of coefficients.
• x ∈ R^n is the vector of unknowns.
• b ∈ R^m is the right-hand side vector.

In this chunk, we define a system of linear equations, which is a set of equations involving the same variables. For instance, in a situation where you have three equations and three unknowns, the system might look like three different ways to express a relationship between the same three variables. All of these equations can be organized into a matrix form, which simplifies calculations significantly in linear algebra. Here, 'A' represents the matrix of coefficients that corresponds to the variables 'x,' and 'b' represents the output of each equation.

Imagine you're trying to solve a puzzle with different pieces that each represent a relationship (the equations). The variables are like the pieces that fit together to form the final picture (the solution). The matrix form is like organizing your puzzle pieces in a neat box, making it easier to see how they match up.

A system of linear equations may have:

• No solution: The system is inconsistent.
• Exactly one solution: The system is consistent and independent.
• Infinitely many solutions: The system is consistent but dependent.

The nature of the solution depends on:

• The rank of the matrix A,
• The rank of the augmented matrix [A|b],
• The number of variables n.

This chunk discusses the types of solutions a linear system can have. A system can either be inconsistent (no solution), have a unique solution, or have infinitely many solutions. The classification of the solutions is based on the rank of the matrices, which indicates the number of linearly independent rows (or equations) in the matrix. Essentially, rank helps us understand how much information we have in our equations, and consequently, what kind of solutions we can expect.

Think of a college admission process as an analogy for these solutions. If the criteria (equations) don't match (inconsistent), no one can get in. If the school accepts one student who meets all requirements (one unique solution), that's straightforward. But if many students meet the criteria (infinitely many solutions), the school might have various ways to choose among eligible candidates.

A system Ax = b has at least one solution (i.e., it is consistent) if and only if: Rank(A) = Rank([A|b]) If this condition is not satisfied, the system has no solution.

This chunk states that for a linear system to have at least one solution, the rank of the coefficient matrix must equal the rank of the augmented matrix. In simpler terms, this means that the information (rank) contained in the coefficients needs to match the information in the entire system, including the outputs. If they do not match, it indicates that the equations contact contradictory information, resulting in no solutions.

Consider trying to find a meeting time for a group of people with conflicting schedules. If their available times don't overlap (the ranks don't match), no time can be set (no solution). But if at least some schedules align (ranks match), a time can be found.

If a solution exists and the rank of A equals the number of unknowns n (i.e., the matrix is of full column rank), then the solution is unique. If Rank(A) = n, then the system has a unique solution. In other words:

• For square systems (m = n): If det(A) ≠ 0, the system has a unique solution.
• For rectangular systems (m ≠ n): Use rank conditions.

Here, we explore when a system has a unique solution. If the rank of the coefficient matrix matches the number of unknowns, the system will have a unique solution. For square systems (same number of equations as unknowns), if the determinant of the matrix is not zero, this further confirms uniqueness. In contrast, for systems with a different number of equations and variables, we rely on rank conditions to determine the uniqueness of solutions.

Think of trying to navigate a new city with a GPS (the equations) that only provides one route to your destination (the unique solution). If there are multiple paths that might lead you there (more variables), the conditions must line up so that you trust the GPS directions and don’t get lost.

Homogeneous Systems If b = 0, the system is homogeneous: Ax = 0

• The trivial solution x = 0 always exists.
• If Rank(A) < n, then there are infinitely many non-trivial solutions.
• The solution set forms a vector subspace of R^n called the null space or kernel of A.

Non-Homogeneous Systems For b ≠ 0, if a particular solution x_p exists, then the general solution is given by: x = x_p + x_h Where:

• x_p: A particular solution.
• x_h: General solution of the homogeneous system Ax = 0. This means every solution of the non-homogeneous system is a sum of one particular solution and all solutions of the associated homogeneous system.

This chunk presents the general forms of solutions for both homogeneous and non-homogeneous systems. A homogeneous system has a solution of zero and potentially more if the rank condition is met. Non-homogeneous systems build upon a known solution and add to it the solutions from the associated homogeneous system. This structure helps organize and understand the variety of solutions that can exist.

Think of a chef preparing a dish (the particular solution) and then adding spices and herbs (the solutions of the homogeneous system) to enhance flavor. No matter the dish's base, the additional flavors (non-homogeneous solutions) create a unique experience, yet simultaneously stem from a consistent foundation.

--