A credibility estimate blends the risk's own sample mean with a population or prior expected value. In the basic equal-exposure form it is , where the credibility factor is the weight attached to the individual experience. More data ordinarily increase that weight; greater within-risk variation relative to between-risk variation reduces it.
Write for the conditional claim expected value, keeping for the prior-level parameter. Normalization of the probability density function gives
At interior points of its finite domain, differentiation under the integral sign yields
This is an instance of the exponential-family derivative identities for natural parameter . The minus sign is present in the PDF and is lost in the converted TeX. The conditional variance is likewise .
Differentiate the log of the natural conjugate prior:
Integrate on a compact subinterval and then let its endpoints approach those of the parameter interval. The prescribed vanishing of the prior density eliminates the boundary term. Since , monotone convergence theorem justifies the limit of its expectation, and the identity gives
In particular the assumed proper prior and boundary conditions themselves establish this first-moment integrability.
For and , conditional independence makes the likelihood function proportional to . Multiplication by the prior distribution gives the Bayesian posterior
Thus this is a conjugate prior family, with updated parameters
The integration-by-parts calculation for the posterior mean also needs vanishing posterior boundary values. Here that property can be checked, rather than assumed. Let be the essential lower and upper endpoints of the claim support. Every nondegenerate tilted claim law has , so the established prior mean satisfies . Supported observations have ; hence . At a finite parameter endpoint the prior's vanishing forces , because its exponential factor has a finite positive limit; the increased power makes the posterior vanish there too. At , choose with positive base-measure mass below . Then and the unnormalized posterior is at most . At , choose with positive mass above to obtain the corresponding bound . These bounds also ensure posterior propriety at infinite endpoints. This is the endpoint control for a Laplace-family conjugate posterior.
Apply the previous score integration to the Bayesian posterior. The natural conjugate credibility identity is
Thus is the credibility factor. This is an exact posterior mean, rather than an affine approximation to one.
For the specific shape-two gamma distribution, take
Then and . The gamma rate gamma conjugacy prior is
that is, . Its normalizing constant in the notation of the question is . The gamma distribution density vanishes at both zero and infinity for . The posterior has shape and rate , so its conditional-mean posterior mean is again .
For the last calculation, gamma distribution integration gives
The second identity requires the printed . Therefore the expected process variance and variance of hypothetical means, denoted by in this question, are
Consequently , and the Bühlmann credibility factor agrees with the exact Bayesian weight:
This is the exact Bühlmann credibility for gamma claims, expressed using the reciprocal rate as the random scale. The symbols here are the process and between-risk variances, respectively; their roles should not be interchanged when comparing with other notation for the Bühlmann model.
Use the classical risk model surplus , with , and write for its ultimate survival probability. The first-claim decomposition for survival probability follows by conditioning on the first arrival time of the Poisson process. That time has exponential distribution of rate . A claim at time leaves capital if , after which the Markov property restarts the same risk model. Consequently
Put and change variable :
The convolution is continuous since is bounded and is integrable. Differentiating proves the survival integro-differential equation
For the specified claim law, expand its probability density function as . This is an equal-weight mixture distribution of exponential distributions with rates and . In the convolution, set to obtain
Since , the requested coefficients are
For the exponential-mixture differential equation for survival probability, define , and . Differentiating the integrals yields
Apply to the last equation, where . The first two equations eliminate , giving
Thus
The characteristic polynomial factors as
The ordinary differential equation therefore has solution .
The claim expected value is . The relative safety loading is , and the given zero-capital survival probability is . The limit at infinity sets . A third condition comes from the original survival integro-differential equation: its convolution vanishes at zero, so . Therefore
which gives and . The final survival probability and ultimate ruin probability are
Both exponential coefficients of are positive. Hence increases from to one, and decreases from to zero. The initial slope is essential: the two stated boundary values alone do not determine all three constants of the eliminated differential equation.
Let . This polynomial ring is a unique factorization domain of Krull dimension three. For a height-one prime in a unique factorization domain , choose a nonzero element of it and an irreducible factor belonging to . In a unique factorization domain, is prime, so is a nonzero prime ideal contained in . Strict containment would give a chain of length two. Thus
If has height three, it is maximal: any strictly larger proper prime would extend a length-three chain and contradict . The Weak Hilbert Nullstellensatz over the algebraically closed field then gives
for some . This proves both requested generator assertions.
For the monomial curve with exponents three, four and five, put
All three map to zero under the given parametrization, so . Reduce any monomial using , and . Each reduction decreases the sum of the exponents of , so it terminates. Every polynomial has, modulo , the form
Its image is . These three terms occupy different exponent classes modulo three, so they cannot cancel. A zero image forces each . Consequently
The quotient is the domain , hence is a prime ideal. It is finite free over , with basis of a module , by the same normal-form argument. Its dimension is therefore one, using that integral extensions preserve Krull dimension. The polynomial-ring height and dimension formula gives
For the generator obstruction, let . Since , we have . The degree-two initial forms of are
They are linearly independent over in . Thus no nonzero constant linear combination of the belongs to , and their classes are independent in . Since the three generators span that quotient,
Two global generators would span it by two vectors, which is impossible. This is the initial-form lower bound for ideal generators; it shows why height two does not force two generators, even though height one and height three behave as above.
Use on the target and on the source, so the map of coordinate rings sends to . A closed point of the real affine line corresponds to a maximal ideal generated either by , , or by a monic irreducible quadratic . The scheme-theoretic fibre over that point has coordinate algebra
Here is the residue field, and in the real-point case. The fibre is a scheme, so its nilpotents must be retained.
For , put . The factors , , are pairwise coprime, with the last one irreducible over . The Chinese remainder theorem identifies with , giving three irreducible components.
For , put . The exact factorization is
Each quadratic has discriminant , and they are distinct and coprime. Thus , giving two irreducible components.
For , . It has one prime ideal, generated by the class of , so one irreducible component. It is not the reduced point : its class of is a nonzero nilpotent element with nilpotency index four.
Finally write the irreducible quadratic as , with . Over , has four roots above and four above . They are all simple, because , and the two sets are disjoint. None is real. Conjugation pairs them into four distinct irreducible real quadratics. Hence and this fibre has four irreducible components.
Target closed-point typeReal coordinate algebra of the fibreIrreducible components
,
,
Irreducible quadratic
All fibres in each row are isomorphic as affine schemes over . The rows are distinct: their numbers of irreducible components already distinguish them, and the zero fibre is additionally nonreduced. Therefore
These are ordinary scheme components, not geometric components counted after complexifying the base. Counting only real roots would miss both the complex-residue factors and the nonreal closed points.

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