For , the bound gives , whose tail integral is finite. Thus is integrable.
Near one, has an integrable inverse-square-root singularity. At infinity, however, for , and the harmonic tail diverges. Thus is not integrable. Assigning changes neither conclusion, since one point has Lebesgue measure zero.
On , , so . For the second function,
Both functions are measurable, and therefore both restrictions are Lebesgue integrable. The oscillation of near zero does not affect absolute integrability on this finite interval.
Since , the previous part and closure under addition prove measurability of the absolute value.
The converse fails. Choose a nonmeasurable subset of and define on , on its complement. Then is measurable, whereas is not. Thus measurability of does not imply measurability of .
If is measurable, then for , , and for , . Thus the given superlevel criterion proves measurable. Part 2 makes measurable, and the same argument applied to proves measurable.
Conversely . If both parts are measurable, part 2 and the permitted closure under addition prove measurable. Therefore is measurable exactly when its positive and negative parts are measurable.
For each real ,
The final strict-superlevel set is measurable by part 1 and the given criterion for measurable functions. A complement relative to the measurable domain is measurable, so is measurable.
Use the countable identity
If , some has , proving the nontrivial inclusion. Each preimage on the right is measurable by statistical hypothesis, so closure of a sigma-algebra under countable unions proves the strict-superlevel preimage is measurable.
Again . By Euler's criterion, . If , the exponent is even and the answer is one. If , it is odd and the answer is . Hence
Write . If , both sides of the proposed identity are zero. Otherwise . The multiplicativity of the Legendre symbol and Euler's criterion give
For the middle equality, Euler's congruence determines the sign exactly, since both the symbol and are in and is odd.
The Legendre symbol is
It depends only on the residue class of modulo the odd prime .
Reduce the monic integer polynomial modulo . Every satisfies , so . Thus the reduction has no root in . If it had a proper factor, part 2 would force such a root, a contradiction. Hence it is irreducible over .
The criterion of irreducibility by degree-preserving reduction modulo a prime, which follows from Gauss's lemma, now applies because the polynomial is monic and its degree is preserved on reduction. Consequently is irreducible in .
The intended hypothesis must be a proper monic factor, with . Without that restriction the printed deduction is false: every polynomial has the displayed trivial factorization with , even when it has no root in .
By part 1, the roots in a splitting field are distinct and have the form . The degree- monic factor is the product of corresponding linear factors. Comparing the coefficient of using Vieta's formulas gives
Both and the sum of prime-field elements lie in . Since , the scalar is nonzero and invertible in . Therefore , and part 1 proves the polynomial splits into distinct linear factors over . In particular an Artin–Schreier polynomial of prime degree is either irreducible or splits completely.
In field characteristic , the intermediate binomial coefficients in the th power vanish. Hence
Repeated translation gives all roots , . They are distinct because the prime field embeds in . They exhaust the roots by degree; also the formal derivative of is , so this is a separable polynomial. If one root belongs to , they all do, and
This is the root-translation property of an Artin–Schreier polynomial.
Suppose the unique optimum were for distinct feasible points and . Feasibility is preserved by convex combinations. Optimality gives and , while linearity gives their strictly weighted average equal to . Both inequalities must therefore be equalities. Then and are also optimal, contradicting uniqueness. Hence the unique optimum is an extreme point of the feasible set.

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