From 8c04cb9cb7b67b27f6604a32a50f5bada2ef62a7 Mon Sep 17 00:00:00 2001
From: Jaron Kent-Dobias <jaron@kent-dobias.com>
Date: Fri, 2 Sep 2022 14:39:23 +0200
Subject: Fixed some wording in FRSB section.

---
 frsb_kac-rice.tex | 8 ++++----
 1 file changed, 4 insertions(+), 4 deletions(-)

(limited to 'frsb_kac-rice.tex')

diff --git a/frsb_kac-rice.tex b/frsb_kac-rice.tex
index 7b6575c..875d5a9 100644
--- a/frsb_kac-rice.tex
+++ b/frsb_kac-rice.tex
@@ -724,9 +724,9 @@ sufficiently close to the correct answer. This is the strategy we use in
 \label{sec:frsb}
 
 This reasoning applies equally well to FRSB systems. In the end, when the
-limit of $n\to0$ is taken, each can be represented in the canonical way by its
-diagonal and a continuous function on the domain $[0,1]$ which parameterizes
-each of its rows, with
+limit of $n\to0$ is taken, each matrix field can be represented in the
+canonical way by its diagonal and a continuous function on the domain $[0,1]$
+which parameterizes each of its rows, with
 \begin{align}
   C\;\leftrightarrow\;[c_d, c(x)]
   &&
@@ -735,7 +735,7 @@ each of its rows, with
   D\;\leftrightarrow\;[d_d, d(x)]
 \end{align}
 The algebra of hierarchical matrices under this continuous parameterization is
-review in \S\ref{sec:dict}.  The complexity becomes
+reviewed in \S\ref{sec:dict}.  With these substitutions, the complexity becomes
 \begin{equation}
   \begin{aligned}
     \Sigma(E,\mu^*)
-- 
cgit v1.2.3-70-g09d2

