Math Solver & Algebra

In secondary mathematics and advanced computational engineering, solving multi-variable systems of equations represents a fundamental problem. A **system of linear equations** is a collection of two or more equations containing multiple common variables. Solving these systems requires identifying the unique intersection point where all equations are satisfied simultaneously. While substitution and elimination are effective for simple systems, high-dimensional arrays require robust algorithmic frameworks: **Cramer's Rule** and **Matrix Algebra**.

---

🧮 Cramer's Rule: Deconstructing Determinants

Cramer's Rule is an explicit formula for solving systems of linear equations using determinants. Established by the mathematician Gabriel Cramer in **1750**, the method replaces matrix columns with constants vectors to solve variable values directly.

Consider a standard 2x2 linear system:
$$\begin{cases} a_1x + b_1y = c_1 \\ a_2x + b_2y = c_2 \end{cases}$$

The primary system determinant ($D$), representing the area multiplier of the linear transformation, is evaluated as:
$$D = \det\begin{bmatrix} a_1 & b_1 \\ a_2 & b_2 \end{bmatrix} = a_1b_2 - a_2b_1$$

The sub-determinants $D_x$ and $D_y$ are constructed by substituting the constants vector $\begin{bmatrix} c_1 \\ c_2 \end{bmatrix}$ into the $x$-column and $y$-column, respectively:
$$D_x = \det\begin{bmatrix} c_1 & b_1 \\ c_2 & b_2 \end{bmatrix} = c_1b_2 - c_2b_1$$ $$D_y = \det\begin{bmatrix} a_1 & c_1 \\ a_2 & c_2 \end{bmatrix} = a_1c_2 - a_2c_1$$

If $D \ne 0$, the system is consistent and has a unique solution solved by:
$$x = \frac{D_x}{D}, \quad y = \frac{D_y}{D}$$

Cramer's rule extends seamlessly to 3x3 systems using **Sarrus' Rule** or Laplace expansions to solve $D, D_x, D_y, D_z$.

---

📐 Geometrical Interpretations: Slopes & Intersections

Geometrically, each 2-variable linear equation represents a straight line in a two-dimensional Cartesian plane. The slopes and positions of these lines are defined by their coefficients:

• Consistent Systems ($D \ne 0$): The two lines possess different slopes. They intersect at exactly **one unique coordinate point** ($x, y$), which represents the only solution.
• Parallel Systems ($D = 0, D_x \ne 0$): The lines have identical slopes but different $y$-intercepts. The lines run parallel and will **never cross**, producing a system with **no solution**.
• Coincident Systems ($D = 0, D_x = 0$): The lines have identical slopes and intercepts, representing the **same line**. They overlap completely, yielding **infinitely many solutions**.

---

🌌 Matrix Operations & Linear Transformations

Beyond equation solving, **Matrix Algebra** represents the backbone of computer graphics, physics simulations, and quantum mechanics. In a 2x2 matrix product, Matrix A and Matrix B are combined by evaluating the dot products of rows and columns:

$$\begin{bmatrix} a_{11} & a_{12} \\ a_{21} & a_{22} \end{bmatrix} \times \begin{bmatrix} b_{11} & b_{12} \\ b_{21} & b_{22} \end{bmatrix} = \begin{bmatrix} a_{11}b_{11} + a_{12}b_{21} & a_{11}b_{12} + a_{12}b_{22} \\ a_{21}b_{11} + a_{22}b_{21} & a_{21}b_{12} + a_{22}b_{22} \end{bmatrix}$$

This operation is not commutative ($A \times B \ne B \times A$), meaning order is critical. In computational fields, these matrices are used to transform coordinate systems, representing scaling, rotation, and shear vectors in digital assets.