We prove compact perturbation invariance of Fredholm operators using a two-sided inverse modulo compact operators. If is Fredholm, decompose
The restriction of from to its closed range is a bounded bijection, so the bounded inverse theorem supplies a bounded inverse there. Extend that inverse by zero on to obtain a bounded operator . If are the orthogonal projections onto and , respectively, then
Both and have finite rank.
Set . Products of a compact operator and a bounded operator are compact: on one side compactness preserves compact images, and on the other the bounded operator maps the unit ball into a bounded ball. Hence
where are compact.
Here is why these identities force to be Fredholm. On , , so part (a) and compactness make finite-dimensional. There is a positive constant with
Otherwise unit vectors could satisfy . From and compactness, a subsequence would converge strongly to a unit vector with , which is impossible. The lower bound proves closed range: for a convergent sequence , first discard the kernel components, then the remaining are Cauchy and their limit maps to the desired range limit.
For finite codimension, take the adjoint operator of , giving . The operator is compact: the finite-rank approximation proved in part (e) gives finite-rank adjoints converging in operator norm to , and norm limits of compact operators are compact. On , , so this kernel is finite-dimensional. Finally,
Because the range is closed, its cokernel is isomorphic to this finite-dimensional orthogonal complement. This verifies all three Fredholm operator conditions for .
For the converse, start with and perturb by the compact operator . Therefore is Fredholm if and only if is Fredholm, with no self-adjointness assumption.
Let be the strict dual certificate for basis pursuit supplied by condition (ii). For , we have
Here the adjoint operator is the real transpose. The injectivity of ensures : otherwise would force . Thus at least one nonzero term lies outside the support of a vector . Since at every such index,
This proves the fixed-sign null space condition, so part (a) gives uniqueness in basis pursuit. If is empty, the injectivity of instead means there is no nonzero null space vector, and the feasible set is a singleton. Injective active columns and a strict dual certificate for basis pursuit ensure unique recovery. Both ingredients matter: strictness outside cannot detect a nonzero null space direction supported entirely inside .
Interpret the angle as the directed subspace angle defined by the infimum of projected unit vectors; it is different from the smallest angle between two subspaces. Write
Consider the bounded linear operator given by . Its adjoint operator, between these two Hilbert spaces, is : for and , the orthogonal projections give . The two positive directed subspace angle cosines yield
The first bound makes injective and gives a closed range. Explicitly, if converges, then , so is a Cauchy sequence. The closed subspace of a Hilbert space is complete, and its limit maps to the proposed range limit. The second bound gives . A vector orthogonal to the range has , so it must be zero. The range is therefore dense as well as closed in , and is onto. This is the mechanism of invertibility from lower bounds on an operator and its adjoint.
For any , choose the unique with . Then , so . Moreover, if , then and hence . Every vector has a unique decomposition, and
The direct sum is a topological one as well: the component depends boundedly on , with operator norm at most .
For precision, the quoted equality of the norms of complementary oblique projections needs both summands nonzero. For example, with , and , the oblique projection is , so but . The secant function has value one here, so the second equality in the quoted formula fails. With nonzero complementary summands its intended version is valid. The proof above does not use that formula. The angle itself is undefined on a zero source space because it has no unit vectors; expressing the hypotheses as the two lower bounds handles zero spaces without ambiguity.
It is enough to prove the stronger planar Kakeya maximal function bound
We first work with a -separated net of unoriented directions , with . Write for angular distance modulo . Choose arbitrary length-one, width- rectangles in these directions. The permitted rectangle intersection fact is
The first alternative includes parallel rectangles. Their locations are arbitrary; only separation of their directions matters.
Define , and put . With these weights the adjoint operator is . Since a separated angular net has only a bounded number of directions at each distance scale from , its overlap matrix satisfies
The diagonal term is of size . Using and symmetry gives the Schur test estimate
By duality of Lp spaces, . This is uniform over every choice of the translated rectangles. For each direction choose a rectangle approaching the supremum for , then take the limit. That gives the same estimate for the discretized Kakeya maximal function.
To recover all directions, partition the direction circle into arcs of length comparable to , each with a net direction. A tube in an arc is contained in a rectangle in its net direction with width and length at most two. A bounded subdivision in the length direction reduces this to the same averaging operators; the wider tubes obey the same overlap estimate with fixed-factor changes. Therefore
Finally for every . The planar Kakeya maximal estimate therefore has the required arbitrary small power loss.
Interpret the printed Euclidean norm literally on the full vector array . It is a single global norm, not the sum of pixelwise gradient lengths in discrete isotropic total variation. Set and let be its exact adjoint operator for the chosen difference and boundary conventions. The closed dual ball and its image signal are
The set is nonempty, convex and compact, hence closed, because it is a linear image signal of a compact ball in finite dimensions. Euclidean norm duality gives
the support function of .
The metric projection onto a closed convex set uniquely minimizes over . Its variational characterization of convex projection says
Put . This inequality says precisely that . For any , the primal energy satisfies
Completing the square shows that the right side is uniquely minimized by . At that point the inequality is equality, so
This also follows from the proximal operator of a support function and Moreau decomposition: the convex conjugate of is the indicator functional of a constraint set for . The squared fidelity is strictly convex and coercive, so the primal minimizer exists and is unique.
The convex projection in this formula is the removed component , not generally itself. A metric convex projection onto one fixed closed convex set is idempotent. On a right singular vector direction with positive singular value of any nonzero , this denoising map reduces to soft thresholding with a positive threshold, and applying it twice shrinks again. It therefore cannot be such a convex projection for all data. This qualifies the printed convex projection wording while giving the required global gradient-norm projection residual.
Compute by solving the convex dual least-squares problem
Its gradient is and has Lipschitz constant . Projected gradient descent gives
For fixed , the finite-dimensional projected-gradient convergence theorem ensures that converges to a dual minimizer. Reconstruct ; its limit is the unique primal solution even if dual minimizers are nonunique. If , the primal solution is simply and no iteration is needed. For unit-grid forward differences with periodic or zero-difference boundaries, , so is sufficient. Grid-spacing factors or other boundary stencils change this bound.
The normalization here is global. If a pixelwise sum of gradient lengths had instead been intended, the dual feasible set would be a product of pixelwise balls and convex projection would normalize each block separately; it is a different regularizer and should not be silently substituted.
For the discrete Hessian-norm denoising variant, write and use
This is again a compact convex image signal of a Euclidean ball, now under the second-difference adjoint. In suitable conventions is a discrete double divergence, but its exact boundary adjoint is what defines the set. It lies in , so components in are preserved by denoising. Interior second derivatives annihilate affine image signals; whether all such image signals remain in the kernel depends on the boundary convention. With a pixelwise Hessian norm, the corresponding balls would instead be four-component blocks.
Use real differential forms and the usual convention that a smooth manifold has no boundary unless one is specified. On a noncompact manifold the formal-adjoint identity below uses compactly supported forms. On a compact manifold it has no boundary contribution; if a boundary were allowed, extra boundary conditions would be necessary.
The Riemannian metric gives the dual inner product on and hence the inner product on exterior powers of a cotangent space:
Extend this bilinearly. Equivalently, the increasing wedge products of an orthonormal coframe are an orthonormal basis of . The Hodge star operator is the unique map satisfying . If is a positively oriented orthonormal coframe, . Moving the factors of across the factors of its complement changes the sign by , so
The basis formula also proves that is an isometry.
For and with compactly supported product, the Stokes theorem and the Leibniz rule for the exterior derivative give
Thus . The formal adjoint operator satisfies . Applying the inverse star and its square on degree gives the codifferential
The exponent is congruent to modulo two, so this convention is consistent in every degree. Define the Hodge Laplacian by and a harmonic differential form by . On a compact manifold,
Both nonnegative terms vanish for a harmonic form, giving . Conversely these two equations imply harmonicity.
Now let . The printed eigenvalue relation omits the subscript on its right-hand side; the intended equation is . On two-forms , so
These are respectively self-dual two-forms and anti-self-dual two-forms, and sum to . Their uniqueness follows because the and eigenspaces have zero intersection. Star is an orthogonal involution here, hence is self-adjoint and its opposite eigenspaces are orthogonal.
For closed two-forms define . Adding to changes the integral by ; adding an exact form to has the same effect. This is the real de Rham intersection form in dimension four. The wedge product of differential forms in degrees two and two is symmetric because ; hence is a symmetric bilinear form on .
In four dimensions in every degree. If is a harmonic two-form, gives , and gives . Thus is harmonic, and is the harmonic star-eigenspace decomposition. Use the permitted unique harmonic representative for each de Rham cohomology class. For harmonic ,
The mixed terms vanish by orthogonality. The first restriction is positive definite and the second negative definite. In particular a nonzero harmonic has , proving nondegeneracy. Hence the signature of the intersection form from harmonic duality is
The finite dimensions and the harmonic description also follow from the Hodge decomposition theorem.
For completeness, the Hodge decomposition theorem on a compact oriented Riemannian manifold without boundary states the finite-dimensional harmonic space and the -orthogonal direct sum
The three summand components are unique, although their potentials need not be. Given an exact three-form on , decompose its smooth two-form potential as , with . Since and , . Put . In dimension four, , and on two-forms gives , so . Consequently
This constructs a self-dual primitive of an exact three-form. The sum contains no factor : it is twice the self-dual projection of the coexact potential. Using the unscaled projection alone would give . This proves the final unheaded request.
Consider the operators on all of or , extending the displayed positive-function formula linearly. Here is the space of continuous functions vanishing at infinity. The multiplier has modulus at most one, so , and multiplication of exponentials gives and . For strong continuity on , choose a compact outside which is small. On the continuous is bounded, making uniform; outside , . For , use pointwise convergence and the dominated convergence theorem with bound . Thus both are contraction semigroups, even when is unbounded.
The generator of a multiplication semigroup is
Indeed pointwise difference quotients converge to . A norm limit therefore forces the displayed domain condition, using an almost-everywhere convergent subsequence for the case. Conversely , so the dominated convergence theorem proves the limit when . In write the error as times , with the value at supplied by continuity. That second factor tends uniformly to zero where is bounded and has modulus at most one; the compact-set and small-tail argument applied to proves uniform convergence. To prove directly that is a closed operator, take and . Pointwise limits in , or a common almost-everywhere convergent subsequence in , give . Thus is in the appropriate generator domain and . In the domain is dense because ; in compactly supported continuous functions are a dense subspace contained in the domain.
A real multiplication operator on its maximal domain is an unbounded self-adjoint operator. One direct verification is to test the adjoint relation against functions supported on . If is in the adjoint operator domain with representing vector , those tests force on each such set, hence . The converse follows by integration. On the sigma-finite measure spaces used below, the spectrum of a real multiplication operator is its essential range; spectral values are detected by unit vectors supported where the multiplier is arbitrarily close to that value, while outside the essential range its reciprocal is a bounded resolvent multiplier.
For the heat semigroup on , take the normalization . The unitary Fourier transform converts it to multiplication by , and converts the semigroup to multiplication by . Consequently
The Sobolev space domain is exactly . The continuous spectrum comes from the full essential range of , not from square-integrable Fourier eigenvectors.
For the Ornstein-Uhlenbeck semigroup on standard Gaussian measure, the normalized Probabilists' Hermite polynomials form an orthonormal basis. The construction below gives and , so the Hermite coefficient map turns it into a real multiplication operator on . Therefore
Finally, the heat semigroup on the whole real line has no positive spectral gap, whereas the standard Ornstein-Uhlenbeck semigroup has gap one. For the first claim, take a nonzero smooth compactly supported and set . Then , but . This disproves a uniform whole-line Poincare inequality ; one can also choose . Lebesgue measure here is infinite, so it has no normalized probability mean to subtract. For Gaussian measure, the Hermite expansion instead gives the sharp Gaussian Poincaré inequality
Equality holds for affine functions. The identity on the right is interpreted on the energy-form domain, which is larger than the full operator domain.
For noisy data, exact equality may be impossible: the data can have a component outside the operator range. A least-squares solution of a linear inverse problem instead minimizes
For any variation , the adjoint operator gives
Thus statistical homogeneity in every direction is the normal equation for a linear inverse problem, . It is also sufficient for a global minimum: when it holds,
The residual is orthogonal to the closure of the range, since it lies in . A normal-equation solution therefore fits the component of the data representable by the forward map, while leaving the perpendicular component unfitted. If there is more than one such solution, select the minimum-norm least-squares solution, which lies in .
These facts explain the formulation, but do not make the inverse problem well posed. A compact operator of infinite rank typically has nonclosed operator range, so even the least-squares infimum need not be attained. A least-squares solution exists exactly when the orthogonal projection of onto belongs to . In a singular system of a compact operator, this becomes the Picard criterion. Also, the nonzero eigenvalues of are the squares of the singular values of : solving the operator normal equation directly can worsen numerical conditioning. The operator normal equation expresses least squares; it does not itself regularize the inverse problem. The subsequent finite Landweber iteration and its stopping rule provide the inverse-problem regularization.
Use an inner product linear in the first variable. For each , the bounded linear functional is represented uniquely by a vector under the Riesz representation theorem, so . Uniqueness and the conjugate-linearity in the second argument imply . Furthermore
Thus the adjoint operator exists, is linear and bounded, and is unique because a vector orthogonal to every is zero.
A normal operator satisfies . The unilateral unilateral shift operator on is bounded but not normal: , whereas . For general ,
Normality implies equality of norms. Conversely equality for every makes this self-adjoint operator's quadratic form zero; the polarization identity then gives .
An approximate eigenvalue has unit vectors with . It is necessarily in the spectrum, since a bounded inverse would prevent this. Conversely suppose is not an approximate eigenvalue. Then is bounded below, . It is injective and has closed range: a convergent sequence forces to be Cauchy. The operator is normal, so and . The identity makes its range dense. Closed and dense means surjective, and its inverse is bounded by . Hence is in the resolvent. This proves .
Apply the adjoint operator identity of part (c) with and use part (a):
For a nonzero eigenfunction, positivity of the norm in particular forces . Hence the requested norm is
It vanishes exactly at the ground-state energy.
We prove the finite-dimensional spectral theorem for normal operators by induction on dimension. A complex linear operator has an eigenvector with eigenvalue , by the fundamental theorem of algebra. For a normal operator , the operator is also normal, and
for every . Applying this to shows .
Normalize . Its orthogonal complement is invariant under both and : the adjoint operator identities pair with through , and with through . The restricted operator on remains normal, and its adjoint is the restriction of . Induction supplies an orthonormal eigenbasis of , which together with gives one for .
Conversely, in an orthonormal basis of eigenvectors, is diagonal and is the diagonal matrix of the conjugate eigenvalues. The two diagonal operators commute. Thus normality is equivalent to an orthonormal eigenbasis. The zero-dimensional case is immediate.
The algebraic dual map is , defined by . The annihilator of a vector subspace is
Every functional vanishes on , so . Conversely, let . Define a functional on by . It is well defined because two preimages differ by an element of . Extend a basis of to one of and extend the functional arbitrarily, for instance by zero on the extra basis vectors. The resulting satisfies .
This is the dual image and kernel annihilator identity. Therefore
The basis extension theorem also gives . By the rank-nullity theorem,
Apply rank-nullity theorem to both maps, using , to obtain
Over , this is the algebraic dual, without complex conjugation; the adjoint operator in part (b) uses the inner products instead.
The adjoint operator is uniquely characterized by
Let . Its quadratic form is nonnegative:
If , both norms vanish. In particular , while means is orthogonal to , by the defining adjoint operator identity. A vector belonging to a vector subspace and its orthogonal complement must be zero. Hence is injective, and finite dimensionality makes it surjective.
Thus
The same calculation shows it is a positive-definite operator when .
The form attached to is . More generally, for a Lie algebra representation , the Trace form of a Lie algebra representation is
The unqualified Killing form is the special case of the Adjoint representation,
The distinction matters: a Trace form of a Lie algebra representation can be degenerate even when is semisimple, for example on the trivial Lie algebra representation.
The Trace form of a Lie algebra representation is bilinear and symmetric, because . It is an invariant bilinear form on a Lie algebra:
This follows by expanding both commutators and cyclically permuting factors under the matrix trace. Equivalently,
Its radical of a bilinear form is an ideal of a Lie algebra, since if , then . The Killing form is also preserved by every automorphism of a Lie algebra, because the corresponding adjoint operators are conjugate. On a complex finite-dimensional Lie algebra, the Cartan criterion for semisimplicity says that the Killing form is nondegenerate exactly when the Lie algebra is semisimple. The Cartan solvability criterion says that is solvable exactly when .
We next construct the sl2 subalgebra associated with a root. Use the root-space decomposition
For , , invariance of the Killing form gives
Thus unless , and for nonzero . Nondegeneracy of on now implies that is a root and that pairs and nondegenerately.
Nondegeneracy of defines a unique by
Choose and with . Their Lie bracket lies in the zero root space, namely , and
Therefore .
The essential nonisotropic root lemma is that . Suppose instead that it vanished. Then , so would be a solvable Lie algebra with derived algebra . Apply the Lie theorem to its action on by the Adjoint representation. The commutator is strictly upper triangular in a suitable basis, hence nilpotent. But , so the root-space decomposition makes diagonalizable. A diagonalizable nilpotent linear map is zero. Thus is central in . The center of a Lie algebra of a semisimple Lie algebra is zero; equivalently a central element lies in the radical of the Killing form. This forces , contradicting .
Writing , define
The root-space decomposition and give
The three vectors are linearly independent because they lie in the distinct summands , , and . Their span is therefore a copy of the sl2 Lie algebra.
The weight lattice consists of the functionals integral on all coroots. With the coroot above, the weight lattice is
where the fundamental weights satisfy for the simple roots . Here lies in the real span of the roots, viewed inside .
The classification of finite-dimensional sl2 representations says that every finite-dimensional complex sl2 Lie algebra representation is a direct sum of irreducibles , , on which the standard has eigenvalues . Restrict any finite-dimensional Lie algebra representation of to each sl2 subalgebra associated with a root. If has weight , then , so is an integer. Thus every weight lies in . The same restrictions show that the commuting simple coroots act diagonalizably, justifying the simultaneous weight-space decomposition.
For , the roots are , , and . Work on with the alternating bilinear form having matrix
The symplectic Lie algebra is
Using the matrix units , take the Cartan subalgebra
Define . A regular diagonal element of has centralizer precisely , and every element of acts diagonalizably. Thus it is a Cartan subalgebra. The requested Cartan decomposition is the root-space decomposition
Choose positive roots , , , . The symplectic root sl2 triple are given explicitly by
For the negative root spaces, use the corresponding . These eight root vectors, together with , form a basis: the block description above has dimension , and the ten listed vectors are independent. Finally, the matrix unit identity
verifies for every row. The diagonal differences verify and . Thus each row supplies a basis of the required sl2 subalgebra associated with a root.
Use , the necessary parameter range for the bounds involving . The construction comes from the singular value decomposition of matrix Fourier blocks. For each inequivalent unitary irreducible representation of dimension , consider the Hilbert space with the Hilbert-Schmidt inner product and the operator
Its operator norm is at most one, since is a unitary matrix and . Thus all its singular values lie in .
Two identities control their weighted moments:
Here the expectation in is uniform on the solutions of the constraint, and the trace on used to compute each moment is the ordinary operator trace. We justify the identities explicitly to fix their normalizations and the noncommutative order.
The adjoint operator is , so
For rectangular matrices, the operator has trace , as is seen on the matrix-unit basis. Squaring the previous operator therefore gives
The required representation theory consists of unitarization of a finite-group representation, the Schur orthogonality relations, and the regular representation decomposition. The last gives the character expansion of the identity delta
Summing the two operator traces with weights selects in the first, and in the second. Multiplication by converts each independent-variable expectation to its conditional expectation. This proves . In particular is real and nonnegative, despite the apparently complex summands in its original formula. Since , the nonvacuous hypothesis has .
Select every singular value satisfying . Index the selected pairs by , set , , and choose unit right singular vectors and unit left singular vectors with . Define
Both are matrices, proving (i). Repeated group representations in this list are literally the same chosen representative, rather than different equivalent realizations.
The given map is the unilateral shift operator. Its adjoint operator is the left shift operator, since
The shift is an isometry with trivial kernel and closed range . Its range has orthogonal complement , so every square-summable datum is admissible. Consequently,
Indeed , while is the required orthogonal projection. The discarded first component is the residual of the least-squares solution, not an obstruction to the existence of the Moore–Penrose inverse of an operator.
Let and assume . The scalar Poisson data fidelity integrand has derivative . Applying the permitted interchange of differentiation and integration in a direction gives
Thus the ambient-space Frechet derivative, or its Hilbert space gradient when the pairing is an inner product, is
The quotient is pointwise, and the adjoint operator transports it back from the data domain to the source domain. The chosen spaces must ensure the integrals and derivative pairing are finite; an output bounded away from zero is a useful sufficient condition.
The printed set of probability density functions and positive cone are not vector spaces, so the notation for a bounded linear map between them is understood as a positive bounded linear operator on ambient function spaces, restricted to admissible inputs. If unit mass is a constraint, admissible directions satisfy . The displayed gradient is then a representative modulo an additive constant; optimization with that constraint additionally includes its normal cone.
Use the kinetic-energy inner product , with perturbation energy . On divergence-free fields the primal generator, before the pressure projection, is
The base state is also divergence-free. The periodic boundary terms in cancel, and decay at removes the remaining boundary terms. Integration by parts changes to ; the Laplacian is self-adjoint under these conditions. Writing , the shear term has adjoint operator . A pressure gradient pairs to zero with a divergence-free field. Hence
where the last term enforces the divergence-free projection.
To conserve over the finite interval, the physical-time adjoint obeys . Put and ; then . This reverses the interval from towards , or towards .
For , the vorticity cross-product identity and the curl of a cross product
hold when both fields are divergence-free. Their difference equals the transport and shear terms in the adjoint operator. Therefore the adjoint linearized Navier-Stokes evolution is
The Leray-Helmholtz projection determines the adjoint pressure. The time-dependent base state is evaluated at ; no extra time derivative of that base state appears in the spatial adjoint operator.