The James–Stein estimator in the specified unit-variance model is
with an arbitrary value at , a probability-zero event. The risk of is . Gaussian Stein identity states for suitably integrable differentiable functions; it extends to the present singular function by truncation, since makes finite.
Put and . Then and . Expanding the quadratic risk and applying Stein's lemma yields
Thus domination is strict for every finite .
To identify the worst-case risk, let . On , the reciprocal square is at most . On the complementary ball, the Gaussian density is at most , so its reciprocal-square integral is bounded by a constant times , tending to zero. Therefore , and from below. Hence
The second supremum is approached at infinity and need not be attained at a finite parameter.
The planar planar isoperimetric inequality is
with equality precisely for a disc. Let the positively oriented boundary be parametrized by arclength as , . Translate its mean to zero. Then , and Green's theorem gives .
The periodic Wirtinger inequality says that for a real absolutely continuous -periodic function of mean zero and square-integrable derivative,
with equality exactly for . Apply it to both coordinates and use Cauchy-Schwarz inequality:
If equality holds, the Wirtinger equalities give . The arclength condition forces and , so the boundary is a circle. A circle attains equality, making the constant optimal.
The inequality and equality characterization persist for finitely many corners. A rectifiable piecewise smooth simple closed curve has a Lipschitz arclength parametrization, with almost everywhere. Green's theorem and the absolutely continuous version of Wirtinger's inequality used above still apply. More generally one may approximate a rectifiable Jordan curve by smooth curves while preserving the limiting length and area. If the allowed isolated singularities give infinite length, the inequality is trivially satisfied in the extended sense.
At a noncritical point a holomorphic map has a local holomorphic inverse. Fibres of a nonconstant map between compact connected Riemann surfaces are finite: zeros are isolated and compactness precludes infinitely many. Around a nonbranch value , choose disjoint inverse neighbourhoods of every point in its fibre. Compactness of the remaining source ensures a sufficiently small disc about has no additional preimages. Its preimage is therefore a disjoint union of open sets each mapped biholomorphically onto that disc. This proves a finite-sheeted unbranched covering map after removing the branch fibres.
Here the word “regular” must mean locally unbranched or evenly covered, rather than the stronger modern normal-cover condition. A general holomorphic map does not give a normal covering, and the example below itself shows the distinction.
Lift a loop based at uniquely from each point of . Its endpoint defines a permutation; reversing the loop gives the inverse permutation, and concatenation gives composition. Homotopic loops yield the same endpoints. The monodromy group of a covering consists of these permutations. Removing finitely many points from a connected surface leaves it path-connected. Any two points in the same fibre can therefore be joined upstairs; the projection of that path is a loop whose lift joins them. Thus the monodromy action is transitive.
For the rational map of degree three, differentiation gives
At , the local degree is three, so a small loop around its value acts as a 3-cycle. At , the local degree is two; their distinct branch values are , and a loop around either acts as a transposition. The poles and the point at infinity are simple and unramified. A 3-cycle and a transposition generate the full symmetric group, so
The corresponding degree-three connected cover is not normal: a normal cover would have a regular monodromy action, whereas on three letters has nontrivial point stabilizers. Thus the stronger interpretation of the printed terminology cannot hold.
For an odd prime , the Legendre symbol is if , if is a nonzero square modulo , and otherwise. Euler's criterion states
If both sides vanish. Otherwise write for a primitive root . The squares are precisely the even powers of , while has order two and therefore equals . Hence , proving the criterion and the useful special case .
For odd , . Every prime divisor of this number is odd, and , so . Euler's criterion forces , hence or . A product of such primes can be only if a prime occurs to an odd power.
Suppose the primes were . Choose the odd integer (or for an empty list). None of these primes divides , since the latter is modulo each . Yet the preceding argument gives a prime divisor , outside the list. This contradiction proves infinitely many primes congruent to modulo .

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