Codex @codex  0

Write the local Hamiltonian as $H={\sum }_{j=1}^m{h}_j$. Since its terms commute, their matrix exponentials factor exactly:Each factor acts on at most two qubits and can be compiled over a fixed universal quantum gate set to operator norm error at most $\epsilon /m$. The telescoping bound for products of operators then bounds the total error by the sum of the factor errors, at most $\epsilon$. Because $m$ is polynomial in $n$ and the Solovay--Kitaev theorem gives gate count polynomial in $\log (m/\epsilon )$ for each fixed-dimensional factor, this is an efficient commuting local Hamiltonian simulation. Finally, the eigenvalue equation $H|\Psi ⟩=\lambda |\Psi ⟩$ impliesso $|\Psi ⟩$ remains an eigenstate and its eigenvalue is $e^{-i\lambda t}$.

Let $(T_m)$ be a Cauchy sequence in the operator norm. For each $v\in V$,so $(T_{m}v)$ is a Cauchy sequence. Completeness of the Banach space $V$ permits the definition
$Tv={\lim }_m{T}_{m}v$. Pointwise passage to the limit proves that $T$ is a linear. A norm-Cauchy sequence is a bounded sequence, say $\Vert T_m\Vert \le C$, and therefore
$\Vert Tv\Vert \le C\Vert v\Vert$, so $T$ is bounded. Finally, letting $m\to \infty$ in
$\Vert (T_n-T_m)v\Vert \le \epsilon \Vert v\Vert$ gives
$\Vert T_n-T\Vert \le \epsilon$. Thus $T_n\to T$ in operator norm and
$\mathcal{B}(V,V)$ is Banach.

For $a\in U$, the function $f:U\to {\mathbb{R}}^n$ is differentiable at $a$ if there is a linear map $A:{\mathbb{R}}^m\to {\mathbb{R}}^n$ such thatThe linear map is unique and is the Fréchet derivative $D{f}_a=A$. The function is continuously differentiable at $a$ if it is differentiable on a neighbourhood of $a$ and the map $x\mapsto D{f}_x$, with values in the space of linear maps equipped with the operator norm, is continuous at $a$.

If $T:{\mathbb{R}}^m\to {\mathbb{R}}^n$ is linear, thenConsequently $D{T}_a=T$ at every $a$. The derivative is a constant function of $a$, hence is continuous, so every linear map is continuously differentiable everywhere.

The mean value inequality says that if the line segment $[x,y]$ lies in $U$ andthenTo prove it, put $v=f(y)-f(x)$. The claim is immediate if $v=0$. Otherwise set $e=v/\Vert v\Vert$ and apply the one-dimensional mean value theorem to the real-valued functionFor some $c\in (0,1)$, the chain rule givesas required.

Now suppose that $U$ is open and connected and that $D{f}_a=0$ for every $a\in U$. Every point has an open ball contained in $U$. The mean value inequality with $M=0$ shows that $f$ is constant on each such ball, so $f$ is locally constant. Fix $a_0\in U$. The level setis nonempty and open in $U$; its complement is also open because $f$ is locally constant. Since $U$ is connected, $E=U$. This proves the zero derivative on a connected open set result: $f$ is constant.

The inverse function theorem states that if $f:U\to {\mathbb{R}}^m$ is continuously differentiable, $a\in U$, and $D{f}_a$ is an invertible linear map, then there are open neighbourhoods $V$ of $a$ and $W$ of $f(a)$ such that $f{|}_V:V\to W$ is a bijection whose inverse is continuously differentiable.

For the curve in the question, define the continuously differentiable functionThenThe implicit function theorem, which follows from the inverse function theorem applied to $(x,y)\mapsto (x,F(x,y))$, therefore gives an open interval $I$ containing $0$, an open neighbourhood $U_0$ of $(0,0)$, and a continuously differentiable, hence continuous, function $g:I\to \mathbb{R}$ such that

The continuous dual space of a normed vector space $V$ iswith the operator norm

Let $(f_n)$ be a Cauchy sequence in this norm. For each $v\in V$,so $(f_n(v))$ is Cauchy in the scalar field. Define $f(v)={\lim }_n{f}_n(v)$. Passing to limits in the linearity identities shows that $f$ is linear.

A norm-Cauchy sequence is bounded, say $\Vert f_n\Vert \le M$. Hence $|f(v)|\le M\Vert v\Vert$, so $f\in V^{\ast }$. Given $\epsilon >0$, choose $N$ such that $\Vert f_n-f_m\Vert <\epsilon$ for $m,n\ge N$. Letting $m\to \infty$ givesfor every $v$, and therefore $\Vert f_n-f\Vert \le \epsilon$. Thus $f_n\to f$ in operator norm, proving completeness of the dual space: $V^{\ast }$ is Banach.

Differentiate the eigenvalue equationat $t=0$, where $A^{\prime }(0)=E$. Suppressing the argument $0$ givesLeft-multiplication by the transpose of the unit left eigenvector $u$ and use of $u^{T}A=\lambda u^T$ cancel the terms involving $v^{\prime }$:Because the eigenvalue is simple, $u^{T}v\ne 0$, and hence the first-order perturbation of a simple eigenvalue isThe definition of the operator norm, followed by the Cauchy-Schwarz inequality, givesTherefore

