Compare commits

..

2 Commits

Author SHA1 Message Date
Bokuan Li
6a960a6231 Fixed typo in variation function.
All checks were successful
Compile Project / Compile (push) Successful in 23s
2026-04-28 18:05:37 -04:00
Bokuan Li
d187feb618 Fixed partition index typo. 2026-04-28 18:04:05 -04:00
2 changed files with 2 additions and 2 deletions

View File

@@ -29,7 +29,7 @@
is the \textbf{variation function} of $f$ with respect to $\rho$, and:
\begin{enumerate}
\item $T_{f, \rho}: [a, b] \to [0, \infty]$ is a non-negative, non-decreasing function.
\item If $f \in BV([a, b]; E)$, then for any $[c, d] \subset [a, b]$, $[f]_{\text{var}, \rho} = T_{f, \rho}(d) - T_{f, \rho}(a)$.
\item If $f \in BV([a, b]; E)$, then for any $[c, d] \subset [a, b]$, $[f]_{\text{var}, \rho} = T_{f, \rho}(d) - T_{f, \rho}(c)$.
\end{enumerate}
\end{definition}
\begin{proof}

View File

@@ -30,7 +30,7 @@
\begin{definition}[Fine]
\label{definition:partition-refinement}
Let $P = \seqfz[m]{x_j}, Q = \seqfz{y_j} \in \scp([a, b])$, then $Q$ is \textbf{finer} than $P$ if for every $0 \le j \le m$, there exists $0 \le k \le m$ such that $x_j = y_k$. For any $P, Q \in \scp([a, b])$, denote $P \le Q$ if $Q$ is finer than $P$, then
Let $P = \seqfz[m]{x_j}, Q = \seqfz{y_j} \in \scp([a, b])$, then $Q$ is \textbf{finer} than $P$ if for every $0 \le j \le m$, there exists $0 \le k \le n$ such that $x_j = y_k$. For any $P, Q \in \scp([a, b])$, denote $P \le Q$ if $Q$ is finer than $P$, then
\begin{enumerate}
\item $\scp([a, b])$/$\scp_t([a, b])$ equipped with $\le$ is a upward-directed set.
\item If $P \le Q$, then $\sigma(P) \ge \sigma(Q)$.