Linearity of Stokes flow and rotational symmetry, including reflection in mathematics invariance of the spherical geometry, determine the possible rigid motions before any calculation. Translation is a polar vector; its linear dependence on a single vector must be . A traceless second-rank tensor cannot produce a polar vector by an isotropic linear map: tensor contraction with the identity matrix vanishes and tensor contraction with the totally antisymmetric tensor vanishes because is a symmetric second-rank tensor. Angular velocity is an axial vector. Neither nor a symmetric can produce one by an isotropic linear map. Products such as are excluded by Linearity of Stokes flow. Thus .
Use the Unscaled Papkovich–Neuber representation, with harmonic functions and :
Indeed and because each potential is a harmonic function. Put and . The decaying harmonic functions with the necessary angular dependence are , and . The last is a harmonic function precisely because . A Stokeslet is excluded by the force-free condition, and a rotlet by the torque-free condition. Try
The resulting Stokes flow is
At , the coefficient of fixes ; the remaining constant vector gives . In the mode, matching gives and . Therefore the complete two-mode tensorial squirmer flow is
The boundary condition is satisfied in the laboratory frame, so the Stokes flow tends to zero at infinity. The potential dipole in the mode gives an irrotational flow and decays as ; the leading mode is a stresslet, decaying as . Neither carries a net force or torque. Direct surface integral averaging with the surface slip velocity formula gives the same translation, providing an independent check. Uniqueness of Stokes flow then identifies this decaying solution.
The multiplication of a distribution by a smooth function is . If is a Schwartz function, the Leibniz rule shows that is a continuous map , so is a tempered distribution. When both and are radial, , and
Thus Multiplication by a radial Schwartz function preserves radial tempered distributions.
For the convolution of a tempered distribution with a Schwartz function, set
Translations of depend smoothly on in the Schwartz space, so this is a smooth function with . The bound for by finitely many seminorms, together with , proves
Thus the function also defines a tempered distribution. For a radial function , put . Then , so
Hence Convolution with a radial Schwartz function preserves radial tempered distributions.
Smoothing alone need not give a Schwartz function: for the constant tempered distribution and a Schwartz function with integral one, . The radial Schwartz approximation of tempered distributions therefore combines smoothing with a large-radius cutoff. Choose a nonnegative radial mollifier , supported in the unit ball with integral one, and a radial cutoff function equal to one on the unit ball. Put
Each is a smooth function of compact support, hence a Schwartz function, and the two invariance calculations above make it radial.
It remains to prove convergence, including the simultaneous changes of both scales. With , the distributional convolution pairing is
For every fixed , the Leibniz rule, rapid decay outside the radius- ball, and the chain rule for give
Convolution by is uniformly bounded in for , because its shifts have size at most one. The mean value theorem applied to similarly gives
Splitting the error into the convolved cutoff error and the approximate identity error proves
If , this yields
Consequently
weakly, and even in the strong dual topology, since is uniformly bounded on every subset of the Schwartz space that is a bounded set in a topological vector space. No assertion that itself is rapidly decreasing is needed.
For multi-indices , define
These seminorms define the Fréchet space topology of the Schwartz space: exactly when every tends to zero. An equivalent increasing family is
A tempered distribution is a continuous linear functional on this space. Equivalently, for some . The usual weak convergence of tempered distributions means for every fixed Schwartz function. The strong dual topology instead requires uniform convergence on every subset of the Schwartz space that is a bounded set in a topological vector space; the Fourier maps below are continuous in both topologies.
Using , differentiation under the integral and integration by parts give
The omitted coefficient has modulus one. By the Leibniz rule, every integrand is a finite sum of a polynomial times a derivative of . Inserting the integrable weight bounds its L1 norm by finitely many Schwartz space seminorms. In particular . Thus the Fourier transform maps continuously into itself.
For completeness, the Fourier inversion theorem follows here by Gaussian regularization. The inverse transform of is . The Fourier transform of a Gaussian and Fubini's theorem show
As , the right side tends to by the approximate identity property, while the left side tends to the undamped inverse integral by dominated convergence theorem, since . Hence
The inverse is times reflection composed with the continuous Fourier transform, and is therefore continuous on the Schwartz space. This proves a continuous linear isomorphism with continuous inverse.
Define the Fourier transform of a tempered distribution by
The continuous map on Schwartz space makes this a tempered distribution; the transpose of supplies its inverse. Pointwise convergence of pairings proves weak continuity. For the strong dual topology, the transform of a bounded set of Schwartz functions is bounded, so uniform convergence of pairings on bounded sets proves continuity of both Fourier maps there too.
Now let be a rotation matrix in the special orthogonal group and write . A change of variables with unit Jacobian gives
The rotation equivariance of the Fourier transform on tempered distributions follows by duality:
Therefore . Applying this identity and the inverse Fourier transform gives the two directions:
This is precisely preservation of radial tempered distributions. For , acts transitively on spheres, so an invariant smooth function is an ordinary radial function.
Use the standard inverse-problem setting of a bounded linear and exact data having a finite-penalty solution. Let denote the unique -minimizing exact solution for , . This is the limiting target of elastic net regularization in Hilbert sequence space; it need not be the Moore–Penrose minimum-norm solution unless additional hypotheses identify them, for example injectivity of .
For each , the reconstruction objective is weakly lower semicontinuous, coercive by , and strictly convex. The direct method on the reflexive l2 sequence space gives existence, and strict convexity gives uniqueness. For two data sets, monotonicity of the one-norm subgradients and the quadratic penalty give, with and ,
Completing the square yields , so each reconstruction map is continuous.
Minimality against gives
Choose and , for example . This bounds the Hilbert norms, drives the data residual to zero and gives . Every weakly convergent subsequence has an exact solution as its limit, by boundedness of ; weak lower semicontinuity and uniqueness of the penalty minimizer identify that limit with . Separately applying weak lower semicontinuity to the one-norm gives
Weak convergence and convergence of Hilbert norms imply strong convergence by the Radon-Riesz theorem. This proves norm convergence of elastic net regularization:
The argument applies to every sequence of noise levels and admissible data, hence gives the usual uniform noise-ball convergence for a fixed admissible exact datum.
For nonlinearity of elastic net reconstruction, zero is the minimizer exactly when . This includes a neighborhood of zero. If , choose with and for ; zero then fails its optimality condition. A linear map vanishing on a neighborhood would vanish everywhere, so the elastic-net reconstruction is nonlinear whenever . For the explicit formula is , exhibiting soft thresholding.
A concrete distinction from Moore–Penrose convergence is (embedded in the first output coordinate of ), exact datum one, and . Its minimum-norm solution is , with penalty , while the unique penalty-minimizing exact solution is , with penalty . For the exact-data elastic-net reconstruction is , converging to the latter. Thus it is not a Moore–Penrose-consistent regularization for every noninjective operator under the earlier definition.
The PDF supplies neither a nonzero assumption on nor a target/domain qualification here. Its unconditional nonlinearity claim is false for , whose reconstruction is the zero linear map. The convergence proof above states the finite-penalty exact-solution hypotheses explicitly; it establishes convergence to the penalty-minimizing solution, not an automatically identical minimum-norm least-squares solution.
Because , a finite sum implies . Thus the printed weighted one-norm on l2 equals the extended nonnegative sum on every . Unbounded weights may make that sum infinite for some ; membership in alone is not a finiteness assertion.
For each , is continuous in the l2 sequence space, and . If in norm, then for every ,
Taking the supremum over proves
It is also weakly lower semicontinuous by the same finite-coordinate argument, and convex and proper because zero and finite sequences have finite penalty.
At a finite-penalty base point , coordinate variations give the subdifferential of a weighted one-norm on l2:
These conditions are sufficient by summing the coordinate supporting inequalities. Since , an infinitely supported would require infinitely many , contradicting . Thus a finite-penalty point can have empty subdifferential; a Bregman base with an actual subgradient must be finitely supported.
For any such , and the Bregman distance simplifies to
Each summand is nonnegative; the sum may be infinite. The pairing converges by Cauchy-Schwarz inequality. This definition does not silently assume a subgradient exists at every .
Assume the displayed variational minimizer exists and is bounded and linear. The smooth data-fidelity term and the subdifferential sum rule give
Use the supplied source condition in variational regularization . Put and , so . By the symmetric Bregman distance identity,
Dropping the last square and using proves the source-condition estimate for symmetric Bregman distance:
The source condition also makes a -minimizing exact solution: for , its subgradient inequality has zero pairing with . Existence of is not implied by properness and lower semicontinuity alone; it is a hypothesis when no coercivity/compactness condition is provided.
For a convex functional on a real Banach space, its subdifferential at is empty unless is finite; otherwise
Given , the Bregman distance is
It can be infinite if is infinite. If is differentiable at , the choice is its derivative; otherwise the base subgradient must be specified. Given also , add both directional distances to obtain the symmetric Bregman distance
The symmetric version here is the sum, not half the sum. These nonnegative quantities are not generally metrics and can vanish at distinct points.
In an infinite-dimensional Hilbert space, every bounded sequence has a weakly convergent subsequence, but it need not have a norm-convergent one. For example an orthonormal sequence has pairwise distance and therefore no strongly convergent subsequence, although by Bessel inequality.
More generally, weak sequential compactness of bounded sequences in a reflexive Banach space ensures a weakly convergent subsequence with its limit in that space. Conversely, this property for all bounded sequences characterizes reflexivity, using the Eberlein-Šmulian theorem and weak compactness of the closed unit ball. Thus reflexivity replaces finite-dimensional norm compactness by weak sequential compactness.
In a nonreflexive Banach space there is no such general weak-subsequence guarantee. The coordinate unit vectors in give an example: by the Schur property, weak convergence would imply norm convergence, impossible for their pairwise distance two. Banach-Alaoglu theorem supplies weak-star compactness of a dual unit ball, which gives convergent subnets, not automatically convergent subsequences. For a separable predual, the weak-star compact dual ball is metrizable and subsequences do suffice. For an arbitrary Banach space one can also regard a bounded sequence in its bidual and extract a weak-star convergent subnet there; the limit need not belong to the original space. These qualifications distinguish weak from weak-star compactness.
For a real Banach space and a proper convex function , the convex conjugate is the extended-valued function on the continuous dual space
Here proper means that never takes and is finite somewhere. The pairing is the duality pairing, or the inner product after identification in a Hilbert space. The conjugate is convex and lower semicontinuous because it is a supremum of continuous affine functions. Its definition gives the Fenchel–Young inequality ; the Fenchel-Moreau theorem recovers as under the stated closed-convex hypotheses.
For a linear regularization, add and subtract the exact-data reconstruction:
The triangle inequality gives the noise-bias decomposition for linear regularization:
The two summands are noise amplification and approximation bias. Increasing the strength of regularization typically decreases noise amplification and increases bias; reducing regularization has the opposite effect. These are qualitative tendencies and bounds, not a claim that each realized noise error is monotone for every noise vector.
For the one-sided differentiation example, the bounds are and . Their sum has an interior balance point when the second-derivative bound is positive and the optimum lies in the permitted interval. The following original sketch plots these bounds against :
Figure 1.
Balancing approximation and noise-amplification errors
. Details.
A regularization of an inverse problem is a family of continuous maps , , such that for each as . A linear regularization requires each to be a bounded linear operator.
A regularization parameter choice assigns from the noise bound and possibly the measured data. A convergent regularization of an inverse problem satisfies, for every fixed admissible exact datum,
In the usual definition the chosen parameter also tends to zero uniformly over this noise ball. For a linear regularization with exact-data consistency, the conditions and are sufficient.
For example, Tikhonov regularization with identity penalty has and . Its spectral filter converges to the Moore–Penrose inverse of an operator on its domain. Taking for small positive noise levels gives both required limits.
The logical depth of a measurement pattern counts sequential layers of quantum measurements forced by dependence of measurement bases on earlier outcomes. Depth one means every basis can be fixed before measurements start, allowing all quantum measurements on distinct qubits to be performed in parallel. This does not require depth-one resource-state preparation or constant-depth classical parity processing.
Suppose the circuit contains gates in time order, with each . Prepare an -vertex path graph state from and Controlled-Z gates between neighbours. Its first qubit supplies the specified input . Measure vertex in the fixed equatorial qubit measurement basis at angle for , obtaining . Measure the final vertex in the computational basis, obtaining .
Track the Pauli frame as , starting with . A hypothetical sequential reading of the same quantum measurements gives the step . The supplied commutation rules imply, up to global phase,
For , the sign is irrelevant. For , the identity absorbs the possible sign change into the Pauli frame. If for and for , the update is
Inductively the final unmeasured quantum state would be . The final computational basis outcome is corrected by and is unaffected by . The induction on a sequential interpretation proves the joint statistics; projectors on distinct vertices commute, so the identical fixed-basis pattern can actually be measured simultaneously, including its final vertex.
The first printed commutation formula has an incorrect exact scalar phase: with the printed matrix definition, , rather than the negative-exponent prefactor. For example, at the two versions differ by a factor . They agree up to global phase, so this error does not affect the Pauli frame recurrence or any quantum measurement probability.
Consequently a fixed-basis path-state pattern of logical depth one simulates every such circuit. Only Pauli measurements occur: the angle-zero basis measures , and the angle- basis measures with the printed eigenvector labels. Classical exclusive or processing suffices for all output corrections. These gates are Clifford gates, which explains why angle adaptation can be eliminated. For , simply measure the initial in the computational basis; it is already a depth-one pattern.

