Fixed more mistakes in the dyadic rational numbers.
All checks were successful
Compile Project / Compile (push) Successful in 21s

This commit is contained in:
Bokuan Li
2026-03-21 19:35:12 -04:00
parent 50c231f543
commit 73ceab0a6d
2 changed files with 10 additions and 3 deletions

View File

@@ -44,10 +44,10 @@
\item[(b)] For each $x, y \in G$, $x + y \ge x, y$.
\end{enumerate}
For each $x \in \mathbb{D} \cap [0, 1)$, let $\phi(x) = \sum_{n \in M(x)}g_n$, then
For each $x \in \mathbb{D} \cap (0, 1)$, let $\phi(x) = \sum_{n \in M(x)}g_n$, then
\begin{enumerate}
\item For any $x, y \in \mathbb{D} \cap [0, 1)$ such that $x + y \in [0, 1)$, $\phi(x) + \phi(y) \le \phi(x + y)$.
\item For any $x, y \in \mathbb{D} \cap [0, 1)$ with $x \le y$, $\phi(x) \le \phi(y)$.
\item For any $x, y \in \mathbb{D} \cap (0, 1)$ such that $x + y \in (0, 1)$, $\phi(x) + \phi(y) \le \phi(x + y)$.
\item For any $x, y \in \mathbb{D} \cap (0, 1)$ with $x \le y$, $\phi(x) \le \phi(y)$.
\end{enumerate}
\end{proposition}
\begin{proof}

View File

@@ -68,3 +68,10 @@
Therefore there exists pairs $\bracs{(x_k, y_k)|1 \le k \le N}$ such that $\norm{f(x_k) - f(y_k)}_E \ge 1/n$ for all $n$, and the smallest interval containing each $(x_k, y_k)$ are pairwise disjoint. Thus $[f]_{\text{var}} \ge N/n$ for all $N \in \nat^+$, so $[f]_{\text{var}} = \infty$.
\end{proof}
\begin{proposition}
\label{proposition:bounded-variation-one-side-limit}
\end{proposition}