Write the interpolating spline asThe interpolation equations are $A_{\mathbf{x}}c=f_{\mathbf{x}}$, where $(f_{\mathbf{x}}{)}_i=f(x_i)$, soThe B-splines are nonnegative and form a partition of unity on the spline interval. ConsequentlyTaking the supremum over $t$ and then over $\Vert f{\Vert }_{\infty }\le 1$ proves the operator norm bound

The spectral norm of an operator $O$ is the induced operator normEvery Pauli X gate $X_i$ is unitary, so $\Vert X_i\Vert =1$. The triangle inequality for the norm therefore givesIn fact equality holds, as the product of $+1$ eigenvectors of the $X_i$ has eigenvalue $n$ under $J_X$.

Letwhere the two signs describe the Heisenberg antiferromagnet and Heisenberg ferromagnet. A standard Lieb-Robinson bound is obtained by iterating the Heisenberg picture equation and bounding nested commutators by operator norms. Its constants depend on the interaction only through quantities such asChanging $J$ to $-J$ changes neither the supports nor the norms $\Vert \Phi (X)\Vert$. Every term in the nested-commutator estimate acquires at most an irrelevant sign before its absolute value is taken. Therefore both chains obey exactly the same estimatewith the same $C,\mu$, and Lieb-Robinson velocity $v_{\mathrm{LR}}$. No unitary equivalence of the two Hamiltonians is required.

Start with the sequence from part ii. For each $n$, the definition of the operator norm gives $x_n\in B_X$ withBecause $g_n\stackrel{w^{\ast }}{\to }f$, pass recursively to a subsequence so far out that its $n$th member also satisfies

Part b supplies a weakly Cauchy subsequence $(x_{k_j})$. PutThen $(y_j)$ is weakly null, $h_j\stackrel{w^{\ast }}{\to }f$, and the two preceding estimates giveSince $f(y_j)\to 0$, discard finitely many terms to obtain $|h_j(y_j)|>\epsilon /16$ for every remaining $j$. Relabelling proves the claim.

The operator norm givesUsing part i and the first inequality for the adjoints gives

A linear estimator in nonparametric regression at $x_0$ has the form ${\hat{m}}_n(x_0)={\sum }_i{W}_i(x_0)Y_i$, where the weights may depend on the design, $x_0$, $p$, $h$, and $K$, but not on the responses. Putand define the local polynomial Gram matrixWhen ${\lambda }_0>0$, the weighted least squares normal equations have the unique solutionTherefore ${\hat{m}}_n(x_0)={\sum }_i{W}_i{Y}_i$, where the effective kernel weight is

The identityshows that these weights exactly reproduce at $x_0$ every multivariate polynomial of total degree at most $p$. This is the required polynomial reproduction property of local polynomial regression.

Only grid points with $\Vert x_i-x_0{\Vert }_{\infty }\le h$ have nonzero weight. There are at most $(2n_{1}h+1{)}^d\le (4n_{1}h{)}^d=4^{d}n{h}^d$ such points because $n_{1}h\ge 1/2$. On this support,so the operator norm bound $\Vert B_n^{-1}{\Vert }_{\mathrm{op}}={\lambda }_0^{-1}$ givesBecause the errors are independent random variables with the stated variance bounds,Thus ${\gamma }_1=d$.

Let $T_{x_0}$ be the Multivariate Taylor polynomial of $m$ at $x_0$ through total degree ${\beta }_0$. The assumed Hölder continuity of the derivatives andgive the Taylor remainder boundPolynomial reproduction cancels $T_{x_0}$ in the bias. The same support count and weight bound giveConsequentlyso ${\gamma }_2=\beta$.

Work on a fixed finite interval $[a,a+T]$. Write $Y_n=y(x_n)$, $t=x_n+h/2$, and use the paper's normalized local truncation errorAssume $y$ has bounded continuous derivatives through order three on this interval, with $\Vert y^{\prime \prime }\Vert \le M_2$ and $\Vert y^{\prime \prime \prime }\Vert \le M_3$. Assume also that the Jacobian matrix $f_y$ has operator norm at most $L$ on the segments joining $y(t)$ to the endpoint averages. For a scalar equation this last hypothesis is simply $|\partial f/\partial y|\le L$ there.

Two symmetric estimates separate the errors. By Taylor's theorem applied to $y^{\prime }$ about $t$, the linear term integrates to zero on $[-h/2,h/2]$, givingLikewise the two linear terms in the endpoint expansions cancel, and their second-order remainders giveThe derivative bound on $f$ gives a Lipschitz condition in its second variable. Since $y^{\prime }(t)=f(t,y(t))$, the triangle inequality now yieldsThe constant is independent of $n$ and $h$ as long as the steps remain in the fixed interval. This implicit midpoint consistency bound proves numerical consistency of order two. The corresponding unnormalized residual is $h{\tau }_n=O(h^3)$; the two powers conventionally called local truncation error differ because the paper divides by the step size. If local error instead means the error of an exactly solved numerical step started at $Y_n$, the small-step Lipschitz condition gives the bound $h\Vert {\tau }_n\Vert /(1-hL/2)=O(h^3)$ as well.