Pinned article: Introduction to the OurBigBook Project

Welcome to the OurBigBook Project! Our goal is to create the perfect publishing platform for STEM subjects, and get university-level students to write the best free STEM tutorials ever.
Everyone is welcome to create an account and play with the site: ourbigbook.com/go/register. We belive that students themselves can write amazing tutorials, but teachers are welcome too. You can write about anything you want, it doesn't have to be STEM or even educational. Silly test content is very welcome and you won't be penalized in any way. Just keep it legal!
We have two killer features:
  1. topics: topics group articles by different users with the same title, e.g. here is the topic for the "Fundamental Theorem of Calculus" ourbigbook.com/go/topic/fundamental-theorem-of-calculus
    Articles of different users are sorted by upvote within each article page. This feature is a bit like:
    • a Wikipedia where each user can have their own version of each article
    • a Q&A website like Stack Overflow, where multiple people can give their views on a given topic, and the best ones are sorted by upvote. Except you don't need to wait for someone to ask first, and any topic goes, no matter how narrow or broad
    This feature makes it possible for readers to find better explanations of any topic created by other writers. And it allows writers to create an explanation in a place that readers might actually find it.
    Figure 1.
    Screenshot of the "Derivative" topic page
    . View it live at: ourbigbook.com/go/topic/derivative
  2. local editing: you can store all your personal knowledge base content locally in a plaintext markup format that can be edited locally and published either:
    This way you can be sure that even if OurBigBook.com were to go down one day (which we have no plans to do as it is quite cheap to host!), your content will still be perfectly readable as a static site.
    Figure 5. . You can also edit articles on the Web editor without installing anything locally.
    Video 3.
    Edit locally and publish demo
    . Source. This shows editing OurBigBook Markup and publishing it using the Visual Studio Code extension.
  3. https://raw.githubusercontent.com/ourbigbook/ourbigbook-media/master/feature/x/hilbert-space-arrow.png
  4. Infinitely deep tables of contents:
    Figure 6.
    Dynamic article tree with infinitely deep table of contents
    .
    Descendant pages can also show up as toplevel e.g.: ourbigbook.com/cirosantilli/chordate-subclade
All our software is open source and hosted at: github.com/ourbigbook/ourbigbook
Further documentation can be found at: docs.ourbigbook.com
Feel free to reach our to us for any help or suggestions: docs.ourbigbook.com/#contact