Extend each element of to fix . A one-point extension of a permutation group is a transitive permutation group such that
with the induced action on equal to the prescribed action. The stabilizer subgroup equality is the substantive condition: merely adjoining an element that moves does not suffice. If , the orbit-stabilizer theorem gives .
Use the Sylow theorems. The number divides and is congruent to one modulo . Since , it is either one or . Suppose . Different subgroups of prime order intersect trivially, so their nonidentity elements occupy places, leaving only nonidentity elements of other prime orders.
If neither the Sylow -subgroup nor the Sylow -subgroup is normal, then and . Indeed divides , and its possible divisor cannot satisfy the Sylow congruence; the smallest remaining nontrivial possibility is at least . Likewise any nontrivial divisor of is at least . Their elements would require at least
places, since the excess is . Hence some Sylow subgroup of order is normal.
In the quotient by this normal subgroup, the largest prime has a normal Sylow subgroup: for a group of order with its Sylow count divides and so equals one. Pulling back gives a normal subgroup of order . Inside it, the subgroup of order is again the unique Sylow -subgroup. It is characteristic in that normal subgroup and therefore normal in , contradicting . Thus .
Let be this normal Sylow subgroup. In , of order , its subgroup of order is normal by the same argument. Its preimage is a normal Hall -subgroup. The series
has factors of orders , hence cyclic and abelian. Therefore This establishes solubility before using any Hall-existence conclusion that itself assumes solubility.
We prove Hall subgroup existence in soluble groups by induction on . The trivial group is immediate. Choose a nontrivial minimal normal subgroup , elementary abelian of order by part (c). Induction gives a Hall -subgroup of ; let be its full preimage.
If , then itself is the required subgroup. If and , apply induction inside the soluble subgroup to obtain a Hall -subgroup of . Since and are both -numbers, is Hall in too.
It remains to treat and . Then is a -group. If , the subgroup one works. Otherwise choose a minimal normal subgroup of , an elementary abelian -group with . Let be a Sylow -subgroup of . As and , we have . The permitted Frattini argument gives
The last equality uses and the normality of .
If , then is a power of , hence a -number. Apply induction to and multiply indices as before. If , then is a nontrivial normal -subgroup. Induction in gives a Hall -subgroup whose full preimage in is Hall, since its additional factor is a -number. These cases exhaust the possibilities, proving existence for every prime set. No unproved complement theorem or conjugacy theorem for Hall subgroups was inserted into the proof.
A Hall subgroup for a prime set is a subgroup whose order has only prime divisors in and whose index has no prime divisor in :
Here one is allowed in either class, and is the complementary set of primes. Equivalently contains the complete prime-power contribution to for each prime in .
Let be a minimal normal subgroup. Its commutator subgroup is characteristic in , hence normal in . Minimality makes or . The latter would prevent the soluble group from having a terminating derived series, so and is abelian.
Choose a prime dividing . In a finite abelian group its Sylow -subgroup is characteristic, so minimal normality makes this subgroup all of . The subgroup is nontrivial, characteristic and hence normal in . Minimality again makes it all of . Thus
an elementary abelian p-group. Both abelianness and minimal normality are essential to the two characteristic subgroup arguments.
If , induction gives , because commutators of elements of a subgroup are also commutators in the larger group. Thus termination of the derived series of forces termination for .
For a normal subgroup , the quotient map sends to the commutator of their images. Surjectivity then gives
Consequently subgroups and quotient groups of a soluble group are soluble. The assertion about a quotient uses a normal subgroup; it is not a quotient by an arbitrary subgroup.
The derived series is , , where the bracket denotes the commutator subgroup. The group is soluble if
Equivalently it has a finite series with abelian factors. The trivial group is included.
An invertible time-series representation recovers the driving white noise from current and past observations. In the inverse series the support condition is therefore
Again the series must converge. Stable invertibility uses , which ensures mean-square convergence when has finite variance. Merely writing a bilateral inverse is not invertibility in this one-sided sense: it may require future observations. For a general correlated input , square summability of alone is not the same sufficient condition as it is for a white noise input.
A causal time-series representation uses only the present and past driving white noise. Thus the coefficient condition is
The series must have its stated convergence meaning. For centered white noise of positive finite variance, is sufficient and necessary for mean-square convergence. In the usual stable-filter convention one imposes the stronger . A bilateral stationary linear process need not be causal: terms with involve future driving values.
Write and . The Bühlmann model uses the finite structural parameters
Here is the expected process variance and is the variance of hypothetical means. The target is the latent conditional mean , rather than the realized next count. The Bühlmann credibility estimate is the best affine predictor of that target under mean squared error.
The law of total expectation and law of total variance give and . Conditional independence gives for , and the law of total covariance therefore yields
To derive the optimal predictor, consider . Minimizing with respect to the intercept gives . Thus . The linear least-squares projection normal equations are
For , subtraction of any two equations forces all equal. Substituting a common coefficient then gives . Equivalently, the mean squared error of the centered predictor is , a convex quadratic with precisely these normal equations. Hence
The ratio notation assumes ; the credibility factor formula also handles . If , the target is the constant almost surely. If , one observation already equals almost surely, and the average gives it exactly. If both vanish, the target and observations are constant.
The result optimizes over affine functions of the observations. It need not equal the unrestricted posterior mean; exact Bayesian inference generally depends on the whole prior and likelihood, whereas the Bühlmann credibility estimate uses these second-moment structural parameters.
For excess of loss reinsurance the insurer pays each claim up to its retention level:
The cap applies separately to every claim. In particular the retained annual loss is , rather than a single cap on the annual total.
Let be the cumulative distribution function for the claim size on risk , and put . The retained severity on that risk has the original probability density function on and an atom of a measure at of mass . Thus has a compound Poisson distribution with rate and the mixture of these capped severity laws. The mixture's mass at is .
For the capped claim moments, use the tail integral formula for moments. Since for and is zero for ,
Substitution into the compound Poisson distribution moment formulas gives
Equivalently, the integrals are and . The annual variance uses the retained raw second moments; subtracting their squared means would omit the variation in the Poisson distribution count.
For quota share reinsurance the insurer retains the same fraction of each claim, so
The annual retained loss is consequently . Each transformed risk severity has probability density function for . The mixed transformed severity, with the same weights , still gives a compound Poisson distribution. Scaling the expected value and variance gives
This agrees with the general retained-claim formulas because and .
Let be the probability generating function. For the series can be differentiated term by term: is finite, even without a finite claim-count expected value. Multiply the Panjer claim-count class recurrence by and put . Then
Hence
This argument is valid throughout the open unit disk. Values at boundary points may be obtained by a limit when the required derivatives exist; one need not assume to establish the identity.
Take increasing to mean strict growth on every nonempty time interval; otherwise a constant family has no uniquely determined driving point. The half-plane-capacity parameterization imposed below guarantees strict growth. For , define the increment hull in the mapped domain by
This definition includes filling and boundary conventions automatically. Its mapping-out function is . The Loewner local growth property means
for every finite within the parameter range. Equivalently, the mapped increments have uniformly vanishing diameter on compact time intervals.
For fixed , the nonempty compact Euclidean closures are nested as decreases. Their diameters tend to zero, so their intersection is a singleton. Its point lies on the real axis: the imaginary part of any point in a hull is at most its enclosing radius. Define the Loewner transform by
Since lies in each closure, every point of is at distance at most from it.
To prove continuity, choose and write , . Then , and . The continuity estimate from part (i) gives
The right-hand side tends to zero uniformly on compact time intervals. Applying the same inequality with the earlier time as the base proves left continuity as well. Thus the Loewner transform is continuous.
Now impose . The half-plane-capacity composition rule follows by composing Laurent expansions at infinity and gives
For a point not yet swallowed, put and . The increment is contained in the half-disc of radius centred at . The continuity estimate first proves continuity of : its increment is bounded by . The differentiability estimate for a mapping-out function then gives, when is small enough,
On a compact interval before swallowing the denominator stays away from zero. Divide by and let . The local-growth property makes the error tend to zero. The analogous backward quotient has the same limit, using continuity of and . Thus the Chordal Loewner equation follows:
The initial value follows from , hence . Without the capacity parameterization, the same argument gives , interpreted with the capacity clock.

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