The theorem gives
Integration by parts has zero boundary term: the sine vanishes at zero and the Gaussian tends to zero at infinity. Hence .
The same Gaussian majorant and dominated convergence give continuity at zero, where the allowed Gaussian integral gives . The differential equation implies ; continuity at zero fixes that constant. Thus
We first prove the differentiation theorem. Fix and take nonzero with . The measurable difference quotients
converge pointwise to . The mean value theorem and the assumed derivative bound give . In particular is measurable as a limit of quotients along a sequence, and its bound by proves integrability. The dominated convergence theorem, in its parameter-limit form, says that pointwise convergence with a common integrable bound permits convergence of the integrals. Applying it yields
The parameter-limit statement follows from the ordinary sequential theorem by applying it to every sequence of nonzero tending to zero.
For the specific function, , which is integrable by the allowed fact. It is differentiable in , with
The last majorant has integral one on , using the substitution . All three hypotheses therefore hold. The indicator of the parameter domain is one at every point under consideration and does not affect this derivative.
Take . Every quotient class is a polynomial expression in with coefficients from , so . Substitution gives . Thus
This constructs a field containing a root even when no root existed in the original field.
Polynomial division gives a unique remainder of degree less than in every coset. Thus the classes
span the quotient as an -vector space. A linear combination of them that vanishes would be a polynomial of degree less than divisible by , so it is the zero polynomial. They are therefore linearly independent, proving
An irreducible polynomial has positive degree, so its ideal is proper: otherwise would contradict degrees. Every nonzero class has a representative not divisible by . Irreducibility gives , and the Euclidean algorithm supplies polynomials with . Passing to the quotient gives . Thus the quotient is a nonzero commutative ring in which every nonzero element has an inverse, hence a field. Constants embed injectively because no nonzero constant lies in the positive-degree ideal .
Factor
The roots are , so the splitting field is . The real quadratic field does not contain , which adds a further degree two. Therefore
Let . Its odd powers are exactly the four roots, so is the splitting field. The polynomial is irreducible: after the invertible substitution , it becomes , which satisfies Eisenstein criterion at two. Hence
Equivalently the field is , since , and .
First address the general splitting-field request. A splitting field is an extension in which the polynomial factors into linear factors and which is generated over the base field by its roots. For a degree- polynomial, adjoin a root of an irreducible factor. The quotient construction in the preceding parts gives an extension of degree at most . Remove the resulting linear factor and repeat, now with a polynomial of degree over that extension. Induction and the tower law give
The resulting field is generated by the roots and is a splitting field. Repeated roots or inseparability can only reduce the required degrees; separability was not used.
For the specified cubic, put and . Its splitting field is . Eisenstein criterion at two gives . This cubic field is real and therefore does not contain the nonreal , whose quadratic polynomial is . Consequently
For the positive-direction alternative, use the same paired statistic , but reject at level only when . Its one-sided -value is
Because the observed mean difference is positive and the null Student probability distribution is symmetric, the two-sided -value is twice this upper-tail probability, consistent with the supplied and .
The two-sided value is the null-model probability of a test statistic at least as far from zero in either direction as the observation. The one-sided value uses only the direction of larger cross-fertilized heights. They are probabilities under the assumed null sampling distribution, not posterior probabilities that the null hypothesis is true.
At the reported precision, the two-sided result is on the conventional 5 percent boundary; rounding can matter for a strict numerical threshold. The one-sided result is significant at5 percent and supports a positive mean difference if that directional alternative was chosen in advance. Choosing the direction after observing the sign would not justify using the smaller one-sided probability as a prespecified test. The paired design controls shared pot conditions, while the inference still relies on the independence and probability distribution assumptions for the differences.
For a sample of size , define
For the zero-mean Gaussian sample, the standardized vector has independent standard normal coordinates. Apply an orthogonal transformation whose first row is . The resulting coordinates remain independent standard normals: their joint density depends only on squared Euclidean length and the transformation has unit absolute Jacobian. Its first coordinate is , while orthogonal decomposition gives
Thus
The ratio of the first independent standard normal and the square root of the normalized chi-square variable has a Student probability distribution, giving
For the paired height observations, form one cross-minus-self difference per pot. The sampling units for this test are the fifteen differences, not thirty separate plant heights. Under the usual independent normal model for differences, a null mean of zero gives a statistic. The observed statistic is
For the two-sided alternative, reject at significance level if . Its two-sided -value is . This uses the recorded values without performing the numerical calculation forbidden by the question. The normal difference model is what makes the small-sample Student calibration exact.
Assume , as required by the source's selection probabilities, and put . Conditional on the red book's current position, the next independent selection determines its move without needing its earlier history. Selecting the red book moves it left, unless already leftmost. Selecting the plain book immediately to its right moves it right. Every other selection leaves its position unchanged. Thus this position process is a Markov chain on , with
and boundary self-loop probabilities , . These account for every selection and each row sums to one.
Stationarity at the first state gives , hence . When , for the second state substitution of this identity into its stationarity equation gives . More generally, summing stationarity over the initial segment equates its sole outward and inward probability flows:
Write . Then . Normalization gives
The expression is positive also for , since both numerator prefactor and denominator are negative. The uniform case is exactly , when all books are equally likely to be selected. Since both neighboring transition probabilities are positive, the finite chain is irreducible; the displayed stationary distribution is therefore unique.
Starting from a state , let be the first return time, with value infinity if no return occurs. The state is recurrent if and transient if this probability is less than 1. A recurrent state is positive recurrent if , and null recurrent if that expectation is infinite.
If and communicate, choose with and . The Chapman-Kolmogorov equations give, for every ,
If is recurrent, the supplied criterion makes infinite. Summing this inequality shows that is also infinite, so is recurrent. The same argument with the states exchanged gives the converse. Hence recurrence and transience are class properties: states in one communicating class cannot have different answers to that dichotomy.
For the upper function graph, the vertical cross-section of the enclosed region has length , so its area is . A maximizing nonnegative arch therefore uses and in the normal Euler-Lagrange equation. It becomes
Integrating once gives . The concave upper branch has and integrates to . The equal zero endpoint heights force and . Hence
It is a circular arc. To find its parameter, substitute into the length integral: , giving
This scalar equation determines numerically when needed; no explicit solution is required.
The arch is a global maximum in its smooth function graph regime. For , the integrand is concave and strictly concave in its slope. Its supporting-tangent inequality, integrated against any competing function graph with the same endpoint values, has first-order term zero by the Euler-Lagrange equation. Thus . On the fixed-length class this is ; strict slope concavity also gives uniqueness.
The source leaves the length range implicit. A twice continuously differentiable function graph of this form needs , giving . At the straight function graph is the degenerate solution. The semicircle limit has vertical endpoint tangents and is outside that smooth function graph class. For , no arc in the claimed smooth function graph family exists, so the stated formula cannot describe a twice continuously differentiable maximizing function graph under those unrestricted data. Allowing overhanging curves changes the admissible class.
Figure 1.
The circular arch and its smooth graph length range
. Details.
Write . For endpoint-zero variations , the first variations are
For a normal constrained extremal, choose a variation with . Given any , use the implicit function theorem to choose a small correction in the direction so that preserves the constraint. Differentiating it and the stationarity condition at zero gives
Integrate the derivative-of-variation term by parts. Since the variations vanish at both endpoints, the boundary term is zero. The fundamental lemma of the calculus of variations then gives
The regularity condition on the constraint is what permits the coefficient of to be normalized to 1. In a degenerate case, the general multiplier statement uses with the two coefficients not both zero; the source's displayed form is the normal case.
For a string described as a function graph , its arc-length element is . Inextensibility therefore gives
This also forces , with equality only for the straight function graph.
For fixed real , multiplication by does not change the absolute value. The product integrability proved in (ii) therefore justifies Fubini theorem in the following calculation. Set in the inner integral:
Thus
The positive exponential convention in the source is used throughout; no normalization factor is introduced under that convention.
Choose measurable versions of the two Lebesgue integrable functions and consider . Translation and the corresponding linear change of variables preserve Lebesgue measurability; one can first use Borel versions and then disregard the resulting null-set changes. Tonelli's theorem and translation invariance give
Fubini theorem therefore shows that the section in is integrable for almost every . Define by that section integral where it exists and by zero on the exceptional null set. Fubini theorem also makes this a measurable Lebesgue integrable function, with
Its almost-everywhere defining formula is precisely the desired convolution. This construction explains why an everywhere-existing pointwise integral is not required.
Fubini's theorem for the product of two sigma-finite measure spaces states that an integrable measurable function on the product has integrable sections almost everywhere, the section integrals define Lebesgue integrable functions, and both iterated integrals equal the product integral. The integrability hypothesis is absolute integrability. For nonnegative measurable functions, Tonelli's theorem gives equality of the possibly infinite product and iterated integrals without first assuming finiteness.
The displayed function is not Lebesgue integrable. Its value at the origin can be assigned arbitrarily, since a point is a null set. On and ,
Consequently Tonelli's theorem gives the divergent lower bound
The signed iterated integrals illustrate why the hypothesis matters. For , , so integration first in and then in gives . Integrating first in gives , using . Exceptional boundary sections have measure zero. Thus finite iterated values do not establish product integrability.
Use for . For the source's functions,
The last integral follows by the substitution and integration by parts. Since converges, (ii) permits summing the integrals and identifies an integrable almost-everywhere sum.
For every , the geometric series gives
The functions vanish on , and the single endpoint does not change the integral. Use the supplied integral of to obtain
The estimates include negative through its absolute value, and the case gives zero on both sides.
Put . These are nonnegative measurable functions increasing to , possibly initially with value infinity. Monotone convergence theorem gives
An infinite value on a set of positive measure would force an infinite integral. Thus is finite almost everywhere and, after setting it to zero on its null exceptional set if desired, is integrable.
Where is finite, the real series is absolutely convergent. Define its sum to be there and zero on the exceptional null set. Measurability follows as an almost-everywhere limit of partial sums, and almost everywhere gives integrability. Every partial sum is dominated by , so dominated convergence theorem yields
In fact the convergence is also in the integrable-function norm:
The monotone convergence theorem says that if almost everywhere and the functions are measurable on a measure space, then
with infinite integrals permitted. The limit is measurable after the usual modification on any exceptional null set.
The dominated convergence theorem says that if measurable functions converge almost everywhere to and satisfy almost everywhere for an integrable nonnegative function , then is integrable and
The theorem applies equally to real or complex functions. In particular domination must be by one fixed Lebesgue integrable function, rather than by a different bound for each .

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