Interpret the normal-operator source condition as the displayed intersection condition: there is with . Fix any and put . The subgradient optimality condition for the artificial-data objective is
It holds because its first term equals . By convexity, this is sufficient for global minimality, proving the forward implication. Conversely, if minimizes that objective, the same optimality condition gives
Taking proves the intersection condition. Thus the two conditions are equivalent when the source vector is allowed to be zero.
The printed additional requirement is not equivalent in general. For and , the displayed source condition holds, and choosing makes the minimizer, but forces . A nonzero-source version needs an additional hypothesis, such as requiring ; it cannot be inferred from the printed intersection alone.
Assume the known covariance matrix is positive definite. The Gaussian likelihood, up to constants, is
Its gradient is . The negative Hessian matrix is positive definite because has full column rank. Thus the unique maximum-likelihood estimator is the generalized least squares estimator
It is unbiased, and multiplication of its linear coefficient matrix by gives
In fact . Equivalently, a whitening transformation premultiplies and by , after which ordinary least squares applies. There is no extra factor when is the complete known covariance; such a factor appears if only a shape matrix is known and .
Retain the random-slope linear mixed model of part (e), but replace the within-laboratory independent error covariance by continuous-time autoregressive residual correlation:
Errors from different laboratories remain independent and are independent of the random slopes. The resulting marginal covariance within laboratory is
The exponential decay applies to the conditional errors, not the entire marginal correlation, which also contains the shared random slope.
Use nlme, since lme4::lmer does not fit this general residual correlation structure. With a data frame containing the observed variables, suitable code is
library(nlme)
dat <- data.frame(size = size, days = days, lab = lab)
dat <- dat[order(dat$lab, dat$days), ]
tumour_cor <- lme(size ~ days,
random = ~ 0 + days | lab,
correlation = corCAR1(form = ~ days | lab),
data = dat, method = "REML")
Here corCAR1 estimates , the error correlation one day apart; correlation at separation is . This works for noninteger or unequally spaced days. At equally spaced integer days, corAR1(form = ~ days | lab) gives the corresponding discrete-time construction when its parameter is positive. Distinct times within each error series are required: separate tumours with repeated day values should have separate series identifiers or an additional independent-error component, rather than being assigned perfectly correlated errors. The continuous-time autoregressive residual correlation documentation describes the grouping and continuous-time conventions: stat.ethz.ch/R-manual/R-patched/library/nlme/html/corCAR1.html. The fixed days term here follows the fitted output rather than the inconsistent command in part (e).
The Arzelà-Ascoli theorem says that a uniformly bounded, equicontinuous family of continuous functions on a compact metric space is relatively compact in the uniform norm. Thus every sequence in that family has a uniformly convergent subsequence, and its limit is continuous.
Put . By submultiplicativity of the operator norm, , so the Neumann series converges absolutely in the complete finite-dimensional matrix space. Its partial sums satisfy
Taking limits gives the inverse and a quantitative remainder bound:
To establish two actual Fréchet derivatives, use the resolvent identity
For fixed and sufficiently small , factor and apply the Neumann series to the second factor. This proves that , that is locally bounded, and that . Subtracting in the identity leaves . Thus is the Fréchet derivative.
Near zero, , uniformly in the operator norm. Hence, as a linear operator in ,
This proves differentiability of at zero, giving
The order of multiplication matters: the second Fréchet derivative is the symmetric bilinear map , not .
Set and let be the elementary symmetric polynomial of degree in the interior knots, with . Expand the Marsden identity in powers of . The coefficient of on the left is ; that coefficient in is . Comparing and cancelling the sign proves the monomial B-spline coefficients:
For this gives partition of unity on the basic interval. For it gives the Greville abscissae, the arithmetic means of the interior knots. For the top degree it gives their product. When , only occurs and the empty symmetric polynomial is one.
Write . Begin with distinct increasing knots so ordinary polynomial interpolation is unambiguous. The two interpolants agree at the common knots . Their difference is consequently a scalar multiple of the monic polynomial of degree .
The leading coefficient of an interpolant is its highest divided difference. Thus this scalar is
The equality is precisely the divided-difference recurrence. This proves the Lee interpolation identity:
For the common-knot product is empty; the same argument is a difference of constants. Interpret as to obtain the usual half-open order-one B-splines. Repeated knots use the standard confluent or limiting interpretation, where the interpolation data are defined.
Sum over . The right side telescopes to . When , the first interpolation nodes all lie below , so . The last interpolation nodes all lie above , so interpolates the polynomial of degree and equals it identically. Hence the Marsden identity follows:
The half-open intervals tile the line, so exactly one term contributes to . It equals one almost everywhere.
Choose the Shannon scaling mask, a -periodic low-pass filter of a multiresolution analysis which equals one on and zero on the rest of . On the support of its product with equals ; outside that support both sides vanish. Its Fourier coefficients give
so it also has the required symbol representation. The inverse Fourier transform gives the Shannon scaling function
This sinc function has norm one. It illustrates why the Fourier transform convention in part B must allow transforms: the Shannon scaling function is not absolutely integrable on the line.
Use the unnormalized Fourier transform in the question and the Plancherel theorem, with inverse factor . For a general scaling function, the transform is interpreted in the sense; the printed integral need not be absolutely convergent. All frequency identities are almost-everywhere statements.
Changing variables in the Fourier transform gives
Thus taking the transform of the scaling refinement equation gives , or
Conversely the same calculation and injectivity of the Fourier transform recover refinement, with convergence understood in .
To justify both the orthogonality assertion and this convergence precisely, put . It belongs to by monotone integration. The Plancherel theorem gives
Hence orthonormality of all integer translates is equivalent, by uniqueness of Fourier coefficients in L1, to the periodized-energy condition
When this holds, the squared norm of is , so square-summable coefficient series converge in . In the converse direction the refinement identity and give, by splitting the periodization of into even and odd translates,
Thus is bounded and its Fourier coefficients are square summable. If are its Fourier partial sum, then
This verifies the transformed refinement series converges to , completing the equivalence of the two pairs of conditions without imposing an unnecessary assumption on .
An orthonormal multiresolution analysis consists of closed subspaces of the L2 space with , dense union, intersection , and the dilation rule . A scaling function has integer translates forming an orthonormal basis of . Equivalently,
form an orthonormal basis of . Let . Density and the trivial intersection imply .
Nesting gives the scaling refinement equation , with the coefficients in the normalized finer-scale basis. Orthogonality of the translates gives . Its Fourier form is the quadrature mirror filter identity , where .
Set and define in . Its high-pass symbol is . The matrix
is unitary almost everywhere. Under the identification of with its finer-scale coefficient space, this two-channel unitary transform splits that space into the translates of and the translates of . The latter are therefore an orthonormal basis of . Dilating gives an orthonormal wavelet basis
This wavelet completion of a multiresolution filter explains how the multiresolution analysis supplies a single orthonormal wavelet. The argument uses coefficient-space completeness, not just pairwise orthogonality.
Use the weak notion of a typical set. For a word write . The definition is
A weakly typical sequence therefore has probability between and . Words containing zero-probability symbols are excluded. These two bounds and the weak law of large numbers provide the three conclusions below.
Write , and . Since the background scalar has no spatial gradient,
Also . These are the linearized scalar-field matter projections; gradient energy first contributes quadratically.
There is a source convention defect in the shear formula. For the stated positive shift and spatial metric with , direct substitution into the extrinsic curvature gives the positive-shift scalar shear convention
There is no extra Laplacian in the definition of . Equivalently use : then the trace-free term has the printed minus sign and . This latter convention retains the printed momentum-constraint form. The source mixes these two choices.
At first order and . Combining their difference with gives
For the momentum constraint, differentiating the tensor above gives
For nonzero Fourier wavenumber, and absorbing the homogeneous integration mode into the background, the consistent momentum constraint is
Linearizing the scalar equation, the shift-advection term and lapse-gradient times scalar-gradient term vanish at this order because the background is spatially homogeneous. The remaining equation is
Insert , differentiate its lapse term, and use . The two background-acceleration terms combine into . Hence the perturbed Klein-Gordon equation with background lapse is
This scalar evolution equation and the Hamiltonian constraint agree with the displayed targets after the shear conventions are repaired.
For the subsequent essential spectrum arguments, the discrete-spectrum definition must use closed, rather than the printed unshifted range. With that correction, means exactly that is finite-dimensional and is closed; this includes the case is in the resolvent set.
A closed-range bound on the kernel complement supplies the useful equivalence
For the forward implication, is a bounded bijection between Banach spaces, so the bounded inverse theorem applies. For the reverse implication, any Cauchy sequence of image points has a Cauchy sequence of preimages in , and completeness gives a preimage of its limit.
Now decompose a bounded sequence as with , . If converges, the lower bound makes a Cauchy sequence. The finite-dimensional vector space makes the bounded have a convergent subsequence. Their sum has a norm-convergent subsequence.
Conversely, if every bounded sequence with convergent images has a norm-convergent subsequence, the kernel cannot be infinite-dimensional: an orthonormal sequence in it would have zero images and no convergent subsequence. If the range were not closed, the lower-bound equivalence would provide unit vectors with . Any norm limit would lie in both and , hence be zero, contradicting its unit norm. This proves the required sequential properness for a self-adjoint operator equivalence.
The spectral-shift repair is essential for later parts. On , take . Its range is not closed, but is an isolated eigenvalue with one-dimensional eigenspace and closed shifted range. The printed definition would incorrectly place in the essential spectrum, although no singular Weyl sequence exists there: on the complement of that eigenspace, .
No. Reuse the diagonal operator on sequence space on . Its kernel is zero, hence finite-dimensional. Let be the truncation of to its first coordinates. Each lies in the range, while in . The limit is not in the range because its formal preimage is not square summable. Thus finite-dimensional kernel does not imply closed range. Equivalently the unit vectors violate every positive closed-range bound on the kernel complement.
If unit vectors satisfy , a bounded inverse would give . Hence belongs to the spectrum of a bounded operator.
Conversely a spectral point is real by the preceding argument. Put , again a self-adjoint operator. If , then is injective with closed range. Its range is dense by image-kernel orthogonality for an adjoint, so it is bijective with a bounded inverse, a contradiction. Thus this infimum is zero; choose unit with . We have proved
Such a sequence is a spectral Weyl sequence. No weak convergence is required here; nonreal are ruled out by the lower bound in the preceding solution.
For a bounded self-adjoint operator, is orthogonal to its range exactly when for every , or equivalently . Consequently
This is image-kernel orthogonality for an adjoint. Taking the double orthogonal complement gives the closure; it does not assert that the range itself is closed.
The intended self-adjoint operator identity is , with the inner product linear in its first argument. The printed second must be . Taken literally, the printed identity forces : put and then vary . Its spectral conclusion is then trivial, but it does not define self-adjointness.
For the corrected identity, is real. If , the Cauchy-Schwarz inequality gives
Thus is injective and bounded below, so its range is closed: a convergent image sequence has a Cauchy sequence of preimages. Its range is dense because its orthogonal complement is , also zero by the same lower bound. Hence it is surjective with inverse norm at most . Therefore
No. On the complex l2 sequence space, let . This is a bounded self-adjoint operator. At , , so zero is not an eigenvalue (an eigenvector must be nonzero). But has no preimage in : its only formal preimage is the constant-one sequence. Thus is not surjective and
Alternatively excludes a bounded inverse. This example separates the spectrum of a bounded operator from its point spectrum.

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