Skip to content

Commit 5b295ba

Browse files
committed
Fixed leq
1 parent 4e485c9 commit 5b295ba

File tree

3 files changed

+3
-3
lines changed

3 files changed

+3
-3
lines changed

content/posts/elo-system-gradient/index.md

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -34,7 +34,7 @@ $$
3434
(x, y) \in R \vdash xRy,
3535
$$
3636

37-
we are an example away from making sense. In particular, consider $R = \\, <$ (less-than). When we say things like "$x < y$," we are in fact using syntactic sugar for "$(x, y) \in \\, <$." With this in mind, we can take a look at [partial orders](https://en.wikipedia.org/wiki/Partially_ordered_set).
37+
we are an example away from making sense. In particular, consider $R = \\, \leq$ (less-than). When we say things like "$x \leq y$," we are in fact using syntactic sugar for "$(x, y) \in \\, \leq$." With this in mind, we can take a look at [partial orders](https://en.wikipedia.org/wiki/Partially_ordered_set).
3838

3939
{{% hint title="Definition" %}}
4040

public/index.xml

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -113,7 +113,7 @@ We will replace that with its formal meaning, which is a specific kind of &lt;a
113113
&lt;p&gt;This should seem odd, as a subset is in no obvious way reminiscent of a permutation. But introducing some new syntax to indicate membership in a relation,&lt;/p&gt;
114114
$$
115115
(x, y) \in R \vdash xRy,
116-
$$&lt;p&gt;we are an example away from making sense. In particular, consider $R = \, &amp;lt;$ (less-than). When we say things like &amp;ldquo;$x &amp;lt; y$,&amp;rdquo; we are in fact using syntactic sugar for &amp;ldquo;$(x, y) \in \, &amp;lt;$.&amp;rdquo; With this in mind, we can take a look at &lt;a href=&#34;https://en.wikipedia.org/wiki/Partially_ordered_set&#34;&gt;partial orders&lt;/a&gt;.&lt;/p&gt;
116+
$$&lt;p&gt;we are an example away from making sense. In particular, consider $R = \, \leq$ (less-than). When we say things like &amp;ldquo;$x \leq y$,&amp;rdquo; we are in fact using syntactic sugar for &amp;ldquo;$(x, y) \in \, \leq$.&amp;rdquo; With this in mind, we can take a look at &lt;a href=&#34;https://en.wikipedia.org/wiki/Partially_ordered_set&#34;&gt;partial orders&lt;/a&gt;.&lt;/p&gt;
117117
&lt;style&gt;
118118
.box-body &gt; :last-child {
119119
margin-bottom: 0 !important;

public/the-elo-rating-system-through-likelihood-gradient-ascent/index.html

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -140,7 +140,7 @@ <h3 id="mathematical-orderings">Mathematical Orderings</h3>
140140
<p>This should seem odd, as a subset is in no obvious way reminiscent of a permutation. But introducing some new syntax to indicate membership in a relation,</p>
141141
$$
142142
(x, y) \in R \vdash xRy,
143-
$$<p>we are an example away from making sense. In particular, consider $R = \, &lt;$ (less-than). When we say things like &ldquo;$x &lt; y$,&rdquo; we are in fact using syntactic sugar for &ldquo;$(x, y) \in \, &lt;$.&rdquo; With this in mind, we can take a look at <a href="https://en.wikipedia.org/wiki/Partially_ordered_set">partial orders</a>.</p>
143+
$$<p>we are an example away from making sense. In particular, consider $R = \, \leq$ (less-than). When we say things like &ldquo;$x \leq y$,&rdquo; we are in fact using syntactic sugar for &ldquo;$(x, y) \in \, \leq$.&rdquo; With this in mind, we can take a look at <a href="https://en.wikipedia.org/wiki/Partially_ordered_set">partial orders</a>.</p>
144144
<style>
145145
.box-body > :last-child {
146146
margin-bottom: 0 !important;

0 commit comments

Comments
 (0)