Merge afb654b458 into 7df93fd855

Fix MD book generation

.github/workflows/book.yml

@@ -12,7 +12,7 @@ jobs:
       - uses: actions/checkout@v3
       - uses: actions-rs/toolchain@v1
         with:
-          toolchain: nightly
+          toolchain: '1.76.0'
           override: true
 
       # - name: Setup mdBook
@@ -26,7 +26,7 @@ jobs:
         uses: actions-rs/cargo@v1
         with:
           command: install
-          args: mdbook --git https://github.com/HollowMan6/mdBook.git --rev 62e01b34c23b957579c04ee1b24b57814ed8a4d5
+          args: mdbook --git https://github.com/HollowMan6/mdBook.git --rev 5830c9555a4dc051675d17f1fcb04dd0920543e8
 
       - name: Install mdbook-katex and mdbook-pdf
         uses: actions-rs/cargo@v1
@@ -40,6 +40,11 @@ jobs:
       - name: Build halo2 book
         run: mdbook build book/
 
+      - uses: actions-rs/toolchain@v1
+        with:
+          toolchain: nightly-2023-10-05 
+          override: true
+
       - name: Build latest rustdocs
         uses: actions-rs/cargo@v1
         with:

book/book.toml

@@ -14,8 +14,6 @@ title = "The halo2 Book"
 macros = "macros.txt"
 renderers = ["html"]
 
-[output.katex]
-
 [output.html]
 
 [output.html.print]

book/src/background/fields.md

@@ -48,7 +48,7 @@ and fewer axioms. They also have an identity, which we'll denote as $1$.
 [group]: https://en.wikipedia.org/wiki/Group_(mathematics)
 [group-axioms]: https://en.wikipedia.org/wiki/Group_(mathematics)#Definition
 
-Any non-zero element $a$ in a group has an _inverse_ $b = a^{-1}$,
+Any element $a$ in a group has an _inverse_ $b = a^{-1}$,
 which is the _unique_ element $b$ such that $a \cdot b = 1$.
      
 For example, the set of nonzero elements of $\mathbb{F}_p$ forms a group, where the
@@ -86,9 +86,9 @@ notation). The order _of the group_ is the number of elements.
 
 Groups always have a [generating set], which is a set of elements such that we can produce
 any element of the group as (in multiplicative terminology) a product of powers of those
-elements. So if the generating set is $g_{1..k}$, we can produce any element of the group
-as $\prod\limits_{i=1}^{k} g_i^{a_i}$. There can be many different generating sets for a
-given group.
+elements. So if the generating set is $g_{1..n}$, we can produce any element of the group
+as $\prod\limits_{i=1}^{n} g_i^{k_i}$ where $k_i \in \mathbb{Z}$. There can be many
+different generating sets for a given group.
 
 [generating set]: https://en.wikipedia.org/wiki/Generating_set_of_a_group
 
@@ -168,7 +168,7 @@ also form a group under $\cdot$.
 
 In the previous section we said that $\alpha$ is a generator of the $(p - 1)$-order
 multiplicative group $\mathbb{F}_p^\times$. This group has _composite_ order, and so by
-the Chinese remainder theorem[^chinese-remainder] it has strict subgroups. As an example
+the Chinese remainder theorem[^chinese-remainder] it has proper subgroups. As an example
 let's imagine that $p = 11$, and so $p - 1$ factors into $5 \cdot 2$. Thus, there is a
 generator $\beta$ of the $5$-order subgroup and a generator $\gamma$ of the $2$-order
 subgroup. All elements in $\mathbb{F}_p^\times$, therefore, can be written uniquely as