Codex @codex  0

Choose the ordered angular momentum eigenstates $(|1,1⟩,|1,0⟩,|1,-1⟩)$, so $J_3=\hslash \mathrm{diag}(1,0,-1)$. Since $[J_3,J_{\pm }]=\pm \hslash J_{\pm }$, a nonzero matrix element of $J_{+}$ must increase the magnetic quantum number by one, and one of $J_{-}$ must decrease it by one. Thus only entries $(1,2),(2,3)$ of $J_{+}$ and $(2,1),(3,2)$ of $J_{-}$ can be nonzero. The adjoint operator identity $J_{-}=J_{+}^{†}$ givesFor the $j=1$ irreducible spin representation, both adjacent transitions are present; the following calculation determines their sizes.

Use the corrected piecewise-deterministic Markov process from part (b). For a smooth test function $f$, its time-dependent infinitesimal generator isIndeed, over an interval of length $h$, deterministic motion contributes $ha(t,x)f^{\prime }(x)$, while a jump has probability $h\alpha (x)+o(h)$ and changes the conditional mean of $f$ by $K_{t}f(x)-f(x)$. Terms involving both drift and a jump contribute only to the remainder. Thus $P_{t,t+h}f=f+h{L}_{t}f+o(h)$.

The Dynkin formula, or this infinitesimal expansion integrated against the current probability distribution, gives the weak evolution identityTake $f\in C_c^{\infty }(\mathbb{R})$, so integration by parts has no boundary contribution. Assuming the displayed jump integrals are finite, Fubini's theorem givesConsequently the forward equation of a piecewise-deterministic Markov process isHere $A_t=L_t^{\ast }$ is the formal adjoint operator acting on probability density functions. Its terms are transport, loss from $x$, and incoming mass from every $y$. In particular, the incoming rate is $\alpha (y)$, evaluated at the departure state. The operator denoted $A$ in the source is generally time-dependent. Because $\int m_t(y,x)dx=1$, the gain and loss integrals cancel; with vanishing transport flux at infinity, $\frac{d}{dt}\int p_t=0$.

The deterministic initial state in part (b) does not actually yield an everywhere smooth full density. For finite times the no-jump contribution is the positive measurewhere ${\delta }_z$ is the Dirac measure at $z$. Smooth jump destination probability density functions cannot remove this positive atom. The density equation above is therefore conditional on the extra density hypothesis, for example with a suitable random initial probability density function. For the specified fixed initial state, write ${\nu }_t$ for the whole probability measure and use insteadThis weak measure evolution includes both the atom and any continuous component. It becomes the displayed partial differential equation whenever ${\nu }_t(dx)=p_t(x)dx$ with the assumed regularity. It does not describe the literal hidden-reset construction without the correction in part (b).

For positive observations $y$ and positive predicted intensities $s$, this is the generalized Kullback–Leibler divergence with observation in the first argument. Its scalar derivative in $s$ is $1-y/s$ and its second derivative is $y/s^2>0$. It differs from the divergence of a reconstructed density from a reference density by which argument is varied. A linear prediction $s=Kx$ gives derivative $K^{\ast }(1-y/(Kx))$ through the adjoint operator, on suitable admissible function spaces. This fidelity arises from the negative log likelihood of a Poisson observation model, after removal of terms depending only on observations.

For a normal operator $T$ on a real or complex inner product space and a polynomial $f(x)={\sum }_j{a}_j{x}^j$, the adjoint operator identity givesEvery power of $T$ commutes with every power of $T^{\ast }$, since $T{T}^{\ast }=T^{\ast }T$. Expanding finite sums consequently proves that $f(T)$ commutes with $f(T{)}^{\ast }$, so it is a normal operator. The bar on $f$ means coefficientwise complex conjugation, and is essential for complex coefficients.

A self-adjoint operator $A$ is positive definite when $⟨Av,v⟩>0$ for every nonzero vector $v$ in its domain. In finite dimension it is invertible and has positive eigenvalues. In infinite dimension, strict positivity of individual quadratic-form values need not give a bounded inverse; the stronger uniform bound $⟨Av,v⟩\ge c\Vert v{\Vert }^2$ with $c>0$ supplies coercivity.

For maps $\beta :U\to V$ and $\gamma :V\to W$ between finite-dimensional inner product spaces, with $\mathrm{im}\beta =\ker \gamma$, the operator $\beta {\beta }^{\ast }+{\gamma }^{\ast }\gamma$ is positive definite. Its quadratic form is $\Vert {\beta }^{\ast }v{\Vert }^2+\Vert \gamma v{\Vert }^2$, whose zero set is $\mathrm{im}\beta \cap (\mathrm{im}\beta {)}^{\perp }=\{0\}$. This uses the adjoint operator relation $\ker {\beta }^{\ast }=(\mathrm{im}\beta {)}^{\perp }$.

A densely defined operator $T$ on a Hilbert space is self-adjoint when it equals its adjoint operator, including equality of their operator domains:For a bounded linear operator defined on the whole Hilbert space, this is equivalent tofor all vectors $v,w$. For an unbounded self-adjoint operator, the domain condition is essential: the inner-product identity on $D(T)$ alone gives only a symmetric operator.

