Adjusted citation formats. Moved citation off of named theorems if possible.
All checks were successful
Compile Project / Compile (push) Successful in 22s
All checks were successful
Compile Project / Compile (push) Successful in 22s
This commit is contained in:
@@ -15,7 +15,7 @@
|
||||
Let $x = x_{n_1} + \limv{N}\sum_{k = 1}^N (x_{n_{k+1}} - x_{n_k})$, then $x = \limv{k}x_{n_k} \in E$. Since $\seq{x_n}$ is a Cauchy sequence that admits a convergent subsequence, it is convergent.
|
||||
\end{proof}
|
||||
|
||||
\begin{theorem}[Successive Approximations {{\cite[Section III.2]{SchaeferWolff}}}]
|
||||
\begin{theorem}[Successive Approximations]
|
||||
\label{theorem:successive-approximations}
|
||||
Let $E, F$ be metric TVSs over $K \in \RC$ with pseudonorm $\rho$ and $\eta$, respectively. Let $T \in L(E; F)$, $r > 0$, $\gamma \in (0, 1)$, and $C \ge 0$. Suppose that for every $y \in B_F(0, r)$, there exists $x \in E$ such that:
|
||||
\begin{enumerate}
|
||||
@@ -33,7 +33,7 @@
|
||||
\]
|
||||
|
||||
\end{theorem}
|
||||
\begin{proof}
|
||||
\begin{proof}[Proof {{\cite[Section III.2]{SchaeferWolff}}}. ]
|
||||
Let $y_0 = y$ and $x_0 = 0$. Let $N \in \natz$ and suppose inductively that $\seqf[N]{x_n} \subset E$ has been constructed such that:
|
||||
\begin{enumerate}
|
||||
\item[(I)] $\sum_{n = 1}^N\rho(x_n) \le C\eta(y)\sum_{n = 0}^{N-1}\gamma^{n}$.
|
||||
|
||||
Reference in New Issue
Block a user