Apply suggestions from code review

Co-authored-by: github-actions[bot] <41898282+github-actions[bot]@users.noreply.github.com>

Author: gabrielfrasantos

doc/math/GivensRotation.md

@@ -18,11 +18,11 @@ Applied across a pair of rows, it zeros the target entry while preserving Euclid
 
 ## Complexity Analysis
 
-| Operation      | Time   | Space  | Notes                                   |
-|----------------|--------|--------|-----------------------------------------|
-| ComputeGivens  | $O(1)$ | $O(1)$ | One `sqrt`, two divides                 |
-| ApplyGivens    | $O(1)$ | $O(1)$ | Rotates one scalar pair                 |
-| Rotate two rows| $O(n)$ | $O(1)$ | `ApplyGivens` across `n` columns        |
+| Operation       | Time   | Space  | Notes                            |
+|-----------------|--------|--------|----------------------------------|
+| ComputeGivens   | $O(1)$ | $O(1)$ | One `sqrt`, two divides          |
+| ApplyGivens     | $O(1)$ | $O(1)$ | Rotates one scalar pair          |
+| Rotate two rows | $O(n)$ | $O(1)$ | `ApplyGivens` across `n` columns |
 
 ## Step-by-Step Walkthrough
 

doc/math/HouseholderTransform.md

@@ -18,10 +18,10 @@ $H$ is symmetric and orthogonal ($H = H^\top = H^{-1}$), so applying it is backw
 
 ## Complexity Analysis
 
-| Operation          | Time   | Space  | Notes                                   |
-|--------------------|--------|--------|-----------------------------------------|
-| HouseholderVector  | $O(n)$ | $O(1)$ | Builds `v` (stored implicit unit pivot) |
-| Apply $H$ to a vector | $O(n)$ | $O(1)$ | `x - β·v·(vᵀx)` — never form `H`         |
+| Operation             | Time   | Space  | Notes                                   |
+|-----------------------|--------|--------|-----------------------------------------|
+| HouseholderVector     | $O(n)$ | $O(1)$ | Builds `v` (stored implicit unit pivot) |
+| Apply $H$ to a vector | $O(n)$ | $O(1)$ | `x - β·v·(vᵀx)` — never form `H`        |
 
 ## Step-by-Step Walkthrough
 

doc/math/TriangularSolve.md

@@ -14,9 +14,9 @@ Each unknown depends only on those already computed, so a single reverse sweep s
 
 ## Complexity Analysis
 
-| Operation             | Time     | Space  | Notes                          |
-|-----------------------|----------|--------|--------------------------------|
-| SolveUpperTriangular  | $O(n^2)$ | $O(n)$ | One reverse sweep, stack output |
+| Operation            | Time     | Space  | Notes                           |
+|----------------------|----------|--------|---------------------------------|
+| SolveUpperTriangular | $O(n^2)$ | $O(n)$ | One reverse sweep, stack output |
 
 ## Step-by-Step Walkthrough
 

numerical/math/test/TestTriangularSolve.cpp

@@ -1,5 +1,5 @@
-#include "numerical/math/TriangularSolve.hpp"
 #include "numerical/math/Tolerance.hpp"
+#include "numerical/math/TriangularSolve.hpp"
 #include <gtest/gtest.h>
 
 namespace