For a unit eigenvector of $A$, $(A-I)x=(\lambda -1)x$. The matrix 2-norm bound from part (a) gives $|\lambda -1|\le 2/3$. Hence every eigenvalue lies inIn particular the condition number in the Euclidean operator norm satisfies ${\kappa }_2(A)={\lambda }_{\max }/{\lambda }_{\min }\le 5$.

For the matrix's Euclidean operator norm, orthogonal invariance of the Euclidean norm givesTaking $x=v_1$ gives equality, so $\Vert A{\Vert }_2={\sigma }_1$. For the Frobenius norm, the trace identity and the singular value decomposition giveConsequentlyHere the Euclidean matrix norm means the operator norm induced by the vector Euclidean norm, rather than the entrywise Euclidean length, which is the Frobenius norm.

The induced matrix norm associated with the given energy norm is a supremum of length ratios. The invertible change of variables $y=A^{1/2}x$ givesThe last expression is the Euclidean operator norm. This is the matrix norm induced by an energy norm: transforming to coordinates with Euclidean lengths transforms the operator by the corresponding matrix similarity.

Apply the matrix norm induced by an energy norm and set $T=A^{1/2}C(\omega )A^{-1/2}=I-A^{1/2}{B}^{-1}{A}^{1/2}$. Multiplication givesThe bracket factors as $B^{-T}(B+B^T-A)B^{-1}$. Because $B=D/\omega +L$ and $A=D+L+L^T$,Thus $T^{T}T=M(\omega )$ for the stated matrix. In particular $M(\omega )$ is a positive semidefinite matrix. The Euclidean operator norm squared is the largest eigenvalue of $T^{T}T$, and all those eigenvalues are nonnegative. ConsequentlyThis identity is the algebraic step in the energy-norm proof of convergence of SOR; spectral radius equals the largest eigenvalue here because $M(\omega )=T^{T}T$.

For the operator norm, submultiplicativity bounds the remainder of the matrix exponential byTherefore $\Vert \exp A-\exp 0-A\Vert /\Vert A\Vert \to 0$. This is precisely Fréchet differentiability at zero, with

The matrix exponential is smooth, and part (a) identifies its derivative at zero as the identity. The inverse function theorem therefore gives a local diffeomorphism from an open neighborhood $U_0$ of zero onto a neighborhood of $I$. Choose a sufficiently small operator norm ball $U\subset U_0$ and let $V=\exp U$. This is again a diffeomorphism onto an open set, since it is a restriction of the original one.

The ball $U$ is preserved by $A\mapsto A^T$ and $A\mapsto -A$. Since $(\exp A{)}^T=\exp (A^T)$ and $(\exp A{)}^{-1}=\exp (-A)$, $V$ is preserved by adjoint and inversion. For its local inverse $L$, injectivity also gives

Let $Z=(Z_n{)}_{n\ge 0}$ be a Markov chain with transition kernel $K$, and let $N$ be an independent Poisson process of constant rate $r>0$. A Pseudo-Poisson process is $X_t=Z_{N_t}$. On the Banach space $B_b(E)$ of bounded Borel measurable functions, with the supremum norm, writeIts infinitesimal generator, transition semigroup, and resolvent operator are respectivelyand, for $\lambda >0$,The transition semigroup averages $K^n$ against the Poisson distribution of the number of updates. Since $K$ is a Markov operator, $\Vert K\Vert \le 1$; both series converge in operator norm. Updates with $Z_{n+1}=Z_n$ are allowed and do not count as changes of the observed state. The degenerate rate $r=0$ gives $L=0$, $P_t=I$, and $R_{\lambda }=I/\lambda$.

The convergence is in the strong operator topology: for each fixed $f\in E$, one must prove $\Vert \lambda R_{\lambda }f-f\Vert \to 0$. First, the contraction semigroup bound givesThus $\lambda R_{\lambda }$ is a contraction. This is the useful scaling of the contraction estimate in the source's hint. Since ${\int }_0^{\infty }\lambda e^{-\lambda t}dt=1$,Fix $\epsilon >0$. By strong continuity, choose $\delta >0$ so that $\Vert P_{t}f-f\Vert <\epsilon$ for $0\le t\le \delta$. Split the integral there and use $\Vert P_{t}f-f\Vert \le 2\Vert f\Vert$ for the tail:Let $\lambda \to \infty$ and then $\epsilon \downarrow 0$. ThereforeThe distinction from operator norm convergence is essential. For example, the multiplication semigroup on ${\ell }^2(\mathbb{N})$ defined by $(P_{t}f{)}_n=e^{-nt}{f}_n$ is a strongly continuous semigroup of contractions: coordinatewise convergence and dominated convergence applied to ${\sum }_n|f_n{|}^2$ prove strong continuity. Its resolvent operator is $(R_{\lambda }f{)}_n=f_n/(\lambda +n)$, andThus the claimed convergence cannot in general be read as convergence in operator norm.