Let have regular density , let
be its score function, and let
be its Fisher information. Regularity gives the mean-zero score identity .
Suppose an estimator has mean . Differentiating under the integral gives
The Cauchy-Schwarz inequality therefore yields
and hence the Cramér-Rao bound
In particular, an unbiased estimator of has variance at least . For an independent sample, the information is the sum of the individual informations.
In a decision problem with risk of a decision rule , a rule is minimax when
Now let be independent variables with , under squared-error loss. The sample mean is unbiased with variance , so
for every . Thus the minimax value is at most .
For the matching lower bound, choose a continuously differentiable density on that vanishes at both endpoints and has finite prior information
for example, . For , define the prior
It is supported inside the parameter space, and its information is .
Here the likelihood score is
whose Fisher information is . For any decision rule , combine it with the prior score to form the joint score
Integration by parts in , with no boundary term because vanishes there, gives
The likelihood score has conditional mean zero, so its cross term with the prior score vanishes and
Cauchy--Schwarz now proves the Van Trees inequality in this case:
The worst-case risk dominates every integrated risk, and therefore
Letting shows that every rule has worst-case risk at least . Since attains that value, the result on the minimax sample mean for a nonnegative normal location is
Suppose first that the affine variety is irreducible. If , then
Both pieces are Zariski closed in . Irreducibility forces one to equal , so either or . Thus is a prime ideal.
Conversely, suppose that is prime and that with closed in . If both were proper, the Hilbert Nullstellensatz would give
Choose and . Their product vanishes on , so , contradicting primality. Hence one piece equals . This proves the criterion of irreducibility and prime vanishing ideal:
For the semicubical parabola
consider
Certainly . Divide any polynomial by the monic polynomial as a polynomial in ; its remainder is . If this remainder lies in , then
The first summand contains only odd powers of and the second only even powers, so both vanish and . Therefore
The latter is a subring of the integral domain , hence is a domain. Thus is prime and
An affine variety of dimension is smooth at when its Zariski tangent space has dimension ; equivalently, the Jacobian criterion requires the Jacobian of its defining ideal to have rank . For this plane curve, put . Its gradient is
At the gradient vanishes, so the tangent space is all of and has dimension two rather than the curve dimension one. Hence the result on the coordinate ring and singularity of the semicubical parabola gives
Let be a nonconstant holomorphic map of degree between compact connected Riemann surfaces. At , let be the ramification index of a holomorphic map. Choose a triangulation of containing every branch value among its vertices, and lift it to .
If the target triangulation has vertices, edges, and triangles, then the lifted triangulation has edges and triangles, because no branch value lies in an edge or face interior. For a target vertex , local degree counting gives
Consequently the number of vertices above is
Writing , the Euler characteristic is therefore
Since a compact orientable surface of genus has Euler characteristic , this Triangulation proof of the Riemann-Hurwitz formula gives
or equivalently
Now extend a cubic polynomial to a degree-three holomorphic map
of the Riemann sphere. Both genera are zero, so Riemann--Hurwitz gives
The point at infinity is totally ramified with , contributing two. Thus the finite points contribute exactly two. There are consequently two cases.
If there is one finite ramification point , it has index three. Choose an affine source map sending zero to . Then
for some , and integration gives
An affine target map subtracts and rescales by , yielding .
Otherwise there are two distinct finite ramification points, each of index two. Choose an affine source map sending and to them. The derivative of is then a nonzero multiple of :
Hence
The affine target map gives
Therefore the affine normal forms of a complex cubic polynomial are precisely

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