[guided]First fix the asymptotic notation. Let $h_n>0$ denote the bandwidth used by the local polynomial estimator at sample size $n$. The expression $o_{\mathbb P}(1)$ denotes a sequence of real-valued random variables converging to $0$ in probability, and $A_n \xrightarrow{\mathbb P} A$ denotes convergence in probability. The theorem uses stochastic standard deviation in the local-polynomial sense: it is the conditional standard deviation given the observed design variables $X_1,\dots,X_n$.
The hypothesis of local polynomial asymptotic normality is precisely the place where the variance calculation enters, but we use more than [weak convergence](/page/Weak%20Convergence) of a normalized estimator. We use the conditional variance expansion included among the local-polynomial asymptotic normality assumptions at the interior point $x$. Those assumptions include the measurability of the data, the fact that $x$ is an interior point, and the design, bandwidth, and moment conditions needed for the conditional variance formula. Therefore there is a finite nonzero deterministic constant $V_{p,\nu}(x)$ for which
\begin{align*}
\operatorname{Var}\!\left(\hat m_p^{(\nu)}(x) \mid X_1,\dots,X_n\right)
=
\frac{V_{p,\nu}(x)}{n h_n^{2\nu+1}}\,(1+o_{\mathbb P}(1)).
\end{align*}
The stochastic standard deviation is the square root of this variance. Since $1+o_{\mathbb P}(1) \xrightarrow{\mathbb P} 1$, the multiplicative factor is positive with probability tending to one; this matches the fact that the left-hand side is a variance and justifies taking the square root on an event whose probability tends to one. On that event, the map $r \mapsto \sqrt r$ is continuous at $r=1$, so the [Continuous Mapping Theorem](/theorems/1847) gives $\sqrt{1+o_{\mathbb P}(1)}=1+o_{\mathbb P}(1)$. Therefore
\begin{align*}
\operatorname{sd}\!\left(\hat m_p^{(\nu)}(x) \mid X_1,\dots,X_n\right)
=
\left[
\frac{V_{p,\nu}(x)}{n h_n^{2\nu+1}}\,(1+o_{\mathbb P}(1))
\right]^{1/2}.
\end{align*}
Equivalently,
\begin{align*}
\operatorname{sd}\!\left(\hat m_p^{(\nu)}(x) \mid X_1,\dots,X_n\right)
=
\sqrt{V_{p,\nu}(x)}\,(n h_n^{2\nu+1})^{-1/2}\,(1+o_{\mathbb P}(1)).
\end{align*}
The factor $\sqrt{V_{p,\nu}(x)}$ depends on fixed features of the problem, such as the kernel, polynomial order, design density, and conditional error variance at $x$, but it does not change with $n$ in the asymptotic order statement. Because $V_{p,\nu}(x)$ is finite and nonzero, multiplication by $\sqrt{V_{p,\nu}(x)}$ changes only the constant.
To connect this variance calculation with the local-polynomial coefficients, let $\hat a_{\nu,n}$ denote the fitted coefficient of the monomial $u^\nu$ when the local polynomial is written in the dimensionless coordinate $u=(t-x)/h_n$. The asymptotic variance representation above is the proof of the stochastic scale; the following rescaling explanation only records why the same exponent appears in local coordinates. A function-value coefficient has effective sample size $n h_n$, and converting the coefficient of $u^\nu$ into the $\nu$th derivative multiplies the fluctuation by $h_n^{-\nu}$, while the Taylor factor $\nu!$ is fixed. Thus
\begin{align*}
h_n^{-\nu}(n h_n)^{-1/2}
=
(nh_n^{2\nu+1})^{-1/2}.
\end{align*}
Hence the stochastic standard deviation has order
\begin{align*}
(nh_n^{2\nu+1})^{-1/2}.
\end{align*}[/guided]