Euler's criterion states, for an odd prime ,
Apply it to . The integer is when and when . Since those signs are distinct modulo an odd prime, the modular congruence determines the actual Legendre symbol:
This is the first supplementary law for quadratic reciprocity.
For an odd prime , the Legendre symbol is
It depends only on the congruence class of the integer . The values and distinguish a nonzero quadratic residue from a quadratic nonresidue; zero is a separate case.
Under the unital ring convention used elsewhere in this wiki, no such pair exists. In a two-element ring the elements are and . Additive cancellation forces , and the identity axiom forces . The distributive property forces products involving zero to vanish. Every operation is therefore determined, giving the prime field as the unique possibility up to ring isomorphism.
If the word ring allows a nonunital ring, there are instead two non-isomorphic examples: and the zero-multiplication rng on the additive group . In the second example the unique nonzero element satisfies and ; every product is zero, so associativity and both distributive laws hold. An isomorphism would have to send to because it preserves zero and is bijective, but then it would send to both and , which is impossible. These exhaust the rngs with two elements, since can only be or . Specifying the identity convention is essential for this part.
No field has six elements. A finite field has positive characteristic: the sequence must repeat. By part (a), this characteristic is a prime number . Translation by partitions the field into cycles of length , since returning to a starting point after steps is equivalent to . Thus divides six and or .
The multiples of form a copy of the prime field . For completeness, the inverse of a nonzero residue lies among these multiples: the integer Bezout identity gives . The entire field is a vector space over this subfield. A maximal linearly independent set is finite and spans, so it is a basis of some positive size . Unique basis coordinates give exactly elements. This proves finite field cardinality is a prime power here. But six is neither a power of two nor a power of three, a contradiction.
A suitable field with four elements is
Write for the class of . Monic polynomial division over a ring gives a unique representative , with : existence follows by division, and uniqueness follows because a nonzero multiple of the degree-two modulus cannot have degree less than two. The four elements are therefore .
The defining relation gives , and hence . Thus the nonzero elements have inverses
The quotient ring is commutative and every nonzero element is a unit, so it is a field. This verifies the field property directly, without quoting a theorem about irreducible-polynomial quotients.
No such ring exists: every finite integral domain is a field. Here is the proof. For , the map defined by is injective, since gives and therefore . An injective self-map of a finite set is surjective, so some satisfies . Since an integral domain is commutative, as well. Thus every nonzero element has a multiplicative inverse, making a field.
The conclusion still holds if an identity was not initially required. Surjectivity first gives an element with . Then implies for every , and commutativity makes a two-sided identity. Applying the preceding argument with supplies all inverses.
No such ring exists. Characteristic two gives for every . Choose a nonzero element , which exists in a five-element set. Translation is an involution without fixed points: applying it twice gives , while would force by additive cancellation. Its disjoint pairs would partition all five elements, which is impossible because five is odd.
This argument applies even to a nonunital ring. With the unital convention, it is also the case of finite ring characteristic divides cardinality.
The first-crossing maximal inequality for refining partitions follows from countable disjointness and the strict average bound:
Thus this partition maximal operator has weak-type constant one.
The conclusion of differentiation along refining metric partitions is
The crucial geometric property is shrinking diameter, not merely refinement: since and , continuity makes the corresponding oscillation tend to zero for every continuous test function. Continuous approximation and the maximal inequality then transfer this to , exactly as before: the exceptional-set bound is for an oscillation threshold . Countability makes the maximal function measurable, and positive cell measure makes every average defined. Refinement supplied the disjoint first-crossing argument; shrinking diameter supplies differentiation.
Every in the maximal superlevel set has a first index at which the average on its unique cell exceeds . Refinement implies that all earlier cells containing contain this cell, and their averages are at most . Thus and the selected cells cover the superlevel set.
Two cells at different levels are either disjoint or nested, because of refinement and the partition property. If selected cells of levels intersect, the level- one lies in the earlier cell whose average is above , contradicting its first-crossing property. Cells at the same level are disjoint unless identical. Hence the selected cells form a countable disjoint partition of the superlevel set. A cell repeated unchanged at successive levels is counted once, at its first crossing; equal earlier ancestors are included in the comparison condition.
For a set of finite measure apply the preceding result to . Since its local average minus its point value is bounded in absolute value by its mean absolute oscillation, it gives
For a general measurable , apply the same argument to . At every interior point of , sufficiently short averages agree with those of . The countable union of these interiors covers the line, and a countable union of null exceptional sets remains null. This proves the Lebesgue density theorem without a finite-measure assumption on . The source's is the indicator of .
Let denote the upper limit of the displayed mean oscillation as . For a continuous integrable approximation , continuity gives . With , the triangle inequality yields
Therefore the maximal inequality and Chebyshev's inequality give
Density makes the right side arbitrarily small. For each positive rational the exceptional set is null, proving almost everywhere, the Lebesgue differentiation theorem. Values where the chosen representative is not finite already form a null set.
For the fundamental theorem define , with oriented integration for . This function is absolutely continuous: for disjoint intervals the sum of is at most the integral of over their union, which is small when its measure is small by absolute continuity of the integral. At a Lebesgue point of , for ,
Thus almost everywhere and . Differentiability at every point is not claimed for an arbitrary integrable function.
The centered Hardy-Littlewood maximal function is
The Hardy-Littlewood maximal inequality gives, for example,
This valid constant follows from the disjoint-interval covering argument: a compact subset of the superlevel set has a finite cover by intervals of average above ; select disjoint intervals whose triples cover it, bound their total length by , and use inner regularity. An optimal constant is not required.
For the finite nonnegative measures there exist a unique nonnegative integrable density , up to -almost-everywhere equality, and a unique nonnegative measure , such that
This combines the Lebesgue decomposition theorem with the Radon-Nikodym theorem. In particular and ; if the singular term is zero.
Suppose are two such decompositions. Choose measurable supports of the singular parts with , and put . Absolute continuity makes both and vanish on . On the two singular parts vanish, so for every measurable ,
Subtracting from the finite measure gives . This proves uniqueness of the Lebesgue decomposition without subtracting infinite masses.
For the specified , the restriction to is singular because , and the complementary restriction is absolutely continuous by assumption. Their sum is . Uniqueness therefore gives
The restriction of a measure to a measurable subset is for every measurable . Absolute continuity of measures, written , means . The measures are mutually singular when a measurable satisfies and . Thus singularity means concentration on a null set of the other measure; it does not assert that every measurable set is null for one of them.
If , then , so . Suppose instead that but . The preceding construction gives with and . Then is -null with variation strictly larger than that of , a contradiction. Hence on the complement of . This is a Hahn decomposition.
On every partition has nonnegative signed measures, so for . On , vanishes. Splitting an arbitrary measurable set between these two sets gives
In particular , and the exhibited Radon-Nikodym derivative verifies the Radon-Nikodym theorem for this pair directly.
Start with . Having chosen disjoint , put and
The empty set shows , and finite total variation bounds it above. If , choose with ; if , choose . This is the required recursion, including the initial step .
Disjointness and nonnegativity give , hence . Write . For every measurable ,
Thus every measurable subset of has nonpositive measure. Each finite partition of consequently has variation sum exactly , and therefore . It follows that . Finally countable additivity gives
From now on , so all signed quantities below are finite. Since , the set function
is nonnegative. Countable additivity follows from that of the two terms, so is a finite positive measure.
Set . This is finite. Choose measurable with and . Then
is -null by countable subadditivity, and monotonicity gives . The definition of gives the reverse inequality. Hence attains the maximum, rather than merely approximating it.
For a signed measure define its total variation measure by
The value at the empty set is zero. For disjoint measurable sets with union , any finite partition of gives
Taking the supremum proves one inequality. In the reverse direction choose, for the first sets, finite partitions approaching their variation values. Combining these partitions and the remaining set gives
If one term is infinite, its partition sums can instead be made arbitrarily large. Letting and proves countable additivity, including infinite values. Thus is a positive measure. This uses only countable additivity of , without assuming a Hahn decomposition.

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