Identify with the Boolean hypercube , with coordinatewise multiplication and normalized Haar measure assigning mass to each point. Its Bernoulli function is a Rademacher random variable. The Walsh functions on a hypercube are the Walsh characters , indexed by all subsets , including . Independence of the sign coordinates gives . There are characters, equal to the dimension of , so they form an orthonormal basis.
Flipping coordinate negates exactly when . Thus the coordinate-flip generator on a hypercube satisfies
For , Parseval identity gives . Equivalently its Dirichlet form of a Markov chain is
where flips coordinate .
Set and . Since , its Walsh expansion contains only sets of even size. Every nonconstant such set has , giving the even-function spectral gap on a hypercube
At each the Hahn-Banach theorem supplies a real supporting linear functional of norm at most one with ; for a complex normed space use the real part of a complex norming functional. At take . Convexity of the norm gives . Since , sum these inequalities to get . Therefore . Combining the two bounds yields the sharp Rademacher second-moment inequality
No smoothness of the norm is required. The constant is sharp: two equal nonzero real coefficients give modulus or with equal probabilities. This is the second-versus-first moment case of the Kahane-Khintchine inequality for arbitrary normed vector spaces.
For the complex-circle assertion, write each independent Steinhaus random variable as , where is uniform on and all quadrant signs are independent. Conditional on the angles, is a Rademacher sum with complex coefficients and . Its conditional second moment is , independent of the angles. The preceding inequality gives its conditional first moment at least . Average over the angles and square to obtain the Steinhaus first-moment lower bound
For a densely defined operator on a complex Hilbert space, unbounded self-adjointness means equality including equality of the operator domains. Symmetry alone asserts only and is insufficient. Use an inner product linear in its first argument. If , symmetry gives
Thus is bounded below. Since is closed, its range is closed; its orthogonal complement is , so the range is also dense and therefore all of . The inverse is bounded by . The nonreal resolvent estimate for a self-adjoint operator proves .
For bounded self-adjoint , its numerical range of an operator and numerical radius are
Every number in is real. If , its distance from that closed set is positive, and . The same bound applies to , so the range is dense as well as closed and has a bounded inverse. Hence the numerical-range spectral enclosure is
The closure is necessary in infinite dimension: the endpoints of the numerical range need not themselves be attained.
Put and , a bounded positive semidefinite operator. Choose unit vectors with . The Cauchy-Schwarz inequality for the positive form implies
Therefore is an approximate eigenvalue. Apply the same argument to , where , to get the other endpoint. This proves the numerical-range endpoint approximate-eigenvalue theorem. Each endpoint is in the spectrum: a bounded inverse would forbid unit vectors with vanishing residual.
If an unbounded self-adjoint operator is positive semidefinite, then for every real , . The range argument above again proves invertibility, excluding negative values from the spectrum. For the converse, suppose . Its resolvent operator is bounded and self-adjoint. The resolvent spectral mapping identity puts : for , the relevant spectral parameter of is , and nonreal values are excluded by self-adjointness. By the endpoint result just proved, . Positive-form Cauchy-Schwarz inequality then gives
For this yields . Thus the spectral positivity criterion for a self-adjoint operator is
This resolvent proof uses the bounded numerical-range result to handle the full unbounded domain.
On a compact metric space , a conservative Feller semigroup is a strongly continuous semigroup of positive linear maps on satisfying . Positivity means . These conditions imply sup-norm contraction. Conversely, for a contraction semigroup with and , differentiation on the generator domain gives , so . On the real space , if , then , implying . Scaling proves positivity for every nonnegative . This is the unital contraction positivity criterion. For complex the same conclusion follows because each functional has norm one and value one on , hence is a positive linear functional.
For each , the Riesz-Markov-Kakutani representation theorem represents that functional by a unique Borel probability measure :
Continuity of gives weak continuity of . Approximating indicators of open sets increasingly by continuous functions proves Borel measurability in ; a monotone-class argument then gives a Markov kernel. The semigroup property and uniqueness of representing measures yield and the Chapman-Kolmogorov equation
These are the required transition probabilities.
An invariant probability measure for a semigroup satisfies for every and . Equivalently its distribution is preserved by the Markov kernel. For , Jensen inequality gives pointwise. Integrating and using invariance proves
Also . Continuous functions are dense in these spaces for a finite Borel measure on a compact metric space, so the contraction extends to a strongly continuous semigroup on .
For real with , the kernel form of Jensen inequality gives , with equality at . Take its right derivative to obtain the generator square inequality
This is nonnegativity of the associated carré du champ.
Each time-average functional is positive with , hence represents a Borel probability measure . The compactness of probability measures on a compact metric space gives a subsequence converging weakly to a probability measure . Explicitly, is a separable Banach space, so Banach-Alaoglu theorem and a countable dense family give a subsequence converging on every continuous function, rather than merely a net. For fixed , the semigroup property gives the Krylov-Bogolyubov time-average argument:
Its absolute value is at most . Pass to the subsequential limit, observing that , to get . Thus the limiting measure is invariant.
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 Poincaré 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.
Define the second modulus of smoothness by . The Jackson kernel is even, nonnegative and has integral one. Symmetrizing its convolution therefore gives
We first establish the needed scaling rule. For the translation operator , . Squaring gives . Central and forward second differences have the same norm. For every , take and . Taking the supremum over these proves
The zero-step case is immediate.
For , the inequalities , , and imply
Use the first estimate on and the second outside it. Then
All constants are independent of and . Combining these estimates proves the Jackson operator estimate
For , two applications of the fundamental theorem of calculus give the second-difference integral formula
for . Its absolute value is at most , so .
Finally, is a trigonometric polynomial of degree : its sine ratio squared is a Fejér polynomial of degree , and squaring doubles that degree. Thus has degree at most . To bound degree- best approximation, choose , rather than using directly. Since for , the smooth-function approximation rate is
Consider an initial value problem on , with a Lipschitz continuous vector field in the solution variable and enough smoothness for the stated error expansions. Convergence of a numerical method means
with consistent starting values. An order of a numerical method quantifies this approximation: with sufficiently accurate starting data and the required stability, the global error is . Stability of a numerical method controls the amplification and accumulation of perturbations; it is the link between a small local defect and small global error.
For a one-step formula , define the unscaled local truncation error
The method has local order if uniformly along sufficiently smooth solutions. If the defect is divided by , its order is instead ; the convention must be specified. Assume also the perturbation estimate
The global error then satisfies
Iterating, or applying the discrete Gronwall inequality, gives
There are steps on a fixed interval, so stable propagation turns local defects into accumulated error. Starting error is needed to retain order . This explains why matching an exact Taylor expansion is insufficient unless errors are controlled during repeated steps.
For a fixed-coefficient linear multistep method, write
The consistency of a numerical method conditions are and . The higher order conditions for a linear multistep method are
with right side zero for ; exact order means first failure at . They come from inserting the exact solution and comparing its Taylor expansion.
Errors at follow the homogeneous recurrence determined by . Zero-stability is equivalent to the root condition for a multistep method: all roots of a polynomial have modulus at most one, and every unit-modulus root is simple. Roots outside the disk give exponential growth in the number of steps; repeated unit roots give polynomial growth in that number. Repeated interior roots are harmless because their polynomial factors are dominated by decay. Under the usual Lipschitz continuity and initialization assumptions, the Dahlquist equivalence theorem gives
For a zero-stable order- linear multistep method, local defects and starting errors of the stated orders yield global error by a recurrence bound and the discrete Gronwall inequality. Every required starting value matters.
A concrete failure of “consistency implies convergence” is
Here and , so and : the method is consistent, of order one. But its root violates zero-stability. For with exact solution zero and starting values , , the computed solution is . These starting errors vanish, yet at the error diverges. Local accuracy cannot compensate for an unstable recurrence.
A different meaning of stability concerns a fixed step on decaying equations. The Dahlquist test equation introduces . A one-step method gives and is absolutely stable when . For a linear multistep method, the corresponding amplification polynomial of a multistep method is , and every root must satisfy the bounded root condition, not just the root approximating . Strict asymptotic decay requires the roots to have modulus less than one for . This distinction matters at reducible methods with an undamped parasitic mode, as in question 1(c).
The Forward Euler method has order one and , so its linear stability domain is . For , with , it requires . It converges as , yet an excessively large step can produce growing oscillations on an exactly decaying problem. The Backward Euler method has the same order, but makes it A-stable and L-stable. For a stiff differential equation, fast decay can impose a severe explicit time-step restriction even when accuracy of the slow dynamics would permit a much larger step.
The trapezoidal rule has order two and is A-stable, but is not L-stable, since its stability function tends to along the negative real axis. The Second Dahlquist barrier limits an irreducible A-stable linear multistep method to order at most two. This does not limit implicit Runge-Kutta methods: question 4's Lobatto IIIA method is fourth-order and A-stable. Conversely, question 1's fourth-order member is convergent but not A-stable. These examples show that order of a numerical method, zero-stability and A-stability answer different questions.
For nonlinear dissipative problems, B-stability controls distances between numerical solutions; algebraic stability of a Runge-Kutta method is a sufficient coefficient criterion. Question 4 shows that A-stability alone does not imply that coefficient criterion. Variable time steps require additional analysis of step ratios and error propagation, and stiff problems may require uniform-in-stiffness error estimates beyond the fixed-problem convergence result. The useful chain is local accuracy plus the appropriate perturbation bound, giving global accuracy; absolute and nonlinear stability then determine which practical time steps preserve the intended dynamics.
For an evolutionary partial differential equation, stability of a numerical method means that errors in the starting data and forcing stay controlled on each fixed interval , with constants independent of the mesh. Fourier stability analysis is especially effective for a constant-coefficient finite difference method on a uniform infinite or periodic grid: translation invariance makes different Fourier modes evolve independently.
For a scalar one-step scheme on the integer lattice, insert , with . The Fourier symbol of each shift is , and the update reduces to
The amplification factor must be defined for every relevant frequency; for an implicit scheme this includes checking that its denominator is nonzero. The Parseval identity turns a bound into a discrete L2 norm bound. Thus gives contractivity, while the more general bound gives for . Conversely, frequencies with amplification uniformly greater than one produce unstable wave packets or periodic Fourier modes under refinement.
For a system, is an amplification matrix; for a multilevel scheme, a companion matrix evolves the vector of time levels. The actual requirement is a uniform bound on matrix powers, not just their spectral radius. A nontrivial Jordan block at a unit-modulus eigenvalue creates polynomial growth in the time index. Even simple eigenvalues inside the unit disk can fail to give a uniform bound if the eigenvector matrices become ill-conditioned as the mesh changes. Uniformly controlled diagonalization of a matrix, or a suitable quadratic energy estimate, resolves this issue. The power boundedness of a two-level Fourier scheme illustrates why root multiplicities and conditioning matter.
For the heat equation, put . Centered space with the Forward Euler method has
The von Neumann stability analysis condition holds exactly for on the full frequency interval. The Backward Euler diffusion scheme instead has and is stable for every . The Crank-Nicolson diffusion scheme has
It too is unconditionally stable, but poorly resolved high-frequency modes have for large , giving oscillatory numerical transients. A-stability therefore does not guarantee strong damping; L-stability distinguishes the damping of the Backward Euler method.
For the advection equation , let . Forward time and centered space give
For nonzero fixed , repeated steps amplify some modes by a fixed factor greater than one, so the method is unstable under the usual refinement . This calculation also shows the refinement qualification: if , its finite-time growth can be bounded by , though the restrictive scaling defeats the usual hyperbolic time-step choice. For , the upwind finite difference scheme has
so it is stable for . The Lax-Wendroff advection scheme instead has
giving . These examples separate the effects of the spatial stencil, temporal approximation and Courant number; a higher order of a numerical method by itself does not establish stability.
A periodic boundary condition is ideal for this analysis. The discrete Fourier transform diagonalizes the circulant update, with only the discrete frequencies needed on a grid of points. A bound on all is a convenient guarantee over every such grid. On the whole line, the Fourier transform uses a continuous frequency interval and the Parseval identity proves the corresponding square-summable-data estimate.
Homogeneous Dirichlet boundary conditions do not admit arbitrary complex exponential Fourier modes. For the standard centered second difference on interior points, a discrete sine transform diagonalizes the actual boundary-value matrix:
The same heat amplification formulas then apply at these sine frequencies. For example, the exact forward-Euler contractivity limit on that fixed grid is ; the mesh-independent sufficient limit follows by including all frequencies. Homogeneous Neumann boundary conditions can similarly permit a discrete cosine transform, provided the endpoint discretization and its weighted inner product are chosen consistently. The constant mode is then present, reflecting conservation of the heat equation's spatial mean. For inhomogeneous boundary conditions, subtract a suitable lifting of the prescribed boundary data and estimate the induced source using the homogeneous evolution's bound and a Duhamel principle estimate. Bounds for the lifting and source must themselves be uniform in the mesh.
General boundary conditions require separate boundary stability of a finite-difference method. For an advection equation, incoming data are prescribed at the inflow boundary, while an outflow closure must respect the outgoing characteristics. An interior periodic Fourier symbol cannot detect a growing mode confined near a boundary. A normal-mode test on a half-line seeks modes with and that satisfy both the interior recurrence and boundary closure. Their existence proves instability, and uniform control requires more than merely excluding isolated growing roots; the Uniform Kreiss--Lopatinskii condition addresses boundary resolvent bounds. Alternatively, a direct energy method using summation by parts can include the boundary terms and establish the required estimate.
Variable coefficients and nonuniform meshes usually destroy exact Fourier transform diagonalization. Frozen-coefficient Fourier stability analysis is then a useful diagnostic, but it is not automatically a proof for the full variable-coefficient boundary problem. The mesh-uniform energy method in question 5 is an example of a direct proof. Also, an L2 norm proof is not automatically a mesh-uniform maximum-norm proof: finite-dimensional norm-equivalence constants may grow with the number of grid points.
Finally, stability measures error propagation; consistency of a numerical method measures the defect of inserting the exact solution. For a well-posed linear initial-value problem in the chosen norm, the Lax equivalence theorem says that a consistent approximation is convergent exactly when it is stable. Boundary discretization and starting data must be included in that assertion. A Fourier calculation proves convergence only after consistency, well-posedness and the actual boundary treatment have also been checked.

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