For , put
The bound makes finite. Each is continuous; submultiplicativity gives , and the spectral radius formula gives . Spectral radius need not be continuous, so applying the Dini theorem directly to would not be justified. Instead define, on the compact boundary,
These are continuous, decrease pointwise to the continuous constant , and therefore converge uniformly by the Dini theorem. In particular,
Multiplication is a continuous bilinear operation in a Banach algebra, so the product rule shows that is a Banach-space-valued holomorphic function. Part (i), applied to this power, gives
Taking the limit on the left and the limit superior on the right proves the spectral-radius maximum principle:
Fix . If , the conclusion is immediate. Otherwise is in the interior of . If , nonnegativity of the boundary supremum suffices. For , the complex Hahn-Banach theorem gives a bounded linear functional with and . The scalar function is holomorphic.
Let be the connected component of the interior of containing . It is bounded, its closure is contained in , and . To see the last inclusion, a boundary point of lying in the interior of would have a small connected open ball in that interior meeting ; the ball would belong to the same component, contradicting that it is a boundary point. The scalar maximum modulus principle on a bounded domain therefore gives
For completeness, this boundary form of the maximum modulus principle follows by taking the maximum on the compact closure of . An interior maximum makes constant on , in which case continuity gives the same value on its nonempty boundary. Thus the norm maximum principle for a Banach-space-valued holomorphic function applies to arbitrary compact , even when it is disconnected or has nonsmooth boundary:
Suppose were a left inverse of an algebra element , so . Then , and is invertible for all sufficiently large by the Neumann series. For such , is a product of invertibles, hence invertible. The equation then gives , a contradiction.
If instead , then , so is eventually invertible. Now is invertible, and again , a contradiction. This proves that a noninvertible limit of invertibles has neither type of one-sided inverse. No finite-dimensional assumption is used.
If , then
is invertible by the Neumann series, a contradiction. Thus every satisfies
Here because is invertible and is not. Since , this proves the inverse norm divergence at noninvertible boundary points:
The sine vectors , , simultaneously diagonalize these two symmetric tridiagonal matrices. Their eigenvalues are
Thus the semidiscrete decay rates are . The forward Euler method multiplies each mode by . Stability requires for every mode.
For a fixed finite Dirichlet grid the largest mode is . Consequently the exact finite-grid bound is
As the mesh is refined, the upper bound decreases to . Hence the mesh-independent answer is . This is the forward Euler limit for a consistent hat mass matrix. The frequently seen diffusion bound belongs to the standard second-difference scheme or a lumped mass matrix, and is not the bound for the consistent Galerkin equations derived here.
Use equal intervals, , and the interior piecewise-linear hat functions , which equal one at node , vanish at all other nodes and vanish outside the two adjacent intervals. Write . Testing with and integrating the second derivative by parts gives
The integrals are local: , , and . Nonadjacent functions do not overlap. Thus the consistent mass matrix and stiffness matrix are
Equivalently the explicit nodal equations are
For merely L2 initial data a natural choice is the Galerkin projection ; nodal interpolation is also possible for suitably smooth data. The relation identifies the natural finite-element energy. Differentiating gives .
Applying the stage equations to gives the stability function
The poles are , both in the right half-plane. To determine the whole domain rather than only its boundary, multiply numerator and denominator by 12 and put . Direct expansion gives
Thus exactly when , with no pole in that set. Consequently
On the imaginary axis , and in the open left half-plane it is less than one. Its limit along the negative real axis is one, so A-stability here does not imply stiff decay or L-stability.
The nodes are . Their Lagrange interpolation basis on the normalized step is
Integrating these polynomials from zero to each node gives . At the row vanishes; at the integrals are ; at they are . The endpoint integrals also give . These are exactly the coefficients in the original PDF.
Indeed, the degree-three polynomial determined by and satisfies . Integrating it to the nodes gives precisely the stage equations, and integrating to the endpoint gives the update. This proves it is a collocation Runge-Kutta method, specifically the three-stage Lobatto IIIA method.
For an explicit order proof, the collocation integrals imply , and , with powers componentwise. The endpoint weights are Simpson weights, so for . Therefore the eight Butcher order conditions through order four are satisfied:
For example the last expression is , because . These conditions are obtained by matching all elementary differential terms through degree four in the exact and numerical Taylor expansions, not just by testing a scalar linear equation. Nonautonomous equations are included by adjoining .
To exclude higher order, the scalar stability function computed below satisfies . The local defect is therefore nonzero at degree five even on the scalar test equation. Hence .
For a sufficiently smooth exact solution, the centered spatial residual is
Let be the nodal error. It satisfies , with and on the fixed time interval. Part (a) gives , so Duhamel's formula yields
Thus the method is convergent, with second-order spatial error for smooth data and second-order compatible initialization. The homogeneous endpoint values introduce no boundary residual. For nonsmooth L2 data, stable approximating projections and a density argument extend numerical convergence, although the same order need not hold without the derivative bounds used above.
Use the discrete inner product , with endpoints . The centered first-difference matrix is skew-Hermitian, while summation by parts gives
Since is real, the centered advection contribution has zero real part. Therefore
This proves the energy contraction for centered drift-diffusion, and hence stability for every fixed real and every mesh width, in the discrete L2 norm. The extra inequality would make the off-diagonal coefficients nonnegative and support a discrete maximum principle, but is not needed for this energy proof. No time-stepping method is involved here.
For the Dahlquist test equation, write . The amplification roots solve
A root on would require the boundary-locus value
Its denominator cannot vanish on that circle. Setting and simplifying the real part gives
Thus no amplification root can cross the unit circle while . The leading coefficient is also nonzero throughout that half-plane. At , the roots are , both strictly inside the unit disk. Connect any other left-half-plane point to : continuity of the roots, without a boundary crossing or a root escaping through infinity, keeps both roots inside.
On the imaginary axis a boundary root can occur only at , which gives ; there the roots and satisfy the simple-unit-root condition. Hence , including the usual boundary root convention at zero.
Factor the first characteristic polynomial:
The unit root is simple and the other root is strictly inside the unit disk, so the method is zero-stable. Also and , giving numerical consistency. The Dahlquist equivalence theorem therefore makes it convergent.
The mechanism can also be seen directly. The zero-stable homogeneous recurrence has bounded propagators because its two error modes are and . Variation of constants for the perturbed recurrence bounds the error by a fixed multiple of its two starting errors and the sum of the step defects, plus times a sum of errors from the Lipschitz vector field. Absorb the current implicit error term for sufficiently small , then apply the discrete Gronwall inequality. On a fixed time interval the sum of exact-start defects is , giving second-order numerical convergence with second-order starting values. The implicit step is locally well defined, for example by contraction when for a Lipschitz constant .
For the linear multistep method, let and . The exponential-symbol order criterion for a multistep method compares with . Direct expansion gives
Equivalently, substitution of exact smooth values into the recurrence leaves , while the coefficients of cancel. Therefore ; its unnormalized step defect is of order three. The nonzero cubic term excludes order three.
Use the Fourier amplification symbol for the semidiscrete generator. At a mode , the two stencil symbols are
The mass symbol satisfies . The numerator of is increasing in each cosine, since each partial derivative is at least two, and its maximum is zero at . Hence and the generator is real and nonpositive.
Every exact-time mode is multiplied by , of modulus at most one. Parseval identity therefore proves
The method is stable, uniformly in the spatial mesh. This is a semidiscrete conclusion: it imposes no time-step condition until a particular time integrator is applied. For the stated merely square-integrable initial data, cell averages give a well-defined stable initialization, with by Cauchy–Schwarz. Arbitrary point sampling of an L2 equivalence class is not required.
Put , let denote the sum of the four axial shifts, and let denote the sum of the four diagonal shifts. Reading both sides of the PDF stencil gives , where and . The left-hand stencil acts on the time derivative; treating it as a scalar multiplier would lose the compact correction.
Write . Taylor expansion of the symmetric shifts gives
and
For the exact diffusion solution , subtracting gives
The leading coefficient is not identically zero for general smooth data. Thus the normalized local residual is fourth order, and in the question's convention . This is the compact semidiscrete nine-point diffusion scheme; its usual spatial numerical consistency order is four, rather than three.
For integer knots, the recurrence simplifies to
Order-two splines are triangular: and . Applying the recurrence once more gives
For example and . Thus the Cardinal cubic B-spline values are
Therefore
In particular its actual maximum is in this standard normalization; dividing by that maximum would change the requested recurrence normalization.
For order , set . Then . Apply the given divided difference product identity with nodes and multiply by the length of their knot interval:
Using the definition of each lower-order normalized B-spline, the two divided differences are and . Hence the Cox-de Boor recurrence is
For completeness, the product identity itself follows from
and the ordinary divided difference recurrence. Substitution yields the stated convex combination of the two order- divided differences.
The initial order-one splines are the indicators . For repeated knots, a term with zero knot-span denominator is defined as zero; this agrees with the standard limiting basis convention. The recurrence uses the partition of unity normalization with , not a separate rescaling of each spline to make its actual supremum exactly one. The original PDF recurrence has the denominators above; several of these indices and signs were corrupted in the converted TeX.
Use the order of the three Bernstein basis functions given in this part. Endpoint evaluation gives
so both endpoint coefficients have absolute value at most one. At the midpoint,
The triangle inequality therefore gives the quadratic Bernstein coefficient bound
All three bounds are sharp. Indeed has uniform norm one and coefficient vector in this basis. The reversed ordering of endpoint Bernstein functions does not affect these symmetric endpoint bounds.
There are basis splines for the stated knots; the upper limit in the printed basis list is an indexing slip. Let
The strictly increasing sites and give invertibility by the Schoenberg–Whitney theorem. The needed additional matrix property is total nonnegativity of B-spline collocation matrices: every ordered minor of is nonnegative.
Here is a structural justification of that sign property. Knot insertion refines spline coefficients by rules of the form , , with the usual unchanged coefficients before the insertion and shifted coefficients after it. Each coefficient map is a nonnegative rectangular bidiagonal matrix; all its ordered minors are nonnegative, as its nonzero terms preserve row/column order. Products preserve this property by the Cauchy–Binet formula. Insert each ordered sampling site until it has full knot multiplicity. Evaluation at such a break is one of the refined coefficients, with a consistent one-sided convention. Consequently the B-spline collocation matrix is an ordered row submatrix of the product of refinement matrices, proving its nonnegative minors. This also applies to repeated admissible original knots.
Since is invertible and totally nonnegative, . The adjugate identity gives the checkerboard inverse of a totally nonnegative matrix:
Now for any spline , its sampled-value vector is . Hence the coefficient linear functional in the dual basis is exactly
In particular , verifying the hinted formula rather than assuming it. The operator norm of this linear functional is taken for the uniform norm on the spline's interval, containing all sampling sites. Evaluation at a sampling site has norm at most one, so
For the given unit-norm alternating spline, , and the checkerboard signs make all terms in a fixed inverse row align:
Since , this supplies the reverse operator norm inequality and proves the Chebyshev spline coefficient and dual norm equality
This spline attains the operator norm of each coefficient linear functional.
As printed in the original PDF, this claim is false for . The displayed frequency is one, so the function already belongs to the space of trigonometric polynomials of degree at most . Its best approximation is then the function itself, with zero error; for example, gives a zero-approximant error instead. For , zero is indeed the best constant approximation. Thus the literal answer is
The natural intended version has frequency . Set and . The sign function is integrable and satisfies , so its mean is zero. Part (b) makes orthogonal to every degree-at-most- trigonometric polynomial. Part (a), with , now proves
The error is for the unnormalized integral over a period.
The best approximant is unique. If the amplitude is nonzero and another continuous trigonometric polynomial has the same optimal error, equality in part (a)'s pointwise inequality holds almost everywhere. Near each zero of , the function changes sign; if did not vanish at that zero, continuity would force an interval on one side where has the wrong sign, making the integral inequality strict. Thus vanishes at all distinct zeros of . A nonzero trigonometric polynomial of degree at most has at most zeros in one period, since multiplication by turns it into a polynomial in of degree at most . Hence . Zero amplitude is immediate. The same reasoning proves the literal frequency-one assertion when , while retaining the counterexample for larger .

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