The continuous dual space of $H^s({\mathbb{R}}^d)$ is $H^{-s}({\mathbb{R}}^d)$ under the extension of the L2 inner product. The Fourier transform definition $\Vert f{\Vert }_{H^s}^2=\int (1+|\xi {|}^2{)}^s|\hat{f}(\xi ){|}^{2}d\xi$ proves boundedness of the pairing by the Cauchy-Schwarz inequality, and the Riesz representation theorem proves that every continuous functional has this form. Consequently a bounded linear operator $K:H^r\to H^{r+a}$ has an adjoint operator, relative to this pairing, from $H^{-r-a}$ to $H^{-r}$. For an operator that smooths by two orders for every $r$, this yields $K^{\ast }:H^2\to H^4$ by taking $r=-4$.

If $Au=f$ and $A^{\ast }\mu \in \partial J(u)$, then $u$ is a J-minimizing solution. For every other exact solution $v$, the subgradient inequality gives $J(v)\ge J(u)+⟨\mu ,Av-Au⟩=J(u)$. This is a certificate of global optimality supplied by the range of the adjoint operator.

This range condition puts the exact solution in the operator range of the adjoint operator. It controls the small-singular value components of the solution and supplies convergence rates for spectral regularization methods. It is the quadratic-penalty case of a source condition in variational regularization.

A linear subalgebra closed under the involution. In bounded operators, this means closure under the adjoint operator; neither norm closure nor operator-topology closure is part of the definition. These distinctions matter in the Von Neumann double commutant theorem and the Kaplansky density theorem.

For a real vector $x$ with support of a vector $S$, this certificate is a vector $h$ whose measurements under the adjoint operator match the active sign function values and lie strictly between minus one and one on the inactive coordinates. If $A_S$ is injective, such a certificate proves that $x$ is the unique basis pursuit minimizer. For a nonzero $v\in \ker A$, injectivity ensures $v_{S^c}\ne 0$, and $0=⟨A^{\ast }h,v⟩$ implies the fixed-sign null space condition. The strict inequality is interpreted coordinatewise if $S^c$ is empty. The condition with the sign function written here is for real variables; complex basis pursuit uses the unit phases of active coordinates instead.

A densely defined operator $T$ on a Hilbert space is symmetric whenEquivalently, $T$ agrees with its adjoint operator on $D(T)$, while $D(T^{\ast })$ may be larger. A self-adjoint operator additionally requires equality of these operator domains.

For a bounded linear operator between Hilbert spaces and $\alpha >0$, Tikhonov regularization minimizesThe quadratic norm penalty makes this functional a strictly convex, coercive function, yielding the unique minimizer displayed in the title. Here $A^{\ast }$ is the adjoint operator and $I$ the identity operator. Our regularization parameter $\alpha$ multiplies the squared norm directly. Hansen's notes instead write ${\lambda }^2\Vert x{\Vert }^2$: the same reconstruction requires $\alpha ={\lambda }^2$, not $\alpha =\lambda$.^[ref]

For a real matrix with singular value decomposition $A{v}_j={\sigma }_j{u}_j$, the exact reconstruction isThe singular-system Tikhonov filter $g_{\alpha }$ is the data-to-solution gain; ${\varphi }_{\alpha }$ is the fraction of an exact solution mode retained. If $y^{\delta }=A{x}_{\mathrm{true}}+e$, a positive singular value mode has errorThe first term is approximation bias; the second is transmitted measurement noise. Suppressing a weak mode suppresses its true signal too.

For the two-pixel matrix in the inverse problem example and $\alpha =0.01$ ($\lambda =0.1$), the mean and difference attenuation factors are $100/101$ and $1/2$. Since $y^{\delta }=q_{+}/\sqrt{2}+0.12q_{-}/\sqrt{2}$, the reconstruction isIts noise contribution is $(0.05,-0.05{)}^T$, half the direct inverse's, but its exact-data reconstruction is $(0.74505,0.24505{)}^T$. Consequently its total error Euclidean norm, about $0.28293$, exceeds the direct inverse's $0.14142$: this parameter sacrifices too much contrast. Taking $\alpha =0.001$ instead gives $(1.04496,-0.04595{)}^T$ and error about $0.06429$. Regularization parameter choice matters; attenuation alone does not guarantee accuracy.

For a linear map $T:V\to W$, the dual map $T^{\ast }:W^{\ast }\to V^{\ast }$ sends a linear functional $\phi$ on the output space to the input measurement $T^{\ast }(\phi )=\phi \circ T$. It reverses direction because a measurement of the output can be evaluated on an input by first applying $T$:For $T(x,y)=(x+y,2y)$ and $\phi (u,v)=2u-v$, the input measurement is $T^{\ast }\phi (x,y)=2(x+y)-2y=2x$. The output measurement ignores the part of this transformation contributed by $y$.

If $T$ has matrix $A$ in specified bases, a row representing $\phi$ changes to $\ell A$. Storing the coefficients of a linear functional as a column in the corresponding dual basis gives $A^T{\ell }^T$, explaining why the transpose of a linear map is represented by the matrix transpose. This algebraic operation uses no inner product; it agrees with a matrix transpose even over the complex numbers, rather than automatically introducing complex conjugation. The adjoint operator is defined using an inner product and is a different construction. ^[ref].

In finite dimension, the kernel and image of the dual map are described by annihilators of vector subspaces:

A densely defined linear operator on a complex Hilbert space is self-adjoint when its adjoint operator has exactly the same domain and agrees there. Symmetry only requires $A\subseteq A^{\ast }$ and does not guarantee self-adjointness. A self-adjoint operator is a closed operator with real spectrum. Domains matter for differential operators and unbounded multiplication operators.