For an increasing sequence of nonnegative integers, full-density sequence means that its range has natural density one:
For a sequence in a metric space, convergence in density of a sequence to means that, for every ,
In particular, a bounded nonnegative scalar sequence converging to zero in density has averages tending to zero: the average is at most plus its bound times the proportion of indices above .
Here is a Hilbert space form of the Van der Corput lemma, including the density version. Suppose , and put
Then
Since , it suffices for to converge to zero in density. A frequently used special case is that the correlation average tends to zero for every fixed .
To prove the lemma, extend the finite list by zero outside this range, and write . For ,
The Cauchy-Schwarz inequality for this sum, followed by expansion of the squared Hilbert space norm, gives
The coefficient counts the pairs of shifts separated by . Dividing by , bounding real parts by absolute values, and first taking the limit superior in for fixed yields
The right side tends to zero as under the stated hypothesis. This proves both the lemma and its density consequence.
For the polynomial application, fix a nonzero integer and let . For each fixed , the correlation phase is linear:
Thus, with ,
The coefficient is irrational, so . This geometric series is bounded in modulus by and tends to zero. All vanish, so the Van der Corput lemma gives
The Weyl criterion now shows that the fractional parts form an equidistributed sequence. For completeness, its sufficiency here follows directly: the displayed limits give the correct average for every trigonometric polynomial, including the constant term. The Stone-Weierstrass theorem extends this to every continuous function by uniform approximation. Approximating an interval's indicator function above and below by continuous functions gives its length as the limiting frequency. Hence
This proves the equidistribution of a quadratic polynomial with irrational leading coefficient using the required correlation argument.
The convention used for planar Gaussian free field theory is the Dirichlet energy space:
It is a real Hilbert space with the extended Dirichlet inner product. A conformal map from the unit disc onto identifies the two energy completions, so local representatives can be understood through the disc's zero-boundary space.
For an arbitrary unbounded domain this is the homogeneous energy completion; it should be distinguished from completion in the inhomogeneous norm used in another standard definition of the zero-boundary Sobolev space. On bounded domains with a Poincare inequality, the two norms are equivalent.
Use the Hilbert space interpretation of a linear inverse problem, with a bounded linear operator . A least-squares solution minimizes over . A minimum-norm least-squares solution additionally has the smallest -norm among all least-squares solutions. When the equation is consistent this is the smallest-norm exact solution.
The least-squares solutions form a nonempty closed affine subspace precisely when
The closest point theorem in a Hilbert space then gives a unique nearest point to zero, hence a unique minimum-norm least-squares solution. Equivalently, it is the unique least-squares solution in . If is closed, this exists for every datum; a nonclosed operator range can leave some data without any least-squares solution.
For example, on the l2 sequence space, take and . The equation would require for every , which is not square summable. However, setting the first coordinates of to one and the rest to zero gives
Thus the least-squares infimum is zero but is not attained, and no minimum-norm least-squares solution exists for these data.
Comparison with zero and nonnegativity of the two terms gives
Therefore
For a concrete variational regularization example, take a Hilbert space and . The bound forces in norm. Since is a bounded linear operator, , and continuity of the squared norm gives
The same conclusion is not forced by for a regulariser with a nontrivial zero set.
Write for the indicator functional of a constraint set and . Then
Both terms are convex, hence their infimal convolution is the convex squared distance to a convex set. The closest point theorem in a Hilbert space supplies the unique metric projection onto a closed convex set and gives .
Identify the Hilbert space with its dual space using the Riesz representation theorem. Completing the square yields , while is the support function. The conjugate of the squared distance to a convex set is therefore
For the closed unit ball, the metric projection onto a closed convex set is if , and otherwise. Therefore
The last equality uses the Cauchy-Schwarz inequality to compute the unit ball's support function, attained in the direction of when .
Fix a receiver position and define . Choose the two scalar fields in the Wigner distribution to be . Fourier inversion in the separation variable gives
Indeed, substituting the defining Wigner distribution makes the integral a Dirac delta function, canceling its normalization and setting the separation equal to .
Average over the receiver plane, including the aperture:
Then the receiver-averaged Wigner distribution represents the back-propagated field as
The fast decay of justifies its use as a test function. For oscillatory Green functions that are not integrable, the Wigner distribution and its inversion can be understood as tempered distributions, or derived with smooth cutoffs before taking their limits.
The printed expression can also be used literally, but its displayed integral is over source-plane coordinates, not receiver positions. The missing receiver average and source weight can be encoded by choosing vector fields whose channels are the receivers. Let
Contract the receiver channels in the product of the vector fields, so that
With exactly the printed definition
the same Fourier inversion now yields the requested compact form
For a finite array, the receiver integral in the contraction is a weighted sum. For a continuous array, these are fields valued in the receiver Hilbert space. An uncontracted vector outer product instead gives a matrix-valued Wigner distribution, whose receiver trace must be taken. Thus the printed formula is usable with these choices and this contraction convention, but its phrase “over the plane of the receiver” does not describe the displayed integral.
To first order in , replace by and use the known incident field in the outgoing integral. The Born approximation for scalar wave scattering gives
Both the contrast term and the internal-field correction are second order for fixed geometry in the perturbative regime established in part i.
Specify the data space before taking an adjoint operator. For example, let and , where is a bounded measurement surface separated from . Define the linear operator
For bounded incident field this is a Hilbert-Schmidt operator, hence a compact operator. The equation is , with . Other sampling geometries give corresponding data spaces and weights; the paper does not specify one. Using the usual complex inner products, its adjoint operator is
The complex conjugations are required by the adjoint operator identity, not by wave reciprocity alone.
The Landweber iteration starts from and applies gradient descent to :
Each step back-propagates the data residual. The Landweber relaxation parameter controls stability, and early stopping of Landweber iteration prevents small singular values from amplifying measurement errors. For an explicitly real-valued index contrast, use the real Hilbert space structure and replace by in this update. Additional sign or support constraints require corresponding projections; none are assumed here.
An orthonormal wavelet is a function whose integer translates and dyadic dilates
form an orthonormal basis of the Hilbert space . Thus their pairwise inner products are , and their closed linear span is the whole space. Equivalently, every has the norm-convergent expansion
The factor preserves the norm under dilation.
Assume , as required for the finite-valued data fidelity; extend the total variation seminorm on a domain by outside . The zero function is a finite-energy competitor. A minimizing sequence has bounded and bounded variation, hence bounded norm. Take a weakly convergent subsequence in , with limit . For each fixed test vector field , the pairing is weakly continuous because . Its supremum has weak lower semicontinuity. The squared Hilbert space norm also has weak lower semicontinuity. Thus the direct method in the calculus of variations gives a minimizer in .
The variation term is convex, and the squared fidelity term is strictly convex. Their sum is strictly convex on its effective domain, so the minimizer is unique.
Let . The bounded-variation contraction under clipping gives . If , then , strictly whenever . A positive-measure set outside the interval would therefore strictly decrease the fidelity integral, while not increasing variation, contradicting minimality. Hence
No compactness theorem for the embedding is required for this weak- argument.
Work in the real zero-boundary Sobolev space , whose members have square-integrable weak derivatives and zero endpoint trace. Define the bounded bilinear form and linear functional
The weak formulation is to find with for every . Integration by parts recovers the differential equation for a smooth solution; conversely, this identity is the definition of its weak solution.
Use the full norm. The Cauchy-Schwarz inequality gives and . Also , so is a coercive bilinear form with constant one. The Lax-Milgram theorem states that a bounded, coercive bilinear form on a real Hilbert space determines a unique weak solution for every bounded linear functional. It therefore applies here.
The equivalent minimization problem is
If is the weak solution, symmetry and give
This is positive unless , proving a unique global minimizer. Conversely, differentiating at gives the weak identity. Thus the unique energy minimizer is exactly the unique weak solution. As a check, the classical representative is
It satisfies both endpoint conditions and .
The starting point of a conforming finite element method is a weak formulation in a Hilbert space . For example, a homogeneous Dirichlet boundary condition on a bounded Lipschitz domain gives . One seeks
where is a bounded bilinear form, , and is a bounded linear functional. A conforming finite element space is finite dimensional and is typically built from functions that are polynomial on each element of a finite element mesh. With a basis , the Galerkin method imposes the same identity only for , giving
The stiffness matrix is sparse when basis supports overlap only locally. Local element integrals assemble its entries; the mass matrix represents an term. This separates the choice of trial functions from the variational principle determining their coefficients.
The fundamental well-posedness theorem is the Lax-Milgram theorem: if for some , there is a unique solution for each , with . The same theorem on gives a unique discrete solution. The constants must be independent of the mesh for uniform stability of a numerical method. Boundary conditions are built into the trial space when they are essential constraints; flux conditions arise through boundary terms in integration by parts and are natural constraints in the weak formulation.
When is symmetric and a coercive bilinear form, the Ritz method minimizes
over . Its first variation is exactly the Galerkin method, so Ritz minimization and Galerkin testing coincide for symmetric coercive problems. The energy norm turns the approximation into an orthogonal projection. Indeed, subtracting the exact and discrete weak equations gives Galerkin orthogonality, . For every the Pythagorean identity becomes
so
This exact best-approximation property is the central advantage of the Ritz method.
Symmetry is unnecessary for the Galerkin method. For any bounded, coercive form, the Céa lemma gives
To prove it, put . Galerkin orthogonality yields , so coercivity and boundedness give . Divide when and take the infimum. Thus approximation capability plus uniform coercivity gives convergence. In contrast, minimizing for a nonsymmetric form differentiates its symmetric part and generally does not solve the original weak equation.
A concrete symmetric example is the one-dimensional reaction-diffusion problem from Question 5. Continuous piecewise-linear hat functions give the diffusion stiffness matrix with diagonal and neighbouring entries , and the mass matrix with diagonal and neighbouring entries . Therefore and . Its positive-definite matrix is the coordinate form of the continuous energy. The exact smooth solution makes this an explicit test of the method, not just an abstract existence result.
For a nonsymmetric example, take positive , constant real , and
Its form is . Since , it has coercivity constant in the full norm, although it is not symmetric when . The Galerkin method remains well posed. On the uniform hat basis, , where , and . The skew-symmetric matrix cancels from , proving nonsingularity. A Ritz energy would omit precisely this advection contribution. Small may nevertheless make the approximation constant large and produce poorly resolved layers; algebraic solvability is not an accuracy guarantee.
Quantitative convergence uses a finite element interpolation estimate. On a shape-regular mesh, for piecewise-linear conforming elements and in the usual low-dimensional setting,
The Céa lemma therefore gives an energy error. The Aubin–Nitsche duality argument improves the L2 norm error when the dual elliptic problem has regularity: solve and use
Consequently
with constants depending on the solution and regularity bounds. The second estimate is conditional on dual regularity; corners or insufficient data regularity can reduce the rate.
The same Galerkin method handles evolution equations. For the homogeneous heat equation, the semidiscrete finite element heat equation is . Because is a positive-definite matrix and is a positive semidefinite matrix,
The decreasing quadratic form is exactly the L2 norm squared of the finite-element function. This separates spatial stability of a numerical method from the subsequent time integrator, just as in the Schrodinger equation example. Conformity, coercivity and approximation estimates together explain convergence.
The hypothesis says exactly that in the Hilbert space . We give the constructive Weak Banach–Saks theorem in a Hilbert space argument. Choose inductively so that, for ,
This is possible because each earlier is an admissible test variable in the weak-convergence assumption. Since ,
Therefore
The Sobolev space is a separable Hilbert space. A bounded sequence therefore has a weakly convergent subsequence by the weak subsequence of a bounded Hilbert-space sequence; write in . Since is bounded with smooth boundary, the Rellich-Kondrachov compactness theorem says that is compact. Passing to a further subsequence gives
The Lax-Milgram theorem states that if is a real Hilbert space, is a bounded bilinear form, and there is an such that
then for every bounded linear functional there is a unique satisfying
Moreover, . Symmetry of is not required.
On the product Hilbert space define
and
The Cauchy-Schwarz inequality makes and bounded. On the diagonal,
The Poincare inequality controls by , and
The displayed diagonal value therefore controls the full product norm, so is coercive. The Lax-Milgram theorem now gives exactly one pair satisfying the weak identities. Hence a unique weak solution exists for every .
Assume no previously shared entanglement. Alice's encoded ensemble lives in a Hilbert space of dimension . Its Holevo quantity satisfies
using nonnegativity of Von Neumann entropy and the maximum entropy of a quantum state. The data-processing inequality for quantum relative entropy implies for the transmission quantum channel. Finally, the Holevo bound applied to Bob's quantum measurement gives
This argument also works when the output system has larger dimension than the input. Prior shared entanglement changes the communication resource: superdense coding can transmit two classical bits per sent qubit, so the absence of that resource is part of this bound's setting.
The Radon-Riesz property of a norm is the implication
In a Hilbert space, expand the square using its inner product:
Weak convergence gives , and convergence of norms gives . Hence the right side tends to zero. This proves the Hilbert-space Radon-Riesz theorem.
The Cameron-Martin space of a Gaussian measure is
The inverse is defined on the range of . In this infinite-dimensional setting “positive definite” must mean for every nonzero , rather than a uniform lower bound: a trace-class operator cannot be uniformly positive on an infinite-dimensional Hilbert space.
By the spectral theorem for compact Hermitian operators, choose an orthonormal basis with , , and . (A strictly positive trace-class operator also forces the ambient Hilbert space to be separable.) In coordinates ,
This is a Hilbert space with its indicated norm, even though its range need not be closed in the ambient norm.
The Cameron-Martin theorem for a Gaussian measure states that the translated law is an equivalent probability measure to exactly when . For such , its Radon-Nikodym derivative is
The series has mean-square convergence and converges almost surely under , since its independent summands have total variance . Its law is , so the density has expected value one. It is sometimes formally written , but a typical infinite-dimensional Gaussian sample is not in ; the series interpretation is essential. If , the two laws are mutually singular measures.