The two independent binomial distributions give fitted event probabilities and . Their odds ratio and log odds ratio are
Using the log odds ratio variance from a two-by-two table,
The stated normal approximation and quantile approximately two give the confidence interval
Exponentiation gives the corresponding odds ratio interval . Its lower endpoint exceeds one.
Within the displayed sequential response selection model, makes every attempt's nonresponse probability independent of , and hence gives the outcome-independence needed for complete-case analysis. The estimate suggests that larger outcomes are associated with greater odds of an unsuccessful attempt. Per one-unit outcome increase, the fitted odds ratio is , with the reported interval transformed to .
The confidence interval for includes zero, so there is no rejection of outcome-independent missingness at the five-percent level within this model. This does not establish that the missing at random assumption is true: the interval also allows appreciable outcome dependence, and inference depends on the chosen selection model. The intercepts describe response levels, not independence from the outcome. Nor can the respondents' mean and standard deviation establish the missing outcomes' distribution. There are unobserved outcomes, about , so conclusions about the full trial depend materially on the missingness assumptions.
Let indicate an observed outcome. Fitting the conditional outcome model to responders requires
with a positive observation probability over the relevant predictor support. This is conditional missing at random for the predictors used in the regression: after conditioning on them, observation must not further select participants by their unobserved outcome. It gives , the complete-case regression under conditional missing at random condition. Correct specification of the conditional mean model is also required. Missing completely at random is sufficient but stronger; simply assuming missingness depends only on a post-randomization variable excluded from this model would not suffice.
Use a baseline-adjusted linear regression for an intention-to-treat analysis:
Condition on the observed baseline covariates and assignment. The parameter of primary interest is , the mean effect of assignment to the experimental intervention, under this constant-effect conditional mean model. Independent normal distributions with common variance give the usual Gaussian likelihood and regression inference. Prognostic baseline covariates improve precision by explaining outcome variability.
Do not include the actual intervention-use variable as an ordinary adjustment variable for this estimand: it is measured after assignment and can mediate the effect being estimated. Post-randomization adjustment changes a treatment estimand; the resulting coefficient on would generally represent a different comparison. Participants remain in their assigned groups even when adherence differs.
Let and . The variance-matching quota share reinsurance in this part has the nonnegative retained fraction . For claimwise retentions , its existence within follows from . The comparison below only needs the matching contract specified in the question.
Because , the variance and covariance identities give
The Cauchy-Schwarz inequality bounds . Therefore the quota share comparison at matched retained variance is
The last expression is the sum of variances under the matching quota share reinsurance. Hence
If , the given matching contract forces , so all relevant totals are constant and equality holds. For , equality in the bound is equivalent to almost surely.
Set . The compound Poisson distribution variance identity and the per-claim excess of loss reinsurance payouts give
Apply differentiation under the integral sign. The endpoint terms in the first two terms cancel, while the last integrand is zero at its lower endpoint. Equivalently, differentiate the two payout squares inside their expected values; the finite second moment supplies a dominating integrable function. This gives the total variance stationary condition for excess of loss
Hence the specified equality makes . When , its interpretation is , where the mean residual life is .
For the exponential distribution of mean , and
Thus is negative below and positive above it. The variance-minimizing exponential retention is the unique global minimizer
For an explicit value, put . The capped claim moments and the excess-claim second moment give
The sign argument establishes global minimality, rather than just stationarity.
Under quota share reinsurance, and . Write . Then
The variance-minimizing quota share split is therefore
For positive claims and this minimizer is unique. If the aggregate has zero variance, every retained fraction gives the same zero objective.
Use the shape-rate convention for the gamma distribution. A shape and rate give expected value and variance . The two moments here force and . Thus , and the geometric-sum moment-generating function becomes
Put , and . Then , , and
Consequently the geometric sum of shape-two gamma variables has the same probability distribution as the sum of two independent exponential distributions with rates . Their convolution of independent random variables yields
The probability density function is zero for . It is nonnegative because , and its integral is
This verifies normalization directly. An alternative check uses the conditional gamma distribution with shape :
which is exactly the same density. The expected value supplies a further check.
For the exponential distribution of mean , . Substitution into the geometric-sum moment-generating function gives
This is the moment-generating function of an exponential distribution with rate . By the uniqueness theorem for moment-generating functions, the geometric sum of exponential variables therefore has probability density function
Its expected value is , agreeing with in the random sum of independent claims formula.
Condition on . Since the amounts are independent and identically distributed random variables and are independent of , their moment-generating functions multiply:
Summing against the positive-support geometric distribution gives the geometric-sum moment-generating function
The finite-transform domain is and . The terms are nonnegative for real , so if the latter condition fails the sum diverges. For both conditions always hold, since the claims are positive; thus the same calculation always provides the Laplace transform of a nonnegative random variable. Positivity alone does not guarantee a finite moment-generating function on a positive neighbourhood of zero.
There is at least one strictly positive amount in the portfolio. Hence ; zero carries no atom of a measure to add to the continuous laws in the next two parts.
A nilpotent element belongs to every prime ideal and therefore to every maximal ideal, so
For the reverse containment, let be nonnilpotent. The localization of a ring is nonzero: if there, some power of would annihilate in . This is still a finite-type integer algebra, because it can be presented as .
Choose a maximal ideal of . Its residue field is a finite-type integer algebra, hence finite by part (a). Consider the image of in . It is a finite integral domain containing , so it is a field: multiplication by a nonzero element is injective on the finite set , hence surjective, and therefore has an inverse in .
The kernel of is consequently maximal. The image of is nonzero, since became a unit in and remains a unit in its nonzero residue field. Thus . Every nonnilpotent element can therefore be avoided by a maximal ideal, giving
This radical equality for finitely generated integer algebras uses part (a) to ensure that the contraction of the localized maximal ideal is maximal. Such contraction is not generally maximal for arbitrary localization of a ring; the finite-field image is the decisive additional step. The zero ring is immediate, with the intersection of its empty set of maximal ideals understood as the whole ring. No general theorem that integer algebras are Jacobson rings is being quoted.
The characteristic of is either a prime or zero. In characteristic , it is a finitely generated algebra over . The course's Zariski lemma says that a field finitely generated as an algebra over a field is a finite algebraic extension of that field. Therefore
It remains to exclude characteristic zero. Write . Because is then a field containing , also . Zariski lemma makes finite algebraic. Each has a monic equation with rational coefficients. Choose a positive integer clearing all their coefficient denominators. Each is then integral over , so is integral over . This algebra equals : it contains the given integer algebra , and already lies in the field .
An integral field extension forces the base domain to be a field. To see it here, for a nonzero its inverse in satisfies
Multiplying by gives
Thus would be a field. But choose a prime . Reduction modulo is a well-defined map , so the nonzero element is not invertible in . This contradiction rules out characteristic zero. Therefore the finite-field theorem for finitely generated integer algebras yields
This uses Zariski lemma and elementary integrality, not a claim that a field merely finitely generated as a field extension must be algebraic.
A generic linear projection over an infinite field is not enough for the stated arbitrary field . Instead use Noether normalization by weighted substitutions to make the defining polynomial monic in one coordinate.
For , choose an integer at least every exponent occurring in a nonzero monomial of , put , and use the triangular polynomial change of variables
Here because the irreducible polynomial is nonconstant. This is an automorphism, with inverse , . A monomial contributes a highest power
These weights are all distinct: the exponents are base- digits bounded by . All other terms in the expansion have smaller degree than that monomial's weight. Therefore the highest-degree term in the transformed comes from exactly one original monomial and has a nonzero coefficient in , independent of the other . No assumption about the cardinality or characteristic of enters this argument.
Multiply by the inverse of that coefficient to obtain a monic polynomial of some degree , where . The same construction for simply rescales to be monic over .
The monic polynomial quotient is finite free because division by gives a unique representative of degree less than . Thus
as -modules. Uniqueness follows because any nonzero multiple of a monic has degree at least . In particular the map is injective.
The induced morphism
is finite, since its coordinate algebra is a finite module, and flat, since tensoring with a finite free module is a finite direct sum of copies of the original module and preserves exactness. This is a finite flat Noether normalization of an affine hypersurface, with the explicit projection coordinates . The construction actually applies to any nonconstant polynomial, not only an irreducible one.
We use Zorn's lemma, and no basis or other existence theorem from linear algebra. A subset is linearly independent if every finite relation forces every coefficient to be zero.
Order the linearly independent subsets by inclusion. This partially ordered set is nonempty, because the empty subset is independent. An empty chain has the empty subset as an upper bound. For any nonempty chain, its union is independent: every finite subset of that union lies in one member of the chain. Indeed choose one chain member containing each of its finitely many vectors, then take the largest among that finite collection of comparable members. Every finite relation in the union is therefore a relation in an independent chain member. The union is an upper bound.
Zorn's lemma gives a maximal independent subset . If were outside its span, then would still be independent. In a finite relation
a nonzero could be inverted in the field , placing in the span of . If , independence of forces the remaining coefficients to be zero. This contradicts maximality, so spans .
Define the free module on as the direct sum : its elements are coefficient families with finite support. The map
is a module homomorphism. Spanning proves surjectivity; independence proves injectivity. Hence the vector-space freeness from maximal independence gives
Finite support is essential; this is a direct sum, not an unrestricted product. The zero vector space uses and is free of rank zero. The proof for arbitrary vector spaces explicitly uses the axiom of choice through Zorn's lemma.

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