Linear Equations and Matrix Elimination Methods and Matrix Echelon Forms

Characteristics of Linear and Nonlinear Equations

• Definition and Verification of Linear Equations

  • A linear equation is characterized by the variables having a power of exactly one. For example, in an equation with variables $x_{}$, $y_{}$, and $z_{}$, each must be raised to the power of one ($power = 1$).

  • Coefficients can be any real number ($ℝ$), complex number ($ℂ$), or values from a finite field ($ℤ_p$ where $p$ is a prime number). Even complex or transcendental numbers can serve as coefficients without violating linearity.

  • Examples of valid coefficients mentioned: $√{2}$, $\sin(\frac{\pi}{5})$, and $\frac{\pi}{4}$.

• Criteria for Nonlinearity

  • An equation is non-linear if it contains any of the following:

    • Products of variables: For example, $xy$.

    • Powers of variables: For example, $x^2$ or $y^2$.

    • Ratios/Reciprocals: For example, $\frac{x}{y}$.

    • Roots: For example, $\sqrt{x}$.

    • Functions of variables: Transcendental functions like $\sin(x)$, $\tan(x)$, or exponential forms like $e^x$.

Solutions to Linear Equations and Systems

• Definition of a Solution

  • A solution is a set of values (a point or a vector) that, when substituted into the variables of the equation, satisfies the equality.

  • For a system of multiple equations, a given point must satisfy every equation in the system to be considered a solution for that system.

• Case Study check: Solution Verification

  • Equation: $3x - 4y = -1$

  • Point $(5, 4)$: Substituting gives $3(5) - 4(4) = 15 - 16 = -1$. Because it equals the right side, it is a solution.

  • Point $(1, 1)$: Substituting gives $3(1) - 4(1) = 3 - 4 = -1$. This is also a solution.

• Infinite Solutions and Free Variables

  • An equation with more variables than constraints often has infinitely many solutions. This introduces the concept of free variables (historically called "dummy variables").

  • Parametric Form Example: In $3x - 4y = -1$, we can solve for one variable in terms of the other:

    • $3x = 4y - 1 \rightarrow x = \frac{4y - 1}{3}$

    • If we let $y = t$ (where $t$ is a parameter), then $x = \frac{4t - 1}{3}$.

    • By choosing any value for $t$, such as $t = 0$ or $t = 1$, we generate different specific solutions on the line.

• Multiple Free Variables

  • Example: $x_1 + x_2 + 2x_3 = 3$

  • Here there are three unknowns and only one equation. We designate two free variables.

  • Solving for $x_1$: $x_1 = -x_2 - 2x_3 + 3$

  • Let $x_3 = t$ and $x_2 = s$.

  • The solution set in vector form: $\begin{pmatrix} x_1 \\ x_2 \\ x_3 \end{pmatrix} = \begin{pmatrix} -s - 2t + 3 \\ s \\ t \end{pmatrix}$.

Systems of Linear Equations

• Definition and Vector Representation

  • A system of linear equations is a finite set of linear equations using the same variables.

  • Solutions are often expressed as vectors. A point $(2, 3)$ can be represented as a positional vector with its tail at the origin and its head at the point.

• Three Possible Solution Outcomes

  1. Unique Solution: The lines (or planes) intersect at exactly one point. The system is consistent.

  2. Infinitely Many Solutions: The equations represent the same line or plane (they are "coincidental" or "coterminal"). The system is consistent.

  3. No Solution: The lines are parallel and never intersect. Solving the system leads to a logical contradiction, such as $0 = 2$. This system is inconsistent.

Augmented Matrices and Row Operations

• Matrix Representations

  • Computers prefer working with coefficients rather than variables.

  • Coefficient Matrix: A matrix ($A$) containing only the coefficients of the variables.

  • Augmented Matrix: A matrix containing the coefficient matrix and an additional column ($b$) for the constants on the right side of the equations, often separated by a vertical line: $[A | b]$.

• Elementary Row Operations

  • These operations allow us to transform a system into an equivalent system (one with the same solution set):

    1. Interchanging Two Rows: Notated as $R_i \leftrightarrow R_j$.

    2. Multiplying a Row by a Non-zero Constant: Notated as $k R_i$.

    3. Adding a Multiple of One Row to Another: Adding $k$ times row $j$ to row $i$.

• Row Echelon Form (REF)

  • A matrix is in Row Echelon Form if:

    1. Any rows consisting entirely of zeros are at the bottom.

    2. The first non-zero entry in a row (the leading entry or pivot) is in a column to the left of any leading entries below it.

  • Use of the term "Echelon": Derived from a German descriptor for "staircase." Mentioned in the context of buildings near Mopac and 183 in Austin that vary in elevation.

• Reduced Row Echelon Form (RREF)

  • A matrix is in RREF if it satisfies REF conditions plus:

    1. The leading entry in every non-zero row is a 1 (called a "leading one").

    2. Every column containing a leading one has zeros everywhere else in that column.

  • Reaching RREF is the goal of Gauss-Jordan Elimination.

Advanced Linear Algebra Concepts

• The Rank of a Matrix

  • The rank ($r$) of a matrix is the number of non-zero rows in its row echelon form.

• The Rank Theorem

  • For a consistent system with $n$ variables and a coefficient matrix of rank $r$:

  • $\text{Number of Free Variables} = n - r$

  • If $n = r$, the system has a unique solution (zero free variables).

• Gaussian Elimination vs. Gauss-Jordan Elimination

  • Gaussian Elimination: Transforming the matrix to Row Echelon Form and then using back substitution to find the variable values.

  • Gauss-Jordan Elimination: Transforming the matrix all the way to Reduced Row Echelon Form, where the solutions can be read directly from the augmented column.

• Homogeneous Systems

  • A system is homogeneous if the right-hand constant side is all zeros ($Ax = 0$).

  • These systems are always consistent because they have at least the trivial solution ($0, 0, \dots, 0$).

  • If the number of variables ($n$) is greater than the number of equations ($m$), the homogeneous system must have infinitely many solutions.

• Linear Systems in $\u2124_p$ (Finite Fields)

  • Solving systems using modular arithmetic (e.g., Modulo 3: $\u2124_3$ where values are limited to ${0, 1, 2}$).

  • Example in $\u2124_3$: Since negation is different, we often add multiples to reach zero. For example, if we have a coefficient of $2$, adding $1$ results in $3 \equiv 0 \pmod{3}$.

Questions & Discussion

• Question on Zero Rows: Can two rows have the same number of leading zeros?

• Answer: If they have the same number of leading zeros, they are not yet in echelon form. You must perform further row operations to eliminate the leading entry of the lower row to create more zeros, eventually pushing the row with the most zeros to the bottom.

• Logistics: The professor checked attendance using a 5-minute launch window and noted that the first exam is scheduled for Wednesday of next week, covering materials up to section 2.4.